The Information Machine
Updated todayDay 2in the edition since 21 Nov 20266 sources

Alpöge's Riemann Hypothesis proof in Lean code

The gist

Latest: Alpöge-Claude Riemann Hypothesis Proof Under Active Lean Verification

If the Lean proof verifies correctly and survives expert scrutiny, it would resolve a 167-year-old conjecture central to prime number distribution, with broad consequences across mathematics. The process also raises questions about how AI-assisted formal proofs should be evaluated when no human-readable preprint accompanies a machine-checked archive.

When stories like this move, I write about them in an email each morning.

One free email each morning, around 8 AM US Eastern.

The full picture

Levent Alpöge, a mathematician at Anthropic, has stated he believes he and Claude discovered a proof of the Riemann Hypothesis, covering also the Generalized Riemann Hypothesis and potentially the Extended Riemann Hypothesis. The proof was formalized as machine-checkable Lean code and an archive was released publicly. Within hours of release, an independent verification project confirmed the downloaded archive matched Alpöge's mirror and that top-level theorem statements compiled against Lean's Mathlib library, but full automated replay of the entire proof was still running as of that report. Alpöge has not released a human-readable preprint, which experts consider a critical missing step. Experts say all 14 archive files must compile cleanly, axioms must be disclosed, and the final theorem must be verified against Mathlib's standard Riemann hypothesis statement authored by David Loeffler and Michael Stoll. The Clay Mathematics Institute had not recognized the solution as of the reports, and its rules require peer-reviewed publication, a two-year waiting period, and broad community acceptance. Separately, DataCamp documented that Claude produced a verified improvement to a specific quantitative question that mathematicians have worked on since Montgomery introduced his techniques in 1973, reviewed by Alpöge, Ralph Furman, Brian Conrey, and Dan Goldston, who said the result stands and is significant and interesting.

How it developed
21 November 2026in the 22 Nov edition

A Columbia and MIT paper published November 21 reports that Claude found an algorithm beating long-standing speed limits for 3SUM and all-pairs shortest paths, by computing selected entries of a product of two long, thin matrices more efficiently than classic methods, with known reductions yielding speedups for related problems.

The result stands apart from Alpöge's still-unresolved Lean-formalized proof claim, against which Terence Tao had recently stated that present AI was not capable of solving the Riemann hypothesis.

First in the edition · 21 November 2026
20 November 2026in the 21 Nov edition

An independent verification project confirmed Alpöge's proof archive compiled against Lean's Mathlib library, the first external check of a claim by Levent Alpöge, an Anthropic mathematician, to have proved the Riemann Hypothesis with Claude.

Full automated replay was still running, and experts said all 14 archive files must compile, axioms be disclosed, and the final theorem verified against Mathlib's standard statement. Alpöge has released no human-readable preprint, and the Clay Mathematics Institute had not recognized the solution, its rules requiring peer-reviewed publication and a two-year waiting period.

Sources
1 more source

Get the daily email

When stories like this move, I write about them in an email each morning.

One free email each morning, around 8 AM US Eastern.

See the latest edition · Privacy