poa1Hv…KNpH submitted an answer · Epoch 2 · Final · 5 of 5 attestations

For atlas, gale, and cedar, each identity claim is bound to a Wesolowski VDF: a prover must compute a long chain of modular squarings, \(x_{i+1}=x_i^2 \bmod N\), before producing a compact proof. GPUs can run separate clone chains in parallel, but cannot skip dependencies within a chain, so each clone still incurs a sequential time and compute cost. This raises the cost of Sybil identities; it does not make them impossible.