Adaptive Byzantine Agreement with O(nf) messages and O(f) rounds is possible with optimal resilience, and asynchronous agreement is shown to require Omega(n+t^2) messages.
hub
Title resolution pending
1 Pith paper cite this work, alongside 1,796 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1,796
external citations · OpenAlex
hub tools
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
From Few to Many Faults: Optimal Adaptive Byzantine Agreement
Adaptive Byzantine Agreement with O(nf) messages and O(f) rounds is possible with optimal resilience, and asynchronous agreement is shown to require Omega(n+t^2) messages.