Randomized Byzantine Generals¶
Rabin, M. O. (1983). Randomized Byzantine Generals. 24th Annual Symposium on Foundations of Computer Science, 403-409.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Randomized Common-Coin Protocol
- Throughput is steady even when latency is not — the protocol never waits on a clock, so a slow link cannot masquerade as a failure and freeze it.
This sourcePresents a randomized Byzantine-agreement protocol that operates in an asynchronous distributed system without reliance on a common global clock.
- Throughput is steady even when latency is not — the protocol never waits on a clock, so a slow link cannot masquerade as a failure and freeze it.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:3ef504fe06da · see in the full table