English
Related papers

Related papers: TaiJi: Longest Chain Availability with BFT Fast Co…

200 papers

Distributed ledgers are common in the industry. Some of them can use blockchains as their underlying infrastructure. A blockchain requires participants to agree on its contents. This can be achieved via a consensus protocol, and several BFT…

Performance · Computer Science 2024-11-13 J. D. Chan , Y. C. Tay , Brian R. Z. Yen

Proof-of-Work (PoW) is a popular consensus protocol used by Bitcoin since its inception. PoW has the well-known flaw of assigning all the reward to the single miner (or pool) that inserts the new block. This has the consequence of making…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-07-13 Danilo Bazzanella , Andrea Gangemi

Byzantine Fault-Tolerant (BFT) protocols play an important role in blockchains. As the deployment of such systems extends to wide-area networks, the scalability of BFT protocols becomes a critical concern. Optimizations that assign specific…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-10 Hanish Gogada , Christian Berger , Leander Jehl , Hans P. Reiser , Hein Meling

We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates $f$ Byzantine faults in an asynchronous…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-09-14 Ittai Abraham , Srinivas Devadas , Danny Dolev , Kartik Nayak , Ling Ren

This paper describes BigBFT, a multi-leader Byzantine fault tolerance protocol that achieves high throughput and scalable consensus in blockchain systems. BigBFT achieves this by (1) enabling every node to be a leader that can propose and…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-25 Salem Alqahtani , Murat Demirbas

We present Mahi-Mahi, the first asynchronous BFT consensus protocol that achieves sub-second latency in the WAN while processing over 100,000 transactions per second. We accomplish this remarkable performance by building Mahi-Mahi on an…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-18 Philipp Jovanovic , Lefteris Kokoris Kogias , Bryan Kumara , Alberto Sonnino , Pasindu Tennage , Igor Zablotchi

Byzantine fault tolerant protocols enable state replication in the presence of crashed, malfunctioning, or actively malicious processes. Designing such protocols without the assistance of verification tools, however, is remarkably…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-09-23 Joel Wanner , Laurent Chuat , Adrian Perrig

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

We present Carnot, a leader-based Byzantine Fault Tolerant (BFT) consensus protocol that is responsive and operates under the partially synchronous model. Responsive BFT consensus protocols exhibit wire-speed operation and deliver…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-09-04 Mohammad M. Jalalzai , Alexander Mozeika , Marcin P. Pawlowski , Ganesh Narayanaswamy

Permissionless blockchains achieve consensus while allowing unknown nodes to join and leave the system at any time. They typically come in two flavors: proof of work (PoW) and proof of stake (PoS), and both are vulnerable to attacks. PoS…

Cryptography and Security · Computer Science 2026-01-12 Ali Farahbakhsh , Giuliano Losa , Youer Pu , Lorenzo Alvisi , Ittay Eyal

For applications of Byzantine fault tolerant (BFT) consensus protocols where the participants are economic agents, recent works highlighted the importance of accountability: the ability to identify participants who provably violate the…

Cryptography and Security · Computer Science 2022-05-19 Joachim Neu , Ertem Nusret Tas , David Tse

We present Egalitarian BFT (EBFT), a simple and high-performance framework of BFT consensus protocols for decentralized systems like blockchains. The key innovation in EBFT is egalitarian block generation: nodes randomly and…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-03-14 Jianyu Niu , Runchao Han , Shengqi Liu , Fangyu Gai , Ivan Beschastnikh , Yinqian Zhang , Chen Feng

Byzantine Fault Tolerance (BFT) enables correct operation of distributed, i.e., replicated applications in the face of malicious take-over and faulty/buggy individual instances. Recently, BFT designs have gained traction in the context of…

Networking and Internet Architecture · Computer Science 2019-08-15 Ermin Sakic , Nemanja Deric , Endri Goshi , Wolfgang Kellerer

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

Numerous distributed tasks have to be handled in a setting where a fraction of nodes behaves Byzantine, that is, deviates arbitrarily from the intended protocol. Resilient, deterministic protocols rely on the detection of majorities to…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-02-10 Philipp Schneider

Byzantine Fault-Tolerant (BFT) consensus protocols ensure agreement on transaction ordering despite malicious actors, but unconstrained ordering power enables sophisticated value extraction attacks like front running and sandwich attacks -…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-17 Pengkun Ren , Hai Dong , Nasrin Sohrabi , Zahir Tari , Pengcheng Zhang

This paper introduces a family of leaderless Byzantine fault tolerance protocols, built around a metastable mechanism via network subsampling. These protocols provide a strong probabilistic safety guarantee in the presence of Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-25 Team Rocket , Maofan Yin , Kevin Sekniqi , Robbert van Renesse , Emin Gün Sirer

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

Blockchain technology provides an auditable and tamper-proof distributed storage infrastructure for information records. This can be leveraged to support distributed workflow management. Compared to proof-of-work consensus, popularized by…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-11 Joerg Evermann

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