Mitigation and Resurgence of the Scalability Trilemma: Mathematical Analysis for Optimal Sharding in Dual–Layer Byzantine Fault–Tolerant Blockchains

The dual–layer consensus process enhances the transaction processing performance of Byzantine Fault-Tolerant Blockchains (BFT BCs) by employing sharding, where validator nodes are partitioned into multiple shards. Within each shard, consensus is formed at a lower level, while an upper–level consensus aggregates decisions from shard leaders, significantly reducing communication overhead. This paper presents a theoretical analysis of the impact of sharding in dual–layer consensus processes on average transaction throughput using a mathematical model. By employing stochastic analysis to model broadcast and block times, we derive a mathematical expression for average throughput, which aligns qualitatively with simulation results obtained through ShardEval. Furthermore, we determine the optimal number of shards that maximizes average throughput, demonstrating that in an optimally configured dual–layer BFT BC, the scalability trilemma can be mitigated, enhancing both security and scalability as decentralization increases. However, we also mathematically demonstrate that cross–shard transactions resurge the scalability trilemma, confirming that even a small fraction of such transactions significantly degrades scalability performance.

Authors

Institutions

Publication Details

Journal
Distributed Ledger Technologies Research and Practice
Published
2025-10-17
DOI
https://doi.org/10.1145/3772080
Primary Topic
Blockchain Technology Applications and Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mitigation and Resurgence of the Scalability Trilemma: Mathematical Analysis for Optimal Sharding in Dual–Layer Byzantine Fault–Tolerant Blockchains

Akihiro Fujihara
Distributed Ledger Technologies Research and Practice
Blockchain Technology Applications and Security
article

Mitigation and Resurgence of the Scalability Trilemma: Mathematical Analysis for Optimal Sharding in Dual–Layer Byzantine Fault–Tolerant Blockchains

Akihiro Fujihara
article en

Abstract

The dual–layer consensus process enhances the transaction processing performance of Byzantine Fault-Tolerant Blockchains (BFT BCs) by employing sharding, where validator nodes are partitioned into multiple shards. Within each shard, consensus is formed at a lower level, while an upper–level consensus aggregates decisions from shard leaders, significantly reducing communication overhead. This paper presents a theoretical analysis of the impact of sharding in dual–layer consensus processes on average transaction throughput using a mathematical model. By employing stochastic analysis to model broadcast and block times, we derive a mathematical expression for average throughput, which aligns qualitatively with simulation results obtained through ShardEval. Furthermore, we determine the optimal number of shards that maximizes average throughput, demonstrating that in an optimally configured dual–layer BFT BC, the scalability trilemma can be mitigated, enhancing both security and scalability as decentralization increases. However, we also mathematically demonstrate that cross–shard transactions resurge the scalability trilemma, confirming that even a small fraction of such transactions significantly degrades scalability performance.

Distributed Ledger Technologies Research and Practice
Chiba Institute of Technology (JP)
Openalex Percentile: Top 57%
Blockchain Technology Applications and Security
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.