Generic Selfish Mining MDP for DAG Protocols

• URL: http://arxiv.org/abs/2309.11924v2
• Date: Tue, 30 Apr 2024 13:46:10 GMT
• Title: Generic Selfish Mining MDP for DAG Protocols
• Authors: Patrik Keller,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Selfish Mining is strategic rule-breaking to maximize rewards in proof-of-work protocols [3] and Markov Decision Processes (MDPs) are the preferred tool for finding optimal strategies in Bitcoin [4, 10] and similar linear chain protocols [12]. Protocols increasingly adopt non-sequential chain structures [11], for which MDP analysis is more involved [2]. To date, researchers have tailored specific attack spaces for each protocol [2, 4, 5, 7, 10, 12]. Assumptions differ, and validating and comparing results is difficult. To overcome this, we propose a generic attack space that supports a wide range of DAG protocols, including Ethereum, Fruitchains, and Parallel Proof-of-Work. Our approach is modular: we specify each protocol as one program, and then derive the Selfish Mining MDPs automatically.

Related papers

• Faster Randomized Dynamical Decoupling [0.9831489366502301]
  We show that a randomized protocol using a few pulses can outperform deterministic DD protocols that require considerably more pulses. We also present numerical simulations confirming the significant advantage of using randomized protocols.
  arXiv  Detail & Related papers  (2024-09-27T01:01:13Z)
• 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)
• 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)
• Beyond the Prototype: Divide-and-conquer Proxies for Few-shot Segmentation [63.910211095033596]
  Few-shot segmentation aims to segment unseen-class objects given only a handful of densely labeled samples. We propose a simple yet versatile framework in the spirit of divide-and-conquer. Our proposed approach, named divide-and-conquer proxies (DCP), allows for the development of appropriate and reliable information.
  arXiv  Detail & Related papers  (2022-04-21T06:21:14Z)
• 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)
• Minimum Entanglement Protocols for Function Estimation [0.0]
  We prove necessary and sufficient conditions for the existence of optimal protocols using at most $k$-partite entanglement. Our protocols require some amount of time-dependent control, and we show that a related class of time-independent protocols fail to achieve optimal scaling for generic functions.
  arXiv  Detail & Related papers  (2021-10-14T18:00:00Z)
• Discrete-variable quantum key distribution with homodyne detection [14.121646217925441]
  We propose a protocol that combines the simplicity of quantum state preparation in DV-QKD together with the cost-effective and high-bandwidth of homodyne detectors used in CV-QKD. Our simulation suggests that the protocol is suitable for secure and high-speed practical key distribution over distances.
  arXiv  Detail & Related papers  (2021-09-01T17:12:28Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• 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.