From 04dce92a3a37292ac0f212369f9e8b0db3bbe490 Mon Sep 17 00:00:00 2001 From: Daniel Lubarov Date: Mon, 20 Dec 2021 18:52:55 -0800 Subject: [PATCH] Print timing for a regular Poseidon recursive proof (#403) * Print timing for a regular Poseidon recursive proof Rather than the Keccak-256 proof. I kept it but hid the timing since it's less important to us. Alternatively we could test Keccak-256 only in the size-optimized test, since that's basically testing a bridge proof. Let me know if you have a preference. * Remove Keccak proof per PR discussion --- src/plonk/recursive_verifier.rs | 9 ++++++--- 1 file changed, 6 insertions(+), 3 deletions(-) diff --git a/src/plonk/recursive_verifier.rs b/src/plonk/recursive_verifier.rs index 461f2089..4c57b9e9 100644 --- a/src/plonk/recursive_verifier.rs +++ b/src/plonk/recursive_verifier.rs @@ -386,19 +386,22 @@ mod tests { init_logger(); const D: usize = 2; type C = PoseidonGoldilocksConfig; - type KC = KeccakGoldilocksConfig; type F = >::F; let config = CircuitConfig::standard_recursion_config(); - // Start with a degree 2^14 proof, then shrink it to 2^13, then to 2^12. + // Start with a degree 2^14 proof let (proof, vd, cd) = dummy_proof::(&config, 16_000)?; assert_eq!(cd.degree_bits, 14); + + // Shrink it to 2^13. let (proof, vd, cd) = recursive_proof::(proof, vd, cd, &config, &config, Some(13), false, false)?; assert_eq!(cd.degree_bits, 13); + + // Shrink it to 2^12. let (proof, _vd, cd) = - recursive_proof::(proof, vd, cd, &config, &config, None, true, true)?; + recursive_proof::(proof, vd, cd, &config, &config, None, true, true)?; assert_eq!(cd.degree_bits, 12); test_serialization(&proof, &cd)?;