Linpeng Jia, Keyuan Wang, Xin Wang, Lei Yu, Zhongcheng Li, Yi Sun
{"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}
引用次数: 0
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.