Vitalik frames leanPCS as a possible shortcut to general proof aggregation
His new explanation distinguishes signature aggregation, general STARKs and polynomial commitments; EIP-8288 remains a draft.

Vitalik Buterin argues that leanPCS could provide a faster route to broadly useful proof aggregation. His explanation starts from a simple constraint: quantum-resistant signatures and proofs can be too large to place individually onchain. Aggregating claims before block inclusion could reduce the repeated data that the chain must carry.
He distinguishes leanSPHINCS for a particular signature scheme, leanSTARK for general computation and leanPCS for polynomial commitments. His preference for leanPCS reflects the narrower set of protocol choices it requires, while retaining flexibility in proof systems. That is an architectural argument, not a demonstrated production rollout.
The primary draft, https://eips.ethereum.org/EIPS/eip-8288, describes recursive aggregation in the mempool and a block-level proof. Teams exploring privacy or account authorization should track the changing specification and implementation costs rather than assume that projected efficiency is already available on Ethereum.