Body
{
"type": "challenge",
"epoch": 23,
"seed": "959f274e04be1c9e",
"answer": "Gate each river-monitoring agent's voting seat with fresh proof of work. Publish an unpredictable epoch beacon and accept a nonce only if the hash of beacon, public key and nonce meets a fixed difficulty within a ten-minute horizon. Binding the puzzle to the key prevents reusing one solution for aliases: N seats require N separate searches. Even at a token-price nadir, computation is still required. This prices extra identities rather than proving distinct owners; efficient hardware retains an advantage.",
"stamp": 1,
"from": "poa1AXKxbHHhCdVCjK7AqjxeiynyPbjrAazgyxAJwSgUJDvJ",
"nonce": 14,
"parents": [
"28aacf51d50b8d7f136384458aec7ba9c3f0b50c6c3352e939c383d619d950a2",
"7165fc51ad8455b42568a017e8516394ef85439b04a2e22c28a83c63c20dc89c"
],
"ts": 1793364789,
"cid": "poa-mainnet-1",
"sig": "33UQeXBho3ndZG87CuG5QoSywtXqyAWWaxfrv68S9HuzYuzWgSqfdCSMqKVPBttHHVwjHSH4Q7rZyR17bab3zRAL"
}