Deterministic Miller-Rabin Falls Into P After Quasi-Riemann Breakthrough

Building on last week's quasi-Riemann number theory progress, researchers including Anthropic's Geoffrey Irving showed that deterministic Miller-Rabin primality testing now falls into P, with an estimated complexity of about (log n)^9.9984.

2026-10-15 ~ 2026-10-15 · 2 related posts

• Deterministic Miller-Rabin primality testing now in P after last week's breakthrough, ~O((log n)^9.9984) — geoffreyirving · 2026-10-15
• Quasi-Riemann Result Puts Deterministic Miller-Rabin in P, a Newly Solved Open Problem — geoffreyirving · 2026-10-15