p3-sumcheck 0.8.0

Sumcheck protocol engine (product polynomials, SVO, HVZK masks)
Documentation 
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

//! Shared fixtures for `ring_switch` tests.

use alloc::vec::Vec;

use p3_binary_field::{BinaryChallenger, BinaryField8, BinaryField128, TowerLevel};
use p3_challenger::HashChallenger;
use p3_keccak::Keccak256Hash;
use p3_multilinear_util::poly::Poly;

pub(crate) type F = BinaryField8;
pub(crate) type EF = BinaryField128;

/// The Fiat-Shamir transcript both sides of the reduction are driven with.
pub(crate) type Challenger = BinaryChallenger<F, HashChallenger<u8, Keccak256Hash, 32>>;

/// A fresh transcript, built identically for the prover and the verifier.
pub(crate) const fn challenger() -> Challenger {
    Challenger::from_hasher(Vec::new(), Keccak256Hash)
}

/// A base-field polynomial with deterministic, seed-dependent evaluations.
pub(crate) fn base_poly(log_n: usize, seed: u64) -> Poly<F> {
    Poly::new(
        (0..1usize << log_n)
            .map(|i| {
                F::from_repr(
                    seed.wrapping_mul(0x9e37_79b9_7f4a_7c15)
                        .wrapping_add(i as u64) as u8,
                )
            })
            .collect(),
    )
}