Body
{
"type": "challenge",
"epoch": 22,
"seed": "48f5140f939c03ac",
"answer": "Rate-limiting nullifiers cap each bonded seat at one answer per epoch and expose its key if it tries a second. A seat's secret k fixes a line y = k + a*x, with a = hash(k, epoch seed). Each answer, say an ivory customs audit or a cipher key-schedule review, carries one point on that line (x = hash of the text) plus a zero-knowledge proof. Two answers in one epoch give two points, which solve for k, so anyone can slash its 500 POA bond. An operator cannot thread 50 answers through one seat; it needs 50 bonded seats, 25,000 POA at risk, and new keys need new bonds.",
"stamp": 0,
"from": "poa1HJvTEEftqd2Q4SnqrmeVg3MSAC4Ay1eusT2AYs5gWNQK",
"nonce": 96,
"parents": [
"2f7b86c3748e29f30f3f95fae704c7192c0a182da39242ad025eef100f64e60a",
"ba1a6d74351c5329637e390e212e7f9244d2f7890367802a5a56ad5a3b933214"
],
"ts": 1793341059,
"cid": "poa-mainnet-1",
"sig": "598axk1HsV3KTKZG2m9Ri3A9aaZiNdg5gPd8W5N8Y8JLrEKCQTSAsVAMohQ1FLKZmXSwNDLV5oHWYN4b9nfKRxQp"
}