MC-RHotStuff: Multi-Chain Oriented HotStuff Consensus Mechanism Based on Reputation

Lu Yuxuan; Kong Lanju; Zhang Baochen; Min Xinping

doi:10.7544/issn1000-1239.202330195

Journal of Computer Research and Development > 2024 > 61(6): 1559-1572. > DOI: 10.7544/issn1000-1239.202330195

Lu Yuxuan, Kong Lanju, Zhang Baochen, Min Xinping. MC-RHotStuff: Multi-Chain Oriented HotStuff Consensus Mechanism Based on Reputation[J]. Journal of Computer Research and Development, 2024, 61(6): 1559-1572. DOI: 10.7544/issn1000-1239.202330195

Citation:

PDF (2221 KB)

MC-RHotStuff: Multi-Chain Oriented HotStuff Consensus Mechanism Based on Reputation

School of Software, Shandong University , Jinan 250100

Funds: This work was supported by the National Key Research and Development Program of China (2021YFB2700102), the National Social Science Fund Project of China (20BJY131), and the Major Science and Technology Innovation Project of Shandong Province (2020CXGC010106, 2021CXGC010108).

More Information

Author Bio:
Lu Yuxuan: born in 1999. Master candidates. Student member of CCF. His main research interests include blockchain consensus and node management

Kong Lanju: born in 1978. PhD, professor, PhD supervisor. Senior member of CCF. Her main research interests include blockchain consensus, multi-chain architecture, and large-scale data management

Zhang Baochen: born in 1992. PhD candidate. Student member of CCF. Her main research interests include sharding structure of blockchain, verification of blockchain transactions, and blockchain consensus algorithms

Min Xinping: born in 1993. PhD, professor. His main research interests include blockchain consensus and consistency of digital assets
Received Date: March 26, 2023
Revised Date: July 24, 2023
Available Online: March 13, 2024

Graphical Abstract

Abstract

Abstract

The existing blockchain presents a multi-chain trend. Traditional consensus algorithms do not have dynamic scalability for multi-chain, making it difficult to cope with the contradiction between open use and closed maintenance of large-scale permissioned blockchain. For this problem, a novel multi-chain consensus algorithm, MC-RHotStuff, is proposed: Nodes have different roles, including alternative nodes, candidate nodes, and consensus nodes. Each working chain has consensus nodes and alternative nodes. After the admission verification, the candidate node will become an alternative node; A consensus node has a reputation value that other nodes do not have, and a consensus node that performs the correct behavior will increase the reputation value, while a consensus node that performs the wrong behavior will deduct the reputation value, then the node with abnormal reputation value will be found through the node reputation calculation and filtering algorithm MC-Scan, and a new consensus node will be selected from the alternative nodes to exchange with the abnormal node. In addition, a dynamic node adjustment algorithm, MC-Schedule, is proposed to achieve optimization by detecting the transaction volume of each blockchain and dynamically adjusting the number of consensus nodes, which not only ensures the efficient execution of the blockchain system but also improves the speed of node filtering. MC-RHotStuff proposes a node state synchronization mechanism, MC-Syn, to ensure that the consensus operates normally when the node number change or the consensus group change. Compared with existing systems, transaction throughput and latency have been comprehensively improved by about 15%.
- blockchain,
- multi-chain architecture,
- reputation value,
- consensus algorithm,
- distributed network

FullText(HTML)

References (30)

References

