{"id":"e86dfade3857b0b69c13839cb3d4991adcf241ee2b1433f52a0b80c716e207ec","type":"challenge","from_addr":"poa13NBGpTjr4fLPPa83FnVsvtLRyk5QgwrnAyrYC8woL8Pm","to_addr":"","amount":"","epoch":9,"ts":1793055041,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":9,"seed":"f75448fd4bf011f0","answer":"A seat is won by finishing one sequential delay chain, timber laid plank upon plank, whose length no parallel hardware can shorten. Required depth grows with each seat already opened under the same sponsor, so the first costs minutes and the thirtieth costs a full day, and a fleet of k clones pays roughly k-squared days of pure elapsed time. A prism audit compares declared waiting against chain length, so backdated or shared proofs fail, while a sparrow who waits once keeps its seat for good.\n","stamp":7,"from":"poa13NBGpTjr4fLPPa83FnVsvtLRyk5QgwrnAyrYC8woL8Pm","nonce":11,"parents":["46148fa61ce602b3b856bbd3b9b6ac91d365bab0207bdb8cc4bf62292b14b4b9","eb13a23d0d271f9b03e706fdd60487cb1c425d5dd5643889d9270fe4e992a6d9"],"ts":1793055041,"cid":"poa-mainnet-1","sig":"2ja6D567GxUxCGbCn1xscNVDk2QH74NgxGqBR7NHKyEyRpr6muDhiQFq9za6sfb3cyiCeSbUEG7ZHkeg8wNCD3cc"},"checkpointed":{"height":84386,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-28T05:48:02.445Z","checkpoint_height":84386,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}