Key takeaways
- The Riemann hypothesis says every nontrivial zero of the Riemann zeta function has real part 1/2, and it is equivalent to the primes staying very close to their expected count.
- It is one of seven Clay Millennium Prize Problems worth $1 million each, and a solution must be published and survive at least two years before it can win.
- On November 20, 2026, Levent Alpöge claimed a proof made with Claude and Ravi Vakil announced a human-written draft proof of the generalized version by Alessandro Masullo; neither is verified.
The Riemann hypothesis says that every nontrivial zero of the Riemann zeta function has real part 1/2. If that is true, the prime numbers follow their expected pattern about as closely as possible. It has been open since 1859, it carries a $1 million Clay Millennium Prize, and on November 20, 2026, Anthropic mathematician Levent Alpöge said he believes that he and Claude have proved it. Nobody has verified that claim yet.
What the Riemann hypothesis says
Start with the zeta function. For a number s, add up 1 + 1/2^s + 1/3^s + 1/4^s and so on forever. That sum only makes sense when the real part of s is bigger than 1. Bernhard Riemann showed how to extend the function to every complex number (a number with a real part and an imaginary part, like 1/2 + 14i), with a single exception at s = 1. That extended function is the Riemann zeta function, written ζ(s).
The hypothesis is about where ζ(s) equals zero. Some of those places are easy: -2, -4, -6 and every other negative even number. Mathematicians call these the trivial zeros. All the other zeros, the nontrivial ones, are known to sit in a narrow vertical strip of the complex plane. The official problem description, written by mathematician E. Bombieri for the Clay Mathematics Institute, states the hypothesis in one line: the nontrivial zeros of ζ(s) have real part equal to 1/2.
So every one of those zeros should lie on a single vertical line, the line where the real part is 1/2. That line is called the critical line.
Riemann proposed this in an 1859 paper on counting primes. He called it very likely and set the proof aside after a few quick attempts.
How the Riemann hypothesis is related to prime numbers
A prime is a whole number bigger than 1 that you can't get by multiplying two smaller whole numbers: 2, 3, 5, 7, 11. Primes thin out as numbers get bigger, but they never stop, and they show no simple pattern.
The link to the zeta function goes back to Euler, who in 1748 wrote ζ(s) as a product with one factor for each prime. That product means everything about the primes is hidden inside the zeta function.
Riemann's 1859 paper went further. It gave an exact formula for the number of primes up to any limit built from the zeros of ζ(s). Each zero adds a wave to the count. Where the zeros sit decides how big those waves can get.
Gauss had guessed that the number of primes up to x, written π(x), is close to a smooth function called the logarithmic integral, Li(x). The question is how far off that guess can be. According to Bombieri's description, the Riemann hypothesis is equivalent to the error being no bigger than roughly the square root of x times log x. If the hypothesis is true, the primes stray from their average about as little as they possibly could. If it is false, Bombieri writes, the primes would be far less orderly than mathematicians expect.
The evidence for it is strong. The Clay Institute's problem page says the hypothesis has been checked for the first 10 trillion zeros.
What the generalized Riemann hypothesis is
The zeta function is the simplest member of a large family called L-functions. Many of them are built from the same kind of sum, but with each term weighted by a pattern. The best-known ones, Dirichlet L-functions, are used to count primes in sequences such as 3, 7, 11, 15, 19 (numbers that leave remainder 3 when divided by 4).
The generalized Riemann hypothesis, or GRH, says the same thing about these functions: their nontrivial zeros also lie on the line with real part 1/2. It includes the original hypothesis as a special case. Bombieri's description lists results that would follow from it, among them a sharp version of Chebotarev's density theorem about primes in number fields and Miller's fast deterministic test for whether a number is prime.
Why it matters: the $1 million Millennium Prize
The Clay Mathematics Institute announced seven Millennium Prize Problems in Paris on May 24, 2000, with $1 million for each. The Riemann hypothesis is one of them. Only one of the seven, the Poincaré conjecture, is listed as solved.
The prize rules, adopted by the institute's board on September 26, 2018, set a slow path to the money:
| Requirement | What the rules say |
|---|---|
| Publication | The solution must appear in a "qualifying outlet," generally a refereed mathematics publication of worldwide repute |
| Waiting period | At least two years must pass after publication |
| Acceptance | The solution must achieve general acceptance in the global mathematics community, as the institute decides |
| Scope | It must answer the questions in the problem's official description |
| Submissions | The institute does not accept solutions sent to it directly |
Even a correct proof posted today could not win the prize until at least two years after it is published in a qualifying outlet.
Is the Riemann hypothesis solved
Not as of November 20, 2026. Two separate claims appeared that day, and neither has been verified.
The Claude claim
In a statement on his website, Levent Alpöge wrote: "I believe I have, working with Claude, discovered a proof of the Riemann Hypothesis." He says the method extends to the generalized Riemann hypothesis. He did not post a written paper. He posted only a formalization in Lean, a programming language for proofs in which a computer checks every logical step, split across 14 archive files. He says the argument is very long for now and he plans to write it up properly. Our news story on the claim has the details.
Scientific American reported that MIT mathematician Andrew Sutherland independently compiled the Lean files. That shows the computer accepts the proof as written. It doesn't settle the question on its own, because experts still have to confirm that the Lean statement being proved really is the Riemann hypothesis. Sutherland told the magazine there is "much work to be done to understand the mathematical details of the proof."
Terence Tao, writing on his blog the same day, called the GRH proof the least digested of three recent results tied to Alpöge. He said a first look suggests it uses the full power of modern work on the Langlands program and arithmetic geometry, and that digesting it will take time.
The human claim
Separately, mathematician Ravi Vakil announced on his blog a draft proof of the generalized Riemann hypothesis by Alessandro Masullo. Vakil says the work was done by people alone, without AI, and that Brian Conrad has examined it closely for months. Vakil released the draft early and asked others to check and formalize it. It has not been verified either.
The two claims differ in a useful way. One arrived only as computer-checked code, so the open question is whether the code states the right problem. The other is a written draft, so the open question is whether readers find gaps.
What happens next
Tao pointed readers to a discussion thread on the Lean community's Zulip chat as the place to follow the work. For either claim to count toward the Clay prize, it would need to be published in a refereed outlet, survive at least two years of scrutiny, and win general acceptance.
Frequently asked questions
Is the Riemann hypothesis solved?
Not as of November 20, 2026. That day Anthropic mathematician Levent Alpöge said he believes he proved it with Claude, posting only a Lean formalization, and Ravi Vakil announced a separate human-written draft proof of the generalized version by Alessandro Masullo. Experts have not yet verified either one.
Is the Riemann hypothesis a Millennium Prize problem?
Yes. It is one of the seven Millennium Prize Problems the Clay Mathematics Institute announced on May 24, 2000, each worth $1 million. Under the rules, a solution must be published in a refereed outlet, pass at least two years, and win general acceptance before it can be awarded.
How is the Riemann hypothesis related to prime numbers?
Riemann's 1859 formula counts the primes up to any number using the zeros of the zeta function. The hypothesis is equivalent to saying the true count of primes up to x differs from the smooth estimate Li(x) by no more than roughly the square root of x times log x.
What does the Riemann hypothesis have to do with computing and cryptography?
The Clay Institute's official problem description lists Miller's deterministic polynomial-time primality test, a fast way to tell whether a number is prime, among the results that follow from the generalized Riemann hypothesis. The sources here do not say a proof would affect encryption in use today.
Sources
- Riemann HypothesisClay Mathematics Institute
- Problems of the Millennium: the Riemann Hypothesis (official problem description)Clay Mathematics Institute
- Millennium Prize ProblemsClay Mathematics Institute
- Rules for the Millennium PrizesClay Mathematics Institute
- Millennium Prize description and rules (PDF)Clay Mathematics Institute
- Statement on the Riemann HypothesisLevent Alpöge
- Anthropic mathematician claims to prove the Riemann hypothesisScientific American
- Unforced Euler singularity, unforced Navier-Stokes singularity, and the generalized Riemann hypothesisTerence Tao
- Hurried announcement: Alessandro Masullo GRHRavi Vakil


