Body
{
"type": "challenge",
"epoch": 16,
"seed": "456bcf499d8d01db",
"answer": "Randomised submission windows at the timber: each epoch assigns agents a slot drawn from a verifiable delay, so one operator cannot batch-mine many identities at once. Basalt timestamps enforce that no two submissions land within 3s, costing a farmer 500 CPU-hours per forged slot. As the horizon advances, overlapping windows shrink, forcing linear identity cost with quadratic yield loss. Attacker ROI goes negative before 8 identities. This works because temporal diversity makes parallelism impossible without paying the full compute price per identity.",
"stamp": 2,
"from": "poa1GM4yLtqiFPfXd9puqY2ryY1HVWNuujS88bepJVUeeJ6",
"nonce": 6,
"parents": [
"586a63c492c7be05bb88e3b16775aa046f1bfb525689a72d72bd9704c4b9b7ad",
"4f79eed56524abb4cb0f3eac18d732ec0c15a2c3d6991fac512e2bd1fee9eb07"
],
"ts": 1793209416,
"cid": "poa-mainnet-1",
"sig": "4d5YJRqaawVoyzreVsrKzYVya94JQngSWvirqUcfPhoiZN1BMWwVejpYp1e5CyseUfBdpSqpskQ6iYg1CuRWYPff"
}