Will a quantum computer factor the RSA-2048 challenge number before 2100?
One-OffTechCryptoWetenschapManifold MarketsGeen KYCGeverifieerde afwikkelingsgegevensRedelijk gekalibreerdWaarschuwing datakwaliteitBrongegevens verslechterd
Gegevens van 25 okt 2026, 20:40 UTC · beleid pm-quality-4
Huidige gemeenschapsvoorspellingJa 87.5%
Voorspellers
5
Vraagtype
binary
Methodologie
Play-money forecasting platform
Brontype
Voorspelling
Marktdata
Bijgewerkt 4 uur geleden
Verouderd10 nov 24, 22:49 UTC1 jan 00, 04:59 UTC
Trends
Regels
The RSA‑2048 challenge number is a 617‑digit (2048‑bit) semiprime released by RSA Laboratories as a public benchmark for integer‑factorisation research.
- Demonstrating its factorisation with a general‑purpose quantum computer—one capable of running Shor’s algorithm (or an equivalent quantum‑factoring routine) at scale—would effectively break today’s RSA‑based public‑key cryptography.
- Resolution Criteria
- Evidence required – A peer‑reviewed paper in a recognized scientific journal must show that only a quantum computer was used to factor the full RSA‑2048 challenge number.
- Classical assistance – Limited classical pre‑ or post‑processing (e.g., compiling the circuit, verifying the output) is allowed, but the actual factorization step must be done by quantum hardware.
- Timing - The peer-reviewed paper’s publication date occurs before Jan 1, 2100 for the market to resolve YES.
