English
Related papers

Related papers: Simulating BFT Protocol Implementations at Scale

200 papers

Byzantine Fault-Tolerant (BFT) protocols have recently been extensively used by decentralized data management systems with non-trustworthy infrastructures, e.g., permissioned blockchains. BFT protocols cover a broad spectrum of design…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-08-05 Mohammad Javad Amiri , Chenyuan Wu , Divyakant Agrawal , Amr El Abbadi , Boon Thau Loo , Mohammad Sadoghi

Byzantine Fault Tolerant (BFT) consensus, a cornerstone of blockchain technology, has seen significant advancements. While existing BFT protocols ensure security guarantees, they often suffer from efficiency challenges, particularly under…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-15 Qingming Zeng , Mo Li , Ximing Fu , Chuanyi Liu , Hui Jiang

With the advancement of blockchain technology, chained Byzantine Fault Tolerant (BFT) protocols have been increasingly adopted in practical systems, making their performance a crucial aspect of the study. In this paper, we introduce a…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-01-08 Yining Tang , Qihang Luo , Runchao Han , Jianyu Niu , Chen Feng , Yinqian Zhang

The practical Byzantine fault tolerant (PBFT) consensus protocol is one of the basic consensus protocols in the development of blockchain technology. At the same time, the PBFT consensus protocol forms a basis for some other important BFT…

Performance · Computer Science 2023-06-21 Yan-Xia Chang , Qing Wang , Quan-Lin Li , Yaqian Ma

Byzantine Fault Tolerance (BFT) is one of the most challenging problems in Distributed Machine Learning (DML), defined as the resilience of a fault-tolerant system in the presence of malicious components. Byzantine failures are still…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-12-06 Djamila Bouhata , Hamouma Moumen , Jocelyn Ahmed Mazari , Ahcène Bounceur

Blockchain systems are designed, built and operated in the presence of failures. There are two dominant failure models, namely crash fault and Byzantine fault. Byzantine fault tolerance (BFT) protocols offer stronger security guarantees,…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-08-04 Mingyuan Gao , Hung Dang , Ee-Chien Chang , Jialin Li

We propose uBFT, the first State-Machine Replication (SMR) system to achieve microsecond-scale latency in data centers, while using only $2f{+}1$ replicas to tolerate $f$ Byzantine failures. The Byzantine Fault Tolerance (BFT) provided by…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-17 Marcos K. Aguilera , Naama Ben-David , Rachid Guerraoui , Antoine Murat , Athanasios Xygkis , Igor Zablotchi

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

Blockchain technology has been proposed as a new infrastructure technology for a wide variety of novel applications. Blockchains provide an immutable record of transactions, making them useful when business actors do not trust each other.…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-27 Joerg Evermann , Henry Kim

We present a general consensus framework that allows to easily introduce a customizable Byzantine fault tolerant consensus algorithm to an existing (Delegated) Proof-of-Stake blockchain. We prove the safety of the protocol under the…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-05-06 Jan Hackfeld

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

Storage scalability is paramount in the era of big data blockchain. A storage-scalable blockchain can effectively scale out state storage to an arbitrary number of nodes and reduce the storage pressure on each, similar to distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-26 Guangda Sun , Jialin Li

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 presents IBFT, a simple and elegant Byzantine fault-tolerant consensus algorithm that is used to implement state machine replication in the \emph{Quorum} blockchain. IBFT assumes a partially synchronous communication model, where…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-20 Henrique Moniz

Achieving low-latency consensus in geographically distributed systems remains a key challenge for blockchain and distributed database applications. To this end, there has been significant recent interest in State-Machine-Replication (SMR)…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-28 Brendan Kobayashi Chou , Andrew Lewis-Pye , Patrick O'Grady

Byzantine Fault-Tolerant (BFT) protocols have been proposed to tolerate malicious behaviors in state machine replications. With classic BFT protocols, the total number of replicas is known and fixed a priori. The resilience of BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-06-12 Jiangshan Yu

Traditional Byzantine Fault Tolerance (BFT) state machine replication protocols assume a partial synchrony model, leading to a design where a leader replica drives the protocol and is replaced after a timeout. Recently, we witnessed a surge…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-02-07 Afonso Oliveira , Henrique Moniz , Rodrigo Rodrigues

Mission critical systems deployed in data centers today are facing more sophisticated failures. Byzantine fault tolerant (BFT) protocols are capable of masking these types of failures, but are rarely deployed due to their performance cost…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-25 Guangda Sun , Xin Zhe Khooi , Yunfan Li , Mingliang Jiang , Jialin Li

With the rapid development of blockchain, Byzantine fault-tolerant protocols have attracted revived interest recently. To overcome the theoretical bounds of Byzantine fault tolerance, many protocols attempt to use Trusted Execution…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-07 Jiashuo Zhang , Jianbo Gao , Ke Wang , Zhenhao Wu , Ying Lan , Zhi Guan , Zhong Chen

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