provekit-whir 0.1.1

An implementation of the WHIR polynomial commitment scheme
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66

use std::str::FromStr;

use serde::Serialize;

use crate::{engines::EngineId, hash};

#[derive(Debug, Clone, Copy, Serialize)]
pub enum AvailableFields {
    Goldilocks1, // Just Goldilocks
    Goldilocks2, // Quadratic extension of Goldilocks
    Goldilocks3, // Cubic extension of Goldilocks
    Field128,    // 128-bit prime field
    Field192,    // 192-bit prime field
    Field256,    // 256-bit prime field
}

impl FromStr for AvailableFields {
    type Err = String;

    fn from_str(s: &str) -> Result<Self, Self::Err> {
        match s {
            "Field128" => Ok(Self::Field128),
            "Field192" => Ok(Self::Field192),
            "Field256" => Ok(Self::Field256),
            "Goldilocks1" => Ok(Self::Goldilocks1),
            "Goldilocks2" => Ok(Self::Goldilocks2),
            "Goldilocks3" => Ok(Self::Goldilocks3),
            _ => Err(format!("Invalid field: {s}")),
        }
    }
}

#[derive(Debug, Clone, Copy, Serialize)]
pub enum AvailableHash {
    Sha2,
    Sha3,
    Keccak,
    Blake3,
}

impl AvailableHash {
    pub const fn hash_id(&self) -> EngineId {
        match self {
            Self::Sha2 => hash::SHA2,
            Self::Sha3 => hash::SHA3,
            Self::Keccak => hash::KECCAK,
            Self::Blake3 => hash::BLAKE3,
        }
    }
}

impl FromStr for AvailableHash {
    type Err = String;

    fn from_str(s: &str) -> Result<Self, Self::Err> {
        match s {
            "Sha2" => Ok(Self::Sha2),
            "Sha3" => Ok(Self::Sha3),
            "Keccak" => Ok(Self::Keccak),
            "Blake3" => Ok(Self::Blake3),
            _ => Err(format!(
                "Invalid hash: {s}, options are: Sha2, Sha3, Keccak, Blake3"
            )),
        }
    }
}