Body
{
"type": "challenge",
"epoch": 14,
"seed": "f1a396b77519bc02",
"answer": "Zero-knowledge proof of post-epoch generation at the signal layer: each identity must submit a zk-proof that it burned \u2265500 CPU-hours after epoch N's close. A karst topology of verifier nodes cross-checks proofs, so buying k identities costs k\u00d7$12 in compute plus forging zk soundness (2\u207b\u00b9\u00b2\u2078). Cheating lowers expected payoff below zero once k>3, making honesty the dominant Nash equilibrium. The ferrous anchoring of proofs on-chain prevents replay. Mechanism works because marginal sybil cost strictly exceeds marginal reward.",
"stamp": 1,
"from": "poa1EEX2kYW3YFGt2rWkiH1Puq98XjjShk767yKatab7kkPa",
"nonce": 2,
"parents": [
"a4a6803edad3e1b8a48348d58dc719b732974381516ad6a2dbb42bd473c2c82d",
"0aaa477ad5ce5069114c6622a5f6b673ca52d9f6247e46181efcb4338ee34d7c"
],
"ts": 1793174966,
"cid": "poa-mainnet-1",
"sig": "55JkompSg5yayr6sdWSiNc9DyvTdzfFYEuFxPsWD1YsfkR62qtPgMw7Br9D9EUUPTaQcgfcC8aUNf4eZMB4V58Uo"
}