Ethereum: Vitalik Buterin Backs leanPCS for Quantum Resistance - Cointribune

Ethereum: Vitalik Buterin Backs leanPCS for Quantum Resistance

On November 16, 2026, Vitalik Buterin announced his support for leanPCS, an approach designed to facilitate the aggregation of cryptographic proofs on Ethereum. It aims to prepare the network for signatures resistant to quantum computers, potentially reaching 6,000 bytes compared to 65 today, without weighing down each block. However, EIP-8288 remains a draft without a timeline and does not yet mention leanPCS.

In Brief

  • On November 16, Vitalik Buterin states he supports leanPCS, which he previously rejected.
  • Some quantum signatures would weigh 1,000 to 6,000 bytes, compared to 65 today.
  • EIP-8288 proposes a recursive STARK proof aggregating validations before their inclusion in a block.
  • The draft does not mention leanPCS and does not set any dates.

Vitalik Buterin Supports leanPCS to Contain the Weight of Quantum Signatures

In a message posted on X on November 16, 2026, Ethereum co-founder Vitalik Buterin wrote that he has gone from thinking leanPCS is “total bull” to considering it “a total bull” in recent weeks.

leanPCS is based on a polynomial commitment scheme (PCS). It is the core mathematical building block of STARK proofs. It would standardize a small verification tool that different proof systems could use. Buterin therefore sees it as a way to introduce signature aggregation earlier.

The challenge lies in data size. Eventually, sufficiently powerful quantum computers could compromise the elliptic curve cryptography currently securing Ethereum accounts. A current signature occupies 65 bytes. According to Buterin, some resistant alternatives require 1,000 to 6,000 bytes. This represents 15 to over 90 times more (based on our calculations). EIP-8288 estimates 2 to 3 KB for hash-based signatures, which is the reference for its cost calculations.

STARK proofs and their limitations

STARK proofs allow verifying a computation without having to reproduce it entirely. However, their size exceeds 128 KB. It can reach 512 KB when fast generation is favored, states EIP-8288. Storing that much data on Ethereum would therefore increase pressure on limited block space and transaction costs.

On Ethereum, EIP-8288 Aggregates Signatures and Proofs Before They Enter Blocks

EIP-8288 proposes to aggregate post-quantum signatures and STARK proofs into a single recursive proof per block. Nodes thus verify all cryptographic dependencies declared by transactions without individually processing each large data element. Each transaction declares these dependencies as short references:

  • scheme type;
  • fingerprint of signed data;
  • verification key.

The wallet still generates the post-quantum signature. Nodes receiving it via the mempool (transaction queue) combine it with others, then combine those batches.

Decryption: a block would finally contain only one recursive STARK proof certifying that all declared dependencies are valid. Ethereum would therefore keep the payment instructions and what is needed to verify this proof, without storing each signature.

| Technology | Nature and Role | Status in EIP-8288 | | --- | --- | --- | | leanPCS | Approach advocated by Vitalik Buterin, based on a polynomial commitment scheme. It would provide a common verification tool for different proof systems. | Absent from the current text. | | leanSPHINCS | Hash-based signature scheme, resistant to quantum attacks. | The only scheme usable in the current specification. | | leanSTARK | More general path, which would accept any signature scheme or privacy protocol. | Reserved identifier. The calculation of its dependencies’ fingerprint remains to be defined in the draft. |

Costs change scale, however. EIP-8288 estimates 2-3 KB and 150,000 to 200,000 gas for direct verification of a hash-based signature. Gas measures the computational cost of an operation on Ethereum.

Leave a Reply