Zero Knowledge Proofs, Zero Knowledge, Zksnark, Crytocurrency, Zkp.
other words, we are able to prove that we know a some number of points i on the polynomial p(x) where p(a_i) = b_i without revealing our polynomial p(x). Unlike in a regular cryptographic commitment scheme, (c = Comm(u,m), where u and m must be revealed to the verifier), polynomial commitments