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 Riemann hypothesis, newest first: news, analysis, reviews and guides.
6 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.

RH is about the zeros of one function; GRH makes the same claim for every Dirichlet L-function, so it includes RH. Alpöge's unverified claim covers both.

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.