Verification files for the Lean proof of the Riemann Hypothesis
Summary
Verification files for the Lean proof of the Riemann Hypothesis Announced at alpo.ge/remark.pdf on 20 November 2026. Andrew Sutherland (MIT), checks run with Claude Code. Page last updated 2026-11-21 12:55 UTC. Results below are as of that time and this page will be updated as the remaining checks finish.
The published Lean source compiles without errors, the five headline theorems depend only on the three standard axioms, every module has been replayed through the Lean kernel, two independently written kernels, nanoda and con-leche, accept the full exported proof, and lean4lean accepts every compiled module.
con-leche's --compare mode, an independent implementation of Comparator's statement matching, confirms all five theorems against the challenge. The lake comparator run and the Lean-kernel replay of the export are still in progress.
Results
| Check | Result | Detail |
|---|---|---|
| All 175,187 modules compile (Lean v4.33.1, Mathlib v4.33.1) | pass | zero errors; finished 16:43:21 UTC |
#print axioms for the five theorems in Main.lean |
pass | propext, Classical.choice, Quot.sound only (audit.log) |
| No axioms declared outside Lean core | pass | 15 axioms in the environment, all in Init |
| Mathlib files identical to the official cache | pass | 8,322 Mathlib and 378 dependency .olean files, byte for byte |
| leanchecker kernel replay of every module | pass | 175,187 of 175,187; zero rejections; finished about 18:17 UTC |
| Challenge export equals the one published by Deicyde/riemann-hypothesis CI | match | sha256 bd484ac9β¦b2b9 |
| nanoda (independent Rust kernel) on the full export | accepts | exit 0 at 19:05:45 UTC; 27 min 42 s on 80 threads (nanoda.log) |
| Lean default kernel and Lean paranoid kernel on the export | running | single-threaded; no verdict yet |
| lake comparator (Lean v4.36.0) end to end | running | statement comparison and axiom check already passed in one run; kernels in progress |
| con-leche master (cd2eceab) on the full export | accepts | 1,468,418 declarations accepted in --verified mode; exit 0 at 21:19:04 UTC; 3 min 15 s on 64 threads (log) |
con-leche --compare (branch compare, 5dc36dc1): challenge against solution |
accepts | all five theorems "justified by the solution"; 51,692 challenge declarations accepted; exit 0 at 21:19:12 UTC (log) |
| lean4lean (67f63b0c, built with Lean v4.33.1) on the compiled files, module by module | pass | 175,187 of 175,187; finished about 21:55 UTC. 175,182 passed with default settings. Five hit lean4lean's default step limit ("deterministic timeout") on decide +kernel computations and passed when rerun with the limit raised (timeouts, reruns with flags) |
| con-leche and con-ron as bundled with Lean v4.36.0 | declined | exit 2, not a rejection: those older binaries do not support one reflexive inductive type in the proof. con-leche master, above, does. (log, log) |
| lean4lean bundled with Lean v4.36.0 | not applicable | cannot read a v4.33 core library (unknown constant 'Decidable.intro') |
What was verified
Five theorems, proved in the submission's Main.lean. Their statements are below exactly as they appear in the challenge file, which imports only Mathlib. All the mathematical notions in them (riemannZeta, DirichletCharacter, DirichletCharacter.LFunction, IsPrimitive) are Mathlib's.
- The Riemann Hypothesis, using Mathlib's own definition (
Mathlib/NumberTheory/LSeries/RiemannZeta.lean): every zero of ΞΆ other than the trivial zeros β2, β4, β6, β¦ has real part 1/2. The conditions β 1is there because Mathlib assigns ΞΆ a conventional value at its pole.
def RiemannHypothesis : Prop := β (s : β) (_ : riemannZeta s = 0) (_ : Β¬β n : β, s = -2 * (n + 1)) (_ : s β 1), s.re = 1 / 2
theorem riemannHypothesis : RiemannHypothesis
- The same statement written out in the submission's own words. Lean accepts the two as equal by definition.
theorem riemannZeta_eq_zero_re : β s : β, riemannZeta s = 0 β (Β¬β n : β, s = -2 * ((n : β) + 1)) β s β 1 β s.re = 1 / 2
- No zeros to the right of the critical line, for every Dirichlet L-function. For every modulus N β₯ 1 and every Dirichlet character Ο modulo N, primitive or not, L(Ο, s) β 0 whenever Re s > 1/2. The one excluded case is the trivial character at s = 1, where the L-function has its pole.
theorem LFunction_ne_zero_of_half_lt_re : β (N : β) [NeZero N] (Ο : DirichletCharacter β N) (s : β), 1 / 2
Caveats
- The build ran on cloud machines without a sandbox, and compiled each file by calling
leandirectly with the same inputslakesupplies (module name, package name and the lakefile's options), not throughlake build. - The per-file
.oleanhashes depend on the build directory. In Lean v4.33.1 a compiled file stores each linter message together with the absolute path of its source file. Of our 175,187 compiled files, 98,219 contain the path/home/ubuntu/grh/src/lean/src/β¦; the other 76,968, includingMain.olean, contain no path. Soproject-oleans.sha256and its sha256 can be reproduced in full only by a build whose source tree is at/home/ubuntu/grh/src/lean. For a build at any other path, only the files of modules that emit no linter messages should match. What we checked: alake buildof 240 modules on a different machine, at a different path, gave 168 files identical to the manifest and 72 different; all 72 contain that build's path and none of the 168 do. Separately, 77 modules compiled both ways in the same directory, bylake buildand by our direct invocation, were byte-identical. We have not compared the full set against alake build. - The exported proof (
solution.ndjson) is the artifact the independent kernels checked. Its hash is the one to compare across builds; we have not examined whether the export format can carry a source path. - The export was produced from that unsandboxed build. We have not ourselves compared its sha256 with an export made from a sandboxed lake build.
- A passing check shows that the formal statements, as written in Lean against Mathlib's definitions, follow from the three standard axioms according to the kernels used. It relies on those kernels and on Mathlib's definitions being what they are intended to be.
Comments
No comments yet. Start the discussion.