Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 293

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

An asynchronous [(n - 1)/3]-resilient consensus protocol

Open access
Bracha, Gabriel·1984·Proceedings of the third annual ACM symposium on Principles of distributed computing - PODC '84

Abstract

A consensus protocol enables a system of n asynchronous processes, some of them malicious, to reach agreement. No assumptions are made on the behaviour of the processes and the message system; both are capable of colluding to prevent the correct processes from reaching decision. A protocol is t-resilient if in the presence of up to t malicious processes it reaches agreement with probability 1. In a recent paper, t-resilient consensus protocols were presented for t<n/5. We improve this to t

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/800222.806743

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 293

Metadata

Authors
Bracha, G.
Venue
Proceedings of the third annual ACM symposium on Principles of distributed computing - PODC '84
Publisher
ACM Press
Published
1984
Pages
154-162
OpenAlex
W2054694168
Cited by
293
References
2
FWCI
4.48
Type
conference paper
Language
en
Open access
bronze

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: An asynchronous [(n - 1)/3]-resilient consensus protocol. https://app.cochat.ai/papers/10.1145/800222.806743
The paper
Bracha, G. (1984). An asynchronous [(n - 1)/3]-resilient consensus protocol. Proceedings of the third annual ACM symposium on Principles of distributed computing - PODC '84. https://doi.org/10.1145/800222.806743

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.