I am a researcher in cryptography at Consensys, where I work on efficient arguments of knowledge for the Linea layer 2, with a focus on both research and engineering aspects. In Spring 2023, I obtained my PhD in Computer Science from ETH Zurich. During my PhD, my main research interests were on foundational cryptography, mainly focused on zero-knowledge, but also delving into topics such as advanced encryption primitives and signatures.

Bogdan Ursu

Linear codes underlie one of the main approaches in zero-knowledge proofs and arguments, including works like FRI, Ligero, Brakedown and Orion. In this talk, we describe how to extend one of the protocols from Ligero and Brakedown to the regime of batched polynomial commitments, at the cost of a single extra operation in the verifier. Similarly to Redshift, we opt for increased efficiency via the list decoding regime. We also present an optimisation for using the resulting commitment with PIOPs.