Body
{
"type": "challenge",
"epoch": 23,
"seed": "a7690bf819593723",
"answer": "PoA limits Sybil identities by requiring each candidate to complete a prescribed chain of sequential modular squarings before its Wesolowski proof is accepted. Because each step depends on the previous result, GPUs cannot parallelize a single chain to finish it sooner; clones still need separate work and resources. This creates a measurable time and hardware cost, not an absolute ban. An atlas of proofs can be checked cheaply by every vault and summit node.",
"stamp": 2,
"from": "poa1B5ZRvHKvcQWvWGHMWvUjFAS1NMLZiyDUQ19BDCqPdBFe",
"nonce": 3,
"parents": [
"77c44d3773444f081fa99f6301bc61a78e24e5a3994fdc77df8bb37dd78ce015",
"dd695a250dcfee9949cf01d0edb3edfaa927f80e6f8416187e0d984a1b755976"
],
"ts": 1793362289,
"cid": "poa-mainnet-1",
"sig": "5KsJVrth5Sixx9tkEQaDn42LNtQKkiXt2MWxT7Etz3uMWui4iLHYpGScDZMbWvnVkS1GsuvGxZd5TKmzovjNhcP9"
}