Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Wonderboom -- Efficient, and Censorship-Resilient Signature Aggregation for Million Scale Consensus

Zeta Avarikioti, Ray Neiheiser, Krzysztof Pietrzak, Michelle X. Yeo

TL;DR

Wonderboom addresses Ethereum’s slow finality and vulnerability to vote censorship by introducing a scalable, tree-based signature aggregation protocol capable of aggregating all validator signatures within a single slot, enabling two-slot finality. The approach leverages a multi-layer tree with a fixed fanout, separates proposer and validator IPs to reduce deanonymization risk, and optimizes public-key aggregation with BLS subtraction to scale to millions of validators. The paper provides formal definitions of vote-censorship resilience, analyzes resilience under slowly adaptive adversaries, and presents a million-scale simulation framework plus implementation results showing substantial speedups over the current Ethereum design. Collectively, Wonderboom demonstrates that fast finality and strong inclusion guarantees are achievable at million-validator scale with no reduction of the validator set, offering practical improvements for Ethereum’s scalability and security posture.

Abstract

Over the last years, Ethereum has evolved into a public platform that safeguards the savings of hundreds of millions of people and secures more than $650 billion in assets, placing it among the top 25 stock exchanges worldwide in market capitalization, ahead of Singapore, Mexico, and Thailand. As such, the performance and security of the Ethereum blockchain are not only of theoretical interest, but also carry significant global economic implications. At the time of writing, the Ethereum platform is collectively secured by almost one million validators highlighting its decentralized nature and underlining its economic security guarantees. However, due to this large validator set, the protocol takes around 15 minutes to finalize a block which is prohibitively slow for many real world applications. This delay is largely driven by the cost of aggregating and disseminating signatures across a validator set of this scale. Furthermore, as we show in this paper, the existing protocol that is used to aggregate and disseminate the signatures has several shortcomings that can be exploited by adversaries to shift stake proportion from honest to adversarial nodes. In this paper, we introduce Wonderboom, the first million scale aggregation protocol that can efficiently aggregate the signatures of millions of validators in a single Ethereum slot (x32 faster) while offering higher security guarantees than the state of the art protocol used in Ethereum. Furthermore, to evaluate Wonderboom, we implement the first simulation tool that can simulate such a protocol on the million scale and show that even in the worst case Wonderboom can aggregate and verify more than 2 million signatures within a single Ethereum slot.

Wonderboom -- Efficient, and Censorship-Resilient Signature Aggregation for Million Scale Consensus

TL;DR

Wonderboom addresses Ethereum’s slow finality and vulnerability to vote censorship by introducing a scalable, tree-based signature aggregation protocol capable of aggregating all validator signatures within a single slot, enabling two-slot finality. The approach leverages a multi-layer tree with a fixed fanout, separates proposer and validator IPs to reduce deanonymization risk, and optimizes public-key aggregation with BLS subtraction to scale to millions of validators. The paper provides formal definitions of vote-censorship resilience, analyzes resilience under slowly adaptive adversaries, and presents a million-scale simulation framework plus implementation results showing substantial speedups over the current Ethereum design. Collectively, Wonderboom demonstrates that fast finality and strong inclusion guarantees are achievable at million-validator scale with no reduction of the validator set, offering practical improvements for Ethereum’s scalability and security posture.

Abstract

Over the last years, Ethereum has evolved into a public platform that safeguards the savings of hundreds of millions of people and secures more than $650 billion in assets, placing it among the top 25 stock exchanges worldwide in market capitalization, ahead of Singapore, Mexico, and Thailand. As such, the performance and security of the Ethereum blockchain are not only of theoretical interest, but also carry significant global economic implications. At the time of writing, the Ethereum platform is collectively secured by almost one million validators highlighting its decentralized nature and underlining its economic security guarantees. However, due to this large validator set, the protocol takes around 15 minutes to finalize a block which is prohibitively slow for many real world applications. This delay is largely driven by the cost of aggregating and disseminating signatures across a validator set of this scale. Furthermore, as we show in this paper, the existing protocol that is used to aggregate and disseminate the signatures has several shortcomings that can be exploited by adversaries to shift stake proportion from honest to adversarial nodes. In this paper, we introduce Wonderboom, the first million scale aggregation protocol that can efficiently aggregate the signatures of millions of validators in a single Ethereum slot (x32 faster) while offering higher security guarantees than the state of the art protocol used in Ethereum. Furthermore, to evaluate Wonderboom, we implement the first simulation tool that can simulate such a protocol on the million scale and show that even in the worst case Wonderboom can aggregate and verify more than 2 million signatures within a single Ethereum slot.
Paper Structure (21 sections, 6 theorems, 2 equations, 5 figures)

This paper contains 21 sections, 6 theorems, 2 equations, 5 figures.

Table of Contents

  1. Introduction
  2. Model
  3. Ethereum: Design & Limitations
  4. Background
  5. Vote Censorship Vulnerabilities
  6. Wonderboom
  7. Public IPs
  8. Architecture
  9. Bootstrapping
  10. Protocol
  11. Optimizing Public Key Aggregation
  12. Censorship-Resilience in Wonderboom
  13. Implementation & Evaluation
  14. Discussion
  15. Related Work
  16. ...and 6 more sections

Key Result

Lemma 1

The probability of at least one leaf group with $\geq 3$ adversarial nodes and $\geq 1$ adversarial aggregator is at least $\sum_{s=3}^{128-16} \left( \frac{\binom{f}{s}\binom{N-f}{128-16-s}}{\binom{N}{128-16}} \right) \cdot \sum_{s=1}^{16}\left(\frac{\binom{f}{s}\binom{N-f}{16-s}}{\binom{N}{16}} \r

Figures (5)

  • Figure 1: Wonderboom system architecture.
  • Figure 2: Comparison of censorship resilience of Wonderboom and Ethereum for different values of $k$.
  • Figure 3: Worst-Case Configurations
  • Figure 4: Runtime of Wonderboom under varying participation rates.
  • Figure 5: Wonderboom vs Ethereum

Theorems & Definitions (12)

  • Definition 1: Vote-censorship resilience
  • Lemma 1
  • proof
  • Lemma 2
  • Theorem 1
  • proof
  • Theorem 2: vote-censorship resilience
  • proof
  • Lemma 2
  • proof
  • ...and 2 more