English
Related papers

Related papers: Blockmania: from Block DAGs to Consensus

200 papers

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

Byzantine Fault Tolerant (BFT) consensus protocols for dynamically available systems face a critical challenge: balancing latency and security in fluctuating node participation. Existing solutions often require multiple rounds of voting per…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-04 Pengkun Ren , Hai Dong , Zahir Tari , Pengcheng Zhang

The problem of Byzantine consensus has been key to designing secure distributed systems. However, it is particularly difficult, mainly due to the presence of Byzantine processes that act arbitrarily and the unknown message delays in general…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-04-20 Alejandro Ranchal-Pedrosa , Vincent Gramoli

The XRP Ledger Consensus Protocol is a previously developed consensus protocol powering the XRP Ledger. It is a low-latency Byzantine agreement protocol, capable of reaching consensus without full agreement on which nodes are members of the…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-02-21 Brad Chase , Ethan MacBrough

Low latency is one of the most desirable features of partially synchronous Byzantine consensus protocols. Existing low-latency protocols have achieved consensus with just two communication steps by reducing the maximum number of faults the…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-30 Mohammad M. Jalalzai , Chen Feng , Victoria Lemieux

To implement a blockchain, the trend is now to integrate a non-trivial Byzantine fault tolerant consensus algorithm instead of the seminal idea of waiting to receive blocks to decide upon the longest branch. After a decade of existence,…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-10-16 Pierre Tholoniat , Vincent Gramoli

To achieve high throughput in the POW based blockchain systems, researchers proposed a series of methods, and DAG is one of the most active and promising fields. We designed and implemented the StreamNet, aiming to engineer a scalable and…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-09 Zhaoming Yin , Anbang Ruan , Ming Wei , Huafeng Li , Kai Yuan , Junqing Wang , Yahui Wang , Ming Ni , Andrew Martin

In this paper we extend the \emph{Multidimensional Byzantine Agreement (MBA) Protocol}, a {leaderless} Byzantine agreement for lists of arbitrary values, into a protocol suitable for wide gossiping networks: \emph{Cob}. This generalization…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-02-11 Andrea Flamini , Riccardo Longo , Alessio Meneghetti

Distributed consensus is a key enabler for many distributed systems including distributed databases and blockchains. Canopus is a scalable distributed consensus protocol that ensures that live nodes in a system agree on an ordered sequence…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-06-18 S. Keshav , W. Golab , B. Wong , S. Rizvi , S. Gorbunov

The paper presents Tendermint, a new protocol for ordering events in a distributed network under adversarial conditions. More commonly known as Byzantine Fault Tolerant (BFT) consensus or atomic broadcast, the problem has attracted…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-11-25 Ethan Buchman , Jae Kwon , Zarko Milosevic

Blockchain has been regarded as a promising technology for Internet of Things (IoT), since it provides significant solutions for decentralized network which can address trust and security concerns, high maintenance cost problem, etc. The…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-24 Bin Cao , Yixin Li , Lei Zhang , Long Zhang , Shahid Mumtaz , Zhenyu Zhou , Mugen Peng

Decentralized blockchain platforms have enabled the secure exchange of crypto-assets without the intermediation of trusted authorities. To this purpose, these platforms rely on a peer-to-peer network of byzantine nodes, which…

Cryptography and Security · Computer Science 2023-06-22 Massimo Bartoletti , Letterio Galletta , Maurizio Murgia

Population protocols model information spreading and computation in network systems where pairwise node exchanges are determined by an external random scheduler and nodes have small memory. Most of the population protocols in the literature…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-02-06 Costas Busch , Dariusz R. Kowalski

Byzantine agreement, arguably the most fundamental problem in distributed computing, operates among n processes, out of which t < n can exhibit arbitrary failures. The problem states that all correct (non-faulty) processes must eventually…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-16 Pierre Civit , Seth Gilbert , Rachid Guerraoui , Jovan Komatovic , Anton Paramonov , Manuel Vidigueira

Committee-based blockchains are among the most popular alternatives of proof-of-work based blockchains, such as Bitcoin. They provide strong consistency (no fork) under classical assumptions, and avoid using energy-consuming mechanisms to…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-10-23 Yackolley Amoussou-Guenou , Antonella del Pozzo , Maria Potop-Butucaru , Sara Tucci-Piergiovanni

Byzantine reliable broadcast is a fundamental primitive in distributed systems that allows a set of processes to agree on a message broadcast by a dedicated process, even when some of them are malicious (Byzantine). It guarantees that no…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-01 Veronika Anikina , João Paulo Bezerra , Petr Kuznetsov , Liron Schiff , Stefan Schmid

It is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely known Byzantine fault-tolerant consensus protocol, it takes…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-28 Petr Kuznetsov , Andrei Tonkikh , Yan X Zhang

Recently, the blockchain technique was put in the spotlight as it introduced a systematic approach for multiple parties to reach consensus without needing trust. However, the application of this technique in practice is severely restricted…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-07-17 Zhijie Ren , Kelong Cong , Johan Pouwelse , Zekeriya Erkin

As Byzantine Fault Tolerant (BFT) protocols begin to be used in permissioned blockchains for user-facing applications such as payments, it is crucial that they provide low latency. In pursuit of low latency, some recently proposed BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-08 Daniel Qian , Xiyu Hao , Jinkun Geng , Yuncheng Yao , Aurojit Panda , Jinyang Li , Anirudh Sivaraman

The rise of cryptocurrencies like Bitcoin and Ethereum has driven interest in blockchain database technology, with smart contracts enabling the growth of decentralized finance (DeFi). However, research has shown that adversaries exploit…

Databases · Computer Science 2026-01-30 Dakai Kang , Junchao Chen , Tien Tuan Anh Dinh , Mohammad Sadoghi