This is a [research grade] sumcheck protocol implementation. Sumcheck is one of the fundamental tools undernearth a lot of modern Zero Knowledge protocols. (Like zkSNARKs (introduced here) or other arguments) See also Unreasonable usefulness of the sumcheck protocols. The sumcheck protocol allows a party (known as the Prover) to efficiently prove to the Verifier that the Prover can co mpute a multivariate polynomial with a large number u of variables (thus O(2^u) computation). Meanwhile, besides imposing a large computation, it allows the Prover to create a small commitment.
Use cargo.
cargo buildSimilarly, to test
cargo testAll rights reserved. Communicate for information.