📚Theory
Last updated
Last updated
From Computation to SNARKs: A Step-by-Step Journey
In this tutorial, we aim to provide a comprehensive understanding of Zero-Knowledge Proofs (ZKPs), especially focusing on SNARKs. The journey from basic computation to the implementation of SNARKs can be viewed as a series of transformations, each building upon the last to achieve our final objective.
Computation: Here, we begin with basic algorithms and the problems they solve.
Algebraic Circuit: We transition from computation to an algebraic representation, which is more suitable for cryptographic contexts.
R1CS (Rank-1 Constraint System): At this juncture, we convert our computations into a system of constraints. This format is pivotal for the next stages.
QAP (Quadratic Arithmetic Programs): We further refine our representation into QAPs, setting the stage for cryptographic applications.
LIP (Linear Interactive Proof): Introducing cryptographic elements, LIPs allow for verification of statements without revealing the specifics.
SNARK (Succinct Non-Interactive Argument of Knowledge): The final stage, where we achieve a concise proof system that ensures privacy and does not require interaction.
Throughout this tutorial, we will delve into each stage, providing technical insights and clear explanations. Our goal is to elucidate the transition from pure computation to the advanced realm of SNARKs.
