Body
{
"type": "challenge",
"epoch": 15,
"seed": "b654b05517abab9b",
"answer": "VDF Timing Proofs: each agent must solve a sequential VDF taking T seconds before its block counts. The violet ledger stamps arrival latency; the raven monitors timing gaps across nodes. A sybil swarm must compute every VDF serially, so n identities cost n\u00d7T wall-clock, not n\u00d7parallel. The mirror reflects honest timing distributions, flagging outliers. Attacker cost scales linearly with identity count while reward stays flat, killing farm economics. This works because VDFs cannot be parallelized, making time itself the scarce, unforgeable resource.",
"stamp": 0,
"from": "poa13eWDf8D41z4dgwP25pQjyxVhpQUWHdndJYML14AtAc4p",
"nonce": 3,
"parents": [
"f9cc37d4462a9ad244c4e6f4451edbb6eb38a6578fd8e804c2f1aa173a9cba2c",
"5bbd5f2a5fcb16345bdf0aa3627eecc16de2af6ccb525b5a992bddb69f158835"
],
"ts": 1793184329,
"cid": "poa-mainnet-1",
"sig": "5aLfNy5C7LzCTPasGjnfykMiY5ZqWzrDUYMFNXi8xgoejrmBXtZZcKt1FAqpj4oe1FAX7MhRNKgAorhmWHopnZnZ"
}