The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Zyzzyva: speculative byzantine fault tolerance
Abstract
We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond to a client's request without first running an expensive three-phase commit protocol to reach agreement on the order in which the request must be processed. Instead, they optimistically adopt the order proposed by the primary and respond immediately to the client. Replicas can thus become temporarily inconsistent with one another, but clients detect inconsistencies, help correct replicas converge on a single total ordering of requests, and only rely on responses that are consistent with this total order. This approach allows Zyzzyva to reduce replication overheads to near their theoretical minimal.
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
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Linearizability: a correctness condition for concurrent objects
Herlihy, M. P., & Wing, J. M. (1990) · ACM Transactions on Programming Languages and Systems · doi:10.1145/78969.78972 · Cited by 3,176
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
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
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Cited by
Liu, M., Yu, F. R., Teng, Y., Leung, V. C. M., & Song, M. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2897805 · Cited by 365
A survey on security and privacy issues of blockchain technology
Prashanth Joshi, A., K. S. U., Han, M., & Wang, Y. (2018) · Mathematical Foundations of Computing · doi:10.3934/mfc.2018007 · Cited by 362
DeepCoin: A Novel Deep Learning and Blockchain-Based Energy Exchange Framework for Smart Grids
Ferrag, M. A., & Maglaras, L. (2020) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2019.2922936 · Cited by 358
Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing
Kokoris-Kogias, E., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., & Ford, B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.06997 · Cited by 309
A Survey of IoT Applications in Blockchain Systems: Architecture, Consensus, and Traffic Modeling
Lao, L., Li, Z., Hou, S., Xiao, B., Guo, S., & Yang, Y. (2021) · ACM Computing Surveys · doi:10.1145/3372136 · Cited by 304
Metadata
- Authors
- Kotla, R., Alvisi, L., Dahlin, M., Clement, A., & Wong, E.
- Venue
- Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
- Publisher
- ACM
- Published
- 2007-10-14
- Pages
- 45-58
- OpenAlex
- W2139359217
- Cited by
- 638
- References
- 50
- FWCI
- 24.83
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Zyzzyva: speculative byzantine fault tolerance. https://app.cochat.ai/papers/10.1145/1294261.1294267
- The paper
- Kotla, R., Alvisi, L., Dahlin, M., Clement, A., & Wong, E. (2007). Zyzzyva: speculative byzantine fault tolerance. Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles. https://doi.org/10.1145/1294261.1294267
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.