Crypto Summaries
Search
Search
Search
Dark mode
Light mode
Explorer
Books
Proofs, Arguments, and Zero-Knowledge
Concepts
Commitment Schemes
Inner-pairing-product commitment
Pedersen Commitment
Facts & Lemmas
Schwartz-Zippel Lemma
Folding Schemes
Nova
Fundamental Concepts
Error-correcting code
Low Degree and Multilinear Extensions
Polynomial Commitment Schemes
Bulletproofs
Commitment to a Linear function
Dory
FRI
Generalized Pedersen Commitment
Hyrax
KZG
Ligero and Brakedown Polynomial Commitments
Linear-size Pedersen Polynomial Commitment
Spark
Tensor Product Structure in Polynomial Evaluation Queries
Protocols
linear PCPs
GGPR
Lookup Arguments
Halo2 Lookup Argument
Lasso
LogUp & cq
multivariate
GKR
Multivariate Sum-Check Protocol
Multivariate Zero Check Protocol
Reducing Multiple Evaluations to One
Spartan
Super-Efficient IP for Matrix Multiplication
univariate
Univariate Sum-Check Protocol
Univariate Zero-Check Protocol
Offline Memory Checking
Permutation Check via Product Check
Schnorr's Σ-Protocol for knowledge of discrete logarithm
Papers
Brakedown - Linear-time and field-agnostic SNARKs for R1CS
Ceno - Non-uniform, Segment and Parallel Zero-knowledge Virtual Machine
cq - Cached quotients for fast lookups
Improving logarithmic derivative lookups using GKR
Multivariate lookups based on logarithmic derivatives
Unlocking the lookup singularity with Lasso
Readme
Home
❯
Concepts
❯
Polynomial Commitment Schemes
Folder: Concepts/Polynomial-Commitment-Schemes
11 items under this folder.
Sep 03, 2024
Bulletproofs
Sep 03, 2024
Commitment to a Linear function
Sep 03, 2024
Dory
Sep 03, 2024
FRI
Sep 03, 2024
Generalized Pedersen Commitment
Sep 03, 2024
Hyrax
Sep 03, 2024
KZG
Sep 03, 2024
Ligero and Brakedown Polynomial Commitments
Sep 03, 2024
Linear-size Pedersen Polynomial Commitment
Sep 03, 2024
Spark
Sep 03, 2024
Tensor Product Structure in Polynomial Evaluation Queries