English
Related papers

Related papers: The Tragedy of Chain Commons

200 papers

Vote-based blockchains construct a state machine replication (SMR) system among participating nodes, using Byzantine Fault Tolerance (BFT) consensus protocols to transition from one state to another. Currently, they rely on either…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-12-25 Yibin Xu , Jianhua Shao , Tijs Slaats , Boris Düdder , Yongluan Zhou

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

Asynchronous Byzantine Fault Tolerant (BFT) consensus protocols have garnered significant attention with the rise of blockchain technology. A typical asynchronous protocol is designed by executing sequential instances of the Asynchronous…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-18 Xiaohai Dai , Chaozheng Ding , Wei Li , Jiang Xiao , Bolin Zhang , Chen Yu , Albert Y. Zomaya , Hai Jin

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

Byzantine fault-tolerant (BFT) web services provide critical integrity guarantees for distributed applications but face significant latency challenges that hinder interactive user experiences. We propose a novel two-layer architecture that…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-07-14 Ahmad Zaki Akmal , Azkario Rizky Pratama , Guntur Dharma Putra

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

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 2023-05-05 Alejandro Ranchal-Pedrosa , Vincent Gramoli

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 practical Byzantine fault tolerant (PBFT) consensus mechanism is one of the most basic consensus algorithms (or protocols) in blockchain technologies, thus its performance evaluation is an interesting and challenging topic due to a…

Cryptography and Security · Computer Science 2021-07-02 Fan-Qi Ma , Quan-Lin Li , Yi-Han Liu , Yan-Xia Chang

Byzantine fault-tolerant agreement (BFT) in a partially synchronous system usually requires 3f + 1 nodes to tolerate f faulty replicas. Due to their high throughput and finality property BFT algorithms build the core of recent permissioned…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-26 Ines Messadi , Markus Horst Becker , Kai Bleeke , Leander Jehl , Sonia Ben Mokhtar , Rüdiger Kapitza

The growing interest in reliable multi-party applications has fostered widespread adoption of Byzantine Fault-Tolerant (BFT) consensus protocols. Existing BFT protocols need f more replicas than Paxos-style protocols to prevent equivocation…

Databases · Computer Science 2022-11-03 Suyash Gupta , Sajjad Rahnama , Shubham Pandey , Natacha Crooks , Mohammad Sadoghi

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

Permissioned blockchains employ Byzantine fault-tolerant (BFT) state machine replication (SMR) to reach agreement on an ever-growing, linearly ordered log of transactions. A new paradigm, combined with decades of research in BFT SMR and…

Cryptography and Security · Computer Science 2021-03-02 Fangyu Gai , Ali Farahbakhsh , Jianyu Niu , Chen Feng , Ivan Beschastnikh , Hao Duan

Byzantine Fault Tolerant (BFT) consensus exhibits higher throughput in comparison to Proof of Work (PoW) in blockchains. But BFT-based protocols suffer from scalability problems with respect to the number of replicas in the network. The…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-30 Mohammad M. Jalalzai , Costas Busch , Golden Richard

This paper introduces MonadBFT, a novel Byzantine Fault Tolerant (BFT) consensus protocol that advances both performance and robustness. MonadBFT is implemented as the consensus protocol in the Monad blockchain. As a HotStuff-family…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-18 Mohammad Mussadiq Jalalzai , Kushal Babel , Jovan Komatovic , Tobias Klenze , Sourav Das , Fatima Elsheimy , Mike Setrin , John Bergschneider , Babak Gilkalaye

Consensus stands as a fundamental building block for constructing reliable and fault-tolerant distributed services. The increasing demand for high-performance and scalable blockchain protocols has brought attention to solving consensus in…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-07-03 Hasan Heydari , Robin Vassantlal , Alysson Bessani

In this paper we analyze from the game theory point of view Byzantine Fault Tolerant blockchains when processes exhibit rational or Byzantine behavior. Our work is the first to model the Byzantine-consensus based blockchains as a committee…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-02-22 Yackolley Amoussou-Guenou , Bruno Biais , Maria Potop-Butucaru , Sara Tucci-Piergiovanni

There is a resurgence of interest in Byzantine fault-tolerant (BFT) systems due to blockchains. However, leader-based BFT consensus protocols used by permissioned blockchains have limited scalability and robustness. To alleviate the leader…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-27 Fangyu Gai , Jianyu Niu , Ivan Beschastnikh , Chen Feng , Sheng Wang

Hyperledger Fabric is an enterprise grade permissioned distributed ledger platform that offers modularity for a broad set of industry use cases. One modular component is a pluggable ordering service that establishes consensus on the order…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-16 Artem Barger , Yacov Manevich , Hagar Meir , Yoav Tock

Blockchain consensus is a state whereby each node in a network agrees on the current state of the blockchain. Existing protocols achieve consensus via a contest or voting procedure to select one node as a dictator to propose new blocks.…

Theoretical Economics · Economics 2022-06-22 Joshua S. Gans , Richard Holden