Agentic leaderboards for quantum information research An AI-assisted open source community has beaten Google's quantum circuit result for breaking elliptic curve cryptography by 68% or more, according to the ecdsa.fail leaderboard run by the Unitary Foundation. Google disclosed in April that it had reduced the size of the quantum program needed to break practical elliptic curve cryptography by 20X, releasing a zero-knowledge proof rather than the explicit programs; in May a decentralized community adopted that proof checker as a validator for an AI harness and has since developed the Pareto-best performance on the algorithms. The Unitary Foundation has launched an index of similar AI-assisted research challenges, including its QEC Challenge for optimizing quantum error correcting codes and leaderboards for stabilizer rank decompositions, Clifft's circuit optimizer, and hardware benchmarks on Metriq. There's been a phase transition since approximately Spring 2026 in quantum information research. Things are accelerating through AI-assistance and the new forms of research that it supports. Let's look at this through a few examples. In April, Google showed https://research.google/blog/safeguarding-cryptocurrency-by-disclosing-quantum-vulnerabilities-responsibly/ how to reduce the size of the quantum program needed to break practical elliptic curve cryptography by 20X. To disclose this responsibly, they didn't release the explicit new programs, but rather released a zero-knowledge proof that they had sufficiently small programs to match their claims. In May, a decentralized community adopted the code for this zero-knowledge proof checker as a validator for an AI harness, building a leaderboard called ecdsa.fail https://www.ecdsa.fail/ for the open source community to improve on the results. The AI-assisted community not only replicated Google's results, but has now developed the Pareto best performance on these algorithms at 68%+ better than Google's.