Model-based Analysis of Mining Fairness in a Blockchain
- URL: http://arxiv.org/abs/2406.00595v2
- Date: Wed, 05 Feb 2025 15:15:25 GMT
- Title: Model-based Analysis of Mining Fairness in a Blockchain
- Authors: Akira Sakurai, Kazuyuki Shudo,
- Abstract summary: 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.
- Score: 2.9281463284266973
- License:
- Abstract: Mining fairness in blockchain refers to equality between the computational resources invested in mining and the block rewards received. There exists a dilemma wherein increasing the transaction processing capacity of a blockchain compromises mining fairness, which consequently undermines its decentralization. This dilemma remains unresolved even with methods such as the greedy heaviest observed subtree (GHOST) protocol, indicating that mining fairness is an inherent bottleneck in the transaction processing capacity of the blockchain system. However, despite its significance, there have been insufficient research studies that have quantitatively analyzed mining fairness. In this paper, we propose a method for calculating mining fairness. First, we approximated a complex blockchain network using a simple mathematical model, assuming that no more than two blocks are generated per round. Within this model, we quantitatively determined local mining fairness and derived several measures of global mining fairness based on local mining fairness. Subsequently, we validated by blockchain network simulations that our calculation method computes mining fairness in networks much more accurately than existing methods. Finally, we analyzed various networks from the perspective of mining fairness.
Related papers
- Collaborative Proof-of-Work: A Secure Dynamic Approach to Fair and Efficient Blockchain Mining [0.1759252234439348]
This paper introduces a novel Collaborative Proof-of-Work (CPoW) mining approach designed to enhance efficiency and fairness in the network.
By addressing the centralization and energy inefficiencies of traditional mining, this research contributes to a more sustainable blockchain ecosystem.
arXiv Detail & Related papers (2024-12-01T05:59:27Z) - Bitcoin Under Volatile Block Rewards: How Mempool Statistics Can Influence Bitcoin Mining [5.893888881448058]
As Bitcoin experiences more halving events, the protocol reward converges to zero, making transaction fees the primary source of miner rewards.
Previous security analyses of Bitcoin have either considered a fixed block reward model or a highly simplified volatile model.
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) - BlockFound: Customized blockchain foundation model for anomaly detection [47.04595143348698]
BlockFound is a customized foundation model for anomaly blockchain transaction detection.
We introduce a series of customized designs to model the unique data structure of blockchain transactions.
BlockFound is the only method that successfully detects anomalous transactions on Solana with high accuracy.
arXiv Detail & Related papers (2024-10-05T05:11:34Z) - Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains [5.864854777864723]
We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems.
We propose a novel selfish mining attack that aims to maximize expected relative revenue of the adversary.
We present a formal analysis procedure which computes an $epsilon$-tight lower bound on the optimal expected relative revenue in the MDP.
arXiv Detail & Related papers (2024-05-07T15:44:39Z) - Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities.
Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy.
This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
arXiv Detail & Related papers (2024-03-28T07:08:26Z) - 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) - Identifying contributors to supply chain outcomes in a multi-echelon setting: a decentralised approach [47.00450933765504]
We propose the use of explainable artificial intelligence for decentralised computing of estimated contributions to a metric of interest.
This approach mitigates the need to convince supply chain actors to share data, as all computations occur in a decentralised manner.
Results demonstrate the effectiveness of our approach in detecting the source of quality variations compared to a centralised approach.
arXiv Detail & Related papers (2023-07-22T20:03:16Z) - HDCoin: A Proof-of-Useful-Work Based Blockchain for Hyperdimensional
Computing [2.7462881838152913]
This paper introduces HDCoin, a blockchain-based framework for an emerging machine learning scheme: the brain-inspired hyperdimensional computing (HDC)
Under the HDC scenario, miners are competing to obtain the highest test accuracy on a given dataset.
The winner has its model recorded in the blockchain and are available for the public as a trustworthy HDC model.
arXiv Detail & Related papers (2022-02-07T06:21:29Z) - 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) - Faster Secure Data Mining via Distributed Homomorphic Encryption [108.77460689459247]
Homomorphic Encryption (HE) is receiving more and more attention recently for its capability to do computations over the encrypted field.
We propose a novel general distributed HE-based data mining framework towards one step of solving the scaling problem.
We verify the efficiency and effectiveness of our new framework by testing over various data mining algorithms and benchmark data-sets.
arXiv Detail & Related papers (2020-06-17T18:14:30Z) - Toward Low-Cost and Stable Blockchain Networks [10.790006312359795]
We propose a blockchain mining resources allocation algorithm to reduce the mining cost in PoW-based (proof-of-work-based) blockchain networks.
arXiv Detail & Related papers (2020-02-19T06:42:33Z)
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.