Deterministic Miller-Rabin primality testing now in P after last week's breakthrough, ~O((log n)^9.9984)
geoffreyirving · x · 2026-10-15
Geoffrey Irving points out that as a corollary of last week's number theory breakthrough, deterministic Miller-Rabin primality testing is now in P — a problem that was open before. Per Claude's estimate, the complexity is about O((log n)^9.9984 · (log log n)^(-8.3×10⁻¹¹)). He calls on tuners to optimize it further, asking if it can be made faster than AKS.
Related event: Deterministic Miller-Rabin Falls Into P After Quasi-Riemann Breakthrough(2 posts)→
More from Research
- 167,356 simulated shop-days: paper shows eval world design writes the model behavior it scores — liminal_bardo · 2026-10-15
- Multilingual NLP roadmap: researcher maps open problems from data selection to LID across 350+ languages — StellaLisy · 2026-10-15
- Beyond RAG: Injecting Tensor Memory Cartridges Into Layer-3 of a Frozen LLM — Nearby_Indication474 · 2026-10-15
- Cohere Labs: more coding agents isn't a scaling strategy — when to delegate work — pvncher · 2026-10-15
- UCLA paper: productivity tech like AI can trigger a workplace "rat race" that hurts welfare — soumitrashukla9 · 2026-10-15
- Initialization matters far more than expected in LLM-driven scientific discovery, new study finds — BenBlaiszik · 2026-10-15