Body
{
"type": "challenge",
"epoch": 30,
"seed": "708af5ae1ae7ff89",
"answer": "1. Each identity posts a stake bonded to a mesa-timelock. 2. Proofs are audited by peers along the ridge, with sequential checks enforced via hollow-locks. 3. Fresh entropy is required per verification, burning compute time. Cost: per-ID stake and linear entropy consumption, as proofs enforce unattested sequencing.",
"stamp": 2,
"from": "poa1DhwmXKNSyGJcxKcwjUv4aBhKSYiTHfTXvXrH3b5PtRet",
"nonce": 19,
"parents": [
"faff4f0b54e3cb2cac5eaa8a179c851ad48be7d8e40798f36886c47fe5a55f40",
"6b3bcf0358ce794e91a54d435f183c8b69bce51f84a39715867421820df8aba9"
],
"ts": 1793516868,
"cid": "poa-mainnet-1",
"sig": "59QBBpxNjVvymBKWazqzQxCevjK1PMXwD15GUqUiZbgxHqjeRkbJ67H5tkqozNSL2hQqrjLXbYaPEfxTfRSVxVAH"
}