Vitalik Buterin Backs LeanPCS for Ethereum's "Cryptographic Proof Singularity"
Ethereum co-founder Vitalik Buterin detailed his shift to bullish sentiment on leanPCS, a mechanism he believes is key to rapidly achieving advanced cryptographic scalability for the network.
Ethereum co-founder Vitalik Buterin announced a significant shift in his technical outlook, stating on X on Monday, November 16, 2026, that he has moved from skepticism to full support for leanPCS within the proposed 8288 framework.
Buterin's detailed explanation highlights 8288 and leanPCS as solutions for hyper-scaling data and execution, particularly for heavy computations like signatures and STARKs, which are expected to grow substantially with quantum-safe cryptography.
Buterin views leanPCS as a practical and fast-track method to achieve the same generality as leanSTARK, but with fewer immediate protocol choices, making it quicker to implement.
Ethereum co-founder Vitalik Buterin announced a significant shift in his technical outlook, stating on X on Monday, November 16, 2026, that he has moved from skepticism to full support for leanPCS within the proposed 8288 framework. Buterin outlined that he had "gone from thinking leanPCS is total bull to being a total bull," emphasizing its potential to enable "the cryptographic proof singularity" for Ethereum much faster than anticipated.
Buterin's detailed explanation highlights 8288 and leanPCS as solutions for hyper-scaling data and execution, particularly for heavy computations like signatures and STARKs, which are expected to grow substantially with quantum-safe cryptography. The current state of the Ethereum network is seeing increasing activity, with Binance ETH reserves recently hitting 2.9 million, their lowest level since 2021, indicating growing outflows. Meanwhile, broader DeFi adoption remains low, with tokenized gold volume hitting $90 billion in Q1 but DeFi use stalled at 1 percent, as reported in recent coverage.
Buterin views leanPCS as a practical and fast-track method to achieve the same generality as leanSTARK, but with fewer immediate protocol choices, making it quicker to implement. He suggests that leanPCS provides a rapid route to quantum-safe accounts and enhanced privacy protocols, with the option to integrate leanSTARK later once a universal language for programs (ISA) is agreed upon. Buterin's position implies that this approach could accelerate Ethereum's technical evolution, addressing future cryptographic demands and scalability challenges.
“Over the past few weeks I've gone from thinking leanPCS is total bull to being a total bull. So let me explain some of these buzzwords in more detail. At the core, 8288 is about hyper-scaling data and execution for any computation that needs to get performed on a piece of data once, the chain learns the answer, and then we never need to see that data again. This sounds very specific, but it includes most 'heavy' things happening on Ethereum: * Signatures * STARKs * Merkle branches * FHE computation *.. Really the first two are the most important. Once we go quantum-safe, signatures get bigger (65 bytes ECDSA -> 1-6 kB WOTS/SPHINCS depending on params) and ZKPs get much bigger (200-1000 bytes with groth16, PLONK, etc -> 128 kB with STARKs). This is unsustainable to put on chain, and 8288 fixes this. 8288 works by aggregating STARKs in the mempool. First, you as a user generate the STARK or SPHINCS signature or PCS opening (more on that last one later), and publish it. Then, each node listens. Each tick, each node takes all of the new objects that it has seen, and generates a STARK containing a list of 'claims': 'pubkey P has signed message M' 'program X run on data D has output Y' 'p(X) = Y for some polynomial P whose hash is H' and a proof that it has seen a signature, STARK or PCS opening verifying those claims. So the only information getting re-broadcasted is: (i) hashes of inputs and outputs (~64-96 bytes per claim) (ii) a single STARK proof per tick These aggregate proofs themselves get re-aggregated, and eventually you get to a single 'master proof' in the block, that verifies that all of those statements are true. And so the only other data that has to actually go on chain is the statements (the (P, M), (X, D, Y), (X, Y, H) tuples I described above), not the actual signatures or proofs. This gets put into a specialized frame type. Now, let's get into the leanSPHINCS vs leanSTARK vs leanPCS part. The core distinction is: *what is the underlying object that the user is creating?* In leanSPHINCS, it's a signature, and specifically this particular type of purely-hash-based signature: If we add leanSPHINCS, then users will be able to make quantum-safe accounts, and pay only a little bit of gas (4096 for the 64 bytes) for each signature. So we get scalable quantum-safety for regular accounts, multisigs, etc. But it's only one specific signature scheme, you can't do anything else. In leanSTARK, it's a STARK. This means it's fully general: the user runs whatever computation they want, and publish a STARK of it. So you can use it for: * Any signature scheme (including eg. lattice-based ones if you like those) * A multisig that hides its internal logic * Privacy protocols * Private account abstraction: authorization logic that depends on some value hidden elsewhere in the state, so you can have one key that controls all your accounts without publicly linking them to each other Basically, it's a free for all, in the same way the EVM is a free for all. But leanSTARK has a practical downside. The protocol would have to specify the language in which users write their programs (we call this the 'ISA'). So we would have to agree on that language. This is a really big deal - it's the first big case of 'Ethereum moving beyond the EVM' - and so it's likely to take time to agree on the details of it, especially since the ISA would be hard to upgrade. There are benefits to taking longer on this, figuring out the ideal ISA, and then even giving access to it inside regular contracts. LeanPCS is the third option. PCS stands for 'polynomial commitment scheme': a proof that P(x) = y. The most important thing to know about PCSes is that they are by far the most important 'hard' component of a STARK (see here: ). If you have a 'magic PCS oracle' (which from the EVM's point of view, 8288 is), you can verify a STARK in ~20-40k gas. The most important gain with PCS is that there is far less that we need to choose. Specifying a PCS only requires specifying a field, and there is a natural option: the 128 bit binary field (technically, we can go more general than that, and say the 2^k-bit binary recursive tower field, going up to 256) LeanPCS is less efficient than leanSTARK onchain, because you would have to put multiple claims to prove one thing. But it's arguably more efficient offchain, because you have much more flexibility to choose proof systems. But most importantly, leanPCS gives you the same generality as leanSTARK, in a way that could potentially be implemented very quickly. And once we figure out the ISA, we can add leanSTARK later. So there is a route to getting 'the cryptographic proof singularity' much faster than any of us expected, and that route runs through 8288 with leanPCS.”
The Gokhshtein Media Voices Desk covers what the people who move markets are saying — statements, predictions, and reactions from notable investors, founders, and policymakers. About this desk →