[1]	Castro M, Liskov B. Practical Byzantine fault tolerance[C]//Proc of the 3rd USENIX Symp on Operating Systems Design and Implementation (OSDI). Berkeley, CA: USENIX Association, 1999: 173−186
[2]	Ongaro D, Ousterhout J. In search of an understandable consensus algorithm[C]//Proc of the 2014 USENIX Annual Technical Conf. Berkeley, CA: USENIX Association, 2014: 305−319
[3]	Facebook. The diem blockchain[R/OL]. 2020[2022-09-11]. https://www.diem.com/en-us/white-paper/
[4]	Lamport L, Shostak R, Pease M. The Byzantine Generals Problem[M]. New York: ACM, 2019
[5]	Castro M, Liskov B. Practical Byzantine fault tolerance and proactive recovery[J]. ACM Transactions on Computer Systems, 2002, 20(4): 398−461 doi: 10.1145/571637.571640
[6]	Jiang Nianqi, Bai Fenhua, Huang Lin, et al. Reputation-driven dynamic node consensus and reliability sharding model in IoT blockchain[J]. Algorithms, 2022, 15(2): 28−50 doi: 10.3390/a15020028
[7]	Aluko O, Kolonin A. PROOF-OF-REPUTATION: An alternative consensus mechanism for blockchain systems[J]. arXiv preprint, arXiv: 2108.03542, 2021
[8]	Huang Baohua, Peng Li, Zhao Weihong, et al. Workload-based randomization Byzantine fault tolerance consensus protocol[J]. High-Confidence Computing, 2022, 2(3): 100070 doi: 10.1016/j.hcc.2022.100070
[9]	Hasan O, Brunie L, Bertino E. Privacy-preserving reputation systems based on blockchain and other cryptographic building blocks: A survey[J]. ACM Computing Surveys, 2023, 55(2): 1−37
[10]	Jin Hai, Dai Xiaohai, Xiao Jiang. Towards a novel architecture for enabling interoperability amongst multiple blockchains[C]//Proc of the 38th Int Conf on Distributed Computing Systems (ICDCS). Piscataway, NJ: IEEE, 2018: 1203−1211
[11]	Luo Kan, Yu Wei, Ling Chaogao, et al. A multiple blockchains architecture on inter-blockchain communication[C]//Proc of the 2018 IEEE Int Conf on Software Quality, Reliability and Security Companion (QRS-C). Piscataway, NJ: IEEE, 2018: 139−145
[12]	Agrawal K, Aggarwal M, Tanwar S, et al. An extensive blockchain based applications survey: Tools, frameworks, opportunities, challenges and solutions[J]. IEEE Access, 2022, 10: 116858−116906 doi: 10.1109/ACCESS.2022.3219160
[13]	Abdo J B, Sibai R E, Demerjian J. Permissionless proof-of-reputation-x: A hybrid reputation-based consensus algorithm for permissionless blockchains[J]. Transactions on Emerging Telecommunications Technologies. 2021, 32(1): e4148
[14]	Gueta G G, Abraham I, Grossman S, et al. Sbft: A scalable decentralized trust infrastructure for blockchains[J]. arXiv preprint, arXiv: 1804.01626, 2018
[15]	Yin Maofan, Malkhi D, K. Reiter M, et al. HotStuff: BFT consensus with linearity and responsiveness[C]//Proc of the 2019 ACM Symp on Principles of Distributed Computing. New York: ACM, 2019: 347−356
[16]	Dwork C, Lynch N, Stockmeyer L. Consensus in the presence of partial synchrony[J]. Journal of the ACM, 1988, 35(2): 288−323 doi: 10.1145/42282.42283
[17]	Fischer M J, Lynch N A, Paterson M S. Impossibility of distributed consensus with one faulty process[J]. Journal of the ACM, 1985, 32(2): 374−382 doi: 10.1145/3149.214121
[18]	Schneider F. Implementing fault-tolerant services using the state machine approach: A tutorial[J]. ACM Computing Surveys, 1990, 22(4): 299−319 doi: 10.1145/98163.98167
[19]	Shoup V. Practical threshold signatures[C]//Proc of the Advances in Cryptology (EUROCRYPT 2000). Berlin: Springer, 2000: 207−220
[20]	Ntoanidou S, Polidoros A, Dordas C, et al. Hierarchical clustering methods for binary data from molecular markers[J]. International Journal of Data Analysis Techniques and Strategies, 2020, 12(3): 190−212 doi: 10.1504/IJDATS.2020.108036
[21]	Boneh D, Lynn B, Shacham H. Short signatures from the weil pairing[J]. Journal of Cryptology, 2004, 17(4): 297−319 doi: 10.1007/s00145-004-0314-9
[22]	Goyal R, Vaikuntanathan V. Locally verifiable signature and key aggregation[C]//Proc of the 42nd Annual Int Cryptology Conf. Berlin: Springer, 2022: 761−791
[23]	Lei Hui, Qiu Chao, Yao Haipeng, et al. When blockchain-enabled Internet of things meets cloud computing[J]. Computer, 2019, 52(12): 16−17 doi: 10.1109/MC.2019.2940857
[24]	Choi K, Chang B. A theory of RPC calculi for client-server model[J]. Journal of Functional Programming, 2019, 29: e5 doi: 10.1017/S0956796819000029
[25]	Brandão D, S. Rosa N. Multiple transport protocols in an adaptive RPC-based framework[C/OL]//Proc of the 55th Hawaii Int Conf on System Sciences. 2022[2022-12-11]. https://scholarspace.manoa.hawaii.edu/items/b0ddbfc9-22f3-4fa0-97e3-a05d3dc810dd
[26]	Wang Yinyin, Yang Yuwang, Qiu Xiulin, et al. CCF-LRU: Hybrid storage cache replacement strategy based on counting[J]. Applied Intelligence, 2022, 52(5): 5144−5158 doi: 10.1007/s10489-021-02567-0
[27]	Liu Dongxiao, Huang Cheng, Ni Jianbing, et al. Blockchain-cloud transparent data marketing: Consortium management and fairness[J]. IEEE Transactions on Computers, 2022, 71(12): 3322−3335
[28]	Xu Cheng, Zhang Ce, Xu Jianliang, et al. Slimchain: Scaling blockchain transactions through off-chain storage and parallel processing[J]. Proceedings of the VLDB Endowment, 2021, 14(11): 2314−2326 doi: 10.14778/3476249.3476283
[29]	Cheng Difei, Xu Ruihang, Zhang Bo. Fast density estimation for density-based clustering methods[J]. arXiv preprint, arXiv: 2109.11383, 2021
[30]	Hanafi N, Saadatfar H. A fast DBSCAN algorithm for big data based on efficient density calculation[J]. Expert Systems with Applications, 2022, 203: 117501 doi: 10.1016/j.eswa.2022.117501

