Independent checkers accept Lean proof of the Riemann Hypothesis
Five theorems depend only on three standard axioms; two kernel replays of the export were still running.
Andrew Sutherland published verification results for a Lean proof of the Riemann Hypothesis announced on November 20, with checks run using Claude Code. As of November 21, all 175,187 modules compiled on Lean v4.33.1, and independent kernels nanoda, con-leche and lean4lean accepted the proof or compiled modules. The five checked statements cover the Riemann Hypothesis and Dirichlet L-functions, not Dedekind, Hecke or general automorphic L-functions. Combining the proof with an independent Robin–Lagarias formalization yields two unconditional divisor-sum inequalities.
- Axiom audit found only propext, Classical.choice and Quot.sound.
- nanoda accepted the full export in 27 minutes 42 seconds on 80 threads.
- con-leche accepted 1,468,418 declarations and matched all five challenge theorems.
- Five lean4lean modules needed a raised step limit after deterministic timeouts.
- Older con-leche and con-ron binaries declined because of an unsupported inductive type, not a failed proof.
- Organizations
- MIT
- AI models
- Claude Code
Coverage
oldest first · one row per article · UTCLean community certifies a formal proof of the Riemann Hypothesis
Levent Alpöge's Mathlib-only library is about 17 million lines and was checked by several independent kernels.
Independent checkers accept Lean proof of the Riemann Hypothesis
Five theorems depend only on three standard axioms; two kernel replays of the export were still running.
Lean community confirms Alpöge's Riemann hypothesis proof is correct
He published 17 million lines of Lean on November 20, 2026; independent runs matched, years before forecast dates.