RH · checked in Lean
  • ✓ Machine-verified in Lean
  • ✓ Community-certified
  • Human reading under way

Nobody understands all of this proof yet. Start with the part you can.

The Riemann Hypothesis has a computer-checked proof. Here’s your part.

The critical lineA sketch of the complex plane. The shaded band is the critical strip, between real part 0 and 1. The first ten non-trivial zeros of the zeta function, at heights about 14.13 up to 49.77, are drawn as dots, all on the dashed vertical line where the real part is one half. 0½1Re sIm s critical line
The first ten non-trivial zeros of the zeta function, all on the critical line where the real part is ½.

TL;DR

New: the guided path, four stops from primes to the proof · How the argument works, in three layers.

New · Guided path · about 30 minutes

Walk from primes to the idea behind the proof

  1. Find the primes
  2. Count them
  3. Put a ceiling on them
  4. See why a ceiling rules out zeros
Start the path →

The story so far

A 500-word read: one old question, one strange week, and where you fit in.

  1. 1859 to 2026

    A question 167 years old

    In 1859 a German mathematician, Bernhard Riemann, wrote a short paper about prime numbers: 2, 3, 5, 7, 11 and the rest, the numbers that can’t be split into smaller whole factors. Up close the primes look scattered at random. From far away they thin out along a smooth, predictable curve. Riemann’s question was how far the real count can stray from that curve.

    He found a way to turn it into a question about where a certain function, now called the zeta function, equals zero. If all its important zeros sit on one straight line, the primes keep as close to the smooth curve as anything random-looking possibly could. Riemann guessed they do. That guess is the Riemann Hypothesis.

    For 167 years nobody could settle it. Computers checked that the first 12 trillion or so zeros lie on the line, but there are infinitely many, and no amount of checking examples can cover them all. Thousands of results were proved “assuming the Riemann Hypothesis”, all waiting on one step nobody could take.

  2. 20 to 21 Nov 2026

    What happened

    On 20 November 2026, the mathematician Levent Alpöge released a proof. It isn’t a paper. It is about 17 million lines of code in Lean, a language in which every step of an argument has to be justified, down to the basic rules of logic, before a small checking program will accept it. Alpöge writes that he found the proof working with Claude, an AI system.

    Within a day, volunteers had compiled the code and run it through several proof checkers, written by different people in different programming languages. Each checker that finished accepted it. On 21 November the Lean and Mathlib communities, who look after the language and its shared library of mathematics, said they had full confidence the proof is correct.

  3. Right now

    The strange part

    A proof has always been two things at once: a guarantee that something is true, and an explanation of why. Until now the explanation came first. A mathematician understood an idea, wrote it down, and other people checked it.

    This time the order is reversed. We have the guarantee, from machines that read every step. We don’t yet have the explanation. Nobody, including the author, can yet walk you through the heart of the argument by hand, and Alpöge credits some of its hardest parts to Claude’s “technical mastery”. No journal has reviewed it yet, and nobody has claimed the million-dollar prize.

    “We look forward to all the activity in the mathematical community that will help explain the new ideas in this proof.”

    The Lean and Mathlib communities, joint statement

    So the most famous open question in mathematics has an answer that is certain and not yet understood.

  4. Your turn

    Where you come in

    Because nobody has the whole picture, nobody starts at the top. A Year 6 student who can spot a prime is standing on the same ladder as the experts, just nearer the bottom, and the top rung hasn’t been reached by anyone. The understanding will be built one piece at a time, by a lot of people, and the first pieces are ones you can hold.

Find your rung See what’s been checked

Find your rung

