StarkWare Scholar Summit – Swastik Kopparty: FRI and STARKs via an Elliptic Curve Fast Fourier Transform (ECFFT)

Swatsik speaks about a new transform, the ECFFT, which works over all finite fields, and enables FRI and STARKs. The original FRI and STARK protocols are based on the classical FFT. Like the classical FFT, these protocols only work over finite fields that have a suitable root of unity in them.

About the speaker:
Swastik Kopparty is a Professor of Mathematics and Computer Science at the University of Toronto. His research areas include error-correcting codes, computational complexity theory, finite fields, randomness and pseudorandomness. Swastik got his PhD in Computer Science from MIT in 2010, was a postdoc at the Institute for Advanced Study in Princeton during 2010-2011, and was a faculty member in Mathematics and Computer Science at Rutgers University from 2011 to 2021. He is a recipient of the Alfred P. Sloan Research Fellowship and the NSF CAREER Award.

This talk was given at StarkWare Scholar Summit on August 5, 2024. This event brought together a global community of researchers, engineers, and thought leaders to explore the latest and greatest in blockchain tech.