Zero Knowledge cover image

Episode 329: Building Cryptographic Proofs from Hash Functions with Alessandro Chiesa and Eylon Yogev

Zero Knowledge

Exploring Limitations and Challenges in Constructing Cryptographic Proofs from Hash Functions

5min Snip

00:00
Play full episode
This chapter explores the limitations and complexities of constructing cryptographic proofs using hash functions, specifically focusing on the challenges in achieving certain functionalities like homomorphic commitments and recursive proofs. The discussion highlights the tensions between hash function security and structural limitations, while also mentioning potential solutions to address these issues and progress cryptographic techniques.

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

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

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