Danviles：多路复用拜占庭协议以解锁区块链性能
Dandelion: multiplexing Byzantine agreements to unlock blockchain performance
摘要：
众所周知，无需许可的区块链协议消耗了大量的计算能力，并且在交易确认的延迟和信心之间进行权衡。最近提出的Algorand区块链协议采用拜占庭协议，并显示出秒级的交易确认延迟。其对拒绝服务和Sybil攻击的强大恢复能力以及较低的计算能力使其成为跨行业分散经济和商业生态系统的有力候选者。然而，Algorand的吞吐量仍然远远不能满足这些应用的要求。在本文中，我们授权Algorand的协议，通过复用其拜占庭协议，以提高性能。在具有多达一万个节点的广域网上的实验表明，与原始Algorand协议相比，吞吐量增加了4倍。
英文摘要：
Permissionless blockchain protocols are known to consume an outrageous amount of computing power and suffer from a trade-off between latency and confidence in transaction confirmation. The recently proposed Algorand blockchain protocol employs Byzantine agreements and has shown transaction confirmation latency on the order of seconds. Its strong resilience to Denial-of-Service and Sybil attacks and its low computing power footprint make it a strong candidate for the venue of decentralized economies and business ecosystems across industries. Nevertheless, Algorand's throughput is still far from the requirements of such applications. In this paper, we empower Algorand's protocol by multiplexing its byzantine agreements in order to improve performance. Experiments on wide area networks with up to ten thousand nodes show a 4-fold throughput increase compared to the original Algorand protocol.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
