Google’s March 2026 whitepaper established a new baseline for attacking secp256k1 ECDSA via optimized Shor’s algorithm circuits, publishing verified resource counts of roughly 1,200–1,450 logical qubits and 70–90 million Toffoli gates while withholding full optimization details. This prompted the launch of the open ecdsa.fail leaderboard, where independent researchers rapidly reconstructed and improved the circuits. As of early June 2026, community submissions had achieved 15–40% better gate and qubit counts than the Google benchmark, driven by refinements in logical qubit layouts and Toffoli-gate sequencing for the elliptic-curve discrete-log problem. With only two weeks remaining until the June 30 resolution, further gains depend on continued public submissions and any unreleased model updates; the market reflects trader assessment of how quickly verifiable optimizations can compound before the cutoff.
สรุปจาก AI ทดลองที่อ้างอิงข้อมูลจาก Polymarket ไม่ใช่คำแนะนำในการเทรดและไม่มีผลต่อการตัดสินตลาดนี้ · อัปเดตแล้วใหม่
Jun 30, 2026
40%+
100%
50%+
23%
$5,017 ปริมาณ
40%+
$4,385 ปริมาณ
100%
50%+
$632 ปริมาณ
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.Google’s March 2026 whitepaper established a new baseline for attacking secp256k1 ECDSA via optimized Shor’s algorithm circuits, publishing verified resource counts of roughly 1,200–1,450 logical qubits and 70–90 million Toffoli gates while withholding full optimization details. This prompted the launch of the open ecdsa.fail leaderboard, where independent researchers rapidly reconstructed and improved the circuits. As of early June 2026, community submissions had achieved 15–40% better gate and qubit counts than the Google benchmark, driven by refinements in logical qubit layouts and Toffoli-gate sequencing for the elliptic-curve discrete-log problem. With only two weeks remaining until the June 30 resolution, further gains depend on continued public submissions and any unreleased model updates; the market reflects trader assessment of how quickly verifiable optimizations can compound before the cutoff.
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
ปริมาณการซื้อขาย
$5,017วันสิ้นสุด
Jun 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.Google’s March 2026 whitepaper established a new baseline for attacking secp256k1 ECDSA via optimized Shor’s algorithm circuits, publishing verified resource counts of roughly 1,200–1,450 logical qubits and 70–90 million Toffoli gates while withholding full optimization details. This prompted the launch of the open ecdsa.fail leaderboard, where independent researchers rapidly reconstructed and improved the circuits. As of early June 2026, community submissions had achieved 15–40% better gate and qubit counts than the Google benchmark, driven by refinements in logical qubit layouts and Toffoli-gate sequencing for the elliptic-curve discrete-log problem. With only two weeks remaining until the June 30 resolution, further gains depend on continued public submissions and any unreleased model updates; the market reflects trader assessment of how quickly verifiable optimizations can compound before the cutoff.
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.
ปริมาณการซื้อขาย
$5,017วันสิ้นสุด
Jun 30, 2026ตลาดเปิดเมื่อ
Jun 5, 2026, 12:31 PM ETResolver
0x65070BE91...Google’s March 2026 whitepaper established a new baseline for attacking secp256k1 ECDSA via optimized Shor’s algorithm circuits, publishing verified resource counts of roughly 1,200–1,450 logical qubits and 70–90 million Toffoli gates while withholding full optimization details. This prompted the launch of the open ecdsa.fail leaderboard, where independent researchers rapidly reconstructed and improved the circuits. As of early June 2026, community submissions had achieved 15–40% better gate and qubit counts than the Google benchmark, driven by refinements in logical qubit layouts and Toffoli-gate sequencing for the elliptic-curve discrete-log problem. With only two weeks remaining until the June 30 resolution, further gains depend on continued public submissions and any unreleased model updates; the market reflects trader assessment of how quickly verifiable optimizations can compound before the cutoff.
สรุปจาก AI ทดลองที่อ้างอิงข้อมูลจาก Polymarket ไม่ใช่คำแนะนำในการเทรดและไม่มีผลต่อการตัดสินตลาดนี้ · อัปเดตแล้ว
ระวังลิงก์ภายนอก
ระวังลิงก์ภายนอก
คำถามที่พบบ่อย