The Lean and Mathlib communities say they have verified Levent Alpöge’s Riemann Hypothesis proof—not merely persuaded a mountain of code to compile. Lean is software for writing and checking mathematical proofs; Mathlib is its mathematics library. Their joint statement, announced on November 21, reports that the code proves the intended mathematical statement and that multiple tools checked the exported proof. Source Source Source
“We hereby certify that both the statement and the proof of the Riemann Hypothesis are correct,” says the statement, endorsed by the Lean FRO and Mathlib Initiative. Source
According to the statement, Alpöge released the proof on November 20, 2026, as a Lean library comprising 17 million lines of code. The hypothesis dates to Bernhard Riemann in 1859 and concerns a pattern in the distribution of prime numbers, as Scientific American explains. Source Source
How the communities checked it
- Start with the right mathematical statement. The statement says Mathlib’s formal definition of the Riemann Hypothesis has been carefully vetted by experts in Lean and number theory. Source
- Reproduce the build. Dozens of people have reported compiling Alpöge’s library successfully and producing the same raw proof export file, according to the statement. Source
- Make sure the code proves that statement. The community isolated the Riemann Hypothesis statement in a file importing only Mathlib, then compared it with Alpöge’s theorem using two independent tools:
comparator and con-leche –compare. Both confirmed an exact match, the statement says. Proving a neighboring theorem would be a spectacularly inconvenient technicality. Source
- Check the exported proof. The statement reports successful checks by Lean’s official kernel (its core proof-checking component),
con-leche, con-ron and several independent third-party checkers implemented in different programming languages. Source
Those proof checks used an inert export of the proof: data the checkers could examine without executing the original Lean sources. The statement says this kept the checks out of reach of hypothetical malicious code in those sources. It also says and come with formal proofs, relative to set theory, that they cannot accept a false proof. That qualification is part of the guarantee—not disposable fine print.
Comments