• Corpus ID: 10674564

The Stellar Consensus Protocol: A Federated Model for Internet-level Consensus

  title={The Stellar Consensus Protocol: A Federated Model for Internet-level Consensus},
  author={David Mazi{\`e}res},
This paper introduces a new model for consensus called federated Byzantine agreement (FBA). FBA achieves robustness through quorum slices—individual trust decisions made by each node that together determine system-level quorums. Slices bind the system together much the way individual networks’ peering and tran- sit decisions now unify the Internet. We also present the Stellar Consensus Protocol (SCP), a construction for FBA. Like all Byzantine agree- ment protocols, SCP makes no assumptions… 
The Sum of Its Parts: Analysis of Federated Byzantine Agreement Systems
This paper demonstrates how the robustness of individual FBASs can be determined, by precisely determining their safety and liveness buffers and therefore enabling a comparison with threshold-based quorum systems and investigates the reported “open-membership” property ofFBASs.
The Flare Consensus Protocol is a new construction of Federated Byzantine Agreement consensus that is both leaderless and totally-ordered, making it excessively difficult for an attacker to influence which of two transactions will be ordered first in a transaction set.
Avalanche : The Power of Metastable Consensus Team Rocket
  • Computer Science
  • 2018
A new family of leaderless Byzantine fault tolerance protocols, built around a metastable mechanism, that provide a strong probabilistic safety guarantee in the presence of Byzantine adversaries, while their concurrent nature enables them to achieve high throughput and scalability.
A State-Space Modeling Framework for Engineering Blockchain-Enabled Economic Systems
A formal framework is established, with tools from dynamical systems theory, to mathematically describe core concepts in blockchain-enabled networks and is applied to the Bitcoin network and recovers its key properties.
Asymmetric Byzantine Consensus
This work shows how to realize consensus protocols with asymmetric trust in partially synchronous systems; it generalizes the consensus algorithm underlying PBFT and uses digital signatures, and achieves optimal resilience.
Federated Byzantine Agreement to Ensure Trustworthiness of Digital Manufacturing Platforms
In this paper, we explore the use of the Stellar Consensus Protocol (SCP) and its Federated Byzantine Agreement (FBA) algorithm for ensuring trust and reputation between federated, cloud-based
Scalable and Probabilistic Leaderless BFT Consensus through Metastability
A family of leaderless Byzantine fault tolerance protocols, built around a metastable mechanism via network subsampling, that provide a strong probabilistic safety guarantee in the presence of Byzantine adversaries while their concurrent and leaderless nature enables them to achieve high throughput and scalability.
Federated Byzantine Quorum Systems (Extended Version)
It is shown that this setting leads to a novel variant of Byzantine quorum systems where different nodes may have different understanding of what constitutes a quorum, and correctness in the realistic setting where Byzantine nodes may lie about their trust choices is proved.
Guru: Universal Reputation Module for Distributed Consensus Protocols
In this paper we describe how to couple reputation systems with distributed consensus protocols to provide high-throughput highly-scalable consensus for large peer-to-peer networks of untrusted
Oort: Stellar Consensus Protocol Implementation
The 6.824 MIT Distributed Systems class final project wrote their own implementation of the Stellar Consensus Protocol, working from the whitepaper[5] and not the existing implementation, which is a design of a Federated Byzantine Agreement System, a consensus protocol which relies on reputation-based majority agreement for security rather than proof-of-work.


The Ripple Protocol Consensus Algorithm
This work presents a novel consensus algorithm that circumvents the requirement that all nodes within the network communicate synchronously by utilizing collectively-trusted subnetworks within the larger network and shows that minimal connectivity is required to maintain agreement throughout the whole network.
Byzantine Consensus with Unknown Participants
A solution for BFT-CUP that does not require digital signatures is presented and the algorithms are shown to be optimal in terms of synchrony and knowledge connectivity among participants in the system.
Bitcoin: A Peer-to-Peer Electronic Cash System
This work proposes a solution to the double-spending problem using a peer-to-peer network, where the network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof- of-work.
In Search of an Understandable Consensus Algorithm
Raft is a consensus algorithm for managing a replicated log that separates the key elements of consensus, such as leader election, log replication, and safety, and it enforces a stronger degree of coherency to reduce the number of states that must be considered.
PPCoin: Peer-to-Peer Crypto-Currency with Proof-of-Stake
Under this hybrid design proof-of-work mainly provides initial minting and is largely non-essential in the long run thus providing an energyefficient and more cost-competitive peer-to-peer crypto-currency.
Asynchronous consensus and broadcast protocols
The class of asynchronous systems with fair schedulers is defined, and consensus protocols that terminate with probability 1 for these systems are investigated, and it is shown that correct processes are necessary and sufficient to achieve Byzantine Agreement.
Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems
This paper argues that BFT2F, an extension to the well-known Castro-Liskov PBFT algorithm, can and should bound the system behavior beyond f failures, and has the same liveness and consistency guarantees as PBFT when no more than f replicas fail.
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
This work exhibits a probabilistic solution for this problem, which guarantees that as long as a majority of the processes continues to operate, a decision will be made (Theorem 1).
NeuCoin: The First Secure, Cost-Efficient and Decentralized Cryptocurrency
This paper demonstrates how NeuCoin’s proof-of-stake implementation addresses all commonly raised “nothing at stake” objections to generic proof- of-Stake systems, and reviews many of the flaws of proof-Of-work designs to highlight the potential for an alternate cryptocurrency that solves these flaws.
Accountable key infrastructure (AKI): a proposal for a public-key validation infrastructure
This paper proposes AKI as a new public-key validation infrastructure, to reduce the level of trust in CAs, and proposes an architecture for key revocation of all entities through checks-and-balances.