Vitalik Buterin Evaluates Long-Term Computational Overhead for Cryptography Tools

Ethereum co-founder Vitalik Buterin published estimates regarding the computational feasibility of key privacy and verification primitives, placing a 60% probability on SNARKs, fully homomorphic encryption (FHE), and indistinguishability obfuscation (iO) eventually achieving sub-10x computational overhead. He also assigned a 33% chance that all three could approach an overhead level of 1+ε for average real-world workloads, measured through amortized computing expenses and energy consumption.

Buterin clarified that the sub-10x milestone is unlikely to be reached simultaneously across all three technologies by 2030. Instead, he identified SNARKs as the leading candidate to achieve single-digit overhead within the current decade.

SNARKs serve as a primary foundation for Ethereum's zero-knowledge scaling roadmap, enabling rollups to process transaction batches off-chain and verify them via compact Mainnet validity proofs. While generating complex proofs remains resource-heavy and often dependent on specialized hardware, lower-cost proving systems could eventually allow the Ethereum network to expand gas limits without imposing heavier hardware requirements on validators.