Computational Proof Systems
  • 👋Cryptography and ZKP research note
  • Protocol and Primitives
    • Chapter One: ZK fundamentals
      • Overview of Computation in Zero-Knowledge Proofs
      • Arithemetic Circuit
      • Arithemetic Circuit (RUST)
      • Polynomial
      • R1CS to QAP
      • Univariate Polynomial Multiplication Using FFT
    • Chapter Two: Interative and non-interative proof
      • Interactive and Non-interactive Zero-Knowledge Proof Systems
    • Chapter Three: Ploynomial Commitment Schemes
      • KZG Polynomial Commitment Scheme
        • Univariate KZG Polynomial Commitment Scheme
        • Multilinear KZG Polynomial commitment scheme
        • Batch Univariate KZG Polynomial Commitment Scheme
      • FRI Polynomial commitment scheme
    • Chapter Four: Sum Check Protocol
    • Chapter Five: GRK Protocol
      • The Protocol
      • Succinct GKR Protocol
    • Chapter Six: Groth16 Protocol
    • Chapter Seven: PLONK Protocol
    • Chapter Eight: PLONK Protocol Extensions
      • TurboPLONK
      • Lookup Arguments and PLONKUP
        • PLOOKUP
        • Halo2 Lookup Protocol
      • HYPERPLONK
Powered by GitBook
On this page
  1. Protocol and Primitives

Chapter One: ZK fundamentals

This chapter explores the fundamentals of zero knowledge proof

PreviousCryptography and ZKP research noteNextOverview of Computation in Zero-Knowledge Proofs

Last updated 1 month ago

Overview of Computation in Zero-Knowledge Proofs
Arithemetic Circuit
Arithemetic Circuit (RUST)
Polynomial
R1CS to QAP
Univariate Polynomial Multiplication Using FFT