Zero Knowledge Proofs, Blockchain, Cryptography, Interactive Proof, Sum Check Protocol.
related, but simpler polynomial (typically, by fixing one variable). This process is repeated for each variable of P. P (prover ) sends claimed answer C₁. The protocol must check the ( where F ∈{0,1} ): Round 1: P sends a univariate polynomial S₁ ( X₁) claimed to equal: The verifier needs to check