Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems

Research output: Working paperResearch

Abstract

The area of practical proof systems, like SNARKs, STARKs, or Bulletproofs, is seeing a very dynamic development. Many use-cases of such systems involve, often as their most expensive apart, proving the knowledge of a preimage under a certain cryptographic hash function.

In this paper we present a modular framework and concrete instances of cryptographic hash functions which either work natively with GF(p) objects or on binary strings. Compared to competitors, our hash function Poseidon uses up to 8x fewer constraints per message bit compared to Pedersen Hash, whereas our STARK-friendly hash Starkad takes wins the factor of 4 over the hash function Friday by using a much smaller field.
Original languageEnglish
Publication statusPublished - 6 May 2019

Keywords

  • snark
  • stark
  • bulletproofs
  • hash
  • zkp

Fingerprint Dive into the research topics of 'Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems'. Together they form a unique fingerprint.

  • Cite this