The computer proof of the Riemann Hypothesis that Lean’s teams certified on Saturday is huge. The whole build checked by MIT’s Andrew Sutherland ran to 175,187 modules, about 21 times the 8,322 files it uses from Mathlib, Lean’s shared maths library, by our arithmetic on his verification page.
Anthropic mathematician Levent Alpöge says he found the proof working with Claude. The Lean statement puts the library at 17 million lines of code.
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 Lean proof of the Riemann Hypothesis is a 17-million-line library; the whole build Andrew Sutherland checked spans 175,187 modules, about 21 times the 8,322 Mathlib files it uses, by our arithmetic, and independent checkers accepted it in minutes.
How Big the Proof Is
Alpöge released the proof on 20 November “as a Lean library comprising 17 million lines of code”, the Lean FRO and the Mathlib Initiative say. The code depends directly only on Mathlib.
Sutherland’s page says all 175,187 modules compiled with zero errors, and the Lean kernel replayed every one with zero rejections. It counts the Mathlib files used at 8,322, plus 378 other dependency files, all identical to the official copies.
The 175,187 is the whole build, Mathlib included. Even so, it is about 21 times the number of Mathlib files it uses, by our arithmetic. One independent checker, con-leche, accepted 1,468,418 declarations in the full export.

How Fast the Machines Checked It
nanoda, an independent checker written in Rust, accepted the full proof in 27 minutes 42 seconds on 80 threads, the page says. con-leche took 3 minutes 15 seconds on 64 threads.
The Lean statement says that “over the past day” parts of the community rallied to verify it, so certification came about a day after release. Sutherland says he ran his checks with Claude Code.
For scale, Mathlib’s own statistics page counts 142,131 definitions and 296,300 theorems, built by 772 contributors.
Why Size Matters Here
The Lean statement says two of the checkers, con-leche and con-ron, come with a formal proof that they cannot accept a false proof, addressing “concerns that Lean’s logic itself might have flaws that the proof could exploit”. The checks ran on an inert export, “out of reach of hypothetical malicious code”.
“The argument is incredibly long at the moment,” Alpöge wrote in his note. He adds that it is “routine to produce a huge, unreadable document containing sufficient detail”.
The Structural Read
As we read it, the size is the reason the machine check matters: no human referee reads 17 million lines, so trust rests on several independent checkers agreeing.
As we read it, the Lean teams’ call for work explaining the new ideas shows where attention goes next: understanding, not checking.
Levent Alpoge, 20 Nov 2026
“The argument is incredibly long at the moment”
Three Implications
FOR MATHEMATICIANS Alpoge calls the argument incredibly long; machines have checked it.
FOR AI LABS Alpoge credits Claude; Sutherland ran his checks with Claude Code.
FOR READERS the 21x compares file counts, not difficulty.
What Is Not Established
The Lean teams say they look forward to work “that will help explain the new ideas in this proof”. Sutherland’s page notes some checks were still running when it was last updated.
The 21 times is a file-count comparison of the whole build, not a measure of mathematical difficulty. The checker times come from different machines and thread counts, so they are not a like-for-like race. For the basics, see our Riemann Hypothesis explainer.
The Bottom Line
The certified Riemann proof is a 17-million-line Lean library whose full build spans 175,187 modules, about 21 times the 8,322 Mathlib files it uses, by our arithmetic. The Lean statement says the community verified it over about a day.
97,000+ executives read Business Engineer for the AI strategy frameworks cited by ChatGPT, Claude, and Perplexity.
Correction, 21 Nov 2026: an earlier version described the 8,322 files as all of Mathlib; they are the Mathlib files used in this build, per Andrew Sutherland’s verification page. The headline and chart have been corrected.
A note on sourcing. Module counts, Mathlib file counts, declaration counts and checker times come from Andrew Sutherland’s verification page, read in full; some checks there were still running at its last update. The 17 million lines and the certification come from the Lean statement. The 21 times is our arithmetic (175,187 divided by 8,322).
Sources: Andrew Sutherland (MIT), verification files for the Lean proof of the Riemann Hypothesis, updated 21 Nov 2026 · Lean FRO and Mathlib Initiative, ‘Lean verification of the Riemann Hypothesis’, 21 Nov 2026 · Levent Alpoge, remark announcing the proof, 20 Nov 2026 · Mathlib statistics page, read 21 Nov 2026 · FourWeekMBA, Lean certifies Claude-aided Riemann proof, 21 Nov 2026









