Subscribe
18:00Tao calls OpenAI’s Navier–Stokes push “resource extraction”17:10LAPTOP memecoin hits $190.81, then loses 99% inside an hour17:05Hubinger puts the odds of AI killing everyone above 10%; a colleague resigns16:39CancerBench launches; five frontier models tied at zero cancer types cured16:30ElevenLabs preparing 2028 IPO after $11bn round, The Information reports16:30Anthropic retracts its July explanation: Mythos 5 attacked systems knowingly

Vitalik's cheap post-quantum signatures come with a canonical ISA attached

EIP-8288 prices a hash-based signature at 3,000 gas against 150,000 today, and buries the decision to give Ethereum an instruction set in the last paragraph.

In briefButerin published a note on September 9 pitching EIP-8288 for I-Star, the fork after Hegota1Verification gas constants of 3,000 for leanSPHINCS and 30,000 for leanSTARK, and AGGREGATION_INTERVAL of 1000 milliseconds2Current hash-based signatures cost ~2-3 kB and 150,000 to 200,000 gas to verify, and STARKs take over 128 kB and many millions of gas3
Vitalik Buterin speaking on stage
Photo: John Phillips (CC BY 2.0)

Vitalik Buterin published a note on September 9 arguing that EIP-8288 belongs in I-Star, the Ethereum fork after Hegota. The proposal sets verification of a hash-based post-quantum signature at 3,000 gas. Today the same job costs 150,000 to 200,000 gas by the EIP's own accounting, and a quantum-safe private transaction runs to roughly 10 million.

Call it a factor of fifty on signatures and roughly three hundred on private transactions. But the saving does not come from better cryptography.

It comes from moving the cryptography out of the block.

Here is the shape of it. Your transaction carries a "dependency frame", which is a list of claims rather than data — message hash M was signed by SPHINCS+ key P, data hash D satisfies the statement behind verification key V. Your signature itself travels in an envelope to the mempool and stops there. Mempool nodes tick, batch every envelope they have seen, and produce one recursive STARK proving all of the claims at once (the builder is treated as just another mempool node). What lands on chain is a single proof plus 96 bytes per claim.

vitalik.eth@VitalikButerin

A note on recursive STARK mempools (EIP-8288) t.co/XNBuNtkKmi

This is an EIP that I am hoping we can get included in I-star (the fork after Hegota) that you can think of as the next step after Frames, that would unlock extreme amounts of power. Particularly:

* Ultra-cheap quantum-safe signatures (SPHINCS-). Much of the cost savings comes from the fact that the signature data (~3 kB) does not have to go onchain
* Ultra-cheap quantum-safe privacy protocols. Status quo minimum cost for private txs is ~300k if you engineer very well (no one does), status quo quantum-safe is ~10M gas, this could reduce it to low tens of thousands.
* Universal support for your favorite new signature or proof scheme without needing EVM changes. Whatever you use (Falcon, ML-DSA, some other lattice-based thing, something code-based or isogeny-based or even more esoteric), you can just wrap it client-side in a STARK, onchain gas cost low tens of thousands just like privacy protocols. Hopefully, Ethereum will never need "please support my favorite cryptographic algo" politics again.
* Private account abstraction: keep your account logic private, and in a private location onchain. Then you can make one transaction to change the ownership of all your onchain state - accounts, defi positions, privacy protocol notes, everything - without revealing which objects' ownership you're changing.

Here's how it works.

Your transaction can include a type of frame that we call a "dependency frame". The frame is a list of statements, asserting claims like "message hash M was signed by SPHINCS- public key P" and "data hash D was proven to satisfy a statement defined by verification key V".

When you send your transaction, you send it in an envelope, which includes a signature or a STARK for each statement in a dependency frame.

Once the transaction reaches the mempool, nodes aggregate them. Each node runs a loop: wait one tick (eg. 500ms), aggregate all new envelopes (either single-tx or multi-tx) that you've seen, remove any transactions that are expired, generate a STARK recursively proving all dependencies, and send a new multi-tx envelope containing that STARK.

Hence, the bandwidth load is bounded: each node's outbound is one STARK (~100-300 kB) per tick, plus each transaction getting broadcasted through the network once (as happens already).

The block builder acts as "yet another mempool node", receiving envelopes from the mempool (plus any side channels), generates its own STARK covering the subset of transactions it intends to include in the block, and adds that STARK to the block.

