10-line deterministic polynomial-time primality test relies on OpenAI's recent quasi-GRH result, making AKS obsolete
fortnow · x · 2026-11-11
A researcher shows you can test primality deterministically in polynomial time with 10 lines of Python, using Gary Miller's 50-year-old algorithm — but the proof requires OpenAI's recent quasi-GRH result. The AKS primality test, which won the Gödel and Fulkerson prizes in 2006, is now considered obsolete. A striking sign of AI-produced mathematical results influencing foundational algorithms.
More from AGI Musings
- DeepMind researcher: millions of AI agents could transform the economy while GDP grows just 4-5% — soumitrashukla9 · 2026-11-12
- Stanford HAI brief argues AI agents should be fiduciaries bound to users' best interests — StanfordHAI · 2026-11-12
- Design roles may merge into PM as AI shifts ownership, designers warn — lennysan · 2026-11-12
- UK companies scale back hiring due to overspending on AI — HotMinuteUK · 2026-11-12
- AI doomer predicted doom within ten years nine years ago — it still hasn't happened — birchlse · 2026-11-12
- Model collapse explained: what happens when AI trains on AI-written internet content — alifcoder · 2026-11-12