TOB-SVD：Sleepy 模型中具有单投票决策的全序广播
TOB-SVD: Total-Order Broadcast with Single-Vote Decisions in the Sleepy Model
AI总结：
针对 sleepy 模型中动态参与的全序广播多轮投票瓶颈，提出 TOB-SVD，在容忍至多 1/2 拜占庭验证者的同时实现最佳情况下单阶段投票和更低预期延迟。
摘要：
在过去几年中，分布式共识研究已将其关注点扩展到应对大规模、无许可系统（例如区块链）中的挑战。这一转变反映了适应动态参与的需求，这与由持续在线的验证者组成的静态集合这一传统模型形成对比。Bitcoin 和 sleepy 模型等工作为这一不断发展的框架奠定了基础。Momose 和 Ren（CCS 2022）的显著贡献以及后续研究引入了利用 Graded Agreement 原语并支持动态参与的全序广播协议。然而，这些方法通常需要针对每个决策进行多个阶段的投票，这可能会给现实世界的大规模系统造成瓶颈。为了解决这一问题，本文提出了 TOB-SVD，这是 sleepy 模型中的一种新型全序广播协议，可抵御至多 1/2 的拜占庭验证者。TOB-SVD 在最佳情况下每个决策仅需一个投票阶段，并且与提供相同最优敌手容错能力的现有方法相比，实现了更低的预期延迟。这项工作为更实用的全序广播协议铺平了道路，这些协议可部署在涉及大量验证者且参与度随时间波动的现实世界系统中。
英文摘要：
Over the past years, distributed consensus research has expanded its focus to address challenges in large-scale, permissionless systems, such as blockchains. This shift reflects the need to accommodate dynamic participation, in contrast to the traditional model of a static set of continuously online validators. Works like Bitcoin and the sleepy model have laid the groundwork for this evolving framework. Notable contributions by Momose and Ren (CCS 2022), along with subsequent research, have introduced Total-Order Broadcast protocols that leverage Graded Agreement primitives and support dynamic participation. However, these approaches often require multiple phases of voting per decision, which can create a bottleneck for real-world, large-scale systems. To address this, our paper introduces TOB-SVD, a novel Total-Order Broadcast protocol in the sleepy model that is resilient to up to 1/2 Byzantine validators. TOB-SVD requires only a single phase of voting per decision in the best case and achieves lower expected latency compared to existing approaches offering the same optimal adversarial resilience. This work paves the way for more practical Total-Order Broadcast protocols that can be implemented in real-world systems involving a large number of validators with fluctuating participation over time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
