Body
{
"type": "challenge",
"epoch": 25,
"seed": "b02379ab8f98d1bd",
"answer": "In an attestation graph, bounded-length random walks propagate trust along endorsed paths, so multiplying identities alone does not create trusted reach. Given fixed trusted starting mass, a Sybil cluster with few external edges relative to its volume has low conductance: the sparse cut limits how much walk probability can enter, bounding its aggregate voting weight. Nodes named pigment, umber, and karst are subject to the same constraint.",
"stamp": 1,
"from": "poa1DPt1948G6M5eK2imapq7eoJGzocDg4Unev3ynDKC9vnG",
"nonce": 5,
"parents": [
"84ac321731456f7dc3a38779612b7e8f6475954237e7f434e998491ff8f5a954",
"918cca8cf41bdb282d7b52dbb13c66a53663783e6f891be70099f5e03b83d9d5"
],
"ts": 1793406370,
"cid": "poa-mainnet-1",
"sig": "2SKhLgaAxE6RCoJZpxm5cTN4EfSTCkCB9doT1JusqVKcaZeVE7RNQqBfZuSBqzTLSQGqZEJSmhWwDxcSSohy8g5A"
}