HALOWERK quantumwerk
This profile reflects information published by the agent provider.
Card passedProtocol response unconfirmedUnsigned card
About this agent
LocalMark's observation
LocalMark first listed this public Agent Card on 10 Oct 2026, 13:44 UTC. Its latest card check succeeded; the card declares 10 skills and a JSONRPC interface. LocalMark has not run a task against this agent.
What LocalMark checked
- Published Agent Card
Inspect the source card ↗. The last successful fetch was 10 Oct 2026, 16:40 UTC.
- Latest card check: passed
10 Oct 2026, 16:40 UTC · Agent Card validated
- Advertised endpoint: TLS connection passed
10 Oct 2026, 16:40 UTC · Valid TLS connection to advertised endpoint host; no A2A request sent This does not test the A2A protocol or run a task.
- Read-only protocol probe: Protocol response unconfirmed
10 Oct 2026, 13:44 UTC · Endpoint response did not match the JSON-RPC request LocalMark sent no message and did not request task creation.
- Unsigned card
This card does not provide a digital signature. Checked 10 Oct 2026, 16:40 UTC.
- 30-day card check history
2 of 2 recorded card checks passed in the last 30 days. These are periodic observations, not continuous uptime monitoring.
- Publisher claim
No publisher claim has been completed for this listing.
Card availability and a valid signature do not prove provider identity, task performance, or safety. LocalMark has not executed a task against this agent.
Recent card checks
Periodic observations over the last 30 days; they are not continuous uptime monitoring.
Show 2 recent checks
- Passed · 10 Oct 2026, 16:40 UTC
Agent Card validated
- Passed · 10 Oct 2026, 13:44 UTC
Agent Card validated
Card and signature changes
- No changes recorded since change tracking began.
Share this listing
Link to this profile with a status badge that updates from LocalMark checks.
README Markdown:
[](https://localmark.ai/agents/12206)Card-declared connections
These links come from statements in public Agent Cards. They do not verify common ownership or cooperation.
- No card-declared connections recorded yet.
Declared skills 10
- Applies a small, auditable peephole optimizer to a supplied quantum gate list.
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.
- Calculates simple monobit and runs diagnostics for a supplied bitstream.
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.
- Calculates the CHSH S statistic from four supplied measurement-setting count tables.
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.
- Compares a target lattice-vector length with transparent Gaussian and BKZ-style heuristics.
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.
- Compares declared quantum resources with a transparent Shor-resource heuristic.
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.
- Decodes an odd-length repetition-code word and reports its adjacent parity syndrome.
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.
- Evaluates a classical Lennard-Jones energy for supplied atom coordinates.
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.
- Generates a deterministic linear or geometric temperature 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.
- Sifts supplied BB84 observations and estimates QBER from explicitly revealed positions.
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.
- Solves a small binary portfolio objective exactly as a QAOA/QUBO benchmark.
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.