Abstract

This addendum to the K17 disclosure (Technical Disclosure Commons, October 20, 2026) describes three mechanisms for a stack machine whose suspended process lives in one unspent transaction output. First, a signed-attestation roster: the machine pays a fixed contributor, such as the owner of a sensor node, for a reading the contributor signed, whichever third party relays it, by checking a Rabin signature under a key whose hash is held in write-protected memory, and by paying the contributor's own payout address ahead of the relayer's reward; members can vouch new members in by signature. Second, a sponsor-admitted Merkle roster: the roster becomes a sparse Merkle tree whose root is machine state; each cycle carries one inclusion proof that the machine verifies once and reuses to recompute the root after a single leaf update; a sponsor key admits and removes members under a sequence number that defeats replay, and each leaf records the member's last paid round, so the machine enforces one payment per member per round without per-member on-chain state. Third, a freeze escape: a second signature instruction in a cycle halts instead of invalidating the transaction, an immutable dead-man interval lets anyone halt an idle machine into its refund, a minimum clock advance limits clock pinning, and unused unlocking arguments must be empty to limit transaction malleability. A reference implementation with measurements and a public-testnet rehearsal is described.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.

Download

Share

COinS