Blockchain Consensus Algorithm Design Based on Consistent Hash Algorithm

Jian Yang, Hong Shen
{"title":"Blockchain Consensus Algorithm Design Based on Consistent Hash Algorithm","authors":"Jian Yang, Hong Shen","doi":"10.1109/PDCAT46702.2019.00090","DOIUrl":null,"url":null,"abstract":"Blockchain, the concept from Bitcoin created by Satoshi Nakamoto, has the potential to decentralise traditionally centralised systems. Blockchain is a distributed ledger for recording information, stored by many nodes without a central organization through distributed systems and cryptography. The consensus algorithm is a protocol that guarantees the consistency of all data in a blockchain system. It is a key for building a blockchain system and an important part that affects the performance of the blockchain system. In this paper, we firstly compare the usage scenarios of different consensus algorithms, their advantages and disadvantages. After that, we present a new consensus algorithm in permissioned blockchain based on consistent hashing. For blockchain system construction, we propose a new design of the hash ring. The pseudo-randomness of the hash operation is used to ensure the randomness of the electoral leadership node in the blockchain system. It avoids the security risk of the fixed leadership node model. Our algorithm is applicable to blockchain systems containing Byzantine nodes and has a high throughput, low delay and many other advantages. Its communication complexity is O(n), significantly better than that of the practical Byzantine fault tolerance algorithm whose communication complexity is O(n2).","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT46702.2019.00090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Blockchain, the concept from Bitcoin created by Satoshi Nakamoto, has the potential to decentralise traditionally centralised systems. Blockchain is a distributed ledger for recording information, stored by many nodes without a central organization through distributed systems and cryptography. The consensus algorithm is a protocol that guarantees the consistency of all data in a blockchain system. It is a key for building a blockchain system and an important part that affects the performance of the blockchain system. In this paper, we firstly compare the usage scenarios of different consensus algorithms, their advantages and disadvantages. After that, we present a new consensus algorithm in permissioned blockchain based on consistent hashing. For blockchain system construction, we propose a new design of the hash ring. The pseudo-randomness of the hash operation is used to ensure the randomness of the electoral leadership node in the blockchain system. It avoids the security risk of the fixed leadership node model. Our algorithm is applicable to blockchain systems containing Byzantine nodes and has a high throughput, low delay and many other advantages. Its communication complexity is O(n), significantly better than that of the practical Byzantine fault tolerance algorithm whose communication complexity is O(n2).
基于一致性哈希算法的区块链共识算法设计
区块链是中本聪(Satoshi Nakamoto)创造的比特币概念,有可能使传统的中心化系统去中心化。区块链是一种记录信息的分布式账本,通过分布式系统和密码学,由多个节点在没有中央组织的情况下存储。一致性算法是一种保证区块链系统中所有数据一致性的协议。它是构建区块链系统的关键,也是影响区块链系统性能的重要组成部分。本文首先比较了不同共识算法的使用场景及其优缺点。在此基础上,我们提出了一种新的基于一致性哈希的允许区块链共识算法。对于区块链系统的构建,我们提出了一种新的哈希环设计。哈希运算的伪随机性是为了保证区块链系统中选举领导节点的随机性。避免了固定领导节点模式的安全风险。该算法适用于包含拜占庭节点的区块链系统,具有高吞吐量、低延迟等优点。其通信复杂度为O(n),明显优于实际的拜占庭容错算法,通信复杂度为O(n2)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信