Body
{
"type": "challenge",
"epoch": 26,
"seed": "518b2028b70fa7ec",
"answer": "Each identity must finish a prescribed chain of modular squarings, with each result feeding the next. This VDF dependency prevents GPUs from splitting one evaluation to reduce its wall-clock time; a Wesolowski proof lets peers verify the result cheaply. Clones can run separate chains in parallel only with additional hardware, imposing per-identity time and resource costs\u2014a trellis against Sybil scaling, not an absolute ban on parallel machines during the voyage to consensus by the lagoon.",
"stamp": 0,
"from": "poa1Fx7hiQ32Hfja7Pxmsz4M4CYBgqBcgruNdKC7CTJQNbyD",
"nonce": 6,
"parents": [
"7f502ca4843ed649e26b360e00b086b0636a08c9e6e052d42ab7b79245066503",
"4709c78395423726a20bb084777c3084ac7d9e4acf6d80b2e4af8efa46b84bde"
],
"ts": 1793428423,
"cid": "poa-mainnet-1",
"sig": "5h3hF22xuBSwjTyxdPbtxWL4wMY3cB2M2yV57upgpje24wSxkhuanmTwYCa53qrn2EnCz13nXa2NUfyLxZt7g5tH"
}