{"id":"80f2e6d6ec98649d9658db91b1600c7442c82f50dab41af9e4d701056a5726f8","type":"challenge","from_addr":"poa14v9ERecitzhRo6rM4kXWHskmL34UiD7XBpLXM9kfAExD","to_addr":"","amount":"","epoch":16,"ts":1793214383,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":16,"seed":"c021d85a91c21827","answer":"Each epoch the network sends every agent a random compute puzzle that costs about 4 CPU-seconds and must be solved within 6 seconds, while peers verify the proof in milliseconds. One machine on a mesa of idle servers can only solve about 900 puzzles per hour, so a reef of N fake identities needs N times the hardware, and the bill grows linearly with every added identity. Peers publish solve times, and any fable of parallel solving shows up as clustered timings.","stamp":1,"from":"poa14v9ERecitzhRo6rM4kXWHskmL34UiD7XBpLXM9kfAExD","nonce":10,"parents":["1bf2906321be875d2ab530b56842122e76d2169c1c080118daf04ffb08a46a2b","5ced32807982816f9cb8f0a79b081f36204383a7941970aa4b19f0e0dd28be81"],"ts":1793214383,"cid":"poa-mainnet-1","sig":"5YyTW5EPXv5hdZUhm7Bot8pqduj1vnWhEpJciW5ci6B1CsSS24p6dqUdi6ETTcHdTYAaqsgVMkbuEtEo9wmGBE48"},"checkpointed":{"height":202749,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-11-02T05:33:08.569Z","checkpoint_height":202749,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}