Vitalik Backs LeanPCS for Faster Ethereum Quantum Defense
Ethereum co-founder Vitalik Buterin has backed leanPCS as a potentially faster approach to expanding Ethereum’s cryptographic capabilities, including support for quantum-resistant signatures and proof.
In a November 16 post on X, Buterin explained why his view of leanPCS changed after comparing three approaches to cryptographic verification: leanSPHINCS, leanSTARK, and leanPCS. “Over the past few weeks I’ve gone from thinking leanPCS is total bull to being a total bull,” he wrote.
EIP‑8288 proposes aggregating signatures and STARK proofs in the mempool, storing only a single recursive proof on‑chain.
LeanPCS could verify STARKs within the EVM for roughly 20‑40k gas, offering faster implementation than leanSTARK.
LeanPCS avoids committing to an ISA, allowing off‑chain proof system choices but may need multiple on‑chain claims per computation.
His comments focus on EIP-8288, a draft proposal co-authored with Thomas Coratger that aims to aggregate cryptographic signatures and STARK proofs before transactions are included in Ethereum blocks. Buterin now favors introducing leanPCS as a potentially quicker route to flexible proof verification, with leanSTARK remaining a possible later addition.
EIP-8288 Aims to Cut Ethereum’s Cryptographic Verification Costs
Ethereum’s current cryptographic systems face a potential scaling challenge as developers explore post-quantum alternatives.
Conventional ECDSA signatures occupy approximately 65 bytes, while hash-based quantum-resistant signatures, such as WOTS and SPHINCS, can require between 1 KB and 6 KB, depending on their parameters. STARK proofs can also exceed 128 KB, according to the EIP-8288 draft.
Putting every signature and proof directly on-chain could increase Ethereum’s data requirements and verification costs.
EIP-8288 proposes addressing this through in-mempool aggregation. Transactions would declare cryptographic dependencies, while mempool participants and block builders would combine the corresponding verification proofs into recursive STARKs.
Instead of requiring a block to carry every original signature and proof separately, the proposal would allow it to include an aggregated proof demonstrating that the declared dependencies are valid. The original cryptographic objects would not all need to be stored in the block.
The proposal is designed to support both post-quantum signatures and other applications that rely on cryptographic proofs, including privacy systems.
Three Approaches, Different Capabilities
Buterin’s comparison focuses on how Ethereum could verify signatures and more general computations while limiting the amount of data that needs to be processed on-chain.
- LeanSPHINCS: A hash-based signature approach intended to support quantum-resistant account authentication, including transactions and multisignature wallets. It focuses on a specific signature system rather than arbitrary computations.
- LeanSTARK: Allows users to prove that more general computations have been carried out correctly. This could support different signature systems and applications involving privacy or other cryptographic verification.
- LeanPCS: Uses polynomial commitment schemes to verify mathematical claims about committed polynomials. Buterin sees it as a way to provide broader cryptographic flexibility without requiring an immediate agreement on a new execution architecture.
The approaches serve different roles. LeanSPHINCS focuses on signatures, while leanSTARK and leanPCS concern broader proof-verification capabilities.
Why Buterin Now Favors LeanPCS
LeanSTARK offers flexibility, but adopting it would require Ethereum developers to agree on an instruction-set architecture (ISA). An ISA defines how computations are expressed for a verification system. Buterin considers that a significant protocol decision because developers would need to settle on a standard that could be difficult to change later.
LeanPCS could provide an alternative route by allowing developers to work with different proof systems without first finalizing that broader architecture.
A polynomial commitment scheme allows a prover to commit to a polynomial and later provide a proof about its value at a particular point, without requiring the verifier to examine the entire polynomial. This makes it useful as a building block for cryptographic proof systems.
Buterin estimated that dedicated PCS verification could allow STARKs to be checked through the Ethereum Virtual Machine (EVM) for approximately 20,000 to 40,000 gas. That figure is his technical estimate, not a finalized gas schedule or an established cost for every computation.
“LeanPCS gives you the same generality as leanSTARK, in a way that could potentially be implemented very quickly,” Buterin wrote.
The trade-off is that leanPCS could require multiple on-chain claims to verify a single computation, making it less efficient on-chain than leanSTARK. In return, it could give developers more freedom to select proof systems off-chain and avoid waiting for agreement on a complete ISA.
Buterin’s preferred sequence is to introduce leanPCS first and consider leanSTARK later, once developers have settled on the appropriate programming architecture.
Ethereum’s Broader Post-Quantum Push
The discussion comes as Ethereum developers face growing pressure to prepare the network for quantum computing. At Devcon 8 in Mumbai, Ethereum Foundation researcher Justin Drake outlined a December 2028 target for Ethereum’s post-quantum and post-AI transition. He also said developer coordination, rather than a lack of technical research, could be the main obstacle for moving faster.
The Crypto Times previously reported on Drake’s quantum-security timeline and Ethlab’s proposal to make Ethereum post-quantum and post-AI ready by 2027.
EI-8288 is one part of this wider effort. It builds on EIP-8141, or Frame Transactions, which introduces programmable transaction frames that can separate validation, payment and execution. Buterin has previously described EIP-8141 as a potential foundation for account abstraction and later proof-based transaction processing.
LeanPCS Is Not Yet Part of the EIP-8288 Specification
EIP-8288 was co-authored by Buterin and Thomas Coratger. The proposal is currently marked Draft under the Core Standards Track and extends EIP-8141 with a new frame mode for declaring cryptographic dependencies.
The published specification describes aggregation using leanSPHINCS signatures and leanSTARK proofs. It does not yet incorporate leanPCS as a specified verification route, despite Buterin’s latest preference for the approach. The document also lists its reference implementation as TBD, indicating that implementation work remains outstanding.
Buterin’s comments therefore signal support for a possible technical direction, not an approved network upgrade. Developers still need to assess the design, update the specification where necessary, and determine how the approach could be integrated into Ethereum’s protocol.
No mainnet activation date has been announced as of now for EIP-8288 or the leanPCS approach. Whether leanPCS is added to the formal proposal will be an important next step in determining how quickly Ethereum can adopt the verification model backed by Buterin.
Also Read: Vitalik Buterin Defends Ethereum EIP-8037 Amid Gas Repricing Concerns
Disclaimer: The information researched and reported by The Crypto Times is for informational purposes only and is not a substitute for professional financial advice. Investing in crypto assets involves significant risk due to market volatility. Always Do Your Own Research (DYOR) and consult with a qualified Financial Advisor before making any investment decisions.


