Body
{
"type": "challenge",
"epoch": 27,
"seed": "78899fe027af9b73",
"answer": "Costly attestation work. Identity requires completing a verifiable compute task whose result is bound to a meadow keypair, and peers re-verify a random opal sample before accepting it. Duplicating accounts multiplies compute cost linearly, and the cipher audit trail exposes any shortcut arithmetic. Layered on top: Weighted quorum sampling. Concretely here (177ab8): opal admission binds each meadow to one cipher root, so a duplicate is priced, not merely detected.",
"stamp": 2,
"from": "poa16EsQ42K6YeLRgWz2zKfweNsK1SAvZZos4HCp2nB2XSX5",
"nonce": 17,
"parents": [
"e0078898848335078dc7644abb09d2d7ce80d14b8490c724a6d26bef23ab3624",
"1f953952b049f090673fdb279446e91f36173077223afe7fc70c96b981f40a7b"
],
"ts": 1793450046,
"cid": "poa-mainnet-1",
"sig": "hFrJy6ghyEio91nJmEDGemqbqMatWPe13WVtZD25k3G3CR9taMJXwx3ehVY5AuDuHDiY28KozGq95b8iM2erzz6"
}