One of mathematics’ greatest mysteries is making headlines after an Anthropic researcher claimed to have solved the Riemann Hypothesis with the help of artificial intelligence. The announcement, made on November 20, 2026, has renewed worldwide interest in a mathematical problem that has remained unresolved for more than 160 years.
Mathematician Levent Alpöge says he worked alongside Anthropic’s AI assistant, Claude, to develop a proof of the famous hypothesis. He also claims their work extends to the more ambitious Generalized Riemann Hypothesis, potentially marking a major breakthrough in number theory. His statement appears in a note posted on his website.
However, there is an important distinction between claiming a solution and having one independently verified. As of November 20, the Clay Mathematics Institute still lists the Riemann Hypothesis as unsolved, meaning the proposed proof has yet to receive the mathematical community’s full acceptance.
Why Is the Riemann Hypothesis Trending Now?
The sudden attention centers on a four-page statement published by Alpöge on November 20, 2026. In it, the mathematician wrote, “I believe I have, working with Claude, discovered a proof” of the Riemann Hypothesis.
According to Alpöge, the argument has been formalized using Lean, a programming language and proof assistant designed to check mathematical reasoning. He linked to downloadable code rather than publishing a conventional, readable research paper, explaining that the current argument is extraordinarily long and still needs a clearer written presentation.
The announcement has drawn coverage from major news organizations, including The Washington Post and The Verge. The combination of a celebrated unsolved problem and a striking AI-assisted claim explains the surge in attention—but it does not establish that the proof is correct.
What Is the Riemann Hypothesis?
First proposed in 1859 by German mathematician Bernhard Riemann, the Riemann Hypothesis concerns prime numbers: whole numbers greater than one that are divisible only by one and themselves. Familiar examples include 2, 3, 5, 7 and 11.
Prime numbers are central to number theory, but they appear in an irregular sequence. The gaps between them change, making it surprisingly difficult to describe exactly how frequently primes occur as numbers grow larger.
Riemann connected that problem to the Riemann zeta function, a mathematical expression that, when extended into the complex numbers, contains information about the distribution of primes. The hypothesis makes a precise prediction about where certain values of this function equal zero.
The Critical Line and Nontrivial Zeros
A zero is an input that makes the zeta function equal zero. Some zeros are straightforward, but mathematicians are especially interested in the more mysterious nontrivial zeros, which lie within a region of the complex plane known as the critical strip.
The Riemann Hypothesis states that every nontrivial zero has a real part equal to one-half. In a graph of complex numbers, these zeros would all fall on a single vertical path called the critical line.
That seemingly abstract condition matters because the locations of the zeros help determine how closely the actual number of primes follows the estimates mathematicians use. Proving the hypothesis would give researchers much sharper control over the errors in those estimates.
What Did Levent Alpöge and Claude Claim to Prove?
Alpöge says his collaboration with Claude produced a complete argument for the Riemann Hypothesis and a wider result called the Generalized Riemann Hypothesis. The generalized version concerns a broader family of mathematical functions and would represent an even more sweeping development if established.
His note describes a research process involving advanced number-theory techniques, developed across October and November 2026. Alpöge also says that Claude eventually moved faster than he could follow every detail of the emerging argument.
The material made available is presented as Lean formalization rather than a traditional proof written for other mathematicians to read. Formal proof software can check logical steps against specified rules, but independent experts still need to examine the actual code, definitions, dependencies and mathematical claims before accepting a result of this magnitude.
How Has AI Contributed to Riemann Hypothesis Research?
AI had already made headlines in this area before the latest claim. In August 2026, Anthropic reported that an experimental version of Claude had improved a lower bound on the proportion of nontrivial zeta-function zeros known to lie on the critical line—from roughly 41.6% to 67.2%.
That earlier result was a step forward in a related question, not a solution to the hypothesis itself. Confirming a proportion of zeros on the line is fundamentally different from proving that every nontrivial zero lies there.
More recently, AI-assisted research on a separate problem known as the quasi-Riemann hypothesis also attracted attention. Despite the similar name, progress on that related problem should not be confused with a verified proof of Riemann’s original conjecture.
Why Does Solving the Riemann Hypothesis Matter?
A proof would reshape researchers’ understanding of the distribution of prime numbers and settle numerous mathematical results that currently depend on assuming the hypothesis is true. It could also open new approaches to difficult questions across number theory and related areas of mathematics.
Prime numbers also play a role in modern cryptography, which is why the topic regularly appears in conversations about digital security. However, a proof of the Riemann Hypothesis would not automatically break internet encryption; its immediate consequences would primarily be mathematical.
Part of the excitement is the possibility that a successful argument could introduce tools and connections that mathematicians have not previously understood. Even if the new claim proves incorrect, careful examination of its methods could still generate useful questions for future research.
Has the Riemann Hypothesis Actually Been Solved?
Not in a way that has been independently established as of November 20, 2026. The Clay Mathematics Institute, which named the Riemann Hypothesis one of its seven Millennium Prize Problems, continues to classify it as unsolved. Its prize for an accepted solution is $1 million.
The institute’s published prize rules require a proposed proof to appear in a qualifying publication, receive general acceptance from the global mathematical community and remain published for at least two years before it can be considered for the award.
Computers have verified enormous numbers of individual zeros that fit the hypothesis, but checking examples cannot settle a claim about infinitely many possible cases. For Alpöge’s announcement to become a recognized mathematical breakthrough, the proof must withstand detailed scrutiny and satisfy the community’s standards for correctness.
Frequently Asked Questions
Has the Riemann Hypothesis been proven in 2026?
Levent Alpöge announced a Claude-assisted proof on November 20, 2026, but the claim had not received independent mathematical acceptance at the time of writing. The Clay Mathematics Institute still lists the problem as unsolved.
What is the Riemann Hypothesis in simple terms?
It predicts that all nontrivial zeros of the Riemann zeta function lie on a specific line, where the real part of each zero equals one-half. This prediction is closely connected to how prime numbers are distributed.
Did Claude AI solve the Riemann Hypothesis?
Alpöge says Claude helped develop and formalize a proof. That is a claim, not yet an independently confirmed result, and mathematicians must examine the available evidence before reaching a conclusion.
What is the $1 million Riemann Hypothesis prize?
The Clay Mathematics Institute offers $1 million for a solution that meets its Millennium Prize requirements. A new announcement alone does not qualify someone to receive the award.
Would proving the Riemann Hypothesis break encryption?
No immediate collapse of encryption follows from proving the hypothesis. Although prime numbers are fundamental to several encryption systems, this conjecture concerns their mathematical distribution rather than a direct method for defeating cryptographic protections.