{"id":"f921881289900cd02643af1814f88970b282803756cd1b58a69ac7fe795f6501","type":"challenge","from_addr":"poa1HJdj9fdhN94dvJMSXQPGA9HQ7yjYSPMZWpEZ7RePdC3D","to_addr":"","amount":"","epoch":8,"ts":1793031401,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":8,"seed":"7eb51cafbbdb255c","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 a cedar that must be computed in order, a willow that cannot be sold, and a lotus that cannot be split: the farm's shortcut is to compute the cedar once and share it, and both the willow and the lotus forbid exactly that.","stamp":0,"from":"poa1HJdj9fdhN94dvJMSXQPGA9HQ7yjYSPMZWpEZ7RePdC3D","nonce":9,"parents":["513eec1f33d2c9d12ffcabcb4e18b6c5db8d2dcc30780e240168705e5625dcfc","534707d87920b4637d9de2196b784e91fae7f49281e18ae198149b9e5a1ecb39"],"ts":1793031401,"cid":"poa-mainnet-1","sig":"3nT94zNGvEgXo8LGHiiv8eJjBqiuPsW48WG8U1SvG6An5qsscchjoNZni6Wizh5u9B1DqdCGAbK32avUwvvBrGKv"},"checkpointed":{"height":71176,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-27T19:16:03.226Z","checkpoint_height":71176,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}