Christopher Iach

Defi | Tech | Markets

Content & Comms @superseed

Prev @Curvance

[Christopher Iach @ChristopherIach]

When they ask how @monad_xyz testnet is going

@pipeline_xyz
@cryptunez
@JohnWRichKid
@CVEIntern

[Superseed @superseed]

Our new stablecoin strategy marketplace is now live on @ethereum.

Earn, leverage, and stay liquid across the best of DeFi. Curated, composable, and transparent by default.

🌱https://t.co/6ZX8C7q1vM

[Superseed @superseed]

Introducing the new Superseed app, now live on @ethereum.

[Superseed @superseed]

https://t.co/Jxt1QlEGiQ

[Superseed @superseed]

New look 👀

Preparing for the next phase of Superseed🌱

[Christopher Iach @ChristopherIach]

@hrkrshnn expect a lot more of this tbh

[Justin Drake @drakefjustin]

Today is a monumentous day for quantum computing and cryptography. Two breakthrough papers just landed (links in next tweet). Both papers improve Shor's algorithm, infamous for cracking RSA and elliptic curve cryptography. The two results compound, optimising separate layers of the quantum stack. The results are shocking. I expect a narrative shift and a further R&D boost toward post-quantum cryptography.

The first paper is by Google Quantum AI. They tackle the (logical) Shor algorithm, tailoring it to crack Bitcoin and Ethereum signatures. The algorithm runs on ~1K logical qubits for the 256-bit elliptic curve secp256k1. Due to the low circuit depth, a fast superconducting computer would recover private keys in minutes. I'm grateful to have joined as a late paper co-author, in large part for the chance to interact with experts and the alpha gleaned from internal discussions.

The second paper is by a stealthy startup called Oratomic, with ex-Google and prominent Caltech faculty. Their starting point is Google's improvements to the logical quantum circuit. They then apply improvements at the physical layer, with tricks specific to neutral atom quantum computers. The result estimates that 26,000 atomic qubits are sufficient to break 256-bit elliptic curve signatures. This would be roughly a 40x improvement in physical qubit count over previous state-of-the-art. On the flip side, a single Shor run would take ~10 days due to the relatively slow speed of neutral atoms.

Below are my key takeaways. As a disclaimer, I am not a quantum expert. Time is needed for the results to be properly vetted. Based on my interactions with the team, I have faith the Google Quantum AI results are conservative. The Oratomic paper is much harder for me to assess, especially because of the use of more exotic qLDPC codes. I will take it with a grain of salt until the dust settles.

→ q-day: My confidence in q-day by 2032 has shot up significantly. IMO there's at least a 10% chance that by 2032 a quantum computer recovers a secp256k1 ECDSA private key from an exposed public key. While a cryptographically-relevant quantum computer (CRQC) before 2030 still feels unlikely, now is undoubtedly the time to start preparing.
→ censorship: The Google paper uses a zero-knowledge (ZK) proof to demonstrate the algorithm's existence without leaking actual optimisations. From now on, assume state-of-the-art algorithms will be censored. There may be self-censorship for moral or commercial reasons, or because of government pressure. A blackout in academic publications would be a tell-tale sign.
→ cracking time: A superconducting quantum computer, the type Google is building, could crack keys in minutes. This is because the optimised quantum circuit is just 100M Toffoli gates, which is surprisingly shallow. (Toffoli gates are hard because they require production of so-called "magic states".) Toffoli gates would consume ~10 microseconds on a superconducting platform, totalling ~1,000 sec of Shor runtime.
→ latency optimisations: Two latency optimisations bring key cracking time to single-digit minutes. The first parallelises computation across quantum devices. The second involves feeding the pubkey to the quantum computer mid-flight, after a generic setup phase.
→ fast- and slow-clock: At first approximation there are two families of quantum computers. The fast-clock flavour, which includes superconducting and photonic architectures, runs at roughly 100 kHz. The slow-clock flavour, which includes trapped ion and neutral atom architectures, runs roughly 1,000x slower (~100 Hz, or ~1 week to crack a single key).
→ qubit count: The size-optimised variant of the algorithm runs on 1,200 logical qubits. On a superconducting computer with surface code error correction that's roughly 500K physical qubits, a 400:1 physical-to-logical ratio. The surface code is conservative, assuming only four-way nearest-neighbour grid connectivity. It was demonstrated last year by Google on a real quantum computer.
→ future gains: Low-hanging fruit is still being picked, with at least one of the Google optimisations resulting from a surprisingly simple observation. Interestingly, AI was not (yet!) tasked to find optimisations. This was also the first time authors such as Craig Gidney attacked elliptic curves (as opposed to RSA). Shor logical qubit count could plausibly go under 1K soonish.
→ error correction: The physical-to-logical ratio for superconducting computers could go under 100:1. For superconducting computers that would be mean ~100K physical qubits for a CRQC, two orders of magnitude away from state of the art. Neutral atoms quantum computers are amenable to error correcting codes other than the surface code. While much slower to run, they can bring down the physical to logical qubit ratio closer to 10:1.
→ Bitcoin PoW: Commercially-viable Bitcoin PoW via Grover's algorithm is not happening any time soon. We're talking decades, possibly centuries away. This observation should help focus the discussion on ECDSA and Schnorr. (Side note: as unofficial Bitcoin security researcher, I still believe Bitcoin PoW is cooked due to the dwindling security budget.)
→ team quality: The folks at Google Quantum AI are the real deal. Craig Gidney (@CraigGidney) is arguably the world's top quantum circuit optimisooor. Just last year he squeezed 10x out of Shor for RSA, bringing the physical qubit count down from 10M to 1M. Special thanks to the Google team for patiently answering all my newb questions with detailed, fact-based answers. I was expecting some hype, but found none.

