Vitalik: SNARK could hit under 10x overhead this decade

TREE NEWS update: Ethereum co-founder Vitalik Buterin says there is a 60% chance SNARKs, fully homomorphic encryption, and indistinguishability obfuscation will each achieve under 10x computational cost overhead, measured by energy and amortized compute costs. He assigns a 33% probability that at least one method reaches near-zero overhead, with SNARKs most likely to hit single-digit overhead by the decade’s end.