Systemization of Knowledge: ZK-Friendly Hash Functions

By Karthik Inbasekar

Covering:

  • Soft intro to hashes in ZKP
  • Real-world use cases
  • Design patterns
  • Weirdest / Coolest names in cryptography literature

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

Twitter: https://twitter.com/Ingo_zk

Github: https://github.com/ingonyama-zk

YouTube: https://www.youtube.com/@ingo_zk

Join us: https://www.ingonyama.com/careers

--

--

Ingonyama means Lion. We are a next-generation semiconductor company, designing accelerators for Zero Knowledge cryptography.

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Ingonyama

Ingonyama means Lion. We are a next-generation semiconductor company, designing accelerators for Zero Knowledge cryptography.