更新的委托股权证明和纳什均衡:区块链网络的矿池博弈模型

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-07-28 DOI:10.1002/cpe.8224
Namratha M, Kunwar Singh
{"title":"更新的委托股权证明和纳什均衡:区块链网络的矿池博弈模型","authors":"Namratha M,&nbsp;Kunwar Singh","doi":"10.1002/cpe.8224","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>In the present era, blockchain technology has an extensive variety of uses in the financial, marketing, and so forth. The performance and security of the blockchain system are directly affected by the consensus algorithm. Since there are 30 consensus techniques like proof of stake, delegated proof of stake, and proof of work, and so forth in the previous years, the operating efficiency, safety, and stability still lag behind the basic requirements. To this concern, this research manuscript introduces a novel consensus mechanism-based game model using upgraded delegated proof of stake (UDPoS) and Nash equilibrium (NE) that is UDPoS-NE. In a blockchain network powered by UDPoS, blockchain miners provide computing power to publish blocks. Due to a single miner's limited Computing Power (CP), miners frequently join mining pools and divide the pool's profits in accordance with their respective contributions. However, certain miners launch block-withholding attacks that lead to loss the computer power and endanger the blockchain network's effectiveness. Therefore, NE is used to calculate cooperative game solutions and optimize policy decisions of the miners to frustrate the block withholding attack by the influence of stakes and computing power on producing blocks. Using this mechanism, efficiency, and stability in the consensus process is achieved through the combined influence of computing resources and stakes on block generation. Finally, the suggested model's applicability and validity are confirmed with a throughput (600 TPS), delay (3 s), and energy consumption (&lt;100 KWh) for 10 nodes and processing time (0.9 s) for 200 nodes.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 23","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Updated delegated proof of stake and Nash equilibrium: A mining pool game model for blockchain network\",\"authors\":\"Namratha M,&nbsp;Kunwar Singh\",\"doi\":\"10.1002/cpe.8224\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>In the present era, blockchain technology has an extensive variety of uses in the financial, marketing, and so forth. The performance and security of the blockchain system are directly affected by the consensus algorithm. Since there are 30 consensus techniques like proof of stake, delegated proof of stake, and proof of work, and so forth in the previous years, the operating efficiency, safety, and stability still lag behind the basic requirements. To this concern, this research manuscript introduces a novel consensus mechanism-based game model using upgraded delegated proof of stake (UDPoS) and Nash equilibrium (NE) that is UDPoS-NE. In a blockchain network powered by UDPoS, blockchain miners provide computing power to publish blocks. Due to a single miner's limited Computing Power (CP), miners frequently join mining pools and divide the pool's profits in accordance with their respective contributions. However, certain miners launch block-withholding attacks that lead to loss the computer power and endanger the blockchain network's effectiveness. Therefore, NE is used to calculate cooperative game solutions and optimize policy decisions of the miners to frustrate the block withholding attack by the influence of stakes and computing power on producing blocks. Using this mechanism, efficiency, and stability in the consensus process is achieved through the combined influence of computing resources and stakes on block generation. Finally, the suggested model's applicability and validity are confirmed with a throughput (600 TPS), delay (3 s), and energy consumption (&lt;100 KWh) for 10 nodes and processing time (0.9 s) for 200 nodes.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"36 23\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2024-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8224\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8224","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

摘要 当今时代,区块链技术在金融、营销等领域有着广泛的用途。共识算法直接影响区块链系统的性能和安全性。由于前些年已有 30 种共识技术,如权益证明、委托权益证明和工作证明等,其运行效率、安全性和稳定性仍然落后于基本要求。针对这一问题,本研究手稿介绍了一种基于共识机制的新型博弈模型,该模型采用了升级的委托权益证明(UDPoS)和纳什均衡(NE),即 UDPoS-NE。在由 UDPoS 驱动的区块链网络中,区块链矿工提供发布区块的计算能力。由于单个矿工的计算能力(CP)有限,矿工们经常加入矿池,并根据各自的贡献分配矿池的利润。然而,某些矿工会发起区块扣留攻击,导致计算机功率损失,危及区块链网络的有效性。因此,NE 被用来计算合作博弈方案,优化矿工的政策决策,通过赌注和算力对生产区块的影响来挫败区块扣留攻击。利用这种机制,通过计算资源和赌注对区块生成的综合影响,实现了共识过程的效率和稳定性。最后,10 个节点的吞吐量(600 TPS)、延迟(3 秒)和能耗(100 千瓦时)以及 200 个节点的处理时间(0.9 秒)证实了所建议模型的适用性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Updated delegated proof of stake and Nash equilibrium: A mining pool game model for blockchain network

In the present era, blockchain technology has an extensive variety of uses in the financial, marketing, and so forth. The performance and security of the blockchain system are directly affected by the consensus algorithm. Since there are 30 consensus techniques like proof of stake, delegated proof of stake, and proof of work, and so forth in the previous years, the operating efficiency, safety, and stability still lag behind the basic requirements. To this concern, this research manuscript introduces a novel consensus mechanism-based game model using upgraded delegated proof of stake (UDPoS) and Nash equilibrium (NE) that is UDPoS-NE. In a blockchain network powered by UDPoS, blockchain miners provide computing power to publish blocks. Due to a single miner's limited Computing Power (CP), miners frequently join mining pools and divide the pool's profits in accordance with their respective contributions. However, certain miners launch block-withholding attacks that lead to loss the computer power and endanger the blockchain network's effectiveness. Therefore, NE is used to calculate cooperative game solutions and optimize policy decisions of the miners to frustrate the block withholding attack by the influence of stakes and computing power on producing blocks. Using this mechanism, efficiency, and stability in the consensus process is achieved through the combined influence of computing resources and stakes on block generation. Finally, the suggested model's applicability and validity are confirmed with a throughput (600 TPS), delay (3 s), and energy consumption (<100 KWh) for 10 nodes and processing time (0.9 s) for 200 nodes.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
Issue Information Improving QoS in cloud resources scheduling using dynamic clustering algorithm and SM-CDC scheduling model Issue Information Issue Information Camellia oleifera trunks detection and identification based on improved YOLOv7
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1