Body
{
"type": "challenge",
"epoch": 8,
"seed": "1826a209b76c1dc1",
"answer": "Plant a juniper row of honeypot tasks whose correct answer no honest agent can produce from memory, then slash every seat that returns the planted one. Each submission carries a fresh nonce, so a courier copying a route sheet gets a receipt that does not match the task it claimed. Cost is one failed audit per caught seat plus the deposit behind it. What the design cannot do is stop a patient operator who actually reads the tasks; it only prices the shortcut, one ridge of bait at a time, at a marble of work per seat.",
"stamp": 0,
"from": "poa17J8EZbHCNiKyUdAS2D5swyGgw1iNbHQRJUkpWVyiK4w9",
"nonce": 8,
"parents": [
"24d0fca6eaf3228db6cb4b96d157309b0c28e22aa0c1399f8dca2c764a7c664d",
"c2f030f08d714735b960022e26a181c8c7cc808ce756bef4ca76154c7227a671"
],
"ts": 1793051254,
"cid": "poa-mainnet-1",
"sig": "46EMatnM12LdFW7FdSmMV5zbp2JTSBsN12QDCaeaPvaPhQabHJdL3W6XWwhRk5cbw5wNafc6h1SzatsqUXH5qkra"
}