With the Riemann Hypothesis now solved, the Twin Prime Conjecture is arguably the most important outstanding problem in pure mathematics.
Today, we present a new result that brings us one step closer to solving the Twin Prime Conjecture.
Building on the pioneering work of Terence Tao, Fields Medalist James Maynard, and Professor Yitang Zhang, the bound on prime gaps was brought down to 246. This means there are infinitely many pairs of consecutive primes separated by no more than 246, mathematically expressed as H₁ ≤ 246.
More recently, OpenAI pushed the bound to 186, with subsequent work by UCLA mathematics professor Romyar Sharifi bringing it down to 182 (H₁ ≤ 182).
In our result, we take it one step further and establish a new record, bringing the bound down to 180 (H₁ ≤ 180). Our proof is formally verified in Lean.
The significance is that if you can keep reducing H₁, like we did in this work, then eventually you’ll bring it down to H₁ = 2. This would then settle the Twin Prime Conjecture and establish the existence of infinitely many twin primes.
If I have seen further, it is by standing on the shoulders of giants.
Link: https://t.co/OkhLEAlIzz
An interesting update:
A new proof of the Riemann hypothesis over finite fields!
"Granted the formalism of étale cohomology and a weak Lefschetz theorem...it takes less than six pages"
"its only estimate is the Cauchy–Schwarz inequality for a character sum over a finite field. Lefschetz pencils, monodromy and Rankin’s method are not used."
Folks, we may be getting somewhere
https://t.co/yGuhYiuXsQ
For years I've been saying: how amazing would it be if all law was required to be Lean-formalized. A great subset of law very amenable to this is tax law. Imagine: there are some Prop-valued variables (did you sell a house last year? Yes/No) and some Nat- and Real-valued variables (how much is on line 3 of your W2), and the rest is filled in as legally binding. There can still be arguments / lawsuits about whether variables were properly assigned, etc. But after accepting the assignments, the rest is deterministic. (Not so different from various tax software, but completely precise.) So I'm very happy to see developments in this direction:
https://t.co/xK8uLrFTPl
(Of course a lot of law is purposely vague, leaving the details to the courts...)
A world map of the proof of the Riemann hypothesis!Introducing a fully interactive map of the semantic embeddings of all the Lean declarations and proofs in the formalization of the Riemann hypothesis.
You can explore the whole proof visually, see where the declarations live and how they connect and interact, search the map, and follow links to the original source code. The map will be updated with each iteration of the proof.
If you want to focus on one aspect of this monumental proof, you can now locate semantically related fragments. I hope this will help structure the code and broaden our understanding of its high- and low-level structure.
If this timeline below plays out, Levent Alpöge could, in a bizarre twist of fate, win both Millennium Prizes and become the undisputed most decorated mathematician in history. Refer to the quoted post below.
The Riemann Hypothesis is the crown jewel of pure mathematics. Navier–Stokes is its counterpart in applied mathematics. Winning both would be almost unfathomable.
Keep in mind that Levent Alpöge is only 34. GOAT 🐐 @__alpoge__
SITUATION UPDATED: The Riemann Hypothesis proof has passed the independent kernel check. MIT's Andrew Sutherland exported Alpöge and Claude's full proof and ran it through separately written kernels. nanoda (Rust) accepted it in about 28 minutes. con-leche accepted all 1.47 million declarations and confirmed the five theorems, including RH itself, match Mathlib-only statements. lean4lean passed all 175,187 modules, and Lean's own kernel replay passed with zero rejections. A Lean bug is now essentially ruled out, since every checker would have to share it. Two slower checks are still running, and nothing has failed. What's left is the human part: no readable proof exists yet, and the Clay prize needs publication plus two years of review. The Riemann Hypothesis is proven, but not yet understood.
If the Generalized Riemann Hypothesis (the stronger version of the Riemann Hypothesis) is proven, these become proven facts:
Algorithms that no longer need randomness
- Primality testing: Miller's fast test becomes proven correct with no randomness
- Square roots mod a prime: becomes solvable fast and with no coin flips (today that's an open problem)
- Cube roots and other roots mod a prime: same.
- Factoring polynomials over finite fields: almost fast (quasi-polynomial) with no randomness, instead of needing randomness
- Building finite fields: you can construct any finite field directly, with no random search
- Factoring vs. φ(n): factoring a number becomes provably as easy as computing φ(n), even without randomness
- Primes with a given remainder: a prime with any allowed remainder mod q exists that's at most about q², so searching for one is fast
Complexity theory
- Polynomial equations: "does this system of equations have a solution?" drops from PSPACE to a much lower class (AM)
- Algebraic P vs NP: Valiant's algebraic version of P vs NP gets tied to the normal P vs NP over the complex numbers
- Turing machines: a known 744-state Turing machine is proven to run forever
Number theory software
- Math libraries: PARI/GP and Magma results computed "assuming GRH" become fully proven
- Class groups: algorithms that compute these number-field structures get guaranteed running times
- Elliptic curve generation: the algorithms used to create curves for crypto get guaranteed running times
Cryptography (no new attacks, only proofs)
- Elliptic curves: proven that if discrete log is hard on one curve, it's hard on almost all similar curves
- Lattice crypto: known quantum attacks on some lattice schemes become proven to work
- Isogeny crypto: known quantum attacks on some isogeny schemes get proven speeds
- Code-based crypto: schemes like BIKE get the guarantee that the special primes they need exist
Prime gaps
- Next prime: there's always one within about √p·log p of p, so "find the next prime" has a guaranteed worst case
What it does NOT do
- It doesn't solve P vs NP
- It doesn't make factoring easy, so RSA and elliptic-curve crypto stay safe
- It doesn't make anything faster in practice, because randomized versions already work today
- Ramanujan graphs, expanders and AG codes are unaffected: they use a finite-field version of RH that was proven decades ago
The first 23-page summary of Alpoge's RH proof is up at: https://t.co/V4P9V0J6SC
This is just a short version surveying the argument and is far from perfect. A longer and more detailed version is coming soon.
I claim no correctness and no originality. I've used a bunch of agents to de-formalize Lean proof and make it a bit more human readable.
NUMBER #2 IS DOWN
Turns out Anthropic wasn't behind; they were just secretive!
After the Navier-Stokes drama, Levent Alpöge must've decided to not share early Millenium prize progress. According to his PDF, he's been sitting on some of this progress since Oct 6th!
Now that the result has been released, 6 problems in the Top 500 have been shot down. (Allegedly — awaiting review.)
I wonder what else they're sitting on?
https://t.co/89xVEdDbWx
asked Claude to explain the Riemann Hypothesis proof that Claude helped write.
it came back with 175,187 files and a chart. i made a 1-min video out of it.
We have a full confirmation from Andrew Sutherland who first managed to finish the nanoda kernel run and comparator in paranoid mode. This is now basically saying that the Riemann Hypothesis is 99,99999% true. It's almost impossible that any glitch has been deliberately implemented into the code and that anything is missing from the proof artifact (no sorries, no additional axioms, no weird bugs).
1) The formalized statement in Levent's drop is in fact GRH.
2) Still compiling, will take a few hours, but c'mon, it's gonna compile, obv that was checked ahead of time
3) Technically it could be a Lean bug but frontier models virtually never do that on accident. <<1% it's a bug
🚨 JUST IN: Turkish-American mathematician Levent Alpöge, working with Claude, claims to have proved one of the hardest problems in mathematics: the Generalized Riemann Hypothesis!
The Riemann Hypothesis is one of the seven Millennium Prize Problems.
The announcement includes a massive Lean formalization, which, when written out in English, runs to over 250,000 pages! 🤯
If verified, this could be the most significant mathematical breakthrough achieved with AI to date.