吞吐量
数据库事务
计算机科学
工作证明制度
块链
块(置换群论)
计算机网络
协议(科学)
分布式计算
计算机安全
数据库
操作系统
数学
无线
医学
几何学
替代医学
病理
作者
B Swaroopa Reddy,Gaurav Sharma
标识
DOI:10.3390/proceedings2019028006
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI