AI researcher proposes harder test: no O(n²) randomized algorithm for n-bit primes conjecture

geoffreyirving · x · 2026-11-21

AI safety researcher Geoffrey Irving: now that the Riemann hypothesis apparently is too easy for AIs, we should switch to harder conjectures. He offers a 2020 conjecture as an example:

> Conjecture (2020): There is no O(n²) expected-time randomized algorithm to generate ≥n-bit primes.

A notable signal of the AI-math arms race — researchers are now picking targets harder than Millennium Prize Problems as new benchmarks for AI.

Related event: DeepMind researcher asks what comes after Riemann — number theorists have no answer(8 posts)→

Original post →

More from AGI Musings

AGI Musings channel →