The Competition is on:

Fdq Brx Euhdn HFF zlwk Txdqwxp?

• >

  Prize: 1 Bitcoin

• >

  Deadline: April 5, 2026

• >

  Competition: Break the biggest ECC key with Shor's algorithm.

****************************

The world's encryption standards stand strong — for now. But quantum computing is advancing, and we need to know: how close are we to breaking elliptic curve cryptography (ECC)?

This is an open competition in quantum cryptanalysis. The mission: break the largest ECC key possible using Shor's algorithm on a quantum computer. No classical shortcuts. No hybrid tricks. Pure quantum power.

****************************

How do I take part?

You can register as an individual or team. No need to be affiliated with any institution.
Next, you'll need to figure out how to run Shor's algorithm on current quantum hardware. Your method should be as general and robust as possible. It should not require impractical amounts of classical compute to scale to 256-bit keys. (For example, we're not interested in approaches that use compilation tricks that don't scale.)
We've prepared a set of ECC keys for security levels from 1 to 25 bits. For whatever key-length you're targeting, you'll need to demonstrate your solution using one of these keys. For example, if your method can crack 4-bit keys, you'll want to confirm that using a 4-bit key we provide.
Make a submission: Your entry will include the gate-level code or instructions for the quantum program you developed and a description of your overall approach, any techniques used, and the specs of the quantum computer you used. The quantum computer does not need to be publicly accessible.
In the interest of transparency, we will share submissions publicly.

Things to consider

• Small key sizes - You don't need to break a Bitcoin key. A 3-bit key would be big news.
• Quantum computer access - A number of online platforms offer access, e.g. AWS, IBM.
• Error-prone qubits - Today's qubits have 99% - 99.9% fidelity - is that good enough?
• Shor's algorithm + elliptic curves - You'll need to run Shor's algorithm for the ECDLP.

****************************

Progress in Quantum Computing Should Be Open

Quantum computing is advancing fast, and the impact on cryptography is inevitable. Instead of waiting for breakthroughs to happen behind closed doors, we believe in facing this challenge head on, in a transparent and rigorous manner.

The QDay Prize is about testing real quantum capabilities, staking out the frontier of cryptanalysis, and ensuring the world is ready for what comes next. The future of cryptography depends on it.

The QDay Prize - Why?

• Transparency - Promote open, verifiable demonstrations of quantum capabilities.
• Stress-testing - Drive early discovery of advances in Shor's algorithm.
• Reality Check - ECC is everywhere. How close exactly are we to breaking it?
• Clear benchmark - Establish a rigorous test of quantum performance in cryptanalysis.

****************************

Why Elliptic Curve Cryptography?

What is ECC?

Elliptic Curve Cryptography (ECC) is a widely used form of public-key cryptography that secures everything from Bitcoin wallets to TLS encryption on the web. ECC is favored because it provides the same security as traditional schemes (like RSA) but with much smaller key sizes, making it more efficient. A 256-bit ECC provides the same level of security as a 3072-bit RSA key—a huge efficiency gain.

Why focus on breaking ECC?

Classical computers struggle with ECC—it’s designed to be infeasible to break using traditional factoring or brute-force methods. But quantum computers change the game.

• Shor’s Algorithm (1994) proves that a sufficiently powerful quantum computer can break ECC in polynomial time, something impossible for classical computers.
• Current best classical attacks—such as pollard rho and index calculus methods—are exponentially slower and infeasible at large key sizes.
• National Institute of Standards and Technology (NIST) and cryptographic communities recognize ECC as vulnerable to future quantum attacks and are actively transitioning to post-quantum cryptography (PQC).

Why this benchmark?

To date, no ECC key used in real-world cryptography has been cracked—not by classical methods, and not by quantum.

However, quantum research has progressed:

• Small instances of ECC curves (e.g., tiny toy problems) have been factored on simulated quantum hardware.
• Google, QuEra and others are making steady advances in qubit count, quality and error correction. Real attacks will become possible as progress continues.
• Current estimates suggest that around 2,000 logical qubits (error-corrected) would be enough to break a 256-bit ECC key—a milestone that could be reached within the decade.

****************************

More questions?

Check out the FAQs, or email us at [email protected]