The zeta function, its zeros on the critical line and the primes rebuilt from them, live.
The curve is ζ(σ + it) as t grows. On the critical line, σ = ½, it passes through 0 at every zero. Move σ away from ½ and it never does: that is the Riemann hypothesis, seen.
Each is ½ + it, worked out here in your browser. Press one to go to it.
What is Riemann Hypothesis Visualizer?
Riemann Hypothesis Visualizer draws the Riemann zeta function live, so you can watch what the most famous open problem in mathematics is about. Every number on the screen is worked out in your browser as you watch: the zeta function itself, the zeros on the critical line (the first 201 of them, up to a height of 400) and the prime numbers rebuilt from those zeros.
The Riemann hypothesis in one picture
The zeta function ζ(s) starts as the sum 1 + 1/2s + 1/3s + 1/4s + … and extends to every complex number s = σ + it. Apart from easy zeros at −2, −4, −6 …, all of its zeros lie in a narrow band, the critical strip 0 < σ < 1. The Riemann hypothesis says they lie on one line down its middle, the critical line σ = ½. Why it matters: those zeros control how the prime numbers are spread out, and a great deal of number theory is proven only "if the Riemann hypothesis is true".
Four ways to see it
- Spiral: ζ(½ + it) traced in the complex plane as t grows. The curve loops around and passes exactly through 0 at every zero, and the origin rings when it does. Move σ off ½ with the slider and the curve never touches 0 again.
- Critical strip: the plane coloured by the angle of ζ, with bands where its size doubles. A zero is a point where all the colours meet, and every one of them sits on the white line σ = ½. Drag it to fly along the line.
- Zeros on the line: Hardy's Z(t), the zeta function along the critical line turned into a real wave. Each time it crosses the axis is a zero, numbered as they come.
- Prime staircase: Chebyshev's ψ(x), a staircase that climbs at every prime. Riemann's explicit formula builds it from a straight line and one wave for each zero. Add the zeros one by one and watch the steps of the primes appear.
Turn the sound on to hear each zero as a note when it is passed, record any of the four as a video, or save a picture.
The story so far
In 1859 Bernhard Riemann published an eight-page paper, "On the Number of Primes Less Than a Given Magnitude". In it he showed that the primes are governed by the zeros of the zeta function, and remarked, almost in passing, that it is "very probable" all of them lie on the critical line. He added that he had put aside the search for a proof.
David Hilbert put the problem on his list of the great problems of the twentieth century in 1900. In 1914 G. H. Hardy proved that infinitely many zeros lie on the line, though not that all of them do. Computers have since checked more than ten trillion zeros, and every one is on the line. In the 1970s Hugh Montgomery and Freeman Dyson noticed that the spacing between the zeros follows the same law as the energy levels of heavy atomic nuclei. In 2000 the Clay Mathematics Institute made it one of its seven Millennium Prize Problems, with a prize of one million dollars. Many proofs have been announced over the years, and none has been accepted.
Levent Alpöge's claim, made with AI
On 20 November 2026 Levent Alpöge, a mathematician at Anthropic, wrote on his website that he believes he has found a proof of the Riemann hypothesis, and of its generalised form, working with the AI model Claude. The proof is not a paper but a formal proof written in the Lean proof language, which a computer can check line by line. It runs to roughly 175,000 files, and the explanation the AI produced alongside it is said to be longer than 250,000 pages.
The claim has not been verified. Mathematicians first have to confirm that the statement written in Lean is really the Riemann hypothesis, and then that the argument holds, and several have said that a proof of this size will not be checked quickly. Whatever the outcome, it is the first time a claim on this problem has come as a machine-checkable proof built with an AI. This page will be updated when the experts' verdict is in.
How to use it
- Choose a picture above the stage: Spiral, Critical Strip, Zeros on the Line or Prime Staircase.
- Press Play, pick a speed, and turn on the sound to hear the zeros.
- Open Settings to move σ off the critical line, widen the view or choose how many zeros rebuild the primes.
- Press a zero in The Zeros to jump to it, and use full screen, the video or the picture to keep what you see.
Frequently asked questions
Does this prove the Riemann hypothesis?
No. It shows the zeros it finds lying on the critical line, as every zero ever computed does, but no number of examples is a proof: the hypothesis is about infinitely many zeros.
How are the numbers computed?
In your browser, with the Euler–Maclaurin formula for ζ(s) and the Riemann–Siegel theta function for Hardy's Z(t). The zeros are found where Z changes sign and refined to many decimal places: the first is ½ + 14.134725…i, as in the tables.
What is the prime staircase?
Chebyshev's function ψ(x) adds up ln p for every prime power pk up to x, so it jumps at each prime. Riemann's explicit formula writes it exactly as x minus a sum over the zeros of ζ; with enough zeros the sum reproduces every step.