Lean Community Certifies Riemann Hypothesis Proof

Original: Lean verification of the Riemann Hypothesis

Why This Matters

First formally verified proof of a Millennium Prize problem signals a new era for machine-checked mathematics.

On Nov 20, 2026, mathematician Levent Alpöge published a 17-million-line Lean proof of the Riemann Hypothesis. Within 24 hours, dozens of community members verified compilation and multiple independent checkers confirmed the proof's validity.

Levent Alpöge released a Lean library on November 20, 2026, claiming a proof of the Riemann Hypothesis — one of mathematics' most famous unsolved problems, worth a $1 million Millennium Prize. The library spans 17 million lines of code and depends solely on Mathlib, Lean's mathematical library.

The Lean and Mathlib communities, backed by the Lean FRO and Mathlib Initiative, issued a joint statement certifying the proof correct. Their confidence rests on four checks. The formal statement matches Mathlib's vetted `RiemannHypothesis` entry. Dozens of independent users successfully compiled the codebase, producing identical raw proof export files. Two independent tools — `comparator` and `con-leche --compare` — confirmed the proved theorem matches Mathlib's statement exactly. Finally, multiple proof checkers — including Lean's official kernel, `con-leche`, `con-ron`, and third-party checkers written in different programming languages — all accepted the exported proof.

Notably, `con-leche` and `con-ron` carry formal proofs, relative to set theory, that they cannot accept a false proof, directly addressing concerns about exploitable flaws in Lean's logic. Checks ran on a static export, isolating them from any potentially malicious code in the proof source. Full technical details are available at math.mit.edu/~drew/grh/.

Source

leanprover-community.github.io — Read original →