Lean Riemann Hypothesis proof passes major verification checks
Andrew Sutherland’s verification page reports that the published Lean source for a proof of the Riemann Hypothesis compiles without errors, with its five headline theorems depending only on three standard axioms. It says every module passed a Lean kernel replay, independent comparators accepted all five theorems, and a sandboxed build reproduced the published export byte for byte. Some default and paranoid kernel runs and the lake comparator were still in progress, while one compiled module varied non-deterministically.
The reported checks provide independent machine-verification evidence for the AI-assisted formal proof, including kernel replay and statement comparison, though the page notes that some final runs remained underway.
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-22 02:25 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. The --compare modes of con-leche and of its Rust port con-ron, independent implementations of Comparator's statement matching, each confirm all five theorems against the challenge. An independent sandboxed lake build of the archive reproduces the export byte for byte. The lake comparator run and the Lean-kernel replay of the export are still in progress.
#Lean#Mathlib#Claude Code#nanoda#con-leche#con-ron#Robin1984