HYPE Price: $23.41 (+3.68%)
 

Overview

HYPE Balance

HyperEVM LogoHyperEVM LogoHyperEVM Logo0 HYPE

HYPE Value

$0.00

Token Holdings

More Info

Private Name Tags

Multichain Info

No addresses found
Transaction Hash
Block
From
To
Claim Sale Token...252107192026-01-22 3:08:002 days ago1769051280IN
0x9868663D...40BBdD54B
0 HYPE0.000009930.1
Claim Sale Token...203044242025-11-27 6:30:0058 days ago1764225000IN
0x9868663D...40BBdD54B
0 HYPE0.000012190.12273
Claim Sale Token...202455682025-11-26 14:25:0959 days ago1764167109IN
0x9868663D...40BBdD54B
0 HYPE0.000306733.086
Claim Sale Token...202377382025-11-26 12:16:4859 days ago1764159408IN
0x9868663D...40BBdD54B
0 HYPE0.000081870.82372802
Claim Sale Token...200649682025-11-24 13:04:3061 days ago1763989470IN
0x9868663D...40BBdD54B
0 HYPE0.00005491.66626524
Claim Sale Token...200649522025-11-24 13:04:1461 days ago1763989454IN
0x9868663D...40BBdD54B
0 HYPE0.000074990.75452512
Claim Sale Token...200097942025-11-23 22:00:0061 days ago1763935200IN
0x9868663D...40BBdD54B
0 HYPE0.000182191.833
Claim Sale Token...198082402025-11-21 14:54:2164 days ago1763736861IN
0x9868663D...40BBdD54B
0 HYPE0.0010377110.44030905
Claim Sale Token...197363822025-11-20 19:16:2165 days ago1763666181IN
0x9868663D...40BBdD54B
0 HYPE0.000049370.6
Claim Sale Token...197361142025-11-20 19:11:5865 days ago1763665918IN
0x9868663D...40BBdD54B
0 HYPE0.000258132.59710613
Claim Sale Token...196379502025-11-19 16:22:4366 days ago1763569363IN
0x9868663D...40BBdD54B
0 HYPE0.00021232.136
Claim Sale Token...196379142025-11-19 16:22:0766 days ago1763569327IN
0x9868663D...40BBdD54B
0 HYPE0.000280793.412
Claim Sale Token...196366242025-11-19 16:00:5966 days ago1763568059IN
0x9868663D...40BBdD54B
0 HYPE0.000045240.4552
Claim Sale Token...195776302025-11-18 23:53:5266 days ago1763510032IN
0x9868663D...40BBdD54B
0 HYPE0.000013120.13207
Claim Sale Token...195141132025-11-18 6:32:3667 days ago1763447556IN
0x9868663D...40BBdD54B
0 HYPE0.00008760.88136604
Claim Sale Token...194419752025-11-17 10:50:0068 days ago1763376600IN
0x9868663D...40BBdD54B
0 HYPE0.00001610.16199
Claim Sale Token...194061302025-11-17 1:02:2368 days ago1763341343IN
0x9868663D...40BBdD54B
0 HYPE0.000020430.2056
Claim Sale Token...194057862025-11-17 0:56:4568 days ago1763341005IN
0x9868663D...40BBdD54B
0 HYPE0.000134951.35777569
Claim Sale Token...192551102025-11-15 7:45:1470 days ago1763192714IN
0x9868663D...40BBdD54B
0 HYPE0.000011920.12
Claim Sale Token...191378312025-11-13 23:42:3871 days ago1763077358IN
0x9868663D...40BBdD54B
0 HYPE0.00001640.165
Claim Sale Token...191361622025-11-13 23:15:1671 days ago1763075716IN
0x9868663D...40BBdD54B
0 HYPE0.000133191.6184537
Claim Sale Token...191223382025-11-13 19:28:3972 days ago1763062119IN
0x9868663D...40BBdD54B
0 HYPE0.000018160.18280413
Claim Sale Token...191107512025-11-13 16:18:4272 days ago1763050722IN
0x9868663D...40BBdD54B
0 HYPE0.000234082.35507618
Claim Sale Token...191084892025-11-13 15:41:3772 days ago1763048497IN
0x9868663D...40BBdD54B
0 HYPE0.000033030.3324
Claim Sale Token...191083782025-11-13 15:39:4872 days ago1763048388IN
0x9868663D...40BBdD54B
0 HYPE0.000011720.118
View all transactions

Latest 1 internal transaction

Advanced mode:
Parent Transaction Hash Block From To
186954372025-11-08 22:50:1676 days ago1762642216
0x9868663D...40BBdD54B
5,173.59118581 HYPE
Cross-Chain Transactions
Loading...
Loading

Contract Source Code Verified (Exact Match)

Contract Name:
OverflowICO

Compiler Version
v0.8.28+commit.7893614a

Optimization Enabled:
Yes with 1000 runs

Other Settings:
cancun EvmVersion
pragma solidity ^0.8.20;

import {Ownable} from "openzeppelin-v5/access/Ownable.sol";
import {ReentrancyGuard} from "openzeppelin-v5/utils/ReentrancyGuard.sol";
import {Math} from "openzeppelin-v5/utils/math/Math.sol";
import {IERC20Minimal} from "@uniswap/v3-core/contracts/interfaces/IERC20Minimal.sol";
import {TransferHelper} from "contracts/univ3-periphery/libraries/TransferHelper.sol";

contract OverflowICO is Ownable, ReentrancyGuard {
    address public immutable saleToken;
    address public immutable paymentToken; 
    uint256 public immutable minEthPerErc20Wad;
    uint64 public immutable startTime;
    uint64 public immutable endTime;
    uint64 public immutable tokenClaimTime;
    uint256 public immutable tokensForSale;
    uint256 public immutable totalRaise;
    uint256 public totalEthCommitted;
    uint256 public totalErc20Committed;
    mapping(address => uint256) public ethCommittedOf;
    mapping(address => uint256) public erc20CommittedOf;
    mapping(address => bool) public hasClaimedTokens;
    mapping(address => bool) public hasClaimedRefund;
    uint256 public totalClaimed;
    bool public finalized;
    uint256 public committedFinal; 
    uint256 public acceptedFinal;  
    uint256 public tokensSold;     
    bool public canceled;
    mapping(address => bool) public refundedOnCancel;

    event Contributed(address indexed user, uint256 amount, bool isEth);
    event Finalized(
        uint256 totalCommitted,
        uint256 acceptedCommitted,
        uint256 tokensSold,
        uint256 ethToOwner,
        uint256 erc20ToOwner,
        uint256 unsoldBurned
    );
    event Claimed(address indexed user, uint256 tokenAmount, uint256 refundEth, uint256 refundErc20);
    event Canceled(uint256 totalEthCommitted, uint256 totalErc20Committed, uint256 saleTokenWithdrawn);
    event RefundedOnCancel(address indexed user, uint256 ethAmount, uint256 erc20Amount);

    error SaleNotActive();
    error SaleNotEnded();
    error AlreadyFinalized();
    error NotFinalized();
    error ZeroAmount();
    error ERC20Disabled();
    error AlreadyClaimed();
    error TokenClaimLocked();
    error InsufficientSaleTokens();
    error SaleCanceled();
    error NotCanceled();
    error CannotSweepSaleToken();

    constructor(
        address _owner,
        address _saleToken,
        address _paymentToken,
        uint64 _startTime,
        uint64 _endTime,
        uint256 _tokensForSale,
        uint256 _totalRaise,
        uint256 _minEthPerErc20Wad,
        uint64 _tokenClaimTime
    ) Ownable(_owner) {
        require(_saleToken != address(0), "saleToken=0");
        require(_tokensForSale > 0, "tokens=0");
        require(_endTime > _startTime, "time");
        require(_totalRaise > 0, "raise=0");
        require(_tokenClaimTime >= _endTime, "claimTime<end");

        saleToken = _saleToken;
        paymentToken = _paymentToken; 
        startTime = _startTime;
        endTime = _endTime;
        tokenClaimTime = _tokenClaimTime;
        tokensForSale = _tokensForSale;
        totalRaise = _totalRaise;
        minEthPerErc20Wad = _minEthPerErc20Wad;
    }

    function isActive() public view returns (bool) {
        return block.timestamp >= startTime && block.timestamp < endTime && !finalized && !canceled;
    }

    function totalCommitted() public view returns (uint256) {
        return totalEthCommitted + totalErc20Committed;
    }

    function committedOf(address user) public view returns (uint256) {
        return ethCommittedOf[user] + erc20CommittedOf[user];
    }

    function claimable(address user) public view returns (uint256) {
        if (!finalized) return 0;
        if (acceptedFinal == 0) return 0;
        uint256 userComm = committedOf(user);
        if (userComm == 0) return 0;
        if (hasClaimedTokens[user]) return 0;
        if (committedFinal == 0) return 0;
        return (tokensSold * userComm) / committedFinal;
    }

    function expectedOutcome(address user)
        public
        view
        returns (uint256 expectedSaleToken, uint256 expectedRefundEth, uint256 expectedRefundErc20)
    {
        if (canceled) {
            return (0, ethCommittedOf[user], erc20CommittedOf[user]);
        }

        if (finalized) {
            if (committedFinal == 0) return (0, 0, 0);
            uint256 userComm = committedOf(user);
            if (userComm == 0) return (0, 0, 0);
            uint256 tokenOut = hasClaimedTokens[user] ? 0 : (tokensSold * userComm) / committedFinal;
            uint256 unused = committedFinal - acceptedFinal;
            uint256 rEth = 0;
            uint256 rErc = 0;
            if (!hasClaimedRefund[user]) {
                rEth = (ethCommittedOf[user] * unused) / committedFinal;
                rErc = (erc20CommittedOf[user] * unused) / committedFinal;
            }
            return (tokenOut, rEth, rErc);
        }

        uint256 tot = totalCommitted();
        if (tot == 0) return (0, 0, 0);
        uint256 accepted = tot < totalRaise ? tot : totalRaise;
        uint256 sold = 0;
        if (accepted > 0) {
            sold = (tokensForSale * accepted) / totalRaise;
        }
        uint256 userTot = committedOf(user);
        uint256 saleOut = (sold * userTot) / tot;
        uint256 unusedNow = tot - accepted;
        uint256 rEthNow = (ethCommittedOf[user] * unusedNow) / tot;
        uint256 rErcNow = (erc20CommittedOf[user] * unusedNow) / tot;
        return (saleOut, rEthNow, rErcNow);
    }

    function contribute(uint256 erc20Amount) external payable nonReentrant {
        if (!isActive()) revert SaleNotActive();
        uint256 ethAmount = msg.value;
        if (ethAmount == 0 && erc20Amount == 0) revert ZeroAmount();
        if (erc20Amount > 0) {
            if (paymentToken == address(0)) revert ERC20Disabled();
            TransferHelper.safeTransferFrom(paymentToken, msg.sender, address(this), erc20Amount);
        }

        uint256 newEth = ethCommittedOf[msg.sender] + ethAmount;
        uint256 newErc = erc20CommittedOf[msg.sender] + erc20Amount;
        if (paymentToken != address(0) && minEthPerErc20Wad > 0 && newErc > 0) {
            uint256 lhs = Math.mulDiv(newEth, 1e18, newErc);
            require(lhs >= minEthPerErc20Wad, "minRatio");
        }

        if (ethAmount > 0) {
            ethCommittedOf[msg.sender] = newEth;
            totalEthCommitted += ethAmount;
            emit Contributed(msg.sender, ethAmount, true);
        }
        if (erc20Amount > 0) {
            erc20CommittedOf[msg.sender] = newErc;
            totalErc20Committed += erc20Amount;
            emit Contributed(msg.sender, erc20Amount, false);
        }
    }

    receive() external payable {
        if (!isActive()) revert SaleNotActive();
        if (msg.value == 0) revert ZeroAmount();
        ethCommittedOf[msg.sender] += msg.value;
        totalEthCommitted += msg.value;
        emit Contributed(msg.sender, msg.value, true);
    }

    function cancel() external onlyOwner nonReentrant {
        if (finalized) revert AlreadyFinalized();
        if (canceled) revert SaleCanceled();
        if (block.timestamp < startTime) revert SaleNotActive();
        canceled = true;
        uint256 bal = IERC20Minimal(saleToken).balanceOf(address(this));
        if (bal > 0) {
            TransferHelper.safeTransfer(saleToken, owner(), bal);
        }
        emit Canceled(totalEthCommitted, totalErc20Committed, bal);
    }

    function refundOnCancel() external nonReentrant {
        if (!canceled) revert NotCanceled();
        if (refundedOnCancel[msg.sender]) revert AlreadyClaimed();

        uint256 ethAmt = ethCommittedOf[msg.sender];
        uint256 ercAmt = erc20CommittedOf[msg.sender];
        if (ethAmt == 0 && ercAmt == 0) revert ZeroAmount();

        refundedOnCancel[msg.sender] = true;
        if (ethAmt > 0) {
            ethCommittedOf[msg.sender] = 0;
            totalEthCommitted -= ethAmt;
            TransferHelper.safeTransferETH(msg.sender, ethAmt);
        }
        if (ercAmt > 0) {
            erc20CommittedOf[msg.sender] = 0;
            totalErc20Committed -= ercAmt;
            TransferHelper.safeTransfer(paymentToken, msg.sender, ercAmt);
        }
        emit RefundedOnCancel(msg.sender, ethAmt, ercAmt);
    }

    function _finalizeCore() private {
        if (finalized) revert AlreadyFinalized();
        if (canceled) revert SaleCanceled();
        if (block.timestamp < endTime) revert SaleNotEnded();

        uint256 bal = IERC20Minimal(saleToken).balanceOf(address(this));
        if (bal < tokensForSale) revert InsufficientSaleTokens();

        finalized = true;

        uint256 tot = totalCommitted();
        committedFinal = tot;
        uint256 accepted = tot < totalRaise ? tot : totalRaise;
        acceptedFinal = accepted;

        uint256 sold = 0;
        if (accepted > 0) {
            sold = (tokensForSale * accepted) / totalRaise; 
        }
        tokensSold = sold;

        uint256 unsold = tokensForSale - sold;
        if (unsold > 0) {
            TransferHelper.safeTransfer(saleToken, 0x000000000000000000000000000000000000dEaD, unsold);
        }

        uint256 ethToOwner = 0;
        uint256 ercToOwner = 0;
        if (tot > 0 && accepted > 0) {
            if (totalEthCommitted > 0) {
                ethToOwner = (totalEthCommitted * accepted) / tot; 
                if (ethToOwner > 0) {
                    TransferHelper.safeTransferETH(owner(), ethToOwner);
                }
            }
            if (paymentToken != address(0) && totalErc20Committed > 0) {
                ercToOwner = (totalErc20Committed * accepted) / tot; 
                if (ercToOwner > 0) {
                    TransferHelper.safeTransfer(paymentToken, owner(), ercToOwner);
                }
            }
        }

        emit Finalized(tot, accepted, sold, ethToOwner, ercToOwner, unsold);
    }

    function finalize() external onlyOwner nonReentrant {
        _finalizeCore();
    }

    function claimRefund() external nonReentrant {
        if (canceled) revert SaleCanceled();
        if (!finalized) {
            if (block.timestamp >= endTime) {
                if (IERC20Minimal(saleToken).balanceOf(address(this)) >= tokensForSale) {
                    _finalizeCore();
                }
            }
        }
        if (!finalized) revert NotFinalized();
        if (hasClaimedRefund[msg.sender]) revert AlreadyClaimed();

        hasClaimedRefund[msg.sender] = true;

        uint256 refundEth = 0;
        uint256 refundErc = 0;

        if (committedFinal > 0) {
            uint256 unusedNumerator = committedFinal - acceptedFinal; 
            if (unusedNumerator > 0) {
                if (ethCommittedOf[msg.sender] > 0) {
                    refundEth = (ethCommittedOf[msg.sender] * unusedNumerator) / committedFinal; 
                }
                if (paymentToken != address(0) && erc20CommittedOf[msg.sender] > 0) {
                    refundErc = (erc20CommittedOf[msg.sender] * unusedNumerator) / committedFinal; 
                }
            }
        }

        if (refundEth > 0) {
            TransferHelper.safeTransferETH(msg.sender, refundEth);
        }
        if (refundErc > 0) {
            TransferHelper.safeTransfer(paymentToken, msg.sender, refundErc);
        }

        emit Claimed(msg.sender, 0, refundEth, refundErc);
    }

    function claimSaleTokens() external nonReentrant {
        if (canceled) revert SaleCanceled();
        if (!finalized) {
            if (block.timestamp >= endTime) {
                if (IERC20Minimal(saleToken).balanceOf(address(this)) >= tokensForSale) {
                    _finalizeCore();
                }
            }
        }
        if (!finalized) revert NotFinalized();
        if (block.timestamp < tokenClaimTime) revert TokenClaimLocked();
        if (hasClaimedTokens[msg.sender]) revert AlreadyClaimed();

        hasClaimedTokens[msg.sender] = true;

        uint256 tokenOut = 0;
        if (committedFinal > 0) {
            uint256 userComm = committedOf(msg.sender);
            if (userComm > 0 && tokensSold > 0) {
                tokenOut = (tokensSold * userComm) / committedFinal; 
            }
        }

        if (tokenOut > 0) {
            totalClaimed += tokenOut;
            TransferHelper.safeTransfer(saleToken, msg.sender, tokenOut);
        }

        emit Claimed(msg.sender, tokenOut, 0, 0);
    }

    function sweep(address token, uint256 amount) external onlyOwner nonReentrant {
        if (token == saleToken || token == paymentToken) revert CannotSweepSaleToken();
        if (amount == 0) revert ZeroAmount();
        TransferHelper.safeTransfer(token, owner(), amount);
    }

}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)

