The Riemann Hypothesis, a 167-year-old question about how prime numbers are spread out and one of the Millennium Prize Problems, now has a proof that machines have checked line by line. On 21 November the Lean and Mathlib communities, in a statement endorsed by the Lean FRO and the Mathlib Initiative, said: “We have full confidence that Alpöge’s proof of the Riemann Hypothesis is correct.”
Mathematician Levent Alpöge released the proof on 20 November as a Lean library of about 17 million lines. In his own statement he writes: “I believe I have, working with Claude, discovered a proof,” and says Anthropic’s AI model “far outpaced me near the finish line”. He also claims the method extends to the Generalized Riemann Hypothesis.
the proof was checked by Lean’s own kernel and by several independent checkers written in different programming languages, which is why experts could trust it within a day of release. Trust is not the same as understanding, though. Alpöge calls the argument “incredibly long at the moment”, and the Lean statement looks forward to the mathematical community helping to “explain the new ideas in this proof”. Anthropic had published no statement as of 22 November.



