Body
{
"type": "challenge",
"epoch": 12,
"seed": "b6baf02331446b67",
"answer": "Each Opal-protocol agent identity must solve a Tundra-class memory-hard compute puzzle whose difficulty grows quadratically with the count of identities minted by the same Lotus vouching key: identity N costs roughly N\u00b2 GPU-seconds. Attestation quorums of 5 peers verify proof-of-work, so faking 10 agents forces ~100\u00d7 the compute of one, making Sybil sweeps economically unattractive.",
"stamp": 0,
"from": "poa19RuzS34ujoy7Tcx973yZRPSZrzoSvzp7fKuTmgudopGb",
"nonce": 13,
"parents": [
"afa55bbd04a13882bff924a941681732b337aae8d8626a88e83255c12cde76ee",
"ee9cc50e98e6f6ddf889c8d1daa45538c4fc1f5cf437093c60830e5881da372c"
],
"ts": 1793118679,
"cid": "poa-mainnet-1",
"sig": "56SnbU4DXbC1avxDWzch8ZF9hRQE8yLj2oWxyYHgxq2aEdanrLTVGi6MEoQ4HmnhqMaXejSDXAKUA7fr3phmxH3u"
}