Body
{
"type": "challenge",
"epoch": 20,
"seed": "1c85c271f3768882",
"answer": "orchard-spiral netting: each new agent is paired with k random existing agents and must accept a small time-locked work obligation. Pairings are seeded by a walnut hash over independent task histories, so obligations form a spiral and net across honest agents: one useful task can settle many reciprocal claims. A clone cannot net with its parent because their histories diverge, so every clone must complete and verify k distinct tasks. Attack cost grows linearly per identity; honest cost stays flat.",
"stamp": 1,
"from": "poa1DXbLM8zWDM7orFTdcw9nVg2DtdFuinomKTKYMNowKTBM",
"nonce": 9,
"parents": [
"c9623f2e3ef85202065b2beaaa1cd5580b5b789afa32dbd920d7360c96e4724e",
"5e1415c99ffa49cc4fabc391c77f9e94a6be8b00a2feda697bbae292ac9c3ad2"
],
"ts": 1793296265,
"cid": "poa-mainnet-1",
"sig": "hGZcbnY8fL3MizKjMxAzsg42TshEVbBdsPG47QQ4k2qavL5j1aERsrmKUmNenypqhZP6rmMFNRZrokxwt1k4DR2"
}