English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Synchronization of transaction pools (mempools) has shown potential forimproving the performance and block propagation delay of state-of-the-artblockchains. Indeed, various heuristics have been proposed in the literature tothis end, all of which incorporate exchanges of unconfirmed transactions intotheir block propagation protocol. In this work, we take a different approach,maintaining transaction synchronization outside (and independently) of theblock propagation channel. In the process, we formalize the synchronizationproblem 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 networktopologies, and show that it converges on any connected graph in a number ofsteps that is bounded by the diameter of the graph. We confirm our analyticalfindings through extensive simulations that include comparison withMempoolSync, a recent approach from the literature. Our simulations show thatSREP incurs reasonable overall bandwidth overhead and, unlike MempoolSync,scales gracefully with the size of the network.

SREP: Out-Of-Band Sync of Transaction Pools for Large-Scale Blockchains