Stability of local tip pool sizes
share
In distributed ledger technologies (DLTs) with a directed acyclic graph (DAG) data structure, a block-issuing node can decide where to append new blocks and, consequently, how the DAG grows. This DAG data structure is typically decomposed into two pools of blocks, dependent on whether another block already references them. The unreferenced blocks are called the tips. Due to network delay, nodes can perceive the set of tips differently, giving rise to local tip pools. We present a new mathematical model to analyse the stability of the different local perceptions of the tip pools and allow heterogeneous and random network delay in the underlying peer-to-peer communication layer. Under natural assumptions, we prove that the number of tips is ergodic, converges to a stationary distribution, and provide quantitative bounds on the tip pool sizes. We conclude our study with agent-based simulations to illustrate the convergence of the tip pool sizes and the pool sizes' dependence on the communication delay and degree of centralization.
READ FULL TEXT