HALOWERKQuantumwerk
shors threat index
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.
POST https://quantum.halowerk.com/v1/shors-threat-indexEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| algorithm | string | Ja | |
| key_bits | integer | Ja | RSA/modulus bits or ECC group-size bits. |
| available_physical_qubits | integer | Ja | |
| logical_gate_rate_per_second | number | Ja | |
| error_correction_physical_per_logical | number | Ja | |
| available_runtime_days | number | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"required": [
"algorithm",
"key_bits",
"available_physical_qubits",
"logical_gate_rate_per_second",
"error_correction_physical_per_logical",
"available_runtime_days"
],
"additionalProperties": false,
"properties": {
"algorithm": {
"type": "string",
"enum": [
"rsa",
"finite-field-dh",
"ecc"
]
},
"key_bits": {
"type": "integer",
"minimum": 128,
"maximum": 32768,
"description": "RSA/modulus bits or ECC group-size bits."
},
"available_physical_qubits": {
"type": "integer",
"minimum": 1,
"maximum": 1000000000000
},
"logical_gate_rate_per_second": {
"type": "number",
"minimum": 1e-06,
"maximum": 1000000000000000
},
"error_correction_physical_per_logical": {
"type": "number",
"minimum": 1,
"maximum": 1000000000
},
"available_runtime_days": {
"type": "number",
"minimum": 1e-06,
"maximum": 365000
}
}
}Veröffentlichtes Eingabebeispiel
{
"algorithm": "rsa",
"key_bits": 2048,
"available_physical_qubits": 1000000,
"logical_gate_rate_per_second": 1000,
"error_correction_physical_per_logical": 1000,
"available_runtime_days": 30
}Ergebnis & Dokumentation
Veröffentlichtes Ergebnisschema anzeigen
{
"$ref": "https://quantum.halowerk.com/v1/shors-threat-index/schema#/outputSchema"
}Veröffentlichtes Ergebnisbeispiel öffnen
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-01, 15:19 UTC.
Weitere Endpunkte dieses Hubs
- Quantumwerk0,002 USDC
annealer schedule
POSThttps://quantum.halowerk.com/v1/annealer-scheduleInterpolates a caller-supplied start and end temperature across a bounded number of steps using either a linear or geometric rule. It does not run an annealer, optimize a problem Hamiltonian or tune a schedule from hardware measurements.
- Quantumwerk0,004 USDC
circuit optimize
POSThttps://quantum.halowerk.com/v1/circuit-optimizeCancels adjacent identical self-inverse gates on identical ordered targets and folds adjacent RX, RY or RZ rotations on identical targets. It preserves only these local identities; it does not commute gates, model hardware topology, synthes
- Quantumwerk0,004 USDC
entanglement test
POSThttps://quantum.halowerk.com/v1/entanglement-testConverts ++, +−, −+ and −− counts into a correlation for each of AB, AB′, A′B and A′B′, then computes S = E(AB) + E(AB′) + E(A′B) − E(A′B′). A value above the classical bound in supplied data does not by itself demonstrate entanglement or c