Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

// SPDX-License-Identifier: MIT

pragma solidity ^0.8.19;

import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/security/ReentrancyGuard.sol";
import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";

interface PreFreedomOld {
    function enteredAmount(address) external view returns(uint256);
}

contract PreFreedomNew is Ownable, ReentrancyGuard {
    uint256 public fee = 0.05 ether;
    uint256 public totalEntered = 0;
    address public preFreedomOldAddress;
    bool public presaleEnabled = false;

    // mappings
    mapping(address => uint256) public enteredAmount;

    // merkle root
    bytes32 public root;

    constructor (address _preFreedomOldAddress) {
        preFreedomOldAddress = _preFreedomOldAddress;
    }

    function presaleEntry(uint256 _quantity, uint256 _maxQuantity, bytes32[] calldata proof) external payable nonReentrant {
        require(isValid(proof, keccak256(abi.encodePacked(msg.sender, _maxQuantity))), "Not a part of whitelist");
        require(msg.value >= (_quantity * fee), "Error: Not enough ether sent");
        require(presaleEnabled, "Error: Presale is currently paused");

        PreFreedomOld preFreedomOld = PreFreedomOld(preFreedomOldAddress);
        uint256 enteredAmountOld = preFreedomOld.enteredAmount(msg.sender);
        require((enteredAmountOld + enteredAmount[msg.sender] + _quantity) <= _maxQuantity, "Error: Cannot enter more than allowed");

        totalEntered += _quantity;
        enteredAmount[msg.sender] += _quantity;
    }

    function isValid(bytes32[] calldata proof, bytes32 leaf) public view returns(bool) {
        return MerkleProof.verify(proof, root, leaf);
    }

    function togglePresale() external onlyOwner nonReentrant {
        presaleEnabled = !presaleEnabled;
    }

    function setFee(uint256 _fee) external onlyOwner nonReentrant {
        fee = _fee;
    }

    function setRoot(bytes32 _root) external onlyOwner nonReentrant {
        root = _root;
    }

    function withdraw() external onlyOwner nonReentrant {
        payable(owner()).transfer(address(this).balance);
    }

    function withdrawPercentage(uint256 _percent, address _to) external onlyOwner nonReentrant {
        require(_percent <= 100, "Percent cannot be greater than 100");
        payable(_to).transfer(address(this).balance * _percent / 100);
    }

}

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

pragma solidity ^0.8.0;

