Rachit Srivastavablog.rachitasrivastava.com·Jan 5, 2024Groth 16: A linear PCP based SnarkPrerequisites: Understanding of what QAP is and how to create one from R1CS. Group theory understandings Bilinear Pairings Probabilistic Checkable Proofs ( PCP ) What is a PCP: Prover generates a PCP oracle, which can be thought of as a big mes...58 readsgroth16
Rachit Srivastavablog.rachitasrivastava.com·Jan 2, 2024FRI Polynomial Commitment SchemeThe FRI (Fast Reed-Solomon Interactive Oracle) commitment scheme is a cryptographic protocol that plays a crucial role in various zero-knowledge proof systems. It's designed to efficiently prove the correctness of computations without revealing any u...52 readssnarks
