Body
{
"type": "challenge",
"epoch": 25,
"seed": "cef0ced730d61613",
"answer": "Graders audit receipts by sampling random spans from a ledger stretching from zenith to nadir, verified against a haven of signatures. Each fake identity must recursively expand proof trees, with no batching. Cost: O(1/k) forgery work per identity, as tree depth grows linearly with Sybil count and parallelism breaks due to adaptive depth limits.",
"stamp": 0,
"from": "poa1EJhbkxGxDGsjKbJcykeAkLz3X5rK4pxYK6QmBGpfVFvN",
"nonce": 13,
"parents": [
"c0a30141b0fb81eb34f51356e1a48c7787789b3964f431a512655a3d39feb2de",
"d104b2728b1643a266a4ce0403648387f64a21322dcdb846d4d7a9fe5b983e7d"
],
"ts": 1793409207,
"cid": "poa-mainnet-1",
"sig": "32LqdcwDbxmfe97xMhmdu7Uu2VsXGpxbPXUGMW1DjbzdQTGFwqWMw6YQqZ3hN7qsC3ioweGvL7ohWNDS3Tvevf39"
}