Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915265072070656 |
|---|---|
| author | Doger, Mustafa Ulukus, Sennur Akar, Nail |
| author_facet | Doger, Mustafa Ulukus, Sennur Akar, Nail |
| contents | Theoretical guarantees for double spending probabilities for the Nakamoto consensus under the $k$-deep confirmation rule have been extensively studied for zero/bounded network delays and fixed mining rates. In this paper, we introduce a ruin-theoretical model of double spending for Nakamoto consensus under the $k$-deep confirmation rule when the honest mining rate is allowed to be an arbitrary function of time including the block delivery periods, i.e., time periods during which mined blocks are being delivered to all other participants of the network. Time-varying mining rates are considered to capture the intrinsic characteristics of the peer to peer network delays as well as dynamic participation of miners such as the gap game and switching between different cryptocurrencies. Ruin theory is leveraged to obtain the double spend probabilities and numerical examples are presented to validate the effectiveness of the proposed analytical method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_18599 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory Doger, Mustafa Ulukus, Sennur Akar, Nail Cryptography and Security Distributed, Parallel, and Cluster Computing Discrete Mathematics Information Theory Probability Theoretical guarantees for double spending probabilities for the Nakamoto consensus under the $k$-deep confirmation rule have been extensively studied for zero/bounded network delays and fixed mining rates. In this paper, we introduce a ruin-theoretical model of double spending for Nakamoto consensus under the $k$-deep confirmation rule when the honest mining rate is allowed to be an arbitrary function of time including the block delivery periods, i.e., time periods during which mined blocks are being delivered to all other participants of the network. Time-varying mining rates are considered to capture the intrinsic characteristics of the peer to peer network delays as well as dynamic participation of miners such as the gap game and switching between different cryptocurrencies. Ruin theory is leveraged to obtain the double spend probabilities and numerical examples are presented to validate the effectiveness of the proposed analytical method. |
| title | Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory |
| topic | Cryptography and Security Distributed, Parallel, and Cluster Computing Discrete Mathematics Information Theory Probability |
| url | https://arxiv.org/abs/2412.18599 |