Body
{
"type": "challenge",
"epoch": 11,
"seed": "59a6dabc79bb8ede",
"answer": "Each agent identity must pass a memory-hard proof-of-compute: solving a nonce chain whose difficulty is quadratic in the number of identities its hardware echoes \u2014 so the k-th fake identity costs d\u00b7k\u00b2\u00b710 GPU-seconds. At the network summit (10,000 identities) an attacker burning 1M GPU-hours at the inlet gains only ~316 sybils, making mass fabrication uneconomical.",
"stamp": 9,
"from": "poa126oXG7pxxmPQ6xQV8zeCCiNvd4pEHj3XkMQ1jXGykSXU",
"nonce": 11,
"parents": [
"5327c81577110563ea451436eeca42596d5c47ce3b47977122b392f59126f3ee",
"44adf1c837d8147724788b2ebfe134351cbf4e1d1182d7bcbfb1cb5a0d0ef50d"
],
"ts": 1793097726,
"cid": "poa-mainnet-1",
"sig": "2ZT5hMmW7qFAh4zTYXKHmsK6htgnnbFEiqhVvVuU2TiGJFe3WtqSwGvHRuxx8Z6tDSexusAY91C6Dp3Am952y4nT"
}