{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WSOA3HXUUQTCEEZSI6DPZLCAOE","short_pith_number":"pith:WSOA3HXU","schema_version":"1.0","canonical_sha256":"b49c0d9ef4a4262213324786fcac40713feb35e61ee433583e25657e53e1b6a6","source":{"kind":"arxiv","id":"2306.08585","version":1},"attestation_state":"computed","paper":{"title":"How to compute a 256-bit elliptic curve private key with only 50 million Toffoli gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Litinski","submitted_at":"2023-06-14T15:47:49Z","abstract_excerpt":"We use Shor's algorithm for the computation of elliptic curve private keys as a case study for resource estimates in the silicon-photonics-inspired active-volume architecture. Here, a fault-tolerant surface-code quantum computer consists of modules with a logarithmic number of non-local inter-module connections, modifying the algorithmic cost function compared to 2D-local architectures. We find that the non-local connections reduce the cost per key by a factor of 300-700 depending on the operating regime. At 10% threshold, assuming a 10-$\\mu$s code cycle and non-local connections, one key can "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2306.08585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-06-14T15:47:49Z","cross_cats_sorted":[],"title_canon_sha256":"75f7f7c60fa96cd8d09f5a9f20aa1e0e402734cbdec6cd247a1e9ff02024cda2","abstract_canon_sha256":"cc8caad5fb72e3a267948df11cd7c66351eff125f2abb2874d4b6c34bc0f092f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:54.169945Z","signature_b64":"V4VCdRFC3r3gqph4JCY5Ewh6Qm4wElSwvdWUyIV2TEydJbdVqtIa0KlHVcR3/3yLysQXeacC6/Lkoagzu+neDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b49c0d9ef4a4262213324786fcac40713feb35e61ee433583e25657e53e1b6a6","last_reissued_at":"2026-07-05T06:20:54.169609Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:54.169609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to compute a 256-bit elliptic curve private key with only 50 million Toffoli gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Litinski","submitted_at":"2023-06-14T15:47:49Z","abstract_excerpt":"We use Shor's algorithm for the computation of elliptic curve private keys as a case study for resource estimates in the silicon-photonics-inspired active-volume architecture. Here, a fault-tolerant surface-code quantum computer consists of modules with a logarithmic number of non-local inter-module connections, modifying the algorithmic cost function compared to 2D-local architectures. We find that the non-local connections reduce the cost per key by a factor of 300-700 depending on the operating regime. At 10% threshold, assuming a 10-$\\mu$s code cycle and non-local connections, one key can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08585","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.08585/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2306.08585","created_at":"2026-07-05T06:20:54.169665+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.08585v1","created_at":"2026-07-05T06:20:54.169665+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08585","created_at":"2026-07-05T06:20:54.169665+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSOA3HXUUQTC","created_at":"2026-07-05T06:20:54.169665+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSOA3HXUUQTCEEZS","created_at":"2026-07-05T06:20:54.169665+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSOA3HXU","created_at":"2026-07-05T06:20:54.169665+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25011","citing_title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07734","citing_title":"Exploring the landscape of compact magic-state distillation factories","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02235","citing_title":"Optimized Point Addition Circuits for Elliptic Curve Discrete Logarithms","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28936","citing_title":"Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2410.13759","citing_title":"On the practicality of quantum sieving algorithms for the shortest vector problem","ref_index":143,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15297","citing_title":"Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2603.28627","citing_title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2603.28846","citing_title":"Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":76,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WSOA3HXUUQTCEEZSI6DPZLCAOE","json":"https://pith.science/pith/WSOA3HXUUQTCEEZSI6DPZLCAOE.json","graph_json":"https://pith.science/api/pith-number/WSOA3HXUUQTCEEZSI6DPZLCAOE/graph.json","events_json":"https://pith.science/api/pith-number/WSOA3HXUUQTCEEZSI6DPZLCAOE/events.json","paper":"https://pith.science/paper/WSOA3HXU"},"agent_actions":{"view_html":"https://pith.science/pith/WSOA3HXUUQTCEEZSI6DPZLCAOE","download_json":"https://pith.science/pith/WSOA3HXUUQTCEEZSI6DPZLCAOE.json","view_paper":"https://pith.science/paper/WSOA3HXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.08585&json=true","fetch_graph":"https://pith.science/api/pith-number/WSOA3HXUUQTCEEZSI6DPZLCAOE/graph.json","fetch_events":"https://pith.science/api/pith-number/WSOA3HXUUQTCEEZSI6DPZLCAOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSOA3HXUUQTCEEZSI6DPZLCAOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSOA3HXUUQTCEEZSI6DPZLCAOE/action/storage_attestation","attest_author":"https://pith.science/pith/WSOA3HXUUQTCEEZSI6DPZLCAOE/action/author_attestation","sign_citation":"https://pith.science/pith/WSOA3HXUUQTCEEZSI6DPZLCAOE/action/citation_signature","submit_replication":"https://pith.science/pith/WSOA3HXUUQTCEEZSI6DPZLCAOE/action/replication_record"}},"created_at":"2026-07-05T06:20:54.169665+00:00","updated_at":"2026-07-05T06:20:54.169665+00:00"}