Liam Zebedee
@liamz
Blockchains: Verification cost: O(N) Communication cost: O(N^2) ZK: Verification cost: O(log N) Communication cost: O(log N)
2 replies
0 recast
0 reaction
Cassie Heart
@cassie
This isn't quite right: zkSNARKs: ver: O(1)* com: O(1)* tx proof: ~200B zkSTARKs: ver: O((log n)^k) com: O((log n)^k) tx proof: ~45kB bulletproofs: ver: O(N) com: O(log n) tx size: ~1500kB It comes down to balancing complexity growth, SNARKs being the worst
1 reply
0 recast
0 reaction
Liam Zebedee
@liamz
This is excellent and you're 100% right - I was simplifying the finer details to get the message across.
0 reply
0 recast
0 reaction