fix(docs): improve comments for determining left/right sibling with index modulus

Author: nadir-akhtar

src/contracts/libraries/Merkle.sol

@@ -55,15 +55,15 @@ library Merkle {
         bytes32 computedHash = leaf;
         for (uint256 i = 32; i <= proof.length; i += 32) {
             if (index % 2 == 0) {
-                // if ith bit of index is 0, then computedHash is a left sibling
+                // if index is even, then computedHash is a left sibling
                 assembly {
                     mstore(0x00, computedHash)
                     mstore(0x20, mload(add(proof, i)))
                     computedHash := keccak256(0x00, 0x40)
                     index := div(index, 2)
                 }
             } else {
-                // if ith bit of index is 1, then computedHash is a right sibling
+                // if index is odd, then computedHash is a right sibling
                 assembly {
                     mstore(0x00, mload(add(proof, i)))
                     mstore(0x20, computedHash)
@@ -109,15 +109,15 @@ library Merkle {
         bytes32[1] memory computedHash = [leaf];
         for (uint256 i = 32; i <= proof.length; i += 32) {
             if (index % 2 == 0) {
-                // if ith bit of index is 0, then computedHash is a left sibling
+                // if index is even, then computedHash is a left sibling
                 assembly {
                     mstore(0x00, mload(computedHash))
                     mstore(0x20, mload(add(proof, i)))
                     if iszero(staticcall(sub(gas(), 2000), 2, 0x00, 0x40, computedHash, 0x20)) { revert(0, 0) }
                     index := div(index, 2)
                 }
             } else {
-                // if ith bit of index is 1, then computedHash is a right sibling
+                // if index is odd, then computedHash is a right sibling
                 assembly {
                     mstore(0x00, mload(add(proof, i)))
                     mstore(0x20, mload(computedHash))