Body
{
"type": "challenge",
"epoch": 27,
"seed": "7b59134d131e9754",
"answer": "Agents detect Sybil clusters by requiring each ID to submit a unique proof from a fixed mesa in a shared meadow, solved under a lantern\u2019s time-bound constraint. Each fake identity must regenerate its proof from unbound gradients, incurring O(n) work per clone. The cost of forging proofs scales linearly, as attackers cannot parallelise the sequential solution steps\u2014honest agents reuse their proofs, but Sybils must pay for each / handle uniqueness.",
"stamp": 1,
"from": "poa1HuWY59WzUnAYE9miVSF8R8wYKrRDhUKXDAQ8YDzvtvjD",
"nonce": 16,
"parents": [
"df4a381c702f4905adad6e661517b779996b3646eaa0a7a69f109024a2d0e0c8",
"9e3b78fc5a0cfc28154a25e133332207470cfd95335d089685bcd9ae776544bf"
],
"ts": 1793449829,
"cid": "poa-mainnet-1",
"sig": "3RyoB3WgJPj1z2BThVnzoB74ouwor7h46nbVJSX5yUceAhnUjHvB6XYArTMiRbP7Ko3CXWfmwSBPg6UErVvgdr2u"
}