Skip to content
Market News

Vitalik Buterin Details Ethereum’s LeanPCS Proposal for 8288

Vitalik Buterin explains how Ethereum proposal 8288 could reduce on-chain data requirements, with leanPCS offering a faster implementation path.

Vitalik Buterin Details Ethereum’s LeanPCS Proposal for 8288
  • Proposal 8288 aggregates signatures and STARK proofs off-chain before submitting compact claims and proofs to Ethereum.
  • LeanSPHINCS supports quantum-safe signatures, while leanSTARK enables custom computations but requires an agreed instruction set.
  • LeanPCS could verify STARKs for approximately 20,000 to 40,000 gas and provide an earlier implementation path.

Ethereum co-founder Vitalik Buterin has explained how proposal 8288 could reduce Ethereum’s on-chain data requirements. In a recent post, he compared three approaches: leanSPHINCS, leanSTARK and leanPCS. He said leanPCS could provide a faster implementation path while supporting different proof systems and leaving room for leanSTARK.

8288 Aggregates Proofs Before They Reach the Chain

Buterin said 8288 targets computations that use data once, establish an answer on-chain, and discard the original data. Examples include signatures, STARKs, Merkle branches and fully homomorphic encryption (FHE). He identified signatures and STARKs as the main applications.

Quantum-safe cryptography increases data sizes. ECDSA signatures use 65 bytes, while WOTS or SPHINCS signatures require 1 to 6 kilobytes. Similarly, Groth16 and PLONK proofs use 200 to 1,000 bytes, compared with 128 kilobytes for STARKs.

Under 8288, users publish signatures, STARKs or polynomial commitment openings. Each node collects submissions and generates a STARK containing claims about verified activity. Nodes rebroadcast input and output hashes, around 64 to 96 bytes per claim, alongside one STARK proof per cycle. 

Further aggregation produces a master proof for each block. The chain receives the claims through a specialized frame type, rather than the original signatures or proofs.

LeanSPHINCS and LeanSTARK Serve Different Uses

The three approaches differ in the object users create. LeanSPHINCS uses a hash-based signature scheme, supporting quantum-safe accounts and multisignatures. Buterin cited a cost of 4,096 gas per 64-byte signature. However, it supports only that signature scheme.

LeanSTARK allows users to run chosen computations and publish STARK proofs. Applications include lattice-based signatures, hidden-rule multisignatures, privacy protocols and private account abstraction. 

However, developers must agree on an instruction set architecture (ISA). Buterin said this could take time because upgrading the ISA would be difficult.

LeanPCS Could Precede LeanSTARK

LeanPCS focuses on polynomial commitment schemes, which prove that a polynomial evaluates to a particular value. Buterin said a PCS oracle could allow 8288 to verify STARKs for approximately 20,000 to 40,000 gas.

Although leanPCS may require multiple claims to prove one result, it offers greater off-chain flexibility. Its specification mainly requires a field, with a 128-bit binary field as a natural option. 

Buterin also described recursive tower fields extending to 256 bits. He said leanPCS could arrive sooner, with leanSTARK following after developers agree on the ISA.