Zero Knowledge Proof- Notes
GitHubGitHub
  • Intro
    • Group
    • Polynomial
    • Collision Resistance
    • Pairings
    • Public Coin
  • Pedersen Commitment
  • Kate Commitment Scheme (KZG)
    • Intro
    • Multilinear extension
    • Sum-Check protocol
    • GKR Protocol
    • Intro
    • Jagged Function
    • Jagged Basic
    • Jagged Assist
    • Fancy Jagged
    • Read-Once Branching Programs
    • Matrix Branching Program
    • Table to Polynomial
    • With4 Robp
    • Intro
    • Reed-Solomon Coeds
    • Fast Fourier Transform
    • Arithmetization
    • FRI Commitment
    • List
    • zeitgeist-write-up
    • dont-look-up-write-up
    • shadow-write-up
    • Fundamental Theorem of Cyclic Groups
    • roots-of-unity-v1
    • squaring-the-generator-v1
    • polynomial-representations-v1
    • multiplication-of-two-polynomials-v1
    • fft-v1
    • proving that a polynomial is zero everywhere on a subdomain
  • Papers

On This Page

  • Codes
  • Linear Codes
  • Reed–Solomon Codes
  • Vandermonde matrix
  • Polynomial Commitment with Reed-Solomon Codes
  • Merkle tree
  • Issues of RS-codes poly-commit
  • The FRI
  • RS proximity problem
  • RS proximity testing
Question? Give us feedback →Edit this page

Codes

Linear Codes

Reed–Solomon Codes

Vandermonde matrix

Polynomial Commitment with Reed-Solomon Codes

Merkle tree

Issues of RS-codes poly-commit

The FRI

RS proximity problem

RS proximity testing

With4 RobpReed-Solomon Coeds

MIT 2025 © Nextra.