StarkWare Scholar Summit – Shubhangi Saraf: Proximity gaps for Reed-Solomon codes and the soundness of FRI

In this talk, Shubhangi Saraf will discuss the beautiful FRI protocol for testing if a given function is close to a low-degree polynomial.

She will also discuss our current understanding of its soundness using connections to proximity gaps for Reed-Solomon codes.

About the speaker:
Shubhangi Saraf is a Professor in the Mathematics and Computer Science departments at the University of Toronto. Before this, she held a faculty position at Rutgers University. Her research interests lie broadly in theoretical computer science with a focus on arithmetic complexity, error-correcting codes, and sublinear time algorithms.

She received her Bachelor’s degree in Mathematics from MIT in 2007 and then a PhD degree in Computer Science from MIT in 2011. Prior to joining the faculty of Rutgers University in 2012, she spent a year as a postdoctoral researcher at the Institute for Advanced Study (IAS). She 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.