Jul 2026· Fall Joint Computer Conference· pp. 273-280· 0 citations· 20 references
Abstract
Zero-knowledge proofs (ZKPs) are increasingly used in blockchain systems, privacy-preserving applications, and verifiable cloud computation, but their practical deployment is still constrained by the cost of proof generation. This cost is especially important when proof generation is provided as a cloud-side service, where prover latency directly affects service throughput and resource efficiency. Existing heterogeneous provers mainly follow an operator-centric design, offloading selected GPU-friendly kernels while leaving the overall proving pipeline fragmented across fine-grained execution boundaries. This approach is effective at reducing the cost of major operators, but it also changes the bottleneck structure of modern proving: once dominant kernels are accelerated, end-to-end inefficiency increasingly arises from fragmented cross-stage execution, including host-device transitions, intermediate-state materialization, and CPU-side coordination overhead. In this paper, we argue that the key systems problem is no longer simply which operator to accelerate next, but what the right runtime execution unit should be for heterogeneous ZKP proving. To this end, we propose region-centric execution, a locality-aware runtime abstraction that groups tightly dependent computations into larger execution units based on dependency locality, state continuity, and boundary cost. Building on this abstraction, we design execution mechanisms that preserve deviceresident state, delay unnecessary materialization, coordinate dependent computations within a region, and reduce excessive boundary crossings. We implement our design on top of a Plonky2-based GPU prover and evaluate it on four representative workloads. Region-centric execution improves end-to-end proving performance by $1.36 \times$ on average and up to $1.52 \times$ over an operator-centric baseline, with the gains coming primarily from lower coordination overhead and reduced host-device transfer cost rather than uniformly faster GPU kernels.
This paper presents a cross-platform implementation of GKR-based transparent on-chain verification for outsourced structured arithmetic circuits on the Ethereum Virtual Machine and Starknet (Cairo) and shows that direct execution cost increases rapidly with input size, whereas GKR-based verification scales much more fa...
It is shown that CryptDough generalizes the functionality of state-of-the-art MPC systems and remains competitive on the analytics they support, often outperforming them by more than $2\times$.
Muhammad Faisal, Alessandra Lanz, Sam Buxbaum et al.· Proceedings of the ACM SIGOP...· 0 citations
Ethereum execution clients implement identical Ethereum Virtual Machine (EVM) semantics, yet can exhibit substantially different performance in practice. We study this divergence through a three-step systems analysis of two representative clients, Geth and Reth. First, across historical synchronization, live synchroniz...
Chon Kit Lao, Nora Sinong Lu, Jing-Yi Ning et al.· International Conference on...· 0 citations
This work proposes a series of optimizations for these two kernels, including computation-transfer pipelining, load balancing, and memory access fusion, achieving 1.97 × to 2.16 × proof generation speedup over a state-of-the-art open source GPU acceleration library.
Xinwei Qiang, Liukun Yu, Xiyu Wang et al.· IEEE International Symposium...· 0 citations
This paper presents an architecture for verifiable container image distribution that addresses key-management challenges and enables policy-enforced admission-time verification, and implements a proof-of-concept integrated with GitHub Actions and GitLab Runners that mitigates common supply-chain attacks under a realist...
N. Fotiou, Lefteris Georgiadis, Ignacio Lacalle et al.· 0 citations
This work presents a distributed inference framework that integrates speculative decoding across edge and cloud, and shifts the bulk of computation to the edge, significantly lowers inference time and cloud cost, and preserves the accuracy of the big model without any retraining requirement.
D. J. Bajpai, K. Upadhyay, M. Hanawal· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.