Libyan Cossack retweeted
Replying to @huxlab
Dario's spiel since GPT-2 has always been about hyping the dangers so that open models would be made illegal and *he* would stay in control.
He left OpenAI because he wasn't going to have control.
It's like the Ottoman Empire banning the printing press for Arabic so they would keep in control of the dogma.
It stops the population from freely accessing diverse knowledge.
It's a new form of medieval obscurantism.
Libyan Cossack retweeted
Independent mathematicians have now finished the full verification of the proof of the Riemann hypothesis announced yesterday by Anthropic mathematician Levent Alpöge. The results are real, they say.
scientificamerican.com/artic…
Libyan Cossack 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
Libyan Cossack retweeted
AI may have cracked the math problem that towers above all others: the Riemann Hypothesis. Here’s a brief summary of this amazing news.
Libyan Cossack retweeted
BREAKING: Two months after OpenAI’s Navier-Stokes claim sparked accusations of scooping, an NYU mathematician and an Anthropic researcher say they’ve solved the unforced problem—with AI’s help.
sciam.com/article/ai-just-so…
Libyan Cossack retweeted
JUST IN: Riemann Hypothesis has been solved.
alpo.ge/remark.pdf
well well well
the acceleration is only getting started and the whole world will feel it soon, even the normies who show no interest or even take an anti-AI stance.
if confirmed and the Riemann Hypothesis is proven, it would be the greatest achievement in the history of mathematics!!!
that's like solving P vs NP, quantum gravity, the origin of life, consciousness, reversing aging, curing all cancers and so much more
which is all coming soon
not even a week after a reusable rocket has been caught falling from the sky
we really are in the singularity and nothing will ever be the same
2
67
Libyan Cossack retweeted
Ship 42 returns to Starbase, Texas for the first-ever Starship tower catch during Flight 15! I have dreamt of creating this image for years... and today it became real.
Congrats, SpaceX team!
Signal Protocol has proven yet again why it's the undisputed gold standard.
The Double ratchet and the more modern quantum-proof Triple ratchet key rotation is the MVP in this masterpiece.
Announcing a major milestone achieved by my team @GoogleDeepMind: we have proven key security properties of the machine code underlying the Signal messaging protocol. This is the first time the actual production code of a widely deployed protocol has been formally verified – by any method, with or without AI – and at this depth.
More than a research breakthrough, it’s a prime example of how frontier AI can be a force multiplier to counter the speed and scale of modern cyber threats.
Formal verification offers a higher standard of security; however, it’s extremely complex and time consuming, which is why in many cases it’s considered to be impractical. Similar efforts could take teams decades of combined effort. We did it in a month’s time.
Using AlphaProof Code, Google DeepMind's new agentic framework for formal verification that runs on LLMs including Gemini Carbon, we verified the Signal protocol down to the actual code running on devices. This milestone lays the groundwork for a future in which vital systems, from medical device firmware to power grid software, ship with mathematical proof that their protections work.
Reaching that future will take continued research from our community. In that spirit, we're open-sourcing our formal specifications and verification artifacts so others can build on this work.
On a personal note, this moment is of deep significance to me. I started my own research journey more than two decades ago as an intern working on checking the consistency of complex software systems. Seeing this grand challenge made practical with modern AI is extraordinary.
I'm extremely proud of my team members: Swarat Chaudhuri, Andrew Ferraiuolo, Anton Kovsharov, Tej Chajed, Sam Schlesinger, Karn Seth, Jonathan Katz, and Charles Sutton for taking on this grand challenge and delivering, and grateful to the Signal team for their partnership.
deepmind.google/blog/formal-…
48
No wonder the margin wasn't enough space for Fermat to write his proof
Replying to @claudeai
A team of 1,000 Fable 5.2 agents fully formalized Fermat’s Last Theorem in 30 hours, translating the proof into a language a computer can check step by step.
With the same setup, Opus 5.5 completed only 26% in 18 hours, and barely made any more progress after 30 hours.
67

























