Contract Source Code (Solidity)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

Outline

interface IERC20Errors interface IERC721Errors interface IERC1155Errors interface IERC20    - function totalSupply()    - function balanceOf(address account)    - function transfer(address to, uint256 ...    - function allowance(address owner, add ...    - function approve(address spender, uin ...    - function transferFrom(address from, a ...    - function _msgSender()    - function _msgData()    - function _contextSuffixLength() library Hashes    - function commutativeKeccak256(bytes32 ...    - function _efficientKeccak256(bytes32 ...    - function owner()    - function _checkOwner()    - function renounceOwnership()    - function transferOwnership(address ne ...    - function _transferOwnership(address n ... interface IERC20Metadata is IERC20    - function name()    - function symbol()    - function decimals() library MerkleProof    - function verify(bytes32[] memory proo ...    - function processProof(bytes32[] memor ...    - function verify(    - function(bytes32, bytes32)    - function processProof(    - function(bytes32, bytes32)    - function verifyCalldata(bytes32[] cal ...    - function processProofCalldata(bytes32 ...    - function verifyCalldata(    - function(bytes32, bytes32)    - function processProofCalldata(    - function(bytes32, bytes32)    - function multiProofVerify(    - function processMultiProof(    - function multiProofVerify(    - function(bytes32, bytes32)    - function processMultiProof(    - function(bytes32, bytes32)    - function multiProofVerifyCalldata(    - function processMultiProofCalldata(    - function multiProofVerifyCalldata(    - function(bytes32, bytes32)    - function processMultiProofCalldata(    - function(bytes32, bytes32)    - function name()    - function symbol()    - function decimals()    - function totalSupply()    - function balanceOf(address account)    - function transfer(address to, uint256 ...    - function allowance(address owner, add ...    - function approve(address spender, uin ...    - function transferFrom(address from, a ...    - function _transfer(address from, addr ...    - function _update(address from, addres ...    - function _mint(address account, uint2 ...    - function _burn(address account, uint2 ...    - function _approve(address owner, addr ...    - function _approve(address owner, addr ...    - function _spendAllowance(address owne ...  contract Piggy is ERC20, Ownable *    - function isEligibleForClaim(    - function delegateClaimTokens(address ...    - function removeDelegatee(address user ...    - function claimTokens(address user, ui ...    - function setMerkleRoot(bytes32 _merkl ...    - function lockMerkleRoot()    - function burnUnclaimedTokens()    - function sendToSlopBucket(address slo ...

More Options

• Similar
• Submit Audit
• Compare

/**
 *Submitted for verification at basescan.org on 2024-11-25
*/

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

// lib/openzeppelin-contracts/contracts/interfaces/draft-IERC6093.sol

// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/draft-IERC6093.sol)

/**
 * @dev Standard ERC-20 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-20 tokens.
 */
interface IERC20Errors {
    /**
     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param balance Current balance for the interacting account.
     * @param needed Minimum amount required to perform a transfer.
     */
    error ERC20InsufficientBalance(address sender, uint256 balance, uint256 needed);

    /**
     * @dev Indicates a failure with the token `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     */
    error ERC20InvalidSender(address sender);

    /**
     * @dev Indicates a failure with the token `receiver`. Used in transfers.
     * @param receiver Address to which tokens are being transferred.
     */
    error ERC20InvalidReceiver(address receiver);

    /**
     * @dev Indicates a failure with the `spender`’s `allowance`. Used in transfers.
     * @param spender Address that may be allowed to operate on tokens without being their owner.
     * @param allowance Amount of tokens a `spender` is allowed to operate with.
     * @param needed Minimum amount required to perform a transfer.
     */
    error ERC20InsufficientAllowance(address spender, uint256 allowance, uint256 needed);

    /**
     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
     * @param approver Address initiating an approval operation.
     */
    error ERC20InvalidApprover(address approver);

    /**
     * @dev Indicates a failure with the `spender` to be approved. Used in approvals.
     * @param spender Address that may be allowed to operate on tokens without being their owner.
     */
    error ERC20InvalidSpender(address spender);
}

/**
 * @dev Standard ERC-721 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-721 tokens.
 */
interface IERC721Errors {
    /**
     * @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in ERC-20.
     * Used in balance queries.
     * @param owner Address of the current owner of a token.
     */
    error ERC721InvalidOwner(address owner);

    /**
     * @dev Indicates a `tokenId` whose `owner` is the zero address.
     * @param tokenId Identifier number of a token.
     */
    error ERC721NonexistentToken(uint256 tokenId);

    /**
     * @dev Indicates an error related to the ownership over a particular token. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param tokenId Identifier number of a token.
     * @param owner Address of the current owner of a token.
     */
    error ERC721IncorrectOwner(address sender, uint256 tokenId, address owner);

    /**
     * @dev Indicates a failure with the token `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     */
    error ERC721InvalidSender(address sender);

    /**
     * @dev Indicates a failure with the token `receiver`. Used in transfers.
     * @param receiver Address to which tokens are being transferred.
     */
    error ERC721InvalidReceiver(address receiver);

    /**
     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     * @param tokenId Identifier number of a token.
     */
    error ERC721InsufficientApproval(address operator, uint256 tokenId);

    /**
     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
     * @param approver Address initiating an approval operation.
     */
    error ERC721InvalidApprover(address approver);

    /**
     * @dev Indicates a failure with the `operator` to be approved. Used in approvals.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     */
    error ERC721InvalidOperator(address operator);
}

/**
 * @dev Standard ERC-1155 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-1155 tokens.
 */
interface IERC1155Errors {
    /**
     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param balance Current balance for the interacting account.
     * @param needed Minimum amount required to perform a transfer.
     * @param tokenId Identifier number of a token.
     */
    error ERC1155InsufficientBalance(address sender, uint256 balance, uint256 needed, uint256 tokenId);

    /**
     * @dev Indicates a failure with the token `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     */
    error ERC1155InvalidSender(address sender);

    /**
     * @dev Indicates a failure with the token `receiver`. Used in transfers.
     * @param receiver Address to which tokens are being transferred.
     */
    error ERC1155InvalidReceiver(address receiver);

    /**
     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     * @param owner Address of the current owner of a token.
     */
    error ERC1155MissingApprovalForAll(address operator, address owner);

    /**
     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
     * @param approver Address initiating an approval operation.
     */
    error ERC1155InvalidApprover(address approver);

    /**
     * @dev Indicates a failure with the `operator` to be approved. Used in approvals.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     */
    error ERC1155InvalidOperator(address operator);

    /**
     * @dev Indicates an array length mismatch between ids and values in a safeBatchTransferFrom operation.
     * Used in batch transfers.
     * @param idsLength Length of the array of token identifiers
     * @param valuesLength Length of the array of token amounts
     */
    error ERC1155InvalidArrayLength(uint256 idsLength, uint256 valuesLength);
}

// lib/openzeppelin-contracts/contracts/token/ERC20/IERC20.sol

// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)

/**
 * @dev Interface of the ERC-20 standard as defined in the ERC.
 */
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 value of tokens in existence.
     */
    function totalSupply() external view returns (uint256);

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

    /**
     * @dev Moves a `value` amount of 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 value) 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 a `value` amount of tokens 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 value) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to` using the
     * allowance mechanism. `value` 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 value) external returns (bool);
}

// lib/openzeppelin-contracts/contracts/utils/Context.sol

// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)

/**
 * @dev Provides information about the current execution context, including the
 * sender of the transaction and its data. While these are generally available
 * via msg.sender and msg.data, they should not be accessed in such a direct
 * manner, since when dealing with meta-transactions the account sending and
 * paying for execution may not be the actual sender (as far as an application
 * is concerned).
 *
 * This contract is only required for intermediate, library-like contracts.
 */
abstract contract Context {
    function _msgSender() internal view virtual returns (address) {
        return msg.sender;
    }

    function _msgData() internal view virtual returns (bytes calldata) {
        return msg.data;
    }

    function _contextSuffixLength() internal view virtual returns (uint256) {
        return 0;
    }
}

// lib/openzeppelin-contracts/contracts/utils/cryptography/Hashes.sol

// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/Hashes.sol)

/**
 * @dev Library of standard hash functions.
 *
 * _Available since v5.1._
 */
library Hashes {
    /**
     * @dev Commutative Keccak256 hash of a sorted pair of bytes32. Frequently used when working with merkle proofs.
     *
     * NOTE: Equivalent to the `standardNodeHash` in our https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
     */
    function commutativeKeccak256(bytes32 a, bytes32 b) internal pure returns (bytes32) {
        return a < b ? _efficientKeccak256(a, b) : _efficientKeccak256(b, a);
    }

    /**
     * @dev Implementation of keccak256(abi.encode(a, b)) that doesn't allocate or expand memory.
     */
    function _efficientKeccak256(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
        assembly ("memory-safe") {
            mstore(0x00, a)
            mstore(0x20, b)
            value := keccak256(0x00, 0x40)
        }
    }
}

// lib/openzeppelin-contracts/contracts/access/Ownable.sol

// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)

/**
 * @dev Contract module which provides a basic access control mechanism, where
 * there is an account (an owner) that can be granted exclusive access to
 * specific functions.
 *
 * The initial owner is set to the address provided by the deployer. This can
 * later be changed with {transferOwnership}.
 *
 * This module is used through inheritance. It will make available the modifier
 * `onlyOwner`, which can be applied to your functions to restrict their use to
 * the owner.
 */
abstract contract Ownable is Context {
    address private _owner;

    /**
     * @dev The caller account is not authorized to perform an operation.
     */
    error OwnableUnauthorizedAccount(address account);

    /**
     * @dev The owner is not a valid owner account. (eg. `address(0)`)
     */
    error OwnableInvalidOwner(address owner);

    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);

    /**
     * @dev Initializes the contract setting the address provided by the deployer as the initial owner.
     */
    constructor(address initialOwner) {
        if (initialOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _transferOwnership(initialOwner);
    }

    /**
     * @dev Throws if called by any account other than the owner.
     */
    modifier onlyOwner() {
        _checkOwner();
        _;
    }

    /**
     * @dev Returns the address of the current owner.
     */
    function owner() public view virtual returns (address) {
        return _owner;
    }

    /**
     * @dev Throws if the sender is not the owner.
     */
    function _checkOwner() internal view virtual {
        if (owner() != _msgSender()) {
            revert OwnableUnauthorizedAccount(_msgSender());
        }
    }

    /**
     * @dev Leaves the contract without owner. It will not be possible to call
     * `onlyOwner` functions. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby disabling any functionality that is only available to the owner.
     */
    function renounceOwnership() public virtual onlyOwner {
        _transferOwnership(address(0));
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        if (newOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _transferOwnership(newOwner);
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Internal function without access restriction.
     */
    function _transferOwnership(address newOwner) internal virtual {
        address oldOwner = _owner;
        _owner = newOwner;
        emit OwnershipTransferred(oldOwner, newOwner);
    }
}

// lib/openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol

// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/extensions/IERC20Metadata.sol)

/**
 * @dev Interface for the optional metadata functions from the ERC-20 standard.
 */
interface IERC20Metadata is IERC20 {
    /**
     * @dev Returns the name of the token.
     */
    function name() external view returns (string memory);

    /**
     * @dev Returns the symbol of the token.
     */
    function symbol() external view returns (string memory);

    /**
     * @dev Returns the decimals places of the token.
     */
    function decimals() external view returns (uint8);
}

// lib/openzeppelin-contracts/contracts/utils/cryptography/MerkleProof.sol

// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/MerkleProof.sol)
// This file was procedurally generated from scripts/generate/templates/MerkleProof.js.

/**
 * @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.
 *
 * IMPORTANT: Consider memory side-effects when using custom hashing functions
 * that access memory in an unsafe way.
 *
 * NOTE: This library supports proof verification for merkle trees built using
 * custom _commutative_ hashing functions (i.e. `H(a, b) == H(b, a)`). Proving
 * leaf inclusion in trees built using non-commutative hashing functions requires
 * additional logic that is not supported by this library.
 */
library MerkleProof {
    /**
     *@dev The multiproof provided is not valid.
     */
    error MerkleProofInvalidMultiproof();

    /**
     * @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.
     *
     * This version handles proofs in memory with the default hashing function.
     */
    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProof(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 leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with the default hashing function.
     */
    function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @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.
     *
     * This version handles proofs in memory with a custom hashing function.
     */
    function verify(
        bytes32[] memory proof,
        bytes32 root,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processProof(proof, leaf, hasher) == 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 leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with a custom hashing function.
     */
    function processProof(
        bytes32[] memory proof,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = hasher(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @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.
     *
     * This version handles proofs in calldata with the default hashing function.
     */
    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 leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with the default hashing function.
     */
    function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @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.
     *
     * This version handles proofs in calldata with a custom hashing function.
     */
    function verifyCalldata(
        bytes32[] calldata proof,
        bytes32 root,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processProofCalldata(proof, leaf, hasher) == 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 leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with a custom hashing function.
     */
    function processProofCalldata(
        bytes32[] calldata proof,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = hasher(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}.
     *
     * This version handles multiproofs in memory with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProof}.
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProof(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.
     *
     * This version handles multiproofs in memory with the default hashing function.
     *
     * 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).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    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 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // 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[](proofFlagsLen);
        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 < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = Hashes.commutativeKeccak256(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @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}.
     *
     * This version handles multiproofs in memory with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProof}.
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processMultiProof(proof, proofFlags, leaves, hasher) == 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.
     *
     * This version handles multiproofs in memory with a custom hashing function.
     *
     * 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).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view 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 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // 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[](proofFlagsLen);
        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 < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = hasher(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @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}.
     *
     * This version handles multiproofs in calldata with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProofCalldata}.
     */
    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.
     *
     * This version handles multiproofs in calldata with the default hashing function.
     *
     * 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).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    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 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // 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[](proofFlagsLen);
        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 < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = Hashes.commutativeKeccak256(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @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}.
     *
     * This version handles multiproofs in calldata with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProofCalldata}.
     */
    function multiProofVerifyCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32 root,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processMultiProofCalldata(proof, proofFlags, leaves, hasher) == 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.
     *
     * This version handles multiproofs in calldata with a custom hashing function.
     *
     * 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).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view 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 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // 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[](proofFlagsLen);
        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 < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = hasher(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }
}

// lib/openzeppelin-contracts/contracts/token/ERC20/ERC20.sol

// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/ERC20.sol)

/**
 * @dev Implementation of the {IERC20} interface.
 *
 * This implementation is agnostic to the way tokens are created. This means
 * that a supply mechanism has to be added in a derived contract using {_mint}.
 *
 * TIP: For a detailed writeup see our guide
 * https://forum.openzeppelin.com/t/how-to-implement-erc20-supply-mechanisms/226[How
 * to implement supply mechanisms].
 *
 * The default value of {decimals} is 18. To change this, you should override
 * this function so it returns a different value.
 *
 * We have followed general OpenZeppelin Contracts guidelines: functions revert
 * instead returning `false` on failure. This behavior is nonetheless
 * conventional and does not conflict with the expectations of ERC-20
 * applications.
 */
abstract contract ERC20 is Context, IERC20, IERC20Metadata, IERC20Errors {
    mapping(address account => uint256) private _balances;

    mapping(address account => mapping(address spender => uint256)) private _allowances;

    uint256 private _totalSupply;

    string private _name;
    string private _symbol;

    /**
     * @dev Sets the values for {name} and {symbol}.
     *
     * All two of these values are immutable: they can only be set once during
     * construction.
     */
    constructor(string memory name_, string memory symbol_) {
        _name = name_;
        _symbol = symbol_;
    }

    /**
     * @dev Returns the name of the token.
     */
    function name() public view virtual returns (string memory) {
        return _name;
    }

    /**
     * @dev Returns the symbol of the token, usually a shorter version of the
     * name.
     */
    function symbol() public view virtual returns (string memory) {
        return _symbol;
    }

    /**
     * @dev Returns the number of decimals used to get its user representation.
     * For example, if `decimals` equals `2`, a balance of `505` tokens should
     * be displayed to a user as `5.05` (`505 / 10 ** 2`).
     *
     * Tokens usually opt for a value of 18, imitating the relationship between
     * Ether and Wei. This is the default value returned by this function, unless
     * it's overridden.
     *
     * NOTE: This information is only used for _display_ purposes: it in
     * no way affects any of the arithmetic of the contract, including
     * {IERC20-balanceOf} and {IERC20-transfer}.
     */
    function decimals() public view virtual returns (uint8) {
        return 18;
    }

    /**
     * @dev See {IERC20-totalSupply}.
     */
    function totalSupply() public view virtual returns (uint256) {
        return _totalSupply;
    }

    /**
     * @dev See {IERC20-balanceOf}.
     */
    function balanceOf(address account) public view virtual returns (uint256) {
        return _balances[account];
    }

    /**
     * @dev See {IERC20-transfer}.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - the caller must have a balance of at least `value`.
     */
    function transfer(address to, uint256 value) public virtual returns (bool) {
        address owner = _msgSender();
        _transfer(owner, to, value);
        return true;
    }

    /**
     * @dev See {IERC20-allowance}.
     */
    function allowance(address owner, address spender) public view virtual returns (uint256) {
        return _allowances[owner][spender];
    }

    /**
     * @dev See {IERC20-approve}.
     *
     * NOTE: If `value` is the maximum `uint256`, the allowance is not updated on
     * `transferFrom`. This is semantically equivalent to an infinite approval.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     */
    function approve(address spender, uint256 value) public virtual returns (bool) {
        address owner = _msgSender();
        _approve(owner, spender, value);
        return true;
    }

    /**
     * @dev See {IERC20-transferFrom}.
     *
     * Skips emitting an {Approval} event indicating an allowance update. This is not
     * required by the ERC. See {xref-ERC20-_approve-address-address-uint256-bool-}[_approve].
     *
     * NOTE: Does not update the allowance if the current allowance
     * is the maximum `uint256`.
     *
     * Requirements:
     *
     * - `from` and `to` cannot be the zero address.
     * - `from` must have a balance of at least `value`.
     * - the caller must have allowance for ``from``'s tokens of at least
     * `value`.
     */
    function transferFrom(address from, address to, uint256 value) public virtual returns (bool) {
        address spender = _msgSender();
        _spendAllowance(from, spender, value);
        _transfer(from, to, value);
        return true;
    }

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to`.
     *
     * This internal function is equivalent to {transfer}, and can be used to
     * e.g. implement automatic token fees, slashing mechanisms, etc.
     *
     * Emits a {Transfer} event.
     *
     * NOTE: This function is not virtual, {_update} should be overridden instead.
     */
    function _transfer(address from, address to, uint256 value) internal {
        if (from == address(0)) {
            revert ERC20InvalidSender(address(0));
        }
        if (to == address(0)) {
            revert ERC20InvalidReceiver(address(0));
        }
        _update(from, to, value);
    }

    /**
     * @dev Transfers a `value` amount of tokens from `from` to `to`, or alternatively mints (or burns) if `from`
     * (or `to`) is the zero address. All customizations to transfers, mints, and burns should be done by overriding
     * this function.
     *
     * Emits a {Transfer} event.
     */
    function _update(address from, address to, uint256 value) internal virtual {
        if (from == address(0)) {
            // Overflow check required: The rest of the code assumes that totalSupply never overflows
            _totalSupply += value;
        } else {
            uint256 fromBalance = _balances[from];
            if (fromBalance < value) {
                revert ERC20InsufficientBalance(from, fromBalance, value);
            }
            unchecked {
                // Overflow not possible: value <= fromBalance <= totalSupply.
                _balances[from] = fromBalance - value;
            }
        }

        if (to == address(0)) {
            unchecked {
                // Overflow not possible: value <= totalSupply or value <= fromBalance <= totalSupply.
                _totalSupply -= value;
            }
        } else {
            unchecked {
                // Overflow not possible: balance + value is at most totalSupply, which we know fits into a uint256.
                _balances[to] += value;
            }
        }

        emit Transfer(from, to, value);
    }

    /**
     * @dev Creates a `value` amount of tokens and assigns them to `account`, by transferring it from address(0).
     * Relies on the `_update` mechanism
     *
     * Emits a {Transfer} event with `from` set to the zero address.
     *
     * NOTE: This function is not virtual, {_update} should be overridden instead.
     */
    function _mint(address account, uint256 value) internal {
        if (account == address(0)) {
            revert ERC20InvalidReceiver(address(0));
        }
        _update(address(0), account, value);
    }

    /**
     * @dev Destroys a `value` amount of tokens from `account`, lowering the total supply.
     * Relies on the `_update` mechanism.
     *
     * Emits a {Transfer} event with `to` set to the zero address.
     *
     * NOTE: This function is not virtual, {_update} should be overridden instead
     */
    function _burn(address account, uint256 value) internal {
        if (account == address(0)) {
            revert ERC20InvalidSender(address(0));
        }
        _update(account, address(0), value);
    }

    /**
     * @dev Sets `value` as the allowance of `spender` over the `owner` s tokens.
     *
     * This internal function is equivalent to `approve`, and can be used to
     * e.g. set automatic allowances for certain subsystems, etc.
     *
     * Emits an {Approval} event.
     *
     * Requirements:
     *
     * - `owner` cannot be the zero address.
     * - `spender` cannot be the zero address.
     *
     * Overrides to this logic should be done to the variant with an additional `bool emitEvent` argument.
     */
    function _approve(address owner, address spender, uint256 value) internal {
        _approve(owner, spender, value, true);
    }

    /**
     * @dev Variant of {_approve} with an optional flag to enable or disable the {Approval} event.
     *
     * By default (when calling {_approve}) the flag is set to true. On the other hand, approval changes made by
     * `_spendAllowance` during the `transferFrom` operation set the flag to false. This saves gas by not emitting any
     * `Approval` event during `transferFrom` operations.
     *
     * Anyone who wishes to continue emitting `Approval` events on the`transferFrom` operation can force the flag to
     * true using the following override:
     *
     * ```solidity
     * function _approve(address owner, address spender, uint256 value, bool) internal virtual override {
     *     super._approve(owner, spender, value, true);
     * }
     * ```
     *
     * Requirements are the same as {_approve}.
     */
    function _approve(address owner, address spender, uint256 value, bool emitEvent) internal virtual {
        if (owner == address(0)) {
            revert ERC20InvalidApprover(address(0));
        }
        if (spender == address(0)) {
            revert ERC20InvalidSpender(address(0));
        }
        _allowances[owner][spender] = value;
        if (emitEvent) {
            emit Approval(owner, spender, value);
        }
    }

    /**
     * @dev Updates `owner` s allowance for `spender` based on spent `value`.
     *
     * Does not update the allowance value in case of infinite allowance.
     * Revert if not enough allowance is available.
     *
     * Does not emit an {Approval} event.
     */
    function _spendAllowance(address owner, address spender, uint256 value) internal virtual {
        uint256 currentAllowance = allowance(owner, spender);
        if (currentAllowance != type(uint256).max) {
            if (currentAllowance < value) {
                revert ERC20InsufficientAllowance(spender, currentAllowance, value);
            }
            unchecked {
                _approve(owner, spender, currentAllowance - value, false);
            }
        }
    }
}

// src/Piggy.sol

// external

contract Piggy is ERC20, Ownable {
    bytes32 public merkleRoot;
    bool public isMerkleRootLocked;
    uint256 public constant TOTAL_SUPPLY = 69_000_000_000 * 10 ** 18;
    bool public hasSentToSlopBucket = false;
    uint256 public constant SLOP_BUCKET_ALLOCATION = 6_900_000_000 * 10 ** 18;
    mapping(address => bool) public hasClaimed;
    mapping(address => address) public delegatee;

    event MerkleRootLocked();
    event TokensBurned(uint256 amount);
    event MerkleRootSet(bytes32 merkleRoot);
    event TokensClaimed(address indexed user, uint256 amount);
    event SlopBucketTokensSent(address indexed slopBucket, uint256 amount);
    event TokensDelegated(address indexed delegator, address indexed delegatee);

    error MERKLE_ROOT_LOCKED();
    error MERKLE_ROOT_NOT_SET();
    error INVALID_USER_ADDRESS();
    error INVALID_MERKLE_PROOF();
    error TOKENS_ALREADY_CLAIMED();
    error INVALID_SLOPE_BUCKET_ADDRESS();
    error TOKENS_ALREADY_SENT_TO_SLOPE_BUCKET();
    error CANNOT_BURN_UNTIL_MERKLE_ROOT_IS_LOCKED();
    error CANNOT_BURN_UNLESS_SLOPE_BUCKET_HAS_RECEIVED_TOKENS();

    constructor(address initialOwner) Ownable(initialOwner) ERC20("PIGGY", "PIGGY") {
        _mint(address(this), TOTAL_SUPPLY);
    }

    /**
     * @dev Check if a user can claim tokens given a Merkle proof.
     * @param user The address of the user to claim tokens for.
     * @param amount The amount of tokens the user is eligible to claim.
     * @param merkleProof The Merkle proof that verifies the user and amount are in the Merkle tree.
     */
    function isEligibleForClaim(
        address user,
        uint256 amount,
        bytes32[] calldata merkleProof
    )
        external
        view
        returns (bool)
    {
        if (hasClaimed[user]) return false;
        bytes32 leaf = keccak256(bytes.concat(keccak256(abi.encode(user, amount))));

        return MerkleProof.verify(merkleProof, merkleRoot, leaf);
    }

    /**
     * @dev Allows a user to delegate their claim tokens to another user.
     * @param user The address of the user to delegate tokens to.
     */
    function delegateClaimTokens(address user, address newDelegatee) external onlyOwner {
        require(user != address(0), INVALID_USER_ADDRESS());
        require(newDelegatee != address(0), INVALID_USER_ADDRESS());

        delegatee[user] = newDelegatee;
        emit TokensDelegated(user, newDelegatee);
    }

    /**
     * @dev Allows a user to remove their delegatee.
     */
    function removeDelegatee(address user) external onlyOwner {
        delete delegatee[user];
        emit TokensDelegated(user, address(0));
    }

    /**
     * @dev Claims tokens for a given user address if the Merkle proof is valid.
     * @param user The address of the user to claim tokens for.
     * @param amount The amount of tokens the user is eligible to claim.
     * @param merkleProof The Merkle proof that verifies the user and amount are in the Merkle tree.
     */
    function claimTokens(address user, uint256 amount, bytes32[] calldata merkleProof) external {
        require(user == msg.sender || delegatee[user] == msg.sender, INVALID_USER_ADDRESS());
        require(merkleRoot != bytes32(0), MERKLE_ROOT_NOT_SET());
        require(!hasClaimed[user], TOKENS_ALREADY_CLAIMED());
        bytes32 leaf = keccak256(bytes.concat(keccak256(abi.encode(user, amount))));
        require(MerkleProof.verify(merkleProof, merkleRoot, leaf), INVALID_MERKLE_PROOF());
        hasClaimed[user] = true;
        _transfer(address(this), user, amount);
        emit TokensClaimed(user, amount);
    }

    /**
     * @dev Allows the owner to set the Merkle root if it has not been locked.
     * @param _merkleRoot The Merkle root to set.
     */
    function setMerkleRoot(bytes32 _merkleRoot) external onlyOwner {
        require(!isMerkleRootLocked, MERKLE_ROOT_LOCKED());
        merkleRoot = _merkleRoot;
        emit MerkleRootSet(_merkleRoot);
    }

    /**
     * @dev Locks the Merkle root to prevent further updates. This action is irreversible.
     */
    function lockMerkleRoot() external onlyOwner {
        isMerkleRootLocked = true;
        emit MerkleRootLocked();
    }

    /**
     * @dev Burns any unclaimed tokens at the end of the BANK open period.
     * This function can only be called if the Merkle root is locked.
     */
    function burnUnclaimedTokens() external onlyOwner {
        require(isMerkleRootLocked, CANNOT_BURN_UNTIL_MERKLE_ROOT_IS_LOCKED());
        require(hasSentToSlopBucket, CANNOT_BURN_UNLESS_SLOPE_BUCKET_HAS_RECEIVED_TOKENS());
        uint256 remainingBalance = balanceOf(address(this));
        _burn(address(this), remainingBalance);
        emit TokensBurned(remainingBalance);
    }

    /**
     * @dev Sends slop bucket allocation to the SlopBucket.
     * @param slopBucketAddress The address of the SlopBucket contract.
     */
    function sendToSlopBucket(address slopBucketAddress) external onlyOwner {
        require(!hasSentToSlopBucket, TOKENS_ALREADY_SENT_TO_SLOPE_BUCKET());
        require(slopBucketAddress != address(0), INVALID_SLOPE_BUCKET_ADDRESS());
        hasSentToSlopBucket = true;
        _transfer(address(this), slopBucketAddress, SLOP_BUCKET_ALLOCATION);
        emit SlopBucketTokensSent(slopBucketAddress, SLOP_BUCKET_ALLOCATION);
    }
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"initialOwner","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"CANNOT_BURN_UNLESS_SLOPE_BUCKET_HAS_RECEIVED_TOKENS","type":"error"},{"inputs":[],"name":"CANNOT_BURN_UNTIL_MERKLE_ROOT_IS_LOCKED","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"allowance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientAllowance","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"balance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientBalance","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC20InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC20InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC20InvalidSender","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"}],"name":"ERC20InvalidSpender","type":"error"},{"inputs":[],"name":"INVALID_MERKLE_PROOF","type":"error"},{"inputs":[],"name":"INVALID_SLOPE_BUCKET_ADDRESS","type":"error"},{"inputs":[],"name":"INVALID_USER_ADDRESS","type":"error"},{"inputs":[],"name":"MERKLE_ROOT_LOCKED","type":"error"},{"inputs":[],"name":"MERKLE_ROOT_NOT_SET","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[],"name":"TOKENS_ALREADY_CLAIMED","type":"error"},{"inputs":[],"name":"TOKENS_ALREADY_SENT_TO_SLOPE_BUCKET","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"spender","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[],"name":"MerkleRootLocked","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"bytes32","name":"merkleRoot","type":"bytes32"}],"name":"MerkleRootSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"slopBucket","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"SlopBucketTokensSent","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"TokensBurned","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"TokensClaimed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"delegator","type":"address"},{"indexed":true,"internalType":"address","name":"delegatee","type":"address"}],"name":"TokensDelegated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"SLOP_BUCKET_ALLOCATION","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"TOTAL_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"spender","type":"address"}],"name":"allowance","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"approve","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"burnUnclaimedTokens","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"bytes32[]","name":"merkleProof","type":"bytes32[]"}],"name":"claimTokens","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"decimals","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"},{"internalType":"address","name":"newDelegatee","type":"address"}],"name":"delegateClaimTokens","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"delegatee","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"hasClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"hasSentToSlopBucket","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"bytes32[]","name":"merkleProof","type":"bytes32[]"}],"name":"isEligibleForClaim","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isMerkleRootLocked","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"lockMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"merkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"}],"name":"removeDelegatee","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"slopBucketAddress","type":"address"}],"name":"sendToSlopBucket","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"}],"name":"setMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transfer","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transferFrom","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60806040526007805461ff001916905534801561001a575f5ffd5b50604051611aec380380611aec83398101604081905261003991610288565b604080518082018252600580825264504947475960d81b602080840182905284518086019095529184529083015282916003610075838261034d565b506004610082828261034d565b5050506001600160a01b0381166100b357604051631e4fbdf760e01b81525f60048201526024015b60405180910390fd5b6100bc816100d9565b506100d3306bdef376571332906a8800000061012a565b5061042c565b600580546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b6001600160a01b0382166101535760405163ec442f0560e01b81525f60048201526024016100aa565b61015e5f8383610162565b5050565b6001600160a01b03831661018c578060025f8282546101819190610407565b909155506101fc9050565b6001600160a01b0383165f90815260208190526040902054818110156101de5760405163391434e360e21b81526001600160a01b038516600482015260248101829052604481018390526064016100aa565b6001600160a01b0384165f9081526020819052604090209082900390555b6001600160a01b03821661021857600280548290039055610236565b6001600160a01b0382165f9081526020819052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8360405161027b91815260200190565b60405180910390a3505050565b5f60208284031215610298575f5ffd5b81516001600160a01b03811681146102ae575f5ffd5b9392505050565b634e487b7160e01b5f52604160045260245ffd5b600181811c908216806102dd57607f821691505b6020821081036102fb57634e487b7160e01b5f52602260045260245ffd5b50919050565b601f82111561034857805f5260205f20601f840160051c810160208510156103265750805b601f840160051c820191505b81811015610345575f8155600101610332565b50505b505050565b81516001600160401b03811115610366576103666102b5565b61037a8161037484546102c9565b84610301565b6020601f8211600181146103ac575f83156103955750848201515b5f19600385901b1c1916600184901b178455610345565b5f84815260208120601f198516915b828110156103db57878501518255602094850194600190920191016103bb565b50848210156103f857868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b8082018082111561042657634e487b7160e01b5f52601160045260245ffd5b92915050565b6116b3806104395f395ff3fe608060405234801561000f575f5ffd5b50600436106101b0575f3560e01c806373b2e80e116100f35780639df4161c11610093578063cfb4a1fc1161006e578063cfb4a1fc146103c7578063daa69f48146103da578063dd62ed3e146103ed578063f2fde38b14610432575f5ffd5b80639df4161c14610395578063a9059cbb146103a7578063bc77896e146103ba575f5ffd5b80638da5cb5b116100ce5780638da5cb5b14610349578063902d55a514610367578063925179291461037a57806395d89b411461038d575f5ffd5b806373b2e80e1461030c57806376ad28171461032e5780637cb6475914610336575f5ffd5b8063313ce5671161015e5780636ba85791116101395780636ba85791146102b457806370a08231146102c757806370a16aa7146102fc578063715018a614610304575f5ffd5b8063313ce567146102385780633723122414610247578063534cc346146102a1575f5ffd5b806318160ddd1161018e57806318160ddd1461020a57806323b872dd1461021c5780632eb4a7ab1461022f575f5ffd5b806305489558146101b457806306fdde03146101c9578063095ea7b3146101e7575b5f5ffd5b6101c76101c236600461142b565b610445565b005b6101d16104c4565b6040516101de9190611444565b60405180910390f35b6101fa6101f5366004611497565b610554565b60405190151581526020016101de565b6002545b6040519081526020016101de565b6101fa61022a3660046114bf565b61056d565b61020e60065481565b604051601281526020016101de565b61027c61025536600461142b565b60096020525f908152604090205473ffffffffffffffffffffffffffffffffffffffff1681565b60405173ffffffffffffffffffffffffffffffffffffffff90911681526020016101de565b6101c76102af3660046114f9565b610590565b6101fa6102c236600461152a565b6106ad565b61020e6102d536600461142b565b73ffffffffffffffffffffffffffffffffffffffff165f9081526020819052604090205490565b6101c76107ab565b6101c7610881565b6101fa61031a36600461142b565b60086020525f908152604090205460ff1681565b6101c7610894565b6101c76103443660046115b0565b6108f1565b60055473ffffffffffffffffffffffffffffffffffffffff1661027c565b61020e6bdef376571332906a8800000081565b6101c761038836600461142b565b61096b565b6101d1610aa4565b6007546101fa90610100900460ff1681565b6101fa6103b5366004611497565b610ab3565b6007546101fa9060ff1681565b6101c76103d536600461152a565b610ac0565b61020e6b164b8bd581eb74d77400000081565b61020e6103fb3660046114f9565b73ffffffffffffffffffffffffffffffffffffffff9182165f90815260016020908152604080832093909416825291909152205490565b6101c761044036600461142b565b610d7a565b61044d610de2565b73ffffffffffffffffffffffffffffffffffffffff81165f8181526009602052604080822080547fffffffffffffffffffffffff0000000000000000000000000000000000000000169055519091907f449f833e3109bcd76b17c6283c4cd3ff7f62a578a1d736113b4867c9a4c4d05e908390a350565b6060600380546104d3906115c7565b80601f01602080910402602001604051908101604052809291908181526020018280546104ff906115c7565b801561054a5780601f106105215761010080835404028352916020019161054a565b820191905f5260205f20905b81548152906001019060200180831161052d57829003601f168201915b5050505050905090565b5f33610561818585610e35565b60019150505b92915050565b5f3361057a858285610e47565b610585858585610f14565b506001949350505050565b610598610de2565b73ffffffffffffffffffffffffffffffffffffffff82166105e5576040517f47cd4b8200000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff8116610632576040517f47cd4b8200000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff8281165f8181526009602052604080822080547fffffffffffffffffffffffff0000000000000000000000000000000000000000169486169485179055517f449f833e3109bcd76b17c6283c4cd3ff7f62a578a1d736113b4867c9a4c4d05e9190a35050565b73ffffffffffffffffffffffffffffffffffffffff84165f9081526008602052604081205460ff16156106e157505f6107a3565b6040805173ffffffffffffffffffffffffffffffffffffffff871660208201529081018590525f90606001604080517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe08184030181528282528051602091820120908301520160405160208183030381529060405280519060200120905061079f8484808060200260200160405190810160405280939291908181526020018383602002808284375f92019190915250506006549150849050610fbd565b9150505b949350505050565b6107b3610de2565b60075460ff166107ef576040517fffcb95f800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600754610100900460ff16610830576040517f1c464aa400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b305f818152602081905260409020549061084a9082610fd2565b6040518181527f6ef4855b666dcc7884561072e4358b28dfe01feb1b7f4dcebc00e62d50394ac7906020015b60405180910390a150565b610889610de2565b6108925f611030565b565b61089c610de2565b600780547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff001660011790556040517f16e651760eb06614569f79ac75e08a88327100c2c2b478a5be7c54ce2a35575d905f90a1565b6108f9610de2565b60075460ff1615610936576040517fd3dbff1300000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60068190556040518181527f42cbc405e4dbf1b691e85b9a34b08ecfcf7a9ad9078bf4d645ccfa1fac11c10b90602001610876565b610973610de2565b600754610100900460ff16156109b5576040517fcc277b4400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff8116610a02576040517f32b539f700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600780547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00ff16610100179055610a4530826b164b8bd581eb74d774000000610f14565b8073ffffffffffffffffffffffffffffffffffffffff167f55aa6227b2a2096d8b8c1d9acb670dc6c28dc66bc7b7bb77073341e1690471846b164b8bd581eb74d774000000604051610a9991815260200190565b60405180910390a250565b6060600480546104d3906115c7565b5f33610561818585610f14565b73ffffffffffffffffffffffffffffffffffffffff8416331480610b09575073ffffffffffffffffffffffffffffffffffffffff8481165f908152600960205260409020541633145b610b3f576040517f47cd4b8200000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600654610b78576040517f776e2dac00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff84165f9081526008602052604090205460ff1615610bd7576040517fd632b1ca00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040805173ffffffffffffffffffffffffffffffffffffffff861660208201529081018490525f90606001604080517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe081840301815282825280516020918201209083015201604051602081830303815290604052805190602001209050610c958383808060200260200160405190810160405280939291908181526020018383602002808284375f92019190915250506006549150849050610fbd565b610ccb576040517f7d23b90100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff85165f90815260086020526040902080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00166001179055610d23308686610f14565b8473ffffffffffffffffffffffffffffffffffffffff167f896e034966eaaf1adc54acc0f257056febbd300c9e47182cf761982cf1f5e43085604051610d6b91815260200190565b60405180910390a25050505050565b610d82610de2565b73ffffffffffffffffffffffffffffffffffffffff8116610dd6576040517f1e4fbdf70000000000000000000000000000000000000000000000000000000081525f60048201526024015b60405180910390fd5b610ddf81611030565b50565b60055473ffffffffffffffffffffffffffffffffffffffff163314610892576040517f118cdaa7000000000000000000000000000000000000000000000000000000008152336004820152602401610dcd565b610e4283838360016110a6565b505050565b73ffffffffffffffffffffffffffffffffffffffff8381165f908152600160209081526040808320938616835292905220547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8114610f0e5781811015610f00576040517ffb8f41b200000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff841660048201526024810182905260448101839052606401610dcd565b610f0e84848484035f6110a6565b50505050565b73ffffffffffffffffffffffffffffffffffffffff8316610f63576040517f96c6fd1e0000000000000000000000000000000000000000000000000000000081525f6004820152602401610dcd565b73ffffffffffffffffffffffffffffffffffffffff8216610fb2576040517fec442f050000000000000000000000000000000000000000000000000000000081525f6004820152602401610dcd565b610e428383836111eb565b5f82610fc98584611392565b14949350505050565b73ffffffffffffffffffffffffffffffffffffffff8216611021576040517f96c6fd1e0000000000000000000000000000000000000000000000000000000081525f6004820152602401610dcd565b61102c825f836111eb565b5050565b6005805473ffffffffffffffffffffffffffffffffffffffff8381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b73ffffffffffffffffffffffffffffffffffffffff84166110f5576040517fe602df050000000000000000000000000000000000000000000000000000000081525f6004820152602401610dcd565b73ffffffffffffffffffffffffffffffffffffffff8316611144576040517f94280d620000000000000000000000000000000000000000000000000000000081525f6004820152602401610dcd565b73ffffffffffffffffffffffffffffffffffffffff8085165f9081526001602090815260408083209387168352929052208290558015610f0e578273ffffffffffffffffffffffffffffffffffffffff168473ffffffffffffffffffffffffffffffffffffffff167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925846040516111dd91815260200190565b60405180910390a350505050565b73ffffffffffffffffffffffffffffffffffffffff8316611222578060025f8282546112179190611618565b909155506112d29050565b73ffffffffffffffffffffffffffffffffffffffff83165f90815260208190526040902054818110156112a7576040517fe450d38c00000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff851660048201526024810182905260448101839052606401610dcd565b73ffffffffffffffffffffffffffffffffffffffff84165f9081526020819052604090209082900390555b73ffffffffffffffffffffffffffffffffffffffff82166112fb57600280548290039055611326565b73ffffffffffffffffffffffffffffffffffffffff82165f9081526020819052604090208054820190555b8173ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8360405161138591815260200190565b60405180910390a3505050565b5f81815b84518110156113cc576113c2828683815181106113b5576113b5611650565b60200260200101516113d4565b9150600101611396565b509392505050565b5f8183106113ee575f8281526020849052604090206113fc565b5f8381526020839052604090205b9392505050565b803573ffffffffffffffffffffffffffffffffffffffff81168114611426575f5ffd5b919050565b5f6020828403121561143b575f5ffd5b6113fc82611403565b602081525f82518060208401528060208501604085015e5f6040828501015260407fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f83011684010191505092915050565b5f5f604083850312156114a8575f5ffd5b6114b183611403565b946020939093013593505050565b5f5f5f606084860312156114d1575f5ffd5b6114da84611403565b92506114e860208501611403565b929592945050506040919091013590565b5f5f6040838503121561150a575f5ffd5b61151383611403565b915061152160208401611403565b90509250929050565b5f5f5f5f6060858703121561153d575f5ffd5b61154685611403565b935060208501359250604085013567ffffffffffffffff811115611568575f5ffd5b8501601f81018713611578575f5ffd5b803567ffffffffffffffff81111561158e575f5ffd5b8760208260051b84010111156115a2575f5ffd5b949793965060200194505050565b5f602082840312156115c0575f5ffd5b5035919050565b600181811c908216806115db57607f821691505b602082108103611612577f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b50919050565b80820180821115610567577f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52603260045260245ffdfea2646970667358221220b26c61a3e64ef1aae60d87d5e7f6f86074ffce78a95dec2438d61aaf3490913864736f6c634300081c0033000000000000000000000000f82f3d7df94fc2994315c32322da6238ca2a2f7f

0x608060405234801561000f575f5ffd5b50600436106101b0575f3560e01c806373b2e80e116100f35780639df4161c11610093578063cfb4a1fc1161006e578063cfb4a1fc146103c7578063daa69f48146103da578063dd62ed3e146103ed578063f2fde38b14610432575f5ffd5b80639df4161c14610395578063a9059cbb146103a7578063bc77896e146103ba575f5ffd5b80638da5cb5b116100ce5780638da5cb5b14610349578063902d55a514610367578063925179291461037a57806395d89b411461038d575f5ffd5b806373b2e80e1461030c57806376ad28171461032e5780637cb6475914610336575f5ffd5b8063313ce5671161015e5780636ba85791116101395780636ba85791146102b457806370a08231146102c757806370a16aa7146102fc578063715018a614610304575f5ffd5b8063313ce567146102385780633723122414610247578063534cc346146102a1575f5ffd5b806318160ddd1161018e57806318160ddd1461020a57806323b872dd1461021c5780632eb4a7ab1461022f575f5ffd5b806305489558146101b457806306fdde03146101c9578063095ea7b3146101e7575b5f5ffd5b6101c76101c236600461142b565b610445565b005b6101d16104c4565b6040516101de9190611444565b60405180910390f35b6101fa6101f5366004611497565b610554565b60405190151581526020016101de565b6002545b6040519081526020016101de565b6101fa61022a3660046114bf565b61056d565b61020e60065481565b604051601281526020016101de565b61027c61025536600461142b565b60096020525f908152604090205473ffffffffffffffffffffffffffffffffffffffff1681565b60405173ffffffffffffffffffffffffffffffffffffffff90911681526020016101de565b6101c76102af3660046114f9565b610590565b6101fa6102c236600461152a565b6106ad565b61020e6102d536600461142b565b73ffffffffffffffffffffffffffffffffffffffff165f9081526020819052604090205490565b6101c76107ab565b6101c7610881565b6101fa61031a36600461142b565b60086020525f908152604090205460ff1681565b6101c7610894565b6101c76103443660046115b0565b6108f1565b60055473ffffffffffffffffffffffffffffffffffffffff1661027c565b61020e6bdef376571332906a8800000081565b6101c761038836600461142b565b61096b565b6101d1610aa4565b6007546101fa90610100900460ff1681565b6101fa6103b5366004611497565b610ab3565b6007546101fa9060ff1681565b6101c76103d536600461152a565b610ac0565b61020e6b164b8bd581eb74d77400000081565b61020e6103fb3660046114f9565b73ffffffffffffffffffffffffffffffffffffffff9182165f90815260016020908152604080832093909416825291909152205490565b6101c761044036600461142b565b610d7a565b61044d610de2565b73ffffffffffffffffffffffffffffffffffffffff81165f8181526009602052604080822080547fffffffffffffffffffffffff0000000000000000000000000000000000000000169055519091907f449f833e3109bcd76b17c6283c4cd3ff7f62a578a1d736113b4867c9a4c4d05e908390a350565b6060600380546104d3906115c7565b80601f01602080910402602001604051908101604052809291908181526020018280546104ff906115c7565b801561054a5780601f106105215761010080835404028352916020019161054a565b820191905f5260205f20905b81548152906001019060200180831161052d57829003601f168201915b5050505050905090565b5f33610561818585610e35565b60019150505b92915050565b5f3361057a858285610e47565b610585858585610f14565b506001949350505050565b610598610de2565b73ffffffffffffffffffffffffffffffffffffffff82166105e5576040517f47cd4b8200000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff8116610632576040517f47cd4b8200000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff8281165f8181526009602052604080822080547fffffffffffffffffffffffff0000000000000000000000000000000000000000169486169485179055517f449f833e3109bcd76b17c6283c4cd3ff7f62a578a1d736113b4867c9a4c4d05e9190a35050565b73ffffffffffffffffffffffffffffffffffffffff84165f9081526008602052604081205460ff16156106e157505f6107a3565b6040805173ffffffffffffffffffffffffffffffffffffffff871660208201529081018590525f90606001604080517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe08184030181528282528051602091820120908301520160405160208183030381529060405280519060200120905061079f8484808060200260200160405190810160405280939291908181526020018383602002808284375f92019190915250506006549150849050610fbd565b9150505b949350505050565b6107b3610de2565b60075460ff166107ef576040517fffcb95f800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600754610100900460ff16610830576040517f1c464aa400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b305f818152602081905260409020549061084a9082610fd2565b6040518181527f6ef4855b666dcc7884561072e4358b28dfe01feb1b7f4dcebc00e62d50394ac7906020015b60405180910390a150565b610889610de2565b6108925f611030565b565b61089c610de2565b600780547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff001660011790556040517f16e651760eb06614569f79ac75e08a88327100c2c2b478a5be7c54ce2a35575d905f90a1565b6108f9610de2565b60075460ff1615610936576040517fd3dbff1300000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60068190556040518181527f42cbc405e4dbf1b691e85b9a34b08ecfcf7a9ad9078bf4d645ccfa1fac11c10b90602001610876565b610973610de2565b600754610100900460ff16156109b5576040517fcc277b4400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff8116610a02576040517f32b539f700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600780547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00ff16610100179055610a4530826b164b8bd581eb74d774000000610f14565b8073ffffffffffffffffffffffffffffffffffffffff167f55aa6227b2a2096d8b8c1d9acb670dc6c28dc66bc7b7bb77073341e1690471846b164b8bd581eb74d774000000604051610a9991815260200190565b60405180910390a250565b6060600480546104d3906115c7565b5f33610561818585610f14565b73ffffffffffffffffffffffffffffffffffffffff8416331480610b09575073ffffffffffffffffffffffffffffffffffffffff8481165f908152600960205260409020541633145b610b3f576040517f47cd4b8200000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600654610b78576040517f776e2dac00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff84165f9081526008602052604090205460ff1615610bd7576040517fd632b1ca00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040805173ffffffffffffffffffffffffffffffffffffffff861660208201529081018490525f90606001604080517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe081840301815282825280516020918201209083015201604051602081830303815290604052805190602001209050610c958383808060200260200160405190810160405280939291908181526020018383602002808284375f92019190915250506006549150849050610fbd565b610ccb576040517f7d23b90100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff85165f90815260086020526040902080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00166001179055610d23308686610f14565b8473ffffffffffffffffffffffffffffffffffffffff167f896e034966eaaf1adc54acc0f257056febbd300c9e47182cf761982cf1f5e43085604051610d6b91815260200190565b60405180910390a25050505050565b610d82610de2565b73ffffffffffffffffffffffffffffffffffffffff8116610dd6576040517f1e4fbdf70000000000000000000000000000000000000000000000000000000081525f60048201526024015b60405180910390fd5b610ddf81611030565b50565b60055473ffffffffffffffffffffffffffffffffffffffff163314610892576040517f118cdaa7000000000000000000000000000000000000000000000000000000008152336004820152602401610dcd565b610e4283838360016110a6565b505050565b73ffffffffffffffffffffffffffffffffffffffff8381165f908152600160209081526040808320938616835292905220547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8114610f0e5781811015610f00576040517ffb8f41b200000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff841660048201526024810182905260448101839052606401610dcd565b610f0e84848484035f6110a6565b50505050565b73ffffffffffffffffffffffffffffffffffffffff8316610f63576040517f96c6fd1e0000000000000000000000000000000000000000000000000000000081525f6004820152602401610dcd565b73ffffffffffffffffffffffffffffffffffffffff8216610fb2576040517fec442f050000000000000000000000000000000000000000000000000000000081525f6004820152602401610dcd565b610e428383836111eb565b5f82610fc98584611392565b14949350505050565b73ffffffffffffffffffffffffffffffffffffffff8216611021576040517f96c6fd1e0000000000000000000000000000000000000000000000000000000081525f6004820152602401610dcd565b61102c825f836111eb565b5050565b6005805473ffffffffffffffffffffffffffffffffffffffff8381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b73ffffffffffffffffffffffffffffffffffffffff84166110f5576040517fe602df050000000000000000000000000000000000000000000000000000000081525f6004820152602401610dcd565b73ffffffffffffffffffffffffffffffffffffffff8316611144576040517f94280d620000000000000000000000000000000000000000000000000000000081525f6004820152602401610dcd565b73ffffffffffffffffffffffffffffffffffffffff8085165f9081526001602090815260408083209387168352929052208290558015610f0e578273ffffffffffffffffffffffffffffffffffffffff168473ffffffffffffffffffffffffffffffffffffffff167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925846040516111dd91815260200190565b60405180910390a350505050565b73ffffffffffffffffffffffffffffffffffffffff8316611222578060025f8282546112179190611618565b909155506112d29050565b73ffffffffffffffffffffffffffffffffffffffff83165f90815260208190526040902054818110156112a7576040517fe450d38c00000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff851660048201526024810182905260448101839052606401610dcd565b73ffffffffffffffffffffffffffffffffffffffff84165f9081526020819052604090209082900390555b73ffffffffffffffffffffffffffffffffffffffff82166112fb57600280548290039055611326565b73ffffffffffffffffffffffffffffffffffffffff82165f9081526020819052604090208054820190555b8173ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8360405161138591815260200190565b60405180910390a3505050565b5f81815b84518110156113cc576113c2828683815181106113b5576113b5611650565b60200260200101516113d4565b9150600101611396565b509392505050565b5f8183106113ee575f8281526020849052604090206113fc565b5f8381526020839052604090205b9392505050565b803573ffffffffffffffffffffffffffffffffffffffff81168114611426575f5ffd5b919050565b5f6020828403121561143b575f5ffd5b6113fc82611403565b602081525f82518060208401528060208501604085015e5f6040828501015260407fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f83011684010191505092915050565b5f5f604083850312156114a8575f5ffd5b6114b183611403565b946020939093013593505050565b5f5f5f606084860312156114d1575f5ffd5b6114da84611403565b92506114e860208501611403565b929592945050506040919091013590565b5f5f6040838503121561150a575f5ffd5b61151383611403565b915061152160208401611403565b90509250929050565b5f5f5f5f6060858703121561153d575f5ffd5b61154685611403565b935060208501359250604085013567ffffffffffffffff811115611568575f5ffd5b8501601f81018713611578575f5ffd5b803567ffffffffffffffff81111561158e575f5ffd5b8760208260051b84010111156115a2575f5ffd5b949793965060200194505050565b5f602082840312156115c0575f5ffd5b5035919050565b600181811c908216806115db57607f821691505b602082108103611612577f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b50919050565b80820180821115610567577f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52603260045260245ffdfea2646970667358221220b26c61a3e64ef1aae60d87d5e7f6f86074ffce78a95dec2438d61aaf3490913864736f6c634300081c0033

000000000000000000000000f82f3d7df94fc2994315c32322da6238ca2a2f7f

-----Decoded View---------------
Arg [0] : initialOwner (address): 0xf82F3D7Df94FC2994315c32322DA6238cA2A2f7f

-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 000000000000000000000000f82f3d7df94fc2994315c32322da6238ca2a2f7f

51429:5463:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;53996:148;;;;;;:::i;:::-;;:::i;:::-;;42016:91;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;44309:190;;;;;;:::i;:::-;;:::i;:::-;;;1358:14:1;;1351:22;1333:41;;1321:2;1306:18;44309:190:0;1193:187:1;43118:99:0;43197:12;;43118:99;;;1531:25:1;;;1519:2;1504:18;43118:99:0;1385:177:1;45109:249:0;;;;;;:::i;:::-;;:::i;51469:25::-;;;;;;42969:84;;;43043:2;2270:36:1;;2258:2;2243:18;42969:84:0;2128:184:1;51784:44:0;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;2493:42:1;2481:55;;;2463:74;;2451:2;2436:18;51784:44:0;2317:226:1;53598:318:0;;;;;;:::i;:::-;;:::i;53037:393::-;;;;;;:::i;:::-;;:::i;43280:118::-;;;;;;:::i;:::-;43372:18;;43345:7;43372:18;;;;;;;;;;;;43280:118;55903:390;;;:::i;14043:103::-;;;:::i;51735:42::-;;;;;;:::i;:::-;;;;;;;;;;;;;;;;55607:123;;;:::i;55280:209::-;;;;;;:::i;:::-;;:::i;13368:87::-;13441:6;;;;13368:87;;51538:64;;51577:25;51538:64;;56453:436;;;;;;:::i;:::-;;:::i;42226:95::-;;;:::i;51609:39::-;;;;;;;;;;;;43603:182;;;;;;:::i;:::-;;:::i;51501:30::-;;;;;;;;;54493:630;;;;;;:::i;:::-;;:::i;51655:73::-;;51704:24;51655:73;;43848:142;;;;;;:::i;:::-;43955:18;;;;43928:7;43955:18;;;:11;:18;;;;;;;;:27;;;;;;;;;;;;;43848:142;14301:220;;;;;;:::i;:::-;;:::i;53996:148::-;13254:13;:11;:13::i;:::-;54072:15:::1;::::0;::::1;;::::0;;;:9:::1;:15;::::0;;;;;54065:22;;;::::1;::::0;;54103:33;54072:15;;;54103:33:::1;::::0;54072:15;;54103:33:::1;53996:148:::0;:::o;42016:91::-;42061:13;42094:5;42087:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;42016:91;:::o;44309:190::-;44382:4;10402:10;44438:31;10402:10;44454:7;44463:5;44438:8;:31::i;:::-;44487:4;44480:11;;;44309:190;;;;;:::o;45109:249::-;45196:4;10402:10;45254:37;45270:4;10402:10;45285:5;45254:15;:37::i;:::-;45302:26;45312:4;45318:2;45322:5;45302:9;:26::i;:::-;-1:-1:-1;45346:4:0;;45109:249;-1:-1:-1;;;;45109:249:0:o;53598:318::-;13254:13;:11;:13::i;:::-;53701:18:::1;::::0;::::1;53693:51;;;;;;;;;;;;;;;;;53763:26;::::0;::::1;53755:59;;;;;;;;;;;;;;;;;53827:15;::::0;;::::1;;::::0;;;:9:::1;:15;::::0;;;;;:30;;;::::1;::::0;;::::1;::::0;;::::1;::::0;;53873:35;::::1;::::0;53827:15;53873:35:::1;53598:318:::0;;:::o;53037:393::-;53237:16;;;53211:4;53237:16;;;:10;:16;;;;;;;;53233:34;;;-1:-1:-1;53262:5:0;53255:12;;53233:34;53326:24;;;4447:42:1;4435:55;;53326:24:0;;;4417:74:1;4507:18;;;4500:34;;;53278:12:0;;4390:18:1;;53326:24:0;;;;;;;;;;;;;53316:35;;53326:24;53316:35;;;;53303:49;;;4674:19:1;4709:12;53303:49:0;;;;;;;;;;;;53293:60;;;;;;53278:75;;53373:49;53392:11;;53373:49;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;53405:10:0;;;-1:-1:-1;53417:4:0;;-1:-1:-1;53373:18:0;:49::i;:::-;53366:56;;;53037:393;;;;;;;:::o;55903:390::-;13254:13;:11;:13::i;:::-;55972:18:::1;::::0;::::1;;55964:70;;;;;;;;;;;;;;;;;56053:19;::::0;::::1;::::0;::::1;;;56045:83;;;;;;;;;;;;;;;;;56184:4;56139:24;43372:18:::0;;;;;;;;;;;;56201:38:::1;::::0;43372:18;56201:5:::1;:38::i;:::-;56255:30;::::0;1531:25:1;;;56255:30:0::1;::::0;1519:2:1;1504:18;56255:30:0::1;;;;;;;;55953:340;55903:390::o:0;14043:103::-;13254:13;:11;:13::i;:::-;14108:30:::1;14135:1;14108:18;:30::i;:::-;14043:103::o:0;55607:123::-;13254:13;:11;:13::i;:::-;55663:18:::1;:25:::0;;;::::1;55684:4;55663:25;::::0;;55704:18:::1;::::0;::::1;::::0;55663::::1;::::0;55704::::1;55607:123::o:0;55280:209::-;13254:13;:11;:13::i;:::-;55363:18:::1;::::0;::::1;;55362:19;55354:50;;;;;;;;;;;;;;;;;55415:10;:24:::0;;;55455:26:::1;::::0;1531:25:1;;;55455:26:0::1;::::0;1519:2:1;1504:18;55455:26:0::1;1385:177:1::0;56453:436:0;13254:13;:11;:13::i;:::-;56545:19:::1;::::0;::::1;::::0;::::1;;;56544:20;56536:68;;;;;;;;;;;;;;;;;56623:31;::::0;::::1;56615:72;;;;;;;;;;;;;;;;;56698:19;:26:::0;;;::::1;;;::::0;;56735:67:::1;56753:4;56760:17:::0;51704:24:::1;56735:9;:67::i;:::-;56839:17;56818:63;;;51704:24;56818:63;;;;1531:25:1::0;;1519:2;1504:18;;1385:177;56818:63:0::1;;;;;;;;56453:436:::0;:::o;42226:95::-;42273:13;42306:7;42299:14;;;;;:::i;43603:182::-;43672:4;10402:10;43728:27;10402:10;43745:2;43749:5;43728:9;:27::i;54493:630::-;54604:18;;;54612:10;54604:18;;:51;;-1:-1:-1;54626:29:0;:15;;;;;;;:9;:15;;;;;;;54645:10;54626:29;54604:51;54596:84;;;;;;;;;;;;;;;;;54699:10;;54691:56;;;;;;;;;;;;;;;;;54767:16;;;;;;;:10;:16;;;;;;;;54766:17;54758:52;;;;;;;;;;;;;;;;;54869:24;;;4447:42:1;4435:55;;54869:24:0;;;4417:74:1;4507:18;;;4500:34;;;54821:12:0;;4390:18:1;;54869:24:0;;;;;;;;;;;;;54859:35;;54869:24;54859:35;;;;54846:49;;;4674:19:1;4709:12;54846:49:0;;;;;;;;;;;;54836:60;;;;;;54821:75;;54915:49;54934:11;;54915:49;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;54947:10:0;;;-1:-1:-1;54959:4:0;;-1:-1:-1;54915:18:0;:49::i;:::-;54907:82;;;;;;;;;;;;;;;;;55000:16;;;;;;;:10;:16;;;;;:23;;;;55019:4;55000:23;;;55034:38;55052:4;55011;55065:6;55034:9;:38::i;:::-;55102:4;55088:27;;;55108:6;55088:27;;;;1531:25:1;;1519:2;1504:18;;1385:177;55088:27:0;;;;;;;;54585:538;54493:630;;;;:::o;14301:220::-;13254:13;:11;:13::i;:::-;14386:22:::1;::::0;::::1;14382:93;;14432:31;::::0;::::1;::::0;;14460:1:::1;14432:31;::::0;::::1;2463:74:1::0;2436:18;;14432:31:0::1;;;;;;;;14382:93;14485:28;14504:8;14485:18;:28::i;:::-;14301:220:::0;:::o;13533:166::-;13441:6;;13593:23;13441:6;10402:10;13593:23;13589:103;;13640:40;;;;;10402:10;13640:40;;;2463:74:1;2436:18;;13640:40:0;2317:226:1;49168:130:0;49253:37;49262:5;49269:7;49278:5;49285:4;49253:8;:37::i;:::-;49168:130;;;:::o;50900:487::-;43955:18;;;;51000:24;43955:18;;;:11;:18;;;;;;;;:27;;;;;;;;;;51087:17;51067:37;;51063:317;;51144:5;51125:16;:24;51121:132;;;51177:60;;;;;4964:42:1;4952:55;;51177:60:0;;;4934:74:1;5024:18;;;5017:34;;;5067:18;;;5060:34;;;4907:18;;51177:60:0;4732:368:1;51121:132:0;51296:57;51305:5;51312:7;51340:5;51321:16;:24;51347:5;51296:8;:57::i;:::-;50989:398;50900:487;;;:::o;45743:308::-;45827:18;;;45823:88;;45869:30;;;;;45896:1;45869:30;;;2463:74:1;2436:18;;45869:30:0;2317:226:1;45823:88:0;45925:16;;;45921:88;;45965:32;;;;;45994:1;45965:32;;;2463:74:1;2436:18;;45965:32:0;2317:226:1;45921:88:0;46019:24;46027:4;46033:2;46037:5;46019:7;:24::i;17497:156::-;17588:4;17641;17612:25;17625:5;17632:4;17612:12;:25::i;:::-;:33;;17497:156;-1:-1:-1;;;;17497:156:0:o;48404:211::-;48475:21;;;48471:91;;48520:30;;;;;48547:1;48520:30;;;2463:74:1;2436:18;;48520:30:0;2317:226:1;48471:91:0;48572:35;48580:7;48597:1;48601:5;48572:7;:35::i;:::-;48404:211;;:::o;14681:191::-;14774:6;;;;14791:17;;;;;;;;;;;14824:40;;14774:6;;;14791:17;14774:6;;14824:40;;14755:16;;14824:40;14744:128;14681:191;:::o;50165:443::-;50278:19;;;50274:91;;50321:32;;;;;50350:1;50321:32;;;2463:74:1;2436:18;;50321:32:0;2317:226:1;50274:91:0;50379:21;;;50375:92;;50424:31;;;;;50452:1;50424:31;;;2463:74:1;2436:18;;50424:31:0;2317:226:1;50375:92:0;50477:18;;;;;;;;:11;:18;;;;;;;;:27;;;;;;;;;:35;;;50523:78;;;;50574:7;50558:31;;50567:5;50558:31;;;50583:5;50558:31;;;;1531:25:1;;1519:2;1504:18;;1385:177;50558:31:0;;;;;;;;50165:443;;;;:::o;46375:1135::-;46465:18;;;46461:552;;46619:5;46603:12;;:21;;;;;;;:::i;:::-;;;;-1:-1:-1;46461:552:0;;-1:-1:-1;46461:552:0;;46679:15;;;46657:19;46679:15;;;;;;;;;;;46713:19;;;46709:117;;;46760:50;;;;;4964:42:1;4952:55;;46760:50:0;;;4934:74:1;5024:18;;;5017:34;;;5067:18;;;5060:34;;;4907:18;;46760:50:0;4732:368:1;46709:117:0;46949:15;;;:9;:15;;;;;;;;;;46967:19;;;;46949:37;;46461:552;47029:16;;;47025:435;;47195:12;:21;;;;;;;47025:435;;;47411:13;;;:9;:13;;;;;;;;;;:22;;;;;;47025:435;47492:2;47477:25;;47486:4;47477:25;;;47496:5;47477:25;;;;1531::1;;1519:2;1504:18;;1385:177;47477:25:0;;;;;;;;46375:1135;;;:::o;18064:314::-;18147:7;18190:4;18147:7;18205:136;18229:5;:12;18225:1;:16;18205:136;;;18278:51;18306:12;18320:5;18326:1;18320:8;;;;;;;;:::i;:::-;;;;;;;18278:27;:51::i;:::-;18263:66;-1:-1:-1;18243:3:0;;18205:136;;;-1:-1:-1;18358:12:0;18064:314;-1:-1:-1;;;18064:314:0:o;11175:171::-;11250:7;11281:1;11277;:5;:61;;11544:13;11610:15;;;11646:4;11639:15;;;11693:4;11677:21;;11277:61;;;11544:13;11610:15;;;11646:4;11639:15;;;11693:4;11677:21;;11285:25;11270:68;11175:171;-1:-1:-1;;;11175:171:0:o;14:196:1:-;82:20;;142:42;131:54;;121:65;;111:93;;200:1;197;190:12;111:93;14:196;;;:::o;215:186::-;274:6;327:2;315:9;306:7;302:23;298:32;295:52;;;343:1;340;333:12;295:52;366:29;385:9;366:29;:::i;406:477::-;555:2;544:9;537:21;518:4;587:6;581:13;630:6;625:2;614:9;610:18;603:34;689:6;684:2;676:6;672:15;667:2;656:9;652:18;646:50;745:1;740:2;731:6;720:9;716:22;712:31;705:42;874:2;804:66;799:2;791:6;787:15;783:88;772:9;768:104;764:113;756:121;;;406:477;;;;:::o;888:300::-;956:6;964;1017:2;1005:9;996:7;992:23;988:32;985:52;;;1033:1;1030;1023:12;985:52;1056:29;1075:9;1056:29;:::i;:::-;1046:39;1154:2;1139:18;;;;1126:32;;-1:-1:-1;;;888:300:1:o;1567:374::-;1644:6;1652;1660;1713:2;1701:9;1692:7;1688:23;1684:32;1681:52;;;1729:1;1726;1719:12;1681:52;1752:29;1771:9;1752:29;:::i;:::-;1742:39;;1800:38;1834:2;1823:9;1819:18;1800:38;:::i;:::-;1567:374;;1790:48;;-1:-1:-1;;;1907:2:1;1892:18;;;;1879:32;;1567:374::o;2548:260::-;2616:6;2624;2677:2;2665:9;2656:7;2652:23;2648:32;2645:52;;;2693:1;2690;2683:12;2645:52;2716:29;2735:9;2716:29;:::i;:::-;2706:39;;2764:38;2798:2;2787:9;2783:18;2764:38;:::i;:::-;2754:48;;2548:260;;;;;:::o;2813:798::-;2917:6;2925;2933;2941;2994:2;2982:9;2973:7;2969:23;2965:32;2962:52;;;3010:1;3007;3000:12;2962:52;3033:29;3052:9;3033:29;:::i;:::-;3023:39;-1:-1:-1;3131:2:1;3116:18;;3103:32;;-1:-1:-1;3210:2:1;3195:18;;3182:32;3237:18;3226:30;;3223:50;;;3269:1;3266;3259:12;3223:50;3292:22;;3345:4;3337:13;;3333:27;-1:-1:-1;3323:55:1;;3374:1;3371;3364:12;3323:55;3414:2;3401:16;3440:18;3432:6;3429:30;3426:50;;;3472:1;3469;3462:12;3426:50;3525:7;3520:2;3510:6;3507:1;3503:14;3499:2;3495:23;3491:32;3488:45;3485:65;;;3546:1;3543;3536:12;3485:65;2813:798;;;;-1:-1:-1;3577:2:1;3569:11;;-1:-1:-1;;;2813:798:1:o;3616:180::-;3675:6;3728:2;3716:9;3707:7;3703:23;3699:32;3696:52;;;3744:1;3741;3734:12;3696:52;-1:-1:-1;3767:23:1;;3616:180;-1:-1:-1;3616:180:1:o;3801:437::-;3880:1;3876:12;;;;3923;;;3944:61;;3998:4;3990:6;3986:17;3976:27;;3944:61;4051:2;4043:6;4040:14;4020:18;4017:38;4014:218;;4088:77;4085:1;4078:88;4189:4;4186:1;4179:15;4217:4;4214:1;4207:15;4014:218;;3801:437;;;:::o;5105:279::-;5170:9;;;5191:10;;;5188:190;;;5234:77;5231:1;5224:88;5335:4;5332:1;5325:15;5363:4;5360:1;5353:15;5389:184;5441:77;5438:1;5431:88;5538:4;5535:1;5528:15;5562:4;5559:1;5552:15

ipfs://b26c61a3e64ef1aae60d87d5e7f6f86074ffce78a95dec2438d61aaf34909138