nits

Author: PatStiles

batcher/aligned-batcher/src/lib.rs

@@ -684,7 +684,8 @@ impl Batcher {
             return Ok(());
         };
 
-        // We estimate the minimum balance for submission to be the product of the user's `user_min_fee` and the number of proofs they have included in the batch + 1.
+        // We estimate the minimum balance for submission to be the product of the user's `user_min_fee`,
+        // and the number of user's proof in a batch including the currently submitted proof (`proofs_in_the_batch + 1`).
         if !self.check_min_balance(user_min_fee, proofs_in_batch + 1, user_balance, msg_max_fee) {
             std::mem::drop(batch_state_lock);
             send_message(
@@ -787,8 +788,8 @@ impl Batcher {
         user_max_fee: U256,
     ) -> bool {
         // `user_min_fee` is the minimum `max_fee` the user submitted to the batcher 
-        // and it represents the maximium price that the user will pay for each submitted proof. 
-        // We use 'user_min_fee' as an upper bound for the proof submission cost of the user, 
+        // and represents the maximium price that the user will pay for each submitted proof. 
+        // We define 'user_min_fee' as an upper bound for the proof submission cost of the user, 
         // and use it to validate the user's balance has enough fund available to pay for all submitted proofs.
         let mut min_fee = user_min_fee;
         if user_min_fee == U256::max_value() {