The Lean and Mathlib communities have confirmed the correctness of the proof of the Riemann hypothesis published by Stanford University mathematician Levent Alpöge on November 20, 2026. The proof is written in Lean, a language that allows mathematical reasoning to be checked for errors, and spans 17 million lines of code. Dozens of people independently ran the verifier and got the same result. The Riemann hypothesis describes the distribution of prime numbers and has long been one of mathematics’ best-known unsolved problems.
The Lean community confirms the proof of the Riemann hypothesis
Lean verification
The Lean and Mathlib communities said they were completely confident in the proof’s correctness and congratulated Alpöge on the result. The verification programs are designed so that it is mathematically provable they cannot accept an incorrect proof. Independent checks are listed on the website of Andrew Sutherland, a mathematician at the Massachusetts Institute of Technology.
Source: the-decoder.com
Expectations proved too cautious
The solution came much earlier than forecasters expected. According to Ethan Mollick, participants on the Metaculus platform expected the hypothesis to be proved by May 2035. Last month, mathematician Terence Tao said he thought the problem would be solved around 2050 through a combination of human and AI work.
Dataist's take: This case shows how formal verification can confirm a result encoded as code and let many specialists independently reproduce the check. However, the source reports specifically that the Lean and Mathlib communities confirmed the result and that people independently ran the verification programs; this should not be confused with an account of every stage of the proof’s mathematical review.
Daily AI news
Every day we pick what actually matters in AI and explain it plainly — no hype, no filler. Subscribe if you want to follow where the industry is going.
Only what matters — every day
Follow on X