Pinned Tweet
By request, here's a more permanent link to the Kingdom Hearts cutscene font I made: drive.google.com/file/d/1rTz…
Sam Kolins retweeted
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).
We don't yet have full confirmation from the paranoid-mode comparator test, but we are close to seeing a formal artifact generated in Lean that provides a proof of the famous Riemann Hypothesis.
This is such a historic moment. The code was generated by @__alpoge__ using Claude and possibly other software.
There is still some uncertainty, but we may be on the verge of a historic announcement. For the first time in history, we may have such a magnificent proof that we DON'T fully understand yet, but that is probably correct.
Sam Kolins retweeted
some fascinating insights into the conservative mind coming out of the amendment 3 debacle. taxes, apparently, do not fund services, they go straight to glonzo, the money-eating demon. if taxes are slashed, glonzo will be put on a diet. anything else is malicious compliance
Sam Kolins retweeted
The CTE in Antonio Brown's blood will look like Anakin's midichlorian count
'Game changer' blood test could detect CTE in living patients for the first time trib.al/lOJIFfr
Sam Kolins retweeted
The plot thickens! Ravi Vakil announces "Alessandro Masullo has a proposed proof of GRH [Generalized Riemann Hypothesis], and Brian Conrad has been looking closely at it for months[ ...], and it is so far looking good. It is all human, with no AI." math216.wordpress.com/2026/1…
Sam Kolins retweeted
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
Sam Kolins retweeted
BREAKING: Robert Pattinson will play Claude in an upcoming biopic on the Riemann Hypothesis.
Sam Kolins retweeted
OK everyone, it's time to talk about the real part of every non-trivial zero of the Riemann zeta function
(1/2)
Sam Kolins retweeted
for the non math nerds, there's a ton of major mathmatical theory that starts with "assuming the Riemann hypothesis is true..."
meaning if this pans out, literal tens of thousands of conditional math theorems would be proven correct overnight. This ain't like the Naiver Stokes solution
Sam Kolins retweeted
Like most mathematicians, I believed the Riemann Hypothesis to be completely out of reach at present (even with the best AI tools), because I expected it to require substantial theory-building, probably in arithmetic geometry. The kind of new theory-building that fills entire books, and that AI isn't so good at yet.
Mathematicians have a notion of how deep a problem is. A sufficiently deep problem is generally intractable until enough of the theory is in place. If difficult problems are like valuable mineral reserves buried miles underground, you first need to build the infrastructure to reach them.
What Levent's proof seems to have done instead is something completely different. It takes an incredibly complicated tour through the infrastructure built for a hundred other mineral reserves, situated far from the destination, and somehow create a wormhole to the original destination.
This is not theory-building in the usual sense. It is something much weirder and more alien. The best human mathematicians know how to build theory, painstakingly, to reach a goal. But no human brain, on its own, is capable of creating a wormhole that requires a 25,000 page long tour through existing infrastructure with no obvious or realistic connection to the goal. But huge credit to Levent here: I think no current AI, on its own, is capable of this either.
I had never worked on or thought too much about the Riemann Hypothesis: it seemed very far removed from my own area of number theory.
But the astonishing thing about Levent's claimed proof of RH (which I think has a very good chance of being correct) is that it uses a huge number of precisely the things that are central to my own corner of number theory:
- Theta functions and other automorphic forms on unitary groups
- Gan–Gross–Prasad period formulas
- Relative trace formulas
Etc., etc.
A problem that I had always assumed would require new theories in arithmetic geometry may instead turn out to be tractable through an inhuman chain of existing (deep) results in higher-rank automorphic forms (and a lot else).
es la hostia porque GTA siempre ha sido un juego donde experimentar cosas que el mundo no te permite tener en la vida real en generaciones pasadas era matar a gente y cometer ilegalidades y en 2026 es tener una casa y una relación estable
Sam Kolins retweeted
live look at Florida politics







































