AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
2min chapter
Sean Bowe on SNARKs, Trusted Setups & Elliptic Curve Cryptography
Zero Knowledge
Creating and Optimizing a Collision Resistant Hash Function Based on an Elliptic Curve Discrete Logarithm Problem
This chapter discusses the creation and optimization of a collision resistant hash function based on an elliptic curve discrete logarithm problem, used for Merkle trees in ZKASH. The speaker shares insights on optimizing the function and credits another person for clever contributions.
00:00
Transcript
Episode notes
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