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 incorporate early exchanges of unconfirmed transactions into the block propagation protocol. In this work, we take a different approach, maintaining transaction synchronization externally (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 static connected graphs in a time bounded by the diameter of the graph. In graphs with dynamic edges, SREP converges in an expected time that is linear in the number of nodes. We confirm our analytical findings through extensive simulations that include comparisons with MempoolSync, a recent approach from the literature. Our simulations show that SREP incurs reasonable bandwidth overhead and scales gracefully with the size of the network (unlike MempoolSync).

中文翻译：

---

大型动态区块链网络的带外交易池同步

交易池同步（内存池）已显示出改善最先进区块链的性能和块传播延迟的潜力。事实上，文献中已经提出了各种启发式方法来纳入早期的交流未证实交易进入区块传播协议。在这项工作中，我们采用了不同的方法，在块传播通道的外部（并且独立地）维护事务同步。在此过程中，我们在图论框架内形式化了同步问题，并引入了一种新颖的算法（SREP—集合协调增强传播）具有可量化的保证。我们分析了该算法在各种现实网络拓扑中的性能，并表明它在受图直径限制的时间内收敛于静态连接图。在具有动态边的图中，SREP在与节点数量呈线性关系的预期时间内收敛。我们通过广泛的模拟证实了我们的分析结果，其中包括与内存池同步，最近文献中的一种方法。我们的模拟表明SREP产生合理的带宽开销，并随着网络的大小优雅地扩展（与内存池同步）。