.png){kind=icon}
返回
An efficient sharding consensus algorithm for consortium chains
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-022-27228-1.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The consensus algorithm is very critical in any blockchain system, because it directly affects the performance and security of the blockchain system. At present, the classic Practical Byzantine Fault Tolerance Algorithm (PBFT), which is mainly used in the consortium chain, will lead to system communication congestion and reduced throughput when the number of nodes increases, so the PBFT algorithm is not suitable for large-scale consortium chains. In response to the above problems, this paper proposes a new clustering-based sharding consensus algorithm (KBFT), which aims to ensure that the consortium chain takes into account decentralization, security and scalability. The KBFT algorithm first uses the K-prototype clustering algorithm to shard the nodes in the network according to mixed attributes, and second, disjoint transactions are used to reach consensus in parallel in different shards. Concurrently, the KBFT algorithm introduces a supervision mechanism and a node credit mechanism, which is used to supervise and score the behavior of the nodes and select the proxy nodes, which improves security. We discuss the choice of shard size with the help of the binomial probability distribution and analyze the probability that the system can successfully form a global block under different node failure probabilities. Finally, the proposed algorithm is evaluated through theoretical analysis and simulation experiments. Results show that the proposed algorithm achieves a marked improvement in scalability and throughput along with a marked reduction in communication complexity compared with the classic baseline algorithm PBFT in this field of study, which improves the operating efficiency of the system and simultaneously guarantees the security and robustness of the system.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
27.8W
被引数:
83.5W
机构
引用论文
Comparing the sensitivities and specificities of two diagnostic procedures performed on the same group of patients.比较对同一组患者进行的两种诊断程序的敏感性和特异性。
PREAI
分享收藏
分享收藏Molecular Phylogeny of the Genus Frankia and Related Genera and Emendation of the Family FrankiaceaeFrankia属和相关属的分子系统发育以及Frankiaceae家族的鉴定OAAI
OAAI分享收藏Improved PBFT algorithm for high-frequency trading scenarios of alliance blockchain.png)
SCIENTIFIC REPORTSOAAI
SCIENTIFIC REPORTSIF3.9
OAAI分享收藏Vaccination with DNA Encoding Truncated Enterohemorrhagic Escherichia coli (EHEC) Factor for Adherence-1 Gene (efa-1′) Confers Protective Immunity to Mice Infected with E. coli O157:H7用编码截短型肠出血性大肠杆菌（EHEC）黏附因子-1基因（efa-1′）的DNA进行疫苗接种，可使感染大肠杆菌O157:H7的小鼠获得保护性免疫。OAAI
OAAI分享收藏分享收藏
查看更多内容