Community efforts on the ECDSA.fail platform have driven recent gains in quantum circuit optimization for the elliptic curve discrete logarithm problem on secp256k1, the core of ECDSA signatures. Following Google Quantum AI’s March 2026 whitepaper establishing a reference circuit of roughly 1,425 logical qubits and 2.1 million Toffoli gates (product near 3 billion), open submissions have reduced this qubit-Toffoli volume metric by about 36% to near 1.89 billion by early June through improved compilation, algorithmic tweaks, and fault-tolerant design refinements. These advances build on prior estimates like Litinski’s 2023 work, with progress tracked via zero-knowledge-verified submissions. Resolution by June 30 hinges on leaderboard snapshots before the cutoff, with further community refinements or any new official model runs likely to influence the final gap.
Экспериментальная сводка, созданная ИИ на основе данных Polymarket. Это не является торговой рекомендацией и не влияет на то, как разрешается этот рынок. · ОбновленоНасколько далеко опередит квантовый бенчмарк Google ECDSA.fail к 30 июня?
Насколько далеко опередит квантовый бенчмарк Google ECDSA.fail к 30 июня?
НОВОЕ
30 июн. 2026 г.
40%+
98%
50%+
60%
$3,486 Объем
40%+
$3,172 Объем
98%
50%+
$313 Объем
60%
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.Community efforts on the ECDSA.fail platform have driven recent gains in quantum circuit optimization for the elliptic curve discrete logarithm problem on secp256k1, the core of ECDSA signatures. Following Google Quantum AI’s March 2026 whitepaper establishing a reference circuit of roughly 1,425 logical qubits and 2.1 million Toffoli gates (product near 3 billion), open submissions have reduced this qubit-Toffoli volume metric by about 36% to near 1.89 billion by early June through improved compilation, algorithmic tweaks, and fault-tolerant design refinements. These advances build on prior estimates like Litinski’s 2023 work, with progress tracked via zero-knowledge-verified submissions. Resolution by June 30 hinges on leaderboard snapshots before the cutoff, with further community refinements or any new official model runs likely to influence the final gap.
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
Объем
$3,486Дата окончания
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.Community efforts on the ECDSA.fail platform have driven recent gains in quantum circuit optimization for the elliptic curve discrete logarithm problem on secp256k1, the core of ECDSA signatures. Following Google Quantum AI’s March 2026 whitepaper establishing a reference circuit of roughly 1,425 logical qubits and 2.1 million Toffoli gates (product near 3 billion), open submissions have reduced this qubit-Toffoli volume metric by about 36% to near 1.89 billion by early June through improved compilation, algorithmic tweaks, and fault-tolerant design refinements. These advances build on prior estimates like Litinski’s 2023 work, with progress tracked via zero-knowledge-verified submissions. Resolution by June 30 hinges on leaderboard snapshots before the cutoff, with further community refinements or any new official model runs likely to influence the final gap.
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.
Объем
$3,486Дата окончания
30 июн. 2026 г.Открытие рынка
Jun 5, 2026, 12:31 PM ETResolver
0x65070BE91...Community efforts on the ECDSA.fail platform have driven recent gains in quantum circuit optimization for the elliptic curve discrete logarithm problem on secp256k1, the core of ECDSA signatures. Following Google Quantum AI’s March 2026 whitepaper establishing a reference circuit of roughly 1,425 logical qubits and 2.1 million Toffoli gates (product near 3 billion), open submissions have reduced this qubit-Toffoli volume metric by about 36% to near 1.89 billion by early June through improved compilation, algorithmic tweaks, and fault-tolerant design refinements. These advances build on prior estimates like Litinski’s 2023 work, with progress tracked via zero-knowledge-verified submissions. Resolution by June 30 hinges on leaderboard snapshots before the cutoff, with further community refinements or any new official model runs likely to influence the final gap.
Экспериментальная сводка, созданная ИИ на основе данных Polymarket. Это не является торговой рекомендацией и не влияет на то, как разрешается этот рынок. · Обновлено
Не доверяй внешним ссылкам.
Не доверяй внешним ссылкам.
Часто задаваемые вопросы