Verification files for the Lean proof of the Riemann Hypothesis

Source: math.mit.edu
51 points by Bluestein 4 hours ago on hackernews | 18 comments

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.

Summary

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.

CheckResultDetail
All 175,187 modules compile (Lean v4.33.1, Mathlib v4.33.1)passzero errors; finished 16:43:21 UTC
#print axioms for the five theorems in Main.leanpasspropext, Classical.choice, Quot.sound only (audit.log)
No axioms declared outside Lean corepass15 axioms in the environment, all in Init
Mathlib files identical to the official cachepass8,322 Mathlib and 378 dependency .olean files, byte for byte
leanchecker kernel replay of every modulepass175,187 of 175,187; zero rejections; finished about 18:17 UTC
Challenge export equals the one published by Deicyde/riemann-hypothesis CImatchsha256 bd484ac9…b2b9
nanoda (independent Rust kernel) on the full exportacceptsexit 0 at 19:05:45 UTC; 27 min 42 s on 80 threads (nanoda.log)
Lean default kernel and Lean paranoid kernel on the exportrunningsingle-threaded; no verdict yet
lake comparator (Lean v4.36.0) end to endrunningstatement comparison and axiom check already passed in one run; kernels in progress
con-leche master (cd2eceab) on the full exportaccepts1,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 solutionacceptsall 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 modulepass175,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.0declinedexit 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.0not applicablecannot 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.

1. 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 condition s ≠ 1 is 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

2. 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

3. 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 < s.re → (χ ≠ 1 ∨ s ≠ 1) → DirichletCharacter.LFunction χ s ≠ 0

4. Zeros in the critical strip lie on the critical line, for every Dirichlet L-function.

theorem LFunction_eq_zero_re :
  ∀ (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N) (s : ℂ),
    0 < s.re → s.re < 1 → DirichletCharacter.LFunction χ s = 0 → s.re = 1 / 2

5. The same for primitive characters, the form in which the Generalized Riemann Hypothesis for Dirichlet L-functions is usually stated.

theorem LFunction_eq_zero_re_of_isPrimitive :
  ∀ (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N), χ.IsPrimitive →
    ∀ s : ℂ, 0 < s.re → s.re < 1 → DirichletCharacter.LFunction χ s = 0 → s.re = 1 / 2

Scope. "GRH" here means Dirichlet L-functions: all moduli and all characters. Dedekind zeta functions, Hecke L-functions and automorphic L-functions in general are not among the statements that were checked.

Arithmetic consequences

As a check that does not depend on Mathlib's definition of the zeta function, the proof was combined with kimihiro64/Robin1984 (commit acab1a3), an independent formalization of Robin's and Lagarias's criteria on the same Lean and Mathlib versions. Importing both gives two theorems about the divisor sum, with no hypotheses and no mention of zeta (ArithSolution.lean; statements alone in ArithChallenge.lean, which imports only Mathlib):

theorem robin_inequality :
    ∀ n : ℕ, 5040 < n →
      ((ArithmeticFunction.sigma 1 n : ℕ) : ℝ) <
        Real.exp Real.eulerMascheroniConstant * (n : ℝ) * Real.log (Real.log (n : ℝ))

theorem lagarias_inequality :
    ∀ n : ℕ, 0 < n →
      ((ArithmeticFunction.sigma 1 n : ℕ) : ℝ) ≤
        (harmonic n : ℝ) + Real.exp (harmonic n : ℝ) * Real.log (harmonic n : ℝ)
Robin1984 on its own (its three equivalences with RH)ResultDetail
Robin1984 builds with lake buildpass4,435 jobs, exit 0
con-leche master and --compareaccepts69,293 declarations accepted; all three theorems justified against its own challenge (log)
Unmodified Comparator v4.33.0 with the repository's own configpassnanoda accepts, Lean default kernel accepts, "Your solution is okay!"; exit 0 at 03:31:06 UTC (log summary)
lake comparator (Lean v4.36.0) from exportspassLean paranoid kernel, nanoda and Lean default kernel all accept; "Your solution is okay!"; exit 0 at 04:16:52 UTC (log summary)
The two inequalities (RH proof combined with Robin1984)ResultDetail
robin_inequality and lagarias_inequality compile; #print axiomspasspropext, Classical.choice, Quot.sound only (audit)
con-leche master on the full combined exportaccepts1,472,825 declarations accepted in --verified mode; exit 0 at 02:29:56 UTC (log)
con-leche --compare against ArithChallengeacceptsboth theorems "justified by the solution"; exit 0 at 02:29:06 UTC (log)
nanoda on the full combined exportacceptsexit 0 at 02:56:46 UTC; 33 min 46 s on 64 threads (log)
lake comparator (Lean v4.36.0) on the combined exportrunningstatement comparison and axiom check passed; its Lean kernel stages are single-threaded on a 62 GB export and are expected to take many hours, as for the main proof

