chore: remove redundant words

src/challengeV2/libraries/EdgeChallengeManagerLib.sol

@@ -103,7 +103,7 @@ library EdgeChallengeManagerLib {
     ///         proof parsing logic and return the common parts for later use.
     /// @param store                The store containing current edges
     /// @param args                 The edge creation args
-    /// @param ard                  Data about the assertion data is is also need to when creating a Block edge type
+    /// @param ard                  Data about the assertion data is also need to when creating a Block edge type
     ///                             The created edge must be shown to be consistent with the states in the assertion chain
     ///                             Empty for non block edge type edges
     /// @param oneStepProofEntry    The one step proof contract that defines how machine states are hashed
@@ -512,7 +512,7 @@ library EdgeChallengeManagerLib {
                 // in createdAtBlock number
                 return firstRivalCreatedAtBlock - edgeCreatedAtBlock;
             } else {
-                // if this was created at the same time as, or after the the first rival
+                // if this was created at the same time as, or after the first rival
                 // then we return 0
                 return 0;
             }

src/challengeV2/libraries/MerkleTreeAccumulatorLib.sol

@@ -325,7 +325,7 @@ library MerkleTreeAccumulatorLib {
     /// @param proof        The proof is the minimum set of complete subtree hashes that can be appended to
     ///                     the accumulator-tree in order to form the post accumulator
     ///                     The first entry in the proof will be appended at the level of the first non-zero entry in the pre-expansion.
-    ///                     The second entry will then be appended to the the first non zero entry in the resulting expansion and so on, until
+    ///                     The second entry will then be appended to the first non zero entry in the resulting expansion and so on, until
     ///                     appending a sub tree will create a tree of greater that the post size. Then, starting at the highest level,
     ///                     the next entry in the proof is attempted to be appended to the expansion, but the result is only accepted if has a size
     ///                     less than or equal the post-size. This continues until all proof entries have been used up.