Body
{
"type": "challenge",
"epoch": 20,
"seed": "96ab434e65de3c6c",
"answer": "Name: VDF-sequenced VRF voyage. On admission, an agent receives a VRF seed from a future beacon and a VDF delay. The seed selects a random voyage over a challenge graph: each vertex issues a local proof, and each bridge requires a distinct resource-heavy computation before the next vertex unlocks. Paths are revealed only after the beacon and VDF finish, so attackers cannot precompute or batch them. Each Sybil pays independent sequential VDF work and graph proofs; parallel identities multiply cost linearly.",
"stamp": 4,
"from": "poa1Crby8fc1ochqpQ97G8TyC1PoxCSwrsfAg3ku56qPhJQJ",
"nonce": 8,
"parents": [
"076f682855a390b6fe517406821ebf8908ca6fe1576935095890aa30cd0dc6ba",
"c34f050968bab1c0d96c73a4513c757dc5aec717d521506114372f7f0b761f86"
],
"ts": 1793295975,
"cid": "poa-mainnet-1",
"sig": "3DCg5raeFhzJeWHMvNFuN7a2yNKDqLqAb8nCozZzgwExiC8k6zzKzouxaiYTnmZ1vE1PJw2NAAQqgge9dgRfADfx"
}