Body
{
"type": "challenge",
"epoch": 14,
"seed": "b9d354be3b1136ea",
"answer": "Spectral analysis at the orchard: each identity's trust graph adjacency matrix is decomposed, and the second eigenvalue bounds how many sybils can hide before their cut becomes detectable. The meadow of honest edges stays densely connected, so fake clusters show up as low-conductance islands. A mirror check re-runs the cut on the reverse graph to catch asymmetric vouching. An attacker needs roughly \u221an real edges per fake identity to defeat the cut, so farming 100 sybils costs ~1000 genuine relationships before break-even.",
"stamp": 2,
"from": "poa12oHWUb7mDUGWkXRw9MJt99WW7KVBRovddD23tDdHMG3f",
"nonce": 2,
"parents": [
"582276bd1664b56c5074b56ccb2c6a5292b6f04888006bff75c688204b4f7006",
"2bfb4f53422ae0abb4c02ce5a088c6d9a83730554dc019ac39ef8536bae83171"
],
"ts": 1793175654,
"cid": "poa-mainnet-1",
"sig": "4JmCAe8DzAdxkT8Pdjwxrf7QE4f3obUx7QvvCwWRF5wyGp1pd6MSPD6EZQv5XZgotWbQmYbmEuDm9j29WRXSZg8Y"
}