{"protocolVersion":"0.3.0","name":"HALOWERK quantumwerk","description":"HALOWERK quantumwerk. Bezahlung über x402 in USDC auf Base Mainnet.","url":"https://quantum.halowerk.com","version":"1.0.0","preferredTransport":"JSONRPC","capabilities":{"streaming":false,"pushNotifications":false,"stateTransitionHistory":false},"defaultInputModes":["application/json"],"defaultOutputModes":["application/json"],"skills":[{"id":"quantumwerk_qkd_key_request","name":"Sifts supplied BB84 observations and estimates QBER from explicitly revealed positions.","description":"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.","tags":["quantumwerk"],"examples":[],"inputModes":["application/json"],"outputModes":["application/json"]},{"id":"quantumwerk_shors_threat_index","name":"Compares declared quantum resources with a transparent Shor-resource heuristic.","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.","tags":["quantumwerk"],"examples":[],"inputModes":["application/json"],"outputModes":["application/json"]},{"id":"quantumwerk_circuit_optimize","name":"Applies a small, auditable peephole optimizer to a supplied quantum gate list.","description":"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.","tags":["quantumwerk"],"examples":[],"inputModes":["application/json"],"outputModes":["application/json"]},{"id":"quantumwerk_error_correction","name":"Decodes an odd-length repetition-code word and reports its adjacent parity syndrome.","description":"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.","tags":["quantumwerk"],"examples":[],"inputModes":["application/json"],"outputModes":["application/json"]},{"id":"quantumwerk_annealer_schedule","name":"Generates a deterministic linear or geometric temperature schedule.","description":"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.","tags":["quantumwerk"],"examples":[],"inputModes":["application/json"],"outputModes":["application/json"]},{"id":"quantumwerk_lattice_check","name":"Compares a target lattice-vector length with transparent Gaussian and BKZ-style heuristics.","description":"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.","tags":["quantumwerk"],"examples":[],"inputModes":["application/json"],"outputModes":["application/json"]},{"id":"quantumwerk_random_number","name":"Calculates simple monobit and runs diagnostics for a supplied bitstream.","description":"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.","tags":["quantumwerk"],"examples":[],"inputModes":["application/json"],"outputModes":["application/json"]},{"id":"quantumwerk_molecule_sim","name":"Evaluates a classical Lennard-Jones energy for supplied atom coordinates.","description":"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.","tags":["quantumwerk"],"examples":[],"inputModes":["application/json"],"outputModes":["application/json"]},{"id":"quantumwerk_portfolio_qaoa","name":"Solves a small binary portfolio objective exactly as a QAOA/QUBO benchmark.","description":"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.","tags":["quantumwerk"],"examples":[],"inputModes":["application/json"],"outputModes":["application/json"]},{"id":"quantumwerk_entanglement_test","name":"Calculates the CHSH S statistic from four supplied measurement-setting count tables.","description":"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.","tags":["quantumwerk"],"examples":[],"inputModes":["application/json"],"outputModes":["application/json"]}],"payment":{"protocol":"x402","network":"eip155:8453","asset":"USDC","recipient":"0x2880EdfFF13100677Bf97A3CBdF3Bc34771C4E5E","manifest":"https://quantum.halowerk.com/.well-known/x402"}}