Abstract
The error-correction code based proof-of-work (ECCPoW) algorithm is based on a low-density parity-check (LDPC) code. The ECCPoW is possible to impair ASIC with its time-varying capability of the parameters of LDPC code. Previous researches on the ECCPoW algorithm have presented its theory and implementation on Bitcoin. But they do not discuss how stable the block generation time is. A finite mean block generation time (BGT) and none heavy-tail BGT distribution are the ones of the focus in this study. In the ECCPoW algorithm, BGT may show a long-tailed distribution due to time-varying cryptographic puzzles. Thus, it is of interest to see if the BGT distribution is not heavy-tailed and if it shows a finite mean. If the distribution is heavy-tailed, then confirmation of a transaction cannot be guaranteed. We present implementation, simulation, and validation of ECCPoW Ethereum. In implementation, we explain how the ECCPoW algorithm is integrated into Ethereum 1.0 as a new consensus algorithm. In the simulation, we perform a multinode simulation to show that the ECCPoW Ethereum works well with automatic difficulty change. In the validation, we present the statistical results of the two-sample Anderson-Darling test to show that the distribution of BGT satisfies the necessary condition of the exponential distribution. Our implementation is downloadable at https://github.com/cryptoecc/ETH-ECC.
Highlights
Blockchain is a peer-to-peer (P2P) network that consists of trustless nodes
The first is an intentional bottleneck between an arithmetic logic unit (ALU) and memory, which is used by Ethash of Ethereum [2], [5]
error-correction code proof-of-work (ECCPoW) Implemented on Ethereum we briefly introduce ECCPoW and present how ECCPoW has been implemented on Ethereum using Fig. 1
Summary
Blockchain is a peer-to-peer (P2P) network that consists of trustless nodes. In a reliable P2P network, no peers (nodes) would intentionally send wrong information to others. A node may spread wrong or fake information to others To address these issues in an unreliable P2P network, Nakamoto proposed using blocks and chaining these blocks with a novel consensus algorithm [1]. Unless the network is centralized within a particular group, sending fake information about previous blocks to new peers is impossible. INTENTIONAL BOTTLENECK The most known PoW of the intentional bottleneck is Ethash of Ethereum [2], [5] This method uses the difference between the throughput of ALU and the bandwidth of the memory. To generate a block using Ethash, a miner must mix a part of the DAG that is stored in the memory Owing to this procedure, the miner cannot avoid the bottleneck because of limited memory bandwidth. This method has been ASIC resistant for a long time; Bitmain released ASIC for Ethash in 2018
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
