binius_hal/
sumcheck_evaluator.rs

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
// Copyright 2024 Irreducible Inc.

use binius_field::{Field, PackedField};
use binius_math::CompositionPoly;
use std::ops::Range;

/// Evaluations of a polynomial at a set of evaluation points.
#[derive(Debug, Clone)]
pub struct RoundEvals<F: Field>(pub Vec<F>);

pub trait SumcheckEvaluator<PBase: PackedField, P: PackedField, Composition: CompositionPoly<P>> {
	/// The range of eval point indices over which composition evaluation and summation should happen.
	/// Returned range must equal the result of `n_round_evals()` in length.
	fn eval_point_indices(&self) -> Range<usize>;

	/// Compute composition evals over a subcube.
	///
	/// `batch_query` should contain multilinears evals over a subcube represented
	/// by `subcube_vars` and `subcube_index`.
	///
	/// Returns a packed sum (which may be spread across scalars).
	fn process_subcube_at_eval_point(
		&self,
		subcube_vars: usize,
		subcube_index: usize,
		batch_query: &[&[PBase]],
	) -> P;

	/// Returns the composition evaluated by this object.
	fn composition(&self) -> &Composition;

	/// In case of zerocheck returns eq_ind that the results should be folded with.
	/// In case of sumcheck returns None.
	fn eq_ind_partial_eval(&self) -> Option<&[P]>;
}