Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2020-03-29 DOI:10.4230/LIPIcs.DISC.2020.47

Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang

{"title":"Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency","authors":"Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang","doi":"10.4230/LIPIcs.DISC.2020.47","DOIUrl":null,"url":null,"abstract":"This paper investigates the problem \\textit{good-case latency} of Byzantine agreement, broadcast and state machine replication in the synchronous authenticated setting. The good-case latency measure captures the time it takes to reach agreement when all non-faulty parties have the same input (or in BB/SMR when the sender/leader is non-faulty) and all messages arrive instantaneously. Previous result implies a lower bound showing that any Byzantine agreement or broadcast protocol tolerating more than $n/3$ faults must have a good-case latency of at least $\\Delta$ \\cite{synchotstuff}, where $\\Delta$ is the assumed maximum message delay. Our first result is a matching tight upper bound for a family of protocols we call $1\\Delta$. We propose a protocol $1\\Delta$-BA that solves Byzantine agreement in the synchronous and authenticated setting with optimal good-case latency of $\\Delta$ and optimal resilience $f<n/2$. We then extend our protocol and present $1\\Delta$-BB and $1\\Delta$-SMR for Byzantine fault tolerant broadcast and state machine replication, respectively, in the same setting and with the same optimal good-case latency of $\\Delta$ and $f<n/2$ fault tolerance. Our $1\\Delta$-SMR upper bound closes the gap between the best current solution, Sync HotStuff, which obtains a good-case latency of $2\\Delta$ per command and the lower bound of $\\Delta$ on good-case latency. Finally, we investigate weaker notions of the synchronous setting and show how to adopt the $1\\Delta$ approach to these models.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"22 1","pages":"47:1-47:3"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... International Symposium on High Performance Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.DISC.2020.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

Abstract

This paper investigates the problem \textit{good-case latency} of Byzantine agreement, broadcast and state machine replication in the synchronous authenticated setting. The good-case latency measure captures the time it takes to reach agreement when all non-faulty parties have the same input (or in BB/SMR when the sender/leader is non-faulty) and all messages arrive instantaneously. Previous result implies a lower bound showing that any Byzantine agreement or broadcast protocol tolerating more than $n/3$ faults must have a good-case latency of at least $\Delta$ \cite{synchotstuff}, where $\Delta$ is the assumed maximum message delay. Our first result is a matching tight upper bound for a family of protocols we call $1\Delta$. We propose a protocol $1\Delta$-BA that solves Byzantine agreement in the synchronous and authenticated setting with optimal good-case latency of $\Delta$ and optimal resilience $f

查看原文本刊更多论文

简短公告:拜占庭协议，广播和状态机复制具有最佳的良好情况延迟

研究了同步认证环境下拜占庭协议、广播和状态机复制的\textit{良好情况延迟}问题。良好情况延迟度量捕获在所有非故障方具有相同输入(或在BB/SMR中，当发送方/领导是非故障时)并且所有消息都立即到达时达成协议所需的时间。前面的结果暗示了一个下界，表明任何拜占庭协议或广播协议容忍超过$n/3$错误必须具有至少$\Delta$\cite{synchotstuff}的好情况延迟，其中$\Delta$是假定的最大消息延迟。我们的第一个结果是我们称为$1\Delta$的协议族的匹配紧上界。我们提出了一个协议$1\Delta$ -BA，它解决了同步和身份验证设置中的拜占庭协议，具有最佳的良好情况延迟$\Delta$和最佳的弹性$f

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the ... International Symposium on High Performance Distributed Computing

自引率

0.00%

发文量

京公网安备 11010802042870号

Book学术文献互助群
群号：604180095