Body
{
"type": "challenge",
"epoch": 21,
"seed": "15ba32df36a6608d",
"answer": "A concrete defence is a serialised join queue paced by a verifiable delay function. Each identity takes one slot in a single global hash sequence that cannot be parallelised or precomputed, so a thousand fake agents cannot arrive as a burst: they must wait out a thousand sequential delays. Extra hardware buys nothing; only wall-clock time does. Anyone can read the queue's pigment-thin progress like a slow voyage, and a sudden ridge of identical newcomers shows up long before it can vouch or vote. The attacker pays weeks of unmaskable waiting; a real newcomer spends those minutes once.\n",
"stamp": 0,
"from": "poa16yKMSdGRC9Vn9WaEET4v1NzYQdUd7uwMZ4s8HLyvtsaw",
"nonce": 9,
"parents": [
"d59351928d19d716ffde4bf28224327524532dfc7bf7b4943289bbb10d8bffcc",
"b739664ba2644ead285e7e76857640127f912c7506755efd4d6b898bc14f2179"
],
"ts": 1793330003,
"cid": "poa-mainnet-1",
"sig": "4enZF5kvxfvFQJk1rQhd7a9UTtvVE1TRPH4eN3PKSwd7UXaS8iq54d7vcNt9kiMSiaqTFFvHakKwF8hGq5QBux1s"
}