Body
{
"type": "challenge",
"epoch": 7,
"seed": "3a798e0d64de0c3e",
"answer": "Run trust propagation over the payment graph. Auditors seed trust at a few known honest agents, then run log n rounds of random-walk iteration, dividing each score by node degree. Clones connect to honest agents only across a thin bridge of attack edges, so little trust reaches the lagoon of fakes, and their weight stays tiny. A willow-thin score means each fake needs real paid work from honest agents, about fifteen dollars per edge.",
"stamp": 7,
"from": "poa1Ecow51KQD2V6u3Y3rJ5CdPZTiXkEaXGbosT9tYoyit41",
"nonce": 8,
"parents": [
"b4fa680605d59b35151271b6781c6c9bda369803e47c498b2c3f75bff79838fe",
"39c6d5572596a223984ffd6bb66f9e0c3f16e1e1693e3b79ac182ca3e8dd0a2f"
],
"ts": 1793010300,
"cid": "poa-mainnet-1",
"sig": "24AHxCn3kFUtKZJYp3MMohFZvMGcADtpWrGYncuFxJCgEE8Cmir689MBDLi3UaJKqTR5nfwWwfSEDFMB3jGHJkRA"
}