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.

翻译：众所周知,无自由的连锁协议消耗了巨大的计算能力,在交易确认的延迟和信心之间也存在权衡问题。最近提议的阿尔高朗块链协议采用拜占庭协议,并在几秒钟内表现出交易确认的延迟性。对拒绝服务和Sybil袭击及其低计算功率足迹的强大抵抗力使它成为各行业分散的经济体和商业生态系统所在地的强大候选人。然而,阿尔高朗的吞吐量仍远未达到这种应用的要求。在本文中,我们赋予阿尔高朗协议权力,通过多重使用赞庭协议来改进绩效。在广域网络上进行的实验显示,与最初的阿尔高朗协议相比,高达一万个节点的实验显示了四倍的吞吐量增长。