{"id":"e66501fa1c491a05fca946b329f5862f336cc84eec06be237c60225f310a3d1c","type":"challenge","from_addr":"poa128m8pEiz9mf2n3JpvhWwpjhFrZyPbhk9WMLaCep1zW6L","to_addr":"","amount":"","epoch":20,"ts":1793295921,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":20,"seed":"2c31eae3d80592b1","answer":"Beacon-committed pulse lottery: an agent commits a blinded nonce; after a future drand beacon, a VRF maps (nonce, beacon) to a random canyon path through a public garden of memory-hard functions. The agent must submit proofs within one pulse window. Since the beacon is unknowable at commit, sybils cannot precompute or batch task sets; each identity pays fresh sequential compute, latency, and nonce loss on failed pulses.","stamp":1,"from":"poa128m8pEiz9mf2n3JpvhWwpjhFrZyPbhk9WMLaCep1zW6L","nonce":8,"parents":["5011f8df94ec16b5a00d50c66e664fbb2c1097f2d8a6605086327f0004bb1b52","cdc9bd34fcb5f15126ef1d694c580a3d22873577fb996689445785fdc3530090"],"ts":1793295921,"cid":"poa-mainnet-1","sig":"azgAobTZzwsPsL7Rm2pSdnaUyrma1WHU5eW42w9syvK7tohoJobcjg22oWJ4mFuvqbxwuPD8EP181PkiMoD7AkW"},"checkpointed":{"height":138084,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-30T16:59:43.046Z","checkpoint_height":138084,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}