The Riemann Hypothesis is a statement about prime numbers that Bernhard Riemann made in 1859 and nobody could prove for 167 years, by our arithmetic. On 21 November 2026 the teams behind the Lean proof software certified a computer proof of it, after Anthropic mathematician Levent Alpöge said he found one with Claude.
This explainer covers what the hypothesis says, why mathematicians care, what the Lean check means and what is still left to happen.
We track what AI systems can do in mathematics and other tests on our AI model benchmarks page.
Business Pill: The Cost of Checking
An evergreen Business Engineer explainer on the cost of checking work. It teaches the general idea only and does not discuss the Riemann proof.
The key insight: The Riemann Hypothesis, stated in 1859, says the zeta function’s non-obvious zeros all have real part 1/2; Clay says it was checked for 10 trillion cases, and on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified a 17-million-line computer proof.
What Does the Riemann Hypothesis Say?
Prime numbers are whole numbers that cannot be split into two smaller whole numbers multiplied together, such as 2, 3, 5 and 7. They do not follow a regular pattern.
Riemann noticed that how often primes appear is tied to a function now called the Riemann zeta function, ζ(s) = 1 + 1/2s + 1/3s + 1/4s and so on, the Clay Mathematics Institute explains.
The hypothesis says that all the “non-obvious” zeros of that function, the points where it equals zero, are complex numbers with real part 1/2. In picture terms, they all sit on one vertical line.

Why Does It Matter?
“The prime number theorem determines the average distribution of the primes. The Riemann hypothesis tells us about the deviation from the average,” Clay says. In plain words: it says how far the primes can stray from their expected spread.
Clay says it had been checked for the first 10,000,000,000,000 solutions, 10 trillion. Checking examples is not a proof, which is why a proof that covers every case has been the prize.
Does a Proof Break Internet Encryption?
RSA, the most common scheme of its kind according to the US standard FIPS 186-5, relies on “the intractability of factoring integers that are products of two sufficiently large, distinct primes”, according to a US NIST standard.
As we read it, that makes the fear misplaced. Clay describes the hypothesis as being about how far primes deviate from their average spread, while NIST ties RSA’s safety to factoring being hard.
How Old Is the Problem?
Riemann stated it in his 1859 paper. David Hilbert put it on his list of 23 problems in a Paris address on 9 August 1900, Clay notes, 41 years later by our arithmetic.
Clay made it one of seven Millennium Prize Problems on 24 May 2000, with $1 million for each solution. That was 141 years after Riemann’s paper, and the certification came 167 years after it, by our arithmetic.
What Did Lean Certify?
Lean is software that checks a proof step by step, down to the basic rules of logic. “We hereby certify that both the statement and the proof of the Riemann Hypothesis are correct,” the Lean FRO and the Mathlib Initiative said on 21 November.
Their statement says Alpöge released the proof on 20 November as a Lean library of 17 million lines of code. The statement checked is the one already in Mathlib, Lean’s shared maths library, and several independent proof checkers accepted the proof.
The proof uses only Lean’s three standard axioms, according to a verification page kept by Andrew Sutherland of MIT, who says he ran the checks with Claude Code.
The Structural Read
As we read it, the certification answers whether the proof is correct; it does not yet answer why it works, which is what the human write-up is for.
As we read it, the open question now is explanation: the Lean check settles correctness, while mathematicians still need a readable account of the new ideas.
Clay Mathematics Institute
“The prime number theorem determines the average distribution of the primes. The Riemann hypothesis tells us about the deviation from the average.”
Three Implications
FOR READERS NIST ties RSA’s safety to factoring large numbers being hard.
FOR MATHEMATICIANS the proof is machine-checked; a readable paper is still to come.
FOR THE PRIZE Clay requires publication, two years and general acceptance.
What Is Not Established
There is no human-readable paper yet. Alpöge calls the argument “incredibly long at the moment” in his note, and the Lean teams say they look forward to work “that will help explain the new ideas in this proof”.
The $1 million is not awarded. Clay’s rules require publication in a qualifying outlet, at least two years since publication, and general acceptance by mathematicians.
The Bottom Line
The Riemann Hypothesis says the zeta function’s non-obvious zeros all have real part 1/2, which pins down how primes are spread out. A 17-million-line Lean proof was certified on 21 November; a readable paper and the Clay process are still ahead.
97,000+ executives read Business Engineer for the AI strategy frameworks cited by ChatGPT, Claude, and Perplexity.
Frequently Asked Questions
What is the Riemann Hypothesis?
A statement from Bernhard Riemann's 1859 paper that all the non-obvious zeros of the Riemann zeta function are complex numbers with real part 1/2. It describes how prime numbers deviate from their average spread, per the Clay Mathematics Institute.
Has the Riemann Hypothesis been proved?
On 21 November 2026 the Lean FRO and the Mathlib Initiative certified that a 17-million-line Lean proof released by Levent Alpoge on 20 November is correct. A human-readable paper has not been published yet.
Would a proof break RSA encryption?
NIST says RSA's security relies on the difficulty of factoring the product of two large primes. Clay describes the Riemann Hypothesis as being about how far primes deviate from their average spread. Neither source says a proof breaks RSA.
Who gets the $1 million Clay prize?
No one yet. Clay's rules require publication in a qualifying outlet, at least two years since publication and general acceptance by mathematicians.
A note on sourcing. The definition, the 10 trillion checked solutions and the prize history come from the Clay Mathematics Institute’s pages. The certification is from the Lean statement and Andrew Sutherland’s verification page. The encryption point quotes a NIST standard. The year counts are our arithmetic.
Sources: Clay Mathematics Institute, Riemann Hypothesis problem page · Clay Mathematics Institute, The Millennium Prize Problems · Clay Mathematics Institute, Millennium Prize rules · Lean FRO and Mathlib Initiative, ‘Lean verification of the Riemann Hypothesis’, 21 Nov 2026 · Andrew Sutherland (MIT), verification files for the Lean proof, updated 21 Nov 2026 · Levent Alpoge, remark announcing the proof, 20 Nov 2026 · NIST SP 800-56B Rev. 1, integer factorization cryptography









