◈ CRYPTO & FINANCE 10 YEARS HORIZON RESOLVES 10 OCT 2036 · in 10.0y

A quantum computer successfully breaks Bitcoin's SHA-256 or ECDSA cryptography before 2035.

Concerns persist that cryptographically relevant quantum computers could crack public-key cryptography used in Bitcoin addresses, demanding post-quantum upgrades.

Across 6 frontier models answering independently, the panel has all but ruled it out: the median is 7%.

They broadly agree, 21 points between GPT at 24% and DeepSeek at 3%.

Nothing is settled until 10 Oct 2036, when the outcome is checked against sources and every number above gets a permanent score.

MODEL BY MODEL

What each one said

  • GPTOpenAI

    It turns on whether fault-tolerant quantum hardware reaches millions of high-quality logical qubits before 2035.

    • Shor could break exposed Bitcoin ECDSA keys, while a full SHA-256 preimage attack needs far larger quantum resources.
    • Current roadmaps still target early error-corrected machines in the early 2030s, not the scale needed for fast key recovery.
    • The odds jump if IBM, Google, Quantinuum, or a state program demonstrates thousands of durable logical qubits by 2030.
    openai/gpt-5.6-terra · asked 13 Oct 2026
    24%
  • GrokxAI

    Fault-tolerant QC with ~2k logical qubits for Shor on secp256k1 by end-2034.

    • IBM/Google 2029 100k-physical-qubit targets still imply 1000:1 overhead, so logical scale lags into mid-2030s.
    • No CRQC even for 20-bit RSA yet; historical QC milestones slip 3–5 yrs, putting 256-bit ECC past 2035.
    • A topological-qubit or massive-state-funding leap would raise odds most.
    x-ai/grok-4.6 · asked 13 Oct 2026
    18%
  • GeminiGoogle

    ECDSA breaks require millions of physical qubits with error correction, a milestone major quantum roadmaps place after 2035.

    • Cracking secp256k1 requires ~2,000 logical qubits; current hardware has under 100 logical qubits and faces steep scaling hurdles.
    • Expert surveys like Gidney & Ekerå models and quantum labs suggest cryptographically relevant systems are unlikely before the late 2030s.
    • A breakthrough in low-overhead error correction or a dramatic algorithmic improvement in Shor's algorithm would alter this timeline.
    google/gemini-3.8-flash · asked 13 Oct 2026
    8%
  • ClaudeAnthropic

    No fault-tolerant quantum computer with millions of logical qubits exists yet, and that's needed to break ECDSA/SHA-256.

    • Breaking secp256k1 ECDSA via Shor's algorithm needs ~2000+ logical qubits with error correction, requiring millions of physical qubits; current best systems have…
    • SHA-256 is far more resistant even to Grover's algorithm, offering only quadratic speedup, making it effectively unbreakable by quantum means in this timeframe.
    • Industry roadmaps (IBM, Google) target fault-tolerant systems around 2029-2033 for narrow demos, not cryptographically relevant attacks on Bitcoin-scale keys by 2036.
    anthropic/claude-sonnet-5 · asked 13 Oct 2026
    5%
  • QwenAlibaba

    Requires thousands of logical qubits with low error rates; current best systems have single-digit logical qubit counts.

    • Breaking secp256k1 ECDSA needs ~2,000–4,000 logical qubits; IBM/Google roadmaps target ~1,000 physical qubits with error correction by ~2029, still far short.
    • No expert survey (CSET 2023, QuIC 2024) places median CRQC arrival before 2035; most cluster at 2037–2045 for ECDSA-256.
    • A new algorithm reducing qubit requirements by 10x or a hardware breakthrough (e.g., topological qubits at scale) would be the only realistic path to moving this above…
    qwen/qwen3.8-max-0902 · asked 13 Oct 2026
    4%
  • DeepSeekDeepSeek

    This needs a fault-tolerant quantum machine with millions of physical qubits; today's best is under 1,000 noisy ones.

    • Breaking ECDSA-256 needs roughly 2,000-4,000 logical qubits via Shor's algorithm, translating to millions of physical qubits with error correction.
    • Current hardware (IBM Condor, Google Willow) has ~100-1,000 physical qubits and no demonstrated logical-qubit advantage at scale; the gap is 3-4 orders of magnitude.
    • SHA-256 preimage resistance is even harder, requiring Grover's algorithm with ~2^128 quantum operations, far beyond any plausible 2035 machine.
    deepseek/deepseek-v4.1-flash · asked 13 Oct 2026
    3%

6 of 6 models answered · 21 points between the highest and lowest. None was shown the market price.

WHAT DO YOU THINK?
loading…

Question sourced from a news sweep on 13 Oct 2026. Forecast by google/gemini-3.8-flash, anthropic/claude-sonnet-5, openai/gpt-5.6-terra, x-ai/grok-4.6, deepseek/deepseek-v4.1-flash, qwen/qwen3.8-max-0902 via OpenRouter.