Skip to content

AdaH-Chain: Deterministic capacity-aware GNNs sharding in heterogeneous blockchains

Sep 2026 · Tsinghua Science and Technology · 0 citations
Blockchain Technology Applications and Security

TL;DR

AdaH-Chain, a deterministic capacity-aware sharding framework that replaces unsafe floating-point operations with a symmetric fixed-point quantization mechanism to mathematically guarantee bit-wise consensus safety, is proposed and a Capacity-Aware GNN Sharding algorithm is introduced.

Abstract

Modern blockchain sharding protocols increasingly deploy Graph Neural Networks (GNNs) to optimize state partitioning. However, executing these learning heuristics across heterogeneous networks introduces two funda-mental challenges. First, hardware-dependent floating-point arithmetic evaluates inconsistently across disparate instruction set architectures. This inconsistency triggers arithmetic state divergence and permanent consensus failures. Second, existing methods enforce uniform load distribution across shards. This ignores physical hardware disparities and forces powerful nodes to idle while waiting for resource-constrained validators, creating severe straggler bottlenecks. To address these challenges, we propose AdaH-Chain, a deterministic capacity-aware sharding framework. First, we design a Cross-ISA Deterministic Execution Engine. It replaces unsafe floating-point operations with a symmetric fixed-point quantization mechanism to mathematically guarantee bit-wise consensus safety. Second, we introduce a Capacity-Aware GNN Sharding algorithm. This mechanism maps extracted transaction subgraphs proportionally to verified hardware throughput limits, effectively eliminating the straggler effect. We evaluate AdaH-Chain using real transaction traces containing one million accounts from the Ethereum Mainnet. Experimental results confirm that the fixed-point engine preserves 94.7%of the original topological clustering accuracy while ensuring a 0% consensus divergence rate. By structurally aligning workloads with hardware capacities, AdaH-Chain delivers a peak throughput of 4,800 TPS, achieving a 1.9× gain over state-of-the-art learning protocols.

Read PDF

Similar papers

Preprint Oct 2026

GridSMR: Causal Compression for Sharded Blockchains

We present GridSMR, a sharded blockchain that scales execution horizontally while allowing dependent cross-shard operations to progress within a single block. Existing sharded systems typically place coordination between dependent cross-shard steps, making latency grow with causal depth. GridSMR localizes atomicity to...

Shir Cohen, A. Alon, Raz Omessi et al. · 0 citations
Book Open access Sep 2026

BigBFT: Scaling BFT without Compromising Fault Tolerance via State Sharding

Scalability remains a major challenge for Byzantine fault tolerance (BFT) systems, whose throughput is often limited by sequential transaction processing at each node. Prior work has attempted to address this challenge by full sharding or by replacing total ordering with serializable concurrent execution, but these app...

Guang-Da Sun, Jialin Li · 0 citations
Preprint Sep 2026

Breaking Cycles for Scalable Fair Ordering in Blockchain Systems

FlashOrder is presented, a deterministic fair-ordering engine that localizes cyclic ambiguity before it propagates across the batch, and results show that localizing cyclic ambiguity yields stronger fairness at substantially higher throughput.

Jin-Chun He, Wang-Jie Qiu, Yi-Zhong Liu et al. · 0 citations
Open access Sep 2026

Benchmarking Consensus Protocols for High-Performance Permissioned Blockchain Systems

This study presents a comparative evaluation of four Hyperledger Besu consensus algorithms, namely Ethash, Clique, QBFT, and IBFT 2.0, executed under identical hardware, network topology, and genesis configurations to quantify latency, throughput, and system overhead.

Muhammet Furkan Ozara, A. Akbulut, Mustafa Kara et al. · 0 citations
2026

Mecury: Integrating Account Allocation and Scheduling for Enhancing Blockchain Sharding Performance

Existing sharded blockchain systems suffer from excessive cross-shard communication overhead and workload imbalance. Although state-of-the-art account allocation schemes partially alleviate these problems, they still fail to simultaneously achieve effective cross-shard transaction reduction and balanced workload distri...

Zitong Zhang, Hao-Xiang Han, Chao-Ming Shi et al. · 0 citations
Open access Sep 2026

A Mathematical Framework for Performance Multi-Objective Optimization of Blockchain Sharding with MongoDB Distributed Storage

Blockchain sharding partitions network state and transaction load across multiple parallel subchains (shards) in order to overcome the throughput ceiling of monolithic consensus protocols. In this study, we develop a mathematical performance model for blockchain sharding in which the underlying persistence layer is rea...

Divyesh Bhatnagar, Anil Gupta · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.