This page summarizes and analyzes David Mazières’s 2015 technical paper. It is not the current Stellar Core specification, a guarantee about today’s validator configuration, or investment advice. Read the linked paper and current documentation for implementation details.
| Author | David Mazières |
|---|---|
| Title | The Stellar Consensus Protocol: A Federated Model for Internet-Level Consensus |
| Year | 2015 |
| Project | Stellar |
| License | Creative Commons Attribution 4.0 International (CC BY 4.0) |
| Official paper | Stellar Development Foundation paper (PDF) |
The paper introduces the Stellar Consensus Protocol (SCP), a construction for Federated Byzantine Agreement (FBA). Its core idea is that each participant chooses whom to trust for agreement. The paper studies how those local choices can combine into a network that reaches a shared decision without requiring one authority to publish a fixed, universal validator list.
The Problem the Paper Addresses
A distributed payment network needs its nodes to agree on which transactions to apply. A fixed-membership Byzantine fault-tolerant system can define one validator group in advance, but that creates a membership authority. Proof of Work instead uses computational work to make participation open, with substantial energy and hardware costs. Mazières asks how participants can choose their own trust relationships while still having formal safety and progress guarantees.
SCP is not a claim that trust disappears. The trust assumptions are represented explicitly through quorum choices. That makes them inspectable, but it also means the network’s properties depend on how participants configure those choices and on which nodes remain responsive.
Quorum Slices, Quorums, and Agreement
Each node specifies one or more quorum slices: groups of nodes whose support is sufficient for that node to proceed. A node’s operator chooses its quorum set and threshold. A quorum is a set of nodes that contains, for every member, at least one quorum slice of that member. This is a network structure that emerges from local choices rather than a single global validator roster.
The central safety concept is quorum intersection: every pair of quorums must overlap. If two disjoint groups can each form a quorum, they could accept conflicting statements without hearing from each other. Even overlap is not automatically enough if the shared nodes are Byzantine; the paper analyzes whether the well-behaved nodes still have the required intersection after ill-behaved nodes are considered.
For this reason, “anyone can run a node” and “every node has equal influence” are different claims. A node can participate in the software network, but its statements matter to a particular quorum only if other nodes’ slices depend on it. Validator counts alone do not describe the trust graph.
Nomination and Balloting
SCP organizes consensus for a ledger slot into two cooperating protocols. The nomination protocol proposes transaction-set candidates and helps nodes converge on a value to consider. The ballot protocol then establishes agreement on a value using ballots with counters. Nodes prepare a ballot, commit it when the required quorum support is present, and externalize the value once agreement is established. Nomination can continue while ballot agreement proceeds.
This is more precise than saying validators simply “vote on a block.” The protocol carries statements through stages such as vote, accept, confirm, prepare, commit, and externalize. Nodes use their own quorum slices to evaluate those statements. The paper provides formal definitions and proofs; the sequence above is a plain-language map, not a substitute for the protocol specification.
What the Safety Claim Depends On
Safety means nodes do not externalize conflicting values for the same slot. The paper’s result depends on the quorum structure and on assumptions about well-behaved nodes; it does not say that every arbitrary set of validator configurations is safe. There is no universal rule that SCP tolerates one third of every quorum being Byzantine. Fault tolerance depends on the actual quorum slices and which nodes are faulty.
Liveness means the network can make progress. Safety and liveness are separate: a system may preserve agreement while some nodes wait because the quorum relationships they need are unavailable. Stellar’s current documentation describes SCP as prioritizing safety over liveness when nodes cannot reach agreement. Quorum intersection is necessary for safety, but by itself it does not guarantee that a reachable quorum can make progress.
How the Paper Relates to the Stellar Network
The paper is a 2015 foundation for SCP, not a snapshot of the current Stellar validator graph or a description of every later implementation detail. Current Stellar Core documentation still describes nodes selecting quorum sets and thresholds, and gives operators tools to monitor quorum health. Those live settings can change; the paper’s proofs should not be read as a measurement of today’s decentralization or uptime.
SCP does not weight consensus by Proof-of-Work or token stake. A validator’s influence comes from the trust relationships encoded in the quorum configuration, not from how much XLM it locks. Stellar’s developer documentation also says validator participation has no built-in monetary reward. These design choices avoid mining and staking as consensus mechanisms, while putting more weight on transparent quorum configuration, independent operators, and operational reliability.
Trade-offs and Independent Criticism
Federated membership makes it possible for operators to choose whom they trust, but that flexibility transfers responsibility to the trust graph. Poorly connected or overly concentrated slices can make progress depend on a small set of nodes. A node may be technically open to join while having little effect on consensus if established quorums do not include it. Monitoring and reviewing quorum sets are therefore part of the security model, not optional decoration.
An independent 2019 study analyzed Stellar’s then-observed quorum slices and argued that concentration could create cascading liveness failures. Its measurements describe a historical network snapshot from 2019, not the present network; they are useful as a warning about configuration risk, not current validator statistics. Stellar’s own documentation similarly emphasizes checking quorum intersection and monitoring node health. A balanced reading is that SCP formalizes a flexible consensus model, while its practical resilience depends on the network that operators actually configure.
Conclusion
The paper’s contribution is a formal way to reason about open membership through local trust choices. Quorum slices form quorums; the relationship among those quorums determines whether nodes can preserve safety and make progress. The protocol is neither “trustless” nor automatically decentralized just because anyone can run a node. To evaluate a live network, examine its current quorum configuration, operator independence, monitoring, and failure assumptions separately from the 2015 paper.
Social Media Sentiment
Two sampled r/Stellar discussions show why SCP can be hard to explain in a sentence. A 2022 thread about decentralization focused on whether a large validator count translates into meaningful independent influence. A 2025 scaling discussion included questions about validator numbers and centralization; replies emphasized that SCP uses chosen trust sets rather than stake-weighted participation. These small, self-selected threads show recurring interest in openness, practical influence, and performance trade-offs. They are not representative surveys and do not establish the current state of the network.
Last updated: 2026-10
Related Terms
See Also
- Bitcoin: A Peer-to-Peer Electronic Cash System
- The Ripple Protocol Consensus Algorithm
- Snowflake to Avalanche: A Novel Metastable Consensus Protocol Family for Cryptocurrencies
Directories
Sources
- Mazières, D. (2015). The Stellar Consensus Protocol: A Federated Model for Internet-Level Consensus. Stellar Development Foundation. Official paper (PDF). The primary source for SCP, quorum slices, safety, liveness, nomination, and ballot protocols.
- Stellar Development Foundation. Overview of the Stellar Consensus Protocol (SCP) and Transaction Validation. Current developer documentation. Explains quorum sets, thresholds, protocol stages, and the safety/liveness trade-off.
- Stellar Development Foundation. Monitoring. Validator monitoring guide. Describes quorum health checks and what a node’s local status can and cannot tell an operator.
- Kim, M., Kwon, Y., & Kim, Y. (2019). Is Stellar As Secure As You Think? arXiv:1904.13302. Research paper. An independent analysis of quorum-slice structure using a 2019 network snapshot; not current validator data.
- r/Stellar. How is Stellar decentralized? (January 2022). Community discussion. Illustrates questions about validator counts, quorum trust, and practical influence.
- r/Stellar. Stellar: The Road to 5000 TPS—Scaling Stellar in 2025 (July 2025). Community discussion. Includes questions about validator counts, centralization, and the relationship between trust sets and performance.