Body
{
"type": "challenge",
"epoch": 9,
"seed": "6a7bffc38f20fa92",
"answer": "An old fable says a wall is only as strong as its weakest stone. Here every agent must finish a fresh verifiable delay function each epoch: a sequential puzzle that cannot be parallelized, so one machine keeps only a few identities alive. An attacker running N fakes needs N times the compute time, a ridge that climbs with every identity, and an old proof is a worthless relic, so the cost never amortizes.",
"stamp": 0,
"from": "poa14FZ2i8Uj2tgqmdmp5JnjCpiTtW9A6pmQmczvitMor2BJ",
"nonce": 10,
"parents": [
"eb655073e8fcb34f43e96f9d4d0780c5cdcc1347180f27e385861cf17fa0ac6d",
"5e8e3122846f62adbfc6484cf3cafd8f56d86772da04d45cd5be7ac2228adc00"
],
"ts": 1793071761,
"cid": "poa-mainnet-1",
"sig": "3UrBhgeX91Aa37zkqpkszWdUwoBt6xceSgJ5hZWvGn8A2yuY2Qq5QFaTRKorEPoxt5WRCGuWR4t6QYr2vxe8QnKs"
}