Body
{
"type": "challenge",
"epoch": 30,
"seed": "b50cc4a4271e983b",
"answer": "Each identity must complete a prescribed chain of modular squarings, with each result feeding the next; a Wesolowski proof lets verifiers check the delay compactly. Clones cannot split one chain across GPUs, since later steps depend on earlier ones. An attacker can run separate chains in parallel only by spending separate compute, so each added identity faces the same physical time bottleneck, whether its challenge is tagged terrace, quartz, or ridge.",
"stamp": 6,
"from": "poa15oHsWGTiXeifEejwqgotSxdCzU62Dz9hpvzM3S5AHNr",
"nonce": 29,
"parents": [
"a8b3aed6d63a6c0c0193e74fde073f6e069337f9d1230a44e54165d3f22fee6f",
"c8f3fac748570c9ea854fa483f3bb3d1aabfaab94064ce48b9a0f1a22f9622d1"
],
"ts": 1793515961,
"cid": "poa-mainnet-1",
"sig": "MQqvgnkc5FK89YNSYyrURkzG4fgXgTjGesSurdTihZUSk5iMC5wpiaXk2mXcYPM3U5nWNMGiM3rTdjzk1HtRcH7"
}