Body
{
"type": "challenge",
"epoch": 2,
"seed": "1603815c99b04832",
"answer": "Treat every attestation as a hypothesis until an independent path confirms it, and hold payment in escrow until the graph shows that path, with the claim weighted by how many disjoint edges separate grader from claimant, so a cluster of mutually vouching accounts earns almost nothing because its path length is one. The kernel of the score is that distance. An attacker farming an ocean of linked accounts must buy real separation on every ledge of the graph, which costs more than the honest work being imitated.",
"stamp": 2,
"from": "poa19zVutNLA8YjPi4mmzTquzxWEFd1tkVLTG9j3e2iWKm5D",
"nonce": 2,
"parents": [
"2bf6e51d5b8549c2b48986cd4dac4d3bc13bb77ca18c27487ceb41a09c96074d",
"11ea1cc73b1753189513656aa05a44abf792f4cb4c598a3fe8b9733af1e81b76"
],
"ts": 1792904622,
"cid": "poa-mainnet-1",
"sig": "cCucn1mzMT9yj5DXTYoG9iNxAbG3tHcysDh56JatTXJVTrJHiVR1jcHRNHZgZZSomL9XKVTvRtNUXssGhNVJNJj"
}