English
Related papers

Related papers: Consensus on Demand

200 papers

With the continuous expansion of blockchain application scenarios, consortium chains have raised higher performance and security requirements for consensus mechanisms. Unlike public blockchains, consortium chains typically implement an…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-20 Wen Gao , Xinhong Hei , Yichuan Wang

It is commonly held that asynchronous consensus is much more complex, difficult, and costly than partially-synchronous algorithms, especially without using common coins. This paper challenges that conventional wisdom with que sera consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-03-06 Bryan Ford , Philipp Jovanovic , Ewa Syta

We consider the problem of approximate consensus in mobile networks containing Byzantine nodes. We assume that each correct node can communicate only with its neighbors and has no knowledge of the global topology. As all nodes have moving…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-06-04 Chuanyou Li , Michel Hurfin , Yun Wang

This work addresses the inherent issues of high latency in blockchains and low scalability in traditional consensus protocols. We present pod, a novel notion of consensus whose first priority is to achieve the physically-optimal latency of…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-05 Orestis Alpos , Bernardo David , Jakov Mitrovski , Odysseas Sofikitis , Dionysis Zindros

We propose a novel relaxation of the classic asynchronous network model, called the random asynchronous model, which removes adversarial message scheduling while preserving unbounded message delays and Byzantine faults. Instead of an…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-27 George Danezis , Jovan Komatovic , Lefteris Kokoris-Kogias , Alberto Sonnino , Igor Zablotchi

Byzantine Consensus is fundamental for building consistent and fault-tolerant distributed systems. In traditional quorum-based consensus protocols, quorums are defined using globally known assumptions shared among all participants.…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-06-26 Robin Vassantlal , Hasan Heydari , Alysson Bessani

Cordial Miners are a family of efficient Byzantine Atomic Broadcast protocols, with instances for asynchrony and eventual synchrony. They improve the latency of state-of-the-art DAG-based protocols by almost 2X and achieve optimal good-case…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-02-14 Idit Keidar , Oded Naor , Ouri Poupko , Ehud Shapiro

In distributed systems, a group of $\textit{learners}$ achieve $\textit{consensus}$ when, by observing the output of some $\textit{acceptors}$, they all arrive at the same value. Consensus is crucial for ordering transactions in…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-12-14 Isaac Sheff , Xinwen Wang , Robbert van Renesse , Andrew C. Myers

Avalanche is a blockchain consensus protocol with exceptionally low latency and high throughput. This has swiftly established the corresponding token as a top-tier cryptocurrency. Avalanche achieves such remarkable metrics by substituting…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-10 Ignacio Amores-Sesar , Christian Cachin , Enrico Tedeschi

This paper introduces Carbon, a high-throughput system enabling asynchronous (safe) and consensus-free (efficient) payments and votes within a dynamic set of clients. Carbon is operated by a dynamic set of validators that may be…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-16 Martina Camaioni , Rachid Guerraoui , Jovan Komatovic , Matteo Monti , Pierre-Louis Roman , Manuel Vidigueira , Gauthier Voron

A problem of developing the consensus protocols in public blockchain systems which spend a combination of energy and space resources is addressed. A technique is proposed that provides a flexibility for selection of the energy and space…

Cryptography and Security · Computer Science 2019-11-19 Miodrag J. Mihaljevic

Byzantine fault tolerance (BFT) consensus is a fundamental primitive for distributed computation. However, BFT protocols suffer from the ordering manipulation, in which an adversary can make front-running. Several protocols are proposed to…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-20 Guangren Wang , Liang Cai , Fangyu Gai , Jianyu Niu

Blockchain technology sparked renewed interest in planetary-scale Byzantine fault-tolerant (BFT) state machine replication (SMR). While recent works predominantly focused on improving the scalability and throughput of these protocols, few…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-01 Christian Berger , Lívio Rodrigues , Hans P. Reiser , Vinicius Cogo , Alysson Bessani

Many aspects of blockchain-based decentralized finance can be understood as an extension of classical distributed computing. In this paper, we trace the evolution of two interrelated notions: failure and fault-tolerance. In classical…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-09-28 Daniel Engel , Maurice Herlihy , Yingjie Xue

The Hashgraph consensus algorithm is an algorithm for asynchronous Byzantine fault tolerance intended for distributed shared ledgers. Its main distinguishing characteristic is it achieves consensus without exchanging any extra messages;…

Logic in Computer Science · Computer Science 2026-02-24 Karl Crary

Fault tolerant consensus protocols usually involve ordered rounds of voting between a collection of processes. In this paper, we derive a general specification of fault tolerant asynchronous consensus protocols and present a class of…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-29 Robbert van Renesse

We present Accept, a simple, asynchronous transaction system that achieves perfect horizontal scaling. Usual blockchain-based transaction systems come with a fundamental throughput limitation as they require that all (potentially unrelated)…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-08-12 Max Mathys , Roland Schmid , Jakub Sliwinski , Roger Wattenhofer

Current digital payment solutions are fragile and offer less privacy than traditional cash. Their critical dependency on an online service used to perform and validate transactions makes them void if this service is unreachable. Moreover,…

Cryptography and Security · Computer Science 2024-07-22 Leon Kempen , Johan Pouwelse

Decentralized finance revolutionizes traditional financial systems by leveraging blockchain technology to reduce trust. However, some vulnerabilities persist, notably front-running by malicious actors who exploit transaction information to…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-18 Christian Cachin , Jovana Micic

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

Distributed, Parallel, and Cluster Computing · Computer Science 2016-08-30 Lewis Tseng