binius_core/protocols/greedy_evalcheck/
mod.rs

1// Copyright 2024-2025 Irreducible Inc.
2
3//! An interactive protocol for proving/verifying evaluation claims on virtual polynomials.
4//!
5//! A virtual polynomial evaluation claim can either be proven directly with a single opening proof
6//! per batched polynomial commitment, or with a sumcheck reduction to further evaluation claims.
7//! The definitions of the virtual polynomials determine how many rounds of sumcheck reductions are
8//! required before the polynomial commitment openings. The number of rounds is guaranteed to be
9//! finite because the graph of virtual polynomial definitions is acyclic.
10//!
11//! The greedy evalcheck protocol runs the full sequence of alternating evalcheck and sumcheck
12//! protocols to reduce several evaluation claims to a single PCS opening per batch.
13
14mod error;
15mod prove;
16mod verify;
17
18pub use error::*;
19pub use prove::*;
20pub use verify::*;