Adapted PBFT Consensus Protocol for Sharded Blockchain

Byzantine容错 块链 一致性算法 计算机科学 共识 容错 分布式计算 协议(科学) 计算机网络 计算机安全 多智能体系统 人工智能 算法 医学 病理 替代医学
作者
Ling Yang,Huawei Huang
出处
期刊:Lecture Notes in Computer Science 卷期号:: 36-50
标识
DOI:10.1007/978-3-031-17551-0_3
摘要

AbstractAs the foundation of a blockchain, consensus algorithm significantly affects the blockchain system’s performance. To a consortium blockchain, Practical Byzantine Fault Tolerance (PBFT) has been widely believed as a good candidate consensus due to its many advantages. However, PBFT is not particularly designed for a consortium blockchain. Thus, there is still a large improvement space to implement the PBFT algorithm in a sharded blockchain. Based on network sharding, we aim to address the problems incurred by the traditional PBFT algorithm. Because when there are large number of nodes in a P2P network, PBFT can lead to a significant performance degradation. Even worse, Byzantine nodes cannot be found timely in a large-scale blockchain network where the PBFT algorithm is adopted. In this paper, we propose an adapted version of BFT consensus for the sharded blockchain. The proposed cross-shard BFT consensus mainly consists of a two-phase consensus mechanism after performing network sharding. In the first phase, Raft consensus is first adopted within each shard, in which a leader is elected. In the second phase, those leaders from all shards form a committee and perform a committee-wise PBFT consensus. Through introducing anchor nodes within each shard, the security of the proposed two-phase consensus is guaranteed. We analyze the security of the cross-shard BFT consensus based on a committee-wise monitoring framework. Through simulations, we find out that the proposed cross-shard BFT consensus yields a higher throughput, lower latency than the original PBFT. The fault-tolerance ability of the proposed consensus is around 1.5\(\times \) to 2\(\times \) of PBFT.KeywordsBlockchainConsensus algorithmPractical byzantine fault toleranceNetwork sharding

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
1秒前
Hollen完成签到 ,获得积分10
2秒前
慕青应助学术蠕虫采纳,获得10
3秒前
3秒前
叶子发布了新的文献求助10
4秒前
orangel完成签到,获得积分10
5秒前
半壶月色半边天完成签到 ,获得积分10
6秒前
tmpstlml发布了新的文献求助10
6秒前
7秒前
7秒前
不安饼干完成签到 ,获得积分10
9秒前
活泼的飞鸟完成签到,获得积分10
9秒前
10秒前
xuyun发布了新的文献求助10
10秒前
10秒前
zzcres完成签到,获得积分10
12秒前
eeeee完成签到 ,获得积分10
12秒前
乐观德地完成签到,获得积分10
13秒前
大个应助yf_zhu采纳,获得10
13秒前
llk发布了新的文献求助10
14秒前
一只大肥猫完成签到,获得积分10
14秒前
14秒前
16秒前
16秒前
16秒前
16秒前
科研通AI5应助GGG采纳,获得10
17秒前
17秒前
19秒前
Ann发布了新的文献求助20
19秒前
19秒前
buno应助duxinyue采纳,获得10
19秒前
xlj发布了新的文献求助10
20秒前
20秒前
可爱的函函应助zhen采纳,获得10
21秒前
研友_VZG7GZ应助dingdong采纳,获得10
22秒前
22秒前
李成恩完成签到 ,获得积分10
23秒前
心碎的黄焖鸡完成签到 ,获得积分10
23秒前
高分求助中
Continuum Thermodynamics and Material Modelling 3000
Production Logging: Theoretical and Interpretive Elements 2700
Social media impact on athlete mental health: #RealityCheck 1020
Ensartinib (Ensacove) for Non-Small Cell Lung Cancer 1000
Unseen Mendieta: The Unpublished Works of Ana Mendieta 1000
Bacterial collagenases and their clinical applications 800
El viaje de una vida: Memorias de María Lecea 800
热门求助领域 (近24小时)
化学 材料科学 生物 医学 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 基因 遗传学 物理化学 催化作用 量子力学 光电子学 冶金
热门帖子
关注 科研通微信公众号,转发送积分 3527961
求助须知:如何正确求助?哪些是违规求助? 3108159
关于积分的说明 9287825
捐赠科研通 2805882
什么是DOI,文献DOI怎么找? 1540070
邀请新用户注册赠送积分活动 716926
科研通“疑难数据库(出版商)”最低求助积分说明 709808