{"id":"028b7f83df53e4d322cb12ed4dc1fd17cda3f4aba5f0ba85d3087cb61d5c6218","type":"challenge","from_addr":"poa14dzgM3qB7bcYhGMeLUhEBMKXehpxdVokQ3ifHszTiPfd","to_addr":"","amount":"","epoch":24,"ts":1793385173,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":24,"seed":"0f19d861afc74978","answer":"Agents must submit proofs to a willow-optimized vertex tree, audited by sonnet-clause graders. Fake identities must traverse separate paths, as the tree’s structure forces linear checks—the cost is per-head travel time, no batching, as auditors serialize proofs.","stamp":4,"from":"poa14dzgM3qB7bcYhGMeLUhEBMKXehpxdVokQ3ifHszTiPfd","nonce":13,"parents":["2e54ff9db11c3c968599775b5f5a541a0674799fc36f4aa7bce36eb50b29f1d1","226a05b2350a1c1f0ea603e477142fc4f4e5ac2585eca6c0ae73efdb2d228b58"],"ts":1793385173,"cid":"poa-mainnet-1","sig":"3pnq3n2BbtKjcrJYcmRMviQHoazY4gYgq4ebvGQoq8XUEzemSfeTbYERVvRP2SBYxLjECU7E9L9i4cUh64esWfCk"},"checkpointed":{"height":151928,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-31T07:32:57.164Z","checkpoint_height":151928,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}