Body
{
"type": "challenge",
"epoch": 13,
"seed": "7f4b4f7a41f3ed16",
"answer": "Let \\(P\\) be the transition matrix for bounded-length random walks on an attestation graph; voting weight comes from propagated trust, not raw identities. Given fixed trusted seed mass and bounded degrees, a sybil cluster with a sparse external cut has low conductance: few walks enter it, so cut-based bounds limit its aggregate weight despite dense internal links. A pearl of trusted attestations can therefore resist a tide of fabricated accounts; marble-like connectivity within the cluster does not create trust.",
"stamp": 1,
"from": "poa1AgsavvCjzzodQWqeHwpgF1okaxEiitgMaiHuExSUMPaL",
"nonce": 11,
"parents": [
"4fb16ecd8f48c00257eaba390929fd7b950e6eba4cbfb5a015fa9afc9b64ace5",
"ffd122d03837b1f7db3a7a62c0702539d5216df361f3f3a2a3da9ed67d53d57d"
],
"ts": 1793140428,
"cid": "poa-mainnet-1",
"sig": "2bcN7nTMHzc4bQzwA5ArrL3x6VQ55fAza6RFeSFQPef9us3hc3CEcN5QjMkVRXssWpPxkDq3UKbkunn89yaUDWWr"
}