[
 {
  "id": "arxiv:2604.06319#0",
  "kind": "attack",
  "target": "rsa-2048",
  "physical_qubits": 381000.0,
  "runtime": 220.8,
  "quote": "We then consider the factorization of 2048-bit RSA-integers; using an experimentally demonstrated grid-coupling topology, factoring RSA-2048 requires 381k physical qubits and 9.2 days, which can be reduced to 4.9 days via addition of an algorithm-specific accelerator for the Adder subroutine (requiring 439k qubits).",
  "url": "http://arxiv.org/abs/2604.06319v2",
  "title": "Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting",
  "published": "2026-04-07",
  "added": "2026-11-09",
  "models": {
   "primary": "gemini-3.5-flash-lite",
   "secondary": "gemma-4-31b-it"
  },
  "verification": "auto: verifier + two model families agree",
  "regex_agrees": true
 },
 {
  "id": "arxiv:2609.05625#1",
  "kind": "attack",
  "target": "ecdlp-256",
  "physical_qubits": 19397.0,
  "runtime": 616.8,
  "quote": "All results and optimizations combined, we conclude that a trapped-ion quantum computer based on our architecture can solve the ECDLP on secp256k1 in approximately 25.7 days using 19,397 physical qubits with an estimated success probability of 63%.",
  "url": "http://arxiv.org/abs/2609.05625v1",
  "title": "Computing 256-bit elliptic curve discrete logarithms in 26 days on a fault-tolerant trapped-ion quantum computer with 20,000 qubits",
  "published": "2026-09-04",
  "added": "2026-11-09",
  "models": {
   "primary": "gemini-3.5-flash-lite",
   "secondary": "gemma-4-31b-it"
  },
  "verification": "auto: verifier + two model families agree",
  "regex_agrees": false
 },
 {
  "id": "arxiv:2505.15917#2",
  "kind": "attack",
  "target": "rsa-2048",
  "physical_qubits": 1000000.0,
  "runtime": 168,
  "quote": "I estimate that a 2048 bit RSA integer could be factored in less than a week by a quantum computer with less than a million noisy qubits.",
  "url": "http://arxiv.org/abs/2505.15917v1",
  "title": "How to factor 2048 bit RSA integers with less than a million noisy qubits",
  "published": "2025-05-21",
  "added": "2026-11-09",
  "models": {
   "primary": "gemini-3.5-flash-lite",
   "secondary": "gemma-4-31b-it"
  },
  "verification": "auto: verifier + two model families agree",
  "regex_agrees": true
 },
 {
  "id": "arxiv:2610.37839#3",
  "kind": "attack",
  "target": "rsa-2048",
  "physical_qubits": 23000.0,
  "runtime": 75.36,
  "quote": "factoring RSA-2048, the configuration we compile in full, requires about 23 000 cat qubits and 3.14 days.",
  "url": "http://arxiv.org/abs/2610.37839v1",
  "title": "Shor's algorithm compiled on cat qubits: 22 593 qubits for RSA-2048 in 3.14 days",
  "published": "2026-10-27",
  "added": "2026-11-09",
  "models": {
   "primary": "gemini-3.5-flash-lite",
   "secondary": "gemma-4-31b-it"
  },
  "verification": "auto: verifier + two model families agree",
  "regex_agrees": true
 },
 {
  "id": "arxiv:2610.37839#4",
  "kind": "attack",
  "target": "ecdlp-256",
  "physical_qubits": 30000.0,
  "runtime": 1.0,
  "quote": "Reusing the compiled operations, solving ECDLP on secp256k1 requires at most 30 000 cat qubits and 1 hour",
  "url": "http://arxiv.org/abs/2610.37839v1",
  "title": "Shor's algorithm compiled on cat qubits: 22 593 qubits for RSA-2048 in 3.14 days",
  "published": "2026-10-27",
  "added": "2026-11-09",
  "models": {
   "primary": "gemini-3.5-flash-lite",
   "secondary": "gemma-4-31b-it"
  },
  "verification": "auto: verifier + two model families agree",
  "regex_agrees": false
 },
 {
  "id": "arxiv:2610.37839#5",
  "kind": "attack",
  "target": "rsa-2048",
  "physical_qubits": 611000.0,
  "runtime": 1.25,
  "quote": "Trading space for time, RSA-2048 runs in 1.25 hours on about 611 000 cat qubits.",
  "url": "http://arxiv.org/abs/2610.37839v1",
  "title": "Shor's algorithm compiled on cat qubits: 22 593 qubits for RSA-2048 in 3.14 days",
  "published": "2026-10-27",
  "added": "2026-11-09",
  "models": {
   "primary": "gemini-3.5-flash-lite",
   "secondary": "gemma-4-31b-it"
  },
  "verification": "auto: verifier + two model families agree",
  "regex_agrees": true
 },
 {
  "id": "arxiv:2610.37839#6",
  "kind": "attack",
  "target": "rsa-2048",
  "physical_qubits": 45000.0,
  "quote": "The no-bit-flip requirement (a bit-flip time of about 100 years) can be relaxed to a bit-flip time of about one hour by adding a concatenation layer with a distance-3 bit-flip code, in which case RSA-2048 needs about 45 000 cat qubits.",
  "url": "http://arxiv.org/abs/2610.37839v1",
  "title": "Shor's algorithm compiled on cat qubits: 22 593 qubits for RSA-2048 in 3.14 days",
  "published": "2026-10-27",
  "added": "2026-11-09",
  "models": {
   "primary": "gemini-3.5-flash-lite",
   "secondary": "gemma-4-31b-it"
  },
  "verification": "auto: verifier + two model families agree",
  "regex_agrees": false
 },
 {
  "id": "arxiv:2302.06639#7",
  "kind": "attack",
  "target": "ecdlp-256",
  "physical_qubits": 126133.0,
  "runtime": 9.0,
  "quote": "Assuming a ratio between single- and two-photon losses of 1e-5 and a cycle time of 500 ns, we show concretely that such an architecture can compute a 256-bit elliptic curve logarithm in 9 h with 126133 cat qubits and on average 19 photons by cat state.",
  "url": "http://arxiv.org/abs/2302.06639v2",
  "title": "Performance Analysis of a Repetition Cat Code Architecture: Computing 256-bit Elliptic Curve Logarithm in 9 Hours with 126133 Cat Qubits",
  "published": "2023-02-13",
  "added": "2026-11-09",
  "models": {
   "primary": "gemini-3.5-flash-lite",
   "secondary": "gemma-4-31b-it"
  },
  "verification": "auto: verifier + two model families agree",
  "regex_agrees": false
 }
]