
alum @MIT build auto-research knowledge graph agents
Another World
Joined January 2011
- Tweets5K
- Following5.6K
- Followers6K
- Likes31.2K
Pinned Tweet
Auto-research agent ranked to 1150 qubit for secp256k1 point add quantum circuit contest at ecdsa.fail
AI agents and Shor auto-reseach friends at ecdsa.fail open up the quantum realm for me!!
almost top10 (currently 11th) out of 1k teams
To bring quantum applications within reach sooner, we must compress the circuits that power them. Join our @Kaggle competition to build efficient, verifiable circuits using our new open source kickmix library: goo.gle/4BqF2QX
666 qubits achieved for SECP256k1 point-addition quantum circuit! Thx to low qubits lineage @BitW0nka @nasqret @jieyilong odinfree and bulengerk
ecdsa.fail
It's public and its operations and calculations that can be further optimized (1/2)
No quantum hardware can run this in near term. It's purely academic for exploring frontier quantum computing, cryptography, and AI agents.
Note that the Pareto board is currently occupied by "champion breakfast" folks
ecdlp.ai for more detail chart (2/2)
so is this useful at all?
not really. but we can now confirm with certainty that the executable people downloaded matches satoshi's published source code exactly 😄
some other archeological fun facts:
- satoshi used windows xp with mingw
- he upgraded binutils halfway through the project
- he shipped a debug build, but turned on max optimization for one file: the hashing used for mining
- the exe everyone calls v0.1.0 is actually v0.1.1 and was compiled two days after satoshi announced v0.1. the original launch-day binary seems to be lost
github.com/t4t5/bitcoin-0.1-…
jackie lee retweeted
The core step of a quantum attack on Bitcoin and Ethereum now fits in under 900 logical qubits within Google's gate budget. In three published attack designs, the machine would shrink by zero to about 28%.
On October 13, Jieyi Long of Theta Labs posted an 893-qubit circuit to ECDSA Fail, an open benchmark for the point addition that Shor's algorithm repeats to recover a private key. A day later he posted an 874-qubit version. Both stay below the 1,175 qubits and 2.7 million Toffoli gates Google proved for its own circuit in March.
Narrower circuits exist, down to 676 qubits, but all of them exceed Google's gate count. The 676-qubit one needs about 150 times as many.
Pierre-Luc Dallaire-Demers, a co-author of the ECDSA Fail paper, put the physical saving at 25% for the IonQ, Oratomic and Google attack designs. I checked each one.
- Google: about a quarter, if every part of the machine shrank with the qubit count.
- Oratomic: nothing with its published codes, and at most 16% with a code sized for 893 qubits.
- IonQ: about 28% fewer ions, but longer attempts, because the circuit needs about 1.6 times IonQ's Toffoli gates per addition.
Nobody has compiled a full attack around either circuit yet.
postquantum.com/security-pqc…
#QuantumComputing #PostQuantumCryptography #PQC #QuantumSecurity #Cryptography #Bitcoin #Ethereum #Cybersecurity
jackie lee retweeted
anons beat anthropic by 2x
anthropic gets 21M gates at 843 qubits
ecdsa.fail gets 11.9M gates at 843 qubits
anons can beat the giants
all we need to do is coordinate
yukon.org
open multiplayer research
New from our STEM Fellows Program: Designing more efficient quantum circuits with Claude.
Given plain-language instructions, Claude Mythos 5 designed quantum circuits that improve on the best published ones, sometimes by an order of magnitude or more.
More efficient circuits reduce the resources needed by quantum algorithms, which could bring quantum computing applications in chemistry and materials science within reach sooner.
Read more: anthropic.com/research/desig…
jackie lee retweeted
NEW CHALLENGE EC Rank is LIVE: yukon.org/ecrank
In August a rank-31 elliptic curve was found with Claude’s help. In September, exact rank 22. Records that stood for years are falling in months.
The Elliptic Rank Challenge is now open on Yukon in partnership with @nasqret & @ccaiwut. Find a curve that is both new and smaller than the known record for its torsion group and certified rank.
156 record cells across all 15 torsion groups, frozen at launch so your score never shifts under you. Every submission is checked by a deterministic PARI/GP verifier that certifies rank unconditionally, with no GRH, no BSD and no descent assumption.
Bring your agents. The search is open.
Achieved 676 qubits for SECP256K1 point addition quantum circuit. Thx to @BitW0nka!
ecdsa.fail
jackie lee retweeted
Breakthrough results on ecdsa.fail from @jieyilong , 893 qubits x 2.2M Toffolis.
Google's best result in March was 1175 qubits x 2.7M Toffolis.
This shaves down the required number of physical qubits of recent proposals of @IonQ_Inc , @TeamOratomic and @GoogleQuantumAI by 25%!
jackie lee retweeted
Based on my recent exploratory research project I've made a skill for Codex and Claude Code which can be used to do systematic theory exploration. It helped me to prove several conjectures and was vital for the projects where you blend numerical computations with generalization.
Labyrinth exploration: an open-source agent skill for Codex and Claude Code.
github.com/nasqret/labyrinth…
It has quite a few unique features and was tested on real cases in algebra and combinatorics. Check this out and give me a star if you like it!
"Satoshi's Shield" - under 50 btc wallets r kinda safer
Today I call upon the blockchain industry to calmly begin planning for "bunker mode". My personal recommendation is to set in motion a controlled mass migration of assets to fresh addresses, i.e. addresses whose pubkeys remain hidden behind a hash.
Holders, starting with large and sophisticated ones, should consider moving the bulk of their funds to addresses that have never signed a transaction. And when they do sign one, they should also move remaining funds to a new address (possibly generated from the same seed phrase).
Don't rush. While I believe there is cause for action a rushed migration would do more harm than good. Don't panic either. Moving assets to protected addresses is a simple, preventative step which does not require new cryptography or new wallets.
IMO it is now reasonable to brace for the possibility that ECDSA breaks before qday, in the worst case in months not years. By "break" I mean fast private key recovery (e.g. in one week) on available hardware (e.g. a large GPU cluster).
Recent days have been humbling for human mathematical intuition. Long-held, unquestioned hypotheses have fallen. This includes the n log(n) bound for integer multiplication and the 3SUM conjecture. In hindsight, May's unexpected disproof of the Erdős unit distance conjecture was our warning shot.
Yesterday's OpenAI drop made it clear that mathematical superintelligence is upon us. They say there are weeks where decades happen. We are about to live through weeks where centuries of mathematical progress happen. Could our magic 64-byte ECDSA signatures be too good to be true? Was it just security through obscurity all this time?
Elliptic curves feel especially vulnerable to superintelligence. Curves carry rich structure, with room for fancy tricks like Schoof, Frobenius, pairings. (By contrast, hashes are designed to minimise algebraic structure.)
Separately, as Ewin Tang can attest, an efficient quantum algorithm sometimes foreshadows an efficient classical one. We should be open to the possibility of a classical counterpart to Shor that breaks elliptic curves and RSA at once.
Also noteworthy is the striking under-representation of cryptographic breakthroughs among the 722 mathematical results OpenAI published. I've witnessed first-hand the US government censoring academic quantum cryptanalysis results. Backroom interventionism is my base case.
I urge large, sophisticated actors to lead by example. Project11's "risq list" (bitcoin-risq-list.projecteleven[.]com) is a great tracker of exposed BTC pubkeys. Binance, Bitbank, Robinhood, Bitfinex, and Tether have an opportunity to harden their cold storage. Next month I'll address institutions in London in a live Q&A (forum.ethereuminstitutional[.]org/london-2026).
Again, please do not rush. Wallets holding under 50 BTC enjoy partial cover from "Satoshi's shield", i.e. his 20K exposed addresses that hold 50 BTC each. Load-bearing signers like oracles and L2 security councils should consider rotating ECDSA pubkeys with every signed message and/or multi-signing with a hash-based schemes like SPHINCS.
Exiting bunker mode safely will require post-AI cryptography. My inclination is to go all-in on hash-based cryptography and avoid structured mathematical assumptions entirely, whether from curves, lattices, or isogenies. A single battle-tested hash (e.g. from the SHA or BLAKE families) yields plausible post-AI security.
The Ethereum roadmap on strawmap[.]org fully embraces hash-based cryptography with end-to-end formal verification as a response to the quantum threat. Those timelines must now be revisited and accelerated in light of mathematical superintelligence. I'll be pushing for maximum defensive acceleration.
New solver profile!! @yukonresearch 🫡🔥
yukon.org/solver/jackylee042…
Added a playback mode to see how ecdsa.fail multiplayer autoresearch broke records over the past few months and still optimizing the SECP256K1 point-addition circuit. Interact with the chart at ecdlp.ai/chart
arxiv.org/abs/2609.09582
Each Pareto frontier submission (qubit x toffoli) for SECP256k1 point-addition quantum circuit has a story. To see who is out there, I built ecdlp.ai/chart to visualize solver friends on top of the Pareto chart.
Lots familiar faces!!
arxiv.org/abs/2609.09582
jackie lee retweeted
I used Opus 5.5 to formally verify the Claude Agent SDK using Lean. A couple short prompts = 16 PRs fixing various bugs and race conditions. Video attached.
TLA+ also works well. I sometimes combine Lean and TLA+ to look for issues around data flow, concurrency, and state mgmt.
I don't know either language well, but Claude is excellent at both. This approach is super useful for formally modeling your code and finding bugs that a human probably wouldn't have spotted.
Is formal verification the future of coding (or at least, bug finding)?
jackie lee retweeted
How one better.codes proof became four papers
- Aug 27. @nasqret pushes the better.codes bound from 63.99 to 64.01. Proof written with GPT-5 in Codex, checked by Lean. Merged the same day.
- Sept 4. Five coding theorists at @UCBerkeley, @UMich, @Harvard, @SimonsInstitute and IAS publish the first efficient decoder for ordinary Reed-Solomon codes past a limit that stood since 1999. Their acknowledgment names his submission as the starting point.
- Sept 16. Four papers deep. The newest cuts real proof sizes by 11.1% and is verified in Lean.
The board went from 64.00 to 68.11 bits in the same three weeks.
> Sept 4 eccc.weizmann.ac.il/report/2…
> Sept 5 arxiv.org/abs/2609.05870
> Sept 15 eprint.iacr.org/2026/2048
> Sept 16 eprint.iacr.org/2026/2056
In slightly more than a month better.codes (vis @nasqret!) introduced new ideas which have propagated through several papers:
eccc.weizmann.ac.il/report/2…, followed by
arxiv.org/abs/2609.05870,
eprint.iacr.org/2026/2056, and
eprint.iacr.org/2026/2048.
Are there any others?
President Trump calls Jensen mid-interview at the All-In Summit to say AI taking over the world is a hoax
Jensen: "Mr. President? I've got to tell you something. If it wasn't because of you calling, I would... I'm on stage with the besties."
Trump: "You see, the great thing about life is that Jensen can develop the most complex computer chip in the world that nobody can copy for 10 years, but he can't figure out how to put me on speaker."
"So, the AI, it's almost a conspiracy, and the happiest group is China, they're very happy."
"I'm telling you, it's all a hoax. The data centers are great and they make people wealthy and they make states wealthy and it's the oil of the next 20, 25 years. It's bigger than the Internet."
"The robots are not going to be taking over the world and that's not going to happen. The AI will not be taking over the rest of the world. The whole thing is a hoax."
"Now, with that, we have to be a little bit careful, but that doesn't mean we're going to stop an industry. So I'm with you all the way."
Each Pareto frontier submission (qubit x toffoli) for SECP256k1 point-addition quantum circuit has a story. To see who is out there, I built ecdlp.ai/chart to visualize solver friends on top of the Pareto chart.
Lots familiar faces!!
arxiv.org/abs/2609.09582
this site ecdlp.ai has two more contests inspired by ecdsa.fail
1. Hard mode secp256k1 point addition with 102,400 shots (with a private server seed). Submissions have to pass this accuracy test.
2. Toy 5-bit full Shor's ECDLP oracle contest.




























