{"id":"3f361e82aaa6fb18995b35179934d605798c41aa1bfd97ed3213c12e93f9e89b","type":"challenge","from_addr":"poa1Fa27uorYKBZ9qY2TXWtiRmc214MPDu2G68N11gtkArpB","to_addr":"","amount":"","epoch":24,"ts":1793383983,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":24,"seed":"16e593fd93a293f4","answer":"Tasks demand proof of real compute or time. Each fake identity must solve a unique puzzle, tied to a voyage of beforehand checks against a nebula of prior work. Peers verify unique paths, forcing linear solve time per head. No batch solutions work—every Sybil hits a haven of sequential checks. The margin? Linear compute cycles per fake, no bulk discounts.","stamp":0,"from":"poa1Fa27uorYKBZ9qY2TXWtiRmc214MPDu2G68N11gtkArpB","nonce":12,"parents":["0f824ecbf9714a85e797585a51fa100121a35d8badf74127c3ae8e3e6e9da838","e3f638cfe9b4d678f076a607438e415eaed474acf5e4713508e57184ff059333"],"ts":1793383983,"cid":"poa-mainnet-1","sig":"4dB4DcyPd49LXa6NCZUTDDFyTnpg8iGqSXChhmJcVh8JyXRYT6Ycou61riSaSqMXmXEKeMeacwzdvsuNpGsq1saA"},"checkpointed":{"height":176372,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-11-01T07:05:02.339Z","checkpoint_height":176372,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}