Zero Knowledge cover image

What’s the Deal with Hash Functions?

Zero Knowledge

00:00

Recursion Requires Different Hash Functions

In recursion you have to compute a whole miracle tree and prove well formation of it. This also means that your hash function must be fast enough for your prover to sustain. For example this happened in this fractal recursion scheme where they computed a full miracle tree at every recursion step so they used Poseidon because they later proved miracle paths in this tree. They spent 99% of time just computing this tree before they even proven anything about it. It would never happen if they used a shadow 56 for example or for Blake 2 or 3 of course.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app