Skip to main content
icon for ¿Qué tan por delante del punto de referencia cuántico de Google llegará ECDSA.fail antes del 30 de junio?
Tech·Ciencias

¿Qué tan por delante del punto de referencia cuántico de Google llegará ECDSA.fail antes del 30 de junio?

icon for ¿Qué tan por delante del punto de referencia cuántico de Google llegará ECDSA.fail antes del 30 de junio?
Tech·Ciencias

¿Qué tan por delante del punto de referencia cuántico de Google llegará ECDSA.fail antes del 30 de junio?

NUEVO
30 jun 2026
Polymarket

$212 Vol.

Polymarket

Más del 40%

$119 Vol.

51%

50%+

$99 Vol.

92%

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 on the open ecdsa.fail platform have driven gains over Google’s fixed March 2026 benchmark for Shor’s algorithm on the 256-bit elliptic curve discrete logarithm problem (ECDLP-256) used in secp256k1. Google’s verified circuits require roughly 1,200–1,450 logical qubits and 70–90 million Toffoli gates, yielding a qubit-Toffoli product reference of 2,992,500,000. Open submissions, aided by Google’s zero-knowledge verifier for point-addition circuits, have already reduced this metric by 11–15% as of early June 2026 through improved compilation and arithmetic optimizations. Further progress before June 30 hinges on additional logical-resource reductions ahead of resolution, with model consensus on superconducting hardware assumptions remaining a key variable.

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.
Volumen
$212
Fecha de finalización
30 jun 2026
Mercado abierto
Jun 5, 2026, 12:31 PM ET

Resolver

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.
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 on the open ecdsa.fail platform have driven gains over Google’s fixed March 2026 benchmark for Shor’s algorithm on the 256-bit elliptic curve discrete logarithm problem (ECDLP-256) used in secp256k1. Google’s verified circuits require roughly 1,200–1,450 logical qubits and 70–90 million Toffoli gates, yielding a qubit-Toffoli product reference of 2,992,500,000. Open submissions, aided by Google’s zero-knowledge verifier for point-addition circuits, have already reduced this metric by 11–15% as of early June 2026 through improved compilation and arithmetic optimizations. Further progress before June 30 hinges on additional logical-resource reductions ahead of resolution, with model consensus on superconducting hardware assumptions remaining a key variable.

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.
Volumen
$212
Fecha de finalización
30 jun 2026
Mercado abierto
Jun 5, 2026, 12:31 PM ET

Resolver

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.

Cuidado con los enlaces externos.

Preguntas frecuentes

"¿Qué tan por delante del punto de referencia cuántico de Google llegará ECDSA.fail antes del 30 de junio?" es un mercado de predicción en Polymarket con 2 resultados posibles donde los operadores compran y venden acciones según lo que creen que sucederá. El resultado líder actual es "50%+" con 92%, seguido de "Más del 40%" con 51%. Los precios reflejan probabilidades en tiempo real de la comunidad. Por ejemplo, una acción cotizada a 92¢ implica que el mercado colectivamente asigna una probabilidad de 92% a ese resultado. Estas probabilidades cambian continuamente a medida que los operadores reaccionan a nuevos desarrollos. Las acciones del resultado correcto son canjeables por $1 cada una tras la resolución del mercado.

"¿Qué tan por delante del punto de referencia cuántico de Google llegará ECDSA.fail antes del 30 de junio?" es un mercado recién creado en Polymarket, lanzado el Jun 5, 2026. Como mercado nuevo, esta es tu oportunidad de ser uno de los primeros operadores en establecer las probabilidades y las señales de precio iniciales del mercado. También puedes guardar esta página en marcadores para seguir el volumen y la actividad de trading a medida que el mercado gana tracción.

Para operar en "¿Qué tan por delante del punto de referencia cuántico de Google llegará ECDSA.fail antes del 30 de junio?", explora los 2 resultados disponibles en esta página. Cada resultado muestra un precio actual que representa la probabilidad implícita del mercado. Para tomar una posición, selecciona el resultado que consideres más probable, elige "Sí" para operar a favor o "No" para operar en contra, introduce tu cantidad y haz clic en "Operar". Si tu resultado elegido es correcto cuando el mercado se resuelve, tus acciones de "Sí" pagan $1 cada una. Si es incorrecto, pagan $0. También puedes vender tus acciones en cualquier momento antes de la resolución.

El favorito actual para "¿Qué tan por delante del punto de referencia cuántico de Google llegará ECDSA.fail antes del 30 de junio?" es "50%+" con 92%, lo que significa que el mercado asigna una probabilidad de 92% a ese resultado. El siguiente resultado más cercano es "Más del 40%" con 51%. Estas probabilidades se actualizan en tiempo real a medida que los operadores compran y venden acciones. Vuelve con frecuencia o guarda esta página en marcadores.

Las reglas de resolución para "¿Qué tan por delante del punto de referencia cuántico de Google llegará ECDSA.fail antes del 30 de junio?" definen exactamente qué debe ocurrir para que cada resultado sea declarado ganador, incluyendo las fuentes de datos oficiales utilizadas para determinar el resultado. Puedes revisar los criterios de resolución completos en la sección "Reglas" en esta página sobre los comentarios. Recomendamos leer las reglas cuidadosamente antes de operar, ya que especifican las condiciones exactas, casos especiales y fuentes.