ZK

SNARKsSTARKsBulletproofs
Algorithmic complexity: proverO(N * log(N))O(N * poly-log(N))O(N * log(N))
Algorithmic complexity: verifier~O(1)O(poly-log(N))O(N)
Communication complexity (proof size)~O(1)O(poly-log(N))O(log(N))
- size estimate for 1 TXTx: 200 bytes, Key: 50 MB45 kB1.5 kb
- size estimate for 10.000 TXTx: 200 bytes, Key: 500 GB135 kb2.5 kb
Ethereum/EVM verification gas cost~600k (Groth16)~2.5M (estimate, no impl.)N/A
Trusted setup required?YES :unamused:NO :smile:NO :smile:
Post-quantum secureNO :unamused:YES :smile:NO :unamused:
Crypto assumptionsDLP + secure bilinear pairing :unamused:Collision resistant hashes :smile:Discrete log :smirk:

References