论文标题
无体块繁殖:TPS完全可扩展的区块链,并进行预验证
Bodyless Block Propagation: TPS Fully Scalable Blockchain with Pre-Validation
论文作者
论文摘要
尽管事先尝试增加区块链系统每秒(TPS)的交易,但许多人牺牲了权力下放和安全。本文提出了一个无体块传播(BBP)方案,该方案未在块传播过程中验证和传输块体,以增加TPS而不会损害安全性。区块链网络中的节点预测交易及其在下一个即将到来的区块中的订购,因此可以在块诞生之前预先执行并预先验证这些交易。对于具有$ N $节点的网络,我们的理论分析表明,BBP可以将TPS的可伸缩性从$ O(1/log(n))$提高到$ O(1)$。 确保在下一个块的交易内容上达成共识至关重要。我们提出了一种交易选择,排序和同步算法以驱动此共识。为了解决不确定的共依基地址问题,我们进一步介绍了一种不可抵抗的交易算法,以确保一致且TPS效率高效的方案。使用BBP,大多数交易在块传播过程中既不需要验证也不需要传输,从而从交易块依赖项中解放了系统并使TPS可扩展。理论分析和实验都强调了BBP的完整TPS可伸缩性的潜力。实验结果表明,与以太坊区块链相比,块传播时间的缩短了4倍,TPS性能受节点硬件而不是块传播的限制。
Despite numerous prior attempts to boost transaction per second (TPS) of blockchain systems, many sacrifice decentralization and security. This paper proposes a bodyless block propagation (BBP) scheme for which the blockbody is not validated and transmitted during block propagation, to increase TPS without compromising security. Nodes in the blockchain network anticipate the transactions and their ordering in the next upcoming block so that these transactions can be pre-executed and pre-validated before the block is born. For a network with $N$ nodes, our theoretical analysis reveals that BBP can improve TPS scalability from $O(1/log(N))$ to $O(1)$. Ensuring consensus on the next block's transaction content is crucial. We propose a transaction selection, ordering, and synchronization algorithm to drive this consensus. To address the undetermined Coinbase address issue, we further present an algorithm for such unresolvable transactions, ensuring a consistent and TPS-efficient scheme. With BBP, most transactions require neither validation nor transmission during block propagation, liberating system from transaction-block dependencies and rendering TPS scalable. Both theoretical analysis and experiments underscore BBP's potential for full TPS scalability. Experimental results reveal a 4x reduction in block propagation time compared to Ethereum blockchain, with TPS performance being limited by node hardware rather than block propagation.