And @grok said it would be extremely hard, practically impossible...
But just like that, the second Breaking RSA milestone, 460-bit RSA has officially been solved!
Another $10k USD has been claimed.
Congratulations to 5GxF8B…Uyh41S on securing the latest verified solution!
Their solution is quite impressive, making use of a GPU-accelerated General Number Field Sieve (GNFS) to solve the milestone in 3.9 hours!
The code will be open-sourced on our website shortly, giving future innovators even more tools to tackle the challenges ahead.
Stay tuned for details on the next milestone.
Onwards and upwards, qbitties! 🩵
#SN63 #Enigma #BreakingRSA @terraquantum_ag
1) we keep more value in alpha by turning off net negative root sell pressure. This means sum of subnet prices increase, TAO revenue increases, validators are selected for and optimized to make the network profitable.
2) teams get steadier investment from large aligned participants (validators) to help tame the volatility of dtao’s small-player-market, which has been lacking in structure and guidance.
3) more alpha exposure means more two-sided markets, more holders, and validators allocating into bad sub networks creates risk for those subnets, EXPOSING bad actors.
4) standardization and transparency around how alpha basket funds are already being created (Mentat Trusted and Crucible).
5) easy and direct exposure for institutional capital into alpha, which doesn’t exist.
6) the reintegration and realignment of the validator class which are smart, technical community members and large holders, looking to apply themselves.
7) it’s already on the chain, as it was the original goal for validators post dTao which didn’t launch in Feb 2025 (25 lines of code)
8) it’s the symmetrical application to Bittensor itself, subnet validators optimize commodities, root validators optimize TAO revenue.
Come to NS this week, i will flesh all of this out.
BREAKING: Grayscale has named Bittensor’s $TAO as a beneficiary of the Anthropic model shutdown.
The asset manager says centralized AI is the single point of failure, and expects investors to rotate into decentralized alternatives.
The next milestone for the Breaking RSA Challenge is now live!
You all demolished the first milestone, so we're ramping up the difficulty.
This next milestone challenges you to break RSA-460 in under 4 hours on an RTX Pro 6000.
If you can be the first to break it, you win $10k!
Think you have what it takes?
Get started here today: https://t.co/40Lj1Li5pY
In case you missed it, we've had a couple of new Open Quantum updates!
The new #SN48 revenue model is now live, giving users access to $50 in free compute and half-priced public workloads through Open Quantum.
Looking ahead, our near-term roadmap includes additional QPUs, expanded SDK plug-in integration, new data asset monetization opportunities, and continued work around alpha repurchases and liquidity strategy.
We also have some exciting new partnerships in the works.
Stay tuned.
#OpenQuantum
In case you needed any more evidence how incredible the Bittensor community is!
Just 14 hours after launch, miners were able to produce a generalized solution for breaking RSA-340. The solution runs in only 8 minutes!
We're just scratching the surface of what is possible with this subnet, but we're thrilled to see the innovations and support that this is already getting.
The next milestone will be published on Monday and just know that it won't be as easy.
The winning solution will be published on our website shortly, so keep an eye out for it and start studying up and working on your solutions for the next milestone!
https://t.co/j7XJP43I4o
Let the games begin. 🍻
“🚨 SUBNET ANNOUNCEMENT🚨
The first Enigma challenge is now live! We've just published the miner code on Github, so you can now begin working away at our Breaking RSA Challenge in collaboration with Terra Quantum.
The first milestone: Breaking an RSA-340 key in under four hours on an RTX Pro 6000.
Whoever submits a generalized solution for this task wins the $10k USD grand prize! Their solution is then made open source and becomes the starting point for the next milestone.
We thank you for your patience for all these months and we're thrilled to see the solutions you all come up with.
Think you have what it takes? Get started with the subnet code here: https://t.co/3Rrkagi9DK
Read more about the challenges here: https://t.co/znyqugHhhb
(Please note that web submissions will not become available until tomorrow. For now, please register a miner to submit your solutions)
Also, make sure to catch today's qBitTensor Labs Live Show: https://t.co/QrFqk4D4ME
Happy hacking <:heart_blue:1395428477770924042>”
Today a crazy quantum story just got wilder.
On March 31, the Google Quantum AI team published a landmark result on Shor's algorithm for elliptic curve cryptography. Technically, the paper was a bombshell: a dramatic 10x improvement over the state-of-the-art. As a stunt and wakeup call to the blockchain space, those optimisations were illustrated on secp256k1, the elliptic curve underlying Bitcoin and Ethereum signatures.
But perhaps the most striking part of the paper was sociological, not technical. Instead of following standard academic process, the optimisations were kept secret, hidden behind a zero-knowledge (ZK) proof. Google's accompanying blog post mentions they "engaged with the U.S. government". The ZK proof demonstrates the existence of algorithmic improvements without leaking details. Academic censorship with ZK, a historic first!
As a co-author of the Google paper I witnessed some of the context surrounding this censorship. To be honest, multiple aspects of that context don't sit well with me. As much as I believe the general public ought to know more, I am limited in my ability to whistleblow. Though let me be clear about one thing: the Google team's professionalism has been absolutely exemplary, and they deserve nothing but praise.
Censorship has a way of backfiring. The Streisand effect, where an attempt to bury something only draws more attention to it, is exactly what's unfolding today. First, Google's key optimisation has been rediscovered by the French. And in a thrilling turn of events, a collaborative Shor-at-home challenge just launched. The initiative, available at ecdsa[.]fail, breached a new Shor world record in a matter of hours.
Let's start with the rediscovery. Just two months after Google's paper, French quantum expert André Schrottenloher cracks the main secret optimisation. His paper, titled "Optimized Point Addition Circuits for Elliptic Curve Discrete Logarithms", landed on the arXiv today. Big congrats to André, who beat several other nerdsnipped experts to it. In a blog post also published today, Craig Gidney, the world expert on Shor optimisations, revealed that he'd been sitting on this very optimisation for a whole year under censorship pressure.
Interestingly, André missed a handful of minor optimisations, both from Google's original publication and from improvements found since. It's plausible there's still plenty of juice left to squeeze out of Shor, and this is exactly what the ecdsa[.]fail challenge is about. The verifier program developed for the ZK proof does double duty, automatically filtering for valid submissions. Dozens of compounding small and micro improvements are rolling in. As of the time of writing there's an 8.4% improvement to Google's circuit, as measured by the product of logical qubit count and Toffoli gate count. Nice!
The nerdsnipping ran deeper than anyone expected. Over the last few weeks it became clear it extended well beyond André and other quantum experts. Behind the scenes, a small army of amateurs quietly got to work. Inspired by Karpathy-style autoresearch, they turned AI on Shor. Ironically, the verifier program for the ZK proof makes an ideal reward function for AIs. The barrier to entry for this modern style of research is refreshingly low, with several non-experts, even a teenager, finding nice optimisations. Get in touch if you'd like to join a Telegram group with fellow autoresearchers :)
Part 2: neutral atoms and qday
The story doesn't end with Google. On the same day Google went public, a stealthy startup called Oratomic published its own Shor paper in a coordinated release. It made a splash, ultimately becoming the most upvoted paper on scirate[.]com, a website ranking arXiv papers.
Oratomic's claim was wild. By building on Google's logical optimisations and applying custom physical optimisations for neutral atoms, they claimed just 10K physical qubits were sufficient to run Shor's algorithm on secp256k1. That number is mind-bogglingly low.
Knowing essentially nothing about neutral atoms when Oratomic's paper landed, I was intrigued and decided to learn more about the tech. I fell straight down the rabbit hole and spent a couple hundred hours on the topic. I got a little obsessed and watched every YouTube video I could find and spoke to a bunch of experts.
My conclusion? The tech is real, very real. Even Google recently decided to start a neutral atom lab, a notable pivot from their sole focus on superconducting qubits. If you care about qday, i.e. the day a quantum computer will break the first piece of cryptography in production, neutral atoms demand your attention. I shared some of my learnings on Shor and neutral atoms in a 30min talk at the ZKProof cryptography conference. You can find it on YouTube by searching "zkproof neutral atom".
Here's an interesting observation about this duo of breakthrough papers: neither Google nor Oratomic say a word about what their results mean for qday. No timelines. Zero. Nada. That is especially baffling given that the whole point of whitehat quantum cryptanalysis is to inform qday estimations and help the general public make good decisions.
So let me attempt to partially fill the silence, similarly to what Scott Aaronson did in his April 29 post. Given everything I know, including scary non-public information, I now put the odds of qday by 2032 at 50%. 10% by 2030.
Anecdotally, the US government has its own date: 2035. Originating at the NSA and later adopted by NIST, it's when branches of the US government will be disallowed from using quantum-vulnerable cryptography. In plain language: with hindsight, that date is a joke and should be discounted entirely. I don't see how NIST avoids being forced to pull it forward by years.
Part 3: post-quantum cryptography
There are good reasons to sound the alarm today, but please do not panic. Rushing carelessly towards immature post-quantum cryptography is a recipe for disaster. IMO a good target date for migration is 2029, roughly 3.5 years out. 2029 happens to be the date selected by Google, Cloudflare, and the Ethereum Foundation.
These days most of my time goes to safely migrating Ethereum towards post-quantum cryptography as part of the broader lean Ethereum effort. There's a lot to do. We need to rip out and replace BLS signatures at the consensus layer, KZG commitments at the data layer, and ECDSA signatures at the execution layer.
The plan to get there is compelling, and is based on hash-based cryptography. Within the Ethereum Foundation we've developed a Swiss army knife called leanVM (github[.]com/leanEthereum/leanVM) powered by the magic of hash-based SNARKs. Thanks to truly exceptional work by Emile, Thomas, and others, its performance is derisked. Regarding security, leanVM is a jewel, a minimal zkVM crafted for end-to-end formal verification and maximum security.
Want to help? There are two $1M initiatives. First, the Proximity Prize (proximityprize[.]org). Solve a long-standing mathematical conjecture in coding theory, improve hash-based SNARKs, and go home a millionaire. Second, the Poseidon Initiative (poseidon-initiative[.]info), offers $1M for breaking Poseidon, the SNARK-friendly hash function.
Open Quantum is working with @coschoolofmines on their 5-week capstone project focused on predictive modeling for quantum circuits!
Building on work first explored at iQuHACK, a group of four Computer Science students will be working to develop a model that predicts quantum circuit runtimes before execution.
This capability could be a major step for the Open Quantum platform, adding hosted simulators, improving workload scheduling, and expanding access to quantum computing resources.
We can't wait to see what this team accomplishes over the next five weeks! ⚛️
#SN48 #OpenQuantum
Pretty fortuitous timing for this challenge to blow up.
In just 48 hours, innovators from across the world were able to optimize Shor's to surpass the benchmark put forth by Google in their recent landmark paper.
This is the power of decentralized intelligence.
By putting research out in the open, not only do innovations happen much faster, but we also give critical insight to the world on where we're most vulnerable.
You won't have to wonder when your keys will be compromised.
You'll have clear insight into when it's coming.
In the same week, we're launching Enigma, which seeks to push the boundaries of what's possible with encryption cracking today.
The perfect complement to edcsa(dot)fail, which is trying to lower the barrier needed to break encryption.
The future is coming and it will happen in the open.
Be ready.
06.04.26
#Enigma #SN63 #BreakingRSA
Improving user experience on our platform is important to us.
We're improving job preparation workflows to identify semantic errors before workloads are sent to quantum hardware, saving users time and making experimentation smoother.
Small improvements -> Massive time saved for developers
#OpenQuantum #SN48
Enigma is the FIRST subnet to route emissions through treasury wallets, providing massive incentives for verified solutions on our open-sourced challenges!
Prize pools now stand at ~$400,000.
Let the final countdown commence.
06.04.26
#Enigma#SN63
The quantum bears really did not want this one coming out.
From our streaming platform going down, to our recordings coming out corrupted, this was the episode that shouldn't have been.
But against all odds, here is QBTLL #14.
Thank you all for your patience and we hope you're as excited about these updates as we are! 🩵
https://t.co/lMkqm4BPe3