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



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

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



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

// File: lib/openzeppelin-contracts/contracts/utils/Strings.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/Strings.sol)

pragma solidity ^0.8.0;

import "./math/Math.sol";
import "./math/SignedMath.sol";

/**
 * @dev String operations.
 */
library Strings {
    bytes16 private constant _SYMBOLS = "0123456789abcdef";
    uint8 private constant _ADDRESS_LENGTH = 20;

    /**
     * @dev Converts a `uint256` to its ASCII `string` decimal representation.
     */
    function toString(uint256 value) internal pure returns (string memory) {
        unchecked {
            uint256 length = Math.log10(value) + 1;
            string memory buffer = new string(length);
            uint256 ptr;
            /// @solidity memory-safe-assembly
            assembly {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                /// @solidity memory-safe-assembly
                assembly {
                    mstore8(ptr, byte(mod(value, 10), _SYMBOLS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toString(int256 value) internal pure returns (string memory) {
        return string(abi.encodePacked(value < 0 ? "-" : "", toString(SignedMath.abs(value))));
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
     */
    function toHexString(uint256 value) internal pure returns (string memory) {
        unchecked {
            return toHexString(value, Math.log256(value) + 1);
        }
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
     */
    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
        bytes memory buffer = new bytes(2 * length + 2);
        buffer[0] = "0";
        buffer[1] = "x";
        for (uint256 i = 2 * length + 1; i > 1; --i) {
            buffer[i] = _SYMBOLS[value & 0xf];
            value >>= 4;
        }
        require(value == 0, "Strings: hex length insufficient");
        return string(buffer);
    }

    /**
     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation.
     */
    function toHexString(address addr) internal pure returns (string memory) {
        return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH);
    }

    /**
     * @dev Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return keccak256(bytes(a)) == keccak256(bytes(b));
    }
}

// File: lib/openzeppelin-contracts/contracts/utils/cryptography/ECDSA.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/cryptography/ECDSA.sol)

pragma solidity ^0.8.0;

import "../Strings.sol";

/**
 * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.
 *
 * These functions can be used to verify that a message was signed by the holder
 * of the private keys of a given address.
 */
library ECDSA {
    enum RecoverError {
        NoError,
        InvalidSignature,
        InvalidSignatureLength,
        InvalidSignatureS,
        InvalidSignatureV // Deprecated in v4.8
    }

    function _throwError(RecoverError error) private pure {
        if (error == RecoverError.NoError) {
            return; // no error: do nothing
        } else if (error == RecoverError.InvalidSignature) {
            revert("ECDSA: invalid signature");
        } else if (error == RecoverError.InvalidSignatureLength) {
            revert("ECDSA: invalid signature length");
        } else if (error == RecoverError.InvalidSignatureS) {
            revert("ECDSA: invalid signature 's' value");
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature` or error string. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {toEthSignedMessageHash} on it.
     *
     * Documentation for signature generation:
     * - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]
     * - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]
     *
     * _Available since v4.3._
     */
    function tryRecover(bytes32 hash, bytes memory signature) internal pure returns (address, RecoverError) {
        if (signature.length == 65) {
            bytes32 r;
            bytes32 s;
            uint8 v;
            // ecrecover takes the signature parameters, and the only way to get them
            // currently is to use assembly.
            /// @solidity memory-safe-assembly
            assembly {
                r := mload(add(signature, 0x20))
                s := mload(add(signature, 0x40))
                v := byte(0, mload(add(signature, 0x60)))
            }
            return tryRecover(hash, v, r, s);
        } else {
            return (address(0), RecoverError.InvalidSignatureLength);
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature`. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {toEthSignedMessageHash} on it.
     */
    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, signature);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
     *
     * See https://eips.ethereum.org/EIPS/eip-2098[EIP-2098 short signatures]
     *
     * _Available since v4.3._
     */
    function tryRecover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address, RecoverError) {
        bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
        uint8 v = uint8((uint256(vs) >> 255) + 27);
        return tryRecover(hash, v, r, s);
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `r and `vs` short-signature fields separately.
     *
     * _Available since v4.2._
     */
    function recover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, r, vs);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `v`,
     * `r` and `s` signature fields separately.
     *
     * _Available since v4.3._
     */
    function tryRecover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal pure returns (address, RecoverError) {
        // EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature
        // unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines
        // the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most
        // signatures from current libraries generate a unique signature with an s-value in the lower half order.
        //
        // If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value
        // with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or
        // vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept
        // these malleable signatures as well.
        if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {
            return (address(0), RecoverError.InvalidSignatureS);
        }

        // If the signature is valid (and not malleable), return the signer address
        address signer = ecrecover(hash, v, r, s);
        if (signer == address(0)) {
            return (address(0), RecoverError.InvalidSignature);
        }

        return (signer, RecoverError.NoError);
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `v`,
     * `r` and `s` signature fields separately.
     */
    function recover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, v, r, s);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Returns an Ethereum Signed Message, created from a `hash`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes32 hash) internal pure returns (bytes32) {
        // 32 is the length in bytes of hash,
        // enforced by the type signature above
        return keccak256(abi.encodePacked("\x19Ethereum Signed Message:\n32", hash));
    }

    /**
     * @dev Returns an Ethereum Signed Message, created from `s`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes memory s) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19Ethereum Signed Message:\n", Strings.toString(s.length), s));
    }

    /**
     * @dev Returns an Ethereum Signed Typed Data, created from a
     * `domainSeparator` and a `structHash`. This produces hash corresponding
     * to the one signed with the
     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`]
     * JSON-RPC method as part of EIP-712.
     *
     * See {recover}.
     */
    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19\x01", domainSeparator, structHash));
    }
}

// File: lib/openzeppelin-contracts/contracts/utils/math/Math.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/math/Math.sol)

pragma solidity ^0.8.0;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Down, // Toward negative infinity
        Up, // Toward infinity
        Zero // Toward zero
    }

    /**
     * @dev Returns the largest of two numbers.
     */
    function max(uint256 a, uint256 b) internal pure returns (uint256) {
        return a > b ? a : b;
    }

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return 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 up instead
     * of rounding down.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b - 1) / b can overflow on addition, so we distribute.
        return a == 0 ? 0 : (a - 1) / b + 1;
    }

    /**
     * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0
     * @dev 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^256 and mod 2^256 - 1, then use
            // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2^256 + prod0.
            uint256 prod0; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod0 := mul(x, y)
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                return prod0 / denominator;
            }

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            require(denominator > prod1, "Math: mulDiv 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.

            // Does not overflow because the denominator cannot be zero at this stage in the function.
            uint256 twos = denominator & (~denominator + 1);
            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^256 / 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^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such
            // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv = 1 mod 2^4.
            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^8
            inverse *= 2 - denominator * inverse; // inverse mod 2^16
            inverse *= 2 - denominator * inverse; // inverse mod 2^32
            inverse *= 2 - denominator * inverse; // inverse mod 2^64
            inverse *= 2 - denominator * inverse; // inverse mod 2^128
            inverse *= 2 - denominator * inverse; // inverse mod 2^256

            // 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^256. Since the preconditions guarantee that the outcome is
            // less than 2^256, 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;
        }
    }

    /**
     * @notice 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) {
        uint256 result = mulDiv(x, y, denominator);
        if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) {
            result += 1;
        }
        return result;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded down.
     *
     * Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11).
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        if (a == 0) {
            return 0;
        }

        // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.
        //
        // We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have
        // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.
        //
        // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`
        // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`
        // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`
        //
        // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.
        uint256 result = 1 << (log2(a) >> 1);

        // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,
        // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at
        // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision
        // into the expected uint128 result.
        unchecked {
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            return min(result, a / result);
        }
    }

    /**
     * @notice 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 + (rounding == Rounding.Up && result * result < a ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 2, rounded down, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 128;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 64;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 32;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 16;
            }
            if (value >> 8 > 0) {
                value >>= 8;
                result += 8;
            }
            if (value >> 4 > 0) {
                value >>= 4;
                result += 4;
            }
            if (value >> 2 > 0) {
                value >>= 2;
                result += 2;
            }
            if (value >> 1 > 0) {
                result += 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 + (rounding == Rounding.Up && 1 << result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 10, rounded down, of a positive value.
     * 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 + (rounding == Rounding.Up && 10 ** result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 256, rounded down, of a positive value.
     * 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;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 16;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 8;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 4;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 2;
            }
            if (value >> 8 > 0) {
                result += 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 + (rounding == Rounding.Up && 1 << (result << 3) < value ? 1 : 0);
        }
    }
}

// File: lib/openzeppelin-contracts/contracts/utils/math/SignedMath.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/math/SignedMath.sol)

pragma solidity ^0.8.0;

/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @dev Returns the largest of two signed numbers.
     */
    function max(int256 a, int256 b) internal pure returns (int256) {
        return a > b ? a : b;
    }

    /**
     * @dev Returns the smallest of two signed numbers.
     */
    function min(int256 a, int256 b) internal pure returns (int256) {
        return a < b ? a : b;
    }

    /**
     * @dev Returns the average of two signed numbers without overflow.
     * The result is rounded towards zero.
     */
    function average(int256 a, int256 b) internal pure returns (int256) {
        // Formula from the book "Hacker's Delight"
        int256 x = (a & b) + ((a ^ b) >> 1);
        return x + (int256(uint256(x) >> 255) & (a ^ b));
    }

    /**
     * @dev Returns the absolute unsigned value of a signed value.
     */
    function abs(int256 n) internal pure returns (uint256) {
        unchecked {
            // must be unchecked in order to support `n = type(int256).min`
            return uint256(n >= 0 ? n : -n);
        }
    }
}

// File: src/BullionFxPeriphery.sol



// SPDX-License-Identifier: MIT
pragma solidity 0.8.17;

import {ECDSA} from "openzeppelin/utils/cryptography/ECDSA.sol";
import {Ownable} from "openzeppelin/access/Ownable.sol";
import {IMergeRouter} from "./interfaces/IMergeRouter.sol";
import {IGold} from "./interfaces/IGold.sol";
import {IUSDC} from "./interfaces/IUSDC.sol";

/// @title BullionFX Periphery smart contract
/// @notice A contract that enables the acquisition of a large quantity of gold while minimizing the impact on the price.
contract BullionFxPeriphery is Ownable {
    using ECDSA for bytes32;

    /*//////////////////////////////////////////////////////////////
                            STATE VARIABLES
    //////////////////////////////////////////////////////////////*/

    /// @notice The address of the Merge router contract.
    IMergeRouter public constant MERGE_ROUTER =
        IMergeRouter(0xB5ff179A82CEB9d9cF4e5B6416b3C714900E7Db2);

    /// @notice The address of the USDC contract.
    IUSDC public constant USDC =
        IUSDC(0xA0b86991c6218b36c1d19D4a2e9Eb0cE3606eB48);

    /// @notice The address of the BullionFX Gold token contract.
    IGold public constant GOLD =
        IGold(0x57c88ed53d53fDc6B41D57463E6C405dE162843e);

    /// @notice To determine transaction type.
    enum TxType {
        BUY,
        SELL
    }

    /// @notice Address linked to the private key utilized for signing the message.
    address public signer;

    /// @notice The address of the recipient of treasury fees.
    address public treasuryFeeRecipient;

    /// @notice Current treasury fee percentage, measured in basis points.
    uint96 public treasuryFeePercentage;

    // @notice Max treasury fee percentage that can be set.
    uint256 public constant MAX_TREASURY_FEE = 500; //5%

    /// @notice Utilized to calculate treasury fees and is measured in basis points.
    uint256 public constant PERCENTAGE_CALCULATION = 10000; // 100%

    /// @notice Tracks message hashes that have been used, to prevent message replay.
    mapping(bytes32 => bool) public messageHashesUsed;

    /*//////////////////////////////////////////////////////////////
                                EVENTS
    //////////////////////////////////////////////////////////////*/

    event BoughtGoldWithUSDC(
        address indexed caller,
        uint256 totalUSDC,
        uint256 dexAmountInUSDC,
        uint256 dexAmountOutGold,
        uint256 indexed mintedGoldTokens,
        uint256 indexed goldPrice,
        uint256 usdcMintFee
    );

    event GoldSoldForUSDC(
        address indexed caller,
        uint256 totalGold,
        uint256 dexAmountInGold,
        uint256 dexAmountOutUSDC,
        uint256 indexed payableUSDCAmount,
        uint256 indexed goldPrice,
        uint256 usdcMintFee
    );

    event GoldMinted(address indexed recipient, uint256 indexed amount);
    event GoldBurnt(uint256 indexed amount);
    event ReservesFunded(address indexed caller, uint256 indexed amount);
    event PhysicalGoldPurchased(
        address indexed recipient,
        uint256 indexed amount
    );
    event TreasuryFeeRecipientChanged(
        address oldTreasuryFeeRecipient,
        address newTreasuryFeeRecipient
    );
    event TreasuryFeeChanged(uint256 oldPercentage, uint256 newPercentage);
    event SignerChanged(address oldSigner, address newSigner);

    /*//////////////////////////////////////////////////////////////
                                 ERRORS
    //////////////////////////////////////////////////////////////*/

    error AlreadyUsedMessageHash(bytes32 messageHash);
    error ExceedsMaxTreasuryFeePercentage(uint96 treasuryFeePercentage);
    error SignerAddressMismatch(address recoveredSignerAddress);
    error ZeroAddress();
    error ZeroAmount();

    /*//////////////////////////////////////////////////////////////
                               CONSTRUCTOR
    //////////////////////////////////////////////////////////////*/

    /// @notice Sets the signer address and approves the transfer of USDC held by this contract to the Merge Router contract.
    /// @param _signer Address of the signer
    constructor(
        address _signer,
        address _treasuryFeeRecipient,
        uint96 _treasuryFeePercentage
    ) {
        if (_signer == address(0) || _treasuryFeeRecipient == address(0)) {
            revert ZeroAddress();
        }

        // Cannot have more than 5% treasury fee percentage.
        if (_treasuryFeePercentage > MAX_TREASURY_FEE) {
            revert ExceedsMaxTreasuryFeePercentage(_treasuryFeePercentage);
        }

        // Approving merge router to transfer USDC stored in this contract.
        USDC.approve(address(MERGE_ROUTER), type(uint256).max);

        // Approving merge router to transfer GOLD stored in this contract.
        GOLD.approve(address(MERGE_ROUTER), type(uint256).max);

        signer = _signer;
        treasuryFeeRecipient = _treasuryFeeRecipient;
        treasuryFeePercentage = _treasuryFeePercentage;

        emit SignerChanged(address(0), _signer);
    }

    /*//////////////////////////////////////////////////////////////
                                MODIFIER
    //////////////////////////////////////////////////////////////*/

    /// @notice Modifier that reverts if the given parameter is 0.
    modifier notZero(uint256 _amount) {
        if (_amount == 0) revert ZeroAmount();
        _;
    }

    /*//////////////////////////////////////////////////////////////
                            SETTER FUNCTIONS
    //////////////////////////////////////////////////////////////*/

    /// @notice Changes the signer address. Can only be called by the owner of this contract.
    /// @param _newSigner Address of the new signer.
    function changeSigner(address _newSigner) external onlyOwner {
        if (_newSigner == address(0)) {
            revert ZeroAddress();
        }

        emit SignerChanged(signer, _newSigner);

        // Overwrites the old signer address
        signer = _newSigner;
    }

    /// @notice Changes the treasury fee recipient address. Can only be called by the owner of this contract.
    /// @param _newTreasuryFeeRecipient Address of the new treasury fee recipient.
    function changeTreasuryFeeRecipient(
        address _newTreasuryFeeRecipient
    ) external onlyOwner {
        if (_newTreasuryFeeRecipient == address(0)) {
            revert ZeroAddress();
        }

        emit TreasuryFeeRecipientChanged(
            treasuryFeeRecipient,
            _newTreasuryFeeRecipient
        );

        // Overwrites the old treasury fee recipient address
        treasuryFeeRecipient = _newTreasuryFeeRecipient;
    }

    /// @notice Changes the treasury fee percentage. Can only be called by the owner of this contract.
    /// @param _newPercentage New treasury fee percentage. Expressed in basis points.
    function changeTreasuryFeePercentage(
        uint96 _newPercentage
    ) external onlyOwner {
        // Cannot have more than 5% treasury fee percentage.
        if (_newPercentage > MAX_TREASURY_FEE) {
            revert ExceedsMaxTreasuryFeePercentage(_newPercentage);
        }

        emit TreasuryFeeChanged(treasuryFeePercentage, _newPercentage);

        // Overwrites the old treasury fee percentage address
        treasuryFeePercentage = _newPercentage;
    }

    /*//////////////////////////////////////////////////////////////
                       GOLD TOKEN RELATED FUNCTIONS
    //////////////////////////////////////////////////////////////*/

    /// @notice Mints gold token. Can only be called by the owner of this contract.
    /// @param _recipient Address to mint gold tokens at.
    /// @param _amount Amount of gold tokens to mint to the '_recipient' address.
    function mintGold(
        address _recipient,
        uint256 _amount
    ) external onlyOwner notZero(_amount) {
        GOLD.mint(_recipient, _amount);

        emit GoldMinted(_recipient, _amount);
    }

    /// @notice Burns a specified amount of gold tokens from the contract's balance. Can only be called by the owner of this contract.
    /// @param _amount The amount of gold tokens to burn.
    function burnGold(uint256 _amount) external onlyOwner notZero(_amount) {
        GOLD.burn(_amount);

        emit GoldBurnt(_amount);
    }

    /// @notice Transfers ownership of BullionFX gold token contract. Can only be called by the owner of this contract.
    /// @param _newOwner Address of the new owner of BullionFX gold token contract.
    function transferGoldContractOwnership(
        address _newOwner
    ) external onlyOwner {
        GOLD.transferOwnership(_newOwner);
    }

    /*//////////////////////////////////////////////////////////////
                       USDC TOKEN RELATED FUNCTION
    //////////////////////////////////////////////////////////////*/

    /// @notice Buy physical gold using USDC tokens. Can only be called by the owner of this contract.
    /// @param _recipient Address of the recipient of the USDC tokens.
    /// @param _amount Amount of USDC to transfer to the '_recipient' address.
    function purchasePhysicalGoldWithUSDC(
        address _recipient,
        uint256 _amount
    ) external onlyOwner notZero(_amount) {
        USDC.transfer(_recipient, _amount);

        emit PhysicalGoldPurchased(_recipient, _amount);
    }

    /// @notice Transfers a specified amount of USDC tokens from the caller to the contract's reserve fund. Can only be called by the owner of this contract.
    /// @param _amount The amount of USDC tokens to transfer to the reserve fund.
    function fundReservesUSDC(
        uint256 _amount
    ) external onlyOwner notZero(_amount) {
        USDC.transferFrom(msg.sender, address(this), _amount);

        emit ReservesFunded(msg.sender, _amount);
    }

    /*//////////////////////////////////////////////////////////////
                     GOLD TOKEN BUY/ SELL FUNCTIONS
    //////////////////////////////////////////////////////////////*/

    /// @notice Swaps USDC for a gold token on a DEX in such a way that the price impact reaches one percent. Then, uses the remaining USDC to mint gold tokens.
    /// @param _nonce A unique number used to prevent signature replay attack.
    /// @param  _totalUSDC Total amount of USDC used to purchase gold tokens.
    /// @param _amountIn The amount of USDC to be swapped for gold on the DEX.
    /// @param _amountOutMin The minimum amount of gold tokens to receive from the DEX for _amountIn.
    /// @param _currentGoldPrice The current price of gold in an external market.
    /// @param _goldToMint The amount of gold tokens to mint based on the formula: ((_totalUSDC - _amountIn - mintFee) / _currentGoldPrice)
    /// @param _deadline The maximum time for which the signature is valid.
    /// @param _signature The signed message for the transaction.
    function buyGoldWithUSDC(
        uint256 _nonce,
        uint256 _totalUSDC,
        uint256 _amountIn,
        uint256 _amountOutMin,
        uint256 _currentGoldPrice,
        uint256 _goldToMint,
        uint256 _deadline,
        bytes calldata _signature
    ) external {
        // Transfer USDC from the caller to this contract.
        USDC.transferFrom(msg.sender, address(this), _totalUSDC);

        // Generating hash of the message.
        bytes32 _messageHash = _generateMessageHash(
            _nonce,
            _totalUSDC,
            _amountIn,
            _currentGoldPrice,
            _goldToMint,
            _deadline
        );

        // Signs the message hash first and then verifies the signature.
        _signMessageHashAndVerifySignature(_messageHash, _signature);

        messageHashesUsed[_messageHash] = true;

        // Swapping from the dex
        uint256[] memory amounts = MERGE_ROUTER.swapExactTokensForTokens(
            _amountIn,
            _amountOutMin,
            _getPath(TxType.BUY),
            msg.sender,
            _deadline
        );

        uint256 _mintFee;

        // Deduct treasury fee if set.
        if (treasuryFeePercentage != 0) {
            // Computing the fees (in USDC) that the treasury wallet will receive.
            unchecked {
                _mintFee =
                    ((_totalUSDC - _amountIn) * treasuryFeePercentage) /
                    PERCENTAGE_CALCULATION;
            }

            // Transferring fees to the treasury wallet.
            USDC.transfer(treasuryFeeRecipient, _mintFee);
        }

        // Minting gold to the caller.
        GOLD.mint(msg.sender, _goldToMint);

        emit BoughtGoldWithUSDC(
            msg.sender,
            _totalUSDC,
            _amountIn,
            amounts[amounts.length - 1],
            _goldToMint,
            _currentGoldPrice,
            _mintFee
        );
    }

    /// @notice Swaps a specified amount of gold tokens for USDC on a DEX in such a way that the price impact reaches one percent. Then, buys the remaining gold token from the contract's USDC reserves.
    /// @param _nonce A unique number used to prevent signature replay attacks.
    /// @param  _totalGold The total amount of gold tokens to sell.
    /// @param _amountIn The amount of gold to be swapped for USDC on the DEX.
    /// @param _amountOutMin The minimum amount of USDC to receive from the DEX for _amountIn.
    /// @param _currentGoldPrice The current price of gold in an external market.
    /// @param _usdcToTransfer The amount of USDC to transfer/pay to the caller, which does not include the minting fee. It's determined by the formula: ((_totalGold - _amountIn) * _currentGoldPrice).
    /// @param _deadline The maximum time for which the signature is valid.
    /// @param _signature The signed message for the transaction.
    function sellGoldForUSDC(
        uint256 _nonce,
        uint256 _totalGold,
        uint256 _amountIn,
        uint256 _amountOutMin,
        uint256 _currentGoldPrice,
        uint256 _usdcToTransfer,
        uint256 _deadline,
        bytes calldata _signature
    ) external {
        // Transfer GOLD from the caller to this contract.
        GOLD.transferFrom(msg.sender, address(this), _totalGold);

        // Generating hash of the message.
        bytes32 _messageHash = _generateMessageHash(
            _nonce,
            _totalGold,
            _amountIn,
            _currentGoldPrice,
            _usdcToTransfer,
            _deadline
        );

        // Signs the message hash first and then verifies the signature.
        _signMessageHashAndVerifySignature(_messageHash, _signature);

        messageHashesUsed[_messageHash] = true;

        // Swapping from the dex
        uint256[] memory amounts = MERGE_ROUTER.swapExactTokensForTokens(
            _amountIn,
            _amountOutMin,
            _getPath(TxType.SELL),
            msg.sender,
            _deadline
        );

        uint256 _mintFee;

        // Deduct treasury fee if set.
        if (treasuryFeePercentage != 0) {
            // Computing the fees (in USDC) that the treasury wallet will receive.
            unchecked {
                _mintFee =
                    (_usdcToTransfer * treasuryFeePercentage) /
                    PERCENTAGE_CALCULATION;
            }

            // Transferring fees to the treasury wallet.
            USDC.transfer(treasuryFeeRecipient, _mintFee);
        }

        // Transferring USDC to the caller.
        USDC.transfer(msg.sender, _usdcToTransfer - _mintFee);

        emit GoldSoldForUSDC(
            msg.sender,
            _totalGold,
            _amountIn,
            amounts[amounts.length - 1],
            _usdcToTransfer - _mintFee,
            _currentGoldPrice,
            _mintFee
        );
    }

    function _generateMessageHash(
        uint256 _nonce,
        uint256 _totalAmount,
        uint256 _amountIn,
        uint256 _currentGoldPrice,
        uint256 _goldToMintOrUsdcToTransfer,
        uint256 _deadline
    ) private view returns (bytes32) {
        return
            keccak256(
                abi.encodePacked(
                    msg.sender,
                    address(this),
                    block.chainid,
                    _nonce,
                    _totalAmount,
                    _amountIn,
                    _currentGoldPrice,
                    _goldToMintOrUsdcToTransfer,
                    _deadline
                )
            );
    }

    function _signMessageHashAndVerifySignature(
        bytes32 _messageHash,
        bytes calldata _signature
    ) private view {
        // Revert if the generated message hash has been used already.
        if (messageHashesUsed[_messageHash]) {
            revert AlreadyUsedMessageHash(_messageHash);
        }

        // Signing message hash.
        bytes32 _signedMessageHash = _messageHash.toEthSignedMessageHash();

        // Recover address used to sign the message.
        address _recoveredAddress = _signedMessageHash.recover(_signature);

        // Revert if the message was signed with an address other than the signer address.
        if (_recoveredAddress != signer) {
            revert SignerAddressMismatch(_recoveredAddress);
        }
    }

    function _getPath(TxType _txType) private pure returns (address[] memory) {
        address[] memory path = new address[](2);
        if (_txType == TxType.BUY) {
            path[0] = address(USDC);
            path[1] = address(GOLD);
        } else {
            path[0] = address(GOLD);
            path[1] = address(USDC);
        }
        return path;
    }
}

// File: src/interfaces/IGold.sol



// SPDX-License-Identifier: MIT
pragma solidity 0.8.17;

interface IGold {
    function approve(address spender, uint256 amount) external returns (bool);

    function mint(address recipient, uint256 amount) external returns (bool);

    function burn(uint256 amount) external returns (bool);

    function transferOwnership(address newOwner) external;

    function transferFrom(
        address sender,
        address recipient,
        uint256 amount
    ) external returns (bool);
}

// File: src/interfaces/IMergeRouter.sol



// SPDX-License-Identifier: MIT
pragma solidity 0.8.17;

interface IMergeRouter {
    function swapExactTokensForTokens(
        uint256 amountIn,
        uint256 amountOutMin,
        address[] calldata path,
        address to,
        uint256 deadline
    ) external returns (uint256[] memory amounts);
}

// File: src/interfaces/IUSDC.sol



// SPDX-License-Identifier: MIT
pragma solidity 0.8.17;

interface IUSDC {
    function transferFrom(
        address sender,
        address recipient,
        uint256 amount
    ) external returns (bool);

    function approve(address spender, uint256 amount) external returns (bool);

    function transfer(address to, uint256 value) external returns (bool);
}