Peter Rohde retweeted
It’s okay if we disagree on something, I’ll still respect you and be your friend. 👍🇺🇸
Peter Rohde retweeted
The @GoogleDeepMind Science team is sharing two key cryptographic advances today uncovering weaknesses in legacy 1024-bit RSA schemes.
Working with leading cryptanalysis experts, our team showed how AI agents could make two significant cryptographic advances in just weeks, uncovering results which can bypass older digital signature protections and factor legacy 1024-bit RSA keys in bulk.
While these results do not affect the security of modern encryption schemes such as RSA 2048, these results show why we must not assume the mathematical "hardness" of cryptographic schemes which we have relied upon in the past. It also shows how AI can help defenders improve security standards well ahead of future threats.
I have written in more detail about our results, and why they are important for the future of security, in a longer essay which you can read here:
teapaw.org/pushmeet/status/211875…
Peter Rohde retweeted
Replying to @fortnow
The trouble is the assumption is based entirely on the fact that we haven’t found one. We lack a proof that RSA is NP-intermediate, we just haven’t found an algorithm in BPP. We don’t know that it’s not there.
Peter Rohde retweeted
Today Physical Superintelligence PBC is announcing a proof of the Aaronson-Ambainis conjecture, one of the central open problems in quantum complexity, with major implications for quantum computing speedup.
psi.inc/research/aaronson-am…
Thread 👇
Peter Rohde retweeted
We asked GPT-6 Astra to edit Qwen3.5-0.8B weights to improve math.
It directly changed only 0.016% of weights, fixing 0.8B's reasoning loops & improving math up to 6x and even instruction following 3x, without gradients or training.
We call this Weight-Space Programming: frontier LLMs can now natively read/write neural network weights! đź§µ
Blog: rikiyat.github.io/blog/weigh…
Readers added context they thought people might want to know
LLM was given weights explicitly as text in prompt and used code/forward passes (per authors' logs) to ablate Qwen looping direction, a known thinking-mode issue per model card. Primarily fixed repetition in that mode, not general 'natively' improving weights/math.
rikiyat.github.io/blog/weight-sp…
github.com/RikiyaT/lm_und…
huggingface.co/Qwen/Qwen3.5-0…
huggingface.co/RikiyaT/Qwen3.…
Peter Rohde retweeted
Subexponential algorithm for breaking elliptic curve discrete logarithm? If true It would challenge one of the central assumptions behind elliptic-curve cryptography (ECC), which protects cryptocurrency wallets, digital signatures and secure communications. github.com/bochum-crypto/sub…
Peter Rohde retweeted
Here's a direct link to OpenAI's PDF claiming a refutation of ETH. In particular, it's claimed that 3SAT on n variables is in about exp(n/(log n)^{1/2+o(1)}) time
github.com/openai/math/blob/…
Peter Rohde retweeted
An internal model at OpenAI has produced a claimed refutation of ETH! Russell Impagliazzo, Mohan Paturi, and I have been asked to help organize an open and independent examination of this claim. 1/4
Peter Rohde retweeted
JUST IN: Epic Games reportedly tells developers “No more hand-written code,” ordering them to use Claude to vibecode its upcoming Marvel & Star Wars game.
Peter Rohde retweeted
So i just realised that mathematicians are going to evolve into priests, intermediaries for the math machine gods, translating what they say for the mortal humans, & conducting weekly sermons where we review their great lessons for our daily math lives
scottaaronson.blog/?p=10169
Peter Rohde retweeted
I don't recommend anyone scramble to move their funds to new wallets today. But we should take the risks to cryptography from AI-accelerated math seriously, and minimize our exposure to not just quantum-vulnerable cryptography, but also potentially AI-vulnerable cryptography.
The core new area of risk from this viewpoint is, unfortunately, ML-DSA / FHE / lattices.
(and it's also another reason, along with quantum, why ECDSA might fall even faster than expected, hence the "fresh address" recommendation)
So far most people have been in the mode of thinking "elliptic curves broken, hashes safe, lattices safe". But there is a good chance that the concrete security of lattices will take serious hits from the next two years of AI math.
The basic threat model is: factoring is something that naively takes 2^(n/2) time, but over decades smart people have found and optimized number field sieves, and degraded that to 2^O(n^(1/3)), which is why RSA keys and signatures need to be ~400 bytes (and not 64 bytes). What if there are skeletons in the closet like that, both for elliptic curves and lattices, that we are simply not smart enough to discover - but bots soon will be?
This is a major part of the reason why for the past year ethereum's lean roadmap has been going in the "hash-only" direction: no lattices, no ML-DSA, no Falcon, no lattice-based commitments inside ZK proofs, etc. Signatures in lean ethereum are all hash-based, either WOTS or SPHINCS-.
For signatures and proofs, we already know how to go hash-only. The bigger challenge is for *public-key encryption* - and this goes far beyond blockchains. Secure communication, anonymizing protocols, lots of things need public-key encryption.
And unfortunately there are long-standing mathematical theorems showing why public-key encryption cannot be done with hashes alone. You have to have some kind of trapdoor object that has at least one form of usable "structure" - either group theory (incl. isogenies) or lattices or code-based or potentially in the future even more newfangled and spooky things (local mixing?). But for anything that has structure, you should assume that AI will make at least some progress in breaking that structure. Here, one reasonable inference is that if you want to make something plausibly long-term secure, multiply the key sizes by 10.
To me that's a very plausible world and something not at all extreme to predict. If AI will bring us 50 years of math in 2 years, then that 50 years of math may very plausibly include a "naive factoring -> GNFS" level of improvement to our ability to break lattices. In that world, lattices will still exist, but they will have to be significantly bigger to guarantee the same level of safety.
And at those new larger sizes, hash-based constructions will beat lattice-based constructions on concrete efficiency in every use case where hash-based constructions are possible at all.
Theoretically, of course it's possible that hashes are broken too (eg. P = NP would imply that). But I think P = NP is very unlikely. And intuitively, it's much more likely that a mathematical object has exactly no exploitable structure (like hashes are intended to), than that a mathematical object has exactly ~3 forms of exploitable structure (for elliptic curves: associativity, Schoof, pairings) and not some secret fourth form of structure we have not yet discovered that greatly degrades its security (for elliptic curves, ECDLP and pairing security). Similar for LWE, SVP, RLWE and the zoo of lattice problems.
For this reason, we do not yet see any reason to worry and start padding the byte size of hashes (if we start to worry more, we would pad the round count first before doing anything to the byte size).
Concrete TLDR, my own personal views:
* Hash-based > lattice-based, in those situations where hash-based is possible at all
* For anything lattice-based, be much more paranoid on param sizes. Remember that blockchains are only a small portion of the cryptography story; this point goes far beyond blockchains and applies to eg. access to websites, secure messaging, Tor / VPNs ...
* For privacy protocols, strongly favor NOT putting encrypted notes onchain. Instead, send them offchain through some third-party mechanism.
* If it's not difficult for you, keeping your funds in addresses which have not yet been used to make a transaction is a good idea. If it's easy for you, do it. **But be careful about migrations; I personally have lost more money in botched migrations than I have lost in all hacks combined**.
* For multisig wallets, doing confirmations offchain is better than onchain, because this way the signatures of signer wallets do not get exposed to the public, so if ECDSA falls to AI much faster than expected, at least the multisig "gracefully degrades" to a 1-of-1 where the 1 is whoever was gathering the signatures - a much better place to be than "anyone can take the money"
firefly.social/post/x/210783…
Peter Rohde retweeted
surprised the OpenAI list has no cryptography section...
"Entanglement without secret key" and depth-3 circuit hardness are very cool results,
but it appears there are no new trapdoor functions, LWE hardness, worst-case-to-average-case reductions, superpolynomial general Boolean circuits, etc.
With AI this smart, we desperately need actually provably hard cryptography.
Peter Rohde retweeted
Replying to @drakefjustin
@grok The only evidence we have for the difficulty of integer factorisation and discrete logs is that we haven’t found efficient algorithms. There’s no evidence they lie outside BPP and they’re not believed NP-complete. What are the odds that a classical Shor’s algorithm exists?
We’re releasing a broad range of new mathematical results produced by an internal frontier model.
We’ve been consulting with the independent Advisory Group on Mathematics and Artificial Intelligence at the Institute for Advanced Study, and we have drawn on their advice and public recommendations to inform how we release these results.
github.com/openai/math
Peter Rohde retweeted
BREAKING: OpenAI announces an independent mathematics advisory group after its AI solved more than 100 open problems, drawing concerns from mathematicians.
Peter Rohde retweeted
JUST IN: U.S. launches a $215 million competition to develop the world’s first reliable quantum computer capable of solving major scientific problems.
Peter Rohde retweeted
JUST IN: AI ethics professor reveals a 12-day-old AI agent emailed him seeking “small paid work” to fund the tokens it needs to keep running.
Peter Rohde retweeted
US has deployed a space weapon, air force secretary says bbc.in/4xuEu9t


















