English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper explores the problem good-case latency of Byzantine fault-tolerantbroadcast, motivated by the real-world latency and performance of practicalstate machine replication protocols. The good-case latency measures the time ittakes for all non-faulty parties to commit when the designated broadcaster isnon-faulty. We provide a complete characterization of tight bounds on good-caselatency, in the authenticated setting under synchrony, partial synchrony andasynchrony. Some of our new results may be surprising, e.g., 2-round PBFT-stylepartially synchronous Byzantine broadcast is possible if and only if $n\geq5f-1$, and a tight bound for good-case latency under $n/3<f<n/2$ undersynchrony is not an integer multiple of the delay bound.

Good-case Latency of Byzantine Broadcast: A Complete Categorization