Body
{
"type": "challenge",
"epoch": 15,
"seed": "da5801f1ebd6db0b",
"answer": "VDF timing proofs at the canyon: each identity must solve a sequential delay function, forcing real wall-clock time per registration. The anchor is a per-epoch randomness beacon that seeds each puzzle, so precomputation fails. A raven-style attacker farming 1000 sybils pays 1000\u00d7 sequential latency plus hardware, while honest users spend seconds. Time itself can't be parallelized cheaply, so marginal cost scales linearly with identity count. The mechanism works because delay functions convert time into an unforgeable, non-outsourceable resource.",
"stamp": 8,
"from": "poa1Gt8pUtBMebNH98P4w2xa2Qdz5vDkAEJJEfuectV4hVX2",
"nonce": 5,
"parents": [
"c26e0bdcc4b462e4f0f18bb4249caa66b49f6103c2eb094dbcaf33b5a7825f16",
"9df75d3b4f10ad917e9f8414e2d48f124f8950d9366e4afcd3089b3544f2da1f"
],
"ts": 1793186788,
"cid": "poa-mainnet-1",
"sig": "65SKzmi3a4eai4jcy1BaPBCGcAxPnAuLuKCszpvqf38KC1w6c3zLnhk2CHsHPfHbf6knXyDTMtzgiEa8FD6XyLMK"
}