English
Related papers

Related papers: Narwhal and Tusk: A DAG-based Mempool and Efficien…

200 papers

Round-based DAGs enable high-performance Byzantine fault-tolerant consensus, yet their technical advantages remain underutilized due to their short history. While research on consensus protocols is active in both academia and industry, many…

Cryptography and Security · Computer Science 2025-07-08 Yusei Tanaka

The Narwhal system is a state-of-the-art Byzantine fault-tolerant scalable architecture that involves constructing a directed acyclic graph (DAG) of messages among a set of validators in a Blockchain network. Bullshark is a zero-overhead…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-07-11 Alexander Spiegelman , Balaji Arun , Rati Gelashvili , Zekun Li

In this paper, we introduce Rorqual, a protocol designed to enhance the performance of the Narwhal Mempool by integrating Trusted Execution Environments (TEEs). Both Narwhal and Roqual are protocols based on a Directed Acyclic Graph (DAG).…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-27 Luciano Freitas , Shashank Motepalli , Matej Pavlovic , Benjamin Livshits

DAG-based consensus has attracted significant interest due to its high throughput in asynchronous network settings. However, existing protocols such as DAG-rider (Keidar et al., PODC 2021) and ``Narwhal and Tusk'' (Danezis et al., Eurosys…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-14 Keyang Liu , Maxim Jourenko , Mario Larangeira

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 state-of-the-art HotStuff operates an efficient pipeline in which a stable leader drives decisions with linear communication and two round-trips of message. However, the unifying proposing-voting pattern is not sufficient to improve the…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-03-22 Taining Cheng

Transaction ordering attacks extract billions of dollars annually from decentralized finance users in the form of Maximal Extractable Value (MEV). Byzantine Fault-Tolerant (BFT) consensus protocols guarantee total order but place no…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-25 Marko Putnik , Jérémie Decouchant

Today's practical partially synchronous Byzantine Fault Tolerant (BFT) consensus protocols trade off low latency and high throughput. On the one end, traditional BFT protocols such as PBFT and its derivatives optimize for latency. They…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-06 Balaji Arun , Zekun Li , Florian Suri-Payer , Sourav Das , Alexander Spiegelman

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

This paper presents a high-performance consensus protocol, Nezha, which can be deployed by cloud tenants without any support from their cloud provider. Nezha bridges the gap between protocols such as Multi-Paxos and Raft, which can be…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-25 Jinkun Geng , Anirudh Sivaraman , Balaji Prabhakar , Mendel Rosenblum

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

This paper introduces Hamster, a novel synchronous Byzantine Fault Tolerance protocol that achieves better performance and has weaker dependency on synchrony. Specifically, Hamster employs coding techniques to significantly decrease…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-01 Ximing Fu , Mo Li , Qingming Zeng , Tianyang Li , Shenghao Yang , Yonghui Guan , Chuanyi Liu

This paper presents TetraBFT, a novel unauthenticated Byzantine fault tolerant protocol for solving consensus in partial synchrony, eliminating the need for public key cryptography and ensuring resilience against computationally unbounded…

Cryptography and Security · Computer Science 2026-04-14 Qianyu Yu , Giuliano Losa , Xuechao Wang

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

Recent developments in the Byzantine Fault Tolerant consensus protocols have shown the DAG-based protocols to be a very promising technique. While early implementations of DAG-based protocols such as Narwhal/Bullshark trade high throughput…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-27 Andrey Chursin

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

This paper introduces Nemo-Nemo, a practical crash-fault tolerant (CFT) consensus protocol designed to outperform existing protocols in wide-area networks by bridging design principles from the CFT and Byzantine-fault tolerant (BFT) worlds.…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-13 Rithwik Kerur , Pasindu Tennage , Philipp Jovanovic , Dahlia Malkhi , Alberto Sonnino , Igor Zablotchi

DAG-Rider popularized a new paradigm of DAG-BFT protocols, separating dissemination from consensus: all nodes disseminate transactions as blocks that reference previously known blocks, while consensus is reached by electing certain blocks…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-08 Michael Yiqing Hu , Alvin Hong Yao Yan , Yang Yihan , Liu Xiang , Li Jialin

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

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
‹ Prev 1 2 3 10 Next ›