We investigate the time to consensus in Nakamoto blockchains. Specifically, we consider two competing growth processes, labeled \emph{honest} and \emph{adversarial}, and determine the time after which the honest process permananetly exceeds the adversarial process. This is done via queueing techniques. The predominant difficulty is that the honest growth process is subject to \emph{random delays}. In a stylized Bitcoin model, we compute the Laplace transform for the time to consensus and verify it via simulation.
@article{arxiv.2511.12687,
title = {The Time to Consensus in a Blockchain: Insights into Bitcoin's "6 Blocks Rule''},
author = {Partha S. Dey and Aditya S. Gopalan and Vijay G. Subramanian},
journal= {arXiv preprint arXiv:2511.12687},
year = {2025}
}