pathfinder-crypto 0.22.5

Cryptographic primitives used by Pathfinder
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86

use crate::CurveOrderMontFelt;

impl CurveOrderMontFelt {
    /// Return whether the value is zero
    #[inline(always)]
    pub const fn is_zero(&self) -> bool {
        self.0[0] == 0 && self.0[1] == 0 && self.0[2] == 0 && self.0[3] == 0
    }

    /// Return whether the value is one
    #[inline(always)]
    pub const fn is_one(&self) -> bool {
        self.0[0] == CurveOrderMontFelt::R[0]
            && self.0[1] == CurveOrderMontFelt::R[1]
            && self.0[2] == CurveOrderMontFelt::R[2]
            && self.0[3] == CurveOrderMontFelt::R[3]
    }

    #[inline(always)]
    #[allow(clippy::comparison_chain)]
    pub fn mont_cmp(&self, x: &CurveOrderMontFelt) -> isize {
        let a = self.reduce_full();
        let b = x.reduce_full();

        let mut i = 4;
        while i > 0 {
            i -= 1;
            if a.0[i] > b.0[i] {
                return 1;
            } else if a.0[i] < b.0[i] {
                return -1;
            }
        }
        0
    }

    #[inline(always)]
    pub const fn cmp(&self, x: &CurveOrderMontFelt) -> isize {
        let mut i = 4;
        while i > 0 {
            i -= 1;
            if self.0[i] > x.0[i] {
                return 1;
            } else if self.0[i] < x.0[i] {
                return -1;
            }
        }
        0
    }

    #[inline(always)]
    pub const fn eq(&self, x: &CurveOrderMontFelt) -> bool {
        self.cmp(x) == 0
    }

    #[inline(always)]
    pub const fn gt(&self, x: &CurveOrderMontFelt) -> bool {
        self.cmp(x) > 0
    }

    #[inline(always)]
    pub const fn geq(&self, x: &CurveOrderMontFelt) -> bool {
        self.cmp(x) >= 0
    }

    #[inline(always)]
    pub const fn lt(&self, x: &CurveOrderMontFelt) -> bool {
        self.cmp(x) < 0
    }

    #[inline(always)]
    pub const fn leq(&self, x: &CurveOrderMontFelt) -> bool {
        self.cmp(x) <= 0
    }
}

impl std::cmp::PartialOrd for CurveOrderMontFelt {
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        match self.mont_cmp(other) {
            1 => Some(std::cmp::Ordering::Greater),
            -1 => Some(std::cmp::Ordering::Less),
            0 => Some(std::cmp::Ordering::Equal),
            _ => None,
        }
    }
}