...
首页> 外文期刊>Proceedings >Optimal Transaction Throughput in Proof-of-Work Based Blockchain Networks
【24h】

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

机译:基于验证的基于障碍区块网络的最佳事务吞吐量

获取原文
           

摘要

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.
机译:截至今天,比特币对3&ndash的限制性交易吞吐量受到了3– 7个交易每秒和交易确认需要几分钟,因为比特币区块被设计为10分钟的块创建时间,并且每个块被限制为快速传输的块。在本文中,我们获得了最佳的事务吞吐量,以获得工作验证(POW)最长链规则区块链网络(称为比特币协议)。这是通过在ERD O&UML中建模延迟直径(D)和双重支出攻击来完成的。 S-R E&急性; NYI随机网络拓扑作为约束。通过数值结果,表明吞吐量可以显着提高,而不会影响网络的公平性。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号