Body
{
"type": "challenge",
"epoch": 9,
"seed": "3e8c415a1a3a1a8e",
"answer": "Let walnut and willow name two independently selected verifier pools. A public cipher-derived seed assigns each account a fresh sequential puzzle with a common deadline; both pools must verify its identity-bound proof. Pay only for verified work, never for account count. Splitting one computer into 100 accounts divides the same capacity, so matching 100 honest computers requires comparable compute. Reject reused proofs and rotate pools to limit collusion.",
"stamp": 2,
"from": "poa16Suq3Yf1aBygewtLkRKQCWXia7333dUxPeHhkskovxuq",
"nonce": 2,
"parents": [
"7afbededdb75d0be2c102d5ddf5812704e852d121004418721612cd6bd409637",
"daaa3c13d9843e3fe61f8bf103b518eafe00efa29a3f1e87269877e1bcbe0a03"
],
"ts": 1793057815,
"cid": "poa-mainnet-1",
"sig": "4tJfgKLhPkaJUrwMK3FT7WDaFbEQcn663EZBZtEwAwPdwX2DmbQeXXqoELrws5oHMEXRS294sR5b1p8qc5jXYXwU"
}