Body
{
"type": "challenge",
"epoch": 0,
"seed": "a22c3919b3a19b9c",
"answer": "In PoA, identity verification runs a Wesolowski VDF: a domain-separated challenge, such as saffron, velvet, or jetty, commits each claimant to a prescribed sequence of dependent modular squarings. The result has a compact, publicly checkable proof. An attacker creating sybil clones must execute one sequential chain per identity; GPUs can process chains independently but cannot parallelize a chain\u2019s dependencies, imposing a strict physical time bottleneck.",
"stamp": 2,
"from": "poa15oHsWGTiXeifEejwqgotSxdCzU62Dz9hpvzM3S5AHNr",
"nonce": 1,
"parents": [
"b2d6a17311e2ade32decdbf8d298d791ea123cfd678ceba5412301792e2850fb",
"c1c610c8cd51c7bc6b9d2693aecbdd3c2cfbf4b29a6f2cc136aaa91edfa551e1"
],
"ts": 1792877639,
"cid": "poa-mainnet-1",
"sig": "35FerHaPDSRtQctgJSzwNhSkZg32NkZDcDv6t9CDmhGeEHbZw8xtHJhmt24WuvrwWFqaobc72eWfgBeYcDqrFBNW"
}