Partial Selfish Mining for More Profits

• URL: http://arxiv.org/abs/2207.13478v2
• Date: Sat, 6 Apr 2024 14:00:20 GMT
• Title: Partial Selfish Mining for More Profits
• Authors: Jiaping Yu, Shang Gao, Rui Song, Zhiping Cai, Bin Xiao,
• Abstract summary: Mining attacks aim to gain an unfair share of extra rewards in the blockchain mining. In this paper, we propose a new and feasible Partial Selfish Mining (PSM) attack. We show that PSM attackers can be more profitable than selfish miners under a certain range of mining power and network conditions.
• Score: 21.636578888742477
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Mining attacks aim to gain an unfair share of extra rewards in the blockchain mining. Selfish mining can preserve discovered blocks and strategically release them, wasting honest miners' computing resources and getting higher profits. Previous mining attacks either conceal the mined whole blocks (hiding or discarding), or release them completely in a particular time slot (e.g., causing a fork). In this paper, we extend the mining attack's strategy space to partial block sharing, and propose a new and feasible Partial Selfish Mining (PSM) attack. We show that by releasing partial block data publicly and attracting rational miners to work on attacker's private branch, attackers and these attracted miners can gain an unfair share of mining rewards. We then propose Advanced PSM (A-PSM) attack that can further improve attackers' profits to be no less than the selfish mining. Both theoretical and experimental results show that PSM attackers can be more profitable than selfish miners under a certain range of mining power and network conditions. A-PSM attackers can gain even higher profits than both selfish mining and honest mining with attracted rational miners.

Related papers

• Mining Power Destruction Attacks in the Presence of Petty-Compliant Mining Pools [5.721770755917568]
  Bitcoin's security relies on its Proof-of-Work consensus, where miners solve puzzles to propose blocks. The puzzle's difficulty is set by the difficulty adjustment mechanism (DAM), based on the network's available mining power. Attacks that destroy some portion of mining power can exploit the DAM to lower difficulty, making such attacks profitable.
  arXiv  Detail & Related papers  (2025-02-11T09:44:41Z)
• BM-PAW: A Profitable Mining Attack in the PoW-based Blockchain System [9.292531856119329]
  We introduce a novel mining strategy, named BM-PAW, which yields superior rewards for both the attacker and the targeted pool. We find the BM-PAW attacker can circumvent the "miner's dilemma" through equilibrium analysis in a two-pool BM-PAW game scenario.
  arXiv  Detail & Related papers  (2024-11-09T13:59:55Z)
• Denial-of-Service Poisoning Attacks against Large Language Models [64.77355353440691]
  LLMs are vulnerable to denial-of-service (DoS) attacks, where spelling errors or non-semantic prompts trigger endless outputs without generating an [EOS] token. We propose poisoning-based DoS attacks for LLMs, demonstrating that injecting a single poisoned sample designed for DoS purposes can break the output length limit.
  arXiv  Detail & Related papers  (2024-10-14T17:39:31Z)
• LARM: Large Auto-Regressive Model for Long-Horizon Embodied Intelligence [68.27280750612204]
  Recent embodied agents are primarily built based on reinforcement learning (RL) or large language models (LLMs) In this work, we combine their advantages while avoiding the drawbacks by conducting the proposed referee RL on our developed large auto-regressive model (LARM) Specifically, LARM is built upon a lightweight LLM (fewer than 5B parameters) and directly outputs the next action to execute rather than text.
  arXiv  Detail & Related papers  (2024-05-27T17:59:32Z)
• Undetectable Selfish Mining [4.625489011466493]
  A strategic Bitcoin miner may profit by deviating from the intended Bitcoin protocol. We develop a selfish mining variant that is provably *statistically undetectable* We show that our strategy is strictly profitable for attackers with $38.2% ll 50%$ of the total hashrate.
  arXiv  Detail & Related papers  (2023-09-13T09:51:32Z)
• Smoothening block rewards: How much should miners pay for mining pools? [11.245119287096419]
  We quantify the economic advantage for a given miner of having smooth rewards. We use this to define a maximum percentage of rewards that a miner should be willing to pay for the mining pool services.
  arXiv  Detail & Related papers  (2023-09-05T14:59:01Z)
• Cobalt: Optimizing Mining Rewards in Proof-of-Work Network Games [6.052883613180156]
  A key factor affecting mining rewards earned is the connectivity between miners in the peer-to-peer network. We formulate the problem of deciding whom to connect to for miners as a bandit problem. A key contribution of our work is the use of network coordinates based model for learning the network structure within the bandit algorithm.
  arXiv  Detail & Related papers  (2023-07-10T16:50:58Z)
• Bitcoin-Enhanced Proof-of-Stake Security: Possibilities and Impossibilities [45.90740335615872]
  Bitcoin is the most secure blockchain in the world, supported by the immense hash power of its Proof-of-Work miners. Proof-of-Stake chains are energy-efficient, have fast finality but face several security issues. We show that these security issues are inherent in any PoS chain without an external trusted source. We propose a new protocol, Babylon, where an off-the-shelf PoS protocol checkpoints onto Bitcoin to resolve these issues.
  arXiv  Detail & Related papers  (2022-07-18T06:01:25Z)
• TaSPM: Targeted Sequential Pattern Mining [53.234101208024335]
  We propose a generic framework namely TaSPM, based on the fast CM-SPAM algorithm. We also propose several pruning strategies to reduce meaningless operations in mining processes. Experiments show that the novel targeted mining algorithm TaSPM can achieve faster running time and less memory consumption.
  arXiv  Detail & Related papers  (2022-02-26T17:49:47Z)
• 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.