Ethereum co-founder Vitalik Buterin has shifted his position and now strongly supports the LeanPCS approach, citing its potential for accelerating proof aggregation and quantum security in Ethereum. He had previously voiced skepticism about the proposal but now recognizes its value within the evolving 8288 scaling framework.
The 8288 framework and proof aggregation
Buterin described the LeanPCS design as a key option under the 8288 framework, which targets rapid scaling of both data and computation for Ethereum. The initiative is tailored for computations that only need to be verified once. In such cases, aggregated proofs would replace the need to store large amounts of signatures or STARK proofs directly on the blockchain.
Proof aggregation addresses issues arising from increasing cryptographic requirements, especially as quantum-safe signatures and zero-knowledge proofs continue to grow in size. Standard ECDSA signatures are 65 bytes, but quantum-safe alternatives such as SPHINCS can reach between 1 kilobyte and 6 kilobytes. Likewise, the size of STARKs vastly exceeds earlier zero-knowledge protocols. According to Buterin’s analysis, this size difference would be unsustainable on-chain without aggregation.
Buterin emphasized that quantum-safe signatures expanding from 65 bytes to as much as 6 kilobytes, and STARKs reaching about 128 kilobytes, present challenges for blockchain scalability. Aggregating proofs in the mempool allows Ethereum to avoid burdening the chain with such volumes of data.
The aggregation method operates within the mempool—where users supply a STARK, quantum-safe signature, or polynomial commitment opening, and nodes periodically aggregate claims using a STARK proof. The network only rebroadcasts concise claim hashes and a single aggregated proof per round, greatly reducing data overhead.
Each aggregation cycle generates a “master” proof encompassing multiple claims until it is finalized in a block. This method is designed to enable faster, more efficient verification without overwhelming on-chain data storage.
Variants: LeanSPHINCS, LeanSTARK, and LeanPCS
Three technical variants are proposed to address different needs within the Ethereum ecosystem: LeanSPHINCS, LeanSTARK, and LeanPCS.
LeanSPHINCS utilizes a hash-based signature scheme, offering quantum resilience for simple accounts and multisig contracts at approximately 4,096 gas per 64-byte signature. However, this approach is limited to that specific signature type.
LeanSTARK is a more general solution, enabling users to run arbitrary computations and publish their STARKs. This supports a wide range of advanced cryptographic schemes and privacy protocols. Buterin noted that this approach requires choosing an “Instruction Set Architecture” (ISA), which is a novel step beyond the traditional Ethereum Virtual Machine (EVM). Adoption could take time, but it broadens functionality and offers room for future upgrades.
LeanPCS, which has recently gained Buterin’s support, is based on a polynomial commitment scheme. This allows the verification that a claimed value for a polynomial is correct. Under this model, the number of protocol decisions is minimized, requiring only the specification of a field—typically a 128-bit binary field. Buterin mentioned that a more general recursive field structure, up to 256 bits, is also possible.
While LeanPCS is less efficient for on-chain aggregation, as several claims may be needed to prove a single outcome, it may offer superior off-chain performance due to flexible proof systems. Buterin argued it can deliver the same levels of generality as LeanSTARK but be built much faster.
Mini dictionary: Polynomial commitment scheme (PCS) is a cryptographic method that allows one to prove the value of a polynomial at a certain point without revealing the entire polynomial. PCSes are an essential component for enabling efficient zero-knowledge proofs, such as STARKs, widely used in blockchain scalability solutions.
Buterin pointed out that using a PCS oracle within the 8288 framework lets EVM smart contracts validate STARKs within 20,000 to 40,000 gas, offering a practical route to faster proof verification in Ethereum.
The switch to LeanPCS indicates a strategic move toward establishing a cryptographic “proof singularity”—a future where all necessary security and verification can be efficiently handled on Ethereum, even in a post-quantum environment.
| Approach | Key Feature | Efficiency On-Chain | Implementation Speed |
|---|---|---|---|
| LeanSPHINCS | Hash-based, quantum-safe signatures | Specialized, only for signatures | Fast |
| LeanSTARK | Full custom computation with STARKs | General, but ISA choice needed | Slower, requires consensus on ISA |
| LeanPCS | Polynomial commitment proof aggregation | Less efficient on-chain, more off-chain | Fastest route to generality |






