zero savvy 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…
zero savvy retweeted
We are living in interesting times in Cryptography: McEliece security being reduced drastically, new records in RSA factoring (saweis.net/posts/rsa-896.htm…) showing attacks on RSA-1024 to be practical, a concrete attack on Chaum's blind signatures (github.com/ucsd-hacc/NSNFSSS…),
zero savvy retweeted
Breaking Math News!
Code: WTF!
Yesterday, Sabine Hossenfelder @skdh posted a comment that, "GPT 5.6 just solved one of my maths problems that GPT 5.5 insisted for 6 months is unsolvable."
xitter.cf/skdh/status/2088230080…
I replied asking if she could use her chatGPT account to help resolve a conjecture I made in a paper I published in 1988, the so-called p-defect zero conjecture by running it through AI.
Overnight at least 3 different mathematicians did exactly that, finding a counter-example to the general case. For example,
"For G = PSU₃(5), p = 2, a degree-144 irreducible character has 2-defect zero, but its permutation index is n(χ) = 2." - @jonamaccarello
Thanks also to @eSlackPhysics and any others who gave it a go.
Moreover, Sabine's prompt created a full proof in the case that the group's order was divisible by at most 2 primes, which I stated at the end as a result two colleagues had shown, but I had never seen a proof.
So now they are running the code to find a "solvable" counter-example or check whether there is a counter-example for a prime other than p = 2. To dive deeper into what might be true.
All I can say is that for nearly 40 years this has been an open problem, and a few simple prompts and double-checks and chatGPT 5.6 has now solved it overnight.
Maths is in crisis -- that's for sure.
Thank you to all who worked on this, and here is a link to my original paper.
ijmp.org/wp-content/uploads/…
zero savvy retweeted
Replying to @drakefjustin
Will optimistic rollups have hard time keeping people motivated to use them? . . . Maybe . . . .
zero savvy retweeted
Happy to share that Neo and SuperNeo have been accepted to Crypto 2026!
Looking forward to seeing y'all in Santa Barbara ☀️🏝️
Paper: ia.cr/2026/242
Excited to announce new additions to the Neo family.
With @srinathtv, we introduce SuperNeo, a new lattice-based folding scheme that inherits all the benefits of Neo while eliminating the need for a SIMD constraint system and reducing witness sizes by ~64x (degree-wise)...[1/6]
zero savvy retweeted
One compliment, two omissions, one misleading claim, and one glaring mistake that will come to bite back:
One Compliment:
Going for STARKs (“hash based SNARKs”) is the right move, congrats!
Two omissions:
(1) This conclusion is reached after a long debate over STARKs vs SNARKs. We know this debate well since much of the research into Poseidon was led by StarkWare, and funded by the EF. It's good to see the industry converging around STARKs
(2) Small binary fields were introduced into the world of ZK proofs long before Binius and Flonk, in the ZK STARK paper of 2018. It was already shown there that certain *standard* cryptographic primitives are efficient over it.
One misleading claim:
Prime field STARKs need not be over *large* primes. FYI - Stwo is over M31, a 31-bit field, making it very efficient.
One glaring mistake that’ll bite back:
Binary field multiplication is inefficient over GPUs, whereas small prime multiplication (like Stwo/M31) is.
Will this mean that GPUs binary field based constructions will face challenges that won’t be that easy to overcome? You tell me.
Overall, glad to see this direction.
Go ZK-STARKs!
Goodbye, Poseidon!
An epic 8-year, 8-figure rabbit hole in post-quantum cryptography reaches its dream conclusion. The Ethereum Foundation is abandoning Poseidon for L1, pivoting to SHA or BLAKE. This milestone unlocks ultimate security for lean Ethereum and foreshadows a golden era of hash-based cryptography.
Since 2018, the Ethereum Foundation has invested in magic cryptographic bricks, so-called "SNARK-friendly hashes". In 2019, Poseidon was born. It held strong and became the dominant SNARK-friendly hash, securing billions via zkrollups and zkVMs.
In a stunning reversal, breakthrough SNARK designs show that SNARK-friendly hashes aren't necessary after all. Off-the-shelf traditional hash functions like SHA2 and BLAKE2s can now match Poseidon in a SNARK. In hindsight the key was not SNARK-friendly hashes, but hash-friendly SNARKs.
The secret is doing maths over the smallest prime number: 2. So-called "binary fields" natively speak the language of bits, aligning with the boolean operations inside traditional hashes. This is a stark departure from "prime fields", where awkward large-prime arithmetic makes bit manipulation painfully expensive.
We're talking sci-fi cryptography. 1M traditional hash calls proven per second, on a laptop. Just 100x overhead vs native CPU boolean compute. Nobody predicted such performance, not even the handful of binary-field visionaries. Hat tip to the research geniuses: Jim and Ben with Binius in 2023; Ron, Benedikt and William with Flock in June.
With SHA2, the lean aesthetic of minimal assumptions reaches its climax. The EF's principled stance on pure hash-based cryptography has aged like fine wine. We now enjoy foundations the world can trust for decades and centuries, foundations worthy of the dream of an internet of value.
Speed of deployment is a secondary win. There's no longer a need to wait years for Poseidon cryptanalysis to bake. Emile and Thomas from the EF post-quantum team are moving at breakneck speed with binary fields. The strawmap now points to a production-grade leanVM in 2027, with CL, DL, EL deployments in 2028.
As AI becomes exceptional at cryptanalysis, the contrarian bet to avoid riskier structures like lattices and isogenies is visibly paying off. The past weeks have been brutal. Lattice-based "HAWK" and isogeny-based "SQIsign", both signature schemes in NIST's Round 3, have suffered blows. Sources I trust say more blood is coming.
On AI, the open autoresearch trend kicked off by ECDSA[.]fail is spreading fast, with amazing outcomes from zk[.]golf and SNARK[.]fast. Days ago SNARK[.]fast crossed 1.8M BLAKE3/sec proven on an M3 Max. Stay tuned for fresh autoresearch challenges dropping tomorrow.
Also tomorrow: Ethproofs call #10, dedicated to binary fields. Possibly the most noteworthy Ethproofs call yet. Experts leading the charge will present the future of hash-based SNARKs at 2pm UTC. What an incredible time to be alive. To witness history, DM me for a calendar invite :)
Today I can confidently claim that hash-based cryptography has won out for blockchain post-quantum signatures. SNARK succinctness compresses arbitrarily many signatures into one small proof per block. SNARK flexibility yields k-of-n threshold signatures, complex multisigs, and more.
Ultimate security. Uncompromising performance. Full programmability.
Believe in something. Believe in hashes.
zero savvy retweeted
Proving standard hashes matters for the post-quantum transition of blockchains, so: what's the simplest proof system to reach the "escape velocity"? Turns out old techniques can get you past both Ethereum's and Bitcoin's requirements!
In eprint queue from a few days!
Accepted to TCHES 🚀
Vector commitments over media sequences are expensive for capture devices & don't align with @C2PA_org standards. We introduce a trustless delegation mechanism and generate a Nova (@srinathtv) proof binding it to the signed hashchain
eprint.iacr.org/2025/1528
zero savvy retweeted
1/ Initial reactions after some hours with this groundbreaking result proving the NP-hardness of poly-approx CVP/NCP:
It is most likely correct, but more importantly, it is original, elegant, and beautiful!
(Also: it is easy to improve, quantitatively.)
zero savvy retweeted
Thrilled to share that our paper won the Distinguished Paper Award at CSF 2026! 🚀 Proud of this work and incredibly grateful for my brilliant co-authors. Check out our research on Symbolic Cryptography in Lean! 👇 eprint.iacr.org/2025/1700
It's our #MyXAnniversary and we're launching a new blog series on our projects.
First up: ZK Remote Attestation (zRA)—how to verify software integrity at scale and w/o interaction.
zerosavvy.xyz/blog/zero-know…
Feedback is always welcome. #Zero_knowledge #remote_attestation
zero savvy retweeted
Super excited for tomorrow 🤩
Main venue. Included in your @EFDevcon ticket 🦄
See you privacy nerds tomorrow!
zero savvy retweeted
🔥 Incendia deep dive incoming !
Catch our ambassadors (@lovely_necro) talk TODAY in the Yellow pavilion, XL stage at Devconnect Argentina @EFDevcon
Don’t miss it 👀
#ethereum_privacy_stack
zero savvy retweeted
We just got a thumbs up from Vitalik @VitalikButerin 😎🪱
zero savvy retweeted
Very special speech will open Cypherpunk Congress: @rstormsf x Freeromanstorm.com
Developers are defending your civili liberties.
They stand for your future.
Support the cause.
Together: congress.web3privacy.info


























