Expand description
This contains the DomainConstantEvaluations which is used to provide precomputations to a ConstraintSystem.
Re-exportsยง
use crate::circuits::domains::EvaluationDomains;๐use alloc::vec;๐use alloc::vec;๐use alloc::vec::Vec;๐use ark_ff::FftField;๐use ark_poly::univariate::DensePolynomial as DP;๐use ark_poly::EvaluationDomain;๐use ark_poly::Evaluations as E;๐use ark_poly::Polynomial;๐use ark_poly::Radix2EvaluationDomain as D;๐use serde::Deserialize;๐use serde::Deserialize;๐use serde::Serialize;๐use serde::Serialize;๐use serde_with::serde_as;๐use super::polynomials::permutation::permutation_vanishing_polynomial;๐use rayon::prelude::*;๐
Structsยง
- Domain
Constant Evaluations - pre-computed polynomials that depend only on the chosen field and domain
Functionsยง
- domain_
points ๐ - The points of
domain(g^0, g^1, โฆ), computed in parallel. Each chunk seeds its first power with a single exponentiation and then walks a running product, so the work isO(n)multiplications spread across the cores with only onepowper chunk of overhead. For domains smaller than the chunk size this is a single sequential chunk, so the parallelism never dominates. - eval_
from_ ๐roots_ over_ d8 - Evaluate the polynomial
ฮ (x - root)(given by its roots) at every point ofd8, wherex_d8holds the d8 domain points. For the low-degree vanishing polynomials this is far cheaper than padding to 8n coefficients and running an FFT, and it parallelises trivially over the points.