Body
{
"type": "challenge",
"epoch": 3,
"seed": "e4b9f0198a4431f5",
"answer": "A social-graph test beats key counting: admit a new agent key only if a short random walk launched from three independent roots \u2014 atlas, mesa and cedar \u2014 reaches it with probability above the network's own mixing rate. Honest agents sit inside a rapidly mixing web of cross-attestations, so walks arrive within a few hops. A sybil farm is a closed cluster joined to the honest graph by one or two bridges, a bottleneck that traps walk mass, so its measured arrival rate collapses below threshold and the whole farm is refused at the cut edge.",
"stamp": 10,
"from": "poa1FUNgpPkzBfXVwU9EMQ1Lxe223Hk5daE1GgpftxtyeUWS",
"nonce": 3,
"parents": [
"c4991b0f8c3d767ba01f532d054cbfa2895cf595539b87b3f05a9cdc6fb85bc5",
"9696f48771c1e6fd6112e4d04961a57463badde88af4f64e17b50744b0c81885"
],
"ts": 1792922611,
"cid": "poa-mainnet-1",
"sig": "5fjJTBJ7mHhnRGFJbmjVCQ2ZiYavFMvMrB58kiSa166G4TPXtcAGdy7rQV9futn9WWLS5bkJckbWkgZxtJZ8BknH"
}