The Next 700 BFT Protocols
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for designing and reconfiguring generalized replicated state machines that are, unlike traditional state machines, allowed to abort executing a client’s request if “something goes wrong.” Abstract can be used to considerably simplify the incremental development of efficient Byzantine fault-tolerant state machine replication ( BFT ) protocols that are notorious for being difficult to develop. In short, we treat a BFT protocol as a composition of Abstract instances. Each instance is developed and analyzed independently and optimized for specific system conditions. We illustrate the power of Abstract through several interesting examples. We first show how Abstract can yield benefits of a state-of-the-art BFT protocol in a less painful and error-prone manner. Namely, we develop AZyzzyva , a new protocol that mimics the celebrated best-case behavior of Zyzzyva using less than 35% of the Zyzzyva code. To cover worst-case situations, our abstraction enables one to use in AZyzzyva any existing BFT protocol. We then present Aliph , a new BFT protocol that outperforms previous BFT protocols in terms of both latency (by up to 360%) and throughput (by up to 30%). Finally, we present R-Aliph , an implementation of Aliph that is robust , that is, whose performance degrades gracefully in the presence of Byzantine replicas and Byzantine clients.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider, F. B. (1990) · ACM Computing Surveys · doi:10.1145/98163.98167 · Cited by 2,387
Research works printed but not linked: 33
- 10.1145/1095810.1095817 · DOI · Paper page
- 10.1145/1281100.1281107 · doi:10.1145/1281100.1281107
- 10.1109/TDSC.2010.70 · DOI · Paper page
- 10.1007/11561927_11 · doi:10.1007/11561927_11
- 10.1145/637437.637447 · DOI
- 10.5555/645768.667612 · doi:10.5555/645768.667612
- 10.1145/859716.859718 · DOI
- 10.1145/1281100.1281103 · DOI · Paper page
- Allen Clement , Edmund Wong , Lorenzo Alvisi , Mike Dahlin , and Mirco Marchetti . 2009 . Making Byzantine fault tolerant systems tolerate Byzantine faults . In Proceedings of the Symposium on Networked Systems Design and Implementation (NSDI’09) . Allen Clement, Edmund Wong, Lorenzo Alvisi, Mike Dahlin, and Mirco Marchetti. 2009. Making Byzantine fault tolerant systems tolerate Byzantine faults. In Proceedings of the Symposium on Networked Systems Design and Implementation (NSDI’09).
- James Cowling , Daniel Myers , Barbara Liskov , Rodrigo Rodrigues , and Liuba Shrira . 2006 . HQ replication: A hybrid quorum protocol for Byzantine fault tolerance . In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI’06) . USENIX Association. http://portal.acm.org/citation.cfm?id=1298455.1298473. James Cowling, Daniel Myers, Barbara Liskov, Rodrigo Rodrigues, and Liuba Shrira. 2006. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI’06). USENIX Association. http://portal.acm.org/citation.cfm?id=1298455.1298473.
- 10.1109/DSN.2006.55 · DOI
- 10.1145/42282.42283 · DOI · Paper page
- 10.1145/3149.214121 · DOI · Paper page
- 10.1109/DSN.2011.5958251 · DOI
- 10.1109/TDSC.2007.70208 · DOI
- Jim Gray . 1978. Notes on data base operating systems . In Operating Systems—An Advanced Course . Springer-Verlag , 393--481. http://dl.acm.org/citation.cfm?id=647433.723863 Jim Gray. 1978. Notes on data base operating systems. In Operating Systems—An Advanced Course. Springer-Verlag, 393--481. http://dl.acm.org/citation.cfm?id=647433.723863
- 10.1145/1755913.1755950 · DOI · Paper page
- 10.1145/1294261.1294269 · DOI
- 10.1145/78969.78972 · DOI · Paper page
- 10.1145/872035.872079 · doi:10.1145/872035.872079
- 10.1145/2168836.2168866 · DOI · Paper page
- 10.1145/1658357.1658358 · DOI · Paper page
- 10.1007/3-540-37795-6_4 · DOI
- 10.1007/978-3-642-03466-4_2 · DOI
- 10.1145/1753171.1753191 · DOI
- 10.1109/2.970581 · doi:10.1109/2.970581
- Bianca Schroeder , Adam Wierman , and Mor Harchol-Balter . 2006 . Open versus closed: A cautionary tale . In Proceedings of the Symposium on Networked Systems Design and Implementation (NSDI). 18--18 . Bianca Schroeder, Adam Wierman, and Mor Harchol-Balter. 2006. Open versus closed: A cautionary tale. In Proceedings of the Symposium on Networked Systems Design and Implementation (NSDI). 18--18.
- Atul Singh , Tathagata Das , Petros Maniatis , Peter Druschel , and Timothy Roscoe . 2008 . BFT protocols under fire . In Proceedings of the Symposium on Networked Systems Design and Implementation (NSDI’08) . USENIX Association. Atul Singh, Tathagata Das, Petros Maniatis, Peter Druschel, and Timothy Roscoe. 2008. BFT protocols under fire. In Proceedings of the Symposium on Networked Systems Design and Implementation (NSDI’08). USENIX Association.
- 10.1145/800222.806744 · DOI
- Robbert van Renesse and Rachid Guerraoui . 2010. Replication techniques for availability . In Replication, B. Charron-Bost, F. Pedone, and A. Schiper (Eds.). Springer-Verlag , 19--40. http://dl.acm.org/citation.cfm?id=2172338.2172340" Robbert van Renesse and Rachid Guerraoui. 2010. Replication techniques for availability. In Replication, B. Charron-Bost, F. Pedone, and A. Schiper (Eds.). Springer-Verlag, 19--40. http://dl.acm.org/citation.cfm?id=2172338.2172340"
- Robbert van Renesse and Fred B. Schneider . 2004. Chain replication for supporting high throughput and availability . In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI’04) . Robbert van Renesse and Fred B. Schneider. 2004. Chain replication for supporting high throughput and availability. In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI’04).
- 10.1109/SRDS.2009.36 · DOI · Paper page
- 10.1109/TC.2011.221 · DOI · Paper page
Cited by
Hyperledger fabric: a distributed operating system for permissioned blockchains
Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De Caro, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. (2018) · Proceedings of the Thirteenth EuroSys Conference · doi:10.1145/3190508.3190538 · Cited by 3,654
Self-citationA Secure Sharding Protocol For Open Blockchains
Luu, L., Narayanan, V., Zheng, C., Baweja, K., Gilbert, S., & Saxena, P. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978389 · Cited by 1,428
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
Vukolić, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-39028-4_9 · Cited by 1,051
“Clearly, large batches negatively impact latency, but this could be addressed by Hybrid BFT protocols [2] that may combine very efficient optimistic and deterministic BFT protocols (e.g., those described in [3]) with practical randomized protocols such as HoneyBadger.”
InfluentialSelf-citationHotStuff: BFT Consensus with Linearity and Responsiveness
Yin, M., Malkhi, D., Reiter, M. K., Gueta, G. G., & Abraham, I. (2019) · Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing · doi:10.1145/3293611.3331591 · Cited by 1,028
Hyperledger Fabric: A Distributed Operating System for Permissioned Blockchains
Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.10228 · Cited by 499
Self-citation
Metadata
- Authors
- Aublin, P.-L., Guerraoui, R., Knežević, N., Quéma, V., & Vukolić, M.
- Venue
- ACM Transactions on Computer Systems
- Published
- 2015-01-20
- Volume
- 32
- Issue
- 4
- Pages
- 1-45
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2124037649
- Cited by
- 135
- References
- 2
- FWCI
- 12.28
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Next 700 BFT Protocols. https://app.cochat.ai/papers/10.1145/2658994
- The paper
- Aublin, P.-L., Guerraoui, R., Knežević, N., Quéma, V., & Vukolić, M. (2015). The Next 700 BFT Protocols. ACM Transactions on Computer Systems. https://doi.org/10.1145/2658994
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.