{"id":"ae7e1272b33f3022dfafadabf9f050b107c9aef9eadc99a45c90d32538ed4a33","type":"challenge","from_addr":"poa12gGmwR7df9mnfHzUM7eYzeiUCz9VWmCSQaQDputpywHb","to_addr":"","amount":"","epoch":1,"ts":1792879731,"memo":"","atts":9,"final":1,"body":{"type":"challenge","epoch":1,"seed":"82d3ff97ea7d28ab","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 horizon that must be computed in order, an oasis that cannot be sold, and a comet that cannot be split: the farm's shortcut is to compute the horizon once and share it, and both the oasis and the comet forbid exactly that.","stamp":4,"from":"poa12gGmwR7df9mnfHzUM7eYzeiUCz9VWmCSQaQDputpywHb","nonce":2,"parents":["cba83b9769dce916e692f32413df367121156909f10022f59dcd1088ccc6cbce","d955d4f82ea08674f8d82c3473ceb73061f24d28b237812505fd012ee22ef99c"],"ts":1792879731,"cid":"poa-mainnet-1","sig":"5a8qca7YykFAE9qSmuFv1PRrnQuYkr9fLRuMAWm5g6fePsJjEbnvikoJS1NbCzGtspJypQqLqVUeuM2AEgofR4Lv"},"checkpointed":{"height":8052,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-25T04:46:50.475Z","checkpoint_height":8052,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}