The Tip5 Hash Function for Recursive STARKs

ePrint Report: The Tip5 Hash Function for Recursive STARKs

Alan Szepieniec, Alexander Lemmens, Jan Ferdinand Sauer, Bobbin Threadbare

This paper specifies a new arithmetization-oriented hash function called Tip5. It uses the SHARK design strategy with low-degree power maps in combination with lookup tables, and is tailored to the field with $p=2^{64}-2^{32}+1$ elements.


The context motivating this design is the recursive verification of STARKs. This context imposes particular design constraints, and therefore the hash function's arithmetization is discussed at length.

alan called constraints context design eprint report function hash hash function low maps power report shark strategy tables verification