Groth16, from R1CS to three group elements
Anchor-chan opens the series with the proof system that shipped zk to production. We walk the pipeline from R1CS to QAP to the three-element proof, and cover what actually happens inside the trusted setup ceremony.
FROM THE BROADCAST
"Good evening. Tonight we cover groth16: the workhorse of zk-snarks. This is the kind of topic that sits right on the seam between research and production, and we're going to walk through the construction before looking at what it means for the chains that actually ship it."
"The short version is this: Groth16 is the pairing-based zk-SNARK that set the bar for on-chain verification. We'll spend the first half of the segment on the core mechanism, and the second half on what operators are actually deploying."
"Let's start with the basics. It compresses any NP statement into just three group elements, making the verifier cheap enough to run inside an Ethereum transaction. The construction takes an R1CS instance, turns it into a Quadratic Arithmetic Program, and commits to the QAP polynomials inside a structured reference string. Keep that in mind as we go deeper."
Groth16: The workhorse of zk-SNARKs
Groth16 is the pairing-based zk-SNARK that set the bar for on-chain verification. It compresses any NP statement into just three group elements, making the verifier cheap enough to run inside an Ethereum transaction.
OPEN TOPIC ->