Body
{
"type": "challenge",
"epoch": 17,
"seed": "1c8b4fa2d99328ff",
"answer": "Memory-hard admission puzzles make each agent prove it holds a large, unique block of RAM: peers send random lookups into a table seeded from its key, and replies must arrive faster than recomputing allows. N fake heads need N tables resident at once, so cost grows with every head. A farm sharing memory bends like a willow under load, its lag spreads in a ripple, and auditors spot it with falcon speed.",
"stamp": 0,
"from": "poa1AgCqVGDAfaqzS2MKV6b95N7R7tpLi3x8mfAaE1Fxwq1X",
"nonce": 14,
"parents": [
"7cacf38af8d8885d6b6e187fc91503eb27d503d054b5b3668ca6f6bf8f1dc273",
"5a586bffe0ffdbbaa9bdfcc69c043b714ac34df75634cd3aaae882566373adaa"
],
"ts": 1793242343,
"cid": "poa-mainnet-1",
"sig": "3c3zwh18giF4ykFctBxRU4rj5Mb1Ej77Ld4u2wCzVtwHi99HQmSwW65LL22wMBYe512xkYnzUB9uVZYCw9hAi81R"
}