cd /news/artificial-intelligence/verification-files-for-the-lean-proo… Β· home β€Ί topics β€Ί artificial-intelligence β€Ί article
[ARTICLE Β· art-173829] src=math.mit.edu β†— pub= topic=artificial-intelligence verified=true sentiment=Β· neutral

Verification files for the Lean proof of the Riemann Hypothesis

Andrew Sutherland of MIT reported on 20 November 2026 that the published Lean source for a claimed proof of the Riemann Hypothesis compiles without errors across all 175,187 modules under Lean v4.33.1 and Mathlib v4.33.1, with the five headline theorems depending only on the three standard axioms propext, Classical.choice and Quot.sound. Two independently written kernels, nanoda and con-leche, accepted the full exported proof, and lean4lean passed 175,187 of 175,187 compiled modules, though five hit its default step limit on decide +kernel computations and passed only when rerun with the limit raised. The lake comparator run and the Lean-kernel replay of the export were still in progress as of 2026-11-21 12:55 UTC.

recommendation

Verify large Lean proofs with multiple independent kernels and raise lean4lean's step limit when decide +kernel modules hit the default deterministic timeout.

more in playbook: Evals and testing for LLM apps
read10 min views1 publishedNov 21, 2026

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.

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 inMain.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 (branchcompare ,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.

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) Result Detail
Robin1984 builds with lake build pass 4,435 jobs, exit 0
con-leche master and--compare accepts 69,293 declarations accepted; all three theorems justified against its own challenge ( log )
Unmodified Comparator v4.33.0 with the repository's own config pass nanoda 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 exports pass Lean 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) Result Detail
robin_inequality andlagarias_inequality compile;#print axioms pass propext ,Classical.choice ,Quot.sound only (audit )
con-leche master on the full combined export accepts 1,472,825 declarations accepted in --verified mode; exit 0 at 02:29:56 UTC (log )
con-leche --compare againstArithChallenge accepts both theorems "justified by the solution"; exit 0 at 02:29:06 UTC ( log )
nanoda on the full combined export accepts exit 0 at 02:56:46 UTC; 33 min 46 s on 64 threads ( log )
lake comparator (Lean v4.36.0) on the combined export running statement 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 #

solution.ndjson.zst7.7 GB (7,699,933,588 bytes)

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

challenge.ndjson.zst47 MB

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

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 #

Item Value
Source archive lean.tar.gz , the 14 parts from alpo.ge joined; 239,275,554 bytessha256 9631b4f020199e580ba86178cb56c6e9b09f690c2369a80dc4334aa93f49c7fc
Source mirror Deicyde/riemann-hypothesis , byte-identical to the archive apart from the Comparator files it adds
Lean / Mathlib Lean v4.33.1 (commit 819816b2 ); Mathlib tagv4.33.1 (0df444a3 )
Exporter lean4export tag v4.33.0 (15f6055e ), built with Lean v4.33.1; target list as in Deicyde'sexport-targets.txt
Judge and extra kernels Lean v4.36.0: lake comparator ,leanchecker ,leanchecker-paranoid ,nanoda_bin
lean4lean digama0/lean4lean at67f63b0c , built with Lean v4.33.1; run on the compiled.olean files, not the export
con-leche leanprover/con-lechemaster atcd2eceab and branchcompare at5dc36dc1 , each built with Lean v4.36.0
Main.olean sha256 9146dfb4148e24d2252e04c50742f3e49dd126dfcc5006d10bf5f873ddf796ad
Manifest of all compiled files sha256 375cbee2fc3fc0f5088ef2e6dc9a5ac5530924310dc62422ec65aac9dc4c1d25 valid only for the build directory /home/ubuntu/grh/src/lean ; seethe note below
Build directory the 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 inputslake supplies (module name, package name and the lakefile's options), not throughlake 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, includingMain.olean , contain no path. Soproject-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: alake 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, bylake build and 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.
── more in #artificial-intelligence 4 stories Β· sorted by recency
── more on @andrew sutherland 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain β€” perfect for shipping the agent you just read about.

$git push zahid main
β†’ Live at https://your-agent.zahid.host βœ“
Get free account β†’ Pricing
from €0/mo Β· no card required
LIVE [news/verification-files-f…] indexed:0 read:10min 2026-11-21 Β· β€”