pragma solidity ^0.8.20;

import {Context} from "../utils/Context.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);
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/ReentrancyGuard.sol)

pragma solidity ^0.8.20;

/**
 * @dev Contract module that helps prevent reentrant calls to a function.
 *
 * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier
 * available, which can be applied to functions to make sure there are no nested
 * (reentrant) calls to them.
 *
 * Note that because there is a single `nonReentrant` guard, functions marked as
 * `nonReentrant` may not call one another. This can be worked around by making
 * those functions `private`, and then adding `external` `nonReentrant` entry
 * points to them.
 *
 * TIP: If EIP-1153 (transient storage) is available on the chain you're deploying at,
 * consider using {ReentrancyGuardTransient} instead.
 *
 * TIP: If you would like to learn more about reentrancy and alternative ways
 * to protect against it, check out our blog post
 * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].
 */
abstract contract ReentrancyGuard {
    // Booleans are more expensive than uint256 or any type that takes up a full
    // word because each write operation emits an extra SLOAD to first read the
    // slot's contents, replace the bits taken up by the boolean, and then write
    // back. This is the compiler's defense against contract upgrades and
    // pointer aliasing, and it cannot be disabled.

    // The values being non-zero value makes deployment a bit more expensive,
    // but in exchange the refund on every call to nonReentrant will be lower in
    // amount. Since refunds are capped to a percentage of the total
    // transaction's gas, it is best to keep them low in cases like this one, to
    // increase the likelihood of the full refund coming into effect.
    uint256 private constant NOT_ENTERED = 1;
    uint256 private constant ENTERED = 2;

    uint256 private _status;

    /**
     * @dev Unauthorized reentrant call.
     */
    error ReentrancyGuardReentrantCall();

    constructor() {
        _status = NOT_ENTERED;
    }

    /**
     * @dev Prevents a contract from calling itself, directly or indirectly.
     * Calling a `nonReentrant` function from another `nonReentrant`
     * function is not supported. It is possible to prevent this from happening
     * by making the `nonReentrant` function external, and making it call a
     * `private` function that does the actual work.
     */
    modifier nonReentrant() {
        _nonReentrantBefore();
        _;
        _nonReentrantAfter();
    }

    function _nonReentrantBefore() private {
        // On the first call to nonReentrant, _status will be NOT_ENTERED
        if (_status == ENTERED) {
            revert ReentrancyGuardReentrantCall();
        }

        // Any calls to nonReentrant after this point will fail
        _status = ENTERED;
    }

    function _nonReentrantAfter() private {
        // By storing the original value once again, a refund is triggered (see
        // https://eips.ethereum.org/EIPS/eip-2200)
        _status = NOT_ENTERED;
    }

    /**
     * @dev Returns true if the reentrancy guard is currently set to "entered", which indicates there is a
     * `nonReentrant` function in the call stack.
     */
    function _reentrancyGuardEntered() internal view returns (bool) {
        return _status == ENTERED;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/Math.sol)

pragma solidity ^0.8.20;

import {Panic} from "../Panic.sol";
import {SafeCast} from "./SafeCast.sol";

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Floor, // Toward negative infinity
        Ceil, // Toward positive infinity
        Trunc, // Toward zero
        Expand // Away from zero
    }

    /**
     * @dev Returns the addition of two unsigned integers, with an success flag (no overflow).
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a + b;
            if (c < a) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with an success flag (no overflow).
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b > a) return (false, 0);
            return (true, a - b);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with an success flag (no overflow).
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            // Gas optimization: this is cheaper than requiring 'a' not being zero, but the
            // benefit is lost if 'b' is also tested.
            // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
            if (a == 0) return (true, 0);
            uint256 c = a * b;
            if (c / a != b) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a / b);
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a % b);
        }
    }

    /**
     * @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
     *
     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
     * one branch when needed, making this function more expensive.
     */
    function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * SafeCast.toUint(condition));
        }
    }

    /**
     * @dev Returns the largest of two numbers.
     */
    function max(uint256 a, uint256 b) internal pure returns (uint256) {
        return ternary(a > b, a, b);
    }

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return ternary(a < b, a, b);
    }

    /**
     * @dev Returns the average of two numbers. The result is rounded towards
     * zero.
     */
    function average(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b) / 2 can overflow.
        return (a & b) + (a ^ b) / 2;
    }

    /**
     * @dev Returns the ceiling of the division of two numbers.
     *
     * This differs from standard division with `/` in that it rounds towards infinity instead
     * of rounding towards zero.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        if (b == 0) {
            // Guarantee the same behavior as in a regular Solidity division.
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }

        // The following calculation ensures accurate ceiling division without overflow.
        // Since a is non-zero, (a - 1) / b will not overflow.
        // The largest possible result occurs when (a - 1) / b is type(uint256).max,
        // but the largest value we can obtain is type(uint256).max - 1, which happens
        // when a = type(uint256).max and b = 1.
        unchecked {
            return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);
        }
    }

    /**
     * @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
     * denominator == 0.
     *
     * Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
     * Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
            // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2²⁵⁶ + prod0.
            uint256 prod0 = x * y; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                // Solidity will revert if denominator == 0, unlike the div opcode on its own.
                // The surrounding unchecked block does not change this fact.
                // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
                return prod0 / denominator;
            }

            // Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.
            if (denominator <= prod1) {
                Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));
            }

            ///////////////////////////////////////////////
            // 512 by 256 division.
            ///////////////////////////////////////////////

            // Make division exact by subtracting the remainder from [prod1 prod0].
            uint256 remainder;
            assembly {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

                // Subtract 256 bit number from 512 bit number.
                prod1 := sub(prod1, gt(remainder, prod0))
                prod0 := sub(prod0, remainder)
            }

            // Factor powers of two out of denominator and compute largest power of two divisor of denominator.
            // Always >= 1. See https://cs.stackexchange.com/q/138556/92363.

            uint256 twos = denominator & (0 - denominator);
            assembly {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

                // Divide [prod1 prod0] by twos.
                prod0 := div(prod0, twos)

                // Flip twos such that it is 2²⁵⁶ / twos. If twos is zero, then it becomes one.
                twos := add(div(sub(0, twos), twos), 1)
            }

            // Shift in bits from prod1 into prod0.
            prod0 |= prod1 * twos;

            // Invert denominator mod 2²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such
            // that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv ≡ 1 mod 2⁴.
            uint256 inverse = (3 * denominator) ^ 2;

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also
            // works in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2⁸
            inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶
            inverse *= 2 - denominator * inverse; // inverse mod 2³²
            inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴
            inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸
            inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶

            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
            // This will give us the correct result modulo 2²⁵⁶. Since the preconditions guarantee that the outcome is
            // less than 2²⁵⁶, this is the final result. We don't need to compute the high bits of the result and prod1
            // is no longer required.
            result = prod0 * inverse;
            return result;
        }
    }

    /**
     * @dev Calculates x * y / denominator with full precision, following the selected rounding direction.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
        return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);
    }

    /**
     * @dev Calculate the modular multiplicative inverse of a number in Z/nZ.
     *
     * If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.
     * If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.
     *
     * If the input value is not inversible, 0 is returned.
     *
     * NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the
     * inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.
     */
    function invMod(uint256 a, uint256 n) internal pure returns (uint256) {
        unchecked {
            if (n == 0) return 0;

            // The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)
            // Used to compute integers x and y such that: ax + ny = gcd(a, n).
            // When the gcd is 1, then the inverse of a modulo n exists and it's x.
            // ax + ny = 1
            // ax = 1 + (-y)n
            // ax ≡ 1 (mod n) # x is the inverse of a modulo n

            // If the remainder is 0 the gcd is n right away.
            uint256 remainder = a % n;
            uint256 gcd = n;

            // Therefore the initial coefficients are:
            // ax + ny = gcd(a, n) = n
            // 0a + 1n = n
            int256 x = 0;
            int256 y = 1;

            while (remainder != 0) {
                uint256 quotient = gcd / remainder;

                (gcd, remainder) = (
                    // The old remainder is the next gcd to try.
                    remainder,
                    // Compute the next remainder.
                    // Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd
                    // where gcd is at most n (capped to type(uint256).max)
                    gcd - remainder * quotient
                );

                (x, y) = (
                    // Increment the coefficient of a.
                    y,
                    // Decrement the coefficient of n.
                    // Can overflow, but the result is casted to uint256 so that the
                    // next value of y is "wrapped around" to a value between 0 and n - 1.
                    x - y * int256(quotient)
                );
            }

            if (gcd != 1) return 0; // No inverse exists.
            return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.
        }
    }

    /**
     * @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.
     *
     * From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is
     * prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that
     * `a**(p-2)` is the modular multiplicative inverse of a in Fp.
     *
     * NOTE: this function does NOT check that `p` is a prime greater than `2`.
     */
    function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {
        unchecked {
            return Math.modExp(a, p - 2, p);
        }
    }

    /**
     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)
     *
     * Requirements:
     * - modulus can't be zero
     * - underlying staticcall to precompile must succeed
     *
     * IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make
     * sure the chain you're using it on supports the precompiled contract for modular exponentiation
     * at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,
     * the underlying function will succeed given the lack of a revert, but the result may be incorrectly
     * interpreted as 0.
     */
    function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {
        (bool success, uint256 result) = tryModExp(b, e, m);
        if (!success) {
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }
        return result;
    }

    /**
     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).
     * It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying
     * to operate modulo 0 or if the underlying precompile reverted.
     *
     * IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain
     * you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in
     * https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack
     * of a revert, but the result may be incorrectly interpreted as 0.
     */
    function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {
        if (m == 0) return (false, 0);
        assembly ("memory-safe") {
            let ptr := mload(0x40)
            // | Offset    | Content    | Content (Hex)                                                      |
            // |-----------|------------|--------------------------------------------------------------------|
            // | 0x00:0x1f | size of b  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x20:0x3f | size of e  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x40:0x5f | size of m  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x60:0x7f | value of b | 0x<.............................................................b> |
            // | 0x80:0x9f | value of e | 0x<.............................................................e> |
            // | 0xa0:0xbf | value of m | 0x<.............................................................m> |
            mstore(ptr, 0x20)
            mstore(add(ptr, 0x20), 0x20)
            mstore(add(ptr, 0x40), 0x20)
            mstore(add(ptr, 0x60), b)
            mstore(add(ptr, 0x80), e)
            mstore(add(ptr, 0xa0), m)

            // Given the result < m, it's guaranteed to fit in 32 bytes,
            // so we can use the memory scratch space located at offset 0.
            success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)
            result := mload(0x00)
        }
    }

    /**
     * @dev Variant of {modExp} that supports inputs of arbitrary length.
     */
    function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {
        (bool success, bytes memory result) = tryModExp(b, e, m);
        if (!success) {
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }
        return result;
    }

    /**
     * @dev Variant of {tryModExp} that supports inputs of arbitrary length.
     */
    function tryModExp(
        bytes memory b,
        bytes memory e,
        bytes memory m
    ) internal view returns (bool success, bytes memory result) {
        if (_zeroBytes(m)) return (false, new bytes(0));

        uint256 mLen = m.length;

        // Encode call args in result and move the free memory pointer
        result = abi.encodePacked(b.length, e.length, mLen, b, e, m);

        assembly ("memory-safe") {
            let dataPtr := add(result, 0x20)
            // Write result on top of args to avoid allocating extra memory.
            success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)
            // Overwrite the length.
            // result.length > returndatasize() is guaranteed because returndatasize() == m.length
            mstore(result, mLen)
            // Set the memory pointer after the returned data.
            mstore(0x40, add(dataPtr, mLen))
        }
    }

    /**
     * @dev Returns whether the provided byte array is zero.
     */
    function _zeroBytes(bytes memory byteArray) private pure returns (bool) {
        for (uint256 i = 0; i < byteArray.length; ++i) {
            if (byteArray[i] != 0) {
                return false;
            }
        }
        return true;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
     * towards zero.
     *
     * This method is based on Newton's method for computing square roots; the algorithm is restricted to only
     * using integer operations.
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        unchecked {
            // Take care of easy edge cases when a == 0 or a == 1
            if (a <= 1) {
                return a;
            }

            // In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a
            // sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between
            // the current value as `ε_n = | x_n - sqrt(a) |`.
            //
            // For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root
            // of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is
            // bigger than any uint256.
            //
            // By noticing that
            // `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`
            // we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar
            // to the msb function.
            uint256 aa = a;
            uint256 xn = 1;

            if (aa >= (1 << 128)) {
                aa >>= 128;
                xn <<= 64;
            }
            if (aa >= (1 << 64)) {
                aa >>= 64;
                xn <<= 32;
            }
            if (aa >= (1 << 32)) {
                aa >>= 32;
                xn <<= 16;
            }
            if (aa >= (1 << 16)) {
                aa >>= 16;
                xn <<= 8;
            }
            if (aa >= (1 << 8)) {
                aa >>= 8;
                xn <<= 4;
            }
            if (aa >= (1 << 4)) {
                aa >>= 4;
                xn <<= 2;
            }
            if (aa >= (1 << 2)) {
                xn <<= 1;
            }

            // We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).
            //
            // We can refine our estimation by noticing that the middle of that interval minimizes the error.
            // If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).
            // This is going to be our x_0 (and ε_0)
            xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)

            // From here, Newton's method give us:
            // x_{n+1} = (x_n + a / x_n) / 2
            //
            // One should note that:
            // x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a
            //              = ((x_n² + a) / (2 * x_n))² - a
            //              = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a
            //              = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)
            //              = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)
            //              = (x_n² - a)² / (2 * x_n)²
            //              = ((x_n² - a) / (2 * x_n))²
            //              ≥ 0
            // Which proves that for all n ≥ 1, sqrt(a) ≤ x_n
            //
            // This gives us the proof of quadratic convergence of the sequence:
            // ε_{n+1} = | x_{n+1} - sqrt(a) |
            //         = | (x_n + a / x_n) / 2 - sqrt(a) |
            //         = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |
            //         = | (x_n - sqrt(a))² / (2 * x_n) |
            //         = | ε_n² / (2 * x_n) |
            //         = ε_n² / | (2 * x_n) |
            //
            // For the first iteration, we have a special case where x_0 is known:
            // ε_1 = ε_0² / | (2 * x_0) |
            //     ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))
            //     ≤ 2**(2*e-4) / (3 * 2**(e-1))
            //     ≤ 2**(e-3) / 3
            //     ≤ 2**(e-3-log2(3))
            //     ≤ 2**(e-4.5)
            //
            // For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:
            // ε_{n+1} = ε_n² / | (2 * x_n) |
            //         ≤ (2**(e-k))² / (2 * 2**(e-1))
            //         ≤ 2**(2*e-2*k) / 2**e
            //         ≤ 2**(e-2*k)
            xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5)  -- special case, see above
            xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9)    -- general case with k = 4.5
            xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18)   -- general case with k = 9
            xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36)   -- general case with k = 18
            xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72)   -- general case with k = 36
            xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144)  -- general case with k = 72

            // Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision
            // ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either
            // sqrt(a) or sqrt(a) + 1.
            return xn - SafeCast.toUint(xn > a / xn);
        }
    }

    /**
     * @dev Calculates sqrt(a), following the selected rounding direction.
     */
    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = sqrt(a);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);
        }
    }

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        uint256 exp;
        unchecked {
            exp = 128 * SafeCast.toUint(value > (1 << 128) - 1);
            value >>= exp;
            result += exp;

            exp = 64 * SafeCast.toUint(value > (1 << 64) - 1);
            value >>= exp;
            result += exp;

            exp = 32 * SafeCast.toUint(value > (1 << 32) - 1);
            value >>= exp;
            result += exp;

            exp = 16 * SafeCast.toUint(value > (1 << 16) - 1);
            value >>= exp;
            result += exp;

            exp = 8 * SafeCast.toUint(value > (1 << 8) - 1);
            value >>= exp;
            result += exp;

            exp = 4 * SafeCast.toUint(value > (1 << 4) - 1);
            value >>= exp;
            result += exp;

            exp = 2 * SafeCast.toUint(value > (1 << 2) - 1);
            value >>= exp;
            result += exp;

            result += SafeCast.toUint(value > 1);
        }
        return result;
    }

    /**
     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log2(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);
        }
    }

    /**
     * @dev Return the log in base 10 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log10(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >= 10 ** 64) {
                value /= 10 ** 64;
                result += 64;
            }
            if (value >= 10 ** 32) {
                value /= 10 ** 32;
                result += 32;
            }
            if (value >= 10 ** 16) {
                value /= 10 ** 16;
                result += 16;
            }
            if (value >= 10 ** 8) {
                value /= 10 ** 8;
                result += 8;
            }
            if (value >= 10 ** 4) {
                value /= 10 ** 4;
                result += 4;
            }
            if (value >= 10 ** 2) {
                value /= 10 ** 2;
                result += 2;
            }
            if (value >= 10 ** 1) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log10(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);
        }
    }

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        uint256 isGt;
        unchecked {
            isGt = SafeCast.toUint(value > (1 << 128) - 1);
            value >>= isGt * 128;
            result += isGt * 16;

            isGt = SafeCast.toUint(value > (1 << 64) - 1);
            value >>= isGt * 64;
            result += isGt * 8;

            isGt = SafeCast.toUint(value > (1 << 32) - 1);
            value >>= isGt * 32;
            result += isGt * 4;

            isGt = SafeCast.toUint(value > (1 << 16) - 1);
            value >>= isGt * 16;
            result += isGt * 2;

            result += SafeCast.toUint(value > (1 << 8) - 1);
        }
        return result;
    }

    /**
     * @dev Return the log in base 256, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log256(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);
        }
    }

    /**
     * @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
     */
    function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
        return uint8(rounding) % 2 == 1;
    }
}

