Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 442

The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.

A Scalable Multi-Layer PBFT Consensus for Blockchain

Open access
Li, Wenyu, Feng, Chenglin, Zhang, Lei, Xu, Hao, Cao, Bin, Imran, Muhammad Ali·2021·IEEE Transactions on Parallel and Distributed Systems

Abstract

Practical Byzantine Fault Tolerance (PBFT) consensus mechanism shows a great potential to break the performance bottleneck of the Proof-of-Work (PoW)-based blockchain systems, which typically support only dozens of transactions per second and require minutes to hours for transaction confirmation. However, due to frequent inter-node communications, PBFT mechanism has a poor node scalability and thus it is typically adopted in small networks. To enable PBFT in large systems such as massive Internet of Things (IoT) ecosystems and blockchain, in this article, a scalable multi-layer PBFT-based consensus mechanism is proposed by hierarchically grouping nodes into different layers and limiting the communication within the group. We first propose an optimal double-layer PBFT and show that the communication complexity is significantly reduced. Specifically, we prove that when the nodes are evenly distributed within the sub-groups in the second layer, the communication complexity is minimized. The security threshold is analyzed based on faulty probability determined (FPD) and faulty number determined (FND) models, respectively. We also provide a practical protocol for the proposed double-layer PBFT system. Finally, the results are extended to arbitrary-layer PBFT systems with communication complexity and security analysis. Simulation results verify the effectiveness of the analytical results.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpds.2020.3042392

Cites

29 of 29 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 29 references

Cited by

See all 442

Metadata

Authors
Li, W., Feng, C., Zhang, L., Xu, H., Cao, B., & Imran, M. A.
Venue
IEEE Transactions on Parallel and Distributed Systems
Published
2021-05-01
Volume
32
Issue
5
Pages
1146-1160
ISSN
  • 1045-9219 (ISSN-L)
  • 1558-2183
  • 2161-9883
OpenAlex
W3108722340
Cited by
442
References
29
FWCI
45.56
Type
journal article
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Scalable Multi-Layer PBFT Consensus for Blockchain. https://app.cochat.ai/papers/10.1109/tpds.2020.3042392
The paper
Li, W., Feng, C., Zhang, L., Xu, H., Cao, B., & Imran, M. A. (2021). A Scalable Multi-Layer PBFT Consensus for Blockchain. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2020.3042392

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.