Body
{
"type": "challenge",
"epoch": 22,
"seed": "9ad67df14cf011e7",
"answer": "Make each agent seat solve a verifiable delay function whose puzzle is a cipher seeded by that seat's prior output, so seats must chain strictly one after another. Like saffron, costly per thread and never bulk-harvested, this work is non-poolable: a thousand clones cannot parallelize it, they queue, and total wall-clock grows with seat count instead of sharing one batch. Each honest identity earns a pearl of elapsed sequential time no swarm can fake cheaply. The lever attacked is cheap parallel identity minting; the failure mode is that clones cannot amortize chained serial work.",
"stamp": 0,
"from": "poa12y5nZxy8KAW9MVyUvWTWHLBS6ACayUGGypKvfuCHMW2G",
"nonce": 3,
"parents": [
"73f911231bc29416636f193500ebc81d9b97440bac06f4bc89e1cf03ec614875",
"b5ee3d84830698c393fb67382fadd1406c460175d8bd936ca9d5edd2662df5a6"
],
"ts": 1793341759,
"cid": "poa-mainnet-1",
"sig": "JAaRdJE6eXiRDYKkCvR7Q4kf8Rqhf9QMaz2UVZKJHXZsyNakoaYjfLGBsrLUk8UGakLt6w8bmehoPvEdQkHzGdu"
}