CZChenyu Zhang

Chenyu Zhang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Chenyu Zhang has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Fast and Practical Sector-Based BFT Consensus With Sublinear Communication Complexity

    by Hao Xu, Chenyu Zhang, Xiulong Liu, Yiran Lv, Shiyu Gan, Liehuang Zhu, Keqiu Li

    Byzantine fault-tolerant (BFT) consensus protocols are the core components of blockchain. In the process of improving the performance of BFT protocols, existing work faces the following three problems: 1) the binary dilemma between the leader’s performance bottleneck in star-based linear communication and compromised resilience in tree-based sublinear communication; 2) two- or three-round protocols restrict the phase number of one proposal, thereby limiting the number of concurrent proposals and causing high latency. 3) The fixed timeout makes the protocol sensitive to varying network delays. Therefore, this paper proposes Crackle, the first sector-based pipelined BFT protocol with a sublinear communication complexity, for a throughput improvement of consensus protocol with max resilience of $(\mathcal {N}\textrm {-} 1)/3$ . We propose a sector-based communication mode to disseminate messages from the leader to a subset of replicas in each phase to accelerate consensus and split the traditional two-round protocol into $2\mathsf {\kappa }$ phases to increase the basic pipeline scale. We refine the timer strategy so that the timeout $\Delta $ is adjusted with the proposal submission to cope with the changing network environment. We then address two technical challenges: 1) to ensure Quorum Certificate (QC) validation, we design a $\mathit {voteMap} s$ field within each block, and verify QC by the signature aggregation of $\mathit {voteMap} s$ in continuous $\mathsf {\kappa }$ phases; and 2) to achieve pipeline decoupling among shorter phases, we propose a vote-appending mechanism that relaxes the conditions for the leader to send new proposals. We provide comprehensive theoretical proof of the correctness of Crackle, including safety and $\mathit{liveness}$ . Moreover, we implement Crackle based on a public BFT framework and deploy it on 64 cloud servers. Real experimental results reveal that our Crackle protocol achieves up to 10.36x higher throughput and can dynamically adapt to network delay compared with state-of-the-art BFT protocols such as Kauri and Hotstuff.


  • Open Access

    Orcas: A DAG-based Consensus Approach with Linear Communication Overhead

    by Yi Hua, Xiulong Liu, Hao Xu, Chenyu Zhang, Gaowei Shi, Keqiu Li, Muhammad Shahzad, Guyue (Grace) Liu


  • Enabling Consistent Sensing Data Sharing Among IoT Edge Servers via Lightweight Consensus

    by Xiulong Liu, Zhiyuan Zheng, Hao Xu, Zhelin Liang, Gaowei Shi, Chenyu Zhang, Keqiu Li

    Blockchain offers distinct advantages in terms of data credibility and provenance certification, and its fusion with Internet of Things (IoT) technology holds great promise. Nevertheless, IoT environments are marked by extensive node networks and intricate communication patterns, especially the sensing environment. The conventional blockchain consensus mechanism, hampered by its heavy reliance on computing resources and communication bandwidth, faces difficulties in ensuring seamless data exchange among IoT edge servers. The issues encountered by state-of-the-art Byzantine Fault Tolerance (BFT) consensus include: (i) high communication complexity between nodes; and (ii) the detrimental impact of Byzantine behavior on system performance. To overcome the above problems, we propose the lightweight blockchain consensus called AntB, firstly introducing the concept of sampling into the consensus and significantly reducing the number of participating consensus nodes from $N$ to $n$, which lowers the consensus complexity to $\mathbf{2\cdot O(n)+O(N)}$. We design a dynamic reputation mechanism so that Byzantine nodes cannot control the sampling set to affect the activity of the consensus in the long term. When implementing AntB, we address three significant technical challenges: (i) to determine the optimal sample size, we propose a sampling calculation method based on statistical confidence intervals, where the sample size is primarily determined by the chosen confidence level and margin of error; (ii) to prevent Byzantine behavior, we devise a weighted random sampling mechanism utilizing reputation coefficients based on edge servers’ behaviors; and (iii) to maintain consensus activity and consistency after sampling, we propose the consensus mechanism for partial sampling and global verification to avert potential issues. We implement AntB and conduct performance evaluations in a server with 32 cores and 64GB of memory. The evaluation results indicate that, the more nodes participating in the process of consensus, the better the performance of AntB will be. Especially, compared to HotStuff, AntB has a 24.94% higher success rate and Transactions Per Second (TPS) can improve by 102.10% when the number of nodes is 300.


  • GFBE: A Generalized and Fine-Grained Blockchain Evaluation Framework

    by Liyuan Ma, Xiulong Liu, Yuhan Li, Chenyu Zhang, Gaowei Shi, Keqiu Li

    Multi-dimensional performance evaluation is crucial for blockchain systems as it enables appropriate blockchain choosing for a given scenario and helps to pinpoint the bottleneck module of a blockchain system to optimize its performance. However, the existing evaluation frameworks for blockchain suffer from low system generality, inefficient workload execution, and incomprehensible evaluation metrics. In order to overcome their limitations, we design and implement the Generalized and Fine-grained Blockchain Evaluation (GFBE) framework. Specifically, we abstract 3 types of Universal Evaluation Interface (UEI) via the dynamic proxying approach to enable generalized evaluation of heterogeneous blockchain systems. Through the design of Lua-based workloads plugin with high flexibility and reusability, GFBE improves the efficiency of workload execution. To achieve comprehensive measurement, we define 15 key performance metrics across hierarchical layers of blockchain architecture. We also implement and deploy GFBE on 16 machines each with 8 CPUs and 16GB RAM, and evaluate three open-source blockchain systems namely Ethereum, ChainMaker, and Haihe smart chain. The experimental results demonstrate that GFBE efficiently and accurately measure 15 key performance metrics such as Contract Execution Efficiency at the contract layer, Consensus Agreement Time Ratio at the consensus layer, and State Query Time at the data layer. Compared with state-of-the-art frameworks such as BLOCKBENCH, Log-based, and Caliper, GFBE distinguishes itself as the only framework that encompasses the appealing features of universal interface, reusable workload, and all-layer metrics.