mirror of
https://github.com/logos-storage/plonky2.git
synced 2026-01-12 02:33:06 +00:00
* Draw challenge points from the extension field * Now building * Misc * Default eval_unfiltered_base * fmt * A few field settings * Add to Sage * Display tweak * eval_filtered_base * Quartic in bench * Missing methods * Fix tests * PR feedback
70 lines
2.3 KiB
Rust
70 lines
2.3 KiB
Rust
use crate::field::extension_field::Extendable;
|
|
use crate::field::field::Field;
|
|
use crate::gates::gate::{Gate, GateRef};
|
|
use crate::polynomial::polynomial::{PolynomialCoeffs, PolynomialValues};
|
|
use crate::util::{log2_ceil, transpose};
|
|
use crate::vars::EvaluationVars;
|
|
|
|
const WITNESS_SIZE: usize = 1 << 5;
|
|
const WITNESS_DEGREE: usize = WITNESS_SIZE - 1;
|
|
|
|
/// Tests that the constraints imposed by the given gate are low-degree by applying them to random
|
|
/// low-degree witness polynomials.
|
|
pub(crate) fn test_low_degree<F: Extendable<D>, const D: usize>(gate: GateRef<F, D>) {
|
|
let gate = gate.0;
|
|
let rate_bits = log2_ceil(gate.degree() + 1);
|
|
|
|
let wire_ldes = random_low_degree_matrix::<F::Extension>(gate.num_wires(), rate_bits);
|
|
let constant_ldes = random_low_degree_matrix::<F::Extension>(gate.num_constants(), rate_bits);
|
|
assert_eq!(wire_ldes.len(), constant_ldes.len());
|
|
|
|
let constraint_evals = wire_ldes
|
|
.iter()
|
|
.zip(constant_ldes.iter())
|
|
.map(|(local_wires, local_constants)| EvaluationVars {
|
|
local_constants,
|
|
local_wires,
|
|
})
|
|
.map(|vars| gate.eval_unfiltered(vars))
|
|
.collect::<Vec<_>>();
|
|
|
|
let constraint_eval_degrees = transpose(&constraint_evals)
|
|
.into_iter()
|
|
.map(PolynomialValues::new)
|
|
.map(|p| p.degree())
|
|
.collect::<Vec<_>>();
|
|
|
|
let expected_eval_degree = WITNESS_DEGREE * gate.degree();
|
|
|
|
assert!(
|
|
constraint_eval_degrees
|
|
.iter()
|
|
.all(|°| deg <= expected_eval_degree),
|
|
"Expected degrees at most {} * {} = {}, actual {:?}",
|
|
WITNESS_SIZE,
|
|
gate.degree(),
|
|
expected_eval_degree,
|
|
constraint_eval_degrees
|
|
);
|
|
}
|
|
|
|
fn random_low_degree_matrix<F: Field>(num_polys: usize, rate_bits: usize) -> Vec<Vec<F>> {
|
|
let polys = (0..num_polys)
|
|
.map(|_| random_low_degree_values(rate_bits))
|
|
.collect::<Vec<_>>();
|
|
|
|
if polys.is_empty() {
|
|
// We want a Vec of many empty Vecs, whereas transpose would just give an empty Vec.
|
|
vec![Vec::new(); WITNESS_SIZE << rate_bits]
|
|
} else {
|
|
transpose(&polys)
|
|
}
|
|
}
|
|
|
|
fn random_low_degree_values<F: Field>(rate_bits: usize) -> Vec<F> {
|
|
PolynomialCoeffs::new(F::rand_vec(WITNESS_SIZE))
|
|
.lde(rate_bits)
|
|
.fft()
|
|
.values
|
|
}
|