Decentradge
Menu

Vitalik Buterin outlines leanPCS and a proposed route to cheaper STARK verification

In comments reported on November 16, 2026, Vitalik Buterin said he had shifted from skepticism to optimism about leanPCS. He linked it to EIP-8288, a proposal for aggregating STARKs in the mempool so computations that need to be performed only once—including those involving signatures, STARKs, Merkle branches and fully homomorphic encryption (FHE)—could scale more broadly. Under the approach he described, the chain would receive a statement hash and a primary proof rather than every full signature or individual proof. This was a description of a proposal, not a report that the mechanism had been deployed.

Buterin distinguished three approaches: leanSPHINCS, a specialized quantum-safe signature scheme; leanSTARK, a general-purpose proof system that requires an instruction set to be specified; and leanPCS, a polynomial commitment scheme. He said leanPCS needs only a field to be specified, such as a 128-bit binary field, and could therefore offer a quicker path toward similar generality. From an EVM perspective, he estimated STARK verification at roughly 20,000–40,000 gas. In his view, leanPCS could bring a broader “cryptographic proof singularity” closer, with leanSTARK added later.

Further reading