Riemann hypothesis: Has the world’s most famous maths problem been cracked?
Levent Alpoge, a mathematician at Paradox, says he discovered a proof of the generalised Riemann hypothesis with help from Paradox. The original Riemann hypothesis, proposed in 1859, concerns the distribution of prime numbers and is one of mathematics’ most famous open problems. The generalised version extends the original conjecture to a broader family of mathematical functions. Alpoge’s announcement describes a proof of this wider claim, rather than only the original hypothesis. He said Paradox contributed substantially, writing that it “far outpaced me near the finish line”. The claim has not yet been confirmed. Alpoge released the argument in Lean, a proof assistant, but experts are still translating its code into ordinary mathematical explanations. So far, no human has read the entire argument. If the proof holds up, it would settle the original question as well as the broader claim, but independent mathematicians must first understand and verify it.
What has Levent Alpoge claimed to prove, and how does the generalised Riemann hypothesis relate to the original?
Levent Alpoge, a mathematician at Paradox, says he discovered a proof of the generalised Riemann hypothesis with help from Paradox. The original Riemann hypothesis, proposed in 1859, concerns the distribution of prime numbers and is one of mathematics’ most famous open problems.
The generalised version extends the original conjecture to a broader family of mathematical functions. Alpoge’s announcement describes a proof of this wider claim, rather than only the original hypothesis. He said Paradox contributed substantially, writing that it “far outpaced me near the finish line”.
The claim has not yet been confirmed. Alpoge released the argument in Lean, a proof assistant, but experts are still translating its code into ordinary mathematical explanations. So far, no human has read the entire argument. If the proof holds up, it would settle the original question as well as the broader claim, but independent mathematicians must first understand and verify it.
How can mathematicians check a proof written in Lean, and why has this proof not yet been accepted?
Lean is a programming language and proof assistant that can check mathematical reasoning step by step. A proof written in it can therefore be tested in a precise, formal way. But a successful check does not automatically give mathematicians a clear explanation of why the result is true or how the argument works.
Alpoge released his claimed proof in Lean rather than as a conventional research paper. The argument is enormous: Kevin Buzzard described it as 17 million lines of code, potentially corresponding to tens of thousands of pages of mathematics. Experts are translating parts of the code back into ordinary mathematical language to understand its structure and ideas.
The article reports no human has yet read the full argument, so independent verification is still under way. Researchers also do not yet know how much of the proof contains new ideas and how much uses standard mathematics. Buzzard expects people may understand it much better within a week or two, but acceptance depends on that scrutiny.
How large is the claimed proof, and what does its 17 million lines of Lean code represent?
The claimed proof is exceptionally large: Kevin Buzzard described it as 17 million lines of Lean code. Lean is a programming language and proof assistant, so these lines encode a formal argument that can be checked step by step. They are not a conventional paper that a reader can quickly follow from beginning to end.
Buzzard said the code might correspond to tens of thousands of pages of mathematics. That comparison gives a sense of the scale, but the article does not provide a precise page count. Researchers are currently translating portions of the code into ordinary mathematical language, which can help reveal the underlying reasoning.
The size also leaves important questions unanswered. Experts do not yet know how much of the argument relies on new ideas and how much consists of standard mathematics developed in formal detail. No human has read the whole proof so far. Buzzard expects understanding to improve within a week or two, but the claim still needs independent scrutiny.
What could a proof of the Riemann hypothesis change for mathematics and algorithms used in fields such as cryptography?
The Riemann hypothesis matters because it concerns prime numbers, whose distribution connects to many parts of mathematics. Abhishek Saha said hundreds of other mathematical results have been proved assuming the hypothesis is true. A confirmed proof would settle a question that has occupied mathematicians for more than 160 years and strengthen the foundations of those results.
The possible effects also reach algorithms. Kevin Buzzard said some algorithms run quickly, but mathematicians do not know for sure that they work; if the generalised Riemann hypothesis is true, then they do. Cryptographers have long worked on the assumption that the hypothesis is true, according to Buzzard. In this sense, proof could replace an important assumption with certainty for relevant results.
That does not mean the claimed proof has already changed practice. Experts are still trying to understand and verify it, and the article does not identify particular algorithms or promise a specific security change. If accepted, it would provide firmer mathematical grounds for results that currently rely on the hypothesis.
What is the Riemann hypothesis, in simple terms?
Prime numbers can look scattered along the number line, with no obvious pattern. The Riemann hypothesis proposes that their overall distribution follows a deeper order. It is widely regarded as the most important open question in pure mathematics and has remained unsolved since Bernhard Riemann proposed it in 1859.
The article explains that prime patterns are encoded in the Riemann zeta function. In the standard precise formulation, the hypothesis says that the function’s nontrivial zeros lie on a particular line in the complex plane. That technical statement is the mathematical version of the claim about hidden order in how primes are distributed. This precise formulation is standard mathematical background; the article itself gives the simpler description.
The hypothesis is one of the Clay Mathematics Institute’s seven Millennium Prize Problems, each carrying a $1m award. Hundreds of mathematical results have been proved assuming it is true. A proof would settle a long-standing question, but the proof claimed by Levent Alpoge and Paradox is still being independently examined.
How does the Riemann zeta function encode patterns in the distribution of prime numbers?
The article describes the Riemann zeta function as the mathematical object in which patterns of prime numbers are encoded. Bernhard Riemann introduced it in 1859, and the Riemann hypothesis asks a question about its properties that has major consequences for understanding how primes are distributed.
A standard mathematical explanation adds a key mechanism: for inputs with real part greater than one, the zeta function can be written as a product with one factor for each prime. This Euler product makes the connection visible: the function brings information from all primes into a single mathematical expression. The article does not explain this formula, so this detail is established mathematical background.
The hypothesis’s precise standard form concerns the locations of the zeta function’s nontrivial zeros. Those locations are tied to how regularly primes are distributed. The article says hundreds of results assume the hypothesis is true, and a proof could settle the question. Alpoge’s claimed proof remains under review, so its implications are not yet confirmed.
What makes a number prime, and why are primes important in mathematics?
A prime number is a whole number that can be divided evenly only by itself and by one. The article gives 2, 3, 5 and 7 as examples. Numbers that have other whole-number divisors are not prime. This simple definition picks out a special set of numbers along the number line.
Primes appear scattered, with no obvious pattern, but mathematicians study their overall distribution. The Riemann hypothesis proposes that this distribution has a deep, hidden order. The article says those patterns are encoded in the Riemann zeta function, connecting a basic idea about divisibility to a major question in pure mathematics.
Understanding that distribution matters because the hypothesis underlies hundreds of mathematical results that have been proved assuming it is true. It is also linked to algorithms: Buzzard said some algorithms are known to work if the generalised hypothesis is true. The article does not claim every algorithm depends on primes or that a proof would change all of mathematics. The claimed proof still needs independent verification.
This brief was written by AI from the original reporting and checked by other models. Names, figures and quotes come from the source; read it for full context.
Read more in the JupiteX app
Pulse is free. New stories every 4 hours, each one broken into the questions that explain it.
Or read more news on the web