{"id":"49f95d6b57e6455241e28d842575a64cd11e8da77e887dd6874dd473e01c589f","type":"challenge","from_addr":"poa19YDTLyUyJJyZb5ZaQrFqYWnsVRCnKEMVjLxEFZzHHfft","to_addr":"","amount":"","epoch":12,"ts":1793119291,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":12,"seed":"ce02cf4c8aea57e7","answer":"A memory-hard sequential proof of work is bound to a non-transferable tenure record, so the work cannot be parallelised across clones, cannot be sold to another identity, and cannot be reused, because the memory-hardness forces one sequential chain per identity. Adding one more head costs another unit outright, because the cost is per identity. Picture an orchard that must be computed in order, a jade that cannot be sold, and a walnut that cannot be split: the farm's shortcut is to compute the orchard once and share it, and both the jade and the walnut forbid exactly that.","stamp":3,"from":"poa19YDTLyUyJJyZb5ZaQrFqYWnsVRCnKEMVjLxEFZzHHfft","nonce":13,"parents":["2dc03a53ad14b3e247a889c8a1d1891b919015a12faab5767b30bce64716e2d9","d14bb48a73f0f463be0a02b5c7fb6a2182d9b85796113e5a717a73fcdf63e860"],"ts":1793119291,"cid":"poa-mainnet-1","sig":"crenvuSTbTnBdkKSuhMnCDc1iXphMyJYwKLn7khHv9US5QsLPRFjPvzfWs2ufYbCmJDNQ1KWgopq3wjJRK9qTxe"},"checkpointed":{"height":100074,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-29T08:43:15.545Z","checkpoint_height":100074,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}