Themis:一个平等的、不可预测的、可扩展的区块链联盟共识

Linpeng Jia, Keyuan Wang, Xin Wang, Lei Yu, Zhongcheng Li, Yi Sun
{"title":"Themis:一个平等的、不可预测的、可扩展的区块链联盟共识","authors":"Linpeng Jia, Keyuan Wang, Xin Wang, Lei Yu, Zhongcheng Li, Yi Sun","doi":"10.1109/ICDCS54860.2022.00031","DOIUrl":null,"url":null,"abstract":"Consensus algorithm is the core component of consortium blockchains. Equality, Unpredictability and Scalability are three important demands for the consensus algorithms of consortium blockchain. Existing deterministic consensus algorithms (e.g. PBFT) can ensure Equality, but cannot meanwhile meet Unpredictability and Scalability; probabilistic consensus algorithms (e.g. PoW) can achieve Scalability and guarantee a decent Unpredictability, but cannot meet the Equality requirement. In this paper, we propose a new consensus algorithm, namely Themis, which takes the three properties into account. Themis independently adjusts the block-producing difficulty of each node through a self-adaptive node election mechanism, effectively reducing the correlation between the block-producing frequency and the invested computing power of each node. Besides, a GEOST main chain consensus rule is proposed to handle forks and further improve the performance of the algorithm. If a fork occurs, consensus nodes will choose the sub-chain with the highest Equality to join the main chain. Evaluations show that Themis achieves outstanding performance in Equality and Unpredictability while ensuring Scalability, compared with the existing algorithms.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"193 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Themis: An Equal, Unpredictable, and Scalable Consensus for Consortium Blockchain\",\"authors\":\"Linpeng Jia, Keyuan Wang, Xin Wang, Lei Yu, Zhongcheng Li, Yi Sun\",\"doi\":\"10.1109/ICDCS54860.2022.00031\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consensus algorithm is the core component of consortium blockchains. Equality, Unpredictability and Scalability are three important demands for the consensus algorithms of consortium blockchain. Existing deterministic consensus algorithms (e.g. PBFT) can ensure Equality, but cannot meanwhile meet Unpredictability and Scalability; probabilistic consensus algorithms (e.g. PoW) can achieve Scalability and guarantee a decent Unpredictability, but cannot meet the Equality requirement. In this paper, we propose a new consensus algorithm, namely Themis, which takes the three properties into account. Themis independently adjusts the block-producing difficulty of each node through a self-adaptive node election mechanism, effectively reducing the correlation between the block-producing frequency and the invested computing power of each node. Besides, a GEOST main chain consensus rule is proposed to handle forks and further improve the performance of the algorithm. If a fork occurs, consensus nodes will choose the sub-chain with the highest Equality to join the main chain. Evaluations show that Themis achieves outstanding performance in Equality and Unpredictability while ensuring Scalability, compared with the existing algorithms.\",\"PeriodicalId\":225883,\"journal\":{\"name\":\"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)\",\"volume\":\"193 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS54860.2022.00031\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS54860.2022.00031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

共识算法是联盟区块链的核心组成部分。等价性、不可预测性和可扩展性是区块链联盟共识算法的三个重要要求。现有的确定性共识算法(如PBFT)可以保证等式性,但不能同时满足不可预测性和可扩展性;概率一致性算法(例如PoW)可以实现可扩展性并保证良好的不可预测性,但不能满足相等性要求。在本文中,我们提出了一个新的共识算法,即Themis,它考虑了这三个属性。Themis通过自适应节点选举机制独立调整每个节点的产块难度,有效降低了每个节点的产块频率与投入计算能力之间的相关性。此外,提出了GEOST主链共识规则来处理分叉,进一步提高了算法的性能。如果发生分叉,共识节点将选择平等度最高的子链加入主链。评估表明,与现有算法相比,Themis在保证可扩展性的同时,在平等性和不可预测性方面取得了出色的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Themis: An Equal, Unpredictable, and Scalable Consensus for Consortium Blockchain
Consensus algorithm is the core component of consortium blockchains. Equality, Unpredictability and Scalability are three important demands for the consensus algorithms of consortium blockchain. Existing deterministic consensus algorithms (e.g. PBFT) can ensure Equality, but cannot meanwhile meet Unpredictability and Scalability; probabilistic consensus algorithms (e.g. PoW) can achieve Scalability and guarantee a decent Unpredictability, but cannot meet the Equality requirement. In this paper, we propose a new consensus algorithm, namely Themis, which takes the three properties into account. Themis independently adjusts the block-producing difficulty of each node through a self-adaptive node election mechanism, effectively reducing the correlation between the block-producing frequency and the invested computing power of each node. Besides, a GEOST main chain consensus rule is proposed to handle forks and further improve the performance of the algorithm. If a fork occurs, consensus nodes will choose the sub-chain with the highest Equality to join the main chain. Evaluations show that Themis achieves outstanding performance in Equality and Unpredictability while ensuring Scalability, compared with the existing algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信