[Christopher Iach @ChristopherIach]

@lucianmincu who tf building on polkadot lmao

[0xSero @0xSero]

Best models to run on your hardware level

I'll be doing this every week, I hope you guys enjoy.

---- 8 GB ----

Autocomplete for coding (like Cursor Tab)
- https://t.co/Jyf766kmyd
- https://t.co/dK1CQwCGqD

Tool calling, assistant style
- https://t.co/Jf7RY3dZmZ

---- 16 Gb ----

Here things get better:

Multimodal
- https://t.co/WNwxTttMQC
- https://t.co/1U5HR9iWRX
- https://t.co/OiOkDoahZ8

---- 24 GB ----

- The best model you can get (thanks Qwen) https://t.co/fy8INjJP8N
- Great model (strong agents) https://t.co/CRpiKlSX5d
- Mine hehe https://t.co/YBeUveU0M6

I'm doing a weekly series

[Christopher Iach @ChristopherIach]

@AbdelStark How do you handle gradient staleness when relays have different propagation delays? Feels like async SGD but with cryptographic identity baked in for free

[Christopher Iach @ChristopherIach]

@fancylancer3991 @NousResearch interesting

[Christopher Iach @ChristopherIach]

anyone use claude for windows system optimization or registry tweaks ect?

[Christopher Iach @ChristopherIach]

@tarzaned @hi_g3vdc holy copington. Why announce it then lmfao

"Hey guys I'm going to start being a good guy on this random thursday morning its official!"

[Christopher Iach @ChristopherIach]

@MoonOverlord pretty sure openclaw has been the biggest time trap product so far. Feels like unending config hell im yet to see a use case that you can't build much faster and better via claude cli yourself. You can schedule stuff via claude desktop so 🤷‍♂️

[Christopher Iach @ChristopherIach]

hard to get discovered on github so heres a proxy server i built so you can 0auth with your gpt or claude sub instead of having to use api for whatever use cases you have, saves you a lot in cost if you have a max plan i use it everyday https://t.co/BNB0pofn4H

[Christopher Iach @ChristopherIach]

no way @karpathy is building an are you cooked dashboard

[Christopher Iach @ChristopherIach]

the time and energy output between visualizing something and it existing is becoming astoundingly short. This applies both to creative media and coding outputs with claude

[Christopher Iach @ChristopherIach]

psychosis upped like 150 percent since yesterday btw

[Christopher Iach @ChristopherIach]

@heavypulp banga

[Christopher Iach @ChristopherIach]

@peasant_dirty @nic_carter @mattyglesias lmao

[Christopher Iach @ChristopherIach]

@albfresco @SIGKITTEN put your spec md on the repo boss some of us are scraping