Anubhav Baweja

Anubhav Baweja researched memory and computation trade-offs in the sumcheck protocol at the University of Pennsylvania. The work studied how a prover can operate with streaming data, establishing limits on its efficiency and implementing an algorithm for products of multilinear polynomials. The reported evaluation used up to 120 times less memory than a linear-time prover, with less than twice the computation time.

1 talk by Anubhav Baweja