Azam is a senior cryptography researcher at Consensys company. She mainly works on the design and implementation of practical SNARK for layer 2 also known as zk-rollup.

 She has been working as a researcher at Ecole Normal Superieure and Ecole Polytechnique, France, where she has done research on double-preventing signature schemes,  functional encryptions, commitment schemes, and SNARK.

Azam Soleimanian

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.