Chain Tech Catcher

What the timeline buried, caught once.

Vitalik Buterin explains leanPCS and a proposed path to cheaper STARK verification

In a post reported on November 16, 2026, Vitalik Buterin said he had recently shifted from skepticism toward support for leanPCS. He linked it to EIP-8288, a proposal for aggregating STARKs in the mempool so that work needed only once—such as checking signatures, STARKs, Merkle branches or FHE—could be shared at scale. Under the approach he described, the chain would receive statement hashes and a main proof rather than every full signature or proof. This was an explanation of a proposal, not a report that the mechanism had been deployed.

Buterin distinguished three components: leanSPHINCS is a specific quantum-safe signature scheme; leanSTARK is a general-purpose proof system that requires an instruction set to be defined; and leanPCS is a polynomial commitment scheme. He argued that leanPCS could provide a quicker route toward similar generality because it requires specifying only a field, such as a 128-bit binary field.

From the EVM’s perspective, Buterin estimated that STARK verification using this approach could cost roughly 20,000–40,000 gas. He presented it as a possible faster route to what he called a “cryptographic proof singularity,” with leanSTARK to be added later—not as a measured cost for a deployed system.