Following up on requests made during my talk at the ZK Study club, I’ll discuss the mysterious connections between Fast Fourier Transforms (FFTs), short Probabilistically Checkable Proofs (PCPs) and Transparent ZK proofs of computational integrity (STARKs).

It would probably be good for you to refresh your memory of (i) the FFT algorithm  and (ii) polynomials over finite fields - see the finite fields parts here

Fast and Furious {Fourier Transforms, PCPs, STARKs} - For Real This Time