An amortized asynchronous BRB protocol maintains optimal f=n/3 resilience while achieving O(n|m|) message complexity for large messages via incremental round guarantees.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience
An amortized asynchronous BRB protocol maintains optimal f=n/3 resilience while achieving O(n|m|) message complexity for large messages via incremental round guarantees.