Transaction Capacity, Security and Latency in Blockchains

arXiv:2402.10138v1 Announce Type: new
Abstract: We analyze how secure a block is after the block becomes k-deep, i.e., security-latency, for Nakamoto consensus under an exponential network delay model. We give parameter regimes for which transactions are safe when sufficiently deep in the chain. We compare our results for Nakamoto consensus under bounded network delay models and obtain analogous bounds for safety violation threshold. Next, modeling the blockchain system as a batch service queue with exponential network delay, we connect the …

arxiv block blockchains cs.cr cs.dc cs.dm cs.it latency math.it network parameter results safe security transaction transactions under