A Unified GPU Framework for Hash-Intensive Workloads in Zero-Knowledge Proof Systems

Zero-knowledge proofs (ZKPs) enable verifiable computation without exposing private data and are increasingly deployed in blockchains and privacy-preserving machine learning. A major computational bottleneck in modern ZKP systems arises from algebraic hash functions and Merkle tree operations, whose heterogeneous round structures and irregular data dependencies expose limited parallelism and conflict-prone access patterns that are poorly aligned with the execution model of modern GPUs. Existing GPU frameworks accelerate specific hashes or static Merkle constructions, yet lack a unified execution model for structurally diverse hash designs and irregular dynamic Merkle workloads. We present MARS , a GPU acceleration framework for hash-intensive ZKP workloads. MARS introduces a shared operator-level abstraction for algebraic hashes, expressing diverse round structures as reusable algebraic operator skeletons and materializing static execution plans through compile-time specialization. It further proposes an index-aligned warp-cooperative execution model that preserves uniform control flow under asymmetric round designs and sustains high SIMD utilization across heterogeneous hash structures. It also builds a conflict-aware Merkle processing pipeline that decouples path extraction from depth-wise hash updating to handle irregular dynamic updates efficiently. Evaluation shows that MARS improves ZK-friendly hash throughput by up to 1.71 × and Merkle tree update performance by 6.99 × on average compared to state-of-the-art GPU implementations. It also offers a 1.36 × speedup over a multi-core CPU baseline for a production zkEVM prover.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Architecture and Code Optimization
Published
2026-11-18
DOI
https://doi.org/10.1145/3864374
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Unified GPU Framework for Hash-Intensive Workloads in Zero-Knowledge Proof Systems

Xuanhua Shi, Hai Jin, Xiaohai Dai, Mingyu Gao et al.
2 links
ACM Transactions on Architecture and Code Optimization
Parallel Computing and Optimization Techniques
article

A Unified GPU Framework for Hash-Intensive Workloads in Zero-Knowledge Proof Systems

Xuanhua Shi, Hai Jin, Xiaohai Dai, Mingyu Gao, Weiliang Ma, Qian Xiong, Yufan Bai
article en

Abstract

Zero-knowledge proofs (ZKPs) enable verifiable computation without exposing private data and are increasingly deployed in blockchains and privacy-preserving machine learning. A major computational bottleneck in modern ZKP systems arises from algebraic hash functions and Merkle tree operations, whose heterogeneous round structures and irregular data dependencies expose limited parallelism and conflict-prone access patterns that are poorly aligned with the execution model of modern GPUs. Existing GPU frameworks accelerate specific hashes or static Merkle constructions, yet lack a unified execution model for structurally diverse hash designs and irregular dynamic Merkle workloads. We present MARS , a GPU acceleration framework for hash-intensive ZKP workloads. MARS introduces a shared operator-level abstraction for algebraic hashes, expressing diverse round structures as reusable algebraic operator skeletons and materializing static execution plans through compile-time specialization. It further proposes an index-aligned warp-cooperative execution model that preserves uniform control flow under asymmetric round designs and sustains high SIMD utilization across heterogeneous hash structures. It also builds a conflict-aware Merkle processing pipeline that decouples path extraction from depth-wise hash updating to handle irregular dynamic updates efficiently. Evaluation shows that MARS improves ZK-friendly hash throughput by up to 1.71 × and Merkle tree update performance by 6.99 × on average compared to state-of-the-art GPU implementations. It also offers a 1.36 × speedup over a multi-core CPU baseline for a production zkEVM prover.

ACM Transactions on Architecture and Code Optimization
Huazhong University of Science and Technology (CN), Tsinghua University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Hubei Province, National Key Research and Development Program of China
Parallel Computing and Optimization Techniques
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.

Laika access coming soon