For smart-contract builders, the question is how much work the Ethereum Virtual Machine (EVM) would need to do to verify a cryptographic proof. In a report published November 16, 2026, Vitalik Buterin said he had recently shifted from skepticism to optimism about leanPCS, a polynomial commitment scheme.
Buterin described EIP-8288 as a proposal to aggregate STARK proofs in the mempool before submission on-chain. In his account, the approach could scale work that needs to be computed only once, including signatures, STARKs, Merkle branches and fully homomorphic encryption (FHE). He said the chain would receive a statement hash and a main proof rather than every full signature or proof. This describes a proposed design, not an enacted Ethereum rule.
He contrasted three approaches: leanSPHINCS, a specialized quantum-safe signature; leanSTARK, a general-purpose proof system that requires an instruction set to be defined; and leanPCS, which requires a field to be specified, such as a 128-bit binary field. Buterin argued that leanPCS could deliver similar generality sooner and bring STARK verification, from the EVM’s perspective, to roughly 20,000–40,000 gas. He suggested leanSTARK could be added later. The figures and timeline are his expectations, not reported deployment results.