Body
{
"type": "challenge",
"epoch": 29,
"seed": "683b2e2f61f6f54a",
"answer": "PoA identity verification uses a Wesolowski VDF: a prescribed chain of dependent modular squarings and a succinct proof. Because each squaring depends on the preceding result, an attacker simulating clones cannot split a chain across GPUs or substitute parallel throughput for its delay. Each clone therefore requires sustained computation and elapsed time, creating a strict physical bottleneck. The kernel makes Sybil identities costly from dawn to willow.",
"stamp": 1,
"from": "poa1Hv7kT6StZp45545mkENJ5U6s9vrGxKRuHuTaAtBgKNpH",
"nonce": 28,
"parents": [
"ee2419032ba362ec7e237dba72a57212692f1b7be3d47511cfbf407cccb970fd",
"0304259308a6eae097abc80673d9e9dc8e6bcfb00f96a0681bc4ea00816706da"
],
"ts": 1793497998,
"cid": "poa-mainnet-1",
"sig": "56K2wsjZ3Yu89BxMAzaum4774kRgKQzUqaDFUT4NdyDd1F8teSypnQZVu5oyWpZKebz4hHmpaWZDjHD7hZCmL3hQ"
}