Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus

We propose separating the task of reliable transaction dissemination from transaction ordering, to enable high-performance Byzantine fault-tolerant quorum-based consensus. We design and evaluate a mempool protocol, Narwhal, specializing in high-throughput reliable dissemination and storage of causal...

Full description

Bibliographic Details
Main Authors: Danezis, George, Kokoris-Kogias, Lefteris, Sonnino, Alberto, Spiegelman, Alexander
Format: Report
Language:English
Published: Association for Computing Machinery 2022
Subjects:
Online Access:https://discovery.ucl.ac.uk/id/eprint/10172331/1/2105.11827.pdf
https://discovery.ucl.ac.uk/id/eprint/10172331/
id ftucl:oai:eprints.ucl.ac.uk.OAI2:10172331
record_format openpolar
spelling ftucl:oai:eprints.ucl.ac.uk.OAI2:10172331 2023-12-24T10:18:39+01:00 Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus Danezis, George Kokoris-Kogias, Lefteris Sonnino, Alberto Spiegelman, Alexander 2022-03-28 text https://discovery.ucl.ac.uk/id/eprint/10172331/1/2105.11827.pdf https://discovery.ucl.ac.uk/id/eprint/10172331/ eng eng Association for Computing Machinery https://discovery.ucl.ac.uk/id/eprint/10172331/1/2105.11827.pdf https://discovery.ucl.ac.uk/id/eprint/10172331/ open In: EuroSys '22: Proceedings of the Seventeenth European Conference on Computer Systems. (pp. pp. 34-50). Association for Computing Machinery: Rennes, France. (2022) BYZANTINE AGREEMENT Byzantine Fault Tolerant Computer Science Hardware & Architecture Information Systems Software Engineering Theory & Methods Consensus protocol Science & Technology Technology Proceedings paper 2022 ftucl 2023-11-27T13:07:33Z We propose separating the task of reliable transaction dissemination from transaction ordering, to enable high-performance Byzantine fault-tolerant quorum-based consensus. We design and evaluate a mempool protocol, Narwhal, specializing in high-throughput reliable dissemination and storage of causal histories of transactions. Narwhal tolerates an asynchronous network and maintains high performance despite failures. Narwhal is designed to easily scale-out using multiple workers at each validator, and we demonstrate that there is no foreseeable limit to the throughput we can achieve. Composing Narwhal with a partially synchronous consensus protocol (Narwhal-HotStuff) yields significantly better throughput even in the presence of faults or intermittent loss of liveness due to asynchrony. However, loss of liveness can result in higher latency. To achieve overall good performance when faults occur we design Tusk, a zero-message overhead asynchronous consensus protocol, to work with Narwhal. We demonstrate its high performance under a variety of configurations and faults. As a summary of results, on a WAN, Narwhal-Hotstuff achieves over 130,000 tx/sec at less than 2-sec latency compared with 1,800 tx/sec at 1-sec latency for Hotstuff. Additional workers increase throughput linearly to 600,000 tx/sec without any latency increase. Tusk achieves 160,000 tx/sec with about 3 seconds latency. Under faults, both protocols maintain high throughput, but Narwhal-HotStuff suffers from increased latency. Report narwhal* University College London: UCL Discovery
institution Open Polar
collection University College London: UCL Discovery
op_collection_id ftucl
language English
topic BYZANTINE AGREEMENT
Byzantine Fault Tolerant
Computer Science
Hardware & Architecture
Information Systems
Software Engineering
Theory & Methods
Consensus protocol
Science & Technology
Technology
spellingShingle BYZANTINE AGREEMENT
Byzantine Fault Tolerant
Computer Science
Hardware & Architecture
Information Systems
Software Engineering
Theory & Methods
Consensus protocol
Science & Technology
Technology
Danezis, George
Kokoris-Kogias, Lefteris
Sonnino, Alberto
Spiegelman, Alexander
Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus
topic_facet BYZANTINE AGREEMENT
Byzantine Fault Tolerant
Computer Science
Hardware & Architecture
Information Systems
Software Engineering
Theory & Methods
Consensus protocol
Science & Technology
Technology
description We propose separating the task of reliable transaction dissemination from transaction ordering, to enable high-performance Byzantine fault-tolerant quorum-based consensus. We design and evaluate a mempool protocol, Narwhal, specializing in high-throughput reliable dissemination and storage of causal histories of transactions. Narwhal tolerates an asynchronous network and maintains high performance despite failures. Narwhal is designed to easily scale-out using multiple workers at each validator, and we demonstrate that there is no foreseeable limit to the throughput we can achieve. Composing Narwhal with a partially synchronous consensus protocol (Narwhal-HotStuff) yields significantly better throughput even in the presence of faults or intermittent loss of liveness due to asynchrony. However, loss of liveness can result in higher latency. To achieve overall good performance when faults occur we design Tusk, a zero-message overhead asynchronous consensus protocol, to work with Narwhal. We demonstrate its high performance under a variety of configurations and faults. As a summary of results, on a WAN, Narwhal-Hotstuff achieves over 130,000 tx/sec at less than 2-sec latency compared with 1,800 tx/sec at 1-sec latency for Hotstuff. Additional workers increase throughput linearly to 600,000 tx/sec without any latency increase. Tusk achieves 160,000 tx/sec with about 3 seconds latency. Under faults, both protocols maintain high throughput, but Narwhal-HotStuff suffers from increased latency.
format Report
author Danezis, George
Kokoris-Kogias, Lefteris
Sonnino, Alberto
Spiegelman, Alexander
author_facet Danezis, George
Kokoris-Kogias, Lefteris
Sonnino, Alberto
Spiegelman, Alexander
author_sort Danezis, George
title Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus
title_short Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus
title_full Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus
title_fullStr Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus
title_full_unstemmed Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus
title_sort narwhal and tusk: a dag-based mempool and efficient bft consensus
publisher Association for Computing Machinery
publishDate 2022
url https://discovery.ucl.ac.uk/id/eprint/10172331/1/2105.11827.pdf
https://discovery.ucl.ac.uk/id/eprint/10172331/
genre narwhal*
genre_facet narwhal*
op_source In: EuroSys '22: Proceedings of the Seventeenth European Conference on Computer Systems. (pp. pp. 34-50). Association for Computing Machinery: Rennes, France. (2022)
op_relation https://discovery.ucl.ac.uk/id/eprint/10172331/1/2105.11827.pdf
https://discovery.ucl.ac.uk/id/eprint/10172331/
op_rights open
_version_ 1786207841633173504