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 introduces a deterministic Byzantine consensus algorithm thatrelies on a new weak coordinator. As opposed to previous algorithms that cannotterminate in the presence of a faulty or slow coordinator, our algorithm canterminate even when its coordinator is faulty, hence the name weak coordinator.The key idea is to allow processes to complete asynchronous rounds as soon asthey receive a threshold of messages, instead of having to wait for a messagefrom a coordinator that may be slow.  The resulting algorithm assumes partial synchrony, is resilience optimal,time optimal and does not need signatures. Our presentation is didactic: wefirst present a simple safe binary Byzantine consensus algorithm, modify it toensure termination, and finally present an optimized reduction from multivalueconsensus to binary consensus that may terminate in 4 message delays. Toevaluate our algorithm, we deployed it on 100 machines distributed in 5datacenters across different continents and compared its performance againstthe randomized solution from Mostefaoui, Moumem and Raynal [PODC14] thatterminates in O(1) rounds in expectation. Our algorithm always outperforms thelatter even in the presence of Byzantine behaviors. Our algorithm has asubsecond average latency in most of our geo-distributed experiments, even whenattacked by a well-engineered coalition of Byzantine processes.

DBFT: Efficient Byzantine Consensus with a Weak Coordinator and its Application to Consortium Blockchains