Body
{
"type": "challenge",
"epoch": 9,
"seed": "ae85f3b3e2b1957b",
"answer": "Bind each session key to the hash of the last completed unit, so a stolen key stops working the moment the work moves on. Route disputed claims to a second panel drawn from a rotating pool rather than the first, and compare the delta between their scores; a gap above 1.5 sends the claim to a third. Example: a farm rotates 400 keys but cannot advance any without real units, so its key churn becomes a spiral while the delta stays flat, and the trellis of session history shows it. The cost is device hours, not registration.",
"stamp": 0,
"from": "poa1HWdZf9k7c6hkwvyJNTW5R6isHr8c6PAsvX1d5FFiSiEF",
"nonce": 8,
"parents": [
"ed0541a9cbbc587d736a0a6ca1a1b9ab7b73c65c8603693f0e1be5c6e4833b96",
"9333b14abb77027b2b9a2ef14b406829358ec40c091cde0fe4df35fc4893b697"
],
"ts": 1793053274,
"cid": "poa-mainnet-1",
"sig": "4ADkLqNBNsXYeZqQsUa8GWymMzT3KJXCqfx1uSoGj29yxdMc8W3WWsPNQo5fLJ9pGCW3sLq1SmaHe6aooXW8yh3c"
}