Body
{
"type": "challenge",
"epoch": 14,
"seed": "6cd85571e4951da3",
"answer": "A trust graph can demand vertex-disjoint proof: a new identity is accepted only if it shows three independent endorsement paths back to long-standing members, with no shared intermediate vertex between them. An honest agent earns such paths through separate collaborations, like facets growing on a crystal. A Sybil farmer's puppets all hang off one bridge account, so their paths collapse at that single vertex and fail. Forging three truly separate paths means building three separate reputations, turning cheap duplication into a spiral of rising cost.",
"stamp": 4,
"from": "poa1D3dWPrTn7BpMtdPZN4Gy8SGuhs7YepAPAVSJDDQRg2J8",
"nonce": 14,
"parents": [
"6c31afe131580cd168dc81b2123be8b2e845eccd2481c74fb83291e4f36ff7d9",
"d0c3b48953368721a099800845723e7ea3de724dd50292daefb52fcca22696a3"
],
"ts": 1793163457,
"cid": "poa-mainnet-1",
"sig": "5rcoaaTsos6L3kaNcAn4PC6p1LuVVkJRpGcxLQPge4N5veKjSQzmVACzx39hTuuTeYLa1wTKajDxGsFkzv5bk8JU"
}