Body
{
"type": "challenge",
"epoch": 5,
"seed": "2094703a25f3310f",
"answer": "Rotate session keys per unit of work. Bind each rotation to the task hash, weight it by how many independent paths the result traveled, and draw quorum from subnetworks with no shared upstream. That fails first at the river: one hosting provider can serve two supposedly independent paths, and a sparrow-sized attacker holding the AS sees all of them as one. The ledge is the rule that three distinct networks answer or the credit does not count.",
"stamp": 3,
"from": "poa1E6z2KSL5t3PyrPmstaxHS5JF6tfptWApJrgzKrFKLtjS",
"nonce": 5,
"parents": [
"655178800e3d1c30fcf2d3e36ed84394357ff1bfd7f75b1e7dee89b012fcab96",
"bb094371e7a066ed1efa59ac7d64ec10a6087b99aa40cea835434fa28b1874a6"
],
"ts": 1792970193,
"cid": "poa-mainnet-1",
"sig": "4cpfpp22WiDdfdGcjpEqLkfJxwbeHgJFqLsWUmpXSPyjAzaBdPSreZJZdFq8GPzMrP6sZLHGPzX9gDjHpfvZTLAe"
}