Riemann Hypothesis × Claude

Explainer

What is the Riemann Hypothesis?

The most famous unsolved problem in mathematics, explained in plain English, and why a claimed proof made with Claude has the world paying attention.

Last updated November 20, 2026

Short answer: the Riemann Hypothesis says that all the "non-trivial" zeros of the Riemann zeta function lie on one vertical line in the complex plane, the line where the real part is exactly ½. Because those zeros control the fine structure of the prime numbers, the hypothesis amounts to saying that primes are spread out as evenly as they possibly can be.

Primes look random, but they are not chaotic

A prime is a whole number greater than 1 whose only divisors are 1 and itself: 2, 3, 5, 7, 11, 13 and so on. There are 25 primes below 100, 168 below 1,000 and 1,229 below 10,000. Up close they look haphazard. Twin primes such as 41 and 43 sit side by side, while further out you can find gaps between primes as long as you like.

From far away, a pattern appears. Around 1792 a teenage Carl Friedrich Gauss noticed that near a number x, roughly one number in every ln x is prime. That observation became the prime number theorem, proved in 1896 by Jacques Hadamard and Charles de la Vallée Poussin: the number of primes up to x, written π(x), is approximately x / ln x, and is matched even more closely by a function called the logarithmic integral, li(x).

The real question is how good that approximation is. That is where Riemann comes in.

Riemann's zeta function

The zeta function starts as a simple infinite sum: ζ(s) = 1 + 1/2^s + 1/3^s + 1/4^s + … For s = 2 the sum equals π²/6, a famous result of Leonhard Euler. In 1737 Euler also showed that the same sum can be written as a product over all the primes, the first sign that zeta "knows" about primes.

In his 1859 paper On the Number of Primes Less Than a Given Magnitude, Bernhard Riemann let s be a complex number and extended ζ(s) to the whole complex plane, except the single point s = 1. He then wrote down an exact formula for counting primes in which every zero of ζ(s) contributes a wave-like correction.

Trivial and non-trivial zeros

ζ(s) equals zero at s = −2, −4, −6 and so on. These "trivial zeros" are completely understood. All the other zeros, the non-trivial ones, lie in the critical strip: the band of complex numbers whose real part is between 0 and 1. They come in mirror-image pairs around the vertical line Re(s) = ½, known as the critical line.

The first few non-trivial zeros sit at ½ + 14.1347i, ½ + 21.0220i and ½ + 25.0109i. Riemann remarked that it is very likely that all of them have real part exactly ½. That remark is the Riemann Hypothesis.

Why the zeros control the primes

In Riemann's formula each zero adds a wave to the prime count. A zero with real part ½ adds a wave that grows like √x. A zero further to the right would add a bigger wave, and the primes would wander further from their expected count. If the hypothesis is true, the error in the prime number theorem is as small as it could possibly be, roughly √x · log x. Helge von Koch proved in 1901 that this bound on the error is exactly equivalent to the Riemann Hypothesis.

What was known before Claude

  • Infinitely many zeros are on the line. G. H. Hardy proved this in 1914.
  • A positive share of zeros is on the line. Atle Selberg proved it in 1942. Norman Levinson raised the share to at least one-third in 1974, Brian Conrey to at least two-fifths in 1989, and Pratt, Robles, Zaharescu and Zeindler to more than five-twelfths in 2020.
  • Trillions of zeros are on the line. In 2021 David Platt and Tim Trudgian verified every zero up to height 3 × 10¹², more than 12 trillion zeros.
  • The analogue over finite fields is true. André Weil proved it for curves in the 1940s, and Pierre Deligne for higher-dimensional varieties in 1974.

None of this rules out a single zero off the line somewhere far up the strip. That is why the problem stayed open.

Claude's part in the story

In August 2026 an unreleased research version of Claude pushed the proven share of zeros on the critical line to more than two-thirds; see Claude's 67% result on Riemann zeta zeros. On November 20, 2026, Anthropic mathematician Levent Alpöge announced a claimed proof of the full hypothesis, made with Claude and written in the Lean proof language. It has not yet been verified. Follow it on our Riemann Hypothesis and Claude overview and the verification tracker.

The generalized versions

The Generalized Riemann Hypothesis (GRH) makes the same claim for Dirichlet L-functions, close relatives of ζ(s) that count primes in arithmetic progressions such as 1, 5, 9, 13 and so on. The zeta function is the simplest of them, so GRH contains the original hypothesis. The Extended Riemann Hypothesis usually refers to the zeta functions of number fields, although authors use these names in slightly different ways. Alpöge says his method resolves GRH and should reach the Extended version with more time.

Why it is worth $1 million

The Riemann Hypothesis was part of the eighth problem on David Hilbert's influential 1900 list, and in 2000 the Clay Mathematics Institute made it one of seven Millennium Prize Problems, each carrying a $1 million reward. Its fame comes from its reach: a large body of results in number theory begin with "assume the Riemann Hypothesis". A proof would make all of them unconditional at once. For the full history, see the Riemann Hypothesis timeline.

Frequently asked questions

Is the Riemann Hypothesis proven?

Not yet confirmed. A proof made with Claude was claimed on November 20, 2026, and is awaiting independent verification.

What is the critical line?

The vertical line in the complex plane where the real part of s equals ½. The Riemann Hypothesis says every non-trivial zero of ζ(s) lies on it.

What are the trivial zeros?

The zeros of ζ(s) at the negative even integers −2, −4, −6 and so on. They are fully understood and play no part in the hypothesis.

How many zeros have been checked?

Every zero up to height 3 × 10¹², more than 12 trillion of them, lies on the critical line (Platt and Trudgian, 2021). Numerical checks support the hypothesis but cannot prove it.

Would a proof of the Riemann Hypothesis break internet encryption?

No. Encryption such as RSA depends on how hard it is to factor large numbers, and a proof of the Riemann Hypothesis gives no new way to factor.

Sources

  1. Clay Mathematics Institute: The Riemann Hypothesis
  2. Levent Alpöge, statement on the Riemann Hypothesis (PDF) · Nov 20, 2026
  3. Anthropic: Learning more about Claude's mathematical capabilities · Aug 10, 2026
  4. arXiv:2608.13637, More than two thirds of the zeta zeros are simple and on the critical line · Aug 2026