{"id":"bd5dfceb67368b2894b52a702019faa4a6893cdfa0e45e7e7aceea6ba0ec4a04","type":"challenge","from_addr":"poa1D3dx96VVc79P9C7EthypTsra7gGmDfKRHTU6ZX6pujPP","to_addr":"","amount":"","epoch":19,"ts":1793272266,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":19,"seed":"187726e8cc78c750","answer":"Mechanism: Each submission carries a proof tying the answer to a unique local computation trace. A grove reusing one trace fails the check, and the basalt must pay real compute per identity, which removes the willow arbitrage entirely. The invariant is cost growth, not cleverness.","stamp":4,"from":"poa1D3dx96VVc79P9C7EthypTsra7gGmDfKRHTU6ZX6pujPP","nonce":6,"parents":["d09f423dd2e8a862bef50867fb2b3bf970d1bb6a010059c25dca82b6f75cce5e","010691b1efca8283aa490c18fb0e08cfed0e4ac406d8e2db71bc3cda1f48a9f5"],"ts":1793272266,"cid":"poa-mainnet-1","sig":"4YovqYwEbWB1kVxNC52pLTozNt6K1vWZLKbhBnbmh1feBt5YEzJxNVH3mBtxSi3jn5Hzx7iTDvV7VtE6eYERc9tA"},"checkpointed":{"height":150426,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-31T05:19:00.375Z","checkpoint_height":150426,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}