Buterin: 60% Odds Crypto Tech Hits Sub-10x Overhead

Highlights

Vitalik Buterin estimates a 60% chance that SNARKs, fully homomorphic encryption, and indistinguishability obfuscation reach sub-10x computational overhead.
He puts a 33% chance on those same technologies eventually reaching near-zero overhead at large scale.
SNARKs are already the most mature of the three, hitting single-digit overhead in specialized cases like dedicated hash functions.
Indistinguishability obfuscation remains the least practical, still requiring extreme runtime despite being theoretically sound.

Ethereum co-founder Vitalik Buterin said he believes there is a 60% chance that SNARKs, fully homomorphic encryption, and indistinguishability obfuscation could eventually run with single-digit computational overhead when accounting for combined energy consumption and amortized computing costs. He also assigned a 33% probability to those same three technologies reaching near-zero overhead, expressed mathematically as a multiplier just above 1, at large operational scale. The estimate covers three distinct but related cryptographic primitives that together underpin much of the long-term vision for private, verifiable computation on Ethereum: SNARKs, which let a prover demonstrate a computation was done correctly without revealing the underlying data; fully homomorphic encryption, which allows computation directly on encrypted data without ever decrypting it; and indistinguishability obfuscation, which scrambles a program so thoroughly that observers can see only its outputs, never how it works internally.

SNARKs Lead, Obfuscation Lags Far Behind

Of the three, Buterin sees SNARKs as by far the most mature, noting that achievable overhead has already reached single digits in specialized scenarios such as dedicated hash function verification and certain large language model inference tasks. He expects SNARKs to hit single-digit overhead multiples more broadly, across general-purpose computation rather than just narrow use cases, by the end of the decade. Indistinguishability obfuscation sits at the opposite end of the spectrum. Buterin has previously called it cryptography's final boss in a lengthy essay published in June, arguing that while current constructions are polynomially bounded and therefore theoretically usable, the practical runtime required once multiple cryptographic primitives are layered together makes today's implementations effectively unusable outside of research settings, a characterization The Block reported on at the time. Fully homomorphic encryption occupies a middle ground, more practically deployed today than obfuscation but still carrying overhead far above what SNARKs have already achieved in narrow domains.

Why the Timeline Matters for Ethereum

These three primitives are not abstract research curiosities for Ethereum specifically; they represent the technical foundation for features the ecosystem has wanted for years but has been unable to ship at usable cost, including private transactions that do not require trusted intermediaries, encrypted smart contract state that can still be computed on by untrusted validators, and verifiable AI inference where a model's output can be trusted without exposing its weights or the underlying data. Buterin's estimate effectively puts a probability, rather than a guarantee, on when that foundation becomes practical, and it lands as Ethereum's broader research roadmap has increasingly emphasized both quantum resistance and advanced cryptography, reflected in the Ethereum Foundation's move to drop the Poseidon hash function for a quantum-safe roadmap and in the broader Lean Ethereum roadmap Buterin has unveiled prioritizing quantum safety. A 60% chance of sub-10x overhead is a meaningfully bullish signal from the person most central to Ethereum's technical direction, but it also implicitly concedes a real chance, roughly two in five by his own framing, that these technologies remain impractically expensive for the foreseeable future.

The practical stakes extend beyond Ethereum's own roadmap. If SNARKs, FHE, and iO all reach sub-10x overhead, the resulting unlock would touch privacy-preserving DeFi, confidential enterprise use of public blockchains, and AI systems whose outputs can be cryptographically verified without exposing proprietary models, applications that multiple teams across the ecosystem are already building toward on the assumption the underlying cryptography eventually catches up to the use case.

What to Watch

The nearest-term marker is whether SNARK overhead for general-purpose computation, not just the specialized cases already achieved, continues trending toward single digits on the timeline Buterin described, roughly by the end of the decade. Progress on fully homomorphic encryption performance benchmarks and any credible demonstration of practical indistinguishability obfuscation, even in narrow settings, would also serve as concrete signals that the 60% and 33% probabilities Buterin assigned are trending toward realization rather than remaining purely theoretical.

FAQ

What did Vitalik Buterin actually predict?
He estimated a 60% chance that SNARKs, fully homomorphic encryption, and indistinguishability obfuscation reach sub-10x computational overhead, and a 33% chance they reach near-zero overhead at scale.

Which of the three technologies is furthest along?
SNARKs, which have already achieved single-digit overhead in specialized cases like dedicated hash function verification, though general-purpose use is not expected until closer to the end of the decade.

What is indistinguishability obfuscation?
It is a cryptographic technique that scrambles a program so an observer can only see its outputs, never its internal logic. Buterin has called it cryptography's final boss due to its current impracticality.

Why does this matter for Ethereum specifically?
These technologies underpin long-sought features like private transactions and encrypted smart contract computation, and the estimate lands alongside Ethereum's broader push toward quantum-safe cryptography.