The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The next 700 BFT protocols
Open accessAbstract
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20,000 lines of challenging C++ code encompassing synchronization, networking and cryptography. They are notoriously difficult to develop, test and prove. We present a new abstraction to simplify these tasks. We treat a BFT protocol as a composition of instances of our abstraction. Each instance is developed and analyzed independently.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
A Survey of Distributed Consensus Protocols for Blockchain Networks
Xiao, Y., Zhang, N., Lou, W., & Hou, Y. T. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2969706 · Cited by 841
Survey on blockchain for Internet of Things
Wang, X., Zha, X., Ni, W., Liu, R. P., Guo, Y. J., Niu, X., & Zheng, K. (2019) · Computer Communications · doi:10.1016/j.comcom.2019.01.006 · Cited by 567
State Machine Replication for the Masses with BFT-SMART
Bessani, A., Sousa, J., & Alchieri, E. E. P. (2014) · 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks · doi:10.1109/dsn.2014.43 · Cited by 567
Security and Privacy for Green IoT-Based Agriculture: Review, Blockchain Solutions, and Challenges
Ferrag, M. A., Shu, L., Yang, X., Derhab, A., & Maglaras, L. (2020) · IEEE Access · doi:10.1109/access.2020.2973178 · Cited by 449
A Scalable Multi-Layer PBFT Consensus for Blockchain
Li, W., Feng, C., Zhang, L., Xu, H., Cao, B., & Imran, M. A. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.3042392 · Cited by 442
Metadata
- Authors
- Guerraoui, R., Knežević, N., Quéma, V., & Vukolić, M.
- Venue
- Proceedings of the 5th European conference on Computer systems
- Publisher
- ACM
- Published
- 2010-04-13
- Pages
- 363-376
- OpenAlex
- W1965159636
- Cited by
- 219
- References
- 1
- FWCI
- 14.46
- Type
- conference paper
- 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/1755913.1755950
- The paper
- Guerraoui, R., Knežević, N., Quéma, V., & Vukolić, M. (2010). The next 700 BFT protocols. Proceedings of the 5th European conference on Computer systems. https://doi.org/10.1145/1755913.1755950
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.