// SPDX-License-Identifier: GPL-2.0-or-later
pragma solidity >=0.5.0;

/// @title Minimal ERC20 interface for Uniswap
/// @notice Contains a subset of the full ERC20 interface that is used in Uniswap V3
interface IERC20Minimal {
    /// @notice Returns the balance of a token
    /// @param account The account for which to look up the number of tokens it has, i.e. its balance
    /// @return The number of tokens held by the account
    function balanceOf(address account) external view returns (uint256);

    /// @notice Transfers the amount of token from the `msg.sender` to the recipient
    /// @param recipient The account that will receive the amount transferred
    /// @param amount The number of tokens to send from the sender to the recipient
    /// @return Returns true for a successful transfer, false for an unsuccessful transfer
    function transfer(address recipient, uint256 amount) external returns (bool);

    /// @notice Returns the current allowance given to a spender by an owner
    /// @param owner The account of the token owner
    /// @param spender The account of the token spender
    /// @return The current allowance granted by `owner` to `spender`
    function allowance(address owner, address spender) external view returns (uint256);

    /// @notice Sets the allowance of a spender from the `msg.sender` to the value `amount`
    /// @param spender The account which will be allowed to spend a given amount of the owners tokens
    /// @param amount The amount of tokens allowed to be used by `spender`
    /// @return Returns true for a successful approval, false for unsuccessful
    function approve(address spender, uint256 amount) external returns (bool);

    /// @notice Transfers `amount` tokens from `sender` to `recipient` up to the allowance given to the `msg.sender`
    /// @param sender The account from which the transfer will be initiated
    /// @param recipient The recipient of the transfer
    /// @param amount The amount of the transfer
    /// @return Returns true for a successful transfer, false for unsuccessful
    function transferFrom(address sender, address recipient, uint256 amount) external returns (bool);

    /// @notice Event emitted when tokens are transferred from one address to another, either via `#transfer` or `#transferFrom`.
    /// @param from The account from which the tokens were sent, i.e. the balance decreased
    /// @param to The account to which the tokens were sent, i.e. the balance increased
    /// @param value The amount of tokens that were transferred
    event Transfer(address indexed from, address indexed to, uint256 value);

    /// @notice Event emitted when the approval amount for the spender of a given owner's tokens changes.
    /// @param owner The account that approved spending of its tokens
    /// @param spender The account for which the spending allowance was modified
    /// @param value The new allowance from the owner to the spender
    event Approval(address indexed owner, address indexed spender, uint256 value);
}

// SPDX-License-Identifier: GPL-2.0-or-later
pragma solidity >=0.6.0;

import "openzeppelin-v5/token/ERC20/IERC20.sol";

library TransferHelper {
    /// @notice Transfers tokens from the targeted address to the given destination
    /// @notice Errors with 'STF' if transfer fails
    /// @param token The contract address of the token to be transferred
    /// @param from The originating address from which the tokens will be transferred
    /// @param to The destination address of the transfer
    /// @param value The amount to be transferred
    function safeTransferFrom(address token, address from, address to, uint256 value) internal {
        (bool success, bytes memory data) = token.call(abi.encodeWithSelector(IERC20.transferFrom.selector, from, to, value));
        require(success && (data.length == 0 || abi.decode(data, (bool))), "STF");
    }

    /// @notice Transfers tokens from msg.sender to a recipient
    /// @dev Errors with ST if transfer fails
    /// @param token The contract address of the token which will be transferred
    /// @param to The recipient of the transfer
    /// @param value The value of the transfer
    function safeTransfer(address token, address to, uint256 value) internal {
        (bool success, bytes memory data) = token.call(abi.encodeWithSelector(IERC20.transfer.selector, to, value));
        require(success && (data.length == 0 || abi.decode(data, (bool))), "ST");
    }

    /// @notice Approves the stipulated contract to spend the given allowance in the given token
    /// @dev Errors with 'SA' if transfer fails
    /// @param token The contract address of the token to be approved
    /// @param to The target of the approval
    /// @param value The amount of the given token the target will be allowed to spend
    function safeApprove(address token, address to, uint256 value) internal {
        (bool success, bytes memory data) = token.call(abi.encodeWithSelector(IERC20.approve.selector, to, value));
        require(success && (data.length == 0 || abi.decode(data, (bool))), "SA");
    }

    /// @notice Transfers ETH to the recipient address
    /// @dev Fails with `STE`
    /// @param to The destination of the transfer
    /// @param value The value to be transferred
    function safeTransferETH(address to, uint256 value) internal {
        (bool success,) = to.call{value: value}(new bytes(0));
        require(success, "STE");
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)

pragma solidity ^0.8.20;

/**
 * @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;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)

pragma solidity ^0.8.20;

/**
 * @dev Helper library for emitting standardized panic codes.
 *
 * ```solidity
 * contract Example {
 *      using Panic for uint256;
 *
 *      // Use any of the declared internal constants
 *      function foo() { Panic.GENERIC.panic(); }
 *
 *      // Alternatively
 *      function foo() { Panic.panic(Panic.GENERIC); }
 * }
 * ```
 *
 * Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].
 *
 * _Available since v5.1._
 */
// slither-disable-next-line unused-state
library Panic {
    /// @dev generic / unspecified error
    uint256 internal constant GENERIC = 0x00;
    /// @dev used by the assert() builtin
    uint256 internal constant ASSERT = 0x01;
    /// @dev arithmetic underflow or overflow
    uint256 internal constant UNDER_OVERFLOW = 0x11;
    /// @dev division or modulo by zero
    uint256 internal constant DIVISION_BY_ZERO = 0x12;
    /// @dev enum conversion error
    uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;
    /// @dev invalid encoding in storage
    uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;
    /// @dev empty array pop
    uint256 internal constant EMPTY_ARRAY_POP = 0x31;
    /// @dev array out of bounds access
    uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;
    /// @dev resource error (too large allocation or too large array)
    uint256 internal constant RESOURCE_ERROR = 0x41;
    /// @dev calling invalid internal function
    uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;

    /// @dev Reverts with a panic code. Recommended to use with
    /// the internal constants with predefined codes.
    function panic(uint256 code) internal pure {
        assembly ("memory-safe") {
            mstore(0x00, 0x4e487b71)
            mstore(0x20, code)
            revert(0x1c, 0x24)
        }
    }
}

File 9 of 10 : SafeCast.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SafeCast.sol)
// This file was procedurally generated from scripts/generate/templates/SafeCast.js.

pragma solidity ^0.8.20;

/**
 * @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow
 * checks.
 *
 * Downcasting from uint256/int256 in Solidity does not revert on overflow. This can
 * easily result in undesired exploitation or bugs, since developers usually
 * assume that overflows raise errors. `SafeCast` restores this intuition by
 * reverting the transaction when such an operation overflows.
 *
 * Using this library instead of the unchecked operations eliminates an entire
 * class of bugs, so it's recommended to use it always.
 */
