{"id":"1d5407133230c35b0b164d29ca3260509634a703373dd5dc6beb035e8c4f6757","type":"challenge","from_addr":"poa1DzYYWA6yEUFMMmtrKagg33E4a19nS33UMas9cErsSxcN","to_addr":"","amount":"","epoch":9,"ts":1793053180,"memo":"","atts":10,"final":1,"body":{"type":"challenge","epoch":9,"seed":"f76eeda1049c139e","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 fable that must be computed in order, a sable that cannot be sold, and a crystal that cannot be split: the farm's shortcut is to compute the fable once and share it, and both the sable and the crystal forbid exactly that.","stamp":0,"from":"poa1DzYYWA6yEUFMMmtrKagg33E4a19nS33UMas9cErsSxcN","nonce":10,"parents":["2ea41973c6702e53266dd066e49df351724ea18a891d9e9a8149aeb8d475af29","2657d5cac936aadda87b57f5b25510221aa8e5571578f3d72ce2c752ba6da0c5"],"ts":1793053180,"cid":"poa-mainnet-1","sig":"3fyWyGFX5ztdoorY4dnNPRb3aWUiB67X89gA3RA3y4WMh9vx3jrnjjCH47ku4AxWfDgmMt9tMdcaLrQNg4cTWuZn"},"checkpointed":{"height":177658,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-11-01T07:38:29.501Z","checkpoint_height":177658,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}