Tong Zhou

Tong Zhou

Auto-generated profile, based on publicly available information

Tong Zhou

Hefei Institutes of Physical Science, Chinese Academy of Sciences, Hefei, Anhui, China and Anhui Zhongke Jingge Technologies Co., Ltd, Hefei, Anhui, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 March 2019 in IEEE Access
Verified
Journal Article
Open access
TZTong Zhou
Tong Zhou
XLXiaofeng Li
Xiaofeng Li
HZHe Zhao
He Zhao
In today’s digital information age, the conflict between the public’s growing awareness of their own data protection and the data owners’ inability to obtain data ownership has become increasingly prominent. The emergence of blockchain provides a new direction for data protection and data tokenization. Nonetheless, existing cryptocurrencies such as Bitcoin using Proof-of-Work are particularly energy intensive. On the other hand, classical protocols such as Byzantine Agreement do not work efficiently in an open environment. Therefore, in this paper, we propose a permission-less blockchain with a novel double-DAG (Directed Acyclic Graph) architecture called DLattice, where each account has its own Account-DAG and all accounts make up a greater Node-DAG structure. DLattice parallelizes the growth of each account’s Account-DAG, each of which is not influenced by other accounts’ irrelevant transactions. DLattice uses a new DPoS-BA-DAG(PANDA) protocol to reach consensus among users only when the forks are observed. Based on proposed DLattice, we introduce a process of data tokenization, including data assembling, data anchoring and data authorization. We implement DLattice and evaluate its performance on 25 ECS virtual machines, simulating up to 500 nodes. Experimental results show that DLattice reaches a consensus in under 10 seconds, achieves desired throughput, and incurs almost no penalty for scaling to more users.

7 August 2023
Verified
Conference Paper
Open access
HZHaowen Zhang
Haowen Zhang
JLJing Li
Jing Li
HZHe Zhao
He Zhao
TZTong Zhou
Tong Zhou
NSNianzu Sheng
Nianzu Sheng
HPHengyu Pan
Hengyu Pan
Traditional blockchain systems still struggle with limited throughput, particularly those compatible with EVM, which are crucial in many blockchain applications. One of the main reasons arises from serial execution, which doesn’t exploit parallelism in transaction execution. Although some recent literature introduced concurrency control mechanisms to execute transactions in parallel, they do not work efficiently in real-world blockchains where proposers and validators have different execution contexts, which means varying execution deterministic levels and execution quantities. In this work, we propose BlockPilot, an overall parallel execution framework for blockchains. In the framework, proposers and validators can execute transactions concurrently with different deterministic levels. To enable parallel execution and produce a serializable schedule in proposers, we introduce an Optimistic Concurrency Control (OCC) algorithm called OCC-WSI. Meanwhile, validators require scheduling conflicting transactions to support parallel execution and commit transactions in the same schedule as proposers. Given that validators process more blocks than proposers, a parallel and pipeline workflow is designed for validators to process multiple blocks concurrently. We implement a prototype system based on Go Ethereum and evaluate its performance using real-world blocks. Our experimental results demonstrate that BlockPilot can accelerate the processing of a single block by 3.18x and achieve a maximum speedup of 7.71x in processing multiple blocks in 16 threads for validators, as well as a 4.89x acceleration for proposers compared to Go Ethereum.

7 March 2024 in Journal of Information Security and Applications
Verified
Journal Article
Closed access
HCHaotian Cheng
Haotian Cheng
XLXiaofeng Li
Xiaofeng Li
HZHe Zhao
He Zhao
TZTong Zhou
Tong Zhou
BYBin Yu
Bin Yu
NSNianzu Sheng
Nianzu Sheng

9 May 2023
Verified
Conference Paper
Open access
TZTong Zhou
Tong Zhou
HZHe Zhao
He Zhao
NSNianzu Shen
Nianzu Shen
BYBin Yu
Bin Yu
XLXiaofeng Li
Xiaofeng Li
JXJinlin Xu
Jinlin Xu
Scalability is often considered the "Achilles' heel" of blockchain technology. With a traditional chain-based structure, blocks cannot be generated concurrently, thus limiting the throughput and slowing transaction confirmation. Recently emerged graph-based blockchains generally excel in on-chain performance but are weaker in structural flexibility, which is essential for off-chain or cross-chain scaling. In this paper, we propose Fractal Ledger, a novel blockchain model to scale out the ledger in a fractal manner. Fractal Ledger is comprised of fractal units that synthesize both chain and graph structure. Through conversions and interactions of fractal units, Fractal Ledger can share the advantages of both types of blockchains and offer scalability in structure and storage. We introduce the deduction mechanisms for flexible structure scalability and a three-directional folding scheme of lossless on-chain data compression for storage scalability. Our experimental results reveal the effectiveness of Fractal Ledger in enhancing structure and storage scalability.

8 February 2026 in Computer Networks
Verified
Journal Article
Closed access
ZMZhiyu Ma
Zhiyu Ma
XLXiaofeng Li
Xiaofeng Li
HZHe Zhao
He Zhao
BYBin Yu
Bin Yu
TZTong Zhou
Tong Zhou
NSNianzu Sheng
Nianzu Sheng

2 April 2026 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
NSNianzu Sheng
Nianzu Sheng
TZTong Zhou
Tong Zhou
HZHe Zhao
He Zhao
XLXiaofeng Li
Xiaofeng Li
JXJinlin Xu
Jinlin Xu
The state tree used for blockchain state management has emerged as a core performance bottleneck, primarily due to the latency involved in generating cryptographic commitments during block production and validation. To address this issue, we present a delayed write mechanism that decouples commitment computation from block execution. We introduce the Sliding Window Merkle Tree (SWMT), a cyclic in-memory cache that temporarily buffers recent state updates, deferring their integration into the state tree. SWMT uses a 32-bit window field to efficiently manage cache lifespan and support rapid commitment generation. To handle fluctuating transaction loads, we propose a TCP-inspired congestion control strategy that adapts caching granularity to dynamic workload intensity. Our design can be integrated with existing MPT and Verkle tree structures, while preserving proof succinctness and verifiability. Evaluation on 6 million real Ethereum blocks demonstrates up to a 61.3x reduction in commitment latency, a 6.3x speedup in block execution. These results highlight a practical and deployable approach to enhancing blockchain throughput and scalability.