The performance of a prover is really really difficult to quantify here so when we for example from the design standpoint it's actually very difficult because on one hand you want to design a hash function that could be used in many applications with many proof systems. That's the trade-off of optimization as soon as you optimize for something the new optima for one use case and not for the others but yet flop. There's also the topic of let's say quantum resistance that maybe some hash functions at least are plausibly should stand further against, he says.

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