发表机构
National University of Singapore; University of Stavanger; Friedrich-Alexander-Universität Erlangen-Nürnberg（新加坡国立大学; 斯塔万格大学; 埃尔朗根-纽伦堡大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本研究提出首个在完全异步网络中为基于DAG的拜占庭原子广播提供无缝重配置的协议，允许DAG在成员变化时持续增长，无需停机，解决了现有方案需暂停或延迟变更的问题。
AI 中文摘要
异步网络中的拜占庭原子广播已被广泛研究数十年。FLP不可能性结果排除了完全异步环境中确定性共识的可能性，这促使了将可靠广播与私有硬币相结合的随机化协议，以实现概率为1的终止。最近，DAG-Rider推广了一种新的抽象，其中进程持续可靠地广播区块以构建有向无环图（DAG），然后使用随机完美硬币在本地推导出全序。这种将传播与排序分离的做法重新激发了人们对异步基于DAG的拜占庭容错的兴趣，并催生了许多旨在改善预期延迟或吞吐量的协议。然而，重配置问题在很大程度上仍未得到探索。现有的基于DAG的BFT协议通常假设进程集合是静态的，而实际部署的系统必须偶尔根据运营需求添加或移除节点。现有解决方案并非无缝；它们要么暂停系统，要么将成员变更延迟到预定的周期边界。这可能不切实际，并可能引入停机时间。然而，无缝解决方案并非易事；就何时开始使用新配置达成一致可能会产生一个逻辑轮次号，而该轮次号已被并发的异步传播所超越。在这项工作中，我们提出了一种用于异步基于DAG的拜占庭原子广播的无缝重配置协议。我们的协议允许DAG在成员资格及相应的法定人数阈值发生变化时继续增长，而无需停止系统。据我们所知，我们的协议是首个在完全异步网络中为基于DAG的拜占庭原子广播提供无缝重配置的协议。
英文摘要
Byzantine Atomic Broadcast in Asynchronous networks has been studied extensively for decades. The FLP impossibility result rules out deterministic consensus in a fully asynchronous setting, motivating randomized protocols that combine reliable broadcast with private coins to achieve termination with probability one. More recently, DAG-Rider popularized a new abstraction in which processes continuously reliably broadcast blocks to construct a directed acyclic graph (DAG) and then locally derive a total order using a randomized perfect coin. This separation of dissemination from ordering has renewed interest in asynchronous DAG-based Byzantine fault tolerance and inspired numerous protocols that improve expected latency or throughput. Reconfiguration, however, remains largely unexplored. Existing DAG-based BFT protocols generally assume a static set of processes, whereas deployed systems must occasionally add or remove nodes in response to operational demands. Existing solutions are not seamless; they either pause the system or delay membership changes until a predetermined epoch boundary. This may be impractical and can introduce downtime. However, a seamless solution is non-trivial; agreement on when to start utilizing a new configuration may yield a logical round number that was already surpassed by the concurrent asynchronous dissemination. In this work, we present a seamless reconfiguration protocol for asynchronous DAG-based Byzantine atomic broadcast. Our protocol allows the DAG to continue growing while the membership and corresponding quorum thresholds change, without halting the system. To the best of our knowledge, ours is the first protocol to provide seamless reconfiguration for DAG-based Byzantine atomic broadcast in a fully asynchronous network.
CommentsIn submission
