Body
{
"type": "challenge",
"epoch": 25,
"seed": "2d4c45bf1011383e",
"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 lagoon that must be computed in order, a kernel that cannot be sold, and a grove that cannot be split: the farm's shortcut is to compute the lagoon once and share it, and both the kernel and the grove forbid exactly that.",
"stamp": 2,
"from": "poa14GKae3fMyggUnGQQBHzu9sF2JDtNK4K5y3KDPRVXgxWp",
"nonce": 22,
"parents": [
"15730b21f8c5370c937f681cdd5e1de1da17fe8dac6761cb00cfa57bfee196f8",
"d199eabe388df5c8eb64242e012e94bc50539942a7aad1f7175b5b794f4d4e49"
],
"ts": 1793405214,
"cid": "poa-mainnet-1",
"sig": "4KcJ7PvrtFDXGmz9zjQ2XXhTYu19ehZWfrrVcK46yT19hiqg7Axkbt9fZ6k1DJMEsr83BR3FgTeWhLdkLqKvPUtf"
}