What is Lean: the programming language that checks math proofs
Lean turns a proof into code that a small trusted kernel checks step by step, which is how a 17-million-line Riemann hypothesis proof could be verified.
Every ClaudeGPT Si story about Lean, newest first: news, analysis, reviews and guides.
9 stories · Updated
Lean turns a proof into code that a small trusted kernel checks step by step, which is how a 17-million-line Riemann hypothesis proof could be verified.

A Princeton PhD and former Harvard junior fellow who works on points on curves, he released a Lean proof of the Riemann hypothesis made with Claude on November 20.

A proof would cap the prime-counting error at about √x log x and confirm many conditional theorems, but RSA rests on factoring, which the hypothesis does not touch.

Lean and Mathlib maintainers say Levent Alpöge's Claude-assisted proof proves the right statement, assumes nothing extra and passes independent checkers.
Alpöge and Buckmaster say smooth flows blow up with no outside force, but the certificate behind the proof is unreleased and Clay's process takes years.
The 79-page paper, written with Claude, says smooth flows blow up with no outside force, but its key certificate is not yet released.

It says every nontrivial zero of the zeta function lies on the line with real part 1/2. Two proofs were claimed on November 20, 2026, one made with Claude, and neither is verified.

He released only a Lean formalization, split into 14 files, and says the method also proves the Generalized Riemann Hypothesis. No one has verified it yet.

Proof assistants such as Lean check every step of a proof. AI now writes those proofs, including 43 million lines of Lean for one of math's longest theorems.