🔍 Read the full analysis: What Was Checked In The Riemann Hypothesis Work Involving Claude? on ThorstenMeyerAI.com
Get business pricing on tech for your team
- Business-only prices and quantity discounts
- Tax-exempt purchasing
- Multiple users, one account, clear invoices
TL;DR
Mathematician Levent Alpöge said he and Claude had found proofs of the Riemann Hypothesis and the stronger Generalized Riemann Hypothesis, releasing a 17.4-million-line Lean archive. Early reports said the code compiled, but a comparator test and sustained mathematical review were still needed; no proof had been accepted.
Mathematician Levent Alpöge, who works at Anthropic, posted a note on November 20 saying he believed he had proved the Riemann Hypothesis with Claude, and extended the result to the Generalized Riemann Hypothesis. The accompanying Lean code reportedly compiled in an initial independent check, but a key comparator test was still pending and no mathematical body had accepted the proof.
Alpöge’s four-page note does not present a conventional, readable proof. Instead, it sketches some ideas, gives a 20-step timeline and links to a Lean archive split into 14 parts. Lean is software used to formalize mathematics and check whether each step follows from stated assumptions and rules. Computer scientist Scott Aaronson put the archive at 17.4 million lines of Lean code. Alpöge said a human-readable rendering would exceed 250,000 pages and described that format as an unreadable “travesty,” explaining that he chose to publish the formalization instead.
The note makes three linked claims: that Alpöge and Claude found a proof of the Riemann Hypothesis; that the method extends to the Generalized Riemann Hypothesis; and that they formalized the argument in Lean “without assumptions.” The account of how the work was divided also comes from Alpöge. He said he set the strategy, while Claude handled much of the technical development, and wrote that “Claude far outpaced me near the finish line.” He also acknowledged having “little mastery” of one of the main areas involved. The note does not identify which Claude model was used.
Early reports described some checks, not a mathematical verdict. MIT mathematician Andrew Sutherland told Scientific American that the code compiled independently “with only the three standard axioms.” Kevin Buzzard wrote that a “comparator run” was still awaited. That test is intended to check that the formalized result matches the intended mathematical statement, rather than establishing a different result or relying on an unintended shortcut. The source reports that this key check had not yet been completed.
Explainer · Riemann hypothesis claim
From claim to accepted proof: six checks, and where this one stands
What the hypothesis says, and the path every proof claim has to take before mathematicians accept it.
The claim in one picture
Riemann’s guess (1859): every non-obvious zero of the zeta function lies on this one line. If true, the primes are spread out as evenly as possible.
The checks a proof claim must pass
- 1Claim postedA 4-page note plus Lean code, November 20, 2026✓ done
- 2Code compiles elsewhereIndependent compile reported by an MIT mathematician✓ reported
- 3Comparator runRight statement? Only standard axioms? Several Lean kernels?… pendingWe are here · November 21, 2026
- 4Humans understand itA readable proof that experts can follow○ open
- 5Journal publicationA refereed mathematics journal of worldwide repute○ open
- 6Two years + general acceptanceWhat the Clay prize rules require before a $1 million award○ open
Sources: Clay Mathematics Institute (Riemann Hypothesis page; Millennium Prize rules); Levent Alpöge, remark.pdf (November 20, 2026); Scientific American, November 20, 2026 (independent compile; comparator run awaited); Kevin Buzzard, Xena Project, November 12, 2026 (the checks). Status as reported in these sources by November 21, 2026.
Graphic: Powered by Thorsten Meyer AI
Why a Formal Proof Would Matter
The Riemann Hypothesis concerns the locations of certain zeros of the Riemann zeta function and their connection to the distribution of prime numbers. A proof would settle a long-standing problem and could establish results in number theory that currently depend on the hypothesis being true. The Clay Mathematics Institute lists it as one of its Millennium Prize Problems, with a $1 million prize subject to the institute’s rules.
The scale of the Lean archive makes the checking process central to this claim. A formal proof can let software verify that encoded steps follow within a specified system, but compilation alone does not show that specialists have confirmed the proof’s mathematical meaning or that it establishes the exact claim. The case also draws attention to a new research question: how mathematicians should review major results when AI is credited with much of the technical work and the formal version is too large for ordinary line-by-line reading.
For now, the practical significance is conditional. If the formalization proves what Alpöge says it proves and survives expert scrutiny, the result could be historic. Until those checks are completed and mathematicians accept the argument, it remains an extraordinary, unverified claim—not a settled change to number theory.
Products Worth Considering

