🔍 Read the full analysis: How To Understand The Claude-Assisted Riemann Hypothesis Claim on ThorstenMeyerAI.com
Prime made for students and young adults
- Fast, free delivery for dorm and study essentials
- Prime Video and Amazon Music included
- Member-only deals
TL;DR
Levent Alpöge, a mathematician employed by Anthropic, posted a note saying he believes he and Claude proved the Riemann hypothesis and a broader related conjecture. The proposed proof is a 17.4-million-line Lean archive, not a peer-reviewed paper; early checks are reported, but a key comparison test and expert understanding remain outstanding.
Mathematician Levent Alpöge, who works at Anthropic, posted a note on November 20 saying he believes he and the company’s AI assistant Claude have proved the Riemann hypothesis, a famous unsolved problem about prime numbers. The proposed proof has not been accepted by mathematicians: it is presented chiefly as a large Lean code archive, and important verification work remains.
Alpöge’s four-page note says he and Claude also proved the Generalized Riemann Hypothesis, a wider family of related claims. The note offers a short sketch and timeline, then links to a Lean archive divided into 14 parts. Lean is software that checks whether a formalized mathematical argument follows from its stated assumptions. Computer scientist Scott Aaronson estimated the archive at 17.4 million lines of Lean code. Alpöge said a human-readable rendering would exceed 250,000 pages and did not publish it.
The description of who did what comes from Alpöge’s own account. He says he guided the strategy while Claude handled much of the technical work, writing that “Claude far outpaced me near the finish line.” He also says he has “little mastery” of one of the main areas involved. The note does not identify which Claude model was used. Terence Tao characterized the result as an “(enormous) Lean-only proof.”
Initial checks are not the same as acceptance. 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, a check intended to test whether the formalization proves the intended statement. The note itself does not provide a conventional, readable proof for mathematicians to assess.
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 Proof Would Matter
The Riemann hypothesis is a central conjecture in number theory because it connects the zeros of the Riemann zeta function with how prime numbers are distributed. A proof would settle a problem open since the 19th century and support many results that are currently established only conditionally on the hypothesis being true. The Clay Mathematics Institute lists it among its Millennium Prize Problems, each carrying a $1 million prize under the institute’s rules.
The scale of the claim makes the verification process as important as the headline. A formal checker can confirm that code follows logical rules, but experts still need to establish that the formal statement matches the intended hypothesis and that the proof’s construction is sound and meaningful. If verified and accepted, the result could have wide mathematical consequences; at present, those consequences remain conditional on the claim holding up.
Products Worth Considering

Logitech MX Mechanical Wireless Illuminated Keyboard, Tactile Quiet, Graphite

LG 27GS60QC-B Ultragear 27-inch Curved Gaming Monitor (QHD, 180Hz, 1ms, 1000R)

Jackery HomePower 3600 Plus Portable Power Station
As an affiliate, we earn on qualifying purchases.
From Prime Numbers to Lean Code
In 1859, Bernhard Riemann connected questions about the apparent irregularity of prime numbers to the zeta function. The hypothesis says that all its non-obvious zeros have real part one-half. The Clay Mathematics Institute says the conjecture has been checked for the first 10 trillion solutions, but checking a finite number of cases cannot establish a statement about infinitely many zeros.
Alpöge’s note does not set out a standard paper-length argument. He says he chose to publish the Lean material rather than what he called a “massive unreadable travesty” of a human-readable version. The archive therefore places unusual weight on independent technical checks and on mathematicians’ ability to understand what the formalized result says. Anthropic had not announced the claim on its news page as of November 21. Nature reported that the company did not immediately respond to its request for comment.
“I believe I have, working with Claude, discovered a proof of the Riemann Hypothesis.”
— Levent Alpöge, in his November 20 note
What Verification Has Yet to Establish
The central unknown is whether the Lean archive proves the intended Riemann hypothesis and its generalized version without a flaw or mismatch between the formal statement and the mathematical claim. The reported compilation check is only one part of that assessment; the comparator run mentioned by Buzzard was still pending in the available reporting. No journal has published the result, and no mathematical body has accepted it.
It is also unclear how quickly specialists can inspect the archive, whether they will be able to extract a human-understandable argument, and what role Claude played beyond Alpöge’s description. Anthropic had not publicly confirmed or explained the work, and the model used was not named. Andrew Granville called the released note “garbled,” while Tao’s description underscores how difficult the proof may be to read. These reactions do not settle whether the proof is correct.
Checks Before Any Prize Review
The next step is independent mathematical and technical scrutiny of the Lean archive, including the pending comparator check and a determination that the formal proof corresponds to the claimed results. Researchers will also need to examine the argument and identify any errors or assumptions not made clear in the note. A successful software check would be evidence to evaluate, not the end of that process.
The Clay Mathematics Institute’s prize rules require publication in a refereed journal, at least two years of scrutiny, and general acceptance by the mathematics community. The institute’s prize clock has not started. Until those requirements and the underlying checks are met, the development remains an extraordinary but unverified claim.
Key Questions
Has the Riemann hypothesis been proved?
Not on the evidence available so far. Alpöge says he believes he and Claude proved it, but no journal or mathematical body has accepted the result.
What did Alpöge publish?
He posted a four-page note with a short sketch and a link to a 14-part Lean archive. The archive is the main formal proof material; the note does not include a conventional, readable proof.
What does Lean verification show?
Lean checks whether formalized steps follow from stated rules and assumptions. Reported compilation is a useful technical check, but experts must still verify that the code establishes the intended mathematical claim.
Did Claude prove the result by itself?
The available account is Alpöge’s: he says he guided the strategy and Claude did much of the technical work. The model is not identified, and the division of work has not been independently documented.
Could this claim receive the $1 million Clay prize?
The Riemann hypothesis is a Clay Millennium Prize Problem, but the prize process requires journal publication, at least two years of scrutiny, and general acceptance. Those conditions have not been met, so the prize clock has not started.
Source: ThorstenMeyerAI.com
