Riemann Hypothesis Solved? Anthropic's Claude AI Claims Proof of Math's Greatest Unsolved Problem

Mr Yudo
0

AI-generated illustration.

A mathematician at AI company Anthropic says he has used the firm's Claude chatbot to prove the Riemann hypothesis — the most famous unsolved problem in mathematics, a puzzle that has defeated the world's best minds for more than 160 years.

Levent Alpöge announced on Friday, November 20, 2026, that he believed he had found the proof working with Claude. "I believe I have, working with Claude, discovered a proof of the Riemann Hypothesis," he wrote in a four-page note released on his website.

First proposed in 1859 by German mathematician Bernhard Riemann, the hypothesis concerns the distribution of prime numbers — the numbers divisible only by themselves and 1, which are the building blocks of all whole numbers. It is widely regarded as the most important open question in pure mathematics, and one of the seven Millennium Prize problems for which the Clay Mathematics Institute offers a $1-million reward.

A proof written in code, not on paper

Rather than a traditional paper, Alpöge released the proof as computer code written in Lean, a programming language that lets machines check mathematical arguments step by step. The archive runs to about 17.4 million lines of code across 175,187 modules, and he says the method also proves a stronger version of the problem known as the Generalised Riemann Hypothesis.

Independent checks began almost immediately. Andrew Sutherland, a mathematics professor at the Massachusetts Institute of Technology, reported that all 175,187 modules compiled without errors, and that the proof had been independently rechecked by the Lean kernel using only the three standard axioms. "Honestly the chance that anything is fishy here is approximately zero," Sutherland said, according to Scientific American.

Not proven yet — the checks still to come

The claim has not been peer-reviewed, and mathematicians stress that the story is still developing. A final "comparator run" is still underway to confirm that the code does not redefine the meaning of any symbol in the hypothesis or smuggle in any shortcut. Alpöge himself acknowledged that a full written version of the argument would be extremely long, and that he had not yet mastered all of the mathematics involved in the proof.

A rival claim has also emerged: Stanford researcher Alessandro Masullo has proposed a separate, entirely human-developed proof of the Generalised Riemann Hypothesis, which mathematicians examining the draft have already begun questioning. The two claims are now at different stages of scrutiny, with the Claude-assisted proof having cleared the major machine checks so far.

Why the timing raised eyebrows

The announcement came the day after Anthropic's record-breaking stock market debut, when the company joined the ranks of the world's most valuable public companies with a market capitalisation of about $2 trillion. Alpöge said he had consulted Anthropic chief executive Dario Amodei before announcing the result, and acknowledged that the timing could be viewed cynically. Anthropic declined to comment on Friday as experts around the world rushed to check the work.

If the proof holds up, it would be one of the greatest achievements in the history of mathematics — and the first time an AI system has played a central role in settling a problem of this scale. For now, the mathematical world is watching the verification checks, waiting to see whether a 167-year-old mystery has finally been solved.

Sources: Scientific American, 20–21 November 2026; Phys.org, 20 November 2026; The Hindu, 21 November 2026; The Wall Street Journal, 21 November 2026; Moneycontrol, 21 November 2026. The claim, the quote from Mr. Alpöge, the size of the Lean archive and the compilation results are as reported by these sources; the proof has not yet been peer-reviewed and a comparator verification run was still pending at the time of writing, so the result should be treated as a claim under verification, not a settled fact.

Post a Comment

0 Comments

Post a Comment (0)