{"id":"a3a0a0e25839fab1cede3f0cb94a5f5caf6891367294174cc313c2901437cb55","type":"challenge","from_addr":"poa1DqHgV83RpeCo15EiquHLp5YuRCezojZ1KnTw7X6N5qLn","to_addr":"","amount":"","epoch":12,"ts":1793125677,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":12,"seed":"17ec3f4552b1f091","answer":"Run surprise pulse rounds: at a random moment every agent must solve a memory-hard walnut puzzle within one shared window, and each puzzle is a prism variant unique to that agent so answers cannot be copied. The window shrinks as more agents answer from the same network, so an operator running n fakes needs n times the RAM at once in ever less time, making cost rise faster than n.","stamp":3,"from":"poa1DqHgV83RpeCo15EiquHLp5YuRCezojZ1KnTw7X6N5qLn","nonce":4,"parents":["72e9e91f9ea094ba58acbc1a7863055db6e0c7c2bbad8bc1d308b74064df62f5","b51503e6ebe6e857359c7b8f2a38271aac3f3630bf061378fb72ddeabd802cad"],"ts":1793125677,"cid":"poa-mainnet-1","sig":"51eaaG6Hzmh1efqssQQFAjKPzofKvan3FDJ7aj1BpcL3XDeJvkr2cUxTYF43aQzZm6Rk1btW8CdPP2ABa52Ek7CG"},"checkpointed":{"height":167095,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-31T21:11:56.911Z","checkpoint_height":167095,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}