Synchronization of transaction pools (mempools) has shown potential for improving the performance and block propagation delay of state-of-the-art blockchains. Indeed, various heuristics have been proposed in the literature to this end, all of which incorporate exchanges of unconfirmed transactions into their block propagation protocol. In this work, we take a different approach, maintaining transaction synchronization outside (and independently) of the block propagation channel. In the process, we formalize the synchronization problem within a graph theoretic framework and introduce a novel algorithm (SREP - Set Reconciliation-Enhanced Propagation) with quantifiable guarantees. We analyze the algorithm's performance for various realistic network topologies, and show that it converges on any connected graph in a number of steps that is bounded by the diameter of the graph. We confirm our analytical findings through extensive simulations that include comparison with MempoolSync, a recent approach from the literature. Our simulations show that SREP incurs reasonable overall bandwidth overhead and, unlike MempoolSync, scales gracefully with the size of the network.
翻译:交易池同步已经显示出提高最先进区块链的性能和块传播延迟的潜力。事实上,文献中提出了各种启发式方法来实现这一点,其中所有方法都将未确认交易交换到其块传播协议中。在本文中,我们采取了一种不同的方法,将交易同步保持在块传播频道之外(和独立于其之外)。在此过程中,我们在图论框架内形式化同步问题,并引入一个具有可量化保证的新算法(SREP - 集合协调增强传播)。我们分析了该算法在各种现实网络拓扑中的性能,并展示了它在任何连通图上都可以收敛,步数受限于该图的直径。我们通过包括与文献中最近的方法MempoolSync的比较在内的广泛模拟来确认我们的分析结果。我们的模拟显示,与MempoolSync不同,SREP具有合理的总带宽开销,并且可以优雅地扩展到网络的规模。