@projecteleven Once that benchmark is achieved, then it's a matter of scaling up the system. But the interconnect and control complexity I think will still mean that the first cryptographically relevant quantum systems are space-constrained. That's why this work is very relevant. /End

5/ Today, no (known) quantum computer out there can sustain a single logical qubit for any meaningful duration, let alone billions or trillions of operations that would be required for Shor's algorithm. But with the recent breakthroughs in error correction, it feels likely to me that sustaining logical operations (aka increasing the LOB for one logical qubit) is the next milestone

4/ Recall from @projecteleven quantum computing framework described in our research paper: We have 3 relevant metrics: LQC (logical qubit capacity aka circuit width) LOB (logical operations budget aka circuit depth) QOT (quantum operation time) This work drops LQC at the expense of LOB

3/ Two major takeaways: 1) this research is out of China, so anyone who thinks that the quantum computing frontier is constrained to US labs I think is kidding themselves. 2) this drops the requirements for the space-constrained version of Shor's, which imho is the more relevant.

2/ This is the latest iteration of Shor's optimization. Different approaches choose different: - window widths, - coordinate systems, - inversion strategies, - scheduling, - QFT implementations, - measurement strategies, To try and reduce the total spacetime volume requirements (circuit width x depth) for the algorithm.

1/ Required disclaimer: this is *not* a paper describing a quantum computer running Shor's. It is an optimized circuit that a quantum computer capable of sustaining 835 logical qubits *could* run to factor a 256-bit ECC key.

New paper out of China sets the new lower bar for the Shor's algorithm over ECDSA for space-constrained systems. The authors of this new paper use some clever tricks to reduce the cost of point addition (a costly subroutine for ECDLP Shor's) by about 40% 835 logical qubits is the new lower bound for Shor's algorithm. 🧵

It’s time to demystify Mythos. Mythos is not magic. It’s not a doomsday device. It’s the first of many models that can automate cyber tasks (just like coding). OpenAI’s GPT-5.5-cyber can now do the same. And all the frontier models (including those from China) will be there within approximately 6 months. It’s important to recognize that these models do not create vulnerabilities; they discover them. The bugs are already in the code. Using AI to discover and patch them will actually harden these systems. The leap from pre-AI cyber to post-AI cyber means that there will be a big upgrade cycle. After that, however, the market is likely to reach a new equilibrium between AI-powered cyber-offense and AI-powered cyber-defense. Obviously it’s important that cyber defenders get access before cyber attackers. That process is already underway but needs to happen quickly (see point above about Chinese models). Unlike Mythos, GPT-5.5-cyber appears not to be token constrained so it may be the first cyber model that defenders actually get to use.

Is this the exception or is this the rule? Time will tell, but in terms of outcomes (drastically increased concentration of power and wealth among a small slice of industry players), the crypto industry of today has little to do with the cypherpunk/Web 3.0 vision that motivated it's early adherents. Whether that's bad/good/avoidable/inevitable is up for interpretation.

ZK BIP32 derivation proofs, post-quantum and client-side 🤤 An excellent example of what Binius64 is great at, and a potential practical answer for one of the harder questions a chain’s post quantum migration must answer - how do you prove a coin is yours once a quantum attacker can forge the same signature? Instead of signing some message to prove an address is yours, you prove you know how it was derived instead. Signatures don’t survive quantum computers but hashes do and derivation is all about hashes. It’s also super fast; ~240ms proof gen, ~40ms verification, on a laptop, CPU only. Faster than previous work by 16x. And the only security assumption is SHA-256. Pleasure working with @jimpo_potamus on this.

9/ As much as I'd love for the entire world to take a quantum migration plan seriously, the reality is that some digital asset wallets will miss the window. This gives them a fallback: prove ownership through derivation, not signature, even after that window closes.

1/ It's not everyday that my primary cryptographic interests (PQC and ZK) collide. But today is one of those days! Excited to announce this collaboration between @projecteleven and @jimpo_potamus (lead maintainer of Binius) for post Q-Day wallet recovery using a ZK proof-of-seed-phrase.