fix: last_max_fee_limit

Author: JuArce

batcher/aligned-batcher/src/lib.rs

@@ -808,8 +808,10 @@ impl Batcher {
                 nonced_verification_data.nonce,
             );
 
+
             if let Some(lowest_entry_priority) = batch_state_lock.lowest_entry_priority() {
-                // If the new proof has more priority than the lowest one in the queue, discard the latter one and push the new one
+                // If the new proof has higher priority than the lowest-priority proof in the queue,
+                // discard the lowest-priority proof and insert the new proof according to its priority.
                 if lowest_entry_priority.cmp(&msg_entry_priority) == Ordering::Greater {
                     let Some((removed_entry, _)) = batch_state_lock.batch_queue.pop() else {
                         warn!("Failed to remove lowest-priority proof despite queue being full.");

batcher/aligned-batcher/src/types/batch_state.rs

@@ -232,7 +232,7 @@ impl BatchState {
     pub(crate) fn update_user_state_on_entry_removal(&mut self, removed_entry: &BatchQueueEntry) {
         let addr = removed_entry.sender;
 
-        let last_max_fee_limit = match self
+        let new_last_max_fee_limit = match self
             .batch_queue
             .iter()
             .filter(|(e, _)| e.sender == addr)
@@ -248,8 +248,8 @@ impl BatchState {
         if let Entry::Occupied(mut user_state) = self.user_states.entry(addr) {
             user_state.get_mut().proofs_in_batch -= 1;
             user_state.get_mut().nonce -= U256::one();
-            user_state.get_mut().total_fees_in_queue -= U256::one();
-            user_state.get_mut().last_max_fee_limit = last_max_fee_limit;
+            user_state.get_mut().total_fees_in_queue -= user_state.get_mut().last_max_fee_limit;
+            user_state.get_mut().last_max_fee_limit = new_last_max_fee_limit;
         }
     }