header-langage
简体中文
繁體中文
English
Tiếng Việt
한국어
日本語
ภาษาไทย
Türkçe
Scan to Download the APP
Partnered With:

Vitalik: Optimistic about the leanPCS solution, which is expected to accelerate Ethereum's journey towards the 'cryptographic proof singularity'.

BlockBeats news, November 16: Ethereum founder Vitalik Buterin stated in a post that over the past few weeks, his stance on leanPCS has shifted from initial strong skepticism to high optimism, and he detailed the differences between Ethereum proposal 8288 and the three approaches leanSPHINCS, leanSTARK, and leanPCS. He pointed out that the core goal of 8288 is to scale computation that only needs to be verified once, with verification results posted on-chain while the original data does not need to be retained long-term, covering scenarios such as digital signatures, STARK proofs, Merkle branches, and fully homomorphic encryption (FHE) computation. Among these, digital signatures and STARK proofs are the most important application directions. As the quantum-resistant migration advances, the data size of signatures and zero-knowledge proofs will increase significantly, making it unsustainable to write all of them directly on-chain.


8288 plans to solve this problem by aggregating STARK proofs in the mempool: users first submit signatures, STARK proofs, or PCS openings, and each node collects newly submitted objects and generates a STARK containing multiple verification claims and corresponding proofs. These aggregate proofs are then recursively aggregated further, ultimately forming a single main proof in the block. On-chain, only the hashes of inputs and outputs and the related claims need to be stored, without repeatedly broadcasting the original signature and proof data.


Regarding the three approaches, Vitalik made the following distinctions:


leanSPHINCS: Based on the pure hash-based signature scheme SPHINCS, it can support quantum-resistant accounts, allowing users to complete signatures at a lower Gas cost, but its functionality is limited to specific signature schemes.


leanSTARK: Users can run arbitrary computation and submit STARK proofs, supporting scenarios such as different signature schemes, multisig privacy, privacy protocols, and private account abstraction. However, this approach requires the Ethereum community to first reach consensus on the instruction set architecture (ISA) used by user programs, involving important changes to the Ethereum execution environment, and therefore may take a longer time.


leanPCS: Based on polynomial commitment schemes (PCS), multiple claims need to be processed on-chain, making it less efficient than leanSTARK, but the choice of off-chain proof systems is more flexible. It requires less standardization content, is expected to be implemented sooner, and may be combined with leanSTARK in the future.


Vitalik believes that leanPCS is expected to first achieve generality similar to leanSTARK without waiting for the ISA standard to be fully finalized, providing a path for Ethereum to advance cryptographic proof technology more quickly.

举报 Correction/Report
Correction/Report
Submit
Add Library
Visible to myself only
Public
Save
Choose Library
Add Library
Cancel
Finish