Change alloc_num_equals arguments to references (#45)

src/circuit.rs

@@ -213,8 +213,8 @@ where
     let hash = le_bits_to_num(cs.namespace(|| "bits to hash"), hash_bits)?;
     let check_pass = alloc_num_equals(
       cs.namespace(|| "check consistency of u.X[0] with H(params, U, i, z0, zi)"),
-      u.X0.clone(),
-      hash,
+      &u.X0,
+      &hash,
     )?;
 
     // Run NIFS Verifier
@@ -246,7 +246,7 @@ where
 
     // Compute variable indicating if this is the base case
     let zero = alloc_zero(cs.namespace(|| "zero"))?;
-    let is_base_case = alloc_num_equals(cs.namespace(|| "Check if base case"), i.clone(), zero)?; //TODO: maybe optimize this?
+    let is_base_case = alloc_num_equals(cs.namespace(|| "Check if base case"), &i.clone(), &zero)?; //TODO: maybe optimize this?
 
     // Synthesize the circuit for the base case and get the new running instance
     let Unew_base = self.synthesize_base_case(cs.namespace(|| "base case"))?;

src/gadgets/utils.rs

@@ -130,8 +130,8 @@ pub fn alloc_bignat_constant<F: PrimeField, CS: ConstraintSystem<F>>(
 /// Check that two numbers are equal and return a bit
 pub fn alloc_num_equals<F: PrimeField, CS: ConstraintSystem<F>>(
   mut cs: CS,
-  a: AllocatedNum<F>,
-  b: AllocatedNum<F>,
+  a: &AllocatedNum<F>,
+  b: &AllocatedNum<F>,
 ) -> Result<AllocatedBit, SynthesisError> {
   // Allocate and constrain `r`: result boolean bit.
   // It equals `true` if `a` equals `b`, `false` otherwise