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
  2. Chapter Three: Ploynomial Commitment Schemes
  3. KZG Polynomial Commitment Scheme

Batch Univariate KZG Polynomial Commitment Scheme

This very similar to the standard univariate polynomial commitment scheme but this time optimized for batch commitment and batch verification.

PreviousMultilinear KZG Polynomial commitment schemeNextFRI Polynomial commitment scheme

Last updated 16 days ago

Rust Implmention:

https://github.com/developeruche/cryptography-n-zk-research/blob/main/polynomial-commitment-schemes/kzg-rust/src/univariate/batch.rs