Computational Proof Systems
search
⌘Ctrlk
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
    • Chapter Three: Ploynomial Commitment Schemes
    • Chapter Four: Sum Check Protocol
    • Chapter Five: GRK Protocol
    • Chapter Six: Groth16 Protocol
    • Chapter Seven: PLONK Protocol
    • Chapter Eight: PLONK Protocol Extensions
  • Sumcheck201 paper note
  • Keccak hash function
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Protocol and Primitives

Chapter One: ZK fundamentals

This chapter explores the fundamentals of zero knowledge proof

Overview of Computation in Zero-Knowledge Proofschevron-rightArithemetic Circuitchevron-rightArithemetic Circuit (RUST)chevron-rightPolynomialchevron-rightR1CS to QAPchevron-rightUnivariate Polynomial Multiplication Using FFTchevron-right

PreviousCryptography and ZKP research notechevron-leftNextOverview of Computation in Zero-Knowledge Proofschevron-right

Last updated 11 months ago