@@ -8,9 +8,9 @@ pragma solidity ^0.8.28;
88library TxMerkleProof {
99 /**
1010 * @notice Possible directions for hashing:
11- * - Left: computed hash is on the left, sibling hash is on the right.
12- * - Right: computed hash is on the right, sibling hash is on the left.
13- * - Self: node has no sibling and is hashed with itself.
11+ * Left: computed hash is on the left, sibling hash is on the right.
12+ * Right: computed hash is on the right, sibling hash is on the left.
13+ * Self: node has no sibling and is hashed with itself
1414 * */
1515 enum HashDirection {
1616 Left,
@@ -28,8 +28,7 @@ library TxMerkleProof {
2828 * @notice Returns true if `leaf_` can be proven to be part of a Merkle tree
2929 * defined by `root_`. Requires a `proof_` containing the sibling hashes along
3030 * the path from the leaf to the root. Each element of `directions_` indicates
31- * the hashing order for each pair.
32- * Uses double SHA-256 hashing.
31+ * the hashing order for each pair. Uses double SHA-256 hashing
3332 */
3433 function verify (
3534 bytes32 [] calldata proof_ ,
@@ -46,8 +45,7 @@ library TxMerkleProof {
4645 * @notice Returns the rebuilt hash obtained by traversing the Merkle tree
4746 * from `leaf_` using `proof_`. A `proof_` is valid if and only if the rebuilt
4847 * hash matches the given tree root. The pre-images are hashed in the order
49- * specified by the `directions_` elements.
50- * Uses double SHA-256 hashing.
48+ * specified by the `directions_` elements. Uses double SHA-256 hashing
5149 */
5250 function processProof (
5351 bytes32 [] calldata proof_ ,
0 commit comments