Random message scheduling makes Byzantine consensus possible at n=2f+1 and n=f+2 with probabilistic safety, with matching impossibility results.
Sok: Consensus in the age of blockchains
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 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.