Proofs, Arguments, and ZKPs with Justin Thaler
Zero Knowledge
00:00
Is FFTs a Bottleneck in Hardware Acceleration?
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.
Transcript
Play full episode
