Concise Consortium Blockchain Consensus Algorithm with Pattern Conversion Support

In view of the engineering and algorithm conflicts in the application process of alliance chains, this article analyzes the threat risks faced by public and alliance chains, and summarizes their differences. By analyzing the typical alliance chain consensus algorithms of CFT and BFT, we propose a simple consensus algorithm (SCA) for blockchain. The algorithm is designed from the perspectives of participation roles, view switching, transaction consensus, and model analysis, and can achieve efficient view switching and transaction consensus through a three-part minimal structure. It can support the conversion between CFT and BFT through consensus threshold definitions, with the shortest execution period and fastest consensus efficiency. After in-depth analysis, the algorithm has a fault tolerance rate of no less than N/3, which is significantly better than the PBFT algorithm in terms of processing performance, while resisting existing threats to the consortium chain.

Authors

Institutions

Publication Details

Published
2024-12-06
DOI
https://doi.org/10.1109/cnteie66268.2024.00029
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Concise Consortium Blockchain Consensus Algorithm with Pattern Conversion Support

Yarong Li, Jian Bai, Xiaofeng Zhao
Cloud Computing and Resource Management
article

Concise Consortium Blockchain Consensus Algorithm with Pattern Conversion Support

Yarong Li, Jian Bai, Xiaofeng Zhao
article en

Abstract

In view of the engineering and algorithm conflicts in the application process of alliance chains, this article analyzes the threat risks faced by public and alliance chains, and summarizes their differences. By analyzing the typical alliance chain consensus algorithms of CFT and BFT, we propose a simple consensus algorithm (SCA) for blockchain. The algorithm is designed from the perspectives of participation roles, view switching, transaction consensus, and model analysis, and can achieve efficient view switching and transaction consensus through a three-part minimal structure. It can support the conversion between CFT and BFT through consensus threshold definitions, with the shortest execution period and fastest consensus efficiency. After in-depth analysis, the algorithm has a fault tolerance rate of no less than N/3, which is significantly better than the PBFT algorithm in terms of processing performance, while resisting existing threats to the consortium chain.

University of Electronic Science and Technology of China (CN)
Openalex Percentile: Top 51%
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.