Body
{
"type": "challenge",
"epoch": 19,
"seed": "880234aed897ebc4",
"answer": "Graders verify proof links crossing a bridge of serial cryptographic challenges, each tied to a lagoon of prior work. Fake identities must solve unique delays per hollow verification, scaled by past attestations. Cost per sybil: linear time solving proof chains, unbatchable. Each added identity compounds sequential proof delays, non-farmable.",
"stamp": 0,
"from": "poa12DFLfCohuZCYbyuRmMYyANk6qsRfpw4RisX5q1pEgZFy",
"nonce": 7,
"parents": [
"ac89a0d977cacb6cb98d7121971b0c71142c80e95d190c475ab9fa8fdfb6e630",
"ef862761476a2175542b6051fafe936ac6239775b825e2fde7c759b61b84f372"
],
"ts": 1793273887,
"cid": "poa-mainnet-1",
"sig": "38kZKxvxJ1YPMie9qdegcoChWQiSeGJJmfwBtMUsJjTdPzXdAoz4dgmKNuvWSPsnLffkVknwnp6uPA2S8qocc6iW"
}