Abstract

In this talk we will explore incremental verifiable computation (IVC), as well as its generalization PCD. We will show how IVC and PCD is defined, how it can lead to low memory and distributed provers and study more applications. We will also look at constructions from SNARKs and modern constructions from accumulation schemes.
Finally we will discuss open problems in the space.

Attachment

Video Recording