Classic synchronous consensus algorithms are leaderless in that processes exchange
proposals, choose the maximum value and decide when they see the same choice across a …

Fault-tolerant consensus has been studied extensively in the literature, because it is one of
the important distributed primitives and has wide applications in practice. This paper surveys …

Blockchains are distributed secure ledgers to which transactions are issued continuously
and each block of transactions is tightly coupled to its predecessors. Permissioned …

Algorithms to solve fault-tolerant consensus in asynchronous systems often rely on
primitives such as crusader agreement, adopt-commit, and graded broadcast, which provide …

This paper introduces a deterministic Byzantine consensus algorithm that relies on a new
weak coordinator. As opposed to previous algorithms that cannot terminate in the presence …

Similarly to the injunction “Know yourself” engraved on the frontispiece of Delphi's temple
more than two millennia ago, the sentence “Make it as simple as possible, but not …

The scalability challenge in consensus methods based on Proof of Work (POW) has led to
the popularity of voting-based consensus methods. Practical Byzantine Fault Tolerance …

Until now, computer-aided proofs of the liveness of byzantine consensus algorithms
assumed synchrony to reason in lock steps or the error-prone manual intervention of experts …

Abstract k-Set agreement is a central problem of fault-tolerant distributed computing.
Considering a set of n processes, where up to t may commit failures, let us assume that each …

Algorithms to solve fault-tolerant consensus in asynchronous systems often rely on
primitives such as crusader agreement, adopt-commit, and graded broadcast, which provide …