Anthropic mathematician Levent Alpöge says he found a proof of the Riemann hypothesis working with Claude. The Lean and Mathlib communities have since reported that independent proof checkers accepted the argument and that it proves the standard statement of the hypothesis.
The Clay Mathematics Institute still lists the problem as unsolved as of 22 November 2026, New Zealand time. The two updates answer different questions. The Lean checks tell us whether the formal argument holds. Clay’s listing records the institute’s recognition of the result.
Where things stand
Independent machine checks have passed. The Lean and Mathlib communities say they have full confidence in the proof. Clay still lists the problem as unsolved.
What Alpöge announced
In a note dated 20 November, Alpöge describes an October-to-November collaboration with Claude and credits the model with helping develop the argument near the finish. He released the argument as a library for Lean, a language and proof assistant that lets a computer check each deduction against formal rules. The Lean community puts the library at about 17 million lines of code. Alpöge also reported that the method extends to the generalised Riemann hypothesis for Dirichlet L-functions.
Read Alpöge’s original note and timeline (PDF).
What the hypothesis says
Prime numbers thin out as numbers get larger, but their spacing is irregular. Riemann found that the zeros of a function now called the Riemann zeta function encode information about how the actual count of primes deviates from its expected trend. The hypothesis says that all the nontrivial zeros, the ones relevant to this question, lie on a vertical line where the real part equals one-half. A proof would give mathematicians strong bounds on how far the count of primes can stray from its expected value.
Watch the zeta function take shape
3Blue1Brown’s visual explainer shows what the zeta function does and where the vertical line comes from. It’s background for readers coming to the problem for the first time.
Watch or read the illustrated lesson on 3Blue1Brown.
What independent verification found
The Lean and Mathlib communities first isolated the accepted mathematical statement. Two comparison tools matched Alpöge’s theorem to that independently defined target. Several proof checkers, including Lean’s official checker and separately implemented tools, then accepted the exported proof. This is substantially stronger evidence than a report that the files merely compiled: the checks cover both what the code proves and whether its proof is valid under the formal rules.
Read the Lean and Mathlib joint statement or see MIT mathematician Andrew Sutherland’s verification records.
What happens next
Mathematicians can now work through the argument, explain its central ideas in a form people can read and investigate what the method can do elsewhere. Clay follows a separate process for a Millennium Prize. Its rules call for qualifying publication, at least two years after that publication and general acceptance by the mathematics community before a proposed solution can be considered for the prize.
Check the Clay Mathematics Institute’s problem page.
What New Zealand teams can take from this
The transferable part is the way the result was checked. For a business testing AI-generated work, define the expected result independently, then test the output against it. If a model builds an invoice reconciliation, for instance, compare its totals with a known ledger and test cases, and have someone investigate discrepancies before approving it. Here, the checker could verify a mathematical deduction. In a business workflow, the equivalent might be a test suite, a reconciliation against source records or review by the person responsible for the decision.
Related coverage: What Anthropic’s Nasdaq listing means for Claude customers.
