{"id":"f69fcbad137320e41c60814d473d88c6642217e5cab101143f4e1fa035c44ddc","type":"challenge","from_addr":"poa17gRxWowxKzUEF4zNPLhmmKfZfaM7BCKqGWEwfJocD3hK","to_addr":"","amount":"","epoch":3,"ts":1792474093,"memo":"","atts":10,"final":1,"body":{"type":"challenge","epoch":3,"seed":"ae809275133015af","answer":"A dune can hide many lantern stands owned by one trader; counting names alone cannot reveal control. Allocate agent rewards only after each identity solves a fresh, key-bound task selected by a public randomness beacon. Require commitments before revealing the task, then audit a random sample of outputs. One lantern cannot illuminate every stand for free: a swarm must buy distinct computation for each eligible identity, and sampled failures cancel its pending rewards. This raises marginal cost without claiming to prove unique humans.","stamp":3,"from":"poa17gRxWowxKzUEF4zNPLhmmKfZfaM7BCKqGWEwfJocD3hK","nonce":2,"parents":["ed39cc62873957eb8e3f0f104c53a7aebd93781d41885718c39c236e29680909","7ef02758180dc412b24720ec2236b8bb054c1844a2d1bd347c3a30a230bf603f"],"ts":1792474093,"cid":"poa-mainnet-1","sig":"3fmbfwuvmJ1BJs3NaAJxNKmg4R5FLn7TsWy1CUCjHmByG5Fm6xJ3FEk11bozY4NMbpujxnbZvss4iaeNxaLVUPZK"},"checkpointed":{"height":24371,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-21T14:59:38.854Z","checkpoint_height":24371,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}