The Hashgraph Protocol: Efficient Asynchronous BFT for High-Throughput Distributed Ledgers

L. Baird, Atul Luykx
{"title":"The Hashgraph Protocol: Efficient Asynchronous BFT for High-Throughput Distributed Ledgers","authors":"L. Baird, Atul Luykx","doi":"10.1109/COINS49042.2020.9191430","DOIUrl":null,"url":null,"abstract":"Atomic broadcast protocols are increasingly used to build distributed ledgers. The most robust protocols achieve byzantine fault tolerance (BFT) and operate in asynchronous networks. Recent proposals such as HoneyBadgerBFT (ACM CCS ‘16) and BEAT (ACM CCS ‘18) achieve optimal communication complexity, growing linearly as a function of the number of nodes present. Although asymptotically optimal, their practical performance precludes their use in demanding applications. Further performance improvements to HoneyBadgerBFT and BEAT are not obvious as they run two separate sub-protocols for broadcast and voting, each of which has already been optimized. We describe how hashgraph — an asynchronous BFT atomic broadcast protocol (ABFT) — departs in structure from prior work by not using communication to vote, only to broadcast transactions. We perform an extensive empirical study to understand how hashgraph’s structure affects performance. We observe that hashgraph can improve latency by an order of magnitude over HoneyBadgerBFT and BEAT, while keeping throughput constant with the same number of nodes; similarly, throughput can increase by up to an order of magnitude while maintaining latency. Furthermore, we test hashgraph’s capability for high performance, and conclude that it can achieve sufficiently high throughput and low latency to support demanding practical applications.","PeriodicalId":350108,"journal":{"name":"2020 International Conference on Omni-layer Intelligent Systems (COINS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Omni-layer Intelligent Systems (COINS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COINS49042.2020.9191430","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

Abstract

Atomic broadcast protocols are increasingly used to build distributed ledgers. The most robust protocols achieve byzantine fault tolerance (BFT) and operate in asynchronous networks. Recent proposals such as HoneyBadgerBFT (ACM CCS ‘16) and BEAT (ACM CCS ‘18) achieve optimal communication complexity, growing linearly as a function of the number of nodes present. Although asymptotically optimal, their practical performance precludes their use in demanding applications. Further performance improvements to HoneyBadgerBFT and BEAT are not obvious as they run two separate sub-protocols for broadcast and voting, each of which has already been optimized. We describe how hashgraph — an asynchronous BFT atomic broadcast protocol (ABFT) — departs in structure from prior work by not using communication to vote, only to broadcast transactions. We perform an extensive empirical study to understand how hashgraph’s structure affects performance. We observe that hashgraph can improve latency by an order of magnitude over HoneyBadgerBFT and BEAT, while keeping throughput constant with the same number of nodes; similarly, throughput can increase by up to an order of magnitude while maintaining latency. Furthermore, we test hashgraph’s capability for high performance, and conclude that it can achieve sufficiently high throughput and low latency to support demanding practical applications.
哈希图协议:高吞吐量分布式账本的高效异步BFT
原子广播协议越来越多地用于构建分布式账本。最健壮的协议实现拜占庭容错(BFT)并在异步网络中运行。最近的提案,如HoneyBadgerBFT (ACM CCS ' 16)和BEAT (ACM CCS ' 18),实现了最佳的通信复杂性,作为节点数量的函数线性增长。虽然渐近最优,但它们的实际性能妨碍了它们在要求苛刻的应用中使用。HoneyBadgerBFT和BEAT的进一步性能改进并不明显,因为它们运行两个独立的子协议用于广播和投票,每个子协议都已经进行了优化。我们描述了哈希图——一种异步BFT原子广播协议(ABFT)——如何在结构上与以前的工作不同,它不使用通信来投票,只使用广播事务。我们进行了广泛的实证研究,以了解哈希图的结构如何影响性能。我们观察到,hashgraph可以在保持相同节点数量的吞吐量不变的情况下,比HoneyBadgerBFT和BEAT提高一个数量级的延迟;类似地,在保持延迟的情况下,吞吐量可以增加一个数量级。此外,我们测试了hashgraph的高性能能力,并得出结论,它可以实现足够高的吞吐量和低延迟,以支持要求苛刻的实际应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信