pub fn verify<F: Field, Challenger_: Challenger>(
n_witness_vars: usize,
public_eval: F,
challenge: &[F],
transcript: &mut VerifierTranscript<Challenger_>,
) -> Result<VerifyOutput<F>, Error>Expand description
Verify the public input check (pubcheck) protocol.
The pubcheck protocol argues that the witness multilinear agrees with the public input multilinear on a subdomain. The witness $w$ is $\ell$-variate, and the public multilinear $p$ is $m$-variate, where $m \le \ell$. The interactive reduction argues that for all $v \in B_m$
$$ w(v_0, \ldots, v_{m-1}, 0^{\ell - m}) = p(v_0, \ldots, v_{m-1}) $$
The protocol is an MLE-check on the multilinear $w$, using a zero-padded challenge point. It begins with an $m$-dimensional challenge point $r$ and reduces to an MLE-check that $w(r || 0) = p(r)$.
§Arguments
n_witness_vars- base-2 logarithm of the number of witness wordschallenge- the $m$-dimensional challenge pointtranscript- the verifier’s transcript
§Preconditions
challenge.len()is at mostn_witness_vars