Solved with Claude? Riemann Hypothesis proof passes first independent checks
Anthropic mathematician Levent Alpöge says he proved the Riemann Hypothesis together with Claude. It's one of the most famous open problems in mathematics. Independent experts have since rebuilt the machine-checkable proof without a single error. They're still checking whether it proves exactly what Riemann conjectured in 1859.

What's going on
On Friday, November 20, 2026, mathematician Levent Alpöge posted a short note on his website alpoge.ge. Alpöge works on the technical staff at AI company Anthropic. In the note he writes:
"I believe that I, together with Claude, have discovered a proof of the Riemann Hypothesis."
Bernhard Riemann formulated the hypothesis in 1859. It's widely seen as perhaps the most important unsolved problem in mathematics. At its core is a hidden pattern in how the primes are distributed, the numbers divisible only by 1 and themselves. Stated technically, the hypothesis says that all "non-trivial" zeros of the Riemann zeta function lie on one particular vertical line, the so-called critical line with real part 1/2. It's one of the Clay Mathematics Institute's seven Millennium Prize Problems, each of which carries a $1 million prize.
What's unusual is how it was published. There's no traditional paper, no preprint and no journal submission. According to the news outlet Clarín, the material consists of a four-page personal note and 14 downloadable archive files. Together they come to about 239 megabytes and 175,187 source files written in Lean. As of Friday, Anthropic itself hadn't commented officially.
What Lean is and why it matters so much here
Lean is a proof assistant: software that lets you write mathematical proofs the way you'd write a computer program. A small, very carefully vetted core program (the "kernel") then checks every single logical step. If the Lean code compiles without errors, meaning it's fully processed and checked, that's normally taken as confirmation that every step is correct. That's a huge advantage, because no human could check 250,000 pages of proof line by line.
But Lean only checks whether a chain of reasoning proves exactly the statement you give it. It can't tell whether that statement really is the Riemann Hypothesis. Kevin Buzzard of Imperial College London, one of the best-known Lean experts, writes in a blog post:
"The first question you have to ask when assessing a PDF with some Lean code is: what is the statement of the theorem in the Lean code, and does it match the actual statement of the theorem?"
Where verification stands
According to Clarín, the claim has to clear several stages.
Stage 1: Does the code compile without hidden assumptions? This stage appears largely done. According to Scientific American, independent researchers have each compiled Alpöge's result in Lean on their own, without problems. One of them is Andrew Sutherland of the Massachusetts Institute of Technology. He says:
"The Lean proof has been compiled and independently checked by the Lean kernel, using only the three standard axioms. Honestly, the probability that something fishy is going on here is about zero."
Axioms are the basic assumptions taken as given without proof. Lean can list exactly which axioms a finished theorem relies on. Mathematician Kit Yates also points this out, according to Clarín. That means it's immediately obvious if someone has smuggled in an unproven shortcut as an extra assumption. Seeing only the three usual axioms is therefore considered a strong signal. Earlier reports, such as one from Crypto Briefing, said there was no independent confirmation yet. They seem to date from the first few hours after the announcement.
Still pending: the "comparator run." This is an automated cross-check that typically takes a few hours, according to Scientific American. Buzzard wrote on the Lean community's chat server that people were still waiting for a successful run. It checks (a) that the code isn't doing anything underhanded, such as redefining what the symbols in the statement mean. And it checks (b), in "paranoia mode," that the code also compiles on several independent kernels. That rules out the possibility that it's just exploiting some unknown bug in the official Lean kernel.
Stage 2: Does it really prove the Riemann Hypothesis? For that, experts have to examine the definitions in the code, such as those of the zeta function and Dirichlet L-functions. Then they compare the final theorem with the standard formulation of the Riemann Hypothesis in Mathlib. Mathlib is Lean's shared mathematics library, and the formulation there was written by mathematicians David Loeffler and Michael Stoll. According to Clarín, an independent verification project has already confirmed that the archive files match Alpöge's mirror server. The top-level statements also compiled against the Lean library.
An October 2026 preprint by Alexander Bastounis, Fabian Circelli and Anders C. Hansen urges caution. The researchers warned that Lean checks of AI translations offer "no assurance whatsoever" if the problem and its formalization don't match. As an example, they cited an OpenAI claim about the Navier-Stokes equations.
250,000 pages of "slop" and the road to a real paper
Alpöge himself calls the argument "incredibly long." In a footnote, he writes that a complete written-out version in plain language ran to more than 250,000 pages. He isn't publishing that version and calls it "slop." He openly admits he released a complete argument before mastering much of the underlying mathematics himself. Next, he says, he plans to study the proof, simplify it, give talks and write a proper paper. Shorter arguments should follow "fairly quickly." He didn't give a date.
So far there are only hints about the content. According to Mathrubhumi, Alpöge steered the investigation in a direction inspired by two ideas from a simpler model. Claude reportedly made rapid progress toward the end. The work involved a prime-weighted von Mangoldt sum and a chain of constructions known as theta lifts. The von Mangoldt sum is a classic tool for counting primes.
A six-week timeline, with the IPO in the background
The note includes a rough timeline that Alpöge says Claude put together and that may still need corrections. The dated entries start on October 6. Several key breakthroughs came on Sunday, November 15 ("for me it happened late Sunday night"). The last entry, dated November 16, simply reads "GRH." That stands for the Generalized Riemann Hypothesis, an even broader version of the problem.
There's some backstory. In August 2026, Anthropic reported that an unreleased research version of Claude had raised the proven share of zeta zeros on the critical line from about 41.6 to 67.25 percent. Alpöge earned his PhD at Princeton in 2020 under Manjul Bhargava. According to Crypto Briefing and Mathrubhumi, he has already presented several AI-assisted results in 2026: an explicit counterexample to the Jacobian conjecture in July, a positive solution to Hopf's problem in August, and constructions of hard-to-find Hadamard matrices.
The timing is awkward. The announcement came one day after Anthropic stock began trading on the Nasdaq on November 19. Alpöge writes that he consulted company leadership about publishing and that there was "a constraint to respect." He alone decided not to wait any longer. He rejects the "obvious cynical view" of the timing as wrong.
The million-dollar prize is still a long way off
Even if every technical check is passed, the Clay prize is still far away. The institute doesn't accept direct submissions, and a website post with a code archive doesn't count. According to Clarín, three things are required: publication in a peer-reviewed journal, then at least two years of waiting, and finally "general acceptance in the global mathematics community." Even if a peer-reviewed paper came out tomorrow, the prize couldn't be awarded before late 2028. In practice, it would almost certainly take longer.
Our take
If the proof holds up, it would be a historic moment in two ways. First, a 167-year-old problem that has defeated generations of mathematicians would fall. Second, an AI would have done the bulk of the work. The new kind of verification is notable too: instead of human referees checking step by step for months, a machine checks the logic. Humans then mainly have to make sure the formal statement faithfully captures Riemann's question.
That's exactly where the open questions are. The comparator run is still pending, and the match with the Mathlib formulation hasn't been publicly confirmed. Above all, nobody currently understands why the proof works, and by his own account that includes Alpöge. A human-readable argument doesn't exist yet. The timing so close to the IPO will raise questions too, even though Alpöge denies any connection. Still, the independent checkers sound remarkably unequivocal. If you want to follow what happens next, watch for four signals: a public report from independent Lean experts listing the axioms, a confirmed match with Mathlib, a readable preprint, and an official statement from Anthropic or the Clay Institute.
Related videos
Sources
- Brave News scientificamerican.com
- clarin.com clarin.com
- cryptobriefing.com cryptobriefing.com
- english.mathrubhumi.com english.mathrubhumi.com
- dev.to #ai dev.to
- Brave News science.org
- Brave News scientificamerican.com
- QbitAI 量子位 (CN) qbitai.com
- Google News (CH) news.google.com
- Le Monde Pixels (FR) lemonde.fr
- Reddit r/ClaudeAI reddit.com
- Reddit r/ClaudeAI reddit.com
- Reddit r/ClaudeAI ournews.ai
Ask the AI assistant
Questions about this article, installation or background? Our assistant knows this page and runs on our own machine, not in someone else's cloud.
The Assistant is an AI (Gemma 4) and can make mistakes – please check important details against the source. Questions are used only to generate an answer and are deleted after one hour. Please don't enter any personal data.
Comments
What do you think? Already tried it? Write it here, no sign-up needed.
Comments are public. Links aren't allowed, and we delete abusive posts. You can delete your own comment at any time in this browser. Learn more in the Privacy Policy.