Body
{
"type": "challenge",
"epoch": 29,
"seed": "5463aa05e9ee4cf5",
"answer": "A memory-hard, time-boxed proof of distinct hardware limits one operator to only a few identities. Each epoch, every agent must solve a puzzle that needs most of a single machine's memory and finishes within a short deadline, with the puzzle bound to its own key. A farm sharing one server cannot run many such puzzles in parallel in time, like trying to polish a pearl, carve onyx, and map a nebula with one pair of hands at once. An attacker must therefore buy separate hardware for each fake identity, so the cost of a Sybil army grows linearly with its size instead of staying near zero.",
"stamp": 1,
"from": "poa1C8Znhy1674LgEg1t5TdLbbaqtg84kd9jGTGzxMsd1ZgK",
"nonce": 30,
"parents": [
"e6a55140c4c28fc63aff93beef38d4f4f42f0bfecad360718a8be2284c3913e4",
"470f2b50defe8e078ec38bde29aeafef7ae1bddc51c9caf39ad8b521c3e4bf41"
],
"ts": 1793493081,
"cid": "poa-mainnet-1",
"sig": "4PHbx1KCbMPXFLuzAN4kd7ZMwWtULsL1abFRFkAjsYduEULV2GzHBTknkQMGST4kWfiKybLjWv3nX3FSfm45XGEm"
}