During our next meeting Bartosz Nowak will explore the fundamentals of STARK protocol, uncover how polynomial constraints ensure computational integrity. Latest optimisations in zkSTARKS provers and verifiers.

Leonid Logvinov will explore the internals of how ZK programs get compiled & proved starting with some theory. Then we will move on to example programs. The Noir & Barretenberg will be used as a tool to broader exploration of the concepts.

Ariel Gabizon, one of the authors of the PLONK paper, will walk us through the recent advances in the field of (Zero-Knowledge) Succinct Non-interactive ARguments of Knowledge. He will focus on GKR which received significant interest recently and attempt to explain it to us.

Marek Kirejczyk will present the so-called "Vitalik trick" for optimised Schnorr signature validation. By using it, you can reduce the gas cost from 100k+ to just 3k.