In this article we present a systematization of knowledge (SoK) on the usage of hash functions in Zero Knowledge Proofs (ZKP’s).
Since ZKP’s operate on finite fields, traditional time-tested hash functions like SHA256 are unsuitable due to overhead in proving and verification of large number of bitwise operations.
ZK-friendly hash functions are optimized for modular arithmetic in a finite field which reduces the circuit complexity significantly. This has led to widespread deployment of these hash functions in production level systems.
That said, the ZK-friendly hash functions are relatively newer than the traditional hash functions, and are yet to undergo the test of time. Our main goal is to survey such ZK-friendly hash functions, and highlight their general use cases in ZKP’s.
Read the full paper: https://github.com/ingonyama-zk/papers/blob/main/sok_zk_friendly_hashes.pdf
Follow our Journey
Join us: https://www.ingonyama.com/careers