Recent rapid crowd-sourced optimizations on the ecdsa.fail platform, which scores quantum circuits for Shor’s algorithm on the 256-bit elliptic curve discrete logarithm problem by logical qubit count times Toffoli-gate volume, have already pushed results roughly 40% ahead of Google Quantum AI’s March 2026 benchmark (≈1,200–1,450 logical qubits and 70–90 million Toffoli gates). These gains stem from iterative improvements in circuit compilation and fault-tolerant resource estimates rather than hardware advances. With resolution on June 30, further leaderboard movement depends on continued open participation and any new model runs before the cutoff; current hardware remains orders of magnitude below the hundreds of thousands of physical qubits still required for a cryptographically relevant machine.
Экспериментальная сводка, созданная ИИ на основе данных Polymarket. Это не является торговой рекомендацией и не влияет на то, как разрешается этот рынок. · ОбновленоНасколько далеко опередит квантовый бенчмарк Google ECDSA.fail к 30 июня?
Насколько далеко опередит квантовый бенчмарк Google ECDSA.fail к 30 июня?
$9,637 Объем
30 июн. 2026 г.
40%+
Да
50%+
No
$9,637 Объем
40%+
$4,683 Объем
Да
50%+
$4,954 Объем
No
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 rapid crowd-sourced optimizations on the ecdsa.fail platform, which scores quantum circuits for Shor’s algorithm on the 256-bit elliptic curve discrete logarithm problem by logical qubit count times Toffoli-gate volume, have already pushed results roughly 40% ahead of Google Quantum AI’s March 2026 benchmark (≈1,200–1,450 logical qubits and 70–90 million Toffoli gates). These gains stem from iterative improvements in circuit compilation and fault-tolerant resource estimates rather than hardware advances. With resolution on June 30, further leaderboard movement depends on continued open participation and any new model runs before the cutoff; current hardware remains orders of magnitude below the hundreds of thousands of physical qubits still required for a cryptographically relevant machine.
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.
Открытие рынка: Jun 5, 2026, 12:31 PM ET
Объем
$9,637Дата окончания
30 июн. 2026 г.Открытие рынка
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 rapid crowd-sourced optimizations on the ecdsa.fail platform, which scores quantum circuits for Shor’s algorithm on the 256-bit elliptic curve discrete logarithm problem by logical qubit count times Toffoli-gate volume, have already pushed results roughly 40% ahead of Google Quantum AI’s March 2026 benchmark (≈1,200–1,450 logical qubits and 70–90 million Toffoli gates). These gains stem from iterative improvements in circuit compilation and fault-tolerant resource estimates rather than hardware advances. With resolution on June 30, further leaderboard movement depends on continued open participation and any new model runs before the cutoff; current hardware remains orders of magnitude below the hundreds of thousands of physical qubits still required for a cryptographically relevant machine.
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.
Объем
$9,637Дата окончания
30 июн. 2026 г.Открытие рынка
Jun 5, 2026, 12:31 PM ETResolver
0x65070BE91...Предложенный исход: Да
Спор отсутствует
Окончательный исход: Да
Recent rapid crowd-sourced optimizations on the ecdsa.fail platform, which scores quantum circuits for Shor’s algorithm on the 256-bit elliptic curve discrete logarithm problem by logical qubit count times Toffoli-gate volume, have already pushed results roughly 40% ahead of Google Quantum AI’s March 2026 benchmark (≈1,200–1,450 logical qubits and 70–90 million Toffoli gates). These gains stem from iterative improvements in circuit compilation and fault-tolerant resource estimates rather than hardware advances. With resolution on June 30, further leaderboard movement depends on continued open participation and any new model runs before the cutoff; current hardware remains orders of magnitude below the hundreds of thousands of physical qubits still required for a cryptographically relevant machine.
Экспериментальная сводка, созданная ИИ на основе данных Polymarket. Это не является торговой рекомендацией и не влияет на то, как разрешается этот рынок. · Обновлено
Не доверяй внешним ссылкам.
Не доверяй внешним ссылкам.
Часто задаваемые вопросы