# Anthropic mathematician releases a Lean-checked claimed proof of the Generalized Riemann Hypothesis made with Claude

Early independent checks report that the Lean code compiles on the standard axioms and encodes the Generalized Riemann Hypothesis. On the same day, the American Mathematical Society's president posted a separate, human-written proof draft.

- Published: 2026-11-21T06:18:37.672Z
- Canonical: https://polylog.news/ai/2026-11-21/anthropic-mathematician-releases-a-lean-checked-claimed-proo
- Publisher: Polylog (AI desk)
- Section: tech
- Sources: [Levent Alpöge (note)](https://alpo.ge/remark.pdf), [Hacker News / Math 216 blog (Ravi Vakil)](https://math216.wordpress.com/2026/11/20/hurried-announcement-alessandro-masullo-grh/), [Polylog editors](https://polylog.news), [Scientific American](https://www.scientificamerican.com/article/anthropic-mathematician-claims-to-prove-riemann-hypothesis-most-famous-problem-in-all-of-math/), [Terence Tao's blog](https://terrytao.wordpress.com/2026/11/20/unforced-euler-singularity-unforced-navier-stokes-singularity-and-the-generalized-riemann-hypothesis/)

Levent Alpöge, a mathematician employed by Anthropic, posted a [four-page note](https://alpo.ge/remark.pdf) on November 20 saying he had, "working with Claude, discovered a proof of the Riemann hypothesis," according to [Phys.org](https://phys.org/news/2026-11-anthropic-claude-math-greatest-riddle.html). Coverage of the note says the method extends to the Generalized Riemann Hypothesis (GRH). The note itself is not a readable proof. The argument exists in full only as a Lean formalization, and that is the version Alpöge chose to release. Terence Tao, the University of California, Los Angeles mathematician, [wrote on his blog](https://terrytao.wordpress.com/2026/11/20/unforced-euler-singularity-unforced-navier-stokes-singularity-and-the-generalized-riemann-hypothesis/) that Alpöge used an internal AI model to produce an "enormous" Lean-only proof of GRH. Tao pointed readers to the Lean Zulip discussion forum as the best place to follow verification.

A machine-written formal proof can fail in two ways. Either the code does not check, or it proves something other than the intended statement. Verification so far has addressed both possibilities. Andrew Sutherland of the Massachusetts Institute of Technology told [Scientific American](https://www.scientificamerican.com/article/anthropic-mathematician-claims-to-prove-riemann-hypothesis-most-famous-problem-in-all-of-math/) that the code compiles and rests only on "the three standard axioms." The mathematician Elliot Glazer reported, after a [preliminary look](https://x.com/ElliotGlazer/status/2123845630124847322), that the formalized proposition is indeed GRH. Reviewers still have to confirm that every definition the statement depends on matches the classical objects, and that check is not yet complete. The Clay Mathematics Institute still [lists the Riemann hypothesis as unsolved](https://www.tomshardware.com/tech-industry/artificial-intelligence/anthropic-mathematician-claims-to-have-solved-167-year-old-math-problem-with-claude-riemann-hypothesis-proof-allegedly-discovered-but-remains-unconfirmed). Coverage credits Claude with the key step, a long chain of theta lifts, but the note does not say which model or how much compute was used.

On the same day, Ravi Vakil, president of the American Mathematical Society (AMS), posted a "[hurried announcement](https://math216.wordpress.com/2026/11/20/hurried-announcement-alessandro-masullo-grh/)" of a proposed GRH proof by Alessandro Masullo. Vakil wrote that Brian Conrad of Stanford University had read the work for months and that it is "so far looking good." He had planned to bring Masullo to Stanford for a year to polish the write-up before any announcement. The draft is reportedly [about 940 pages](https://explainx.ai/blog/alessandro-masullo-grh-human-proof-claimed-vs-verified-november-2026) and under major revision. Two GRH claims surfaced within hours of each other, one in Lean and one in a traditional manuscript, and reviewers will check them by different methods on different timelines.

Early reporting contains errors. The Russian-language Telegram channel AI ML Big Data [attributed the Claude-assisted claim](https://t.me/ai_machinelearning_big_data/11400) to the mathematician Alexander Polishchuk. The note and English-language reporting identify Alpöge instead. Incentives matter here too. Alpöge works for a lab that listed on Nasdaq the day before. A confirmed result would be the strongest public evidence so far that a frontier model can contribute a decisive step on a Millennium Prize problem. The Lean kernel's check does not depend on Alpöge's reputation, which is why the formal release can be verified independently in a way a press statement alone cannot be.

## What this means

Formal verification shifts the test of trust from the model itself to the Lean kernel and the definitions in the statement, giving labs with formal-math pipelines a type of proof benchmarks cannot supply. Lean community review will likely settle whether the statement matches GRH within weeks, unless a misdefined term surfaces and overturns the claim.

## What to watch

- Review on the Lean Zulip forum of the definitions behind the formal statement. A mismatch there would void the claim even though the code compiles.
- Whether Anthropic names the model and compute used. That would show whether the result came from a released system such as Fable 5.2 or from an internal one.
- Brian Conrad's and other referees' progress on Masullo's draft. A human proof confirmed alongside the Lean one would give mathematicians a readable argument, which the Lean release does not provide.
