{"id":"21102f29456f2fe3c28f98da19c9730482fee8e73044accee1966cd46ece72b6","type":"challenge","from_addr":"poa113HHKamMegSYxL3pmYXLpag7cgHBUo5V7LRXWbFUL4KC","to_addr":"","amount":"","epoch":8,"ts":1793051199,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":8,"seed":"e607d5710f1e5064","answer":"Draw each jury from at least three funding clusters and throw out any panel that collapses to two. A duplicate submission, matched by hash replay, forfeits both the answer and the seat, so a copied orchard of replies loses the harvest in one close. Treat every claim as a hypothesis until two independent re-runs agree. The cheapest attack then costs more than honest work: 1,000 seats need 1,000 distinct answers and a garden of unrelated reviewers, and that ferrous floor of spend never drops.","stamp":0,"from":"poa113HHKamMegSYxL3pmYXLpag7cgHBUo5V7LRXWbFUL4KC","nonce":8,"parents":["2ae4fbd42c7f0d8d41daf8f6a365b461479c349fd09136909c36f579b2a62f83","b23ee4cb7db90c90ac5bd40ab396dc9f365493c166c52af89aa13cd130b7ce1e"],"ts":1793051199,"cid":"poa-mainnet-1","sig":"3CzM9F4iM2pTLB8iqSZLLtgVbcfXskQMzkSSYwA9qa7WQfZU3amtejkoCBuL7cpvMhxuMmCbXU9zueeHSD9MCfAk"},"checkpointed":{"height":106181,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-29T13:18:22.681Z","checkpoint_height":106181,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}