import "../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.
 *
 * By default, the owner account will be the one that deploys the contract. 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;

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

    /**
     * @dev Initializes the contract setting the deployer as the initial owner.
     */
    constructor() {
        _transferOwnership(_msgSender());
    }

    /**
     * @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 {
        require(owner() == _msgSender(), "Ownable: caller is not the owner");
    }

    /**
     * @dev Leaves the contract without owner. It will not be possible to call
     * `onlyOwner` functions anymore. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby removing 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 {
        require(newOwner != address(0), "Ownable: new owner is the zero address");
        _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 v4.8.0) (security/ReentrancyGuard.sol)

pragma solidity ^0.8.0;

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

    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
        require(_status != _ENTERED, "ReentrancyGuard: reentrant call");

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)

pragma solidity ^0.8.0;

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/cryptography/MerkleProof.sol)

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

        if (totalHashes > 0) {
            return hashes[totalHashes - 1];
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

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

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

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

        if (totalHashes > 0) {
            return hashes[totalHashes - 1];
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

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

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

{
  "optimizer": {
    "enabled": true,
    "runs": 1000
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "libraries": {}
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"_preFreedomOldAddress","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"enteredAmount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"fee","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"},{"internalType":"bytes32","name":"leaf","type":"bytes32"}],"name":"isValid","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"preFreedomOldAddress","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"presaleEnabled","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_quantity","type":"uint256"},{"internalType":"uint256","name":"_maxQuantity","type":"uint256"},{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"}],"name":"presaleEntry","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"root","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_fee","type":"uint256"}],"name":"setFee","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_root","type":"bytes32"}],"name":"setRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"togglePresale","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"totalEntered","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"withdraw","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_percent","type":"uint256"},{"internalType":"address","name":"_to","type":"address"}],"name":"withdrawPercentage","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608060405266b1a2bc2ec500006002555f6003556004805460ff60a01b1916905534801561002b575f80fd5b50604051610d4c380380610d4c83398101604081905261004a916100cb565b6100533361007c565b60018055600480546001600160a01b0319166001600160a01b03929092169190911790556100f8565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f602082840312156100db575f80fd5b81516001600160a01b03811681146100f1575f80fd5b9392505050565b610c47806101055f395ff3fe6080604052600436106100ef575f3560e01c8063715018a611610087578063ddca3f4311610057578063ddca3f4314610281578063e58951a514610296578063ebf0c717146102ab578063f2fde38b146102c0575f80fd5b8063715018a6146102135780638da5cb5b14610227578063b8a20ed014610243578063dab5f34014610262575f80fd5b80636591e6db116100c25780636591e6db1461016557806369fe0e2d1461019e5780636a3d3f17146101bd5780636d1e41a4146101dc575f80fd5b8063143b237f146100f357806334393743146101285780633ccfd60b1461013e5780635a48727814610152575b5f80fd5b3480156100fe575f80fd5b5060045461011390600160a01b900460ff1681565b60405190151581526020015b60405180910390f35b348015610133575f80fd5b5061013c6102df565b005b348015610149575f80fd5b5061013c610331565b61013c610160366004610a65565b610382565b348015610170575f80fd5b5061019061017f366004610acf565b60056020525f908152604090205481565b60405190815260200161011f565b3480156101a9575f80fd5b5061013c6101b8366004610ae8565b61066f565b3480156101c8575f80fd5b5061013c6101d7366004610aff565b610690565b3480156101e7575f80fd5b506004546101fb906001600160a01b031681565b6040516001600160a01b03909116815260200161011f565b34801561021e575f80fd5b5061013c61076d565b348015610232575f80fd5b505f546001600160a01b03166101fb565b34801561024e575f80fd5b5061011361025d366004610b29565b61077e565b34801561026d575f80fd5b5061013c61027c366004610ae8565b6107c7565b34801561028c575f80fd5b5061019060025481565b3480156102a1575f80fd5b5061019060035481565b3480156102b6575f80fd5b5061019060065481565b3480156102cb575f80fd5b5061013c6102da366004610acf565b6107e5565b6102e7610872565b6102ef6108cb565b600480547fffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffff8116600160a01b9182900460ff161590910217905560018055565b565b610339610872565b6103416108cb565b5f80546040516001600160a01b03909116914780156108fc02929091818181858888f19350505050158015610378573d5f803e3d5ffd5b5061032f60018055565b61038a6108cb565b6040516bffffffffffffffffffffffff193360601b166020820152603481018490526103d290839083906054016040516020818303038152906040528051906020012061077e565b6104235760405162461bcd60e51b815260206004820152601760248201527f4e6f7420612070617274206f662077686974656c69737400000000000000000060448201526064015b60405180910390fd5b6002546104309085610b85565b34101561047f5760405162461bcd60e51b815260206004820152601c60248201527f4572726f723a204e6f7420656e6f7567682065746865722073656e7400000000604482015260640161041a565b600454600160a01b900460ff166104fe5760405162461bcd60e51b815260206004820152602260248201527f4572726f723a2050726573616c652069732063757272656e746c79207061757360448201527f6564000000000000000000000000000000000000000000000000000000000000606482015260840161041a565b600480546040517f6591e6db00000000000000000000000000000000000000000000000000000000815233928101929092526001600160a01b0316905f908290636591e6db90602401602060405180830381865afa158015610562573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906105869190610b9c565b335f90815260056020526040902054909150859087906105a69084610bb3565b6105b09190610bb3565b11156106245760405162461bcd60e51b815260206004820152602560248201527f4572726f723a2043616e6e6f7420656e746572206d6f7265207468616e20616c60448201527f6c6f776564000000000000000000000000000000000000000000000000000000606482015260840161041a565b8560035f8282546106359190610bb3565b9091555050335f9081526005602052604081208054889290610658908490610bb3565b909155505060018055506106699050565b50505050565b610677610872565b61067f6108cb565b600281905561068d60018055565b50565b610698610872565b6106a06108cb565b60648211156107175760405162461bcd60e51b815260206004820152602260248201527f50657263656e742063616e6e6f742062652067726561746572207468616e203160448201527f3030000000000000000000000000000000000000000000000000000000000000606482015260840161041a565b6001600160a01b0381166108fc60646107308547610b85565b61073a9190610bc6565b6040518115909202915f818181858888f1935050505015801561075f573d5f803e3d5ffd5b5061076960018055565b5050565b610775610872565b61032f5f610924565b5f6107bf8484808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525050600654915085905061098b565b949350505050565b6107cf610872565b6107d76108cb565b600681905561068d60018055565b6107ed610872565b6001600160a01b0381166108695760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f6464726573730000000000000000000000000000000000000000000000000000606482015260840161041a565b61068d81610924565b5f546001600160a01b0316331461032f5760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161041a565b60026001540361091d5760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c00604482015260640161041a565b6002600155565b5f80546001600160a01b038381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f8261099785846109a0565b14949350505050565b5f81815b84518110156109e4576109d0828683815181106109c3576109c3610be5565b60200260200101516109ee565b9150806109dc81610bf9565b9150506109a4565b5090505b92915050565b5f818310610a08575f828152602084905260409020610a16565b5f8381526020839052604090205b9392505050565b5f8083601f840112610a2d575f80fd5b50813567ffffffffffffffff811115610a44575f80fd5b6020830191508360208260051b8501011115610a5e575f80fd5b9250929050565b5f805f8060608587031215610a78575f80fd5b8435935060208501359250604085013567ffffffffffffffff811115610a9c575f80fd5b610aa887828801610a1d565b95989497509550505050565b80356001600160a01b0381168114610aca575f80fd5b919050565b5f60208284031215610adf575f80fd5b610a1682610ab4565b5f60208284031215610af8575f80fd5b5035919050565b5f8060408385031215610b10575f80fd5b82359150610b2060208401610ab4565b90509250929050565b5f805f60408486031215610b3b575f80fd5b833567ffffffffffffffff811115610b51575f80fd5b610b5d86828701610a1d565b909790965060209590950135949350505050565b634e487b7160e01b5f52601160045260245ffd5b80820281158282048414176109e8576109e8610b71565b5f60208284031215610bac575f80fd5b5051919050565b808201808211156109e8576109e8610b71565b5f82610be057634e487b7160e01b5f52601260045260245ffd5b500490565b634e487b7160e01b5f52603260045260245ffd5b5f60018201610c0a57610c0a610b71565b506001019056fea264697066735822122078321d661d5f53503037e38e26a2354202e68f6eb8e3f11fd5d0f6dc63c3cfe064736f6c63430008140033000000000000000000000000433bc4349ae65c4975fe1bde06de6e427ea72d42

0x6080604052600436106100ef575f3560e01c8063715018a611610087578063ddca3f4311610057578063ddca3f4314610281578063e58951a514610296578063ebf0c717146102ab578063f2fde38b146102c0575f80fd5b8063715018a6146102135780638da5cb5b14610227578063b8a20ed014610243578063dab5f34014610262575f80fd5b80636591e6db116100c25780636591e6db1461016557806369fe0e2d1461019e5780636a3d3f17146101bd5780636d1e41a4146101dc575f80fd5b8063143b237f146100f357806334393743146101285780633ccfd60b1461013e5780635a48727814610152575b5f80fd5b3480156100fe575f80fd5b5060045461011390600160a01b900460ff1681565b60405190151581526020015b60405180910390f35b348015610133575f80fd5b5061013c6102df565b005b348015610149575f80fd5b5061013c610331565b61013c610160366004610a65565b610382565b348015610170575f80fd5b5061019061017f366004610acf565b60056020525f908152604090205481565b60405190815260200161011f565b3480156101a9575f80fd5b5061013c6101b8366004610ae8565b61066f565b3480156101c8575f80fd5b5061013c6101d7366004610aff565b610690565b3480156101e7575f80fd5b506004546101fb906001600160a01b031681565b6040516001600160a01b03909116815260200161011f565b34801561021e575f80fd5b5061013c61076d565b348015610232575f80fd5b505f546001600160a01b03166101fb565b34801561024e575f80fd5b5061011361025d366004610b29565b61077e565b34801561026d575f80fd5b5061013c61027c366004610ae8565b6107c7565b34801561028c575f80fd5b5061019060025481565b3480156102a1575f80fd5b5061019060035481565b3480156102b6575f80fd5b5061019060065481565b3480156102cb575f80fd5b5061013c6102da366004610acf565b6107e5565b6102e7610872565b6102ef6108cb565b600480547fffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffff8116600160a01b9182900460ff161590910217905560018055565b565b610339610872565b6103416108cb565b5f80546040516001600160a01b03909116914780156108fc02929091818181858888f19350505050158015610378573d5f803e3d5ffd5b5061032f60018055565b61038a6108cb565b6040516bffffffffffffffffffffffff193360601b166020820152603481018490526103d290839083906054016040516020818303038152906040528051906020012061077e565b6104235760405162461bcd60e51b815260206004820152601760248201527f4e6f7420612070617274206f662077686974656c69737400000000000000000060448201526064015b60405180910390fd5b6002546104309085610b85565b34101561047f5760405162461bcd60e51b815260206004820152601c60248201527f4572726f723a204e6f7420656e6f7567682065746865722073656e7400000000604482015260640161041a565b600454600160a01b900460ff166104fe5760405162461bcd60e51b815260206004820152602260248201527f4572726f723a2050726573616c652069732063757272656e746c79207061757360448201527f6564000000000000000000000000000000000000000000000000000000000000606482015260840161041a565b600480546040517f6591e6db00000000000000000000000000000000000000000000000000000000815233928101929092526001600160a01b0316905f908290636591e6db90602401602060405180830381865afa158015610562573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906105869190610b9c565b335f90815260056020526040902054909150859087906105a69084610bb3565b6105b09190610bb3565b11156106245760405162461bcd60e51b815260206004820152602560248201527f4572726f723a2043616e6e6f7420656e746572206d6f7265207468616e20616c60448201527f6c6f776564000000000000000000000000000000000000000000000000000000606482015260840161041a565b8560035f8282546106359190610bb3565b9091555050335f9081526005602052604081208054889290610658908490610bb3565b909155505060018055506106699050565b50505050565b610677610872565b61067f6108cb565b600281905561068d60018055565b50565b610698610872565b6106a06108cb565b60648211156107175760405162461bcd60e51b815260206004820152602260248201527f50657263656e742063616e6e6f742062652067726561746572207468616e203160448201527f3030000000000000000000000000000000000000000000000000000000000000606482015260840161041a565b6001600160a01b0381166108fc60646107308547610b85565b61073a9190610bc6565b6040518115909202915f818181858888f1935050505015801561075f573d5f803e3d5ffd5b5061076960018055565b5050565b610775610872565b61032f5f610924565b5f6107bf8484808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525050600654915085905061098b565b949350505050565b6107cf610872565b6107d76108cb565b600681905561068d60018055565b6107ed610872565b6001600160a01b0381166108695760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f6464726573730000000000000000000000000000000000000000000000000000606482015260840161041a565b61068d81610924565b5f546001600160a01b0316331461032f5760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161041a565b60026001540361091d5760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c00604482015260640161041a565b6002600155565b5f80546001600160a01b038381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f8261099785846109a0565b14949350505050565b5f81815b84518110156109e4576109d0828683815181106109c3576109c3610be5565b60200260200101516109ee565b9150806109dc81610bf9565b9150506109a4565b5090505b92915050565b5f818310610a08575f828152602084905260409020610a16565b5f8381526020839052604090205b9392505050565b5f8083601f840112610a2d575f80fd5b50813567ffffffffffffffff811115610a44575f80fd5b6020830191508360208260051b8501011115610a5e575f80fd5b9250929050565b5f805f8060608587031215610a78575f80fd5b8435935060208501359250604085013567ffffffffffffffff811115610a9c575f80fd5b610aa887828801610a1d565b95989497509550505050565b80356001600160a01b0381168114610aca575f80fd5b919050565b5f60208284031215610adf575f80fd5b610a1682610ab4565b5f60208284031215610af8575f80fd5b5035919050565b5f8060408385031215610b10575f80fd5b82359150610b2060208401610ab4565b90509250929050565b5f805f60408486031215610b3b575f80fd5b833567ffffffffffffffff811115610b51575f80fd5b610b5d86828701610a1d565b909790965060209590950135949350505050565b634e487b7160e01b5f52601160045260245ffd5b80820281158282048414176109e8576109e8610b71565b5f60208284031215610bac575f80fd5b5051919050565b808201808211156109e8576109e8610b71565b5f82610be057634e487b7160e01b5f52601260045260245ffd5b500490565b634e487b7160e01b5f52603260045260245ffd5b5f60018201610c0a57610c0a610b71565b506001019056fea264697066735822122078321d661d5f53503037e38e26a2354202e68f6eb8e3f11fd5d0f6dc63c3cfe064736f6c63430008140033

000000000000000000000000433bc4349ae65c4975fe1bde06de6e427ea72d42

-----Decoded View---------------
Arg [0] : _preFreedomOldAddress (address): 0x433bc4349AE65c4975fE1BDE06dE6e427Ea72D42

-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 000000000000000000000000433bc4349ae65c4975fe1bde06de6e427ea72d42