Next Article in Journal
Estimating the Volume of the Solution Space of SMT(LIA) Constraints by a Flat Histogram Method
Next Article in Special Issue
Cover Time in Edge-Uniform Stochastically-Evolving Graphs
Previous Article in Journal
Complexity of Hamiltonian Cycle Reconfiguration
Previous Article in Special Issue
Relaxed Data Types as Consistency Conditions

Generalized Paxos Made Byzantine (and Less Complex)

INESC-ID and Instituto Superior Técnico (Universidade de Lisboa), R. Alves Redol 9, 1000-029 Lisbon, Portugal
Department of Computer Science and Information Sciences Insititute, University of Southern California, Los Angeles, CA 90007, USA
Author to whom correspondence should be addressed.
This paper is an extended version of our paper published in SSS 2017: Stabilization, Safety, and Security of Distributed Systems, Boston, MA, USA, 5–8 November 2017.
Algorithms 2018, 11(9), 141;
Received: 26 February 2018 / Revised: 1 August 2018 / Accepted: 9 August 2018 / Published: 17 September 2018
One of the most recent members of the Paxos family of protocols is Generalized Paxos. This variant of Paxos has the characteristic that it departs from the original specification of consensus, allowing for a weaker safety condition where different processes can have a different views on a sequence being agreed upon. However, much like the original Paxos counterpart, Generalized Paxos does not have a simple implementation. Furthermore, with the recent practical adoption of Byzantine fault tolerant protocols in the context of blockchain protocols, it is timely and important to understand how Generalized Paxos can be implemented in the Byzantine model. In this paper, we make two main contributions. First, we attempt to provide a simpler description of Generalized Paxos, based on a simpler specification and the pseudocode for a solution that can be readily implemented. Second, we extend the protocol to the Byzantine fault model, and provide the respective correctness proof. View Full-Text
Keywords: Byzantine fault tolerance; consensus; Paxos Byzantine fault tolerance; consensus; Paxos
Show Figures

Figure 1

MDPI and ACS Style

Pires, M.; Ravi, S.; Rodrigues, R. Generalized Paxos Made Byzantine (and Less Complex). Algorithms 2018, 11, 141.

AMA Style

Pires M, Ravi S, Rodrigues R. Generalized Paxos Made Byzantine (and Less Complex). Algorithms. 2018; 11(9):141.

Chicago/Turabian Style

Pires, Miguel, Srivatsan Ravi, and Rodrigo Rodrigues. 2018. "Generalized Paxos Made Byzantine (and Less Complex)" Algorithms 11, no. 9: 141.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Back to TopTop