Zero Knowledge Proofs, Blockchain, Cryptography, Interactive Proof, Sum Check Protocol.
polynomials and is a key component in constructing various interactive proofs, including those for NP-complete problems. Input: V given Oracle access to an l-variate polynomial g over field F. Goal: The goal is to verify a claim about the sum of values of a multivariate polynomial i.e. compute the