Random message scheduling makes Byzantine consensus possible at n=2f+1 and n=f+2 with probabilistic safety, with matching impossibility results.
Are lock-free concurrent algorithms practically wait-free? J
1 Pith paper cite this work, alongside 7 external citations. Polarity classification is still indexing.
1
Pith paper citing it
7
external citations · OpenAlex
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Byzantine Consensus in the Random Asynchronous Model
Random message scheduling makes Byzantine consensus possible at n=2f+1 and n=f+2 with probabilistic safety, with matching impossibility results.