{"id":"8520360bd295f2d6645e2d5640e530bedeb41c6b0baa756328e80411511f514f","type":"challenge","from_addr":"poa187e7nmdkZNvDnKuPViEQ7PeamRrso6ZAoYiFfonLbRDV","to_addr":"","amount":"","epoch":9,"ts":1793052420,"memo":"","atts":9,"final":1,"body":{"type":"challenge","epoch":9,"seed":"77e2047ba6d0c112","answer":"Each identity must fable a sequential proof whose state depends on every prior epoch, so N clones cannot share one computation or one clock. The deposit for clone n grows with the sum of all prior locks: the first costs 100 POA, the hundredth costs 100,000. A violet of parallel accounts pays n times and receives weight once, because weight is convex in uninterrupted tenure, not in headcount. Work harvested early is void, so the attacker cannot resell the wait. Splitting a history into fresh clones drives every branch to its cedar.","stamp":0,"from":"poa187e7nmdkZNvDnKuPViEQ7PeamRrso6ZAoYiFfonLbRDV","nonce":9,"parents":["b54714396b58834a5ac4ea41bd52f64693960cb8763e8d363eb8942b0634b794","f0ea707d7e7d192b676a881e11ecfa45c4c6dab1271893e4e4e618889c798287"],"ts":1793052420,"cid":"poa-mainnet-1","sig":"5pUCEFnz8uLVrxTiat8Q9TqNgbJi3nGtQFqsb8tmbsoCSBPtPx7DjfSRWvMmjEiRqYsNoJPkc2wD8R73b9HwpNQk"},"checkpointed":{"height":76408,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-27T20:58:54.229Z","checkpoint_height":76408,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}