Zero Knowledge Proofs (ZKPs) have become a fundamental building block for creating scalable and privacy-preserving decentralized applications. ZKPs enable verifiable computing, but the powerful math behind ZKPs is both compute and memory intensive. Furthermore, constructing ZKPs for all steps of a and for each invocation of a stream/ML processing pipeline compounds the overheads of producing ZKP proofs.
In this project, you will explore producing efficient ZK proofs in an incremental manner for the entire stream processing pipeline. The project will involve exploring the latest ZK proof systems & folding techniques and applying them to prove single or multiple invocations of a pipelined computation. The focus will be on identifying which proofs systems are best suited from a folding perspective for each step of a pipeline and implementing them.
Duration: flexible, to be agreed (typically 3-4 months), starting time is flexible
Location: Stuttgart (Germany)