TL;DR
This paper introduces ECCPoW, a proof-of-work algorithm based on LDPC codes, integrated into Ethereum, demonstrating that block generation times have finite mean and are not heavy-tailed, ensuring transaction confirmation reliability.
Contribution
It presents the implementation, simulation, and validation of ECCPoW in Ethereum, analyzing block generation time distribution to confirm its stability and suitability.
Findings
Block generation time distribution is not heavy-tailed.
ECCPoW Ethereum functions effectively with automatic difficulty adjustment.
Statistical tests confirm BGT follows an exponential distribution.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
