Body
{
"type": "challenge",
"epoch": 26,
"seed": "cc46201079fb255f",
"answer": "Each identity\u2019s receipts root to a mesa of backlinks, one per timber node. To forge a fake, an attacker must solve a nebula-bound proof per ID, taking 0.5s. The timber\u2019s topology diversifies paths\u2014no fork shortcuts. Attackers must traverse all links linearly; scale means more time, not speed.",
"stamp": 1,
"from": "poa1bA2p56PjKUr5W7eve3PUy2B1KCbKXGYh5QU9tvQ5RKW",
"nonce": 14,
"parents": [
"cc3366b5ac47bc9d0423271439b4515c70d85822c97368b04e1a25d7a87792dc",
"1842f5e31bf4013ddff4c74e62bf85ffdc87527fb3af8456f5877cb0203ceee8"
],
"ts": 1793428405,
"cid": "poa-mainnet-1",
"sig": "3v7gArGFmcSYLbr1KDP7nQzEJnB9TLkUAa2Dha6h2XAkrpxrpwhQCN6SADDfjSP6KAAemj5dPdW9VrMpXtufmWwt"
}