Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory

• URL: http://arxiv.org/abs/2412.18599v1
• Date: Tue, 24 Dec 2024 18:54:30 GMT
• Title: Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory
• Authors: Mustafa Doger, Sennur Ulukus, Nail Akar,
• Abstract summary: We introduce a ruin-theoretical model of double spending for Nakamoto consensus under the $k$-deep confirmation rule. Time-varying mining rates are considered to capture the intrinsic characteristics of the peer to peer network delays.
• Score: 33.689236895881216
• License:
• Abstract: 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.

Related papers

• Theoretical Analysis on Block Time Distributions in Byzantine Fault-Tolerant Consensus Blockchains [0.0]
  We propose a mathematical model to account for the processes of block propagation and validation within Byzantine fault-tolerant consensus blockchains. We derive an approximate formula for the block time distribution suitable for data analysis purposes.
  arXiv  Detail & Related papers  (2024-07-19T13:30:46Z)
• Model-based Analysis of Mining Fairness in a Blockchain [2.9281463284266973]
  Mining fairness in blockchain refers to equality between the computational resources invested in mining and the block rewards received. We propose a method for calculating mining fairness using a simple mathematical model. We validated by blockchain network simulations that our method computes mining fairness in networks much more accurately than existing methods.
  arXiv  Detail & Related papers  (2024-06-02T02:27:28Z)
• Targeted Nakamoto: A Bitcoin Protocol to Balance Network Security and Energy Consumption [0.0]
  Targeted Nakamoto is a Proof-of-Work protocol augmentation that incentivizes miners to hone in on a target hashrate interval. When hashrate is above target a ceiling is placed on the block reward a miner can receive. When hashrate is below target a floor is placed underneath the miner's block reward.
  arXiv  Detail & Related papers  (2024-05-23T22:26:25Z)
• Security, Latency, and Throughput of Proof-of-Work Nakamoto Consensus [4.738177482027387]
  This paper investigates the fundamental trade-offs between block safety, confirmation latency, and transaction throughput of proof-of-work protocols. New upper and lower bounds are derived for the probability of block safety violations as a function of honest and adversarial mining rates. The study uncovers a fundamental trade-off between transaction throughput and confirmation latency, ultimately determined by the desired fault tolerance and the rate at which block propagation delay increases with block size.
  arXiv  Detail & Related papers  (2023-12-09T09:03:14Z)
• Cryptocurrency Portfolio Optimization by Neural Networks [81.20955733184398]
  This paper proposes an effective algorithm based on neural networks to take advantage of these investment products. A deep neural network, which outputs the allocation weight of each asset at a time interval, is trained to maximize the Sharpe ratio. A novel loss term is proposed to regulate the network's bias towards a specific asset, thus enforcing the network to learn an allocation strategy that is close to a minimum variance strategy.
  arXiv  Detail & Related papers  (2023-10-02T12:33:28Z)
• Towards a Theory of Maximal Extractable Value II: Uncertainty [4.07926531936425]
  Maximal Extractable Value (MEV) is value extractable by temporary monopoly power commonly found in decentralized systems. This extraction stems from a lack of user privacy upon transaction submission and the ability of a monopolist validator to reorder, add, and/or censor transactions. We show that neither fair ordering techniques nor economic mechanisms can individually mitigate MEV for arbitrary payoff functions.
  arXiv  Detail & Related papers  (2023-09-25T15:01:11Z)
• Patch-level Routing in Mixture-of-Experts is Provably Sample-efficient for Convolutional Neural Networks [74.68583356645276]
  In deep learning, mixture-of-experts (MoE) activates one or few experts (sub-networks) on a per-sample or per-token basis. We show for the first time that pMoE provably reduces the required number of training samples to achieve desirable generalization.
  arXiv  Detail & Related papers  (2023-06-07T00:16:10Z)
• Robustness Certificates for Implicit Neural Networks: A Mixed Monotone Contractive Approach [60.67748036747221]
  Implicit neural networks offer competitive performance and reduced memory consumption. They can remain brittle with respect to input adversarial perturbations. This paper proposes a theoretical and computational framework for robustness verification of implicit neural networks.
  arXiv  Detail & Related papers  (2021-12-10T03:08:55Z)
• Permutation Compressors for Provably Faster Distributed Nonconvex Optimization [68.8204255655161]
  We show that the MARINA method of Gorbunov et al (2021) can be considered as a state-of-the-art method in terms of theoretical communication complexity. Theory of MARINA to support the theory of potentially em correlated compressors, extends to the method beyond the classical independent compressors setting.
  arXiv  Detail & Related papers  (2021-10-07T09:38:15Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.