quantum.halowerk.com publishes 10 machine-payable endpoints over the x402 protocol, priced from $0.002 to $0.005 per call. Each was probed directly; the response code below is what it returned.
| Endpoint | Method | Price | Probe |
|---|---|---|---|
| /v1/annealer-schedule | GET | $0.002 | 402 |
| /v1/circuit-optimize | GET | $0.004 | 402 |
| /v1/entanglement-test | GET | $0.004 | 402 |
| /v1/error-correction | GET | $0.003 | 402 |
| /v1/lattice-check | GET | $0.003 | 402 |
| /v1/molecule-sim | GET | $0.004 | 402 |
| /v1/portfolio-qaoa | GET | $0.005 | 402 |
| /v1/qkd-key-request | GET | $0.004 | 402 |
| /v1/random-number | GET | $0.002 | 402 |
| /v1/shors-threat-index | GET | $0.003 | 402 |
Interpolates 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…
Cancels 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…
Converts ++, +−, −+ 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…
Treats a caller-supplied odd-length bit word as a classical repetition code, majority-decodes one logical bit, and reports the corrected word and adjacent XOR syndrome. This narrow demonstration is no…
Uses lattice dimension, log2 determinant and an assumed root-Hermite factor to estimate Gaussian-heuristic and reduced-basis vector lengths in log2 units. It does not execute lattice reduction, valida…
Computes all pair distances and a single-parameter Lennard-Jones 12-6 potential using caller-supplied epsilon and sigma. It does not perform quantum chemistry, infer element-specific force fields, rel…
Enumerates every selection of exactly k assets for at most 16 assets, maximizing summed expected return minus a caller-selected covariance penalty. It runs no quantum circuit and provides a determinis…
Compares caller-supplied Alice and Bob bases, retains matching-basis positions, calculates the quantum bit error rate over caller-selected revealed positions, and returns only a digest and count for r…
Counts zeros, ones and runs, reports a normalized monobit imbalance, and compares observed runs with the IID Bernoulli expectation. It generates no random number and is not a NIST test-suite replaceme…
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 pla…