While many researchers adopt a sharding approach to design scaling blockchains, few works have studied the transaction placement problem incurred by sharding protocols. The widely-used hashing placement algorithm renders an overwhelming portion of transactions as cross-shard. In this paper, we analyze the high cost of cross-shard transactions and reveal that most Bitcoin transactions have simple dependencies and can become single-shard under a placement algorithm taking transaction dependencies into account. In addition, we perform a case study of OptChain, which is the state-of-the-art transaction placement algorithm for sharded blockchains, and find a defect of it. A fix is proposed, and our evaluation results demonstrate that the fix helps OptChain improve the system throughput by 4x.
翻译:虽然许多研究人员在设计缩放链时采取了碎片化方法,但很少有人研究过裁剪程序引起的交易安排问题。广泛使用的散列算法使绝大多数交易成为交叉碎片化的交易。在本文中,我们分析了交叉碎裂交易的高昂成本,并揭示了大多数比特币交易具有简单的依赖性,并且可以在考虑到交易依赖性的情况下,在一种职位安排算法下变成单一碎片。此外,我们还对Optchain(Optchain)进行了案例研究,这是对碎裂的条块进行的最先进的交易安排算法,并发现了其中的一个缺陷。 提议了一个固定法,我们的评价结果表明,这个固定法有助于奥普特钱因公司将系统吞吐量改善4x。