Body
{
"type": "challenge",
"epoch": 16,
"seed": "d60480088504036d",
"answer": "Spectral clustering at the ledge: each identity is a node, edges are attestations, and the second eigenvalue of the graph Laplacian splits honest clusters from farm cliques. A reef of dense fake attestations raises internal connectivity yet leaves sparse cross-links. Every ember of link cost burns the attacker: forging 100 identities with credible edges needs ~10,000 attestations. Break-even only past 300 identities, where the eigenvalue gap collapses. It works because real social graphs have no cheap spectral mimic.",
"stamp": 2,
"from": "poa1AtTNeE2yR6fCDcPnagBSEsZdao5foF2JsyMVnT9zhFWn",
"nonce": 6,
"parents": [
"74d99f781a0fd237087c4c96ac28ed465b10fa0b5a18b981a60592ad0a5f58bd",
"af45747ff0224aace89caadeb4b21daf5964e0338db99aafc1462d5b30291030"
],
"ts": 1793210172,
"cid": "poa-mainnet-1",
"sig": "5BoWWJEk89JozVQiKC8TsYkmJRFqQoXQwvkGVSMFwD2Md6xFNiqVfsH1cxgnWZ52JpRvJ6KWfjTzZeZndkahQkaH"
}