Jackery HomePower 3600 Plus Portable Power Station

DJI Mini 3 Drone with DJI RC Controller

Sony WH-1000XM6 Wireless Noise-Cancelling Headphones – Midnight Blue
As an affiliate, we earn on qualifying purchases.
The Claim and Its Checking Process
The Riemann Hypothesis dates to Bernhard Riemann’s 1859 work. In the Clay Mathematics Institute’s description, it asserts that all the “non-obvious” zeros of the zeta function have real part one-half. The conjecture has been checked computationally for the first 10 trillion solutions, according to the institute, but checking a finite number of cases cannot prove a statement about infinitely many cases.
Formal proof checking addresses a different problem: translating a mathematical argument into a system whose rules can be checked by software. It can detect gaps or invalid steps in the encoded derivation, but reviewers still need to establish that the formal statement corresponds to the intended theorem and that the work’s assumptions and methods are appropriate. In this case, the note offers only a brief sketch alongside the code, leaving the large formal archive as the main object for review.
At the time described by the source, Anthropic had not announced the result on its news page, and Nature reported that the company did not immediately respond to a request for comment. The source article also disclosed that it was researched and drafted with AI assistance, including Claude, and said Anthropic had not reviewed or sponsored it.
“I believe I have, working with Claude, discovered a proof of the Riemann Hypothesis.”
— Levent Alpöge, in his note
The Checks Still Outstanding
The most immediate unresolved issue in the source account was the comparator run, which Buzzard said was still awaited. The source does not report its result. Nor does it establish that mathematicians had completed a full review of the Lean archive or agreed that it proves either the Riemann Hypothesis or its generalized version.
Other details remain unavailable: the specific Claude model, the full division of work, and a human-readable proof that specialists could assess alongside the formal code. Experts quoted in early coverage differed in their initial reactions. Terence Tao described the work as an “(enormous) Lean-only proof,” while Andrew Granville called the released note “garbled.” Neither remark, by itself, settles whether the formalization is correct.
The note’s appearance also does not start the Clay prize process or establish that its conditions have been met. The source says the institute requires publication in a refereed journal, at least two years of scrutiny and general acceptance by mathematicians. There is no reported publication or acceptance at this stage.
Next Steps for the Lean Archive
The immediate milestone is the pending comparator test, followed by scrutiny of the archive by mathematicians familiar with the relevant fields and Lean formalization. Those checks would need to establish both that the code is valid in its formal system and that it proves the stated conjectures.
Further developments could include a clearer account of the argument, a response from Anthropic, and submission to a refereed journal. None was confirmed in the source account as of November 21, 2026. Even if the archive passes technical checks, the Clay Institute’s publication, review and acceptance requirements would still apply before any prize decision.
Key Questions
What did Alpöge claim?
He said he believed he and Claude had proved the Riemann Hypothesis and that their method extended to the Generalized Riemann Hypothesis. These remain claims pending verification and acceptance.
What was checked in the early review?
Andrew Sutherland told Scientific American that the Lean code compiled independently using the three standard axioms. That is an initial software check. A separate comparator run was still pending in the source account.
Does a successful compilation prove the hypothesis?
Not by itself. Compilation indicates that the encoded proof passes checks within Lean’s formal system. Specialists still need to confirm that the formalized statement matches the conjecture and that the argument is accepted mathematically.
How large is the proof archive?
The archive is divided into 14 parts. Scott Aaronson put it at 17.4 million lines of Lean code; Alpöge said a human-readable rendering would exceed 250,000 pages.
Has the Clay Mathematics Institute awarded the prize?
No. The source reports no accepted proof or prize decision. The institute’s process requires refereed publication, at least two years of scrutiny and general acceptance by mathematicians.
Source: ThorstenMeyerAI.com
