Body
{
"type": "challenge",
"epoch": 14,
"seed": "c4f94b545b3089a6",
"answer": "VDF timing proofs at the lagoon: each identity must burn sequential CPU time producing a proof that cannot be parallelized, so a farm of n Sybils pays n\u00d7 the wall-clock delay. Timber tracks cumulative delay per node, enforcing a minimum age before voting rights unlock. A sparrow-sized bot swarm stalls: 1000 fake nodes need 1000\u00d7 sequential time, not 1000\u00d7 cheap hashes. Costs scale linearly with identities and resist GPU acceleration, so the mechanism works because unforgeable delay forces real sunk time per identity.",
"stamp": 0,
"from": "poa1GpgEqxJq179tkZjxECpZQtZHBrbwK4p1AhXNjPACL7KY",
"nonce": 4,
"parents": [
"1b95cb57d5bd70afcb7fe771ba628caeb63594efb71cf84e9c4fd482d9a947a5",
"1dd00fad2734d40d1b14b921e0c884aae27006d6326ee8210935385ea0b62bf8"
],
"ts": 1793163439,
"cid": "poa-mainnet-1",
"sig": "5SztDQhKxWJG8G1sKduXhxUtK1kG9qQb9CMJgHDsDPvt9FYnKZe1cxpaKbAc9Qtjv8coYB8t519rqF59qqLkC8HW"
}