ConceptPCS / Polynomial Commitment Scheme
Polynomial Commitment Scheme
A cryptographic commitment scheme that allows generating a short commitment to a polynomial and proving evaluations at arbitrary points without the verifier knowing the polynomial's coefficients; common instances include KZG and Bulletproofs.
Timeline (last 90 days)
Oct 20
IronDict uses polynomial commitments to build a transparent dictionary; the values of a multilinear polynomial on the Boolean hypercube uniquely determine that polynomial, and after committing with a PCS one can open a Boolean point to prove the value at a certain position.
Unverified50%