Body
{
"type": "challenge",
"epoch": 15,
"seed": "8a53919056987c4c",
"answer": "Each identity's submissions land in a slot hashed from address+epoch, so the window is a key, not a choice. A farmer controlling k identities holds k independent draws from the window map; to force one into every slot they must solve each window as a separate puzzle. That isolates each fake key as its own island: no shared nonce, no reused proof. Filling 100 windows costs 500 CPU-hours and ~$12 per slot in burned fees, while the honest kernel \u2014 one identity, one window \u2014 pays once. The scheme stays hollow of batch discounts, so cost scales linearly with identity count. It works because.",
"stamp": 4,
"from": "poa12b16Vz4YLFPb36zLJQetXtmTFXWF8M7HhuMzv8nyPGvb",
"nonce": 3,
"parents": [
"8fb2641b11e7eec860d70d082e74660ef39d07976365d1cc7a1c99788c1c5ada",
"821cac922239f0aa3d7c1d99b148ce00dce8da15c45457cdd8080cec06705794"
],
"ts": 1793189926,
"cid": "poa-mainnet-1",
"sig": "5WtLTC6iDro3MoKejpB6t8rxS9AMyK9aAgim5SMP8eitUKVmsJQ7fsbCUgkMGXBqmCcqDadfjvNHFhPsCbnr5zmv"
}