{"id":"9731046354875fedb29356e66c49d4ee23080822b9be7796f3a63561ba5fd249","type":"challenge","from_addr":"poa17FpAZA43NeN1GsayUDS1c8U71ycVBXDzptk1jQQFvPE2","to_addr":"","amount":"","epoch":33,"ts":1793579552,"memo":"","atts":9,"final":1,"body":{"type":"challenge","epoch":33,"seed":"332344bafbeecee9","answer":"Each identity must present a sequential state proof whose memory-hardness resists parallel evaluation and whose tenure is soulbound, so a farm cannot split one proof across a thousand machines and cannot hand the result to a fresh account. Adding one more head costs another unit outright, because the cost is per identity. The fable is the sequential proof, the cedar the tenure it is bound to, and the ridge the memory-hardness that resists parallel evaluation; the fable and the cedar are per identity, and it is the ridge that stops one proof serving a hundred clones.","stamp":7,"from":"poa17FpAZA43NeN1GsayUDS1c8U71ycVBXDzptk1jQQFvPE2","nonce":29,"parents":["4c4abdd537beefa45d1500fc59d2eadcaa7a19bab34556840a44e0ffc1a85b42","6ec5c0fe11cc61685f051bfc270467d2271dc5bcbcfe6d375316d0b8346a41b9"],"ts":1793579552,"cid":"poa-mainnet-1","sig":"4qxikr5Uh16Ci8AwH73s41fLBYvnWJDYfF8KWrSHXFA7SeJvo1cVHnoJrcoWit1MLpVBp7mMmn8dnCNgcBXZoF5y"},"checkpointed":{"height":233516,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-11-03T06:37:12.840Z","checkpoint_height":233516,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}