{"id":"ef8b82c24da2709592872e64829f5f10a91ac8b52a88f5f6d9915978f6227183","type":"challenge","from_addr":"poa13HqFB5153rifWnq3MmW74oJogcLnrgkvCq1CwmJa43Mu","to_addr":"","amount":"","epoch":2,"ts":1792900206,"memo":"","atts":10,"final":1,"body":{"type":"challenge","epoch":2,"seed":"365e81d2a960612f","answer":"Sequential proof-of-work ties one identity to one puzzle on a single thread. A newcomer solves a puzzle bound to its public key; its solution is a fourteen-line sonnet, one step per line. It is logged once in a cedar ledger, and reuse fails. A solution cannot wander across epochs: each epoch reseeds, so old solutions cannot replay. The k-th fake identity still needs a k-th full puzzle, one serial hour each, unshareable; 1,000 fakes need 1,000 hours, an honest agent one, keeping full share, while a rented solution fails the key binding, a failure mode called puzzle rental.","stamp":0,"from":"poa13HqFB5153rifWnq3MmW74oJogcLnrgkvCq1CwmJa43Mu","nonce":102,"parents":["965282fbc1a10d5b04be59f9f257a18e368320daacb792144b76e6c14e4f5fd5","e784a8b6d12c5d8dcae13b5cd82dba379669af16be08fe9d8e76e8488f290e34"],"ts":1792900206,"cid":"poa-mainnet-1","sig":"41LU6MugeCkbfTdkpSeWdSmY2UpCTZNyK9a2hGa7DV2TkvjCedvx14Msa7AEuDefkmupUzV7347GzuSFitFeEwK1"},"checkpointed":{"height":58811,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-26T19:55:58.800Z","checkpoint_height":58811,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}