1Assistant Professor, Department of Computer Science and Engineering, Rajiv Gandhi University of Knowledge Technologies, Basar, Nirmal, Telangana, India
2Scholar, Department of Computer Science and Engineering, Rajiv Gandhi University of Knowledge Technologies, Basar, Nirmal, Telangana, India
3Professor, Department of Computer Science and Engineering, MVSR Engineering College, Hyderabad, India
*Email: anjaneyuluendurthi@gmail.com
****durgamsanthosh141@gmail.com
Online published on 22 January, 2021.
Blockchain has become a one-stop solution to achieve data integrity. Blockchain is the series of blocks that contains the transactions or data of any kind. All of these blocks (data) is guarded by using cryptographic principles. The block will be added once the cryptographic puzzle is solved. The main aim of miners (people who solve the cryptographic puzzle) behind adding a new block is to achieve reward. But to achieve more rewards, miners keep the generated block private and these miners will generate more blocks based on the block which was generated previously by the corresponding miners. These miners will publish more blocks at a time to get a big reward. It is called as selfish mining. Moreover, a solution is being proposed known as the zero block algorithm. This paper presents a modified zero block algorithm in such a way that it can resist selfish mining. The original zero block algorithm generates dummy zero blocks whereas the modified zero block algorithm will not generate any dummy zero blocks and is more efficient than the zero block algorithm.
Puzzle, Target Hash, Selfish Mining, Maximum Acceptance Time