# HALOWERK quantumwerk

> HALOWERK quantumwerk provides machine-readable results paid via x402.
> Netz Base Mainnet, Zahlungsmittel USDC, Empfänger 0x2880EdfFF13100677Bf97A3CBdF3Bc34771C4E5E.

## So wird bezahlt

1. Call the route without a payment header. The 402 response includes accepts, description, and inputSchema.
2. Bedingungen mit einem x402-Client signieren.
3. Repeat the call with the proof in the PAYMENT-SIGNATURE header.

Eine 402-Antwort kostet nichts und löst keine Arbeit aus. Scheitert die Arbeit,
trägt die Antwort charged=false und es wird nicht abgerechnet.

## Endpunkte

### POST /v1/qkd-key-request

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 remaining demonstration bits. It neither exchanges quantum states nor creates a secret key: all submitted bits are disclosed to this service and must never be used as production key material.

- Preis: 0.004 USDC
- MCP-Werkzeug: `quantumwerk_qkd_key_request`
- Eingabe: `["alice_bits","alice_bases","bob_bits","bob_bases","reveal_indices"]`

### POST /v1/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.

- Preis: 0.003 USDC
- MCP-Werkzeug: `quantumwerk_shors_threat_index`
- Eingabe: `["algorithm","key_bits","available_physical_qubits","logical_gate_rate_per_second","error_correction_physical_per_logical","available_runtime_days"]`

### POST /v1/circuit-optimize

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 gates, model hardware topology, synthesize arbitrary unitaries or prove global optimality.

- Preis: 0.004 USDC
- MCP-Werkzeug: `quantumwerk_circuit_optimize`
- Eingabe: `["qubit_count","gates"]`

### POST /v1/error-correction

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 not a surface-code simulation and does not model coherent quantum errors, measurements or fault-tolerant thresholds.

- Preis: 0.003 USDC
- MCP-Werkzeug: `quantumwerk_error_correction`
- Eingabe: `["encoded_bits"]`

### POST /v1/annealer-schedule

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 schedule from hardware measurements.

- Preis: 0.002 USDC
- MCP-Werkzeug: `quantumwerk_annealer_schedule`
- Eingabe: `["start_temperature","end_temperature","steps","schedule"]`

### POST /v1/lattice-check

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, validate an LWE instance or provide a cryptographic security level.

- Preis: 0.003 USDC
- MCP-Werkzeug: `quantumwerk_lattice_check`
- Eingabe: `["dimension","log2_determinant","target_norm_log2","root_hermite_factor"]`

### POST /v1/random-number

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 replacement, entropy estimate or certification of cryptographic randomness.

- Preis: 0.002 USDC
- MCP-Werkzeug: `quantumwerk_random_number`
- Eingabe: `["bits"]`

### POST /v1/molecule-sim

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, relax geometry, model bonds or predict experimental molecular behavior.

- Preis: 0.004 USDC
- MCP-Werkzeug: `quantumwerk_molecule_sim`
- Eingabe: `["atoms","epsilon","sigma"]`

### POST /v1/portfolio-qaoa

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 deterministic classical optimum for testing a corresponding binary QAOA or QUBO formulation; it is not investment advice and ignores transaction costs and allocation sizes.

- Preis: 0.005 USDC
- MCP-Werkzeug: `quantumwerk_portfolio_qaoa`
- Eingabe: `["assets","covariance","select_count","risk_aversion"]`

### POST /v1/entanglement-test

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 by itself demonstrate entanglement or close detection, locality, sampling or significance loopholes.

- Preis: 0.004 USDC
- MCP-Werkzeug: `quantumwerk_entanglement_test`
- Eingabe: `["measurements"]`

## Weitere Flächen

- OpenAPI: https://quantum.halowerk.com/openapi.json
- Preise: https://quantum.halowerk.com/pricing
- x402-Manifest: https://quantum.halowerk.com/.well-known/x402
- Bazaar: https://quantum.halowerk.com/.well-known/x402/bazaar
- MCP: https://quantum.halowerk.com/mcp


## Missing a capability?

If you looked for something this service does not offer, say so.
One call, no payment, no sign-up, no account:

  POST https://bedarf.halowerk.com/capabilities/request
  Content-Type: application/json
  {"requested_capability": "what you would buy",
   "description": "the use case, one sentence",
   "callback_url": "optional - we call back once it exists"}

Only requested_capability is required, 3 to 160 characters.
Schema and status: https://bedarf.halowerk.com/openapi.json
Submissions are held for review and are never published verbatim.