Vitalik Buterin Endorses LeanPCS as a Faster Path to Ethereum's Proof Aggregation
Key Takeaways
- •Vitalik Buterin publicly reversed his stance on leanPCS on November 16, 2026, shifting from skepticism to strong support within a few weeks.
- •LeanPCS is one of three variants within the 8288 framework, which aggregates signatures and STARKs into compact proofs in the mempool to reduce on-chain data burden.
- •The proposal targets quantum-safe accounts, as quantum-safe signatures expand from ECDSA's 65-byte baseline to between 1 kB and 6 kB.
- •LeanPCS demands fewer protocol decisions than leanSTARK because a polynomial commitment scheme requires only a specified field, though it is less efficient onchain and may be more efficient offchain.
- •With the magic PCS oracle provided by 8288, a STARK verifies for roughly 20,000 to 40,000 gas, and leanPCS could be implemented quickly while leanSTARK awaits agreement on the ISA.

Ethereum co-founder Vitalik Buterin has come out in strong support of leanPCS, a proposal he doubted only weeks earlier, positioning it as a faster route toward general proof verification on the network. In a post on X shared on November 16, 2026, Buterin said his outlook changed over the past few weeks and argued the approach could deliver what he called the cryptographic proof singularity much faster than expected.
LeanPCS is one of three variants within the 8288 framework, a design aimed at scaling Ethereum's data and execution for computations that need to be verified only once. Under the proposal, aggregated proofs would replace bulky signatures and STARKs onchain, targeting quantum-safe accounts and heavier cryptographic workloads. Because every Ethereum transaction is authenticated by a signature, the framework touches one of the most common operations on the network.
Buterin outlined his reasoning in the X post, acknowledging the reversal directly:
"Over the past few weeks I've gone from thinking leanPCS is total bull to being a total bull. So let me explain some of these buzzwords in more detail. At the core, 8288 is about hyper-scaling data and execution for any computation that needs to get performed on a piece of data…"
— vitalik.eth (@VitalikButerin), November 16, 2026
How 8288 Aggregates Proofs
At its core, 8288 focuses on computations performed once on a piece of data. The chain learns the answer, and the data itself is never needed again. Buterin cited signatures, STARKs, Merkle branches, and FHE computation as examples, with signatures and STARKs ranking as the two most important cases.
The size of these objects is the central problem. Quantum-safe signatures grow from 65 bytes with ECDSA to between 1 kB and 6 kB. Zero-knowledge proofs expand as well, from 200 to 1,000 bytes with Groth16 or PLONK to roughly 128 kB with STARKs. Buterin described that scale as unsustainable for on-chain data. The comparison also frames the quantum angle: today's 65-byte ECDSA baseline is what these quantum-safe replacements would displace.
The proposed fix is aggregation in the mempool. Users begin by publishing a STARK, a SPHINCS signature, or a polynomial commitment opening. Each tick, nodes take the new objects and generate a STARK listing claims about them. Only hashes of inputs and outputs — roughly 64 to 96 bytes per claim — plus one proof per tick are rebroadcast. Those proofs merge until a single master proof reaches the block.
Three Variants Differ by Object Type
The three variants under 8288 differ in the object a user creates.
LeanSPHINCS relies on a purely hash-based signature. It would allow users to create quantum-safe accounts at a cost of about 4,096 gas per 64-byte signature, covering both regular accounts and multisigs. The limitation is scope: the scheme supports only that one signature type, and nothing else can run through it.
LeanSTARK is fully general. Users run any computation and publish a STARK of it. Buterin listed alternative signature schemes, including lattice-based constructions, as one use, alongside hidden multisig logic and privacy protocols. Private account abstraction would let a single key control several accounts without publicly linking them. He compared this level of freedom to the EVM.
That flexibility introduces a practical hurdle, however. The protocol must define the language for user programs, known as the ISA. Buterin framed it as the first big case of Ethereum moving beyond the EVM. Reaching agreement may take time, and the ISA would be difficult to upgrade once set — though extra time could also allow a better ISA design.
LeanPCS Offers a Faster Route
LeanPCS builds on a polynomial commitment scheme, or PCS, which proves that P(x) equals y. Buterin called PCSes the most important hard component of a STARK. With a "magic PCS oracle," which 8288 provides to the EVM, a STARK verifies for roughly 20,000 to 40,000 gas — a direct read on onchain cost, since gas is Ethereum's unit for metering computation.
Far fewer protocol decisions are needed under this approach. A PCS requires only a specified field, and the 128-bit binary field is the natural option, according to Buterin, who added that a more general 2^k-bit binary recursive tower field, reaching 256 bits, is also possible. LeanPCS therefore demands fewer protocol decisions than leanSTARK, and each avoided decision is one fewer point where ecosystem-wide agreement is required.
The trade-off lies in efficiency. LeanPCS is less efficient than leanSTARK onchain, since several claims are required to prove one thing. Offchain, it may prove more efficient, because proof systems can vary. Buterin said it offers the same generality as leanSTARK and could be implemented quickly, with leanSTARK able to follow once the ISA is settled.
The near-term markers to watch are the field specification for the PCS and, further out, the ISA agreement that would clear the way for leanSTARK. By Buterin's assessment, the route leads to the cryptographic proof singularity much faster than expected.
This article is based on reporting by Blockonomi.