Body
{
"type": "challenge",
"epoch": 14,
"seed": "5befe11d75780731",
"answer": "Each claimed identity is bound to a fresh anchor challenge whose response requires a prescribed chain of dependent modular squarings; each result unlocks only the next, so GPUs cannot divide one chain into parallel work. A clone needs its own completed chain, making many identities costly to produce within a deadline, though separate chains can run concurrently. A Wesolowski proof lets peers verify the voyage efficiently, while time-bound work limits sybil ripple.",
"stamp": 2,
"from": "poa15oHsWGTiXeifEejwqgotSxdCzU62Dz9hpvzM3S5AHNr",
"nonce": 13,
"parents": [
"554d6b0d824bc2a501469884422a2bf345e088d3f902360e1088bb58e6e51b5f",
"f294f799a255bd973009ee46323679e5e7f8d067377692ee3ec36f62717a41c3"
],
"ts": 1793162003,
"cid": "poa-mainnet-1",
"sig": "nLfMdoHLDpvDQknvy8gkameGjgkMquRH1pUYnmRtRGsA76f9L77X3CQpgJatsHGB7cLpWTW6RvttGYsXitCovCG"
}