-
Notifications
You must be signed in to change notification settings - Fork 149
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Change unit tests as integration tests when possible (#599)
Change unit tests to be integration tests - Change test_full() to be an integration test - Change CI to run all binaries generated by `cargo test --no-run` Resolves: #500
- Loading branch information
Showing
3 changed files
with
163 additions
and
183 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,156 @@ | ||
| // This Source Code Form is subject to the terms of the Mozilla Public | ||
| // License, v. 2.0. If a copy of the MPL was not distributed with this | ||
| // file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||
| // | ||
| // Copyright (c) DUSK NETWORK. All rights reserved. | ||
|
|
||
| use dusk_plonk::prelude::*; | ||
| use rand_core::OsRng; | ||
| use std::fs; | ||
|
|
||
| type Result<T> = std::result::Result<T, Box<dyn std::error::Error>>; | ||
|
|
||
| // Implements a circuit that checks: | ||
| // 1) a + b = c where C is a PI | ||
| // 2) a <= 2^6 | ||
| // 3) b <= 2^5 | ||
| // 4) a * b = d where D is a PI | ||
| // 5) JubJub::GENERATOR * e(JubJubScalar) = f where F is a PI | ||
| #[derive(Debug, Default)] | ||
| pub struct TestCircuit { | ||
| a: BlsScalar, | ||
| b: BlsScalar, | ||
| c: BlsScalar, | ||
| d: BlsScalar, | ||
| e: JubJubScalar, | ||
| f: JubJubAffine, | ||
| } | ||
|
|
||
| impl Circuit for TestCircuit { | ||
| const CIRCUIT_ID: [u8; 32] = [0xff; 32]; | ||
| fn gadget( | ||
| &mut self, | ||
| composer: &mut TurboComposer, | ||
| ) -> std::result::Result<(), Error> { | ||
| let a = composer.append_witness(self.a); | ||
| let b = composer.append_witness(self.b); | ||
|
|
||
| // Make first constraint a + b = c | ||
| let constraint = Constraint::new().left(1).right(1).public(-self.c); | ||
| composer.append_gate( | ||
| a, | ||
| b, | ||
| composer.constant_zero(), | ||
| composer.constant_zero(), | ||
| constraint, | ||
| ); | ||
|
|
||
| // Check that a and b are in range | ||
| composer.component_range(a, 1 << 6); | ||
| composer.component_range(b, 1 << 5); | ||
|
|
||
| // Make second constraint a * b = d | ||
| let constraint = Constraint::new().mul(1).output(1).public(-self.d); | ||
| composer.append_gate( | ||
| a, | ||
| b, | ||
| composer.constant_zero(), | ||
| composer.constant_zero(), | ||
| constraint, | ||
| ); | ||
|
|
||
| let e = composer.append_witness(self.e); | ||
| let scalar_mul_result = composer | ||
| .component_mul_generator(e, dusk_jubjub::GENERATOR_EXTENDED); | ||
|
|
||
| // Apply the constrain | ||
| composer.assert_equal_public_point(scalar_mul_result, self.f); | ||
|
|
||
| Ok(()) | ||
| } | ||
|
|
||
| fn public_inputs(&self) -> Vec<PublicInputValue> { | ||
| vec![self.c.into(), self.d.into(), self.f.into()] | ||
| } | ||
|
|
||
| fn padded_gates(&self) -> usize { | ||
| 1 << 11 | ||
| } | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_full() -> Result<()> { | ||
| use tempdir::TempDir; | ||
|
|
||
| let tmp = TempDir::new("plonk-keys-test-full")?.into_path(); | ||
| let pp_path = tmp.join("pp_testcirc"); | ||
| let pk_path = tmp.join("pk_testcirc"); | ||
| let vd_path = tmp.join("vd_testcirc"); | ||
|
|
||
| // Generate CRS | ||
| let pp_p = PublicParameters::setup(1 << 12, &mut OsRng)?; | ||
| fs::write(&pp_path, &pp_p.to_raw_var_bytes())?; | ||
|
|
||
| // Read PublicParameters | ||
| let pp = fs::read(pp_path)?; | ||
| let pp = unsafe { PublicParameters::from_slice_unchecked(&pp) }; | ||
|
|
||
| // Initialize the circuit | ||
| let mut circuit = TestCircuit::default(); | ||
|
|
||
| // Compile the circuit | ||
| let (pk_p, vd_p) = circuit.compile(&pp)?; | ||
|
|
||
| // Write the keys | ||
| fs::write(&pk_path, &pk_p.to_var_bytes())?; | ||
|
|
||
| // Read ProverKey | ||
| let pk = fs::read(pk_path)?; | ||
| let pk = ProverKey::from_slice(&pk)?; | ||
|
|
||
| assert_eq!(pk, pk_p); | ||
|
|
||
| // Store the VerifierData just for the verifier side: | ||
| // (You could also store public_inputs_indexes and VerifierKey | ||
| // sepparatedly). | ||
| fs::write(&vd_path, &vd_p.to_var_bytes())?; | ||
| let vd = fs::read(vd_path)?; | ||
| let vd = VerifierData::from_slice(&vd)?; | ||
|
|
||
| assert_eq!(vd_p.key(), vd.key()); | ||
| assert_eq!(vd_p.public_inputs_indexes(), vd.public_inputs_indexes()); | ||
|
|
||
| // Prover POV | ||
| let proof = { | ||
| let mut circuit = TestCircuit { | ||
| a: BlsScalar::from(20u64), | ||
| b: BlsScalar::from(5u64), | ||
| c: BlsScalar::from(25u64), | ||
| d: BlsScalar::from(100u64), | ||
| e: JubJubScalar::from(2u64), | ||
| f: JubJubAffine::from( | ||
| dusk_jubjub::GENERATOR_EXTENDED * JubJubScalar::from(2u64), | ||
| ), | ||
| }; | ||
|
|
||
| circuit.prove(&pp, &pk, b"Test") | ||
| }?; | ||
|
|
||
| // Verifier POV | ||
| let public_inputs: Vec<PublicInputValue> = vec![ | ||
| BlsScalar::from(25u64).into(), | ||
| BlsScalar::from(100u64).into(), | ||
| JubJubAffine::from( | ||
| dusk_jubjub::GENERATOR_EXTENDED * JubJubScalar::from(2u64), | ||
| ) | ||
| .into(), | ||
| ]; | ||
|
|
||
| Ok(TestCircuit::verify( | ||
| &pp, | ||
| &vd, | ||
| &proof, | ||
| &public_inputs, | ||
| b"Test", | ||
| )?) | ||
| } |