← Home

Alpöge/Claude proof of the Generalized Riemann Hypothesis

On 20 November 2026 Levent Alpöge announced a proof, found with Anthropic's Claude, of the Riemann Hypothesis and of the Generalized Riemann Hypothesis for Dirichlet L-functions. The proof was released as a formal proof in the Lean proof assistant: 175,187 files, about 17 million lines. This page links to my own check of that Lean proof and to checks made by others.
— Michael Rubinstein

The proof explained for the Riemann zeta function

The Alpöge–Claude proof of the Riemann hypothesis explained for the Riemann zeta function (PDF, 164 pages; working draft, 21 November 2026)

A working guide to the proof, specialised to the Riemann zeta function, written with Claude, Codex and Gemini as an aid to studying it. It aims at a human-readable account in the style of classical analytic number theory. It deduces the Riemann hypothesis from one inequality between weighted sums over primes, called (M), and two estimates for Dirichlet characters, and proves the two estimates from theorems in the literature. The inequality (M) is not proved there: its proof is taken from the Lean development. The paper writes up parts of that proof and states exactly which inputs it takes from the Lean development. It is a work in progress.

Lean verification

mrubinst.github.io/grh-lean-verification

That page records a check of the Lean proof run with Claude Code on University of Waterloo compute servers, starting from the archive Alpöge published. It shows the five theorems exactly as they are stated in Lean, with an explanation of why they say what RH and GRH for Dirichlet L-functions say, and a scan of all the source files for anything that could introduce an unproved assumption. It then reports each machine check with its status and output: a full compile of all 175,187 modules, the list of axioms the theorems depend on, a replay of every module through Lean's kernel, and a check by a second, independently written kernel (nanoda).

Result (21 November 2026). All four checks finished with no errors. All 175,187 modules compile. The five theorems depend only on Lean's three standard axioms. A replay of every module through Lean's kernel accepted all 175,187. The independent kernel nanoda checked the 1,484,729 declarations that the theorems depend on, with no typechecker errors.

The page also describes how the checks were run, and the repository contains the scripts, so that anyone can repeat them. A dated log records each step, including the problems met along the way.

Verifications by others