ONLAY：可扩展异步BFT系统的在线分层
ONLAY: Online Layering for scalable asynchronous BFT system
摘要：
本文提出了一个新的框架，即\emph{\onlay}，可扩展的异步分布式系统。在此框架下，我们提出了一个基于Lachesis协议\cite{lachesis01}的共识协议$L_ϕ$.在$L_ϕ$协议的核心部分，介绍了在无领导的异步有向无环图（DAG）中使用分层算法实现实用的拜占庭容错（pBFT）。此外，我们提出了新的在线分层算法的进化DAG跨节点。我们的新协议通过使用分配的层和具有逻辑时间排序的异步偏序集而不是区块链，在异步pBFT中实现了可确定的可扩展共识。由$L_ϕ$产生的部分排序是灵活的，但在分布式节点系统中是一致的。然后，我们提出了我们的基于分层的共识的正式模型。该模型是广义的，可以应用于抽象的异步基于DAG的分布式系统。
英文摘要：
This paper presents a new framework, namely \emph{\onlay}, for scalable asynchronous distributed systems. In this framework, we propose a consensus protocol $L_ϕ$, which is based on the Lachesis protocol~\cite{lachesis01}. At the core of $L_ϕ$ protocol, it introduces to use layering algorithm to achieve practical Byzantine fault tolerance (pBFT) in leaderless asynchronous Directed Acyclic Graph (DAG). Further, we present new online layering algorithms for the evolutionary DAGs across the nodes. Our new protocol achieves determistic scalable consensus in asynchronous pBFT by using assigned layers and asynchronous partially ordered sets with logical time ordering instead of blockchains. The partial ordering produced by $L_ϕ$ is flexible but consistent across the distributed system of nodes. We then present the formal model of our layering-based consensus. The model is generalized that can be applied to abstract asynchronous DAG-based distributed systems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
