Governance
EIP-8288: the networking side of recursive aggregation
Publication: Ethereum Research - Latest topics
Author: cskiraly
Source published: 18/11/2026, 09:58:32 UTC
Briefing created: 18/11/2026, 10:27:11 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 18/11/2026, 10:13:25 UTC.
Briefings
Research simulates EIP-8288's recursive aggregation mempool, showing it can carry post-quantum signatures and privacy transactions. Simulations vary network sizes from 100 to 10,000 nodes and test different aggregation and proof-folding strategies. Results indicate current mempool capacity meets today's load, but specific protocol choices significantly impact privacy transaction capacity and inclusion delays.
Key points
- Simulations show a single builder can include all transactions at 15 signature tx/s across networks of 100 to 10,000 nodes.
- Privacy transaction capacity ranges from 3 to 9 tx/s on a single prover with ordinary mesh connections, depending on aggregation strategy.
Context
This research analyzes EIP-8288's proposed recursive aggregation mempool, which combines post-quantum signatures with STARK proofs to reduce transaction checks. The study uses a discrete-event simulator to test networking choices across varying network sizes and aggregation strategies, comparing them against current mempool performance.
Limitations
Simulations use a single prover benchmark machine and leanVM benchmarks; results may not reflect real-world prover variability or full network dynamics.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 18/11/2026, 10:27:11 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeidiwcxv77yu2fg4j6mcpfdkbgha3oc2uff5eficyfmk56ghl2wgza