The combined export is 61,752,134,938 bytes, sha256 44651dcc482a6e06e8d626994221aff638e422fded189bf856e0c31176926f0d; its challenge export has sha256 088a57c9e7454fa5279a86a825e551828ac8431694855aadd1f6e6a6eb37bb1d. These statements still rely on Mathlib's definitions of the divisor sum, Euler's constant, harmonic numbers, exp and log, and on the Robin1984 proof, which is why that proof was put through the same checks.

Downloads

The exported proof: output of lean4export on module Main. Unpacks to 61,570,595,788 bytes.

compressed sha256 61a8938ad5f5e57397c1c0e3b954916af546d9004ade01c3555744a681b05381

unpacked sha256   5ea74b912147c5c93cc2b6d70cc727cf908df2f62ac6a20480a3fa02f6be244e

The exported challenge: the five statements with sorry proofs, importing only Mathlib. Unpacks to 350,862,970 bytes.

unpacked sha256   bd484ac9886a96f26b1d9a7a59ebd45b7a70d102c015d4f31f9302bbdd6ab2b9

Smaller files:

Check it yourself

With Lean v4.36.0 installed, nothing needs to be built. You need roughly 100 GB of RAM and 70 GB of disk.

zstd -d --long=30 solution.ndjson.zst      # --long=30 is required
zstd -d --long=27 challenge.ndjson.zst
sha256sum solution.ndjson challenge.ndjson  # compare with the hashes above

lake comparator --config comparator.json \
  --challenge-from-export challenge.ndjson --solution-from-export solution.ndjson

nanoda alone took about 28 minutes on 80 threads. The Lean kernels are single-threaded and take much longer.

The fastest independent check is con-leche built from source (Lean v4.36.0, about two minutes to build). It needs about 50 GB of RAM and took under four minutes on 64 threads:

git clone https://github.com/leanprover/con-leche && cd con-leche
git checkout compare        # 5dc36dc1; master (cd2eceab) for the plain check
lake build con-leche
.lake/build/bin/con-leche --compare challenge.ndjson solution.ndjson

Provenance

ItemValue
Source archivelean.tar.gz, the 14 parts from alpo.ge joined; 239,275,554 bytes
sha256 9631b4f020199e580ba86178cb56c6e9b09f690c2369a80dc4334aa93f49c7fc
Source mirrorDeicyde/riemann-hypothesis, byte-identical to the archive apart from the Comparator files it adds
Lean / MathlibLean v4.33.1 (commit 819816b2); Mathlib tag v4.33.1 (0df444a3)
Exporterlean4export tag v4.33.0 (15f6055e), built with Lean v4.33.1; target list as in Deicyde's export-targets.txt
Judge and extra kernelsLean v4.36.0: lake comparator, leanchecker, leanchecker-paranoid, nanoda_bin
lean4leandigama0/lean4lean at 67f63b0c, built with Lean v4.33.1; run on the compiled .olean files, not the export
con-lecheleanprover/con-leche master at cd2eceab and branch compare at 5dc36dc1, each built with Lean v4.36.0
Main.oleansha256 9146dfb4148e24d2252e04c50742f3e49dd126dfcc5006d10bf5f873ddf796ad
Manifest of all compiled filessha256 375cbee2fc3fc0f5088ef2e6dc9a5ac5530924310dc62422ec65aac9dc4c1d25
valid only for the build directory /home/ubuntu/grh/src/lean; see the note below
Build directorythe archive's lean/ directory was at /home/ubuntu/grh/src/lean on every build machine, so each source file was passed to Lean as /home/ubuntu/grh/src/lean/src/<Module/Path>.lean

Caveats

  • The build ran on cloud machines without a sandbox, and compiled each file by calling lean directly with the same inputs lake supplies (module name, package name and the lakefile's options), not through lake build.
  • The per-file .olean hashes 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, including Main.olean, contain no path. So project-oleans.sha256 and 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: a lake build of 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, by lake build and by our direct invocation, were byte-identical. We have not compared the full set against a lake 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.