OpenAI claims Artin’s primitive root conjecture (infinitude)
Awaiting review
Importance: major (4 of 5)The takeaway
Family 029 of OpenAI’s 6 Oct 2026 release claims that every integer other than −1 and the squares is a primitive root modulo infinitely many primes, at least c·x/(log x)² of them in each interval (x, 2x). Before, this was known only under the generalized Riemann hypothesis (Hooley, 1967) or for all but at most two prime bases (Heath-Brown, so one of 2, 3, 5 works), not for any single named base such as 2. The argument rests on the release’s own zero-free half-planes. Frank Calegari calls the argument interesting but ‘not at all surprising’ once quasi-RH is known. Manjul Bhargava has posted a positive-density strengthening.
Status
- Claim
Awaiting review
- Our reporting
- Medium confidence
- Verification
- Preprint only
- Importance
- Major (4 of 5)
- Last verified
- 29 October 2026
Your AI and this story
- GPT-6 Astra159 days after its cutoff
- Claude Opus 5.598 days after its cutoff
- Gemini 4 Argon189 days after its cutoff
- Grok 4.7128 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 98 days before it.
Key facts
- Theorem 1.1 (verbatim): ‘For every admissible integer a, there are constants ca > 0 and xa ≥ 2 such that, for every real x ≥ xa, #{p prime : x < p < 2x, p ∤ a, ordp(a) = p − 1} ≥ ca x/(log x)².’ The paper: ‘The predicted counting scale is x/ log x … In particular, it proves the infinitude assertion for each fixed admissible integer, including the prescribed base 2.’ 92 pages, dated 4 Oct 2026; companion ‘Simultaneous primitive roots: a conditional lower bound for prime bases’ (21 pp.)
- Prior state (paper, §1.1): Hooley proved Artin’s predicted asymptotic assuming the Riemann hypothesis for the relevant Dedekind zeta functions (1967); unconditionally, Gupta and Murty gave a set of thirteen integers one of which works, and Heath-Brown ‘proved that at most two prime bases fail the infinitude assertion, so at least one of 2, 3, 5 satisfies it’ (verbatim), without identifying which
- Method: a zero-free half-plane for Hecke L-functions over cyclotomic fields from a cubic theta input, a quadratic large sieve, and ‘marked Type II estimates’ to count primes with p − 1 equal to a small cofactor times one large prime. A blog commenter (‘DH’, 9 Oct) noted that the write-up contains a zero-free region Re s > 999999/1000000 for finite-order Hecke characters of cyclotomic fields containing ζ12. No Lean scope note
- Frank Calegari (Persiflage, 8 Oct, verbatim): ‘the argument is a little bit different, but also not at all surprising’; ‘this is an interesting type of argument which I don’t find particularly surprising. But no one was going to write this paper, which depends on the quasi-Riemann hypothesis for Dirichlet L-functions, without knowing anything about general Dedekind L-functions.’
- Follow-ups: Dean Cureton and Jesse Thorner (Hexagon, 12 Oct) prove a quasi-Riemann hypothesis for every Dedekind zeta function (Re s > 31/32), building on the zero-free argument of this family (see Cureton and Thorner, with AxiomProver, extend the quasi-Riemann zero-free half-plane to every Dedekind zeta function (Re s > 31/32, Lean-formalized)). Manjul Bhargava (Hexagon 2610.00228, 14 Oct, mixed human and AI text): ‘a positive lower density of primes have a as a primitive root’, using Cureton–Thorner’s half-plane and ‘the marked Type II estimates of OpenAI’; ‘The argument gives a lower bound rather than the exact Artin density.’ His provenance note mentions handwritten notes, ‘a conversation with Peter Sarnak’, GPT-6 and a Lean check of the deductions only
- Scientific American (8 Oct) listed Artin’s conjecture among the release’s other important number-theory results, without expert comment
What happened
A number a is a primitive root modulo a prime p when its powers run through every nonzero residue. Emil Artin conjectured in 1927 that every integer other than −1 and perfect squares is a primitive root for infinitely many primes, with a predicted density. Christopher Hooley proved this in 1967 assuming the generalized Riemann hypothesis. Without that assumption, Gupta, Murty and Heath-Brown showed in the 1980s that at most two prime bases can fail, so one of 2, 3 and 5 works, but nobody could name a single base, not even 2, that provably works.
OpenAI’s manuscript claims the infinitude statement for every admissible base, with a lower bound of order x/(log x)² primes in each dyadic range rather than the predicted x/log x. As Calegari reconstructs it, the idea is to find primes p for which p − 1 has a special shape, a small cofactor times a large prime, so that only a few cases of Hooley’s argument need a zero-free region. That region comes from the same automorphic machinery as the release’s quasi-Riemann hypothesis.
Why it matters
Artin’s conjecture is one of the classical problems of number theory. A proof of its qualitative part for every base, without the Riemann hypothesis, would settle what has been open for almost a century, although the exact Artin density remains conjectural.
What is disputed or not yet verified
| Verification | Unrefereed manuscript, no Lean formalization; follow-ups take its estimates as inputs |
|---|
Reactions
Reactions and follow-ups
Calegari found the argument natural once quasi-RH is available, but noted that nobody would have written it without that input. Dean Cureton and Jesse Thorner extended the zero-free half-plane to every Dedekind zeta function within a week, and Manjul Bhargava posted a note (written with GPT-6, deductions checked in Lean) upgrading the count to a positive proportion of primes. No independent check of the 92-page proof itself has been published.
Sources
7 sources from 4 sites. Numbers match the chips in the text.
7 sources: 4 primary, 1 press, 2 reactions
Primary
- OpenAI: Primitive roots for every admissible integer base (4 Oct)github.com, paper
- OpenAI: Simultaneous primitive roots, a conditional lower bound for prime basesgithub.com, paper
- Hexagon 2610.00228: Every nonsquare integer not equal to −1 is a primitive root modulo a positive lower density of primes (contributed by Manjul Bhargava)hexagonmath.org, paper
- Hexagon 2610.00200: Cureton and Thorner, A quasi-Riemann hypothesis for Dedekind zeta functionshexagonmath.org, paper
Press
- Scientific American: The most exciting claims from OpenAI’s heap of new proofsscientificamerican.com, press
Reactions
- Persiflage (Frank Calegari): A Brief Digest of Some New OpenAI Results (8 Oct, item 4 and comments)galoisrepresentations.org, discussion
- oai-math-revised: community notes on the primitive-root manuscriptgithub.com, discussion
Changes
- Filed (families 001–125; manuscript introduction, Persiflage digest and comments, Bhargava’s and Cureton–Thorner’s Hexagon pages read)