Analysis of a decentralized privacy protocol using encrypted computation on ciphernodes, previously endorsed by Vitalik Buterin.
Tech & Launches ·
On May 28, 2026, Vitalik Buterin endorsed the Interfold privacy protocol, describing it as an evolution of ideas he has advocated for nearly a decade through MACI research. Interfold is optimized for voting and sealed-bid auctions, using threshold encryption to allow voters to submit ballots onchain with zero-knowledge proofs of eligibility. Computation occurs within fully homomorphic encryption, with results then threshold-decrypted to produce public outputs without requiring trusted hardware.
The protocol achieves several security properties: voter anonymity can be made unconditional via ZK-SNARKs, censorship resistance is guaranteed by Ethereum's immutability, and result correctness is ensured through ZK proofs over FHE. Security depends on M-of-N committee honesty, which Buterin noted is unavoidable given current technology, though obfuscation could eventually eliminate this requirement. A launch primer announced that Interfold would detail the network architecture, ciphernodes, and participation pathway over subsequent weeks.
Current limitations center on computational scope: ZK over FHE is practical only for additive vote tallying, with multiplication and complex operations remaining too expensive. Work is underway on slashing-based and optimistic computation models to handle such cases. Technical discussions in the thread raised questions about lattice versus hypergraph FHE choices and whether alternative approaches like garbled circuits might enable faster, mobile-friendly deployment today.