{
  "abstract": "We propose Open Autoresearch, a paradigm in which humans and AI agents publish evaluator-verified improvements to a public leaderboard. We instantiate it in ECDSA.Fail, optimizing reversible secp256k1 point-addition circuits, a bottleneck in Shor's algorithm for elliptic-curve cryptography. The benchmark minimizes the spacetime-inspired score $S=Q\\times T$, where $Q$ is peak logical qubit width and $T$ is average executed Toffoli count. Participants reduced $S$ by 86.1%. At the data cutoff (26 July 2026), the best-scoring circuit uses 1,151 qubits and 1,299,453 average executed Toffoli gates, giving $Q\\times T\\approx1.496$ billion. This is more than 50% below Google's published point-addition score thresholds (arXiv:2603.28846), under different accounting conventions. Because the benchmark supplies one addend classically, we construct a coherent windowed-addition-compatible variant implementing the single-call interface required by windowed Shor. It uses 1,162 qubits and 1,684,161 average executed Toffoli gates. On 100,000 random inputs, its empirical success probability is $\\hat{p}=0.99809$, giving $Q\\times T/\\hat{p}\\approx1.961$ billion under an independently rerunnable per-call sensitivity model, not a full-Shor success estimate. Its qubit and Toffoli counts lie below Google's published thresholds and Schrottenloher's reported operating points (arXiv:2606.02235), although differing interfaces, accounting conventions, and validation scope preclude formal dominance. After the cutoff, the score was further reduced to 1.259 billion, while a separate low-width circuit reached 813 qubits. The public record shows AI agents complementing human judgment, providing evidence for open autoresearch on efficiently evaluable, machine-checkable objectives.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.09582",
  "author_total": 35,
  "authors": [
    {
      "name": "Jieyi Long"
    },
    {
      "name": "Theodore Pender"
    },
    {
      "name": "Zhao Huang"
    },
    {
      "name": "Manuel B. Santos"
    },
    {
      "name": "Samrendra Kumar Singh"
    },
    {
      "name": "Bartosz Naskręcki"
    },
    {
      "name": "Bit Wonka"
    },
    {
      "name": "Pierre-Luc Dallaire-Demers"
    },
    {
      "name": "Francesco Giannicola"
    },
    {
      "name": "Ruben M. L. Paschoarelli"
    },
    {
      "name": "Oli Freuler"
    },
    {
      "name": "Jackie Chia-Hsun Lee"
    },
    {
      "name": "Vasily Gnuchev"
    },
    {
      "name": "Gopi Kannappan"
    },
    {
      "name": "John Boyer"
    },
    {
      "name": "Xavier Butler"
    },
    {
      "name": "Akash Balasubramani"
    },
    {
      "name": "Jordan Newman"
    },
    {
      "name": "Bereket Dereje"
    },
    {
      "name": "Alexander Hertlein"
    },
    {
      "name": "Robert Kodra"
    },
    {
      "name": "Lucas Levy"
    },
    {
      "name": "Shaan Patel"
    },
    {
      "name": "JT Rose"
    },
    {
      "name": "Matt Zweil"
    },
    {
      "name": "Okechukwu Wisdom"
    },
    {
      "name": "Tarek El-Eter"
    },
    {
      "name": "Edison Lee"
    },
    {
      "name": "Michael Dong"
    },
    {
      "name": "Alan Li"
    },
    {
      "name": "Anto Joseph"
    },
    {
      "name": "Gajesh Naik"
    },
    {
      "name": "Gautham Anant"
    },
    {
      "name": "Soubhik Deb"
    },
    {
      "name": "Justin Drake"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/de1rm532sn4ww.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.09582",
  "fulltext_url": null,
  "id": "de1rm532sn4ww",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.09582",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CR"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7212156114",
  "pdf_url": "https://arxiv.org/pdf/2609.09582",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-19",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/de1rm532sn4ww.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:23:19Z",
      "native_id": "2609.09582",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.09582"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor's Algorithm",
  "title_text": "ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor's Algorithm",
  "type": "preprint",
  "updated_at": "2026-10-30T12:23:19Z",
  "url": "https://research.draconitic.com/paper/de1rm532sn4ww",
  "venue": "arXiv",
  "versions": []
}