Generalized Paxos made Byzantine (and less complex) (Q2633262)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalized Paxos made Byzantine (and less complex) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized Paxos made Byzantine (and less complex) |
scientific article |
Statements
Generalized Paxos made Byzantine (and less complex) (English)
0 references
8 May 2019
0 references
Summary: One of the most recent members of the \textit{Paxos} family of protocols is \textit{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.
0 references
Byzantine fault tolerance
0 references
consensus
0 references
Paxos
0 references