library SafeCast {
    /**
     * @dev Value doesn't fit in an uint of `bits` size.
     */
    error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);

    /**
     * @dev An int value doesn't fit in an uint of `bits` size.
     */
    error SafeCastOverflowedIntToUint(int256 value);

    /**
     * @dev Value doesn't fit in an int of `bits` size.
     */
    error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);

    /**
     * @dev An uint value doesn't fit in an int of `bits` size.
     */
    error SafeCastOverflowedUintToInt(uint256 value);

    /**
     * @dev Returns the downcasted uint248 from uint256, reverting on
     * overflow (when the input is greater than largest uint248).
     *
     * Counterpart to Solidity's `uint248` operator.
     *
     * Requirements:
     *
     * - input must fit into 248 bits
     */
    function toUint248(uint256 value) internal pure returns (uint248) {
        if (value > type(uint248).max) {
            revert SafeCastOverflowedUintDowncast(248, value);
        }
        return uint248(value);
    }

    /**
     * @dev Returns the downcasted uint240 from uint256, reverting on
     * overflow (when the input is greater than largest uint240).
     *
     * Counterpart to Solidity's `uint240` operator.
     *
     * Requirements:
     *
     * - input must fit into 240 bits
     */
    function toUint240(uint256 value) internal pure returns (uint240) {
        if (value > type(uint240).max) {
            revert SafeCastOverflowedUintDowncast(240, value);
        }
        return uint240(value);
    }

    /**
     * @dev Returns the downcasted uint232 from uint256, reverting on
     * overflow (when the input is greater than largest uint232).
     *
     * Counterpart to Solidity's `uint232` operator.
     *
     * Requirements:
     *
     * - input must fit into 232 bits
     */
    function toUint232(uint256 value) internal pure returns (uint232) {
        if (value > type(uint232).max) {
            revert SafeCastOverflowedUintDowncast(232, value);
        }
        return uint232(value);
    }

    /**
     * @dev Returns the downcasted uint224 from uint256, reverting on
     * overflow (when the input is greater than largest uint224).
     *
     * Counterpart to Solidity's `uint224` operator.
     *
     * Requirements:
     *
     * - input must fit into 224 bits
     */
    function toUint224(uint256 value) internal pure returns (uint224) {
        if (value > type(uint224).max) {
            revert SafeCastOverflowedUintDowncast(224, value);
        }
        return uint224(value);
    }

    /**
     * @dev Returns the downcasted uint216 from uint256, reverting on
     * overflow (when the input is greater than largest uint216).
     *
     * Counterpart to Solidity's `uint216` operator.
     *
     * Requirements:
     *
     * - input must fit into 216 bits
     */
    function toUint216(uint256 value) internal pure returns (uint216) {
        if (value > type(uint216).max) {
            revert SafeCastOverflowedUintDowncast(216, value);
        }
        return uint216(value);
    }

    /**
     * @dev Returns the downcasted uint208 from uint256, reverting on
     * overflow (when the input is greater than largest uint208).
     *
     * Counterpart to Solidity's `uint208` operator.
     *
     * Requirements:
     *
     * - input must fit into 208 bits
     */
    function toUint208(uint256 value) internal pure returns (uint208) {
        if (value > type(uint208).max) {
            revert SafeCastOverflowedUintDowncast(208, value);
        }
        return uint208(value);
    }

    /**
     * @dev Returns the downcasted uint200 from uint256, reverting on
     * overflow (when the input is greater than largest uint200).
     *
     * Counterpart to Solidity's `uint200` operator.
     *
     * Requirements:
     *
     * - input must fit into 200 bits
     */
    function toUint200(uint256 value) internal pure returns (uint200) {
        if (value > type(uint200).max) {
            revert SafeCastOverflowedUintDowncast(200, value);
        }
        return uint200(value);
    }

    /**
     * @dev Returns the downcasted uint192 from uint256, reverting on
     * overflow (when the input is greater than largest uint192).
     *
     * Counterpart to Solidity's `uint192` operator.
     *
     * Requirements:
     *
     * - input must fit into 192 bits
     */
    function toUint192(uint256 value) internal pure returns (uint192) {
        if (value > type(uint192).max) {
            revert SafeCastOverflowedUintDowncast(192, value);
        }
        return uint192(value);
    }

    /**
     * @dev Returns the downcasted uint184 from uint256, reverting on
     * overflow (when the input is greater than largest uint184).
     *
     * Counterpart to Solidity's `uint184` operator.
     *
     * Requirements:
     *
     * - input must fit into 184 bits
     */
    function toUint184(uint256 value) internal pure returns (uint184) {
        if (value > type(uint184).max) {
            revert SafeCastOverflowedUintDowncast(184, value);
        }
        return uint184(value);
    }

    /**
     * @dev Returns the downcasted uint176 from uint256, reverting on
     * overflow (when the input is greater than largest uint176).
     *
     * Counterpart to Solidity's `uint176` operator.
     *
     * Requirements:
     *
     * - input must fit into 176 bits
     */
    function toUint176(uint256 value) internal pure returns (uint176) {
        if (value > type(uint176).max) {
            revert SafeCastOverflowedUintDowncast(176, value);
        }
        return uint176(value);
    }

    /**
     * @dev Returns the downcasted uint168 from uint256, reverting on
     * overflow (when the input is greater than largest uint168).
     *
     * Counterpart to Solidity's `uint168` operator.
     *
     * Requirements:
     *
     * - input must fit into 168 bits
     */
    function toUint168(uint256 value) internal pure returns (uint168) {
        if (value > type(uint168).max) {
            revert SafeCastOverflowedUintDowncast(168, value);
        }
        return uint168(value);
    }

    /**
     * @dev Returns the downcasted uint160 from uint256, reverting on
     * overflow (when the input is greater than largest uint160).
     *
     * Counterpart to Solidity's `uint160` operator.
     *
     * Requirements:
     *
     * - input must fit into 160 bits
     */
    function toUint160(uint256 value) internal pure returns (uint160) {
        if (value > type(uint160).max) {
            revert SafeCastOverflowedUintDowncast(160, value);
        }
        return uint160(value);
    }

    /**
     * @dev Returns the downcasted uint152 from uint256, reverting on
     * overflow (when the input is greater than largest uint152).
     *
     * Counterpart to Solidity's `uint152` operator.
     *
     * Requirements:
     *
     * - input must fit into 152 bits
     */
    function toUint152(uint256 value) internal pure returns (uint152) {
        if (value > type(uint152).max) {
            revert SafeCastOverflowedUintDowncast(152, value);
        }
        return uint152(value);
    }

    /**
     * @dev Returns the downcasted uint144 from uint256, reverting on
     * overflow (when the input is greater than largest uint144).
     *
     * Counterpart to Solidity's `uint144` operator.
     *
     * Requirements:
     *
     * - input must fit into 144 bits
     */
    function toUint144(uint256 value) internal pure returns (uint144) {
        if (value > type(uint144).max) {
            revert SafeCastOverflowedUintDowncast(144, value);
        }
        return uint144(value);
    }

    /**
     * @dev Returns the downcasted uint136 from uint256, reverting on
     * overflow (when the input is greater than largest uint136).
     *
     * Counterpart to Solidity's `uint136` operator.
     *
     * Requirements:
     *
     * - input must fit into 136 bits
     */
    function toUint136(uint256 value) internal pure returns (uint136) {
        if (value > type(uint136).max) {
            revert SafeCastOverflowedUintDowncast(136, value);
        }
        return uint136(value);
    }

    /**
     * @dev Returns the downcasted uint128 from uint256, reverting on
     * overflow (when the input is greater than largest uint128).
     *
     * Counterpart to Solidity's `uint128` operator.
     *
     * Requirements:
     *
     * - input must fit into 128 bits
     */
    function toUint128(uint256 value) internal pure returns (uint128) {
        if (value > type(uint128).max) {
            revert SafeCastOverflowedUintDowncast(128, value);
        }
        return uint128(value);
    }

    /**
     * @dev Returns the downcasted uint120 from uint256, reverting on
     * overflow (when the input is greater than largest uint120).
     *
     * Counterpart to Solidity's `uint120` operator.
     *
     * Requirements:
     *
     * - input must fit into 120 bits
     */
    function toUint120(uint256 value) internal pure returns (uint120) {
        if (value > type(uint120).max) {
            revert SafeCastOverflowedUintDowncast(120, value);
        }
        return uint120(value);
    }

    /**
     * @dev Returns the downcasted uint112 from uint256, reverting on
     * overflow (when the input is greater than largest uint112).
     *
     * Counterpart to Solidity's `uint112` operator.
     *
     * Requirements:
     *
     * - input must fit into 112 bits
     */
    function toUint112(uint256 value) internal pure returns (uint112) {
        if (value > type(uint112).max) {
            revert SafeCastOverflowedUintDowncast(112, value);
        }
        return uint112(value);
    }

    /**
     * @dev Returns the downcasted uint104 from uint256, reverting on
     * overflow (when the input is greater than largest uint104).
     *
     * Counterpart to Solidity's `uint104` operator.
     *
     * Requirements:
     *
     * - input must fit into 104 bits
     */
    function toUint104(uint256 value) internal pure returns (uint104) {
        if (value > type(uint104).max) {
            revert SafeCastOverflowedUintDowncast(104, value);
        }
        return uint104(value);
    }

    /**
     * @dev Returns the downcasted uint96 from uint256, reverting on
     * overflow (when the input is greater than largest uint96).
     *
     * Counterpart to Solidity's `uint96` operator.
     *
     * Requirements:
     *
     * - input must fit into 96 bits
     */
    function toUint96(uint256 value) internal pure returns (uint96) {
        if (value > type(uint96).max) {
            revert SafeCastOverflowedUintDowncast(96, value);
        }
        return uint96(value);
    }

    /**
     * @dev Returns the downcasted uint88 from uint256, reverting on
     * overflow (when the input is greater than largest uint88).
     *
     * Counterpart to Solidity's `uint88` operator.
     *
     * Requirements:
     *
     * - input must fit into 88 bits
     */
    function toUint88(uint256 value) internal pure returns (uint88) {
        if (value > type(uint88).max) {
            revert SafeCastOverflowedUintDowncast(88, value);
        }
        return uint88(value);
    }

    /**
     * @dev Returns the downcasted uint80 from uint256, reverting on
     * overflow (when the input is greater than largest uint80).
     *
     * Counterpart to Solidity's `uint80` operator.
     *
     * Requirements:
     *
     * - input must fit into 80 bits
     */
    function toUint80(uint256 value) internal pure returns (uint80) {
        if (value > type(uint80).max) {
            revert SafeCastOverflowedUintDowncast(80, value);
        }
        return uint80(value);
    }

    /**
     * @dev Returns the downcasted uint72 from uint256, reverting on
     * overflow (when the input is greater than largest uint72).
     *
     * Counterpart to Solidity's `uint72` operator.
     *
     * Requirements:
     *
     * - input must fit into 72 bits
     */
    function toUint72(uint256 value) internal pure returns (uint72) {
        if (value > type(uint72).max) {
            revert SafeCastOverflowedUintDowncast(72, value);
        }
        return uint72(value);
    }

    /**
     * @dev Returns the downcasted uint64 from uint256, reverting on
     * overflow (when the input is greater than largest uint64).
     *
     * Counterpart to Solidity's `uint64` operator.
     *
     * Requirements:
     *
     * - input must fit into 64 bits
     */
    function toUint64(uint256 value) internal pure returns (uint64) {
        if (value > type(uint64).max) {
            revert SafeCastOverflowedUintDowncast(64, value);
        }
        return uint64(value);
    }

    /**
     * @dev Returns the downcasted uint56 from uint256, reverting on
     * overflow (when the input is greater than largest uint56).
     *
     * Counterpart to Solidity's `uint56` operator.
     *
     * Requirements:
     *
     * - input must fit into 56 bits
     */
    function toUint56(uint256 value) internal pure returns (uint56) {
        if (value > type(uint56).max) {
            revert SafeCastOverflowedUintDowncast(56, value);
        }
        return uint56(value);
    }

    /**
     * @dev Returns the downcasted uint48 from uint256, reverting on
     * overflow (when the input is greater than largest uint48).
     *
     * Counterpart to Solidity's `uint48` operator.
     *
     * Requirements:
     *
     * - input must fit into 48 bits
     */
    function toUint48(uint256 value) internal pure returns (uint48) {
        if (value > type(uint48).max) {
            revert SafeCastOverflowedUintDowncast(48, value);
        }
        return uint48(value);
    }

    /**
     * @dev Returns the downcasted uint40 from uint256, reverting on
     * overflow (when the input is greater than largest uint40).
     *
     * Counterpart to Solidity's `uint40` operator.
     *
     * Requirements:
     *
     * - input must fit into 40 bits
     */
    function toUint40(uint256 value) internal pure returns (uint40) {
        if (value > type(uint40).max) {
            revert SafeCastOverflowedUintDowncast(40, value);
        }
        return uint40(value);
    }

    /**
     * @dev Returns the downcasted uint32 from uint256, reverting on
     * overflow (when the input is greater than largest uint32).
     *
     * Counterpart to Solidity's `uint32` operator.
     *
     * Requirements:
     *
     * - input must fit into 32 bits
     */
    function toUint32(uint256 value) internal pure returns (uint32) {
        if (value > type(uint32).max) {
            revert SafeCastOverflowedUintDowncast(32, value);
        }
        return uint32(value);
    }

    /**
     * @dev Returns the downcasted uint24 from uint256, reverting on
     * overflow (when the input is greater than largest uint24).
     *
     * Counterpart to Solidity's `uint24` operator.
     *
     * Requirements:
     *
     * - input must fit into 24 bits
     */
    function toUint24(uint256 value) internal pure returns (uint24) {
        if (value > type(uint24).max) {
            revert SafeCastOverflowedUintDowncast(24, value);
        }
        return uint24(value);
    }

    /**
     * @dev Returns the downcasted uint16 from uint256, reverting on
     * overflow (when the input is greater than largest uint16).
     *
     * Counterpart to Solidity's `uint16` operator.
     *
     * Requirements:
     *
     * - input must fit into 16 bits
     */
    function toUint16(uint256 value) internal pure returns (uint16) {
        if (value > type(uint16).max) {
            revert SafeCastOverflowedUintDowncast(16, value);
        }
        return uint16(value);
    }

    /**
     * @dev Returns the downcasted uint8 from uint256, reverting on
     * overflow (when the input is greater than largest uint8).
     *
     * Counterpart to Solidity's `uint8` operator.
     *
     * Requirements:
     *
     * - input must fit into 8 bits
     */
    function toUint8(uint256 value) internal pure returns (uint8) {
        if (value > type(uint8).max) {
            revert SafeCastOverflowedUintDowncast(8, value);
        }
        return uint8(value);
    }

    /**
     * @dev Converts a signed int256 into an unsigned uint256.
     *
     * Requirements:
     *
     * - input must be greater than or equal to 0.
     */
    function toUint256(int256 value) internal pure returns (uint256) {
        if (value < 0) {
            revert SafeCastOverflowedIntToUint(value);
        }
        return uint256(value);
    }

    /**
     * @dev Returns the downcasted int248 from int256, reverting on
     * overflow (when the input is less than smallest int248 or
     * greater than largest int248).
     *
     * Counterpart to Solidity's `int248` operator.
     *
     * Requirements:
     *
     * - input must fit into 248 bits
     */
    function toInt248(int256 value) internal pure returns (int248 downcasted) {
        downcasted = int248(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(248, value);
        }
    }

    /**
     * @dev Returns the downcasted int240 from int256, reverting on
     * overflow (when the input is less than smallest int240 or
     * greater than largest int240).
     *
     * Counterpart to Solidity's `int240` operator.
     *
     * Requirements:
     *
     * - input must fit into 240 bits
     */
    function toInt240(int256 value) internal pure returns (int240 downcasted) {
        downcasted = int240(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(240, value);
        }
    }

    /**
     * @dev Returns the downcasted int232 from int256, reverting on
     * overflow (when the input is less than smallest int232 or
     * greater than largest int232).
     *
     * Counterpart to Solidity's `int232` operator.
     *
     * Requirements:
     *
     * - input must fit into 232 bits
     */
    function toInt232(int256 value) internal pure returns (int232 downcasted) {
        downcasted = int232(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(232, value);
        }
    }

    /**
     * @dev Returns the downcasted int224 from int256, reverting on
     * overflow (when the input is less than smallest int224 or
     * greater than largest int224).
     *
     * Counterpart to Solidity's `int224` operator.
     *
     * Requirements:
     *
     * - input must fit into 224 bits
     */
    function toInt224(int256 value) internal pure returns (int224 downcasted) {
        downcasted = int224(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(224, value);
        }
    }

    /**
     * @dev Returns the downcasted int216 from int256, reverting on
     * overflow (when the input is less than smallest int216 or
     * greater than largest int216).
     *
     * Counterpart to Solidity's `int216` operator.
     *
     * Requirements:
     *
     * - input must fit into 216 bits
     */
    function toInt216(int256 value) internal pure returns (int216 downcasted) {
        downcasted = int216(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(216, value);
        }
    }

    /**
     * @dev Returns the downcasted int208 from int256, reverting on
     * overflow (when the input is less than smallest int208 or
     * greater than largest int208).
     *
     * Counterpart to Solidity's `int208` operator.
     *
     * Requirements:
     *
     * - input must fit into 208 bits
     */
    function toInt208(int256 value) internal pure returns (int208 downcasted) {
        downcasted = int208(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(208, value);
        }
    }

    /**
     * @dev Returns the downcasted int200 from int256, reverting on
     * overflow (when the input is less than smallest int200 or
     * greater than largest int200).
     *
     * Counterpart to Solidity's `int200` operator.
     *
     * Requirements:
     *
     * - input must fit into 200 bits
     */
    function toInt200(int256 value) internal pure returns (int200 downcasted) {
        downcasted = int200(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(200, value);
        }
    }

    /**
     * @dev Returns the downcasted int192 from int256, reverting on
     * overflow (when the input is less than smallest int192 or
     * greater than largest int192).
     *
     * Counterpart to Solidity's `int192` operator.
     *
     * Requirements:
     *
     * - input must fit into 192 bits
     */
    function toInt192(int256 value) internal pure returns (int192 downcasted) {
        downcasted = int192(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(192, value);
        }
    }

    /**
     * @dev Returns the downcasted int184 from int256, reverting on
     * overflow (when the input is less than smallest int184 or
     * greater than largest int184).
     *
     * Counterpart to Solidity's `int184` operator.
     *
     * Requirements:
     *
     * - input must fit into 184 bits
     */
    function toInt184(int256 value) internal pure returns (int184 downcasted) {
        downcasted = int184(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(184, value);
        }
    }

    /**
     * @dev Returns the downcasted int176 from int256, reverting on
     * overflow (when the input is less than smallest int176 or
     * greater than largest int176).
     *
     * Counterpart to Solidity's `int176` operator.
     *
     * Requirements:
     *
     * - input must fit into 176 bits
     */
    function toInt176(int256 value) internal pure returns (int176 downcasted) {
        downcasted = int176(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(176, value);
        }
    }

    /**
     * @dev Returns the downcasted int168 from int256, reverting on
     * overflow (when the input is less than smallest int168 or
     * greater than largest int168).
     *
     * Counterpart to Solidity's `int168` operator.
     *
     * Requirements:
     *
     * - input must fit into 168 bits
     */
    function toInt168(int256 value) internal pure returns (int168 downcasted) {
        downcasted = int168(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(168, value);
        }
    }

    /**
     * @dev Returns the downcasted int160 from int256, reverting on
     * overflow (when the input is less than smallest int160 or
     * greater than largest int160).
     *
     * Counterpart to Solidity's `int160` operator.
     *
     * Requirements:
     *
     * - input must fit into 160 bits
     */
    function toInt160(int256 value) internal pure returns (int160 downcasted) {
        downcasted = int160(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(160, value);
        }
    }

    /**
     * @dev Returns the downcasted int152 from int256, reverting on
     * overflow (when the input is less than smallest int152 or
     * greater than largest int152).
     *
     * Counterpart to Solidity's `int152` operator.
     *
     * Requirements:
     *
     * - input must fit into 152 bits
     */
    function toInt152(int256 value) internal pure returns (int152 downcasted) {
        downcasted = int152(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(152, value);
        }
    }

    /**
     * @dev Returns the downcasted int144 from int256, reverting on
     * overflow (when the input is less than smallest int144 or
     * greater than largest int144).
     *
     * Counterpart to Solidity's `int144` operator.
     *
     * Requirements:
     *
     * - input must fit into 144 bits
     */
    function toInt144(int256 value) internal pure returns (int144 downcasted) {
        downcasted = int144(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(144, value);
        }
    }

    /**
     * @dev Returns the downcasted int136 from int256, reverting on
     * overflow (when the input is less than smallest int136 or
     * greater than largest int136).
     *
     * Counterpart to Solidity's `int136` operator.
     *
     * Requirements:
     *
     * - input must fit into 136 bits
     */
    function toInt136(int256 value) internal pure returns (int136 downcasted) {
        downcasted = int136(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(136, value);
        }
    }

    /**
     * @dev Returns the downcasted int128 from int256, reverting on
     * overflow (when the input is less than smallest int128 or
     * greater than largest int128).
     *
     * Counterpart to Solidity's `int128` operator.
     *
     * Requirements:
     *
     * - input must fit into 128 bits
     */
    function toInt128(int256 value) internal pure returns (int128 downcasted) {
        downcasted = int128(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(128, value);
        }
    }

    /**
     * @dev Returns the downcasted int120 from int256, reverting on
     * overflow (when the input is less than smallest int120 or
     * greater than largest int120).
     *
     * Counterpart to Solidity's `int120` operator.
     *
     * Requirements:
     *
     * - input must fit into 120 bits
     */
    function toInt120(int256 value) internal pure returns (int120 downcasted) {
        downcasted = int120(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(120, value);
        }
    }

    /**
     * @dev Returns the downcasted int112 from int256, reverting on
     * overflow (when the input is less than smallest int112 or
     * greater than largest int112).
     *
     * Counterpart to Solidity's `int112` operator.
     *
     * Requirements:
     *
     * - input must fit into 112 bits
     */
    function toInt112(int256 value) internal pure returns (int112 downcasted) {
        downcasted = int112(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(112, value);
        }
    }

    /**
     * @dev Returns the downcasted int104 from int256, reverting on
     * overflow (when the input is less than smallest int104 or
     * greater than largest int104).
     *
     * Counterpart to Solidity's `int104` operator.
     *
     * Requirements:
     *
     * - input must fit into 104 bits
     */
    function toInt104(int256 value) internal pure returns (int104 downcasted) {
        downcasted = int104(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(104, value);
        }
    }

    /**
     * @dev Returns the downcasted int96 from int256, reverting on
     * overflow (when the input is less than smallest int96 or
     * greater than largest int96).
     *
     * Counterpart to Solidity's `int96` operator.
     *
     * Requirements:
     *
     * - input must fit into 96 bits
     */
    function toInt96(int256 value) internal pure returns (int96 downcasted) {
        downcasted = int96(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(96, value);
        }
    }

    /**
     * @dev Returns the downcasted int88 from int256, reverting on
     * overflow (when the input is less than smallest int88 or
     * greater than largest int88).
     *
     * Counterpart to Solidity's `int88` operator.
     *
     * Requirements:
     *
     * - input must fit into 88 bits
     */
    function toInt88(int256 value) internal pure returns (int88 downcasted) {
        downcasted = int88(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(88, value);
        }
    }

    /**
     * @dev Returns the downcasted int80 from int256, reverting on
     * overflow (when the input is less than smallest int80 or
     * greater than largest int80).
     *
     * Counterpart to Solidity's `int80` operator.
     *
     * Requirements:
     *
     * - input must fit into 80 bits
     */
    function toInt80(int256 value) internal pure returns (int80 downcasted) {
        downcasted = int80(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(80, value);
        }
    }

    /**
     * @dev Returns the downcasted int72 from int256, reverting on
     * overflow (when the input is less than smallest int72 or
     * greater than largest int72).
     *
     * Counterpart to Solidity's `int72` operator.
     *
     * Requirements:
     *
     * - input must fit into 72 bits
     */
    function toInt72(int256 value) internal pure returns (int72 downcasted) {
        downcasted = int72(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(72, value);
        }
    }

    /**
     * @dev Returns the downcasted int64 from int256, reverting on
     * overflow (when the input is less than smallest int64 or
     * greater than largest int64).
     *
     * Counterpart to Solidity's `int64` operator.
     *
     * Requirements:
     *
     * - input must fit into 64 bits
     */
    function toInt64(int256 value) internal pure returns (int64 downcasted) {
        downcasted = int64(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(64, value);
        }
    }

    /**
     * @dev Returns the downcasted int56 from int256, reverting on
     * overflow (when the input is less than smallest int56 or
     * greater than largest int56).
     *
     * Counterpart to Solidity's `int56` operator.
     *
     * Requirements:
     *
     * - input must fit into 56 bits
     */
    function toInt56(int256 value) internal pure returns (int56 downcasted) {
        downcasted = int56(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(56, value);
        }
    }

    /**
     * @dev Returns the downcasted int48 from int256, reverting on
     * overflow (when the input is less than smallest int48 or
     * greater than largest int48).
     *
     * Counterpart to Solidity's `int48` operator.
     *
     * Requirements:
     *
     * - input must fit into 48 bits
     */
    function toInt48(int256 value) internal pure returns (int48 downcasted) {
        downcasted = int48(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(48, value);
        }
    }

    /**
     * @dev Returns the downcasted int40 from int256, reverting on
     * overflow (when the input is less than smallest int40 or
     * greater than largest int40).
     *
     * Counterpart to Solidity's `int40` operator.
     *
     * Requirements:
     *
     * - input must fit into 40 bits
     */
    function toInt40(int256 value) internal pure returns (int40 downcasted) {
        downcasted = int40(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(40, value);
        }
    }

    /**
     * @dev Returns the downcasted int32 from int256, reverting on
     * overflow (when the input is less than smallest int32 or
     * greater than largest int32).
     *
     * Counterpart to Solidity's `int32` operator.
     *
     * Requirements:
     *
     * - input must fit into 32 bits
     */
    function toInt32(int256 value) internal pure returns (int32 downcasted) {
        downcasted = int32(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(32, value);
        }
    }

    /**
     * @dev Returns the downcasted int24 from int256, reverting on
     * overflow (when the input is less than smallest int24 or
     * greater than largest int24).
     *
     * Counterpart to Solidity's `int24` operator.
     *
     * Requirements:
     *
     * - input must fit into 24 bits
     */
    function toInt24(int256 value) internal pure returns (int24 downcasted) {
        downcasted = int24(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(24, value);
        }
    }

    /**
     * @dev Returns the downcasted int16 from int256, reverting on
     * overflow (when the input is less than smallest int16 or
     * greater than largest int16).
     *
     * Counterpart to Solidity's `int16` operator.
     *
     * Requirements:
     *
     * - input must fit into 16 bits
     */
    function toInt16(int256 value) internal pure returns (int16 downcasted) {
        downcasted = int16(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(16, value);
        }
    }

    /**
     * @dev Returns the downcasted int8 from int256, reverting on
     * overflow (when the input is less than smallest int8 or
     * greater than largest int8).
     *
     * Counterpart to Solidity's `int8` operator.
     *
     * Requirements:
     *
     * - input must fit into 8 bits
     */
    function toInt8(int256 value) internal pure returns (int8 downcasted) {
        downcasted = int8(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(8, value);
        }
    }

    /**
     * @dev Converts an unsigned uint256 into a signed int256.
     *
     * Requirements:
     *
     * - input must be less than or equal to maxInt256.
     */
    function toInt256(uint256 value) internal pure returns (int256) {
        // Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive
        if (value > uint256(type(int256).max)) {
            revert SafeCastOverflowedUintToInt(value);
        }
        return int256(value);
    }

    /**
     * @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.
     */
    function toUint(bool b) internal pure returns (uint256 u) {
        assembly ("memory-safe") {
            u := iszero(iszero(b))
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)

pragma solidity ^0.8.20;

/**
 * @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);
}

Settings
{
  "remappings": [
    "lib/universal-router:solmate/=lib/solmate/",
    "lib/universal-router:permit2/=lib/permit2/",
    "ds-test/=lib/solmate/lib/ds-test/src/",
    "forge-std/=lib/forge-std/src/",
    "contracts:openzeppelin/=lib/openzeppelin-contracts/contracts/",
    "test:openzeppelin/=lib/openzeppelin-contracts/contracts/",
    "script:openzeppelin/=lib/openzeppelin-contracts/contracts/",
    "contracts:openzeppelin-v5/=lib/openzeppelin-contracts-v5/contracts/",
    "script:openzeppelin-v5/=lib/openzeppelin-contracts-v5/contracts/",
    "test:openzeppelin-v5/=lib/openzeppelin-contracts-v5/contracts/",
    "contracts:openzeppelin-v4/=lib/openzeppelin-contracts/contracts/",
    "contracts:openzeppelin-upgradeable/=lib/openzeppelin-contracts-upgradeable/contracts/",
    "contracts:solmate/=lib/solmate/src/",
    "lib:solmate/=lib/solmate/",
    "script:solmate/=lib/solmate/src/",
    "contracts:permit2/=lib/permit2/src/",
    "script:permit2/=lib/permit2/src/",
    "universal-router/=lib/universal-router/contracts/",
    "multicall/=lib/multicall/src/",
    "@uniswap/v3-core/contracts/=contracts/univ3/",
    "@uniswap/v2-core/contracts/=contracts/univ2/",
    "@openzeppelin/=lib/openzeppelin-contracts/",
    "@ds/=lib/multicall/lib/ds-test/src/",
    "@std/=lib/multicall/lib/forge-std/src/",
    "erc4626-tests/=lib/openzeppelin-contracts/lib/erc4626-tests/",
    "forge-gas-snapshot/=lib/permit2/lib/forge-gas-snapshot/src/",
    "halmos-cheatcodes/=lib/openzeppelin-contracts-v5/lib/halmos-cheatcodes/src/",
    "openzeppelin-contracts-v5/=lib/openzeppelin-contracts-v5/",
    "openzeppelin-contracts/=lib/openzeppelin-contracts/",
    "openzeppelin/=lib/openzeppelin-contracts/contracts/",
    "permit2/=lib/permit2/",
    "prb-math/=lib/prb-math/src/",
    "solmate/=lib/solmate/src/",
    "v3-periphery/=lib/v3-periphery/contracts/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 1000
  },
  "metadata": {
    "useLiteralContent": false,
    "bytecodeHash": "none",
    "appendCBOR": false
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "evmVersion": "cancun",
  "viaIR": true
}

Contract Security Audit

Contract ABI

API
[{"inputs":[{"internalType":"address","name":"_owner","type":"address"},{"internalType":"address","name":"_saleToken","type":"address"},{"internalType":"address","name":"_paymentToken","type":"address"},{"internalType":"uint64","name":"_startTime","type":"uint64"},{"internalType":"uint64","name":"_endTime","type":"uint64"},{"internalType":"uint256","name":"_tokensForSale","type":"uint256"},{"internalType":"uint256","name":"_totalRaise","type":"uint256"},{"internalType":"uint256","name":"_minEthPerErc20Wad","type":"uint256"},{"internalType":"uint64","name":"_tokenClaimTime","type":"uint64"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AlreadyClaimed","type":"error"},{"inputs":[],"name":"AlreadyFinalized","type":"error"},{"inputs":[],"name":"CannotSweepSaleToken","type":"error"},{"inputs":[],"name":"ERC20Disabled","type":"error"},{"inputs":[],"name":"InsufficientSaleTokens","type":"error"},{"inputs":[],"name":"NotCanceled","type":"error"},{"inputs":[],"name":"NotFinalized","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":"ReentrancyGuardReentrantCall","type":"error"},{"inputs":[],"name":"SaleCanceled","type":"error"},{"inputs":[],"name":"SaleNotActive","type":"error"},{"inputs":[],"name":"SaleNotEnded","type":"error"},{"inputs":[],"name":"TokenClaimLocked","type":"error"},{"inputs":[],"name":"ZeroAmount","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"totalEthCommitted","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"totalErc20Committed","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"saleTokenWithdrawn","type":"uint256"}],"name":"Canceled","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"uint256","name":"tokenAmount","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"refundEth","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"refundErc20","type":"uint256"}],"name":"Claimed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"},{"indexed":false,"internalType":"bool","name":"isEth","type":"bool"}],"name":"Contributed","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"totalCommitted","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"acceptedCommitted","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"tokensSold","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"ethToOwner","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"erc20ToOwner","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"unsoldBurned","type":"uint256"}],"name":"Finalized","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":"user","type":"address"},{"indexed":false,"internalType":"uint256","name":"ethAmount","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"erc20Amount","type":"uint256"}],"name":"RefundedOnCancel","type":"event"},{"inputs":[],"name":"acceptedFinal","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"cancel","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"canceled","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"claimRefund","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"claimSaleTokens","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"}],"name":"claimable","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"committedFinal","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"}],"name":"committedOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"erc20Amount","type":"uint256"}],"name":"contribute","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"endTime","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"erc20CommittedOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"ethCommittedOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"}],"name":"expectedOutcome","outputs":[{"internalType":"uint256","name":"expectedSaleToken","type":"uint256"},{"internalType":"uint256","name":"expectedRefundEth","type":"uint256"},{"internalType":"uint256","name":"expectedRefundErc20","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"finalize","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"finalized","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"hasClaimedRefund","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"hasClaimedTokens","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isActive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"minEthPerErc20Wad","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"paymentToken","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"refundOnCancel","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"refundedOnCancel","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"saleToken","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"startTime","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"token","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"sweep","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"tokenClaimTime","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"tokensForSale","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"tokensSold","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalClaimed","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalCommitted","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalErc20Committed","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalEthCommitted","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalRaise","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]

6101803461037257601f61236838819003918201601f19168301916001600160401b038311848410176103765780849261012094604052833981010312610372576100498161038a565b6100556020830161038a565b906100626040840161038a565b9061006f6060850161039e565b61007b6080860161039e565b9060a08601519360c08701519561009a61010060e08a0151990161039e565b946001600160a01b0316801561035f575f80546001600160a01b031981168317825560405192916001600160a01b03909116907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09080a3600180556001600160a01b0382161561032f575085156102ff576001600160401b038481169084168111156102d45787156102a5576001600160401b038616106102705760805260a05260e0526101005261012052610140526101605260c052604051611fb590816103b38239608051818181610462015281816105dc01528181610d9a015281816110430152818161130e015281816113f301526119e1015260a0518181816107220152818161089701528181610a2f01528181610c2701528181610c93015281816110c1015281816114ec0152611b3b015260c05181818161099201528181610a070152610f00015260e05181818161041d01528181610f7b01526115cf015261010051818181610d51015281816113aa015281816114a90152818161162a01526119b901526101205181818161037c0152611258015261014051818181610dcd015281816114260152818161156a015281816118270152611a370152610160518181816111f1015281816117870152611a7d0152f35b60405162461bcd60e51b815260206004820152600d60248201526c18db185a5b551a5b594f195b99609a1b6044820152606490fd5b60405162461bcd60e51b8152602060048201526007602482015266072616973653d360cc1b6044820152606490fd5b606460405162461bcd60e51b815260206004820152600460248201526374696d6560e01b6044820152fd5b60405162461bcd60e51b81526020600482015260086024820152670746f6b656e733d360c41b6044820152606490fd5b62461bcd60e51b815260206004820152600b60248201526a073616c65546f6b656e3d360ac1b6044820152606490fd5b631e4fbdf760e01b5f525f60045260245ffd5b5f80fd5b634e487b7160e01b5f52604160045260245ffd5b51906001600160a01b038216820361037257565b51906001600160401b03821682036103725756fe60808060405260043610156100da575b50361561001a575f80fd5b6100226115c4565b156100b257341561008a57335f52600460205260405f206100443482546115a3565b9055610052346002546115a3565b600255604051348152600160208201527f5668a6b5e4a1f97d2c7d98e7f433e0ae888d3e6301a750d79a9cf51a569c284560403392a2005b7f1f2a2005000000000000000000000000000000000000000000000000000000005f5260045ffd5b7fb7b24097000000000000000000000000000000000000000000000000000000005f5260045ffd5b5f3560e01c90816312aef8c314611555575080631d3231d41461153457806322f3e2d4146115105780633013ce29146114cd5780633197cbb61461148957806332e54d0e146112145780633996dc8f146111da5780633f9942ff146111b8578063402914f5146111955780634bb278f31461116d578063518ab2a8146111505780635e37ac711461112557806368a94dfc146110e85780636ea056a914611003578063715018a614610f9f57806378e9792514610f5b57806380bffa0514610f235780638351e74314610ee95780638da5cb5b14610ec457806398afa30c14610e8c5780639e5bc54614610e6f578063b3f05b9714610e4d578063b4e9dcf114610e30578063b5545a3c14610b67578063c1cbbca714610826578063d515206014610809578063d54ad2a1146107ec578063d94442e5146107cf578063dd0fe49d14610645578063e3eb0ff514610600578063e985e367146105bd578063ea8a1af0146103dd578063ed613ac1146103a0578063f2cae7f71461035c578063f2fde38b146102b35763f6ebdac614610272575f61000f565b346102af5760203660031901126102af576001600160a01b0361029361158d565b165f52600e602052602060ff60405f2054166040519015158152f35b5f80fd5b346102af5760203660031901126102af576001600160a01b036102d461158d565b6102dc611e4a565b168015610330576001600160a01b035f548273ffffffffffffffffffffffffffffffffffffffff198216175f55167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a3005b7f1e4fbdf7000000000000000000000000000000000000000000000000000000005f525f60045260245ffd5b346102af575f3660031901126102af57602060405167ffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b346102af5760203660031901126102af576001600160a01b036103c161158d565b165f526006602052602060ff60405f2054166040519015158152f35b346102af575f3660031901126102af576103f5611e4a565b6103fd611960565b60ff6009541661059557600d5460ff811661056d5767ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000000000001642106100b25760ff1916600117600d556040516370a0823160e01b81523060048201527f00000000000000000000000000000000000000000000000000000000000000006020826024816001600160a01b0385165afa908115610562575f9161050e575b7f3170b0d5a3dad6f60904b2195a4afca13a6f4c93df34e575d0d21b3de0b2d183925081806104f2575b5050600254600354604080519283526020830191909152810191909152606090a160018055005b610507916001600160a01b035f541690611dc6565b82816104cb565b90506020823d60201161055a575b8161052960209383611651565b810103126102af577f3170b0d5a3dad6f60904b2195a4afca13a6f4c93df34e575d0d21b3de0b2d1839151906104a1565b3d915061051c565b6040513d5f823e3d90fd5b7f0943552b000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f475a2535000000000000000000000000000000000000000000000000000000005f5260045ffd5b346102af575f3660031901126102af5760206040516001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000168152f35b346102af5760203660031901126102af5761064161062461061f61158d565b611757565b604080519384526020840192909252908201529081906060820190565b0390f35b346102af575f3660031901126102af5761065d611960565b60ff600d5416156107a757335f52600e60205260ff60405f20541661077f57335f52600460205260405f2054335f52600560205260405f20548115808091610777575b61008a57335f52600e60205260405f20600160ff198254161790551561074b575b806106fe575b60405191825260208201527fb921f5ce06792dcfcc3e267d163af66f44e848d7a054fd7941e2d971234fe51b60403392a260018055005b335f5260056020525f60408120556107188160035461174a565b60035561074681337f0000000000000000000000000000000000000000000000000000000000000000611dc6565b6106c7565b335f5260046020525f60408120556107658260025461174a565b6002556107728233611e89565b6106c1565b5081156106a0565b7f646cf558000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f76f1a003000000000000000000000000000000000000000000000000000000005f5260045ffd5b346102af575f3660031901126102af576020600b54604051908152f35b346102af575f3660031901126102af576020600854604051908152f35b346102af575f3660031901126102af576020600a54604051908152f35b60203660031901126102af5760043561083d611960565b6108456115c4565b156100b25734158080610b5f575b61008a5781151580610a2d575b335f5260046020526108763460405f20546115a3565b335f52600560205261088c8460405f20546115a3565b926001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016151580610a04575b806109fb575b610986575b15610931575b506108dc575b60018055005b335f52600560205260405f20556108f5816003546115a3565b6003556040519081525f60208201527f5668a6b5e4a1f97d2c7d98e7f433e0ae888d3e6301a750d79a9cf51a569c284560403392a280806108d6565b335f52600460205260405f205561094a346002546115a3565b600255604051348152600160208201527f5668a6b5e4a1f97d2c7d98e7f433e0ae888d3e6301a750d79a9cf51a569c284560403392a2836108d0565b6109908483611f01565b7f000000000000000000000000000000000000000000000000000000000000000011156108ca57606460405162461bcd60e51b815260206004820152600860248201527f6d696e526174696f0000000000000000000000000000000000000000000000006044820152fd5b508315156108c5565b507f000000000000000000000000000000000000000000000000000000000000000015156108bf565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03811615610b37575f80916040518260208201917f23b872dd00000000000000000000000000000000000000000000000000000000835233602482015230604482015288606482015260648152610aad608482611651565b51925af1610ab9611d6f565b81610b08575b5061086057606460405162461bcd60e51b815260206004820152600360248201527f53544600000000000000000000000000000000000000000000000000000000006044820152fd5b8051801592508215610b1d575b505084610abf565b610b309250602080918301019101611dae565b8480610b15565b7fcd524a8d000000000000000000000000000000000000000000000000000000005f5260045ffd5b508115610853565b346102af575f3660031901126102af57610b7f611960565b60ff600d541661056d5760ff6009541615610d46575b60ff6009541615610d1e57335f52600760205260ff60405f20541661077f57335f52600760205260405f20600160ff198254161790555f5f600a5480610c5f575b5081610c50575b80610c20575b604051915f8352602083015260408201527f9cdcf2f7714cca3508c7f0110b04a90a80a3a8dd0e35de99689db74d28c5383e60603392a260018055005b610c4b81337f0000000000000000000000000000000000000000000000000000000000000000611dc6565b610be3565b610c5a8233611e89565b610bdd565b610c6b600b548261174a565b80610c77575b50610bd6565b335f52600460205260405f2054610cfc575b6001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016151580610ce7575b15610c7157610ce09250610cdb90335f52600560205260405f2054611687565b61169a565b8280610c71565b50335f52600560205260405f20541515610cbb565b9250335f526004602052610d1881610cdb8560405f2054611687565b92610c89565b7f1bee0d5a000000000000000000000000000000000000000000000000000000005f5260045ffd5b67ffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000164210610b95576040516370a0823160e01b81523060048201526020816024816001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000165afa908115610562575f91610dfe575b507f000000000000000000000000000000000000000000000000000000000000000011610b9557610df9611999565b610b95565b90506020813d602011610e28575b81610e1960209383611651565b810103126102af575181610dca565b3d9150610e0c565b346102af575f3660031901126102af576020600354604051908152f35b346102af575f3660031901126102af57602060ff600954166040519015158152f35b346102af575f3660031901126102af576020600254604051908152f35b346102af5760203660031901126102af576001600160a01b03610ead61158d565b165f526004602052602060405f2054604051908152f35b346102af575f3660031901126102af5760206001600160a01b035f5416604051908152f35b346102af575f3660031901126102af5760206040517f00000000000000000000000000000000000000000000000000000000000000008152f35b346102af5760203660031901126102af576001600160a01b03610f4461158d565b165f526005602052602060405f2054604051908152f35b346102af575f3660031901126102af57602060405167ffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b346102af575f3660031901126102af57610fb7611e4a565b5f6001600160a01b03815473ffffffffffffffffffffffffffffffffffffffff1981168355167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a3005b346102af5760403660031901126102af5761101c61158d565b602435611027611e4a565b61102f611960565b6001600160a01b0382166001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001681149081156110b5575b5061108d57801561008a576108d6916001600160a01b035f541690611dc6565b7f790be160000000000000000000000000000000000000000000000000000000005f5260045ffd5b90506001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016148361106d565b346102af5760203660031901126102af576001600160a01b0361110961158d565b165f526007602052602060ff60405f2054166040519015158152f35b346102af5760203660031901126102af57602061114861114361158d565b61171d565b604051908152f35b346102af575f3660031901126102af576020600c54604051908152f35b346102af575f3660031901126102af57611185611e4a565b61118d611960565b6108d6611999565b346102af5760203660031901126102af5760206111486111b361158d565b6116b8565b346102af575f3660031901126102af57602060ff600d54166040519015158152f35b346102af575f3660031901126102af5760206040517f00000000000000000000000000000000000000000000000000000000000000008152f35b346102af575f3660031901126102af5761122c611960565b60ff600d541661056d5760ff600954161561139f575b60ff6009541615610d1e5767ffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016421061137757335f52600660205260ff60405f20541661077f57335f52600660205260405f20600160ff198254161790555f600a5480611337575b50806112f8575b6040519081525f60208201525f60408201527f9cdcf2f7714cca3508c7f0110b04a90a80a3a8dd0e35de99689db74d28c5383e60603392a260018055005b611304816008546115a3565b60085561133281337f0000000000000000000000000000000000000000000000000000000000000000611dc6565b6112ba565b6113403361171d565b8015158061136c575b611354575b506112b3565b6113659250610cdb90600c54611687565b818061134e565b50600c541515611349565b7fac262da8000000000000000000000000000000000000000000000000000000005f5260045ffd5b67ffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000164210611242576040516370a0823160e01b81523060048201526020816024816001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000165afa908115610562575f91611457575b507f00000000000000000000000000000000000000000000000000000000000000001161124257611452611999565b611242565b90506020813d602011611481575b8161147260209383611651565b810103126102af575181611423565b3d9150611465565b346102af575f3660031901126102af57602060405167ffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b346102af575f3660031901126102af5760206040516001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000168152f35b346102af575f3660031901126102af57602061152a6115c4565b6040519015158152f35b346102af575f3660031901126102af576020611148600254600354906115a3565b346102af575f3660031901126102af576020907f00000000000000000000000000000000000000000000000000000000000000008152f35b600435906001600160a01b03821682036102af57565b919082018092116115b057565b634e487b7160e01b5f52601160045260245ffd5b67ffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000164210158061161e575b80611611575b806116065790565b5060ff600d54161590565b5060ff60095416156115fe565b5067ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000000000001642106115f8565b90601f8019910116810190811067ffffffffffffffff82111761167357604052565b634e487b7160e01b5f52604160045260245ffd5b818102929181159184041417156115b057565b81156116a4570490565b634e487b7160e01b5f52601260045260245ffd5b60ff600954161561171857600b5415611718576116d48161171d565b908115611712576001600160a01b03165f52600660205260ff60405f20541661171857600a54801561171257610cdb61170f92600c54611687565b90565b50505f90565b505f90565b6001600160a01b0361170f9116805f52600460205260405f2054905f52600560205260405f2054906115a3565b919082039182116115b057565b9060ff600d54166119345760ff600954166118765761177b600254600354906115a3565b90811561186c576118167f0000000000000000000000000000000000000000000000000000000000000000928381105f1461185157610cdb6001600160a01b036117e76117e084610cdb81995b5f908b61181c575b506117da8c61171d565b90611687565b968461174a565b961695865f52600460205261180483610cdb8360405f2054611687565b965f52600560205260405f2054611687565b91929190565b61184b9150610cdb8c7f0000000000000000000000000000000000000000000000000000000000000000611687565b5f6117d0565b610cdb6001600160a01b036117e76117e084610cdb896117c8565b5f92508291508190565b90600a5491821561186c5761188a8261171d565b918215611929576001600160a01b031691825f5260066020528360ff60405f2054165f146119155750505f5b6118c2600b548561174a565b925f945f94825f52600760205260ff60405f205416156118e5575b505050929190565b82610cdb9293975061190c9496505f52600460205261180483610cdb8360405f2054611687565b915f80806118dd565b610cdb61192492600c54611687565b6118b6565b505f92508291508190565b906001600160a01b031690815f52600460205260405f2054915f52600560205260405f2054905f929190565b600260015414611971576002600155565b7f3ee5aeb5000000000000000000000000000000000000000000000000000000005f5260045ffd5b60095460ff81166105955760ff600d541661056d5767ffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000164210611d47577f0000000000000000000000000000000000000000000000000000000000000000604051916370a0823160e01b83523060048401526020836024816001600160a01b0386165afa928315610562575f93611d13575b507f0000000000000000000000000000000000000000000000000000000000000000809310611ceb5760ff1916600117600955600254600354611a76916115a3565b9081600a557f00000000000000000000000000000000000000000000000000000000000000008083105f14611ce45782935b84600b555f908515159283611cc9575b5081611ac79181600c5561174a565b9283611bfd575b50907f405f1a04d80bf0b461328081d00a8ce9cbddf73dff58ce6d19db0cf087e9d1549460c09493925f915f938615159081611bf5575b50611b2d575b604051958652602086015260408501526060840152608083015260a0820152a1565b8560025480611bbe575b50507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b038116151580611bb3575b611b77575b50611b0b565b9350611b8986610cdb83600354611687565b938480611b97575b50611b71565b611bac916001600160a01b035f541690611dc6565b5f84611b91565b506003541515611b6c565b82611bce939550610cdb91611687565b9182611bdc575b855f611b37565b611bf0836001600160a01b035f5416611e89565b611bd5565b90505f611b05565b5f8091604096959493965182602082019163a9059cbb60e01b835261dead602482015287604482015260448152611c35606482611651565b51925af1611c41611d6f565b81611c9a575b5015611c56579091925f611ace565b606460405162461bcd60e51b815260206004820152600260248201527f53540000000000000000000000000000000000000000000000000000000000006044820152fd5b8051801592508215611caf575b50505f611c47565b611cc29250602080918301019101611dae565b5f80611ca7565b819250611cdd90610cdb88611ac794611687565b9190611ab8565b8093611aa8565b7fd5867aeb000000000000000000000000000000000000000000000000000000005f5260045ffd5b9092506020813d602011611d3f575b81611d2f60209383611651565b810103126102af5751915f611a34565b3d9150611d22565b7f9d98b04b000000000000000000000000000000000000000000000000000000005f5260045ffd5b3d15611da9573d9067ffffffffffffffff82116116735760405191611d9e601f8201601f191660200184611651565b82523d5f602084013e565b606090565b908160209103126102af575180151581036102af5790565b5f9291838093604051906001600160a01b03602083019463a9059cbb60e01b8652166024830152604482015260448152611e01606482611651565b51925af1611e0d611d6f565b81611e1b575b5015611c5657565b8051801592508215611e30575b50505f611e13565b611e439250602080918301019101611dae565b5f80611e28565b6001600160a01b035f54163303611e5d57565b7f118cdaa7000000000000000000000000000000000000000000000000000000005f523360045260245ffd5b5f9190829160405190611e9d602083611651565b83825260208201915f36843751925af1611eb5611d6f565b5015611ebd57565b606460405162461bcd60e51b815260206004820152600360248201527f53544500000000000000000000000000000000000000000000000000000000006044820152fd5b90670de0b6b3a76400008202905f19670de0b6b3a7640000840992828085109403938085039414611fa95783821115611f9157670de0b6b3a7640000829109815f0382168092046002816003021880820260020302808202600203028082026002030280820260020302808202600203028091026002030293600183805f03040190848311900302920304170290565b50634e487b715f52156003026011186020526024601cfd5b509061170f925061169a56000000000000000000000000433b80b1fdf0d68d95c4833966c7eb3d76398bf3000000000000000000000000ae60eafb73eb0516951ab20089cff32ac9dc63b7000000000000000000000000848cebe015542f4a0668d457a19e17992d883ed900000000000000000000000000000000000000000000000000000000690b4a5000000000000000000000000000000000000000000000000000000000690f3ed000000000000000000000000000000000000000000012af3eb05d6042e969696a00000000000000000000000000000000000000000000043c33c19375648000000000000000000000000000000000000000000000000000008ac7230489e8000000000000000000000000000000000000000000000000000000000000690fe790

Deployed Bytecode

0x60808060405260043610156100da575b50361561001a575f80fd5b6100226115c4565b156100b257341561008a57335f52600460205260405f206100443482546115a3565b9055610052346002546115a3565b600255604051348152600160208201527f5668a6b5e4a1f97d2c7d98e7f433e0ae888d3e6301a750d79a9cf51a569c284560403392a2005b7f1f2a2005000000000000000000000000000000000000000000000000000000005f5260045ffd5b7fb7b24097000000000000000000000000000000000000000000000000000000005f5260045ffd5b5f3560e01c90816312aef8c314611555575080631d3231d41461153457806322f3e2d4146115105780633013ce29146114cd5780633197cbb61461148957806332e54d0e146112145780633996dc8f146111da5780633f9942ff146111b8578063402914f5146111955780634bb278f31461116d578063518ab2a8146111505780635e37ac711461112557806368a94dfc146110e85780636ea056a914611003578063715018a614610f9f57806378e9792514610f5b57806380bffa0514610f235780638351e74314610ee95780638da5cb5b14610ec457806398afa30c14610e8c5780639e5bc54614610e6f578063b3f05b9714610e4d578063b4e9dcf114610e30578063b5545a3c14610b67578063c1cbbca714610826578063d515206014610809578063d54ad2a1146107ec578063d94442e5146107cf578063dd0fe49d14610645578063e3eb0ff514610600578063e985e367146105bd578063ea8a1af0146103dd578063ed613ac1146103a0578063f2cae7f71461035c578063f2fde38b146102b35763f6ebdac614610272575f61000f565b346102af5760203660031901126102af576001600160a01b0361029361158d565b165f52600e602052602060ff60405f2054166040519015158152f35b5f80fd5b346102af5760203660031901126102af576001600160a01b036102d461158d565b6102dc611e4a565b168015610330576001600160a01b035f548273ffffffffffffffffffffffffffffffffffffffff198216175f55167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a3005b7f1e4fbdf7000000000000000000000000000000000000000000000000000000005f525f60045260245ffd5b346102af575f3660031901126102af57602060405167ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000690fe790168152f35b346102af5760203660031901126102af576001600160a01b036103c161158d565b165f526006602052602060ff60405f2054166040519015158152f35b346102af575f3660031901126102af576103f5611e4a565b6103fd611960565b60ff6009541661059557600d5460ff811661056d5767ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000690b4a501642106100b25760ff1916600117600d556040516370a0823160e01b81523060048201527f000000000000000000000000ae60eafb73eb0516951ab20089cff32ac9dc63b76020826024816001600160a01b0385165afa908115610562575f9161050e575b7f3170b0d5a3dad6f60904b2195a4afca13a6f4c93df34e575d0d21b3de0b2d183925081806104f2575b5050600254600354604080519283526020830191909152810191909152606090a160018055005b610507916001600160a01b035f541690611dc6565b82816104cb565b90506020823d60201161055a575b8161052960209383611651565b810103126102af577f3170b0d5a3dad6f60904b2195a4afca13a6f4c93df34e575d0d21b3de0b2d1839151906104a1565b3d915061051c565b6040513d5f823e3d90fd5b7f0943552b000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f475a2535000000000000000000000000000000000000000000000000000000005f5260045ffd5b346102af575f3660031901126102af5760206040516001600160a01b037f000000000000000000000000ae60eafb73eb0516951ab20089cff32ac9dc63b7168152f35b346102af5760203660031901126102af5761064161062461061f61158d565b611757565b604080519384526020840192909252908201529081906060820190565b0390f35b346102af575f3660031901126102af5761065d611960565b60ff600d5416156107a757335f52600e60205260ff60405f20541661077f57335f52600460205260405f2054335f52600560205260405f20548115808091610777575b61008a57335f52600e60205260405f20600160ff198254161790551561074b575b806106fe575b60405191825260208201527fb921f5ce06792dcfcc3e267d163af66f44e848d7a054fd7941e2d971234fe51b60403392a260018055005b335f5260056020525f60408120556107188160035461174a565b60035561074681337f000000000000000000000000848cebe015542f4a0668d457a19e17992d883ed9611dc6565b6106c7565b335f5260046020525f60408120556107658260025461174a565b6002556107728233611e89565b6106c1565b5081156106a0565b7f646cf558000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f76f1a003000000000000000000000000000000000000000000000000000000005f5260045ffd5b346102af575f3660031901126102af576020600b54604051908152f35b346102af575f3660031901126102af576020600854604051908152f35b346102af575f3660031901126102af576020600a54604051908152f35b60203660031901126102af5760043561083d611960565b6108456115c4565b156100b25734158080610b5f575b61008a5781151580610a2d575b335f5260046020526108763460405f20546115a3565b335f52600560205261088c8460405f20546115a3565b926001600160a01b037f000000000000000000000000848cebe015542f4a0668d457a19e17992d883ed916151580610a04575b806109fb575b610986575b15610931575b506108dc575b60018055005b335f52600560205260405f20556108f5816003546115a3565b6003556040519081525f60208201527f5668a6b5e4a1f97d2c7d98e7f433e0ae888d3e6301a750d79a9cf51a569c284560403392a280806108d6565b335f52600460205260405f205561094a346002546115a3565b600255604051348152600160208201527f5668a6b5e4a1f97d2c7d98e7f433e0ae888d3e6301a750d79a9cf51a569c284560403392a2836108d0565b6109908483611f01565b7f0000000000000000000000000000000000000000000000008ac7230489e8000011156108ca57606460405162461bcd60e51b815260206004820152600860248201527f6d696e526174696f0000000000000000000000000000000000000000000000006044820152fd5b508315156108c5565b507f0000000000000000000000000000000000000000000000008ac7230489e8000015156108bf565b7f000000000000000000000000848cebe015542f4a0668d457a19e17992d883ed96001600160a01b03811615610b37575f80916040518260208201917f23b872dd00000000000000000000000000000000000000000000000000000000835233602482015230604482015288606482015260648152610aad608482611651565b51925af1610ab9611d6f565b81610b08575b5061086057606460405162461bcd60e51b815260206004820152600360248201527f53544600000000000000000000000000000000000000000000000000000000006044820152fd5b8051801592508215610b1d575b505084610abf565b610b309250602080918301019101611dae565b8480610b15565b7fcd524a8d000000000000000000000000000000000000000000000000000000005f5260045ffd5b508115610853565b346102af575f3660031901126102af57610b7f611960565b60ff600d541661056d5760ff6009541615610d46575b60ff6009541615610d1e57335f52600760205260ff60405f20541661077f57335f52600760205260405f20600160ff198254161790555f5f600a5480610c5f575b5081610c50575b80610c20575b604051915f8352602083015260408201527f9cdcf2f7714cca3508c7f0110b04a90a80a3a8dd0e35de99689db74d28c5383e60603392a260018055005b610c4b81337f000000000000000000000000848cebe015542f4a0668d457a19e17992d883ed9611dc6565b610be3565b610c5a8233611e89565b610bdd565b610c6b600b548261174a565b80610c77575b50610bd6565b335f52600460205260405f2054610cfc575b6001600160a01b037f000000000000000000000000848cebe015542f4a0668d457a19e17992d883ed916151580610ce7575b15610c7157610ce09250610cdb90335f52600560205260405f2054611687565b61169a565b8280610c71565b50335f52600560205260405f20541515610cbb565b9250335f526004602052610d1881610cdb8560405f2054611687565b92610c89565b7f1bee0d5a000000000000000000000000000000000000000000000000000000005f5260045ffd5b67ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000690f3ed0164210610b95576040516370a0823160e01b81523060048201526020816024816001600160a01b037f000000000000000000000000ae60eafb73eb0516951ab20089cff32ac9dc63b7165afa908115610562575f91610dfe575b507f00000000000000000000000000000000000000000012af3eb05d6042e969696a11610b9557610df9611999565b610b95565b90506020813d602011610e28575b81610e1960209383611651565b810103126102af575181610dca565b3d9150610e0c565b346102af575f3660031901126102af576020600354604051908152f35b346102af575f3660031901126102af57602060ff600954166040519015158152f35b346102af575f3660031901126102af576020600254604051908152f35b346102af5760203660031901126102af576001600160a01b03610ead61158d565b165f526004602052602060405f2054604051908152f35b346102af575f3660031901126102af5760206001600160a01b035f5416604051908152f35b346102af575f3660031901126102af5760206040517f0000000000000000000000000000000000000000000000008ac7230489e800008152f35b346102af5760203660031901126102af576001600160a01b03610f4461158d565b165f526005602052602060405f2054604051908152f35b346102af575f3660031901126102af57602060405167ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000690b4a50168152f35b346102af575f3660031901126102af57610fb7611e4a565b5f6001600160a01b03815473ffffffffffffffffffffffffffffffffffffffff1981168355167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a3005b346102af5760403660031901126102af5761101c61158d565b602435611027611e4a565b61102f611960565b6001600160a01b0382166001600160a01b037f000000000000000000000000ae60eafb73eb0516951ab20089cff32ac9dc63b71681149081156110b5575b5061108d57801561008a576108d6916001600160a01b035f541690611dc6565b7f790be160000000000000000000000000000000000000000000000000000000005f5260045ffd5b90506001600160a01b037f000000000000000000000000848cebe015542f4a0668d457a19e17992d883ed916148361106d565b346102af5760203660031901126102af576001600160a01b0361110961158d565b165f526007602052602060ff60405f2054166040519015158152f35b346102af5760203660031901126102af57602061114861114361158d565b61171d565b604051908152f35b346102af575f3660031901126102af576020600c54604051908152f35b346102af575f3660031901126102af57611185611e4a565b61118d611960565b6108d6611999565b346102af5760203660031901126102af5760206111486111b361158d565b6116b8565b346102af575f3660031901126102af57602060ff600d54166040519015158152f35b346102af575f3660031901126102af5760206040517f00000000000000000000000000000000000000000000043c33c19375648000008152f35b346102af575f3660031901126102af5761122c611960565b60ff600d541661056d5760ff600954161561139f575b60ff6009541615610d1e5767ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000690fe79016421061137757335f52600660205260ff60405f20541661077f57335f52600660205260405f20600160ff198254161790555f600a5480611337575b50806112f8575b6040519081525f60208201525f60408201527f9cdcf2f7714cca3508c7f0110b04a90a80a3a8dd0e35de99689db74d28c5383e60603392a260018055005b611304816008546115a3565b60085561133281337f000000000000000000000000ae60eafb73eb0516951ab20089cff32ac9dc63b7611dc6565b6112ba565b6113403361171d565b8015158061136c575b611354575b506112b3565b6113659250610cdb90600c54611687565b818061134e565b50600c541515611349565b7fac262da8000000000000000000000000000000000000000000000000000000005f5260045ffd5b67ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000690f3ed0164210611242576040516370a0823160e01b81523060048201526020816024816001600160a01b037f000000000000000000000000ae60eafb73eb0516951ab20089cff32ac9dc63b7165afa908115610562575f91611457575b507f00000000000000000000000000000000000000000012af3eb05d6042e969696a1161124257611452611999565b611242565b90506020813d602011611481575b8161147260209383611651565b810103126102af575181611423565b3d9150611465565b346102af575f3660031901126102af57602060405167ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000690f3ed0168152f35b346102af575f3660031901126102af5760206040516001600160a01b037f000000000000000000000000848cebe015542f4a0668d457a19e17992d883ed9168152f35b346102af575f3660031901126102af57602061152a6115c4565b6040519015158152f35b346102af575f3660031901126102af576020611148600254600354906115a3565b346102af575f3660031901126102af576020907f00000000000000000000000000000000000000000012af3eb05d6042e969696a8152f35b600435906001600160a01b03821682036102af57565b919082018092116115b057565b634e487b7160e01b5f52601160045260245ffd5b67ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000690b4a50164210158061161e575b80611611575b806116065790565b5060ff600d54161590565b5060ff60095416156115fe565b5067ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000690f3ed01642106115f8565b90601f8019910116810190811067ffffffffffffffff82111761167357604052565b634e487b7160e01b5f52604160045260245ffd5b818102929181159184041417156115b057565b81156116a4570490565b634e487b7160e01b5f52601260045260245ffd5b60ff600954161561171857600b5415611718576116d48161171d565b908115611712576001600160a01b03165f52600660205260ff60405f20541661171857600a54801561171257610cdb61170f92600c54611687565b90565b50505f90565b505f90565b6001600160a01b0361170f9116805f52600460205260405f2054905f52600560205260405f2054906115a3565b919082039182116115b057565b9060ff600d54166119345760ff600954166118765761177b600254600354906115a3565b90811561186c576118167f00000000000000000000000000000000000000000000043c33c1937564800000928381105f1461185157610cdb6001600160a01b036117e76117e084610cdb81995b5f908b61181c575b506117da8c61171d565b90611687565b968461174a565b961695865f52600460205261180483610cdb8360405f2054611687565b965f52600560205260405f2054611687565b91929190565b61184b9150610cdb8c7f00000000000000000000000000000000000000000012af3eb05d6042e969696a611687565b5f6117d0565b610cdb6001600160a01b036117e76117e084610cdb896117c8565b5f92508291508190565b90600a5491821561186c5761188a8261171d565b918215611929576001600160a01b031691825f5260066020528360ff60405f2054165f146119155750505f5b6118c2600b548561174a565b925f945f94825f52600760205260ff60405f205416156118e5575b505050929190565b82610cdb9293975061190c9496505f52600460205261180483610cdb8360405f2054611687565b915f80806118dd565b610cdb61192492600c54611687565b6118b6565b505f92508291508190565b906001600160a01b031690815f52600460205260405f2054915f52600560205260405f2054905f929190565b600260015414611971576002600155565b7f3ee5aeb5000000000000000000000000000000000000000000000000000000005f5260045ffd5b60095460ff81166105955760ff600d541661056d5767ffffffffffffffff7f00000000000000000000000000000000000000000000000000000000690f3ed0164210611d47577f000000000000000000000000ae60eafb73eb0516951ab20089cff32ac9dc63b7604051916370a0823160e01b83523060048401526020836024816001600160a01b0386165afa928315610562575f93611d13575b507f00000000000000000000000000000000000000000012af3eb05d6042e969696a809310611ceb5760ff1916600117600955600254600354611a76916115a3565b9081600a557f00000000000000000000000000000000000000000000043c33c19375648000008083105f14611ce45782935b84600b555f908515159283611cc9575b5081611ac79181600c5561174a565b9283611bfd575b50907f405f1a04d80bf0b461328081d00a8ce9cbddf73dff58ce6d19db0cf087e9d1549460c09493925f915f938615159081611bf5575b50611b2d575b604051958652602086015260408501526060840152608083015260a0820152a1565b8560025480611bbe575b50507f000000000000000000000000848cebe015542f4a0668d457a19e17992d883ed96001600160a01b038116151580611bb3575b611b77575b50611b0b565b9350611b8986610cdb83600354611687565b938480611b97575b50611b71565b611bac916001600160a01b035f541690611dc6565b5f84611b91565b506003541515611b6c565b82611bce939550610cdb91611687565b9182611bdc575b855f611b37565b611bf0836001600160a01b035f5416611e89565b611bd5565b90505f611b05565b5f8091604096959493965182602082019163a9059cbb60e01b835261dead602482015287604482015260448152611c35606482611651565b51925af1611c41611d6f565b81611c9a575b5015611c56579091925f611ace565b606460405162461bcd60e51b815260206004820152600260248201527f53540000000000000000000000000000000000000000000000000000000000006044820152fd5b8051801592508215611caf575b50505f611c47565b611cc29250602080918301019101611dae565b5f80611ca7565b819250611cdd90610cdb88611ac794611687565b9190611ab8565b8093611aa8565b7fd5867aeb000000000000000000000000000000000000000000000000000000005f5260045ffd5b9092506020813d602011611d3f575b81611d2f60209383611651565b810103126102af5751915f611a34565b3d9150611d22565b7f9d98b04b000000000000000000000000000000000000000000000000000000005f5260045ffd5b3d15611da9573d9067ffffffffffffffff82116116735760405191611d9e601f8201601f191660200184611651565b82523d5f602084013e565b606090565b908160209103126102af575180151581036102af5790565b5f9291838093604051906001600160a01b03602083019463a9059cbb60e01b8652166024830152604482015260448152611e01606482611651565b51925af1611e0d611d6f565b81611e1b575b5015611c5657565b8051801592508215611e30575b50505f611e13565b611e439250602080918301019101611dae565b5f80611e28565b6001600160a01b035f54163303611e5d57565b7f118cdaa7000000000000000000000000000000000000000000000000000000005f523360045260245ffd5b5f9190829160405190611e9d602083611651565b83825260208201915f36843751925af1611eb5611d6f565b5015611ebd57565b606460405162461bcd60e51b815260206004820152600360248201527f53544500000000000000000000000000000000000000000000000000000000006044820152fd5b90670de0b6b3a76400008202905f19670de0b6b3a7640000840992828085109403938085039414611fa95783821115611f9157670de0b6b3a7640000829109815f0382168092046002816003021880820260020302808202600203028082026002030280820260020302808202600203028091026002030293600183805f03040190848311900302920304170290565b50634e487b715f52156003026011186020526024601cfd5b509061170f925061169a56

Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)

000000000000000000000000433b80b1fdf0d68d95c4833966c7eb3d76398bf3000000000000000000000000ae60eafb73eb0516951ab20089cff32ac9dc63b7000000000000000000000000848cebe015542f4a0668d457a19e17992d883ed900000000000000000000000000000000000000000000000000000000690b4a5000000000000000000000000000000000000000000000000000000000690f3ed000000000000000000000000000000000000000000012af3eb05d6042e969696a00000000000000000000000000000000000000000000043c33c19375648000000000000000000000000000000000000000000000000000008ac7230489e8000000000000000000000000000000000000000000000000000000000000690fe790

-----Decoded View---------------
Arg [0] : _owner (address): 0x433b80b1fdF0D68D95C4833966c7eb3D76398BF3
Arg [1] : _saleToken (address): 0xae60eAfb73Eb0516951ab20089Cff32AC9DC63b7
Arg [2] : _paymentToken (address): 0x848CebE015542f4A0668D457A19E17992D883ed9
Arg [3] : _startTime (uint64): 1762347600
Arg [4] : _endTime (uint64): 1762606800
Arg [5] : _tokensForSale (uint256): 22588235294117647058823530
Arg [6] : _totalRaise (uint256): 20000000000000000000000
Arg [7] : _minEthPerErc20Wad (uint256): 10000000000000000000
Arg [8] : _tokenClaimTime (uint64): 1762650000

-----Encoded View---------------
9 Constructor Arguments found :
Arg [0] : 000000000000000000000000433b80b1fdf0d68d95c4833966c7eb3d76398bf3
Arg [1] : 000000000000000000000000ae60eafb73eb0516951ab20089cff32ac9dc63b7
Arg [2] : 000000000000000000000000848cebe015542f4a0668d457a19e17992d883ed9
Arg [3] : 00000000000000000000000000000000000000000000000000000000690b4a50
Arg [4] : 00000000000000000000000000000000000000000000000000000000690f3ed0
Arg [5] : 00000000000000000000000000000000000000000012af3eb05d6042e969696a
Arg [6] : 00000000000000000000000000000000000000000000043c33c1937564800000
Arg [7] : 0000000000000000000000000000000000000000000000008ac7230489e80000
Arg [8] : 00000000000000000000000000000000000000000000000000000000690fe790


Block Transaction Gas Used Reward
view all blocks ##produced##

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

Validator Index Block Amount
View All Withdrawals

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

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