Crypto · medium

35. Merkle proof verification

Verify membership cheaply.

Implement `verify(bytes32[] memory proof, bytes32 root, bytes32 leaf)` by iteratively hashing the leaf with each proof element (smaller first).

Required in your answer: for (keccak256(abi.encodePacked== root

Compiles with solc in your browser

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;

contract Merkle {
    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) external pure returns (bool) {
        // TODO
    }
}

Output appears here.

← 34. Signature verification 36. Low-level call & delegatecall →