From f77d7518d1659c4ee69f2e3899fe4874196d8317 Mon Sep 17 00:00:00 2001 From: Xearty Date: Mon, 2 Oct 2023 19:21:45 +0300 Subject: [PATCH] test: Add and mod RLC tests --- plonky2x/src/frontend/eth/mpt/rlc.rs | 90 +++++++++++++++++++++++++--- 1 file changed, 83 insertions(+), 7 deletions(-) diff --git a/plonky2x/src/frontend/eth/mpt/rlc.rs b/plonky2x/src/frontend/eth/mpt/rlc.rs index 7d4804e09..8589bc8d2 100644 --- a/plonky2x/src/frontend/eth/mpt/rlc.rs +++ b/plonky2x/src/frontend/eth/mpt/rlc.rs @@ -83,7 +83,7 @@ pub(crate) mod tests { use plonky2::plonk::config::{GenericConfig, PoseidonGoldilocksConfig}; use crate::frontend::builder::DefaultBuilder; - use crate::prelude::{ByteVariable, CircuitVariable, Variable}; + use crate::prelude::{ByteVariable, Variable}; impl Default for ByteVariable { fn default() -> ByteVariable { @@ -103,11 +103,87 @@ pub(crate) mod tests { let mut b: [ByteVariable; MAX_LEN] = Default::default(); for i in 0..MAX_LEN { - a[i] = ByteVariable::constant(&mut builder, (i + 5) as u8); + a[i] = builder.constant::((i + 5) as u8); } for i in 0..MAX_LEN { - b[i] = ByteVariable::constant(&mut builder, i as u8); + b[i] = builder.constant::(i as u8); + } + + let a_offset: Variable = builder.constant(F::ZERO); + let b_offset = builder.constant(F::from_canonical_usize(5)); + let len: Variable = builder.constant(F::from_canonical_usize(5)); + builder.assert_subarray_equal(&a, a_offset, &b, b_offset, len); + + // Build your circuit. + let circuit = builder.build(); + + // Write to the circuit input. + let input = circuit.input(); + + // Generate a proof. + let (proof, output) = circuit.prove(&input); + + // Verify proof. + circuit.verify(&proof, &input, &output) + } + + #[test] + pub fn test_subarray_equal_diff_len_should_succeed() { + const D: usize = 2; + type C = PoseidonGoldilocksConfig; + type F = >::F; + let mut builder = DefaultBuilder::new(); + + const LEN_A: usize = 15; + const LEN_B: usize = 10; + let mut a: [ByteVariable; LEN_A] = Default::default(); + let mut b: [ByteVariable; LEN_B] = Default::default(); + + for i in 0..LEN_A { + a[i] = builder.constant::((i + 5) as u8); + } + + for i in 0..LEN_B { + b[i] = builder.constant::(i as u8); + } + + let a_offset: Variable = builder.constant(F::ZERO); + let b_offset = builder.constant(F::from_canonical_usize(5)); + let len: Variable = builder.constant(F::from_canonical_usize(5)); + builder.assert_subarray_equal(&a, a_offset, &b, b_offset, len); + + // Build your circuit. + let circuit = builder.build(); + + // Write to the circuit input. + let input = circuit.input(); + + // Generate a proof. + let (proof, output) = circuit.prove(&input); + + // Verify proof. + circuit.verify(&proof, &input, &output) + } + + #[test] + pub fn test_subarray_equal_diff_len_inverse_should_succeed() { + const D: usize = 2; + type C = PoseidonGoldilocksConfig; + type F = >::F; + let mut builder = DefaultBuilder::new(); + + const LEN_A: usize = 10; + const LEN_B: usize = 15; + let mut a: [ByteVariable; LEN_A] = Default::default(); + let mut b: [ByteVariable; LEN_B] = Default::default(); + + for i in 0..LEN_A { + a[i] = builder.constant::((i + 5) as u8); + } + + for i in 0..LEN_B { + b[i] = builder.constant::(i as u8); } let a_offset: Variable = builder.constant(F::ZERO); @@ -141,15 +217,15 @@ pub(crate) mod tests { let mut b: [ByteVariable; MAX_LEN] = Default::default(); for i in 0..MAX_LEN { - a[i] = ByteVariable::constant(&mut builder, (i + 5) as u8); + a[i] = builder.constant::((i + 5) as u8); } for i in 0..MAX_LEN { - b[i] = ByteVariable::constant(&mut builder, i as u8); + b[i] = builder.constant::(i as u8); } - + // Modify 1 byte here. - b[6] = ByteVariable::constant(&mut builder, 0); + b[6] = builder.constant::(0); let a_offset = builder.constant(F::ZERO); let b_offset = builder.constant(F::from_canonical_usize(5));