Bitcoin After Block Rewards
- URL: http://arxiv.org/abs/2606.05503v1
- Date: Wed, 03 Jun 2026 22:58:41 GMT
- Title: Bitcoin After Block Rewards
- Abstract summary: Bitcoin's block reward is scheduled to decline to zero, raising concerns about whether the network can remain secure once miners rely solely on transaction fees.<n>This paper seeks to identify the conditions under which large-scale and persistent deviation from honest mining can arise.
- Score: 1.9564357916871897
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Bitcoin's block reward is scheduled to decline to zero, raising concerns about whether the network can remain secure once miners rely solely on transaction fees. This paper seeks to identify the conditions under which large-scale and persistent deviation from honest mining can arise. We analyze and compare the payoffs of honest and deviating miners in a sequential decision model, and identify a deviation threshold $G_t$ at which honest mining ceases to be privately optimal. Around the 2024 Bitcoin halving, we show that current mining behavior does not exhibit large-scale or structural deviation. However, when the block reward is removed, the $G_t$ criterion implies that deviation can arise even with a very small fraction of transaction fees. Finally, we evaluate three protocol-level mechanisms: Base Fee, Fee Floor, and an adaptive maximum block size rule, and show that their combination raises the deviation threshold and mitigates incentive breakdown in a fee-only regime. These results provide a practical benchmark for assessing Bitcoin's security as block rewards disappear.
Related papers
- On the Incentive Compatibility of Block Propagation in Bitcoin [0.863301363716006]
Bitcoin is permissionless and does not rely on any central administrator.<n>It is important to incentivize miners to behave in ways that align with the interests of the system as a whole.<n>This paper asks whether miners are individually incentivized to propagate blocks.
arXiv Detail & Related papers (2026-06-05T03:04:42Z) - Incentive Attacks in BTC: Short-Term Revenue Changes and Long-Term Efficiencies [45.776687601070705]
Bitcoin's Difficulty Adjustment Algorithm (DAA) has been a source of vulnerability for incentive attacks such as selfish mining, block withholding and coin hopping strategies.<n>We study the short-term revenue change per hashpower of the adversarial and honest miners for these incentive attacks.<n>For block withholding strategies, it turns out, the honest miners outside the pool profit from the attack, usually even more than the attacker both in the short-term and the long-term.
arXiv Detail & Related papers (2025-11-14T18:18:17Z) - The Rich Get Richer in Bitcoin Mining Induced by Blockchain Forks [2.9281463284266973]
Fairness in the distribution of mining rewards plays a crucial role in preventing the concentration of computational power in a few miners.<n>If miners with greater computational resources receive disproportionately higher rewards, it indicates a threat to the system's decentralization.<n>This study analyzes TRGR in Bitcoin by focusing on unintentional blockchain forks.
arXiv Detail & Related papers (2025-06-16T11:03:50Z) - Demystifying Private Transactions and Their Impact in PoW and PoS Ethereum [43.548299433042835]
Private transactions, a specialized transaction type employed to evade public Peer-to-Peer (P2P) network broadcasting, remain largely unexplored.<n>We analyze large-scale datasets comprising 14,810,392 private transactions within a 15.5-month Proof-of-Work (PoW) dataset and 30,062,232 private transactions within a 15.5-month Proof-of-Stake (PoS) dataset.
arXiv Detail & Related papers (2025-03-30T16:45:18Z) - Dynamic User Competition and Miner Behavior in the Bitcoin Market [0.0]
We develop a dynamic model of the Bitcoin market where users set fees themselves and miners decide whether to operate and whom to validate based on those fees.<n>Our analysis reveals how, in equilibrium, users adjust their bids in response to short-term congestion.<n>We show that a block reward (a fixed reward paid to miners upon a block production) can mitigate these inefficiencies.
arXiv Detail & Related papers (2025-02-21T15:02:02Z) - Bitcoin under Volatile Block Rewards: How Mempool Statistics Can Influence Bitcoin Mining [7.273897301039592]
As Bitcoin experiences more halving events, the protocol reward converges to zero, making transaction fees the primary source of miner rewards.<n>Previous security analyses of Bitcoin have either considered a fixed block reward model or a highly simplified volatile model.<n>This paper presents a reinforcement learning-based tool to develop mining strategies under a more realistic volatile model.
arXiv Detail & Related papers (2024-11-18T16:29:20Z) - The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - Model-Based Calculation Method of Mining Fairness in Blockchain [1.0599439539657787]
Mining fairness in blockchain refers to equality between the computational resources invested in mining and the block rewards received.<n>We propose a method for calculating mining fairness that explicitly captures the influence of forks.
arXiv Detail & Related papers (2024-06-02T02:27:28Z) - Transaction Capacity, Security and Latency in Blockchains [45.776687601070705]
We analyze how secure a block is after the block becomes $k$-deep, i.e., security-latency, for Nakamoto consensus.<n>We connect the security-latency analysis to sustainable transaction rate of the queue system.
arXiv Detail & Related papers (2024-02-15T17:43:13Z) - Blockchain Large Language Models [65.7726590159576]
This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions.
The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
arXiv Detail & Related papers (2023-04-25T11:56:18Z) - 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.