Meta-Sharding: A Novel Approach to Scaling Byzantine Consensus in High-Frequency Trading Blockchains

Clicks: 3
ID: 312789
2025
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #396 of 705 articles by views in Journal of Computing & Biomedical Informatics

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 705 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
Byzantine fault tolerance (BFT) consensus protocols continue to be a main bottleneck for big-scale blockchain rollouts because of their natural scalability limitation. This paper presents Meta-Sharding, a new consensus protocol that solves the O(n²) communication complexity problem of standard PBFT through the use of sharding methods. This method splits the network into parallel processing shards under the control of a meta-committee, allowing near-linear scalability of throughput while keeping Byzantine fault tolerance promises. By simulations with network sizes between 50 and 1000 nodes, experimental results show that Meta-Sharding has roughly 23,000 transactions per second (TPS) at 1000 nodes, as opposed to 400-600 TPS for standard PBFT. Although Meta-Sharding suffers a bit more from latency (175ms compared to 30ms), its efficiency in processing (expressed as TPS/latency) improves exponentially to 130 TPS/ms at network sizes at which conventional PBFT is less than 20 TPS/ms. This design includes resilient fault tolerance features such as view updates and coordination of cross-shard transactions via a two-stage commit protocol. The envisioned architecture has tremendous implications for blockchain applications that demand both high transaction throughput and Byzantine fault tolerance at scale.
Reference Key
imported_1777056846_69ebbc4e57512 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Nazish Umar Awan
Journal Journal of Computing & Biomedical Informatics
Year 2025
DOI
10.56979/901/2025/981
URL
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.