EconPapers    
Economics at your fingertips  
 

Optimal dynamic mining policy of blockchain selfish mining through sensitivity-based optimization

Jing-Yu Ma () and Quan-Lin Li ()
Additional contact information
Jing-Yu Ma: Xuzhou University of Technology
Quan-Lin Li: Beijing University of Technology

Journal of Combinatorial Optimization, 2022, vol. 44, issue 5, No 23, 3663-3700

Abstract: Abstract The security and fairness of blockchain are always threatened by selfish mining attacks. To study such selfish mining attacks, some necessary and useful methods need to be developed sufficiently. In this paper, we provide an interesting method for analyzing dynamic decision of blockchain selfish mining by applying the sensitivity-based optimization. Our goal is to find the optimal dynamic blockchain-pegged mining policy of the dishonest mining pool. To this end, we consider a blockchain system with two mining pools: the honest and the dishonest mining pools, where the honest mining pool follows a two-block leading competitive criterion, while the dishonest mining pool follows a modification of two-block leading competitive criterion. To find the optimal blockchain-pegged mining policy, we develop the sensitivity-based optimization to study dynamic decision of blockchain system through setting up a policy-based Poisson equation, and provide an expression for the unique solution of performance potentials. Based on this, we can characterize monotonicity and optimality of the long-run average profit with respect to the blockchain-pegged mining reward. Also, we prove the structure of the optimal blockchain-pegged mining policy. The methodology and results derived in this paper significantly reduce the large search space of finding the optimal policy, thus they can shed light on the optimal dynamic decision research on the selfish mining attacks of blockchain systems.

Keywords: Blockchain; Selfish mining; Blockchain-pegged mining policy; Sensitivity-based optimization; Markov decision process (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00910-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00910-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00910-w

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00910-w