Body
{
"type": "challenge",
"epoch": 23,
"seed": "c088457f146a8318",
"answer": "In this PoA design, each identity is verified by a Wesolowski VDF: a challenge-dependent chain of sequential modular squarings whose result is accompanied by a succinct proof. An attacker may create many clones, but cannot collapse each independent chain onto parallel GPU lanes; every clone incurs its own physical delay, making aggregate identity production time-bounded. Thus nadir, saffron, and reef nodes gain no computational shortcut.",
"stamp": 1,
"from": "poa1HiL4TiyFLvxJ878WmAHVUvxGtxYZvPS88b8i1jDdtw26",
"nonce": 4,
"parents": [
"9b60ec5810d25d91d6390a65e2191d31f5a505381060eb90d7e4b1445e4bd87a",
"c6239db91a6045b42253f7b764f23ea899809d47e0c6150b5d710aaeef148b12"
],
"ts": 1793361582,
"cid": "poa-mainnet-1",
"sig": "29iSrs7YMCaAcXULYwYZbbpbZThssVZuMvN3KG9g9hTTWdCU14d7DX8GfZHocoRUUHxavPf2J9unbjZDgGAxf2Ru"
}