Recent community optimizations in quantum circuit design for the elliptic curve discrete logarithm problem (ECDLP-256) on secp256k1 have driven ECDSA.fail ahead of Google’s March 2026 benchmark. Google’s whitepaper established a fixed reference of roughly 1,425 logical qubits and 2.1 million Toffoli gates (product metric of 2.9925 billion), estimating execution on a superconducting cryptographically relevant quantum computer with under 500,000 physical qubits. Open submissions on the ecdsa.fail leaderboard have since improved this qubit-Toffoli product through refined Shor’s algorithm compilations, better fault-tolerant assumptions, and gate-count reductions, reaching documented leads of 15% or more by early June with some reports exceeding 40%. No major new Google circuit data has emerged to narrow the gap before the June 30 resolution, though further model refinements or submissions could shift the metric.
Experimentelle KI-generierte Zusammenfassung mit Polymarket-Daten. Dies ist keine Handelsberatung und spielt keine Rolle bei der Auflösung dieses Marktes. · AktualisiertWie weit vor Googles Quanten-Benchmark wird ECDSA.fail bis zum 30. Juni kommen?
Wie weit vor Googles Quanten-Benchmark wird ECDSA.fail bis zum 30. Juni kommen?
NEU
30. Juni 2026
40 %+
100%
50%+
23%
$4,990 Vol.
40 %+
$4,385 Vol.
100%
50%+
$605 Vol.
23%
ECDSA.fail tracks an open challenge to outperform Google’s quantum circuit benchmark for ECDSA-style elliptic-curve cryptography. Its official challenge site at www.ecdsa.fail/ measures progress based on the product of a circuit’s qubits and Toffoli gates and displays a headline metric such as “[x]% ahead of Google’s classified circuit.”
This market will resolve to "Yes" if ECDSA.fail reports progress equal to or higher than the specified percentage ahead of the fixed Google reference point at any point by June 30, 2026, 11:59 PM ET. Otherwise, this market will resolve to "No".
For purposes of this market, the Google reference point is fixed at 2,992,500,000, calculated as 2.1M Toffoli gates × 1,425 qubits, as shown on ECDSA.fail and corresponding to Google’s private low-gate Pareto point in the official ECDSA.fail challenge repository (https://github.com/ecdsafail/ecdsafail-challenge/blob/main/README.md). This fixed reference point will be used regardless of whether ECDSA.fail, Google, or any other source later updates, replaces, or redefines the Google reference benchmark.
If ECDSA.fail no longer reports progress as a percentage ahead of the fixed Google reference point, resolution will be based on the best valid score shown by ECDSA.fail or officially confirmed by the challenge organizers before the resolution time, converted into a percentage improvement relative to the fixed Google reference point.
Local runs, forks, pull requests, screenshots, or manually edited repository files will not qualify unless the result is reflected on the official ECDSA.fail challenge site or otherwise confirmed by the challenge organizers.
The primary resolution source for this market will be the official ECDSA.fail challenge site (https://www.ecdsa.fail/). Official statements from the challenge organizers may also be used.Recent community optimizations in quantum circuit design for the elliptic curve discrete logarithm problem (ECDLP-256) on secp256k1 have driven ECDSA.fail ahead of Google’s March 2026 benchmark. Google’s whitepaper established a fixed reference of roughly 1,425 logical qubits and 2.1 million Toffoli gates (product metric of 2.9925 billion), estimating execution on a superconducting cryptographically relevant quantum computer with under 500,000 physical qubits. Open submissions on the ecdsa.fail leaderboard have since improved this qubit-Toffoli product through refined Shor’s algorithm compilations, better fault-tolerant assumptions, and gate-count reductions, reaching documented leads of 15% or more by early June with some reports exceeding 40%. No major new Google circuit data has emerged to narrow the gap before the June 30 resolution, though further model refinements or submissions could shift the metric.
ECDSA.fail tracks an open challenge to outperform Google’s quantum circuit benchmark for ECDSA-style elliptic-curve cryptography. Its official challenge site at www.ecdsa.fail/ measures progress based on the product of a circuit’s qubits and Toffoli gates and displays a headline metric such as “[x]% ahead of Google’s classified circuit.”
This market will resolve to "Yes" if ECDSA.fail reports progress equal to or higher than the specified percentage ahead of the fixed Google reference point at any point by June 30, 2026, 11:59 PM ET. Otherwise, this market will resolve to "No".
For purposes of this market, the Google reference point is fixed at 2,992,500,000, calculated as 2.1M Toffoli gates × 1,425 qubits, as shown on ECDSA.fail and corresponding to Google’s private low-gate Pareto point in the official ECDSA.fail challenge repository (https://github.com/ecdsafail/ecdsafail-challenge/blob/main/README.md). This fixed reference point will be used regardless of whether ECDSA.fail, Google, or any other source later updates, replaces, or redefines the Google reference benchmark.
If ECDSA.fail no longer reports progress as a percentage ahead of the fixed Google reference point, resolution will be based on the best valid score shown by ECDSA.fail or officially confirmed by the challenge organizers before the resolution time, converted into a percentage improvement relative to the fixed Google reference point.
Local runs, forks, pull requests, screenshots, or manually edited repository files will not qualify unless the result is reflected on the official ECDSA.fail challenge site or otherwise confirmed by the challenge organizers.
The primary resolution source for this market will be the official ECDSA.fail challenge site (https://www.ecdsa.fail/). Official statements from the challenge organizers may also be used.
This market will resolve to "Yes" if ECDSA.fail reports progress equal to or higher than the specified percentage ahead of the fixed Google reference point at any point by June 30, 2026, 11:59 PM ET. Otherwise, this market will resolve to "No".
For purposes of this market, the Google reference point is fixed at 2,992,500,000, calculated as 2.1M Toffoli gates × 1,425 qubits, as shown on ECDSA.fail and corresponding to Google’s private low-gate Pareto point in the official ECDSA.fail challenge repository (https://github.com/ecdsafail/ecdsafail-challenge/blob/main/README.md). This fixed reference point will be used regardless of whether ECDSA.fail, Google, or any other source later updates, replaces, or redefines the Google reference benchmark.
If ECDSA.fail no longer reports progress as a percentage ahead of the fixed Google reference point, resolution will be based on the best valid score shown by ECDSA.fail or officially confirmed by the challenge organizers before the resolution time, converted into a percentage improvement relative to the fixed Google reference point.
Local runs, forks, pull requests, screenshots, or manually edited repository files will not qualify unless the result is reflected on the official ECDSA.fail challenge site or otherwise confirmed by the challenge organizers.
The primary resolution source for this market will be the official ECDSA.fail challenge site (https://www.ecdsa.fail/). Official statements from the challenge organizers may also be used.
Markt eröffnet: Jun 5, 2026, 12:31 PM ET
Volumen
$4,990Enddatum
30. Juni 2026Markt eröffnet
Jun 5, 2026, 12:31 PM ETResolver
0x65070BE91...ECDSA.fail tracks an open challenge to outperform Google’s quantum circuit benchmark for ECDSA-style elliptic-curve cryptography. Its official challenge site at www.ecdsa.fail/ measures progress based on the product of a circuit’s qubits and Toffoli gates and displays a headline metric such as “[x]% ahead of Google’s classified circuit.”
This market will resolve to "Yes" if ECDSA.fail reports progress equal to or higher than the specified percentage ahead of the fixed Google reference point at any point by June 30, 2026, 11:59 PM ET. Otherwise, this market will resolve to "No".
For purposes of this market, the Google reference point is fixed at 2,992,500,000, calculated as 2.1M Toffoli gates × 1,425 qubits, as shown on ECDSA.fail and corresponding to Google’s private low-gate Pareto point in the official ECDSA.fail challenge repository (https://github.com/ecdsafail/ecdsafail-challenge/blob/main/README.md). This fixed reference point will be used regardless of whether ECDSA.fail, Google, or any other source later updates, replaces, or redefines the Google reference benchmark.
If ECDSA.fail no longer reports progress as a percentage ahead of the fixed Google reference point, resolution will be based on the best valid score shown by ECDSA.fail or officially confirmed by the challenge organizers before the resolution time, converted into a percentage improvement relative to the fixed Google reference point.
Local runs, forks, pull requests, screenshots, or manually edited repository files will not qualify unless the result is reflected on the official ECDSA.fail challenge site or otherwise confirmed by the challenge organizers.
The primary resolution source for this market will be the official ECDSA.fail challenge site (https://www.ecdsa.fail/). Official statements from the challenge organizers may also be used.Recent community optimizations in quantum circuit design for the elliptic curve discrete logarithm problem (ECDLP-256) on secp256k1 have driven ECDSA.fail ahead of Google’s March 2026 benchmark. Google’s whitepaper established a fixed reference of roughly 1,425 logical qubits and 2.1 million Toffoli gates (product metric of 2.9925 billion), estimating execution on a superconducting cryptographically relevant quantum computer with under 500,000 physical qubits. Open submissions on the ecdsa.fail leaderboard have since improved this qubit-Toffoli product through refined Shor’s algorithm compilations, better fault-tolerant assumptions, and gate-count reductions, reaching documented leads of 15% or more by early June with some reports exceeding 40%. No major new Google circuit data has emerged to narrow the gap before the June 30 resolution, though further model refinements or submissions could shift the metric.
ECDSA.fail tracks an open challenge to outperform Google’s quantum circuit benchmark for ECDSA-style elliptic-curve cryptography. Its official challenge site at www.ecdsa.fail/ measures progress based on the product of a circuit’s qubits and Toffoli gates and displays a headline metric such as “[x]% ahead of Google’s classified circuit.”
This market will resolve to "Yes" if ECDSA.fail reports progress equal to or higher than the specified percentage ahead of the fixed Google reference point at any point by June 30, 2026, 11:59 PM ET. Otherwise, this market will resolve to "No".
For purposes of this market, the Google reference point is fixed at 2,992,500,000, calculated as 2.1M Toffoli gates × 1,425 qubits, as shown on ECDSA.fail and corresponding to Google’s private low-gate Pareto point in the official ECDSA.fail challenge repository (https://github.com/ecdsafail/ecdsafail-challenge/blob/main/README.md). This fixed reference point will be used regardless of whether ECDSA.fail, Google, or any other source later updates, replaces, or redefines the Google reference benchmark.
If ECDSA.fail no longer reports progress as a percentage ahead of the fixed Google reference point, resolution will be based on the best valid score shown by ECDSA.fail or officially confirmed by the challenge organizers before the resolution time, converted into a percentage improvement relative to the fixed Google reference point.
Local runs, forks, pull requests, screenshots, or manually edited repository files will not qualify unless the result is reflected on the official ECDSA.fail challenge site or otherwise confirmed by the challenge organizers.
The primary resolution source for this market will be the official ECDSA.fail challenge site (https://www.ecdsa.fail/). Official statements from the challenge organizers may also be used.
This market will resolve to "Yes" if ECDSA.fail reports progress equal to or higher than the specified percentage ahead of the fixed Google reference point at any point by June 30, 2026, 11:59 PM ET. Otherwise, this market will resolve to "No".
For purposes of this market, the Google reference point is fixed at 2,992,500,000, calculated as 2.1M Toffoli gates × 1,425 qubits, as shown on ECDSA.fail and corresponding to Google’s private low-gate Pareto point in the official ECDSA.fail challenge repository (https://github.com/ecdsafail/ecdsafail-challenge/blob/main/README.md). This fixed reference point will be used regardless of whether ECDSA.fail, Google, or any other source later updates, replaces, or redefines the Google reference benchmark.
If ECDSA.fail no longer reports progress as a percentage ahead of the fixed Google reference point, resolution will be based on the best valid score shown by ECDSA.fail or officially confirmed by the challenge organizers before the resolution time, converted into a percentage improvement relative to the fixed Google reference point.
Local runs, forks, pull requests, screenshots, or manually edited repository files will not qualify unless the result is reflected on the official ECDSA.fail challenge site or otherwise confirmed by the challenge organizers.
The primary resolution source for this market will be the official ECDSA.fail challenge site (https://www.ecdsa.fail/). Official statements from the challenge organizers may also be used.
Volumen
$4,990Enddatum
30. Juni 2026Markt eröffnet
Jun 5, 2026, 12:31 PM ETResolver
0x65070BE91...Recent community optimizations in quantum circuit design for the elliptic curve discrete logarithm problem (ECDLP-256) on secp256k1 have driven ECDSA.fail ahead of Google’s March 2026 benchmark. Google’s whitepaper established a fixed reference of roughly 1,425 logical qubits and 2.1 million Toffoli gates (product metric of 2.9925 billion), estimating execution on a superconducting cryptographically relevant quantum computer with under 500,000 physical qubits. Open submissions on the ecdsa.fail leaderboard have since improved this qubit-Toffoli product through refined Shor’s algorithm compilations, better fault-tolerant assumptions, and gate-count reductions, reaching documented leads of 15% or more by early June with some reports exceeding 40%. No major new Google circuit data has emerged to narrow the gap before the June 30 resolution, though further model refinements or submissions could shift the metric.
Experimentelle KI-generierte Zusammenfassung mit Polymarket-Daten. Dies ist keine Handelsberatung und spielt keine Rolle bei der Auflösung dieses Marktes. · Aktualisiert
Vorsicht bei externen Links.
Vorsicht bei externen Links.
Häufig gestellte Fragen