Optimal Transaction Throughput in Proof-of-Work Based Blockchain Networks

Clicks: 174
ID: 101867
2019
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #27 of 41 articles by views in proceedings

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
As of today, Bitcoin suffers with restrictive transaction throughput of 3−7 transactions per sec and the transaction confirmation takes several min as bitcoin blockchain was designed with a block creation time of 10 min and each block is restricted with less blocksize for fast transmission. In this paper, we obtained the optimal transaction throughput for a Proof-of-Work (PoW) based longest chain rule blockchain network (called bitcoin protocol). This is done by modeling the delay diameter (D) and double spending attack in a Erd o ¨ s-R e ´ nyi random network topology as constraints. Through numerical results, it is shown that the throughput can be significatly improved without compromising the fairness of the network.
Reference Key
reddy2019optimalproceedings Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Reddy, B. Swaroopa;Sharma, G. V. V.;
Journal proceedings
Year 2019
DOI
DOI not found
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.