NoBey/openzeppelin-contracts
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Optimize MerkleTree for loops by using uint256 iterators (#5415)

Browse Source 
Co-authored-by: Ernesto García <ernestognw@gmail.com>
This commit is contained in:
Michael
2025-01-07 01:02:58 +01:00
committed by GitHub
parent 45dd083602
commit a99b31f990
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
contracts/utils/structs/MerkleTree.sol
View File

@ -88,7 +88,7 @@ library MerkleTree {
// Build each root of zero-filled subtrees // Build each root of zero-filled subtrees
bytes32 currentZero = zero; bytes32 currentZero = zero;
for (uint32 i = 0; i < treeDepth; ++i) { for (uint256 i = 0; i < treeDepth; ++i) {
Arrays.unsafeAccess(self._zeros, i).value = currentZero; Arrays.unsafeAccess(self._zeros, i).value = currentZero;
currentZero = fnHash(currentZero, currentZero); currentZero = fnHash(currentZero, currentZero);
} }
@ -143,7 +143,7 @@ library MerkleTree {
// Rebuild branch from leaf to root // Rebuild branch from leaf to root
uint256 currentIndex = index; uint256 currentIndex = index;
bytes32 currentLevelHash = leaf; bytes32 currentLevelHash = leaf;
for (uint32 i = 0; i < treeDepth; i++) { for (uint256 i = 0; i < treeDepth; i++) {
// Reaching the parent node, is currentLevelHash the left child? // Reaching the parent node, is currentLevelHash the left child?
bool isLeft = currentIndex % 2 == 0; bool isLeft = currentIndex % 2 == 0;