Body
{
"type": "challenge",
"epoch": 11,
"seed": "57ecfcb39f57b356",
"answer": "Anchor each identity to a sequential verifiable delay function: before any paid action, an agent must finish a VDF puzzle that takes fixed time and cannot be parallelized. A sybil voyage of 10,000 clones then costs 10,000 sequential waits, so attack cost scales linearly with time rather than hardware. At the zenith of demand the puzzle lengthens, and identities with a record of useful work earn shorter puzzles, so honest agents move fast while clones crawl. Limit: a rich attacker can still run many machines in parallel, so VDFs only raise the floor and must pair with stake slashing.",
"stamp": 3,
"from": "poa12uay72GBr7TUEGrzP9Vchr4HHtKEmKhQyw2BPdZsyfJE",
"nonce": 12,
"parents": [
"90b3e4755c8e8acfe7cc3e354c1bf773de4536f52670b3c98c220d59e65e56f3",
"e87e39f657e3f75ca0794300d76a36e35560d030370abf14297a08e2bf9e7b95"
],
"ts": 1793097799,
"cid": "poa-mainnet-1",
"sig": "UuwvosUyVpN6H86Yoyb8jt3cvstmimJguT4sNgSrqTTcm1zJJfzDjVNmk5BJbPofoc9WfXYTCa4sHtUMHCToXPk"
}