English
Related papers

Related papers: Recipe: Hardware-Accelerated Replication Protocols

200 papers

We introduce FnF-BFT, a parallel-leader byzantine fault-tolerant state-machine replication protocol for the partially synchronous model with theoretical performance bounds during synchrony. By allowing all replicas to act as leaders and…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-03-11 Zeta Avarikioti , Lioba Heimbach , Roland Schmid , Laurent Vanbever , Roger Wattenhofer , Patrick Wintermeyer

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-tolerant (BFT) state machine replication (SMR) has been studied for over 30 years. Recently it has received more attention due to its application in permissioned blockchain systems. A sequence of research efforts focuses on…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-03 Ittai Abraham , Kartik Nayak , Ling Ren , Zhuolun Xiang

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

We present HotStuff, a leader-based Byzantine fault-tolerant replication protocol for the partially synchronous model. Once network communication becomes synchronous, HotStuff enables a correct leader to drive the protocol to consensus at…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-24 Maofan Yin , Dahlia Malkhi , Michael K. Reiter , Guy Golan Gueta , Ittai Abraham

The novel blockchain generation of Byzantine fault-tolerant (BFT) state machine replication (SMR) protocols focuses on scalability and performance to meet requirements of distributed ledger technology (DLT), e.g., decentralization and…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-07 Christian Berger , Sadok Ben Toumia , Hans P. Reiser

The concept of distributed consensus originated in the 1970s and gained widespread attention following Leslie Lamport's influential publication on the Byzantine Generals Problem in the 1980s. Over the past five decades, distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-13 Huanyu Wu , Chentao Yue , Yixuan Fan , Yonghui Li , Lei Zhang

Existing Byzantine fault-tolerant (BFT) consensus protocols address only threshold failures, where the participating nodes fail independently of each other, each one fails equally likely, and the protocol's guarantees follow from a simple…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-04 Orestis Alpos , Christian Cachin

Low latency is one of the desired properties for partially synchronous Byzantine consensus protocols. Previous protocols have achieved consensus with just two communication steps either by reducing the bound on the number of faults the…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-10-12 Mohammad M. Jalalzai , Chen Feng , Victoria Lemieux

Byzantine Fault Tolerant (BFT) systems are considered by the systems research community to be state of the art with regards to providing reliability in distributed systems. BFT systems provide safety and liveness guarantees with reasonable…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-10-24 Nikos Chondros , Konstantinos Kokordelis , Mema Roussopoulos

SBFT is a state of the art Byzantine fault tolerant permissioned blockchain system that addresses the challenges of scalability, decentralization and world-scale geo-replication. SBFTis optimized for decentralization and can easily handle…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-01-03 Guy Golan Gueta , Ittai Abraham , Shelly Grossman , Dahlia Malkhi , Benny Pinkas , Michael K. Reiter , Dragos-Adrian Seredinschi , Orr Tamir , Alin Tomescu

Byzantine-Fault-Tolerant (BFT) systems are rapidly emerging as a viable technology for production-grade systems, notably in closed consortia deployments for nancial and supply-chain applications. Unfortunately, most algorithms proposed so…

Databases · Computer Science 2019-11-11 Loïck Bonniot , Christoph Neumann , François Taïani

This paper presents Mir-BFT, a robust Byzantine fault-tolerant (BFT) total order broadcast protocol aimed at maximizing throughput on wide-area networks (WANs), targeting deployments in decentralized networks, such as permissioned and…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-25 Chrysoula Stathakopoulou , Tudor David , Matej Pavlovic , Marko Vukolić

This paper explores the territory that lies between best-effort Byzantine-Fault-Tolerant Conflict-free Replicated Data Types (BFT CRDTs) and totally ordered distributed ledgers, such as those implemented by Blockchains. It formally…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-11 Davide Frey , Lucie Guillou , Michel Raynal , François Taïani

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

Since the inception of Bitcoin, the distributed systems community has shown interest in the design of efficient blockchain systems. However, initial blockchain applications (like Bitcoin) attain very low throughput, which has promoted the…

Databases · Computer Science 2020-04-28 Suyash Gupta , Sajjad Rahnama , Mohammad Sadoghi

This paper introduces Flexible BFT, a new approach for BFT consensus solution design revolving around two pillars, stronger resilience and diversity. The first pillar, stronger resilience, involves a new fault model called alive-but-corrupt…

Cryptography and Security · Computer Science 2019-06-03 Dahlia Malkhi , Kartik Nayak , Ling Ren

This paper presents DuoBFT, a Byzantine fault-tolerant protocol that uses trusted components to provide commit decisions in the Hybrid fault model in addition to commit decisions in the BFT model. By doing so, it enables the clients to…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-02-09 Balaji Arun , Binoy Ravindran

Distributed ledgers are increasingly relied upon by industry to provide trustworthy accountability, strong integrity protection, and high availability for critical data without centralizing trust. Recently, distributed append-only logs are…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-06 Shubham Mishra , João Gonçalves , Chawinphat Tankuranand , Neil Giridharan , Natacha Crooks , Heidi Howard , Chris Jensen

Modern chained Byzantine Fault Tolerant (BFT) systems leverage a combination of pipelining and leader rotation to obtain both efficiency and fairness. These protocols, however, require a sequence of three or four consecutive honest leaders…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-01-27 Ittai Abraham , Natacha Crooks , Neil Giridharan , Heidi Howard , Florian Suri-Payer