zkPHIRE: A Programmable Accelerator for ZKPs over HIgh-degRee, Expressive Gates

• URL: http://arxiv.org/abs/2508.16738v1
• Date: Fri, 22 Aug 2025 18:27:26 GMT
• Title: zkPHIRE: A Programmable Accelerator for ZKPs over HIgh-degRee, Expressive Gates
• Authors: Alhad Daftardar, Jianqiao Mo, Joey Ah-kiow, Benedikt Bünz, Siddharth Garg, Brandon Reagen,
• Abstract summary: ZKPs have emerged as powerful tools for secure and privacy-preserving computation.<n>Despite their potential, ZKPs have seen limited deployment because of their exceptionally high computational overhead.<n>We present a novel programmable accelerator that efficiently handles arbitrary custom gates via SumCheck.<n>We integrate this unit into a full-system accelerator, zkPHIRE, which achieves $1486times$ geomean speedup over CPU and $11.87times$ speedup over the state-of-the-art at iso-area.
• Score: 10.770218753770637
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Zero-Knowledge Proofs (ZKPs) have emerged as powerful tools for secure and privacy-preserving computation. ZKPs enable one party to convince another of a statement's validity without revealing anything else. This capability has profound implications in many domains, including: machine learning, blockchain, image authentication, and electronic voting. Despite their potential, ZKPs have seen limited deployment because of their exceptionally high computational overhead, which manifests primarily during proof generation. To mitigate these overheads, a (growing) body of researchers has proposed hardware accelerators and GPU implementations for kernels and complete protocols. Prior art spans a wide variety of ZKP schemes that vary significantly in computational overhead, proof size, verifier cost, protocol setup, and trust. The latest, and widely used ZKP protocols are intentionally designed to balance these trade-offs. A particular challenge in modern ZKP systems is supporting complex, high-degree gates using the SumCheck protocol. We address this challenge with a novel programmable accelerator that efficiently handles arbitrary custom gates via SumCheck. Our accelerator achieves upwards of $1000\times$ geomean speedup over CPU-based SumChecks across a range of gate types. We integrate this unit into a full-system accelerator, zkPHIRE, which achieves $1486\times$ geomean speedup over CPU and $11.87\times$ speedup over the state-of-the-art at iso-area. zkPHIRE is the first accelerator to scale to problem sizes of $2^{30}$ nominal constraints while maintaining small proof sizes and programmability.

Related papers

• ZKProphet: Understanding Performance of Zero-Knowledge Proofs on GPUs [0.7544506709471767]
  Zero-Knowledge Proofs (ZKP) are protocols which construct cryptographic proofs to demonstrate knowledge of a secret input in a computation without revealing any information about the secret.<n>ZKPs enable novel applications in private and verifiable computing such as anonymized cryptocurrencies and blockchain scaling.<n>We find that a systematic characterization of execution bottlenecks in ZKPs, as well as their scalability on modern GPU architectures, is missing in the literature.
  arXiv  Detail & Related papers  (2025-09-17T22:52:19Z)
• A distillation-teleportation protocol for fault-tolerant QRAM [95.99192129224721]
  We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation.<n>For coherently accessing classical memories of size $2n$, our protocol consumes only $mathrmpoly(n)$ fault-tolerant quantum resources.
  arXiv  Detail & Related papers  (2025-05-26T17:42:56Z)
• Need for zkSpeed: Accelerating HyperPlonk for Zero-Knowledge Proofs [19.39122173458594]
  ZKPs have applications in blockchain technologies, verifiable machine learning, and electronic voting.<n>Recent works have accelerated the key primitives of state-of-the-art ZKP protocols on GPU and ASIC.<n>This work presents an accelerator, zkSpeed, for HyperPlonk, a state-of-the-art ZKP protocol.
  arXiv  Detail & Related papers  (2025-04-08T16:56:10Z)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [42.95092131256421]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• On the practicality of quantum sieving algorithms for the shortest vector problem [42.70026220176376]
  lattice-based cryptography is one of the main candidates of post-quantum cryptography.<n> cryptographic security against quantum attackers is based on lattice problems like the shortest vector problem (SVP)<n>Asymptotic quantum speedups for solving SVP are known and rely on Grover's search.
  arXiv  Detail & Related papers  (2024-10-17T16:54:41Z)
• Demonstrating real-time and low-latency quantum error correction with superconducting qubits [52.08698178354922]
  We demonstrate low-latency feedback with a scalable FPGA decoder integrated into a superconducting quantum processor. We observe logical error suppression as the number of decoding rounds is increased. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments.
  arXiv  Detail & Related papers  (2024-10-07T17:07:18Z)
• SZKP: A Scalable Accelerator Architecture for Zero-Knowledge Proofs [10.603449308259496]
  ZKPs are an emergent paradigm in verifiable computing. Two key primitives in proof generation are the Number Theoretic Transform (NTT) and Multi-scalar multiplication (MSM) We present SZKP, a scalable accelerator framework that is the first ASIC to accelerate an entire proof on-chip.
  arXiv  Detail & Related papers  (2024-08-12T01:53:58Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• REPQC: Reverse Engineering and Backdooring Hardware Accelerators for Post-quantum Cryptography [5.458904989691539]
  We show that PQC hardware accelerators can be backdoored by two different adversaries located in the chip supply chain. We propose REPQC, a sophisticated reverse engineering algorithm that can be employed to confidently identify hashing operations. An adversary proceeds to insert malicious logic in the form of a stealthy Hardware Trojan Horse (HTH)
  arXiv  Detail & Related papers  (2024-03-14T12:57:59Z)
• DeepGEMM: Accelerated Ultra Low-Precision Inference on CPU Architectures using Lookup Tables [49.965024476651706]
  DeepGEMM is a lookup table based approach for the execution of ultra low-precision convolutional neural networks on SIMD hardware. Our implementation outperforms corresponding 8-bit integer kernels by up to 1.74x on x86 platforms.
  arXiv  Detail & Related papers  (2023-04-18T15:13:10Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding [5.5165579223151795]
  We use QLDPC codes to distill GHZ states, as the resulting high-fidelity logical GHZ states can interact directly with the code used to perform distributed quantum computing. Our results apply to larger size GHZ states as well, where we extend our technical result about a measurement property of $3$-qubit GHZ states to construct a scalable GHZ purification protocol.
  arXiv  Detail & Related papers  (2022-10-25T16:42:32Z)
• QubiC: An open source FPGA-based control and measurement system for superconducting quantum information processors [5.310385728746101]
  We design a modular FPGA based system called QubiC to control and measure a superconducting quantum processing unit. A prototype hardware module is assembled from several commercial off-the-shelf evaluation boards and in-house developed circuit boards. System functionality and performance are demonstrated by performing qubit chip characterization, gate optimization, and randomized benchmarking sequences.
  arXiv  Detail & Related papers  (2020-12-31T21:06:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.