paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Accelerating Number Theoretic Transform with Multi-GPU Systems for Efficient Zero Knowledge Proof

利用多 GPU 系统加速数论变换以实现高效零知识证明
ASPLOS Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 12025匹配度 1/10 · 该论文属于高性能计算与密码工程领域,核心是多 GPU 上加速零知识证明中的 NTT 算法,与用户关注的静态分析、LLM/Agent 改进程序分析、浮点程序分析和贝叶斯程序分析均无直接关联。引用 8 inbox
Zhuoran Ji, Jianyu Zhao, Peimin Gao, Xiangkai Yin, Lei Ju
crossref: 2026-09-12dblp: 2026-09-12

AI 速览

一句话:提出多 GPU 专用 NTT 算法 UniNTT,通过无开销递归分解统一各层级优化,平均加速 4.26×。

零知识证明的证明生成耗时主要来自多标量乘法(MSM)和数论变换(NTT)。MSM 已借助多 GPU 系统高效加速,但 NTT 因置换式数据访问模式带来高昂的跨 GPU 通信开销,尚未获得同等支持。本文指出端到端证明生成亟需多 GPU NTT 支持,并提出 UniNTT——一种面向多 GPU 系统的 NTT 算法。其核心是无开销分解方法:递归地将一个 NTT 分解为更小的 NTT,使 warp、线程块、GPU 与多 GPU 各层级执行同一 NTT 计算的不同规模版本。基于抽象硬件模型,作者提出统一的 NTT 优化,再针对各层级定制应用,既简化优化过程,也表明通常仅适用于某一层级的优化可有效推广至其他层级。在 8-GPU 系统上,UniNTT 相比领先 NTT 实现平均加速 4.26×。

问题
多 GPU 系统下 NTT 因置换式数据访问模式产生高跨 GPU 通信开销,难以高效加速,并成为零知识证明端到端证明生成的瓶颈。
方法
提出 UniNTT,用无开销递归分解将 NTT 拆解为更小的 NTT,使 warp、线程块、GPU 与多 GPU 层级执行同一计算的不同规模版本,并基于抽象硬件模型统一各层级优化。
评估
在 8-GPU 系统上与领先 NTT 实现进行对比实验,UniNTT 平均取得 4.26× 加速。
原文摘要(Abstract)

Zero-knowledge proofs validate statements without revealing any information, pivotal for applications such as verifiable outsourcing and digital currencies. However, their broad adoption is limited by the prolonged proof generation times, mainly due to two operations: Multi-Scalar Multiplication (MSM) and Number Theoretic Transform (NTT). While MSM has been efficiently accelerated using multi-GPU systems, NTT has not, due to the high inter-GPU communication overhead incurred by its permutation data access pattern. This paper identifies the necessity of multi-GPU NTT support for end-to-end proof generation. It introduces UniNTT, an NTT algorithm tailored for multi-GPU systems. The data access pattern of NTT incurs communication across all levels of the multi-GPU hierarchy (i.e., warp, thread block, GPU, and multi-GPU), complicating the implementation of multi-GPU NTT. To this end, UniNTT proposes a novel, overhead-free decomposition approach that recursively decomposes an NTT into smaller NTTs, enabling all hierarchy levels execute the same NTT computations at different scales. It promotes a uniform design of NTT optimizations based on an abstract hardware model, which are then tailored and applied to different levels of the hierarchy. UniNTT not only simplifies the optimization process but also shows that optimizations typically specific to one level can also be effectively generalized to others. Experiments show that UniNTT achieves an average 4.26× speedup compared to leading NTT implementations when both are executed on an 8-GPU system.

链接与引用

DOI 原文 · DBLP

BibTeX
@inproceedings{JiZGY025,
  title = {Accelerating Number Theoretic Transform with Multi-GPU Systems for Efficient Zero Knowledge Proof},
  author = {Zhuoran Ji and Jianyu Zhao and Peimin Gao and Xiangkai Yin and Lei Ju},
  booktitle = {ASPLOS},
  year = {2025},
  doi = {10.1145/3669940.3707241}
}