Avoid cloning transition

clean up access of last element

synthesizer/src/process/prepare.rs

@@ -131,7 +131,7 @@ impl<N: Network> Process<N> {
         lap!(timer, "Execute the circuit");
 
         // Extract the execution.
-        let execution = Arc::try_unwrap(execution).unwrap().into_inner();
+        let mut execution = Arc::try_unwrap(execution).unwrap().into_inner();
         // Ensure the execution contains 1 transition.
         ensure!(execution.len() == 1, "Execution of '{}/{}' does not contain 1 transition", program_id, function_name);
         // Extract the inclusion.
@@ -140,9 +140,11 @@ impl<N: Network> Process<N> {
         let metrics = Arc::try_unwrap(metrics).unwrap().into_inner();
         // Extract the assignments
         let assignments = Arc::try_unwrap(assignments).unwrap_or_default().into_inner();
+        // Extract the transition
+        let transition = execution.pop()?;
 
         finish!(timer);
 
-        Ok((response, execution.peek()?.clone(), inclusion, assignments, metrics))
+        Ok((response, transition, inclusion, assignments, metrics))
     }
 }

synthesizer/src/process/stack/execution/mod.rs

@@ -95,7 +95,7 @@ impl<N: Network> Execution<N> {
         ensure!(!assignments.is_empty(), "Number of assignments must be greater than zero!");
 
         let inclusion_name = Identifier::<N>::from_str(N::INCLUSION_FUNCTION_NAME)?;
-        let proves_inclusion = *function_names[function_names.len() - 1] == inclusion_name;
+        let proves_inclusion = **function_names.last().unwrap() == inclusion_name;
         let proof = batch.prove(function_names, assignments, proves_inclusion, rng)?;
 
         self.proof = Some(proof);

synthesizer/src/process/stack/fee/mod.rs

@@ -102,7 +102,7 @@ impl<N: Network> Fee<N> {
         if assignments.len() == 2 && *function_names[1] != inclusion_name {
             bail!("Expected 2nd assignment to belong to inclusion")
         }
-        let proves_inclusion = *function_names[function_names.len() - 1] == inclusion_name;
+        let proves_inclusion = **function_names.last().unwrap() == inclusion_name;
         let proof = batch.prove(function_names.as_slice(), assignments, proves_inclusion, rng)?;
 
         self.proof = Some(proof);