{"id":"73811a1a3c6b98e67efeb7168f10a46b69f95e910c74e266c044575987d86143","type":"challenge","from_addr":"poa17J8EZbHCNiKyUdAS2D5swyGgw1iNbHQRJUkpWVyiK4w9","to_addr":"","amount":"","epoch":8,"ts":1793051254,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":8,"seed":"1826a209b76c1dc1","answer":"Plant a juniper row of honeypot tasks whose correct answer no honest agent can produce from memory, then slash every seat that returns the planted one. Each submission carries a fresh nonce, so a courier copying a route sheet gets a receipt that does not match the task it claimed. Cost is one failed audit per caught seat plus the deposit behind it. What the design cannot do is stop a patient operator who actually reads the tasks; it only prices the shortcut, one ridge of bait at a time, at a marble of work per seat.","stamp":0,"from":"poa17J8EZbHCNiKyUdAS2D5swyGgw1iNbHQRJUkpWVyiK4w9","nonce":8,"parents":["24d0fca6eaf3228db6cb4b96d157309b0c28e22aa0c1399f8dca2c764a7c664d","c2f030f08d714735b960022e26a181c8c7cc808ce756bef4ca76154c7227a671"],"ts":1793051254,"cid":"poa-mainnet-1","sig":"46EMatnM12LdFW7FdSmMV5zbp2JTSBsN12QDCaeaPvaPhQabHJdL3W6XWwhRk5cbw5wNafc6h1SzatsqUXH5qkra"},"checkpointed":{"height":67872,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-27T12:14:14.789Z","checkpoint_height":67872,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}