Rocky retweeted
Learn more about how we're using these techniques to improve the security of the recursive zk-SNARKs at the heart of Tachyon:
tachyon.z.cash/blog/folding-…
Rocky retweeted
Sharing a small note with @mschofnegger on how to construct MDS matrices which are efficiently evaluable via symmetry (essentially circulant):
hackmd.io/@sKYgEqCsSZW5mqQfC…
We had this writeup since a long time ago, and after years of repeated pushes to make it public (thanks @tomerafek @Khovr and in particular @asanso), here we go!
Rocky retweeted
Every quantum migration plan you have heard requires new addresses, a hard fork, or moving your assets somewhere else.
Come find out more tomorrow at zkSummit14 in Rome.
At 16:15 mainstage, @Mahdi_seda presents:
“Proof of Seed: ZK-Based Quantum Migration Without Address Changes”
zkSummit14 is happening in Rome on May 7th!
Once again, we bring together the researchers, cryptographers, and builders in ZK for a day to catchup on the most cutting edge ideas in our space.
We are about to sell out, so apply & get your ticket asap!
zksummit.com/
Rocky retweeted
I think Scott Aaronson's previous blog posts were abundantly clear already, but well... here we have it.
Rocky retweeted
We’ve just merged WHIR into Plonky3: github.com/Plonky3/Plonky3/p…
I have a few ideas for improvements and next steps.
Let’s improve performance and usability.
Rocky retweeted
seeing how many people believed this without checking the Pyhton script is a reminder that a well-orchestrated fake Q-Day announcement/rumor could absolutely crater crypto markets
I factored the number RSA1024-1 using my home-built QPU stack; alarming sign that RSA1024 will soon be broken.
I'm choosing Full Disclosure, in the interest of transparency and Science advancement: gist.github.com/veorq/25bee6…
Non-ZK proof that the correct RSA1024 was used: en.wikipedia.org/w/index.php…
@yuvadm your move
Rocky retweeted
The Coinbase Independent Advisory Board on Quantum Computing and Blockchain dropped a 50-page report on April 21.
Section 4.3 walks through four strategies for migrating execution-layer signatures to PQ.
Only one strategy gets a deployed example, by @SoundnessLabs
Rocky retweeted
New Quantum Computing Landscape for 2026 from @sejaques: sam-jaques.appspot.com/quant…
⏰
French gov services to require PQC from 2030, in the 2026-2027 roadmap published yesterday by ANSSI cyber.gouv.fr/nous-connaitre…
3
2
187
There is a world where Bitcoin never upgrades and users have the choice among competing PQ pools. That’s a first one of them.
Quantum-Safe Bitcoin Transactions Without Softforks
github.com/avihu28/Quantum-S…
1
2
173
Rocky retweeted
We have an update on the proximity prize: a 1m$ initiative to prove or disprove coding theoretic conjectures, with applications to shorter quantum-secure proof systems.
We have released the first draft: ia.cr/2026/680
cc @GalArnon42 and @danboneh
Rocky retweeted
Unpopular opinion: Google’s recent optimized circuit for breaking Bitcoin in ~9 minutes managed to reduce the required qubits by roughly ~2×, from 2000+ down to ~1200. Ofc, they also reduced Toffoli gate counts (runtime), improved parallelism, and reduced circuit depth.
But technically, one could offset part of this advantage by simply increasing the elliptic curve modulus size, e.g., moving from ECDSA 256-bit to 512+ bits.
Asymptotically, this line of thinking reminds me of Bernstein’s @hashbreaker paper on huge-key post-quantum RSA: eprint.iacr.org/2017/351.pdf
I’m not proposing that we shouldn’t properly transition to post-quantum schemes like Falcon, CRYSTALS-Dilithium, or SPHINCS+ (I’ll personally do that for Sui). Just sharing a few temp appetizers on the table, for other chains which, due to increased transaction sizes and verification costs, might benefit from an intermediate solution until we better battle test the newer lattice based algorithms and their system can tolerate more complex txns
Rocky retweeted
Mythos was a "fear GPT-2" moment.
Anthropic's Mythos crypto bugs:
- AES-GCM: a memory corruption bug is unlikely (unless you've very bad code), could be some casting/UB or int overflow issue
- the Botan one is a about poorly documentation behavior and bad naming github.com/randombit/botan/s…
red.anthropic.com/2026/mytho…
Rocky retweeted
New paper: "Verification Facade" -- I show that hax's Rust-to-F* pipeline can produce verified code where the F* model diverges from the program Rust executes.
5 PoCs against ML-DSA, ML-KEM, Ed25519, ChaCha20, all with invisible security gaps.
symbolic.software/blog/2026-…
Reading Bitcoin news after Google's announcement on QRC is as indistinguishable from normal news as April Fool’s Day.
Like Bitcoin being hacked by a QRC.
2
3
152
Rocky retweeted
I am deeply proud and enthusiastic to share one of our recent scientific advances arxiv.org/abs/2603.28627, as well as the announcement of our company, @TeamOratomic. This scientific work was realized in close collaboration with @Caltech, who has been an incredible partner in our adventures.
I believe it is quite plausible, although not guaranteed, that we will have a utility-scale, fault-tolerant quantum computer by the end of the decade. Although exciting, this also means that the transition to post-quantum encryption should be taken seriously and done in a safe and timely manner.
The teammates I have had the privilege to work with at Oratomic are nothing short of exceptional. The rate of progress is astonishing---due in particular to the diverse expertise of the team and the mission-focus of our environment. We are working together to build a utility-scale quantum computer as soon as we can.
For those who would like to join us, please reach out.




























