AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 250: What's the Deal with Hash Functions?
Zero Knowledge
Recursion Requires Different Hash Functions
3min Snip
00:00
Summary
Transcript
Episode notes
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.
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode
Save any
moment
Hear something you like? Tap your headphones to save it with AI-generated key takeaways
Share
& Export
Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more
AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode