ETH Price: $3,156.20 (+2.79%)
 

Overview

ETH Balance

0 ETH

ETH Value

$0.00

Token Holdings

Sponsored

Transaction Hash
Method
Block
From
To
Value
Create Urd160402312024-06-20 7:50:0923 days ago1718869809IN
Morpho: Universal Rewards Distributor Factory
0 ETH0.000005780.0073
Create Urd160402092024-06-20 7:49:2523 days ago1718869765IN
Morpho: Universal Rewards Distributor Factory
0 ETH0.000012820.0073
Create Urd156229122024-06-10 15:59:3132 days ago1718035171IN
Morpho: Universal Rewards Distributor Factory
0 ETH0.000006260.0079

Latest 3 internal transactions

Parent Transaction Hash Block From To Value
160402312024-06-20 7:50:0923 days ago1718869809
Morpho: Universal Rewards Distributor Factory
 Contract Creation0 ETH
156229122024-06-10 15:59:3132 days ago1718035171
Morpho: Universal Rewards Distributor Factory
 Contract Creation0 ETH
139787822024-05-03 14:35:1170 days ago1714746911  Contract Creation0 ETH

Loading...
Loading

Contract Source Code Verified (Exact Match)

Contract Name:
UrdFactory

Compiler Version
v0.8.19+commit.7dd6d404

Optimization Enabled:
Yes with 200 runs

Other Settings:
paris EvmVersion, GNU GPLv2 license
File 1 of 10 : UrdFactory.sol
// SPDX-License-Identifier: GPL-2.0-or-later
pragma solidity 0.8.19;

import {EventsLib} from "./libraries/EventsLib.sol";

import {UniversalRewardsDistributor} from "./UniversalRewardsDistributor.sol";

/// @title Universal Rewards Distributor Factory
/// @author Morpho Labs
/// @custom:contact [email protected]
/// @notice This contract allows to create UniversalRewardsDistributor (URD) contracts, and to index them easily.
contract UrdFactory {
    /* STORAGE */

    mapping(address => bool) public isUrd;

    /* EXTERNAL */

    /// @notice Creates a new URD contract using CREATE2 opcode.
    /// @param initialOwner The initial owner of the URD.
    /// @param initialTimelock The initial timelock of the URD.
    /// @param initialRoot The initial merkle root of the URD.
    /// @param initialIpfsHash The optional ipfs hash containing metadata about the root (e.g. the merkle tree itself).
    /// @param salt The salt used for CREATE2 opcode.
    /// @return urd The address of the newly created URD.
    function createUrd(
        address initialOwner,
        uint256 initialTimelock,
        bytes32 initialRoot,
        bytes32 initialIpfsHash,
        bytes32 salt
    ) public returns (UniversalRewardsDistributor urd) {
        urd = new UniversalRewardsDistributor{salt: salt}(initialOwner, initialTimelock, initialRoot, initialIpfsHash);

        isUrd[address(urd)] = true;

        emit EventsLib.UrdCreated(
            address(urd), msg.sender, initialOwner, initialTimelock, initialRoot, initialIpfsHash, salt
        );
    }
}

File 2 of 10 : EventsLib.sol
// SPDX-License-Identifier: GPL-2.0-or-later
pragma solidity ^0.8.0;

/// @title EventsLib
/// @author Morpho Labs
/// @custom:contact [email protected]
/// @notice Library exposing events.
library EventsLib {
    /// @notice Emitted when the merkle root is set.
    /// @param newRoot The new merkle root.
    /// @param newIpfsHash The optional ipfs hash containing metadata about the root (e.g. the merkle tree itself).
    event RootSet(bytes32 indexed newRoot, bytes32 indexed newIpfsHash);

    /// @notice Emitted when a new merkle root is proposed.
    /// @param caller The address of the caller.
    /// @param newRoot The new merkle root.
    /// @param newIpfsHash The optional ipfs hash containing metadata about the root (e.g. the merkle tree itself).
    event PendingRootSet(address indexed caller, bytes32 indexed newRoot, bytes32 indexed newIpfsHash);

    /// @notice Emitted when the pending root is revoked by the owner or an updater.
    event PendingRootRevoked(address indexed caller);

    /// @notice Emitted when a merkle tree distribution timelock is set.
    /// @param newTimelock The new merkle timelock.
    event TimelockSet(uint256 newTimelock);

    /// @notice Emitted when a merkle tree updater is added or removed.
    /// @param rootUpdater The merkle tree updater.
    /// @param active The merkle tree updater's active state.
    event RootUpdaterSet(address indexed rootUpdater, bool active);

    /// @notice Emitted when rewards are claimed.
    /// @param account The address for which rewards are claimed.
    /// @param reward The address of the reward token.
    /// @param amount The amount of reward token claimed.
    event Claimed(address indexed account, address indexed reward, uint256 amount);

    /// @notice Emitted when the ownership of a merkle tree distribution is transferred.
    /// @param newOwner The new owner of the contract.
    event OwnerSet(address indexed newOwner);

    /// @notice Emitted when a new URD is created.
    /// @param urd The address of the newly created URD.
    /// @param caller The address of the caller.
    /// @param initialOwner The address of the URD owner.
    /// @param initialTimelock The URD timelock.
    /// @param initialRoot The URD's initial merkle root.
    /// @param initialIpfsHash The URD's initial ipfs hash.
    /// @param salt The salt used for CREATE2 opcode.
    event UrdCreated(
        address indexed urd,
        address indexed caller,
        address indexed initialOwner,
        uint256 initialTimelock,
        bytes32 initialRoot,
        bytes32 initialIpfsHash,
        bytes32 salt
    );
}

File 3 of 10 : UniversalRewardsDistributor.sol
// SPDX-License-Identifier: GPL-2.0-or-later
pragma solidity 0.8.19;

import {PendingRoot, IUniversalRewardsDistributorStaticTyping} from "./interfaces/IUniversalRewardsDistributor.sol";

import {ErrorsLib} from "./libraries/ErrorsLib.sol";
import {EventsLib} from "./libraries/EventsLib.sol";
import {SafeERC20, IERC20} from "../lib/openzeppelin-contracts/contracts/token/ERC20/utils/SafeERC20.sol";

import {MerkleProof} from "../lib/openzeppelin-contracts/contracts/utils/cryptography/MerkleProof.sol";

/// @title UniversalRewardsDistributor
/// @author Morpho Labs
/// @custom:contact [email protected]
/// @notice This contract enables the distribution of various reward tokens to multiple accounts using different
/// permissionless Merkle trees. It is largely inspired by Morpho's current rewards distributor:
/// https://github.com/morpho-dao/morpho-v1/blob/main/src/common/rewards-distribution/RewardsDistributor.sol
contract UniversalRewardsDistributor is IUniversalRewardsDistributorStaticTyping {
    using SafeERC20 for IERC20;

    /* STORAGE */

    /// @notice The merkle root of this distribution.
    bytes32 public root;

    /// @notice The optional ipfs hash containing metadata about the root (e.g. the merkle tree itself).
    bytes32 public ipfsHash;

    /// @notice The `amount` of `reward` token already claimed by `account`.
    mapping(address account => mapping(address reward => uint256 amount)) public claimed;

    /// @notice The address that can update the distribution parameters, and freeze a root.
    address public owner;

    /// @notice The addresses that can update the merkle root.
    mapping(address => bool) public isUpdater;

    /// @notice The timelock related to root updates.
    uint256 public timelock;

    /// @notice The pending root of the distribution.
    /// @dev If the pending root is set, the root can be updated after the timelock has expired.
    /// @dev The pending root is skipped if the timelock is set to 0.
    PendingRoot public pendingRoot;

    /* MODIFIERS */

    /// @notice Reverts if the caller is not the owner.
    modifier onlyOwner() {
        require(msg.sender == owner, ErrorsLib.NOT_OWNER);
        _;
    }

    /// @notice Reverts if the caller has not the updater role.
    modifier onlyUpdaterRole() {
        require(isUpdater[msg.sender] || msg.sender == owner, ErrorsLib.NOT_UPDATER_ROLE);
        _;
    }

    /* CONSTRUCTOR */

    /// @notice Initializes the contract.
    /// @param initialOwner The initial owner of the contract.
    /// @param initialTimelock The initial timelock of the contract.
    /// @param initialRoot The initial merkle root.
    /// @param initialIpfsHash The optional ipfs hash containing metadata about the root (e.g. the merkle tree itself).
    /// @dev Warning: The `initialIpfsHash` might not correspond to the `initialRoot`.
    constructor(address initialOwner, uint256 initialTimelock, bytes32 initialRoot, bytes32 initialIpfsHash) {
        _setOwner(initialOwner);
        _setTimelock(initialTimelock);
        _setRoot(initialRoot, initialIpfsHash);
    }

    /* EXTERNAL */

    /// @notice Submits a new merkle root.
    /// @param newRoot The new merkle root.
    /// @param newIpfsHash The optional ipfs hash containing metadata about the root (e.g. the merkle tree itself).
    /// @dev Warning: The `newIpfsHash` might not correspond to the `newRoot`.
    function submitRoot(bytes32 newRoot, bytes32 newIpfsHash) external onlyUpdaterRole {
        require(newRoot != pendingRoot.root || newIpfsHash != pendingRoot.ipfsHash, ErrorsLib.ALREADY_PENDING);

        pendingRoot = PendingRoot({root: newRoot, ipfsHash: newIpfsHash, validAt: block.timestamp + timelock});

        emit EventsLib.PendingRootSet(msg.sender, newRoot, newIpfsHash);
    }

    /// @notice Accepts and sets the current pending merkle root.
    /// @dev This function can only be called after the timelock has expired.
    /// @dev Anyone can call this function.
    function acceptRoot() external {
        require(pendingRoot.validAt != 0, ErrorsLib.NO_PENDING_ROOT);
        require(block.timestamp >= pendingRoot.validAt, ErrorsLib.TIMELOCK_NOT_EXPIRED);

        _setRoot(pendingRoot.root, pendingRoot.ipfsHash);
    }

    /// @notice Revokes the pending root.
    /// @dev Can be frontrunned with `acceptRoot` in case the timelock has passed.
    function revokePendingRoot() external onlyUpdaterRole {
        require(pendingRoot.validAt != 0, ErrorsLib.NO_PENDING_ROOT);

        delete pendingRoot;

        emit EventsLib.PendingRootRevoked(msg.sender);
    }

    /// @notice Claims rewards.
    /// @param account The address to claim rewards for.
    /// @param reward The address of the reward token.
    /// @param claimable The overall claimable amount of token rewards.
    /// @param proof The merkle proof that validates this claim.
    /// @return amount The amount of reward token claimed.
    /// @dev Anyone can claim rewards on behalf of an account.
    function claim(address account, address reward, uint256 claimable, bytes32[] calldata proof)
        external
        returns (uint256 amount)
    {
        require(root != bytes32(0), ErrorsLib.ROOT_NOT_SET);
        require(
            MerkleProof.verifyCalldata(
                proof, root, keccak256(bytes.concat(keccak256(abi.encode(account, reward, claimable))))
            ),
            ErrorsLib.INVALID_PROOF_OR_EXPIRED
        );

        require(claimable > claimed[account][reward], ErrorsLib.CLAIMABLE_TOO_LOW);

        amount = claimable - claimed[account][reward];

        claimed[account][reward] = claimable;

        IERC20(reward).safeTransfer(account, amount);

        emit EventsLib.Claimed(account, reward, amount);
    }

    /// @notice Forces update the root of a given distribution (bypassing the timelock).
    /// @param newRoot The new merkle root.
    /// @param newIpfsHash The optional ipfs hash containing metadata about the root (e.g. the merkle tree itself).
    /// @dev This function can only be called by the owner of the distribution or by updaters if there is no timelock.
    /// @dev Set to bytes32(0) to remove the root.
    function setRoot(bytes32 newRoot, bytes32 newIpfsHash) external onlyUpdaterRole {
        require(newRoot != root || newIpfsHash != ipfsHash, ErrorsLib.ALREADY_SET);
        require(timelock == 0 || msg.sender == owner, ErrorsLib.UNAUTHORIZED_ROOT_CHANGE);

        _setRoot(newRoot, newIpfsHash);
    }

    /// @notice Sets the timelock of a given distribution.
    /// @param newTimelock The new timelock.
    /// @dev This function can only be called by the owner of the distribution.
    /// @dev The timelock modification are not applicable to the pending values.
    function setTimelock(uint256 newTimelock) external onlyOwner {
        require(newTimelock != timelock, ErrorsLib.ALREADY_SET);

        _setTimelock(newTimelock);
    }

    /// @notice Sets the root updater of a given distribution.
    /// @param updater The address of the root updater.
    /// @param active Whether the root updater should be active or not.
    function setRootUpdater(address updater, bool active) external onlyOwner {
        require(isUpdater[updater] != active, ErrorsLib.ALREADY_SET);

        isUpdater[updater] = active;

        emit EventsLib.RootUpdaterSet(updater, active);
    }

    /// @notice Sets the `owner` of the distribution to `newOwner`.
    function setOwner(address newOwner) external onlyOwner {
        require(newOwner != owner, ErrorsLib.ALREADY_SET);

        _setOwner(newOwner);
    }

    /* INTERNAL */

    /// @dev Sets the `root` and `ipfsHash` to `newRoot` and `newIpfsHash`.
    /// @dev Deletes the pending root.
    /// @dev Warning: The `newIpfsHash` might not correspond to the `newRoot`.
    function _setRoot(bytes32 newRoot, bytes32 newIpfsHash) internal {
        root = newRoot;
        ipfsHash = newIpfsHash;

        delete pendingRoot;

        emit EventsLib.RootSet(newRoot, newIpfsHash);
    }

    /// @dev Sets the `owner` of the distribution to `newOwner`.
    function _setOwner(address newOwner) internal {
        owner = newOwner;

        emit EventsLib.OwnerSet(newOwner);
    }

    /// @dev Sets the `timelock` to `newTimelock`.
    function _setTimelock(uint256 newTimelock) internal {
        timelock = newTimelock;

        emit EventsLib.TimelockSet(newTimelock);
    }
}

File 4 of 10 : IUniversalRewardsDistributor.sol
// SPDX-License-Identifier: GPL-2.0-or-later
pragma solidity >=0.5.0;

/// @notice The pending root struct for a merkle tree distribution during the timelock.
struct PendingRoot {
    /// @dev The submitted pending root.
    bytes32 root;
    /// @dev The optional ipfs hash containing metadata about the root (e.g. the merkle tree itself).
    bytes32 ipfsHash;
    /// @dev The timestamp at which the pending root can be accepted.
    uint256 validAt;
}

/// @dev This interface is used for factorizing IUniversalRewardsDistributorStaticTyping and
/// IUniversalRewardsDistributor.
/// @dev Consider using the IUniversalRewardsDistributor interface instead of this one.
interface IUniversalRewardsDistributorBase {
    function root() external view returns (bytes32);
    function owner() external view returns (address);
    function timelock() external view returns (uint256);
    function ipfsHash() external view returns (bytes32);
    function isUpdater(address) external view returns (bool);
    function claimed(address, address) external view returns (uint256);

    function acceptRoot() external;
    function setRoot(bytes32 newRoot, bytes32 newIpfsHash) external;
    function setTimelock(uint256 newTimelock) external;
    function setRootUpdater(address updater, bool active) external;
    function revokePendingRoot() external;
    function setOwner(address newOwner) external;

    function submitRoot(bytes32 newRoot, bytes32 ipfsHash) external;

    function claim(address account, address reward, uint256 claimable, bytes32[] memory proof)
        external
        returns (uint256 amount);
}

/// @dev This interface is inherited by the UniversalRewardsDistributor so that function signatures are checked by the
/// compiler.
/// @dev Consider using the IUniversalRewardsDistributor interface instead of this one.
interface IUniversalRewardsDistributorStaticTyping is IUniversalRewardsDistributorBase {
    function pendingRoot() external view returns (bytes32 root, bytes32 ipfsHash, uint256 validAt);
}

/// @title IUniversalRewardsDistributor
/// @author Morpho Labs
/// @custom:contact [email protected]
/// @dev Use this interface for UniversalRewardsDistributor to have access to all the functions with the appropriate
/// function signatures.
interface IUniversalRewardsDistributor is IUniversalRewardsDistributorBase {
    function pendingRoot() external view returns (PendingRoot memory);
}

File 5 of 10 : ErrorsLib.sol
// SPDX-License-Identifier: GPL-2.0-or-later
pragma solidity ^0.8.0;

/// @title ErrorsLib
/// @author Morpho Labs
/// @custom:contact [email protected]
/// @notice Library exposing error messages.
library ErrorsLib {
    /// @notice Thrown when the caller has not the updater role.
    string internal constant NOT_UPDATER_ROLE = "caller has not the updater role";

    /// @notice Thrown when the caller is not the owner.
    string internal constant NOT_OWNER = "caller is not the owner";

    /// @notice Thrown when the caller trying to change the root under timelock is not the owner.
    string internal constant UNAUTHORIZED_ROOT_CHANGE = "unauthorized to change the root";

    /// @notice Thrown when there is not pending root.
    string internal constant NO_PENDING_ROOT = "no pending root";

    /// @notice Thrown when the timelock is not expired.
    string internal constant TIMELOCK_NOT_EXPIRED = "timelock is not expired";

    /// @notice Thrown when the root is not set.
    string internal constant ROOT_NOT_SET = "root is not set";

    /// @notice Thrown when the proof is invalid or expired when claiming rewards.
    string internal constant INVALID_PROOF_OR_EXPIRED = "invalid proof or expired";

    /// @notice Thrown when the Merkle tree contains a node with fewer rewards than what it has previously claimed. Also
    /// thrown if user claims twice with the same root.
    string internal constant CLAIMABLE_TOO_LOW = "claimable too low";

    /// @notice Thrown when the value is already set.
    string internal constant ALREADY_SET = "already set";

    /// @notice Thrown when the submitted value is already pending.
    string internal constant ALREADY_PENDING = "already pending";
}

File 6 of 10 : SafeERC20.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC20/utils/SafeERC20.sol)

pragma solidity ^0.8.0;

import "../IERC20.sol";
import "../extensions/IERC20Permit.sol";
import "../../../utils/Address.sol";

/**
 * @title SafeERC20
 * @dev Wrappers around ERC20 operations that throw on failure (when the token
 * contract returns false). Tokens that return no value (and instead revert or
 * throw on failure) are also supported, non-reverting calls are assumed to be
 * successful.
 * To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,
 * which allows you to call the safe operations as `token.safeTransfer(...)`, etc.
 */
library SafeERC20 {
    using Address for address;

    /**
     * @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     */
    function safeTransfer(IERC20 token, address to, uint256 value) internal {
        _callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value));
    }

    /**
     * @dev Transfer `value` amount of `token` from `from` to `to`, spending the approval given by `from` to the
     * calling contract. If `token` returns no value, non-reverting calls are assumed to be successful.
     */
    function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal {
        _callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value));
    }

    /**
     * @dev Deprecated. This function has issues similar to the ones found in
     * {IERC20-approve}, and its usage is discouraged.
     *
     * Whenever possible, use {safeIncreaseAllowance} and
     * {safeDecreaseAllowance} instead.
     */
    function safeApprove(IERC20 token, address spender, uint256 value) internal {
        // safeApprove should only be called when setting an initial allowance,
        // or when resetting it to zero. To increase and decrease it, use
        // 'safeIncreaseAllowance' and 'safeDecreaseAllowance'
        require(
            (value == 0) || (token.allowance(address(this), spender) == 0),
            "SafeERC20: approve from non-zero to non-zero allowance"
        );
        _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value));
    }

    /**
     * @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     */
    function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {
        uint256 oldAllowance = token.allowance(address(this), spender);
        _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, oldAllowance + value));
    }

    /**
     * @dev Decrease the calling contract's allowance toward `spender` by `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     */
    function safeDecreaseAllowance(IERC20 token, address spender, uint256 value) internal {
        unchecked {
            uint256 oldAllowance = token.allowance(address(this), spender);
            require(oldAllowance >= value, "SafeERC20: decreased allowance below zero");
            _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, oldAllowance - value));
        }
    }

    /**
     * @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful. Compatible with tokens that require the approval to be set to
     * 0 before setting it to a non-zero value.
     */
    function forceApprove(IERC20 token, address spender, uint256 value) internal {
        bytes memory approvalCall = abi.encodeWithSelector(token.approve.selector, spender, value);

        if (!_callOptionalReturnBool(token, approvalCall)) {
            _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, 0));
            _callOptionalReturn(token, approvalCall);
        }
    }

    /**
     * @dev Use a ERC-2612 signature to set the `owner` approval toward `spender` on `token`.
     * Revert on invalid signature.
     */
    function safePermit(
        IERC20Permit token,
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal {
        uint256 nonceBefore = token.nonces(owner);
        token.permit(owner, spender, value, deadline, v, r, s);
        uint256 nonceAfter = token.nonces(owner);
        require(nonceAfter == nonceBefore + 1, "SafeERC20: permit did not succeed");
    }

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     */
    function _callOptionalReturn(IERC20 token, bytes memory data) private {
        // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
        // we're implementing it ourselves. We use {Address-functionCall} to perform this call, which verifies that
        // the target address contains contract code and also asserts for success in the low-level call.

        bytes memory returndata = address(token).functionCall(data, "SafeERC20: low-level call failed");
        require(returndata.length == 0 || abi.decode(returndata, (bool)), "SafeERC20: ERC20 operation did not succeed");
    }

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     *
     * This is a variant of {_callOptionalReturn} that silents catches all reverts and returns a bool instead.
     */
    function _callOptionalReturnBool(IERC20 token, bytes memory data) private returns (bool) {
        // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
        // we're implementing it ourselves. We cannot use {Address-functionCall} here since this should return false
        // and not revert is the subcall reverts.

        (bool success, bytes memory returndata) = address(token).call(data);
        return
            success && (returndata.length == 0 || abi.decode(returndata, (bool))) && Address.isContract(address(token));
    }
}

File 7 of 10 : MerkleProof.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.2) (utils/cryptography/MerkleProof.sol)

pragma solidity ^0.8.0;

/**
 * @dev These functions deal with verification of Merkle Tree proofs.
 *
 * The tree and the proofs can be generated using our
 * https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
 * You will find a quickstart guide in the readme.
 *
 * WARNING: You should avoid using leaf values that are 64 bytes long prior to
 * hashing, or use a hash function other than keccak256 for hashing leaves.
 * This is because the concatenation of a sorted pair of internal nodes in
 * the merkle tree could be reinterpreted as a leaf value.
 * OpenZeppelin's JavaScript library generates merkle trees that are safe
 * against this attack out of the box.
 */
library MerkleProof {
    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     */
    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProof(proof, leaf) == root;
    }

    /**
     * @dev Calldata version of {verify}
     *
     * _Available since v4.7._
     */
    function verifyCalldata(bytes32[] calldata proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProofCalldata(proof, leaf) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leafs & pre-images are assumed to be sorted.
     *
     * _Available since v4.4._
     */
    function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Calldata version of {processProof}
     *
     * _Available since v4.7._
     */
    function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProof(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Calldata version of {multiProofVerify}
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function multiProofVerifyCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProofCalldata(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * CAUTION: Not all merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * _Available since v4.7._
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofLen = proof.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proofLen - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](totalHashes);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            require(proofPos == proofLen, "MerkleProof: invalid multiproof");
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @dev Calldata version of {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofLen = proof.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proofLen - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](totalHashes);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            require(proofPos == proofLen, "MerkleProof: invalid multiproof");
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {
        return a < b ? _efficientHash(a, b) : _efficientHash(b, a);
    }

    function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
        /// @solidity memory-safe-assembly
        assembly {
            mstore(0x00, a)
            mstore(0x20, b)
            value := keccak256(0x00, 0x40)
        }
    }
}

File 8 of 10 : IERC20.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC20/IERC20.sol)

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC20 standard as defined in the EIP.
 */
interface IERC20 {
    /**
     * @dev Emitted when `value` tokens are moved from one account (`from`) to
     * another (`to`).
     *
     * Note that `value` may be zero.
     */
    event Transfer(address indexed from, address indexed to, uint256 value);

    /**
     * @dev Emitted when the allowance of a `spender` for an `owner` is set by
     * a call to {approve}. `value` is the new allowance.
     */
    event Approval(address indexed owner, address indexed spender, uint256 value);

    /**
     * @dev Returns the amount of tokens in existence.
     */
    function totalSupply() external view returns (uint256);

    /**
     * @dev Returns the amount of tokens owned by `account`.
     */
    function balanceOf(address account) external view returns (uint256);

    /**
     * @dev Moves `amount` tokens from the caller's account to `to`.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transfer(address to, uint256 amount) external returns (bool);

    /**
     * @dev Returns the remaining number of tokens that `spender` will be
     * allowed to spend on behalf of `owner` through {transferFrom}. This is
     * zero by default.
     *
     * This value changes when {approve} or {transferFrom} are called.
     */
    function allowance(address owner, address spender) external view returns (uint256);

    /**
     * @dev Sets `amount` as the allowance of `spender` over the caller's tokens.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * IMPORTANT: Beware that changing an allowance with this method brings the risk
     * that someone may use both the old and the new allowance by unfortunate
     * transaction ordering. One possible solution to mitigate this race
     * condition is to first reduce the spender's allowance to 0 and set the
     * desired value afterwards:
     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
     *
     * Emits an {Approval} event.
     */
    function approve(address spender, uint256 amount) external returns (bool);

    /**
     * @dev Moves `amount` tokens from `from` to `to` using the
     * allowance mechanism. `amount` is then deducted from the caller's
     * allowance.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(address from, address to, uint256 amount) external returns (bool);
}

File 9 of 10 : IERC20Permit.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC20/extensions/IERC20Permit.sol)

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in
 * https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].
 *
 * Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by
 * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't
 * need to send a transaction, and thus is not required to hold Ether at all.
 */
interface IERC20Permit {
    /**
     * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
     * given ``owner``'s signed approval.
     *
     * IMPORTANT: The same issues {IERC20-approve} has related to transaction
     * ordering also apply here.
     *
     * Emits an {Approval} event.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     * - `deadline` must be a timestamp in the future.
     * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
     * over the EIP712-formatted function arguments.
     * - the signature must use ``owner``'s current nonce (see {nonces}).
     *
     * For more information on the signature format, see the
     * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
     * section].
     */
    function permit(
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) external;

