Automated Selfish Mining Analysis for DAG-based PoW Consensus Protocols

• URL: http://arxiv.org/abs/2501.10888v1
• Date: Sat, 18 Jan 2025 21:57:02 GMT
• Title: Automated Selfish Mining Analysis for DAG-based PoW Consensus Protocols
• Authors: Patrik Keller,
• Abstract summary: Selfish mining is strategic rule-breaking to maximize rewards in proof-of-work protocols. We propose a generic attack model that covers a wide range of protocols, including Proof-of-Work, GhostDAG, and Parallel Proof-of-Work.
• Score: 0.0
• License:
• Abstract: Selfish mining is strategic rule-breaking to maximize rewards in proof-of-work protocols. Markov Decision Processes (MDPs) are the preferred tool for finding optimal strategies in Bitcoin and similar linear chain protocols. Protocols increasingly adopt DAG-based chain structures, for which MDP analysis is more involved. To date, researchers have tailored specific MDPs for each protocol. Protocol design suffers long feedback loops, as each protocol change implies manual work on the MDP. To overcome this, we propose a generic attack model that covers a wide range of protocols, including Ethereum Proof-of-Work, GhostDAG, and Parallel Proof-of-Work. Our approach is modular: we specify each protocol as a concise program, and our tooling then derives and solves the selfish mining MDP automatically.

Related papers

• Subversion Strategy Eval: Evaluating AI's stateless strategic capabilities against control protocols [53.53802315778733]
  Previous work evaluated protocols by subverting them with a human-AI red team, where an AI follows the human-written strategy. This paper investigates how well AI systems can generate and act on strategies for subverting control protocols whilst operating without private memory.
  arXiv  Detail & Related papers  (2024-12-17T02:33:45Z)
• Automatic State Machine Inference for Binary Protocol Reverse Engineering [20.35198277628804]
  We propose an automatic PSM inference framework for unknown protocols. We refine a probabilistic PSM algorithm to infer protocol states and the transition conditions between these states. Experimental results show that, compared with existing PRE techniques, our method can infer PSMs while enabling more precise classification of protocols.
  arXiv  Detail & Related papers  (2024-12-03T16:33:17Z)
• Games for AI Control: Models of Safety Evaluations of AI Deployment Protocols [52.40622903199512]
  This paper introduces AI-Control Games, a formal decision-making model of the red-teaming exercise as a multi-objective, partially observable game. We apply our formalism to model, evaluate and synthesise protocols for deploying untrusted language models as programming assistants.
  arXiv  Detail & Related papers  (2024-09-12T12:30:07Z)
• Reusable Formal Verification of DAG-based Consensus Protocols [8.277981465630377]
  DAG-based consensus protocols are being adoption by blockchain companies to decrease energy footprints and improve security. This paper presents a safety-proven formal specification of two DAG-based protocols.
  arXiv  Detail & Related papers  (2024-07-02T11:19:12Z)
• DT-SIM: Property-Based Testing for MPC Security [2.0308771704846245]
  Property-based testing is effective for detecting security bugs in secure protocols. We specifically target Secure Multi-Party Computation (MPC) We devise a test that can detect various flaws in a bit-level implementation of an MPC protocol.
  arXiv  Detail & Related papers  (2024-03-08T02:02:24Z)
• Generic Selfish Mining MDP for DAG Protocols [0.0]
  Selfish Mining is strategic rule-breaking to maximize rewards in proof-of-work protocols. Our approach is modular: we specify each protocol as one program, and then derive the Selfish Mining MDPs automatically.
  arXiv  Detail & Related papers  (2023-09-21T09:34:37Z)
• Towards Semantic Communication Protocols: A Probabilistic Logic Perspective [69.68769942563812]
  We propose a semantic protocol model (SPM) constructed by transforming an NPM into an interpretable symbolic graph written in the probabilistic logic programming language (ProbLog) By leveraging its interpretability and memory-efficiency, we demonstrate several applications such as SPM reconfiguration for collision-avoidance.
  arXiv  Detail & Related papers  (2022-07-08T14:19:36Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Modular Deep Reinforcement Learning for Continuous Motion Planning with Temporal Logic [59.94347858883343]
  This paper investigates the motion planning of autonomous dynamical systems modeled by Markov decision processes (MDP) The novelty is to design an embedded product MDP (EP-MDP) between the LDGBA and the MDP. The proposed LDGBA-based reward shaping and discounting schemes for the model-free reinforcement learning (RL) only depend on the EP-MDP states.
  arXiv  Detail & Related papers  (2021-02-24T01:11:25Z)
• Planning in Markov Decision Processes with Gap-Dependent Sample Complexity [48.98199700043158]
  We propose MDP-GapE, a new trajectory-based Monte-Carlo Tree Search algorithm for planning in a Markov Decision Process. We prove an upper bound on the number of calls to the generative models needed for MDP-GapE to identify a near-optimal action with high probability.
  arXiv  Detail & Related papers  (2020-06-10T15:05:51Z)
• MAC Protocol Design Optimization Using Deep Learning [1.5469452301122173]
  We propose a novel DRL-based framework to systematically design and evaluate networking protocols. While other proposed ML-based methods mainly focus on tuning individual protocol parameters, our main contribution is to decouple a protocol into a set of parametric modules. As a case study, we introduce and evaluate DeepMAC, a framework in which a MAC protocol is decoupled into a set of blocks across popular flavors of 802.11s.
  arXiv  Detail & Related papers  (2020-02-06T02:36:52Z)

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.