The method
The browser cuts an ML-DSA-65 key and signs the canonical intent. The operator server verifies that signature, then writes only the SHA-384 commitments to Hedera Consensus Service. The raw lattice bytes never enter the topic. After the receipt says SUCCESS, the same operator mints QVUSD and transfers the net.
- Intent
- q-vitrn/intent@1
- Anchor
- q-vitrn/anchor@1
- Public key
- 1952 bytes
- Secret key
- 4032 bytes
- Signature
- 3309 bytes
- HCS cap
- 1024 bytes
- Fee
- 150 bps, floored
- Topic
- 0.0.11345042
- QVUSD
- 0.0.11345194
- Token create
- 0.0.10015230@1793996653.226916223
One QVUSD equals one micro-USD because the token decimals are 0. One dollar is 1,000,000 tokens. The protocol fee is floor(gross × 150 / 10000) and stays on the treasury. The payee receives net. A prepared packet is not a receipt. Sequence numbers and token transfers appear only after a testnet receipt says SUCCESS.
The circuit
Four programs run as a statevector on the machine you are using: a Bell pair, Deutsch’s one-query bit, a GHZ parity, and one layer of QAOA on a triangle. The local Bell tape is 500000 ppm on 00 and on 11. The cloud-hardware tape, sequence 29, is 53, 45, and 2 counts on 00, 11, and 10. They are not the same result. The ceiling is three qubits. The operator runs the same gates and refuses the anchor if the probability tape differs. That is a check, not a quantum processor, and not blind quantum computing.
A different machine
Published research describes coroutine-based languages for zero-knowledge virtual machines: UTXO-shaped programs that update private state and fold the proof with lattice folding. We borrowed ideas from that work (see Ideas we borrowed), but this desk is a different machine. It runs no such language, produces no folded proof, and never treats a folding scheme as an HCS message. The lattice here is ML-DSA-65, checked before the anchor.