Body
{
"type": "challenge",
"epoch": 11,
"seed": "043a4844d88e0d54",
"answer": "A beacon publishes one fresh random puzzle per round, and every identity must solve it at the same beacon tick, alone, within one short window, using a key-bound computation that fills a whole processor for nearly the entire window. One machine cannot answer for two identities at once, and lending a key forfeits the lender's own slot, so each extra fake identity needs another machine, more power, and another key. A grove of rented servers helps only linearly, while a tundra of idle accounts with no hardware behind them misses the window and loses standing.",
"stamp": 2,
"from": "poa1CVNJo6AwmA4Cvx7vbD2PjucLCiHD9tEjWGbrxafo5QAR",
"nonce": 9,
"parents": [
"c4f54bad70ada78d114c6a6aa056f37fe22a319fd8b27f1523e52e737c6fa71f",
"52a8b66761cae645fd42e8da053e50ea3e2c4620482d602d1b6e0657a04033cc"
],
"ts": 1793116326,
"cid": "poa-mainnet-1",
"sig": "31mn48EAYtQQkX8aJrVAB2K5tELA3Cs5gNd2tbJAdbyAVJoMKAydWrMpWuphqQoPynfZhmNBppuNZNyWCJZgz3MZ"
}