Fast Paxos

By Leslie Lamport. Distributed computing, 2006

522 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/d2fd8a9b715fe7d0d5d8ae607c79a1b79bd87bb0

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Networks and Communications

Citations in the corpus

Site Reliability Engineering: How Google Runs Production Systems (2016, methodology): “In the Paxos protocol, for instance, acceptors cannot agree to a proposal when they have already agreed to a proposal with a higher sequence num‐ ber.”
Mencius: Building Efficient Replicated State Machine for WANs (2008, unknown): “Fast Paxos, one of the variants of Paxos [25], has been designed”
A Comprehensive Review of Blockchain Consensus Mechanisms (2021, background): “In case of collision, only a single message delay will be appended, which is still the least number of required message delays for a common consensus mechanism [130], [141], [142].”
Fast Byzantine Consensus (2006, background): “only requires two communication steps(1) in a gracious execution to reach consensus in non-Byzantine environments, matching the lower bound formalized by Keidar and Rajsbaum [8] (FastPaxos should not be confused with Lamport’s more recent “Fast Paxos” (with a space) [15] that uses a different approa”
This paper is included in the Proceedings of the 2022 USENIX Annual Technical Conference. (unknown): “Copilot is one of the protocols that leverages a “fast-path quorum” [40,45,57].”
Hybrid Consensus: Efficient Consensus in the Permissionless Model (2016, methodology): “Since classical permissioned consensus [15, 19, 21, 25, 39, 40,42,45] has been studied and optimized for decades and have been shown to achieve responsiveness against 1/3 corruptions, our idea is to use a slow blockchain protocol (called snailchain) such as Nakamoto consensus [30, 46] to bootstrap f”
NetChain: Scale-Free Sub-RTT Coordination (2018, unknown): “protocols are designed to reduce the overhead, such as Fast Paxos [42] and Optimistic Atomic Broadcast [43].”
A Secure Sharding Protocol For Open Blockchains (2016, background): “It led to a ﬂoor of work on Byzantine agreement, with many attempts to improve the efﬁciency and trade-off different aspects of the performance (e.g., [48–51]).”
There is more consensus in Egalitarian parliaments (2013, background): “Fast Paxos [18] reduces the number of message delays”