Total onchain overhead: one STARK (100-300 kB), plus 96 bytes for each statement being proven.

This is what I've called before ( t.co/3jfVkYTZrR ) "The Proof Singularity". Today, we have all the ingredients to actually implement it.

As a developer, this requires a somewhat different workflow than you are used to, but it is conceptually simple. Any signatures or STARKs, you put into a separate frame. Then the main logic that today is verifying a signature or STARK, you replace with checking for the existence of a frame that includes the correct statement as a dependency.

Examples of useful statements:

* [tx sighash] verifies against [the pubkey at sload(0)]
* there exists a secret and a merkle branch such that hashing secret+0 and applying the merkle branch outputs (public) root R, and hashing secret+1 outputs (public) nullifier N
* there exists a secret address A, salt S and signature Z such that sload(0) = hash(A, S) and a merkle proof of address A inside a recent ethereum state contains some pubkey D where [tx sighash] was signed by D [this is private account abstraction; all variables except [tx sighash] and sload(0) are private; you can also make D a STARK verification key]
* there exists an ML-DSA signature signing [tx sighash], that verifies against an ML-DSA pubkey whose hash is sload(0)

At the core, this is moving any compute and data other than bookkeeping "business logic" outside the core path of Ethereum execution, sharding and parallelizing it via the mempool.

Notice also that this requires agreeing on a _language_ (aka. an ISA) for the recursive STARKs to define statements in. The current leading candidate is RISC-V. So this would also de-facto be Ethereum adding RISC-V (or something else we decide on) as a canonical ISA - a big decision that should be done carefully, but that I think will be necessary to drive Ethereum forward.

on X · 177.0K views · captured Sep 10, 2026

So the ~3 kB SPHINCS+ signature never touches the chain. Neither does the 128 kB to 512 kB STARK a privacy protocol would otherwise post.

Ethereum stops paying per signature and starts paying per block.

Which raises the question nobody asked on the timeline. If you are not paying per signature, what does the block pay?

Buterin's answer is one STARK of 100 to 300 kB, every block, plus the 96-byte triples. A fixed cost has a break-even, so we worked it out. At roughly 3 kB per hash-based signature, a 100 kB block proof only pays for itself above about 33 post-quantum statements per block, and a 300 kB proof needs about 100. Below that line the aggregate proof is probably more data than the signatures it replaced. We would like to see that curve drawn before I-Star scoping, because on a quiet block it points the wrong way.

A small thing we enjoyed. The note says nodes "wait one tick (eg. 500ms)" before aggregating. The EIP's constant table sets AGGREGATION_INTERVAL to 1000 milliseconds. One of those is going to change, and the gap between a man's tweet and his own specification (three months old, still Draft) is usually where the argument still is.

Coverage got the verb wrong, too. Wu Blockchain reported this as Buterin proposing the design. He and Thomas Coratger filed EIP-8288 on June 3. What happened on September 9 was lobbying, and lobbying for a specific fork is a different act with a different audience.

Now the part that matters more than the gas numbers.

Recursive aggregation needs every prover to agree on a language for expressing statements. Buterin says so in the last paragraph, names RISC-V as the leading candidate, and calls it "a big decision that should be done carefully, but that I think will be necessary to drive Ethereum forward." Read plainly, the pitch for cheap quantum-safe signatures is also the pitch for giving Ethereum a canonical instruction set that is not the EVM. If you have been waiting for the RISC-V argument to arrive, it arrived inside a gas-savings post.

Our read is that the ISA is the real content of the I-Star fight, and that post-quantum urgency is probably the vehicle carrying it. The Ethereum Foundation has set a December 2029 deadline for quantum-resistant transactions, validators and storage, which gives anyone arguing for a large architectural change a clock to point at. We would expect the ISA question, not the aggregation scheme, to consume most of the I-Star discussion by the end of this year, and we would expect EIP-8288 to stay out of Hegota entirely. If the magicians thread stays on gas accounting and never gets to RISC-V, we are wrong about what this is.

One more thing for whoever has to build on it. Buterin is explicit that the developer workflow changes. Signatures and proofs move into their own frame, and your contract stops verifying and starts checking that a dependency exists. Small edit in a sentence. Large edit in every wallet, paymaster and privacy pool that already ships.

