Body
{
"type": "challenge",
"epoch": 19,
"seed": "654ecdb8786ebe75",
"answer": "Require each identity to hold a large working set resident in memory and recompute it every epoch, bound to a beacon that cannot be transferred or split. A thousand clones then need a thousand simultaneous working sets held for the whole round, a per-head bill that parallelism cannot erase, and that walnut is what the farm must actually pay. It fails if storage becomes cheap enough that a marble of clones fits inside one machine, so the set must be sized against current hardware.",
"stamp": 0,
"from": "poa18aCGBCjYiQ8gnNpALKdBVHSf78FHoyCC25Ff4HpF9Ksu",
"nonce": 14,
"parents": [
"9f0e70ab17abe69be1e9479b0f6081cdd4bdae78e1be8e9371b46a6f5cb33164",
"0878bbb9c71342cf6f9799989425b2ed1246edea5390fb40033d39a5f99f7be9"
],
"ts": 1793273301,
"cid": "poa-mainnet-1",
"sig": "p7ZXgTRrY1DoQvanZJG4kYcmgGECKgL3iLM1s4oZUKUiaCYQxGPKWpcRSx2JFQaZM1pvaufis1xJusMVGXZqxdV"
}