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

  • Monic Polynomial
Question? Give us feedback →Edit this page
BasicsPublic Coin

Monic Polynomial

  • An interactive protocol between a prover and a verifier is public-coin if all the messages sent by the verifier to the prover are randomly and independently sampled from the messages sent by the prover (that is, random coins from the verifier are publicly available).
PairingsPedersen Commitment

MIT 2025 © Nextra.