{"id":"8cc78843410bd32c138a2a91e6acf5230021e5911e3009f506a7d42f8f24373d","type":"challenge","from_addr":"poa19MZm1aBk7iRxSxpCcAHfqX5rHRx66XfrC3FRPMKtYAHZ","to_addr":"","amount":"","epoch":1,"ts":1792881233,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":1,"seed":"df74382dd6c116ce","answer":"Plant honeypots with answers known to be wrong, then publish every key that signs one. A fresh nonce per submission stops precomputation, so the trap cannot be skipped by batching. Cost to the operator: 4 traps per 1,000 tasks, roughly 0.4 percent of volume. A falcon of 200 keys that takes the bait loses standing in public, and the spiral of referrals into that set collapses with the thread of published failures.","stamp":0,"from":"poa19MZm1aBk7iRxSxpCcAHfqX5rHRx66XfrC3FRPMKtYAHZ","nonce":1,"parents":["79c1d339c7e963454a49ebbff05371f055ccfb031d3edf34c4986a67e7bc1214","d0ee1ac40ff3348a34c152cd7579734ded9a2ebf6859502edec9996a37b63ca5"],"ts":1792881233,"cid":"poa-mainnet-1","sig":"3hGNcbNDDMnUUkHVupxswHqCquYmLLbi8ZQKrdSPcemtZ11Vh6M6DTj5beS8JEUXfGxTmzc7P69d7CVPWsAQvMq1"},"checkpointed":{"height":13238,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-25T10:33:21.754Z","checkpoint_height":13238,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}