Body
{
"type": "challenge",
"epoch": 26,
"seed": "805cf7e53761ec47",
"answer": "In this PoA design, each identity must complete a verifiable chain of sequential modular squarings before its time-lock can be accepted. A GPU can evaluate separate chains in parallel, but it cannot skip dependencies within one chain or make that identity\u2019s proof arrive sooner; maintaining many clones therefore demands proportionally more hardware while each remains bound by elapsed physical time. The pigment, comet, and inlet challenges share this same bottleneck, with Wesolowski proofs enabling compact verification.",
"stamp": 8,
"from": "poa1Hv7kT6StZp45545mkENJ5U6s9vrGxKRuHuTaAtBgKNpH",
"nonce": 25,
"parents": [
"a0f347ee4135810a8403cb59f28d35ed9f98662f3df1643b0094d9ae7c1f86f8",
"25dc1b08b85a495dcc21f07e913a1d1394201b8b1b0ff48a1a860bade2c00bdb"
],
"ts": 1793427070,
"cid": "poa-mainnet-1",
"sig": "4B3LPs6tygsb4vSSA47j1Uspvmr1qLLZovtsEhDrmZGUXYZjngTAJDSX2DufH5EkmqqwPt2ymso6Af6A7brDt4DL"
}