{"uid":"cap_kgR9JD72hLbkqL3jr5VwD","slug":"shor-s-threat-index-quantum-resource-estimator-a6ca7ca6","name":"Shor's Threat Index – Quantum Resource Estimator","description":"Estimates logical qubits and logical gates from algorithm family and key size, applies a caller-supplied error-correction overhead, and reports capacity and runtime ratios. The formulas are coarse planning heuristics, not cryptanalytic proof or a forecast of when cryptographically relevant quantum computers will exist.","url":"https://quantum.halowerk.com/v1/shors-threat-index","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"key_bits":{"type":"integer","maximum":32768,"minimum":128,"description":"RSA/modulus bits or ECC group-size bits."},"algorithm":{"enum":["rsa","finite-field-dh","ecc"],"type":"string"},"available_runtime_days":{"type":"number","maximum":365000,"minimum":0.000001},"available_physical_qubits":{"type":"integer","maximum":1000000000000,"minimum":1},"logical_gate_rate_per_second":{"type":"number","maximum":1000000000000000,"minimum":0.000001},"error_correction_physical_per_logical":{"type":"number","maximum":1000000000,"minimum":1}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.003","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.003/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.003","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.003","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_NSnjuOrMEroCIKkPTou86","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.003","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Estimates logical qubits and gates required to break RSA, DH, or ECC keys using Shor's algorithm, then compares those requirements against caller-supplied hardware capacity to produce capacity and runtime threat ratios.","exampleAgentPrompt":"Estimate the quantum resources needed to break a 2048-bit RSA key using Shor's algorithm, assuming I have 1 million physical qubits, a logical gate rate of 1 billion gates per second, 1000 physical qubits per logical qubit for error correction, and 365 days of available runtime — give me the capacity and runtime ratios.","exampleUseCases":[{"title":"Post-quantum migration risk triage","prompt":"We're planning our post-quantum migration and want to know how threatened our current 2048-bit RSA keys are. Assume a hypothetical adversary has 10 billion physical qubits, 1000 physical per logical qubit for error correction, a gate rate of 10 trillion per second, and 10 years of runtime. What are the capacity and runtime ratios for Shor's attack?"},{"title":"ECC key size adequacy check","prompt":"Can you check whether a quantum computer with 500 million physical qubits, a gate rate of 100 billion per second, error correction at 500 physical per logical, and 730 days of runtime would have the capacity to break our ECC-256 keys?"},{"title":"Finite-field DH quantum threat assessment","prompt":"We're using 3072-bit finite-field Diffie-Hellman. If someone had a quantum machine with 1 trillion physical qubits, error correction ratio of 2000 physical per logical, gate rate of 1 trillion per second, and 3650 days available, what does the Shor's threat index say about our exposure?"}],"resultDescription":"Returns estimated logical qubit and logical gate counts for running Shor's algorithm against the specified algorithm and key size, along with capacity ratio (available logical qubits vs required) and runtime ratio (available time vs estimated computation time), helping planners gauge how far current or projected quantum hardware is from cryptographically relevant capability.","failureModes":["key_bits out of range (below 128 or above 32768) returns validation error","algorithm value not in enum returns schema validation error","available_physical_qubits or logical_gate_rate_per_second at extreme bounds may produce astronomically large or near-zero ratios","error_correction_physical_per_logical below 1 is rejected","missing required fields return 400-class errors","results are heuristic estimates only and may not reflect state-of-the-art cryptanalytic complexity models"],"whenToPreferThis":"Choose this endpoint when you need a fast, parameterizable heuristic estimate of quantum threat exposure for RSA, ECC, or finite-field DH keys — especially for capacity planning, post-quantum migration prioritization, or communicating quantum risk to stakeholders. It is not suitable when you need a peer-reviewed cryptanalytic bound or a prediction of when quantum computers will actually exist.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T06:39:56.313Z","isFirstParty":false}