    /**
     * @dev Returns the current nonce for `owner`. This value must be
     * included whenever a signature is generated for {permit}.
     *
     * Every successful call to {permit} increases ``owner``'s nonce by one. This
     * prevents a signature from being used multiple times.
     */
    function nonces(address owner) external view returns (uint256);

    /**
     * @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.
     */
    // solhint-disable-next-line func-name-mixedcase
    function DOMAIN_SEPARATOR() external view returns (bytes32);
}

File 10 of 10 : Address.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/Address.sol)

pragma solidity ^0.8.1;

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev Returns true if `account` is a contract.
     *
     * [IMPORTANT]
     * ====
     * It is unsafe to assume that an address for which this function returns
     * false is an externally-owned account (EOA) and not a contract.
     *
     * Among others, `isContract` will return false for the following
     * types of addresses:
     *
     *  - an externally-owned account
     *  - a contract in construction
     *  - an address where a contract will be created
     *  - an address where a contract lived, but was destroyed
     *
     * Furthermore, `isContract` will also return true if the target contract within
     * the same transaction is already scheduled for destruction by `SELFDESTRUCT`,
     * which only has an effect at the end of a transaction.
     * ====
     *
     * [IMPORTANT]
     * ====
     * You shouldn't rely on `isContract` to protect against flash loan attacks!
     *
     * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets
     * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract
     * constructor.
     * ====
     */
    function isContract(address account) internal view returns (bool) {
        // This method relies on extcodesize/address.code.length, which returns 0
        // for contracts in construction, since the code is only stored at the end
        // of the constructor execution.

        return account.code.length > 0;
    }

    /**
     * @dev Replacement for Solidity's `transfer`: sends `amount` wei to
     * `recipient`, forwarding all available gas and reverting on errors.
     *
     * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
     * of certain opcodes, possibly making contracts go over the 2300 gas limit
     * imposed by `transfer`, making them unable to receive funds via
     * `transfer`. {sendValue} removes this limitation.
     *
     * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].
     *
     * IMPORTANT: because control is transferred to `recipient`, care must be
     * taken to not create reentrancy vulnerabilities. Consider using
     * {ReentrancyGuard} or the
     * https://solidity.readthedocs.io/en/v0.8.0/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
     */
    function sendValue(address payable recipient, uint256 amount) internal {
        require(address(this).balance >= amount, "Address: insufficient balance");

        (bool success, ) = recipient.call{value: amount}("");
        require(success, "Address: unable to send value, recipient may have reverted");
    }

    /**
     * @dev Performs a Solidity function call using a low level `call`. A
     * plain `call` is an unsafe replacement for a function call: use this
     * function instead.
     *
     * If `target` reverts with a revert reason, it is bubbled up by this
     * function (like regular Solidity function calls).
     *
     * Returns the raw returned data. To convert to the expected return value,
     * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
     *
     * Requirements:
     *
     * - `target` must be a contract.
     * - calling `target` with `data` must not revert.
     *
     * _Available since v3.1._
     */
    function functionCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, "Address: low-level call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with
     * `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but also transferring `value` wei to `target`.
     *
     * Requirements:
     *
     * - the calling contract must have an ETH balance of at least `value`.
     * - the called Solidity function must be `payable`.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {
        return functionCallWithValue(target, data, value, "Address: low-level call with value failed");
    }

    /**
     * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but
     * with `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value,
        string memory errorMessage
    ) internal returns (bytes memory) {
        require(address(this).balance >= value, "Address: insufficient balance for call");
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
        return functionStaticCall(target, data, "Address: low-level static call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        (bool success, bytes memory returndata) = target.staticcall(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionDelegateCall(target, data, "Address: low-level delegate call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        (bool success, bytes memory returndata) = target.delegatecall(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling
     * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.
     *
     * _Available since v4.8._
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        if (success) {
            if (returndata.length == 0) {
                // only check isContract if the call was successful and the return data is empty
                // otherwise we already know that it was a contract
                require(isContract(target), "Address: call to non-contract");
            }
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the
     * revert reason or using the provided one.
     *
     * _Available since v4.3._
     */
    function verifyCallResult(
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal pure returns (bytes memory) {
        if (success) {
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    function _revert(bytes memory returndata, string memory errorMessage) private pure {
        // Look for revert reason and bubble it up if present
        if (returndata.length > 0) {
            // The easiest way to bubble the revert reason is using memory via assembly
            /// @solidity memory-safe-assembly
            assembly {
                let returndata_size := mload(returndata)
                revert(add(32, returndata), returndata_size)
            }
        } else {
            revert(errorMessage);
        }
    }
}

Settings
{
  "remappings": [
    "ds-test/=lib/forge-std/lib/ds-test/src/",
    "erc4626-tests/=lib/openzeppelin-contracts/lib/erc4626-tests/",
    "forge-std/=lib/forge-std/src/",
    "murky/=lib/murky/src/",
    "openzeppelin-contracts/=lib/openzeppelin-contracts/",
    "openzeppelin/=lib/openzeppelin-contracts/contracts/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "metadata": {
    "useLiteralContent": false,
    "bytecodeHash": "ipfs",
    "appendCBOR": true
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "abi"
      ]
    }
  },
  "evmVersion": "paris",
  "viaIR": true,
  "libraries": {}
}

Contract Security Audit

Contract ABI

[{"inputs":[{"internalType":"address","name":"initialOwner","type":"address"},{"internalType":"uint256","name":"initialTimelock","type":"uint256"},{"internalType":"bytes32","name":"initialRoot","type":"bytes32"},{"internalType":"bytes32","name":"initialIpfsHash","type":"bytes32"},{"internalType":"bytes32","name":"salt","type":"bytes32"}],"name":"createUrd","outputs":[{"internalType":"contract UniversalRewardsDistributor","name":"urd","type":"address"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"isUrd","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"}]

6080806040523461001657611007908161001c8239f35b600080fdfe6080604090808252600436101561001557600080fd5b600090813560e01c90816309bf14231461012d5750638683fbdd1461003957600080fd5b3461012a5760a036600319011261012a5761005261016b565b916024356044359060643560843590845193610e4b948581019581871067ffffffffffffffff88111761011657908491610187823960808160018060a01b03809c1698898152886020820152858b82015286606082015203019089f5801561010c5760209887911697888152808a5220600160ff19825416179055855193845287840152848301526060820152837fb08f131b4d26f626f4bd2fa639786c2b37988240728dcb975897a27ddc87ddb260803393a451908152f35b86513d89823e3d90fd5b634e487b7160e01b89526041600452602489fd5b80fd5b905082346101675760203660031901126101675760209260ff91906001600160a01b0361015861016b565b16815280855220541615158152f35b8280fd5b600435906001600160a01b038216820361018157565b600080fdfe60803461011057601f610e4b38819003918201601f19168301916001600160401b03831184841017610115578084926080946040528339810103126101105780516001600160a01b0381169190829003610110576020810151907f980b903efea70e6b1bd235b1fb05f1a5da73cbd478b73c9538053f9eb29f129f602060606040840151930151938560018060a01b03196003541617600355604051906000967f50146d0e3c60aa1d17a70635b05494f864e86144a2201275021014fbf08bafe28880a2806005558152a1808355816001558260065582600755826008557f901232fc92ac16700a7d4b60706cbd27dec177bc85c9c2dbd2e2871d63b22a236040519380a3610d1f908161012c8239f35b600080fd5b634e487b7160e01b600052604160045260246000fdfe608060408181526004908136101561001657600080fd5b600092833560e01c9081630c9cbf0e14610a645750806313af4035146109db5780631e891c0a1461096c57806342af83fb146108695780634b387053146107e05780634fdfb086146107a357806353739410146106fe578063750588cf146106ce5780638da5cb5b146106a5578063c623674f14610686578063d33219b414610667578063d61825ef14610551578063ebf0c71714610534578063ed075ec51461048a5763fabed412146100c957600080fd5b34610486576080366003190112610486576100e2610aaa565b6100ea610ac5565b6044359360643567ffffffffffffffff968782116103e257366023830112156103e25781830135978089116103e55760249260059036858c841b83010111610482579088979161016b9b8554918a519461014386610af1565b600f865260209e8f966e1c9bdbdd081a5cc81b9bdd081cd95d608a1b88820152851515610bc1565b8d8c51908782019260018060a01b038091169d8e855216809e83015260608201526060815261019981610b23565b5190208c518681019182528681526101b081610af1565b5190209387955b83871061042d575050505061020292508951916101d383610af1565b601883527f696e76616c69642070726f6f66206f72206578706972656400000000000000008d84015214610bc1565b84825260028952868220868352895261024887832054891188519061022682610af1565b6011825270636c61696d61626c6520746f6f206c6f7760781b8c830152610bc1565b8482526002895286822086835289528682205488039780891161041b5790899186845260028352888420888552835288842055828089518481019063a9059cbb60e01b825289888201528c6044820152604481526102a581610b23565b7f5361666545524332303a206c6f772d6c6576656c2063616c6c206661696c65648c51966102d288610af1565b8088528701525190828b5af13d1561040d573d8281116103fb57895192601f8201601f19908116603f01168401908111848210176103e9578a5282526103219291903d858d84013e5b88610c14565b8051918215918a83156103be575b5050509050156103695750507ff7a40077ff7a04c7e61f6f26fb13774259ddf1b6bce9ecf26a8276cdd3992683858451868152a351908152f35b845162461bcd60e51b8152918201879052602a908201527f5361666545524332303a204552433230206f7065726174696f6e20646964206e6044820152691bdd081cdd58d8d9595960b21b6064820152608490fd5b9193818094500103126103e5578801519081151582036103e257508038808a61032f565b80fd5b5080fd5b634e487b7160e01b8652604188528686fd5b634e487b7160e01b8552604187528585fd5b61032192915060609061031b565b5050634e487b7160e01b815260118352fd5b89878394959697931b8501013591828110600014610476578952528b87205b9460001981146104645760010194939291908e6101b7565b634e487b7160e01b885260118a528888fd5b918952528b872061044c565b8380fd5b8280fd5b8382346103e557816003193601126103e5576008546104f3916104b66104ae610be9565b831515610bc1565b51906104c182610af1565b601782527f74696d656c6f636b206973206e6f7420657870697265640000000000000000006020830152421015610bc1565b60065460075490808355816001558260065582600755826008557f901232fc92ac16700a7d4b60706cbd27dec177bc85c9c2dbd2e2871d63b22a238380a380f35b8382346103e557816003193601126103e557602091549051908152f35b5090346104865761056136610adb565b9290913385528060205260ff82862054168015610653575b61058b90610585610b3f565b90610bc1565b6006548314801590610647575b82516105c8916105a782610af1565b600f82526e616c72656164792070656e64696e6760881b6020830152610bc1565b600554420191824211610634575167ffffffffffffffff6060820191821091111761062157508160065582600755600855337f922a2513428e5d51dd666942f04a14788d1db1ab35373059a8a29f025d6342cb8480a480f35b634e487b7160e01b855260419052602484fd5b634e487b7160e01b865260118252602486fd5b50600754841415610598565b506003546001600160a01b03163314610579565b8382346103e557816003193601126103e5576020906005549051908152f35b8382346103e557816003193601126103e5576020906001549051908152f35b8382346103e557816003193601126103e55760035490516001600160a01b039091168152602090f35b8382346103e557816003193601126103e55760609060065490600754906008549181519384526020840152820152f35b5034610486578060031936011261048657610717610aaa565b60243580151580910361079f577fefa819ca5209d17f1dfd20e7c0c2100700ae10239d28140f00fa620742b2d8429260209260018060a01b039061076382600354163314610585610cb0565b16948587528084526107828360ff848a20541615151415610585610c89565b858752835280862060ff1981541660ff841617905551908152a280f35b8480fd5b5090346104865760203660031901126104865760209260ff918391906001600160a01b036107cf610aaa565b168252855220541690519015158152f35b503461048657826003193601126104865760ff91338452602052822054168015610855575b61081190610585610b3f565b6108216008541515610585610be9565b806006558060075580600855337ffc5bc87b2339664e063f6f7cd154075756d9c3b2c38ca2b950fef2f8b3f6dc408280a280f35b506003546001600160a01b03163314610805565b509034610486576108fd61087c36610adb565b93909233865260205260ff81862054168015610958575b61089f90610585610b3f565b8454831480159061094c575b6108b790610585610c89565b60055415908115610937575b51906108ce82610af1565b601f82527f756e617574686f72697a656420746f206368616e67652074686520726f6f74006020830152610bc1565b808355816001558260065582600755826008557f901232fc92ac16700a7d4b60706cbd27dec177bc85c9c2dbd2e2871d63b22a238380a380f35b6003546001600160a01b0316331491506108c3565b506001548414156108ab565b506003546001600160a01b03163314610893565b509034610486576020366003190112610486577f980b903efea70e6b1bd235b1fb05f1a5da73cbd478b73c9538053f9eb29f129f9160209135906109be60018060a01b03600354163314610585610cb0565b6109cf600554831415610585610c89565b8160055551908152a180f35b83346103e25760203660031901126103e257610a2f6109f8610aaa565b6003546001600160a01b0380821692610a1a610a12610cb0565b853314610bc1565b16928392610a26610c89565b90841415610bc1565b6001600160a01b031916176003557f50146d0e3c60aa1d17a70635b05494f864e86144a2201275021014fbf08bafe28280a280f35b92505034610486578060031936011261048657602092610a82610aaa565b610a8a610ac5565b6001600160a01b0391821683526002865283832091168252845220548152f35b600435906001600160a01b0382168203610ac057565b600080fd5b602435906001600160a01b0382168203610ac057565b6040906003190112610ac0576004359060243590565b6040810190811067ffffffffffffffff821117610b0d57604052565b634e487b7160e01b600052604160045260246000fd5b6080810190811067ffffffffffffffff821117610b0d57604052565b60405190610b4c82610af1565b601f82527f63616c6c657220686173206e6f7420746865207570646174657220726f6c65006020830152565b6020808252825181830181905290939260005b828110610bad57505060409293506000838284010152601f8019910116010190565b818101860151848201604001528501610b8b565b15610bc95750565b60405162461bcd60e51b8152908190610be59060048301610b78565b0390fd5b60405190610bf682610af1565b600f82526e1b9bc81c195b991a5b99c81c9bdbdd608a1b6020830152565b91929015610c765750815115610c28575090565b3b15610c315790565b60405162461bcd60e51b815260206004820152601d60248201527f416464726573733a2063616c6c20746f206e6f6e2d636f6e74726163740000006044820152606490fd5b825190915015610bc95750805190602001fd5b60405190610c9682610af1565b600b82526a185b1c9958591e481cd95d60aa1b6020830152565b60405190610cbd82610af1565b601782527f63616c6c6572206973206e6f7420746865206f776e6572000000000000000000602083015256fea2646970667358221220a506ad89f7f10922bdac9ccd1ae25467e587c04e56801b128773303f073d701664736f6c63430008130033a2646970667358221220a7f8576e2db19f8c4ce4d617cf2739180734b5114b87a13cbeb2c83d6908ad9e64736f6c63430008130033

Deployed Bytecode

0x6080604090808252600436101561001557600080fd5b600090813560e01c90816309bf14231461012d5750638683fbdd1461003957600080fd5b3461012a5760a036600319011261012a5761005261016b565b916024356044359060643560843590845193610e4b948581019581871067ffffffffffffffff88111761011657908491610187823960808160018060a01b03809c1698898152886020820152858b82015286606082015203019089f5801561010c5760209887911697888152808a5220600160ff19825416179055855193845287840152848301526060820152837fb08f131b4d26f626f4bd2fa639786c2b37988240728dcb975897a27ddc87ddb260803393a451908152f35b86513d89823e3d90fd5b634e487b7160e01b89526041600452602489fd5b80fd5b905082346101675760203660031901126101675760209260ff91906001600160a01b0361015861016b565b16815280855220541615158152f35b8280fd5b600435906001600160a01b038216820361018157565b600080fdfe60803461011057601f610e4b38819003918201601f19168301916001600160401b03831184841017610115578084926080946040528339810103126101105780516001600160a01b0381169190829003610110576020810151907f980b903efea70e6b1bd235b1fb05f1a5da73cbd478b73c9538053f9eb29f129f602060606040840151930151938560018060a01b03196003541617600355604051906000967f50146d0e3c60aa1d17a70635b05494f864e86144a2201275021014fbf08bafe28880a2806005558152a1808355816001558260065582600755826008557f901232fc92ac16700a7d4b60706cbd27dec177bc85c9c2dbd2e2871d63b22a236040519380a3610d1f908161012c8239f35b600080fd5b634e487b7160e01b600052604160045260246000fdfe608060408181526004908136101561001657600080fd5b600092833560e01c9081630c9cbf0e14610a645750806313af4035146109db5780631e891c0a1461096c57806342af83fb146108695780634b387053146107e05780634fdfb086146107a357806353739410146106fe578063750588cf146106ce5780638da5cb5b146106a5578063c623674f14610686578063d33219b414610667578063d61825ef14610551578063ebf0c71714610534578063ed075ec51461048a5763fabed412146100c957600080fd5b34610486576080366003190112610486576100e2610aaa565b6100ea610ac5565b6044359360643567ffffffffffffffff968782116103e257366023830112156103e25781830135978089116103e55760249260059036858c841b83010111610482579088979161016b9b8554918a519461014386610af1565b600f865260209e8f966e1c9bdbdd081a5cc81b9bdd081cd95d608a1b88820152851515610bc1565b8d8c51908782019260018060a01b038091169d8e855216809e83015260608201526060815261019981610b23565b5190208c518681019182528681526101b081610af1565b5190209387955b83871061042d575050505061020292508951916101d383610af1565b601883527f696e76616c69642070726f6f66206f72206578706972656400000000000000008d84015214610bc1565b84825260028952868220868352895261024887832054891188519061022682610af1565b6011825270636c61696d61626c6520746f6f206c6f7760781b8c830152610bc1565b8482526002895286822086835289528682205488039780891161041b5790899186845260028352888420888552835288842055828089518481019063a9059cbb60e01b825289888201528c6044820152604481526102a581610b23565b7f5361666545524332303a206c6f772d6c6576656c2063616c6c206661696c65648c51966102d288610af1565b8088528701525190828b5af13d1561040d573d8281116103fb57895192601f8201601f19908116603f01168401908111848210176103e9578a5282526103219291903d858d84013e5b88610c14565b8051918215918a83156103be575b5050509050156103695750507ff7a40077ff7a04c7e61f6f26fb13774259ddf1b6bce9ecf26a8276cdd3992683858451868152a351908152f35b845162461bcd60e51b8152918201879052602a908201527f5361666545524332303a204552433230206f7065726174696f6e20646964206e6044820152691bdd081cdd58d8d9595960b21b6064820152608490fd5b9193818094500103126103e5578801519081151582036103e257508038808a61032f565b80fd5b5080fd5b634e487b7160e01b8652604188528686fd5b634e487b7160e01b8552604187528585fd5b61032192915060609061031b565b5050634e487b7160e01b815260118352fd5b89878394959697931b8501013591828110600014610476578952528b87205b9460001981146104645760010194939291908e6101b7565b634e487b7160e01b885260118a528888fd5b918952528b872061044c565b8380fd5b8280fd5b8382346103e557816003193601126103e5576008546104f3916104b66104ae610be9565b831515610bc1565b51906104c182610af1565b601782527f74696d656c6f636b206973206e6f7420657870697265640000000000000000006020830152421015610bc1565b60065460075490808355816001558260065582600755826008557f901232fc92ac16700a7d4b60706cbd27dec177bc85c9c2dbd2e2871d63b22a238380a380f35b8382346103e557816003193601126103e557602091549051908152f35b5090346104865761056136610adb565b9290913385528060205260ff82862054168015610653575b61058b90610585610b3f565b90610bc1565b6006548314801590610647575b82516105c8916105a782610af1565b600f82526e616c72656164792070656e64696e6760881b6020830152610bc1565b600554420191824211610634575167ffffffffffffffff6060820191821091111761062157508160065582600755600855337f922a2513428e5d51dd666942f04a14788d1db1ab35373059a8a29f025d6342cb8480a480f35b634e487b7160e01b855260419052602484fd5b634e487b7160e01b865260118252602486fd5b50600754841415610598565b506003546001600160a01b03163314610579565b8382346103e557816003193601126103e5576020906005549051908152f35b8382346103e557816003193601126103e5576020906001549051908152f35b8382346103e557816003193601126103e55760035490516001600160a01b039091168152602090f35b8382346103e557816003193601126103e55760609060065490600754906008549181519384526020840152820152f35b5034610486578060031936011261048657610717610aaa565b60243580151580910361079f577fefa819ca5209d17f1dfd20e7c0c2100700ae10239d28140f00fa620742b2d8429260209260018060a01b039061076382600354163314610585610cb0565b16948587528084526107828360ff848a20541615151415610585610c89565b858752835280862060ff1981541660ff841617905551908152a280f35b8480fd5b5090346104865760203660031901126104865760209260ff918391906001600160a01b036107cf610aaa565b168252855220541690519015158152f35b503461048657826003193601126104865760ff91338452602052822054168015610855575b61081190610585610b3f565b6108216008541515610585610be9565b806006558060075580600855337ffc5bc87b2339664e063f6f7cd154075756d9c3b2c38ca2b950fef2f8b3f6dc408280a280f35b506003546001600160a01b03163314610805565b509034610486576108fd61087c36610adb565b93909233865260205260ff81862054168015610958575b61089f90610585610b3f565b8454831480159061094c575b6108b790610585610c89565b60055415908115610937575b51906108ce82610af1565b601f82527f756e617574686f72697a656420746f206368616e67652074686520726f6f74006020830152610bc1565b808355816001558260065582600755826008557f901232fc92ac16700a7d4b60706cbd27dec177bc85c9c2dbd2e2871d63b22a238380a380f35b6003546001600160a01b0316331491506108c3565b506001548414156108ab565b506003546001600160a01b03163314610893565b509034610486576020366003190112610486577f980b903efea70e6b1bd235b1fb05f1a5da73cbd478b73c9538053f9eb29f129f9160209135906109be60018060a01b03600354163314610585610cb0565b6109cf600554831415610585610c89565b8160055551908152a180f35b83346103e25760203660031901126103e257610a2f6109f8610aaa565b6003546001600160a01b0380821692610a1a610a12610cb0565b853314610bc1565b16928392610a26610c89565b90841415610bc1565b6001600160a01b031916176003557f50146d0e3c60aa1d17a70635b05494f864e86144a2201275021014fbf08bafe28280a280f35b92505034610486578060031936011261048657602092610a82610aaa565b610a8a610ac5565b6001600160a01b0391821683526002865283832091168252845220548152f35b600435906001600160a01b0382168203610ac057565b600080fd5b602435906001600160a01b0382168203610ac057565b6040906003190112610ac0576004359060243590565b6040810190811067ffffffffffffffff821117610b0d57604052565b634e487b7160e01b600052604160045260246000fd5b6080810190811067ffffffffffffffff821117610b0d57604052565b60405190610b4c82610af1565b601f82527f63616c6c657220686173206e6f7420746865207570646174657220726f6c65006020830152565b6020808252825181830181905290939260005b828110610bad57505060409293506000838284010152601f8019910116010190565b818101860151848201604001528501610b8b565b15610bc95750565b60405162461bcd60e51b8152908190610be59060048301610b78565b0390fd5b60405190610bf682610af1565b600f82526e1b9bc81c195b991a5b99c81c9bdbdd608a1b6020830152565b91929015610c765750815115610c28575090565b3b15610c315790565b60405162461bcd60e51b815260206004820152601d60248201527f416464726573733a2063616c6c20746f206e6f6e2d636f6e74726163740000006044820152606490fd5b825190915015610bc95750805190602001fd5b60405190610c9682610af1565b600b82526a185b1c9958591e481cd95d60aa1b6020830152565b60405190610cbd82610af1565b601782527f63616c6c6572206973206e6f7420746865206f776e6572000000000000000000602083015256fea2646970667358221220a506ad89f7f10922bdac9ccd1ae25467e587c04e56801b128773303f073d701664736f6c63430008130033a2646970667358221220a7f8576e2db19f8c4ce4d617cf2739180734b5114b87a13cbeb2c83d6908ad9e64736f6c63430008130033

Deployed Bytecode Sourcemap

431:1129:6:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;431:1129:6;;;;;;:::i;:::-;;;;;;;;;;;;;;1259:104;;;;;;;;;;;;;;;;;;;;;;431:1129;;;;;;;;;;;;;;;;;;;;;;;;;;;;;1259:104;;;;;;;;;431:1129;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;1464:10;1416:135;431:1129;1464:10;1416:135;;431:1129;;;;;1259:104;431:1129;;;;;;;;;1259:104;-1:-1:-1;;;431:1129:6;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;431:1129:6;;;;;;;;;-1:-1:-1;;;;;431:1129:6;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;431:1129:6;;;;;;:::o;:::-;;;

Swarm Source

ipfs://a7f8576e2db19f8c4ce4d617cf2739180734b5114b87a13cbeb2c83d6908ad9e

Block Transaction Difficulty Gas Used Reward
View All Blocks Produced

Block Uncle Number Difficulty Gas Used Reward
View All Uncles
Loading...
Loading

OVERVIEW

Factory for Universal Rewards Distributor.

Loading...
Loading

Validator Index Block Amount
View All Withdrawals

Transaction Hash Block Value Eth2 PubKey Valid
View All Deposits
[ Download: CSV Export  ]
[ Download: CSV Export  ]

A contract address hosts a smart contract, which is a set of code stored on the blockchain that runs when predetermined conditions are met. Learn more about addresses in our Knowledge Base.