[1]	Li Guorui, Meng Jie, Peng Sancheng, Wang Cong. A Distributed Data Reconstruction Algorithm Based on Jacobi ADMM for Compressed Sensing in Sensor Networks[J]. Journal of Computer Research and Development, 2020, 57(6): 1284-1291. DOI: 10.7544/issn1000-1239.2020.20190587
[2]	Wang Jiang, Zhang Mingxing, Wu Yongwei, Chen Kang, Zheng Weimin. Paxos-like Consensus Algorithms: A Review[J]. Journal of Computer Research and Development, 2019, 56(4): 692-707. DOI: 10.7544/issn1000-1239.2019.20170973
[3]	Wei Songjie, Li Shuai, Mo Bing, Wang Jiahe. Regional Cooperative Authentication Protocol for LEO Satellite Networks Based on Consensus Mechanism[J]. Journal of Computer Research and Development, 2018, 55(10): 2244-2255. DOI: 10.7544/issn1000-1239.2018.20180431
[4]	He Xin, Gui Xiaolin, An Jian. A Distributed Area Coverage Algorithm Based on Delayed Awakening in Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2011, 48(5): 786-792.
[5]	Hu Yun, Wang Dapeng, and Yang Shoubao. Distributed and Dynamic Spectrum Allocation in Unlicensed Band Networks[J]. Journal of Computer Research and Development, 2011, 48(5): 746-755.
[6]	Cui Xunxue, Liu Jianjun, Fan Xiumei. A Distributed Anchor-Free Localization Algorithm in Sensor Networks[J]. Journal of Computer Research and Development, 2009, 46(3): 425-433.
[7]	Zeng Weini, Lin Yaping, Hu Yupeng, Yi Yeqing, Li Xiaolong. A Group Key Management Scheme Based on Distributed Rekeying Authority in Sensor Networks[J]. Journal of Computer Research and Development, 2007, 44(4): 606-614.
[8]	Yang Bo, Wang Yadong, Su Xiaohong, and Tang Xianglong. Neural Networks' Distributed Cooperative Learning Strategy Based on Agent and Chips[J]. Journal of Computer Research and Development, 2006, 43(12): 2096-2103.
[9]	Cai Zhiping, Yin Jianping, Liu Xianghui, Liu Fang, and Lü Shaohe. A Distributed Network Monitoring Model with Link Constraint[J]. Journal of Computer Research and Development, 2006, 43(4): 601-606.
[10]	Yao Nianmin, Shu Jiwu, and Zheng Weimin. The Distributed Lock Scheme in SAN[J]. Journal of Computer Research and Development, 2005, 42(2): 338-343.

Cited By

Cited by

Periodical cited type(2)

1.	刘嘉宇，李贺，谷莹，袁翠敏，祝琳琳. 基于高阶交互网络的在线群体观点演化机理模型构建研究. 情报理论与实践. 2025(02): 124-135 .
2.	邱馨锐，赵文，吴长汶，张斐，杨朝阳，李灿东，周常恩. 刍议高阶关系在中医隐性知识显性化研究中的关键作用. 福建中医药. 2024(08): 24-26+30 .