zkstd 0.0.22

zero knowledge proof standard library
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
34
35
36
37
38
39
40
41
42
43
44
45

// This trait resresents zkSNARKs trait

use super::field::PrimeField;
use super::{algebra::Field, comp::ParallelCmp};

// TODO: need to rethink fft and prime field method
/// This is fft field
/// This is used for fft and has roots of unity
pub trait FftField: PrimeField + ParallelCmp + From<[u64; 4]> {
    // factor power of two
    const S: usize;
    // 2^s th root of unity
    const ROOT_OF_UNITY: Self;
    // multiplicative generator
    const MULTIPLICATIVE_GENERATOR: Self;

    fn is_even(&self) -> bool;

    fn pow(self, val: u64) -> Self;

    fn pow_of_2(by: u64) -> Self;

    fn divn(&mut self, n: u32);

    fn mod_2_pow_k(&self, k: u8) -> u8;

    fn mods_2_pow_k(&self, w: u8) -> i8;

    fn from_bytes_wide(bytes: &[u8; 64]) -> Self;

    fn reduce(&self) -> Self;

    fn from_hash(hash: &[u8; 64]) -> Self;

    fn to_raw_bytes(&self) -> [u8; 32];
}

/// This is polynomial
/// This has fft functionality and represents polynomial ring
pub trait Polynomial: Field + ParallelCmp {
    // domain of polynomial
    type Domain: FftField;

    fn evaluate(self, at: Self::Domain) -> Self::Domain;
}