Skip to main content

frobenius_twist

Function frobenius_twist 

Source
pub fn frobenius_twist<F>(
    k: usize,
    eval_point: &[F],
    evals: &[F],
) -> Phase2Output<F>
where F: FieldOps, F::Scalar: BinaryField,
Expand description

Apply inverse Frobenius twists to the leaf evaluation claims from Phase 1.

This reduces $2^k$ evaluation claims on $2^k$ separate multilinears $\widetilde{Q_i}$ at a shared point $r$ to $2^k$ claims on a single multilinear $\widetilde{P}$ at $2^k$ different points. Concretely, given claims $(r, s_i)$ where $s_i = \widetilde{Q_i}(r)$ and $\widetilde{Q_i}(x) = \widetilde{P}(x)^{2^i}$, this applies $\varphi^{-i}$ (the inverse Frobenius endomorphism) to both the evaluation point and the evaluation value. This linearizes the degree-$2^i$ relation into a degree-1 claim: $\varphi^{-i}(s_i) = \widetilde{P}(\varphi^{-i}(r))$, since $\varphi^{-i}(x^{2^i}) = x$ in $\mathbb{F}_{2^d}$.

ยงArguments

  • k - The log of the bit-width; there are $2^k$ leaf claims.
  • eval_point - The shared evaluation point $r$.
  • evals - The $2^k$ evaluations $s_0, \ldots, s_{2^k - 1}$.