Efficient DAG-Based Consensus (Invited Talk) ...

This talk shows how to build high-performant Byzantine fault-tolerant (BFT) quorum-based consensus cores. The talks starts by challenging the common misconception that the overall communication complexity of the protocol is the key factor determining performance. We instead argue that the bottleneck...

Full description

Bibliographic Details
Main Author: Sonnino, Alberto
Format: Conference Object
Language:English
Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik 2022
Subjects:
Online Access:https://dx.doi.org/10.4230/oasics.fab.2022.4
https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FAB.2022.4
id ftdatacite:10.4230/oasics.fab.2022.4
record_format openpolar
spelling ftdatacite:10.4230/oasics.fab.2022.4 2024-02-04T10:02:08+01:00 Efficient DAG-Based Consensus (Invited Talk) ... Sonnino, Alberto 2022 application/pdf https://dx.doi.org/10.4230/oasics.fab.2022.4 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FAB.2022.4 en eng Schloss Dagstuhl – Leibniz-Zentrum für Informatik https://dx.doi.org/10.4230/OASIcs.FAB.2022 info:eu-repo/semantics/openAccess Creative Commons Attribution 4.0 International license https://creativecommons.org/licenses/by/4.0/legalcode cc by 4.0 Consensus protocol Byzantine Fault Tolerant Security and privacy → Distributed systems security Article Invited Talk ConferencePaper 2022 ftdatacite https://doi.org/10.4230/oasics.fab.2022.410.4230/OASIcs.FAB.2022 2024-01-05T03:17:38Z This talk shows how to build high-performant Byzantine fault-tolerant (BFT) quorum-based consensus cores. The talks starts by challenging the common misconception that the overall communication complexity of the protocol is the key factor determining performance. We instead argue that the bottleneck of many state-of-the-art consensus protocols is their sequential use of the machine’s resources (network, storage, CPU), and that data dissemination is the most resource-intensive task. In light of the above considerations, the first insight to build performant BFT-based consensus cores is to separate the task of reliable transaction dissemination from transaction ordering. We show how to design a new DAG-based mempool protocol, called Narwhal, specialising in high-throughput reliable dissemination and storage of causal histories of transactions. Narwhal tolerates an asynchronous network and maintains high performance despite failures. It is designed to easily scale-out using multiple workers at each validator to ... : OASIcs, Vol. 101, 5th International Symposium on Foundations and Applications of Blockchain 2022 (FAB 2022), pages 4:1-4:1 ... Conference Object narwhal* DataCite Metadata Store (German National Library of Science and Technology)
institution Open Polar
collection DataCite Metadata Store (German National Library of Science and Technology)
op_collection_id ftdatacite
language English
topic Consensus protocol
Byzantine Fault Tolerant
Security and privacy → Distributed systems security
spellingShingle Consensus protocol
Byzantine Fault Tolerant
Security and privacy → Distributed systems security
Sonnino, Alberto
Efficient DAG-Based Consensus (Invited Talk) ...
topic_facet Consensus protocol
Byzantine Fault Tolerant
Security and privacy → Distributed systems security
description This talk shows how to build high-performant Byzantine fault-tolerant (BFT) quorum-based consensus cores. The talks starts by challenging the common misconception that the overall communication complexity of the protocol is the key factor determining performance. We instead argue that the bottleneck of many state-of-the-art consensus protocols is their sequential use of the machine’s resources (network, storage, CPU), and that data dissemination is the most resource-intensive task. In light of the above considerations, the first insight to build performant BFT-based consensus cores is to separate the task of reliable transaction dissemination from transaction ordering. We show how to design a new DAG-based mempool protocol, called Narwhal, specialising in high-throughput reliable dissemination and storage of causal histories of transactions. Narwhal tolerates an asynchronous network and maintains high performance despite failures. It is designed to easily scale-out using multiple workers at each validator to ... : OASIcs, Vol. 101, 5th International Symposium on Foundations and Applications of Blockchain 2022 (FAB 2022), pages 4:1-4:1 ...
format Conference Object
author Sonnino, Alberto
author_facet Sonnino, Alberto
author_sort Sonnino, Alberto
title Efficient DAG-Based Consensus (Invited Talk) ...
title_short Efficient DAG-Based Consensus (Invited Talk) ...
title_full Efficient DAG-Based Consensus (Invited Talk) ...
title_fullStr Efficient DAG-Based Consensus (Invited Talk) ...
title_full_unstemmed Efficient DAG-Based Consensus (Invited Talk) ...
title_sort efficient dag-based consensus (invited talk) ...
publisher Schloss Dagstuhl – Leibniz-Zentrum für Informatik
publishDate 2022
url https://dx.doi.org/10.4230/oasics.fab.2022.4
https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FAB.2022.4
genre narwhal*
genre_facet narwhal*
op_relation https://dx.doi.org/10.4230/OASIcs.FAB.2022
op_rights info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode
cc by 4.0
op_doi https://doi.org/10.4230/oasics.fab.2022.410.4230/OASIcs.FAB.2022
_version_ 1789968527944318976