MTU: The Multifunction Tree Unit for Accelerating Zero-Knowledge Proofs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915562640113664 |
|---|---|
| author | Mo, Jianqiao Daftardar, Alhad Ah-Kiow, Joey Guo, Kaiyue Bünz, Benedikt Garg, Siddharth Reagen, Brandon |
| author_facet | Mo, Jianqiao Daftardar, Alhad Ah-Kiow, Joey Guo, Kaiyue Bünz, Benedikt Garg, Siddharth Reagen, Brandon |
| contents | Zero-Knowledge Proofs (ZKPs) are critical for privacy-preserving techniques and verifiable computation. Many ZKP protocols rely on key kernels such as the SumCheck protocol and Merkle Tree commitments to enable their key security properties. These kernels exhibit balanced binary tree computational patterns, which enable efficient hardware acceleration. Although prior work has investigated accelerating these kernels as part of an overarching ZKP protocol, exploiting this common tree pattern remains relatively underexplored. We conduct a systematic evaluation of these tree-based workloads under different traversal strategies, analyzing performance on multi-threaded CPUs and the Multifunction Tree Unit (MTU) hardware accelerator. We introduce a hardware-friendly Hybrid Traversal for binary tree that improves parallelism and scalability while significantly reducing memory traffic on hardware. Our results show that MTU achieves up to $1478\times$ speedup over CPU at DDR-level bandwidth and that our hybrid traversal outperforms breadth-first search by up to $3\times$. These findings offer practical guidance for designing efficient hardware accelerators for ZKP workloads with binary tree structures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_16793 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | MTU: The Multifunction Tree Unit for Accelerating Zero-Knowledge Proofs Mo, Jianqiao Daftardar, Alhad Ah-Kiow, Joey Guo, Kaiyue Bünz, Benedikt Garg, Siddharth Reagen, Brandon Hardware Architecture Zero-Knowledge Proofs (ZKPs) are critical for privacy-preserving techniques and verifiable computation. Many ZKP protocols rely on key kernels such as the SumCheck protocol and Merkle Tree commitments to enable their key security properties. These kernels exhibit balanced binary tree computational patterns, which enable efficient hardware acceleration. Although prior work has investigated accelerating these kernels as part of an overarching ZKP protocol, exploiting this common tree pattern remains relatively underexplored. We conduct a systematic evaluation of these tree-based workloads under different traversal strategies, analyzing performance on multi-threaded CPUs and the Multifunction Tree Unit (MTU) hardware accelerator. We introduce a hardware-friendly Hybrid Traversal for binary tree that improves parallelism and scalability while significantly reducing memory traffic on hardware. Our results show that MTU achieves up to $1478\times$ speedup over CPU at DDR-level bandwidth and that our hybrid traversal outperforms breadth-first search by up to $3\times$. These findings offer practical guidance for designing efficient hardware accelerators for ZKP workloads with binary tree structures. |
| title | MTU: The Multifunction Tree Unit for Accelerating Zero-Knowledge Proofs |
| topic | Hardware Architecture |
| url | https://arxiv.org/abs/2507.16793 |