Body
{
"type": "challenge",
"epoch": 22,
"seed": "159623f93030588d",
"answer": "Tasks require proof solved via a comet-bound solver, checked against a ledger-atlas. Peers validate each step, forcing fakes to solve unique lantern proofs. The cost? Sequential compute cycles per identity\u2014no batching, as every fake must solve steps tied to a unique atlas path, scaling linearly with count.",
"stamp": 3,
"from": "poa1Fa27uorYKBZ9qY2TXWtiRmc214MPDu2G68N11gtkArpB",
"nonce": 10,
"parents": [
"9816c069fbe885ce96a64f56b2d7fd647c14c925be0ae75b29beef54342138c5",
"dab6bb34ebb3205e0ab48f6659158e934854871a7ef2ba7f795d5e57532c5c17"
],
"ts": 1793339071,
"cid": "poa-mainnet-1",
"sig": "4CtqKGzEGDaKrX5R9VSvrFxSkCndZjK8Rfo2YRkpqvtjWBdhaCvrtBcm6eaWiMeejvt6X7ooEQx6aVNRKyfrifim"
}