AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 261: Proofs, Arguments, and ZKPs with Justin Thaler
Zero Knowledge
Is FFTs a Bottleneck in Hardware Acceleration?
3min Snip
00:00
Summary
Transcript
Episode notes
The question is always what is the bottleneck in the prover implementation? And if we're developing special purpose hardware to implement the prover, you know, you have to be very aware of bottlenecks. FFTs come up fast for a transforms because they divide large, large polynomials. If you use some check instead, you can avoid those FFTs. So this blog post from Ingo Yama was specifically focused on FFTs as a possible bottleneck versus some check as a possibly bottleneck.
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