How much maths do you need for a piece of the Riemann Hypothesis? Less than you might think. A Year 6 student is on the same ladder as the experts, just a few rungs from the start, and nobody has reached the last rung yet. Each rung shows the Australian Curriculum maths that gets you there (v9 for Foundation–Year 10, v8.4 senior units). States order the senior units differently; the full ladder on Classrooms quotes every curriculum point word for word and notes the state differences.

  1. Year 6

    Maths: Prime, composite and square numbers

    You can reach: What RH is about: the primes, and how they are spread out along the number line.

    Curriculum: AC9M6N02 · Sieve game

  2. Years 7–8

    Maths: Square numbers and square roots; plotting on the Cartesian plane

    You can reach: Plot the count of primes: it climbs smoothly while primes get rarer. RH says the count's wobble around a smooth curve stays about the size of \(\sqrt{x}\) (a little more).

    Curriculum: AC9M7N01, AC9M7A05, AC9M8N01 · Count primes

  3. Years 9–10

    Maths: Logarithms (logarithmic scales; optional content on logarithms for post–Year 10 pathways)

    You can reach: Primes thin out like the number of digits: near a number with \(d\) digits, about 1 number in \(2.3\,d\) is prime (2.3 ≈ ln 10). And RH in words: the count of primes up to \(x\) stays within only a bit more than \(\sqrt{x}\) of a smooth curve.

    Curriculum: AC9M10M02 · Count primes · The big picture

  4. Year 11 Methods

    Maths: Geometric sequences and series

    You can reach: The Euler product idea: \(1+\tfrac{1}{2^s}+\tfrac{1}{4^s}+\dots=\frac{1}{1-2^{-s}}\), and multiplying one such series for every prime rebuilds ζ(s), because every whole number factors into primes in exactly one way.

    Curriculum: ACMMM074, ACMMM075 · Euler product activity

  5. Year 11 Specialist

    Maths: Proof by contradiction, "for all" and "there exists", induction, complex numbers as points

    You can reach: The exact statement: every non-trivial zero has real part ½. How a proof checker like Lean reads a proof one step at a time. And the shape of the proof's first step, a proof by contradiction (the step itself also needs the functional equation from the University rung).

    Curriculum: ACMSM025, ACMSM027, ACMSM064, ACMSM071 · The critical line · Contradiction activity · How Lean checks

  6. Year 12 Specialist and Methods

    Maths: Complex numbers in polar form; integrals; the natural logarithm

    You can reach: Each term \(n^{-s}\) as a spinning arrow; li(x) as the area under \(1/\ln t\); and the classic form of the prime-number law: near \(x\), about 1 number in \(\ln x\) is prime.

    Curriculum: ACMSM082, ACMMM159, ACMSM126 · Zeta explorer · Count primes

  7. University

    Maths: Analytic continuation, the functional equation, the Gamma function

    You can reach: Why ζ(s) still makes sense to the left of 1, what the trivial zeros −2, −4, −6, … are, and the proof's first step: a short proof by contradiction that reduces RH to "no zeros with real part above ½".

    Beyond the series · The first step

  8. Research frontier Not yet reached by anyone

    Maths: Theta lifts between unitary groups, automorphic forms

    You can reach: The core of the proof: the one-sided bound that rules out zeros to the right of the line. Nobody can yet explain this step by hand; mathematicians are still reading it.

    What is still unclear · The part nobody can yet explain simply · Proof map

Or choose a path

Everyone

No formulas. Primes, a picture of the zeros, and why a computer can be trusted here.

Students

The zeta function, the critical line, the functional equation, and the smoothed prime count the proof actually uses.

Australian classrooms

Links to the Australian Curriculum v9 and to every state and territory, with official wording.

Activities

Ten hands-on activities: sieve primes, count them, spin complex arrows, and be the proof checker.

Engineers & developers

Lean, Mathlib, the kernel, #print axioms, comparator, independent kernels, and how to reproduce the checks.

Analysts

For data, systems, security, business and risk, policy and quant analysts: what is and isn't proved, the trust model and threat model, measured scale, and implications.

How the argument works

The proof's big idea in three layers: Chebyshev's trick with a twist, why a one-sided bound is enough, and the main inequality (M).