Update comments

Author: LindaGuiga

recursion/src/recursive_generation.rs

@@ -250,7 +250,7 @@ where
         // Check PoW witness.
         challenger.observe(opening_proof.pow_witness);
 
-        // Sample a challenge and decompose it into bits. Add the nonzero bits to the challenges.
+        // Sample a challenge and decompose it into bits. Add all bits to the challenges.
         let rand_f: Val<SC> = challenger.sample();
         let rand_usize = rand_f.as_canonical_biguint().to_u64_digits()[0] as usize;
         // Get the bits. The total number of bits is the number of bits in a base field element.

recursion/src/recursive_pcs.rs

@@ -568,7 +568,7 @@ where
 
         let alpha = challenges[0];
         let betas = &challenges[1..1 + num_betas];
-        // Between the betas and the query indices, we have the PoW challenge, which we ignore here.
+
         let query_indices = &challenges[1 + num_betas..1 + num_betas + num_queries];
 
         // Calculate the maximum height of the FRI proof tree.