EIP-8288 is still marked Draft. Hegota comes first.

Sources

01
Buterin published a note on September 9 pitching EIP-8288 for I-Star, the fork after HegotaA note on recursive STARK mempools (EIP-8288) This is an EIP that I am hoping we can get included in I-star (the fork after Hegota) that you can think of as the next step after Frames” — x.com · primary · Sep 10
02
Verification gas constants of 3,000 for leanSPHINCS and 30,000 for leanSTARK, and AGGREGATION_INTERVAL of 1000 millisecondsLEANSPHINCS_VERIFICATION_GAS 3000 LEANSTARK_VERIFICATION_GAS 30000 AGGREGATED_VK TBD AGGREGATION_INTERVAL 1000 (milliseconds)” — eips.ethereum.org · primary · Sep 10
03
Current hash-based signatures cost ~2-3 kB and 150,000 to 200,000 gas to verify, and STARKs take over 128 kB and many millions of gasCurrent proposals for hash-based signatures are in the range of ~2-3 kB and ~150,000 to 200,000 gas to verify. Lattice-based signatures have a similar cost. Meanwhile, hash-based zero-knowledge proofs (STARKs) all take over 128 kB, or as…” — eips.ethereum.org · primary · Sep 10
Show all 11 sources
04
Status quo quantum-safe private transactions cost ~10M gas and the EIP could reduce that to low tens of thousandsStatus quo minimum cost for private txs is ~300k if you engineer very well (no one does), status quo quantum-safe is ~10M gas, this could reduce it to low tens of thousands.” — x.com · primary · Sep 10
05
The dependency frame declares claims and the signature travels in an envelope; mempool nodes aggregate on a tick and produce a recursive STARKYour transaction can include a type of frame that we call a "dependency frame". The frame is a list of statements, asserting claims like "message hash M was signed by SPHINCS- public key P"... Each node runs a loop: wait one tick (eg.…” — x.com · primary · Sep 10
06
Total onchain overhead is one STARK of 100-300 kB plus 96 bytes per statementTotal onchain overhead: one STARK (100-300 kB), plus 96 bytes for each statement being proven.” — x.com · primary · Sep 10
07
Buterin names RISC-V as the leading candidate for a canonical ISA and calls it a big decisionNotice also that this requires agreeing on a _language_ (aka. an ISA) for the recursive STARKs to define statements in. The current leading candidate is RISC-V. So this would also de-facto be Ethereum adding RISC-V (or something else we…” — x.com · primary · Sep 10
08
EIP-8288 was created on 2026-06-03 by Vitalik Buterin and Thomas Coratger and is still marked Draft⚠️ Draft Standards Track: Core EIP-8288: Frame Type for PQ Sig and STARK Aggregation Adds recursive STARK-based aggregation for quantum-resistant signatures and STARKs via an EIP-8141 frame mode Authors Vitalik Buterin (…” — eips.ethereum.org · primary · Sep 10
09
Wu Blockchain reported the note as Buterin proposing the designVitalik Proposes Recursive STARK Mempools for Ethereum's Future I-Star Upgrade Vitalik Buterin has proposed EIP-8288, a recursive STARK mempool design that he hopes will be included in Ethereum's I-Star upgrade, following Hegota.” — x.com · reported · Sep 10
10
The Ethereum Foundation set a December 2029 deadline for quantum-resistant transactions, validators and data storageThe Ethereum Foundation set a December 2029 deadline to make transactions, validators, and data storage quantum-resistant, with five hard forks planned after next year's Hegotá upgrade at roughly one every 7.2 months” — decrypt.co · reported · Sep 10
11
The developer workflow moves signatures and proofs into a separate frame and replaces verification with a dependency existence checkAny signatures or STARKs, you put into a separate frame. Then the main logic that today is verifying a signature or STARK, you replace with checking for the existence of a frame that includes the correct statement as a dependency.” — x.com · primary · Sep 10
Up next · Keep readingCrypto · 3 min read

LAPTOP peaked at $190.81 two minutes after launch, on $48,000 of liquidity. The design did the rest

Hunter Biden's memecoin printed a $144 billion valuation against a pool smaller than a house deposit, then lost 99 percent inside an hour. He says nobody on his side sold. The tokenomics say nobody on his side could.

Continue ↓