jf_relation/gadgets/
mod.rs

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
// Copyright (c) 2022 Espresso Systems (espressosys.com)
// This file is part of the Jellyfish library.

// You should have received a copy of the MIT License
// along with the Jellyfish library. If not, see <https://mit-license.org/>.

//! Gates and gadgets implementations

pub mod ecc;
pub mod ultraplonk;

mod arithmetic;
mod cmp;
mod emulated;
mod logic;
mod range;
#[allow(unused_imports)]
pub use arithmetic::*;
#[allow(unused_imports)]
pub use cmp::*;
#[allow(unused_imports)]
pub use emulated::*;
#[allow(unused_imports)]
pub use logic::*;
#[allow(unused_imports)]
pub use range::*;

// Helper functions
mod utils;

/// Utils for test
pub mod test_utils {
    use crate::{Arithmetization, Circuit, CircuitError, PlonkCircuit};
    use ark_ff::PrimeField;

    /// two circuit with the same statement should have the same extended
    /// permutation polynomials even with different variable assignment
    pub fn test_variable_independence_for_circuit<F: PrimeField>(
        circuit_1: PlonkCircuit<F>,
        circuit_2: PlonkCircuit<F>,
    ) -> Result<(), CircuitError> {
        assert_eq!(circuit_1.num_gates(), circuit_2.num_gates());
        assert_eq!(circuit_1.num_vars(), circuit_2.num_vars());
        // Check extended permutation polynomials
        let sigma_polys_1 = circuit_1.compute_extended_permutation_polynomials()?;
        let sigma_polys_2 = circuit_2.compute_extended_permutation_polynomials()?;
        sigma_polys_1
            .iter()
            .zip(sigma_polys_2.iter())
            .for_each(|(p1, p2)| assert_eq!(p1, p2));
        Ok(())
    }
}