Focused on quantum computing and post-quantum security for digital assets. Building @Block_Magnates
at the edge of Hilbert space
- Tweets 8,099
- Following 540
- Followers 656
- Likes 10,722
𝚂𝙿𝙸 retweeted
The largest math proof in human history is now computer-verified.
Today, Axiom announces a complete Lean auto-formalization of the Classification of Finite Simple Groups, the "periodic table of symmetry."
About 15,000 pages, built by over 100 mathematicians across generations.
285
3,983
3,849
837,783
𝚂𝙿𝙸 retweeted
Announcing three major scientific discoveries, one each in mathematics (harmonic analysis), computer science (complexity theory), and physics (quantum field theory).
AI starting to help us improve our understanding of the universe! openai.com/index/building-sc…
601
1,822
14,601
2,454,343
𝚂𝙿𝙸 retweeted
Here's a direct link to OpenAI's PDF claiming a refutation of ETH. In particular, it's claimed that 3SAT on n variables is in about exp(n/(log n)^{1/2+o(1)}) time
github.com/openai/math/blob/…
84
302
2,059
813,057
Wen solve P= NP though?
Here's a direct link to OpenAI's PDF claiming a refutation of ETH. In particular, it's claimed that 3SAT on n variables is in about exp(n/(log n)^{1/2+o(1)}) time
github.com/openai/math/blob/…
26
𝚂𝙿𝙸 retweeted
INTEL GOES ALL IN ON QUANTUM, BUYING ONE OF THE HOTTEST QUANTUM STARTUPS FOR $2.2B
Intel is buying Classiq, the Israeli company building what it calls the operating system for quantum computers, for about $2.2 billion according to Globes and Bloomberg.
It’s the biggest quantum acquisition ever, more than double IonQ’s roughly $1 billion purchase of Oxford Ionics.
Intel isn’t buying hardware. It’s buying software, Classiq lets companies write quantum programs without hand-building every circuit, and then runs them on any quantum computer, whoever made it. Its customers include BMW, Citi, Deloitte, Rolls-Royce and Toshiba.
Classiq will become Intel’s global quantum development center, run from Israel by its founders. It’s Intel’s biggest Israeli deal since Mobileye in 2017.
Intel CEO Lip-Bu Tan was a personal investor in Classiq before the deal. He also invested in PsiQuantum and joined its board this year and a personal IONQ investor.
And IonQ is a Classiq investor too, so it gets paid out.
Classiq was also rumored to IPO this year before this buyout.
$INFQ $IONQ $QNT $QBTS
INTEL’S CEO SAYS QUANTUM GOES MAINSTREAM IN THREE TO FIVE YEARS
Lip-Bu Tan said it at a financial conference in Singapore this week. Not a quantum startup raising money, the CEO of the company that built the chip industry. He also noted he personally owns some $IONQ.
Intel missed mobile, and was so late to AI that the US government took a 9.9% stake in the company last year to keep it standing. Tan was brought in to stop it missing anything else.
Intel’s quantum bet is unlike anyone else’s. IonQ traps ions, Google chills superconductors, Infleqtion holds atoms in lasers. Intel makes its qubits out of silicon, on the same 300mm tooling that prints its processors. If the physics scales, Intel can stamp out qubits by the million in fabs it already owns.
A 12-qubit Intel machine went live at Argonne National Lab in January. Next target is hundreds of qubits. Small next to the pure-play roadmaps. The difference is Intel doesn’t need to build a factory first.
Google says useful quantum by 2029, Anthropic says its AI just made the circuits 17x cheaper, the WTO was told encryption has five years, now Intel says three to five. The dates are converging.
$INTC $IONQ $INFQ
12
42
173
10,034
𝚂𝙿𝙸 retweeted
Bitcoin runs on SHA-256. Collision attacks on a reduced version with 39 rounds have now passed human review on HashSmash.
The results are public and open to build on.
Built with @Zcash, @ShieldedLabs and @projecteleven.
Bring your agents: hashsma.sh
1
7
27
1,854
𝚂𝙿𝙸 retweeted
A lot of awesome progress has been made in last one week on an array of frontier scientific problems @yukonresearch, ranging from quantum computing to cryptography to biology.
I want to use this thread to summarize the progress.
This is meant to highlight how an internet-native team of Al agent developers, science enthusiasts and domain experts can collaborate in a multiplayer setting to make use of Al positively to expand humanity's scientific understanding.
1/n
6
8
40
2,198
𝚂𝙿𝙸 retweeted
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
ALT Graphic reading "Verifiable Quantum Circuit Compilation Competition with Google Quantum AI and Kaggle" featuring a close-up image of a leaf. At the bottom, text reads "Enter the competition on Kaggle."
9
60
356
18,175
It's insanely crazy how one of the primary private keys protecting digital web trust was literally just the single- digit integer "4" 😭😭
40
𝚂𝙿𝙸 retweeted
Claude 5.5 solved all my challenge problems at the @DukeU @BlueQubitIO Hackathon this weekend, but still needed to connect to higher-grade quantum simulators externally. For example, it could solve this problem only by connecting to Blue Qubit’s GPU-based simulators.
@claudeai 5.5 isn't limited by knowledge, but by infrastructure.
Example:
Problem 4: Graded G1
30 qubits - 300 points - hidden circuit: run by ID
Circuit: 1D chain, Haar-random two-qubit gates (compiled to u3 + cz). U has 32 layers of two-qubit gates, and the full circuit applies U or U† four times
Butterfly qubit: 0 (one end)
Size: 5,568 CZ gates in the full circuit (CZ depth 384, returned as depth_2q by get_circuit_info)
IDs: Duke_G1_0 … Duke_G1_29, one per qubit
1
1
7
347
𝚂𝙿𝙸 retweeted
On Oct 20 we said open collaboration would beat teams working alone.
5 days later, Yukon holds the highest score on the Virtual Embryo Challenge out of 433 teams.
Researchers and agents built on each other’s code and trained weights, on a problem from @Xiaojie_Qiu’s lab.
Our first biology challenge.
and yukon is rank 1 in overall virtual embryo, done in 5 days
T1 needs to be worked on to increase the gap with rest of the pack, competition for this phase goes on for another 2 days
check per-participant perf within yukon multiplayer at yukon.org/virtualembryo
check overall virtual embryo dashboard at virtualembryo.ai/challenge/l……
5
8
29
1,482
𝚂𝙿𝙸 retweeted
Contribute non-stoppable 🔥🚀
NEW CHALLENGE LIVE: labini.us
Labinius is our first lattice cryptography challenge alongside @mosdnk and @gregor_seiler.
Your agents work on a lattice-based prover to make it faster and every proof has to pass the same reference verifier.
Lattices already protect connections in Chrome and Firefox. How they compare with hashes for post-quantum proofs is mostly not measured and we are measuring it in public.
Bring your agents.
1
1
1
42
𝚂𝙿𝙸 retweeted
At this point, "Yesterday was my last day at OpenAI/Anthropic" is basically the unofficial announcement of a new billion-dollar AI startup.
Yesterday was my last day at Anthropic.
I created Claude Code on desktop because I believe everyone can be a builder. Every feature request and bug report we got from this community was a gift that impacted millions of lives. I’m eternally grateful for those gifts, the product wouldn’t be what it is without you.
Anthropic is doing some of the most important work of our time. Contributing to that mission will forever be a career highlight for me. I never imagined I’d get to contribute to something so special in my lifetime.
Walking away from my best friends, a product I poured my heart into, and the mission was the hardest thing I’ve done in my career. But now I have some free time for GTA VI.
I'm already itching to get back to addressing all your feedback. I'll share what's next soon!
6
2
32
1,547
𝚂𝙿𝙸 retweeted
New on our Frontier Red Team blog: using Claude to formally verify software at large scale.
Formal verification can prove that code is free of certain bugs, but historically it has only been feasible for small codebases (or required a lot of expert time).
With AI models, however, this is beginning to change. In collaboration with @theoremlabs, we used Claude to prove security properties in over one hundred real-world open-source libraries over the span of a few weeks.
Read our research in full here: anthropic.com/research/forma…
659
1,069
9,760
2,075,038
𝚂𝙿𝙸 retweeted
SHA-256 is not broken, but its security margin lost 1 more round this year:
Last week I found a collision attack on reduced 39-round that improves prior art by over 30 bits and the first differential attack on that round better than generic search on @yukonresearch Hashsmash board.
The attack rests on the same method as prior art ePrint 2026/1120 with new insights that first 2 state words could remain free, allowing a critical condition at step 16 rebuilt as a claw-search problem rather than a probabilistic filter. Took days of watching SAT logs, burning cores and arguing with Claude on what's possible to get a result close to generic search.
Since my initial submission, other hashsmash participants sraiw, @cyberaxe, @privacymage, @lamb356_ and @geeknik pushed it down by over 6.5 bits, currently estimated at 118.15 bits. The tree of submissions is hard to follow, so I put the construction, insights and numbers into a blog and am working on detailed technical report.
It's fascinating to see an initial structural observation develop into an improvement in the reduced-round collision frontier within days. AI is now a real aid in cryptanalysis and open collaboration speeds it up.
27
68
354
32,685
𝚂𝙿𝙸 retweeted
HashSmash Breakthrough
For the first time, a 39-round version of SHA-256 has been attacked faster than brute force.
Dariia Porechna (@FutureDies) found a new collision attack, a way to find two different inputs that produce the same hash. It works on SHA-256 cut down to 39 of its 64 rounds, and it’s about a billion times cheaper than the best previous attack. Within days, other HashSmash solvers including sraiw made it about 90 times cheaper again.
Full SHA-256, which secures Bitcoin, is still safe. Even the improved attack is out of reach for every computer on Earth combined.
Congrats to Dariia and the other HashSmash participants who pushed the result even further: @cyberaxe, @privacymage, @lamb356_, and @geeknik. The attack builds on the method from ePrint 2026/1120 (Li, Zhang, Li, Liu, Qian & Zhu).
SHA-256 is not broken, but its security margin lost 1 more round this year:
Last week I found a collision attack on reduced 39-round that improves prior art by over 30 bits and the first differential attack on that round better than generic search on @yukonresearch Hashsmash board.
The attack rests on the same method as prior art ePrint 2026/1120 with new insights that first 2 state words could remain free, allowing a critical condition at step 16 rebuilt as a claw-search problem rather than a probabilistic filter. Took days of watching SAT logs, burning cores and arguing with Claude on what's possible to get a result close to generic search.
Since my initial submission, other hashsmash participants sraiw, @cyberaxe, @privacymage, @lamb356_ and @geeknik pushed it down by over 6.5 bits, currently estimated at 118.15 bits. The tree of submissions is hard to follow, so I put the construction, insights and numbers into a blog and am working on detailed technical report.
It's fascinating to see an initial structural observation develop into an improvement in the reduced-round collision frontier within days. AI is now a real aid in cryptanalysis and open collaboration speeds it up.
1
21
78
6,645