Paper 2024/1212
Efficient Layered Circuit for Verification of SHA3 Merkle Tree
Abstract
We present an efficient layered circuit design for SHA3-256 Merkle tree verification, suitable for a GKR proof system, that achieves logarithmic verification and proof size. We demonstrate how to compute the predicate functions for our circuit in $O(\log n)$ time to ensure logarithmic verification and provide GKR benchmarks for our circuit.
Metadata
- Available format(s)
- -- withdrawn --
- Category
- Implementation
- Publication info
- Preprint.
- Contact author(s)
-
dingchan @ iu edu
fuzm @ chinare com cn - History
- 2025-12-22: withdrawn
- 2024-07-29: received
- See all versions
- Short URL
- https://ia.cr/2024/1212
- License
-
CC BY-NC-ND
