English
Related papers

Related papers: Lemonshark: Asynchronous DAG-BFT With Early Finali…

200 papers

We present Bullshark, the first directed acyclic graph (DAG) based asynchronous Byzantine Atomic Broadcast protocol that is optimized for the common synchronous case. Like previous DAG-based BFT protocols, Bullshark requires no extra…

Cryptography and Security · Computer Science 2022-09-08 Alexander Spiegelman , Neil Giridharan , Alberto Sonnino , Lefteris Kokoris-Kogias

To maximize performance, many modern blockchain systems rely on eventually-synchronous, Byzantine fault-tolerant (BFT) consensus protocols. Two protocol designs have emerged in this space: protocols that minimize latency using a leader that…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-21 Qianyu Yu , Giuliano Losa , Nibesh Shrestha , Xuechao Wang

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

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

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

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

A recent approach to building consensus protocols on top of Directed Acyclic Graphs (DAGs) shows much promise due to its simplicity and stable throughput. However, as each node in the DAG typically includes a linear number of references to…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-03 Michael Anoprenko , Andrei Tonkikh , Alexander Spiegelman , Petr Kuznetsov , Anatoliy Zinovyev , Konstantin Shprenger

DAG-based BFT consensus has attracted growing interest in distributed data management systems for consistent replication in untrusted settings due to its high throughput and resilience to asynchrony. However, existing protocols still suffer…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-04 Shaokang Xie , Dakai Kang , Hanzheng Lyu , Jianyu Niu , Mohammad Sadoghi

The purpose of this manuscript is to describe the deterministic partially synchronous version of Bullshark in a simple and clean way. This result is published in CCS 2022, however, the description there is less clear because it uses the…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-14 Alexander Spiegelman , Neil Giridharan , Alberto Sonnino , Lefteris Kokoris-Kogias

This paper introduces a new consensus protocol, so-called \emph{\stair}, for fast consensus in DAG-based trustless system. In \stair, we propose a new approach to creating local block DAG, namely \emph{x-DAG} (cross-DAG), on each node.…

Cryptography and Security · Computer Science 2019-09-05 Quan Nguyen , Andre Cronje , Michael Kong , Alex Kampa , George Samman

Several prominent DAG-based blockchain protocols, such as DAG-Rider, Tusk, and Bullshark, completely separate between equivocation elimination and committing; equivocation is handled through the use of a reliable Byzantine broadcast…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-14 Razya Ladelsky , Roy Friedman

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

This paper presents a new framework, namely \emph{\onlay}, for scalable asynchronous distributed systems. In this framework, we propose a consensus protocol $L_{\phi}$, which is based on the Lachesis protocol~\cite{lachesis01}. At the core…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-05-14 Quan Nguyen , Andre Cronje

This paper consolidates the core technologies and key concepts of our novel Lachesis consensus protocol and Fantom Opera platform, which is permissionless, leaderless and EVM compatible. We introduce our new protocol, so-called Lachesis,…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-08-05 Quan Nguyen , Andre Cronje , Michael Kong , Egor Lysenko , Alex Guzev

Blockchains use consensus protocols to reach agreement, e.g., on the ordering of transactions. DAG-based consensus protocols are increasingly adopted by blockchain companies to reduce energy consumption and enhance security. These protocols…

Logic in Computer Science · Computer Science 2025-03-19 Nathalie Bertrand , Pranav Ghorpade , Sasha Rubin , Bernhard Scholz , Pavle Subotic

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

DAG-based protocols have been proposed as potential solutions to the latency and throughput limitations of traditional permissionless consensus protocols. However, their adoption has been hindered by security concerns and a lack of a solid…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-07 Ignacio Amores-Sesar , Christian Cachin

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

This paper introduces Slipstream, a Byzantine Fault Tolerance (BFT) protocol where nodes concurrently propose blocks to be added to a Directed Acyclic Graph (DAG) and aim to agree on block ordering. Slipstream offers two types of block…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-23 Nikita Polyanskii , Sebastian Muller , Mayank Raikwar

Blockchain consensus protocols enable participants to agree on consistent views of the blockchain that may be ahead or behind relative to each other but do not fork into different chains. A number of recently popular…

Logic in Computer Science · Computer Science 2025-04-24 Alessandro Coglio , Eric McCarthy
‹ Prev 1 2 3 10 Next ›