Labrador is the first practical lattice-based zkSNARK. The protocol generates compact proofs of approximately 50 kB across a wide range of practically relevant R1CS sizes. It has become an important tool in lattice cryptography, already seeing applications in tasks like post-quantum signature aggregation. It also serves as the foundation for Greyhound, the most practical lattice-based polynomial commitment scheme to date.

This blog explores Labrador's construction from the ground up, starting from a simple baby protocol and progressively building toward the full recursive Labrador protocol.

With ICICLE v4, we’ve built a clean and efficient implementation of the Labrador protocol that runs on both CPU and GPU. It’s written in simple, readable C++ and uses a new ring we named Baby-Koala that makes the math fast and efficient. This implementation shows how ICICLE can make advanced lattice cryptography practical and accessible.

Read the full blog here: https://hackmd.io/@Ingonyama/fast-labrador-prover