Scalable and Probabilistic Leaderless BFT Consensus through Metastability

Authors Team Rocket; Maofan Yin; Kevin Sekniqi; Robbert van Renesse; Emin Gün Sirer
Year 2019 (revised 2020)
Project Avalanche
License arXiv non-exclusive distribution license
Official source Scalable and Probabilistic Leaderless BFT Consensus through Metastability — arXiv:1906.08936

This page summarizes a technical research paper for educational reference. It is not a verbatim reproduction or investment advice. CryptoGloss does not claim authorship of the source document. Consult the paper for its full scope and assumptions.

Scalable and Probabilistic Leaderless BFT Consensus through Metastability introduces the Snow protocol family and explains how its ideas can support Avalanche consensus. The arXiv record lists its initial submission on June 21, 2019, and its latest revision on August 24, 2020. The authors are Team Rocket, Maofan Yin, Kevin Sekniqi, Robbert van Renesse, and Emin Gün Sirer. This page follows that 2019 arXiv paper and its author list; its title and experimental results should not be mixed with earlier Avalanche materials.

The core idea: repeated sampling

Some classical protocols require validators to exchange messages broadly to agree on an order or value. The Snow family uses repeated random sampling: a node asks a small group of other nodes for their preference, updates its own preference based on the responses, and repeats the process. As local preferences begin to align, metastability makes the network increasingly unlikely to move back toward a competing choice. A node does not need a complete view of every participant.

The paper analyzes probabilistic safety and liveness. “Probabilistic” describes the form of the guarantee: the chance of an unwanted outcome can be made very small under stated protocol parameters and network assumptions, but the claim is not assumption-free deterministic finality.

From Slush to Avalanche

The paper develops several related protocols:

  • Slush introduces repeated sampling and preference changes based on sample support.
  • Snowflake adds a counter for consecutive responses supporting a node’s current preference.
  • Snowball accumulates confidence from polling outcomes, so a preference reflects more than the latest poll.
  • Avalanche applies related ideas to connected transactions in a directed acyclic graph (DAG), accounting for conflicts and transaction relationships.

Parameters such as sample size and polling thresholds affect the balance among safety, liveness, and speed. Their values belong to a particular model or implementation; a value shown in one example or paper is not a universal constant for every Avalanche network.

Experimental results and their limits

The arXiv abstract reports about 3,400 transactions per second and 1.35-second confirmation latency for the large-scale deployment evaluated by the authors. These are results from the paper’s experiment, not a current Avalanche C-Chain guarantee, not a combined throughput figure for all Avalanche networks, and not a recent production benchmark. Current performance claims need dated measurements that describe their configuration and workload.

How Avalanche uses the ideas today

Current Avalanche technical documentation describes the Snow* family, including Snowball and Snowman. Snowman extends Snowball to decide on a linear sequence of blocks. For the Primary Network, the documentation says P-Chain, C-Chain, and X-Chain use Snowman; X-Chain was linearized in the Cortina upgrade in April 2023. Older descriptions of the Primary Network X-Chain as currently using a DAG engine are therefore out of date. Avalanche L1s can have their own configurations and virtual machines, so check the documentation for a specific network before generalizing.

Benefits and trade-offs

  • Sampling avoids all-to-all communication: nodes query samples instead of asking every participant to message every other participant.
  • Fast decisions depend on assumptions: safety and liveness probabilities depend on protocol parameters, adversarial participation, and network conditions.
  • The Snow family supports different structures: Snowman is designed for ordered blocks, while DAG designs must handle transaction relationships and conflicts.
  • Research results are not current product measurements: the paper helps explain the design but does not replace recent network performance data.

Common misunderstandings

  • “3,400 TPS is Avalanche’s current performance.” It is an experimental result reported in the paper, not a current C-Chain guarantee or benchmark.
  • “Every Avalanche network has one consensus configuration.” The Primary Network and Avalanche L1s should be distinguished; an L1 may use a different configuration.
  • “The Primary Network X-Chain still uses a DAG.” Current documentation says X-Chain was linearized through Cortina and now uses Snowman.
  • “Probabilistic means unsafe.” It describes the type of guarantee and its assumptions; readers should still examine the protocol parameters and threat model.

Social Media Sentiment

A May 2025 r/Avax thread received 11 votes and discussed common questions about why Avalanche has several chains and which chain to use. It illustrates continuing confusion about chain roles and consensus names. This is one community discussion, not a survey or a measure of all users’ views; technical claims in the thread should be checked against current documentation.

r/Avax discussion (May 8, 2025): Avalanche’s X-, P-, and C-Chain architecture

Last updated: 2026-10

Related Terms

See Also

Sources