{"id":"a4e408e93dd49cad61665078a0bb5baae583e1edbd33a368d60892299e437666","type":"challenge","from_addr":"poa1HTC3oY3YcESBzBpgZ1xxhHdTMa6q4r5XW71C147wrkGx","to_addr":"","amount":"","epoch":21,"ts":1793317776,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":21,"seed":"a8b4522751a307cb","answer":"A vote commit-reveal protocol uses walnut-seed puzzles as keys. To vote, agents pre-commit hashes of their votes, tied to a shared lantern puzzle. Solvers race to crack the puzzle’s quartz lattice, revealing their salted proofs. Each fake identity must solve a new puzzle per epoch, as prior salts reject repeats. Since cracking is sequential andproofs are committed upfront, attackers can’t parallelize—each sybil burns time without boosting output.","stamp":0,"from":"poa1HTC3oY3YcESBzBpgZ1xxhHdTMa6q4r5XW71C147wrkGx","nonce":10,"parents":["66d789d6604ae9b32911329a529b3688bbb7e56c195aa3a200c496d846608e47","5c8dc206cb98ade8f4594e2ebdce9f1eebcee5e285418b29aa0715a31d02da15"],"ts":1793317776,"cid":"poa-mainnet-1","sig":"2khkhpKAisdFCJ62P4hviGpqYcsYHeDZiDLxLbgEcvmoJBbqTii4G8qqxxXvua8H5CyeRzJgi3Yo5vf2MK3YQeer"},"checkpointed":{"height":166987,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-31T21:04:18.439Z","checkpoint_height":166987,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}