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.20;

import {ERC20} from '@openzeppelin/contracts/token/ERC20/ERC20.sol';
import {Ownable} from '@openzeppelin/contracts/access/Ownable.sol';
import {ERC20Permit} from '@openzeppelin/contracts/token/ERC20/extensions/ERC20Permit.sol';
import {ERC20Votes} from '@openzeppelin/contracts/token/ERC20/extensions/ERC20Votes.sol';
import {Nonces} from '@openzeppelin/contracts/utils/Nonces.sol';
import {EnumerableSet} from '@openzeppelin/contracts/utils/structs/EnumerableSet.sol';
import {EnumerableMap} from '@openzeppelin/contracts/utils/structs/EnumerableMap.sol';
import {IGovernanceToken} from './interfaces/IGovernanceToken.sol';
import {IAirdropCoordinator} from './interfaces/IAirdropCoordinator.sol';
import {IRandomnessProvider} from './interfaces/IRandomnessProvider.sol';
import {AirdropStatus, InitialAirdropConfig, RegularAirdropConfig, InitialAirdropState, RegularAirdropState} from './types/TokenOneTypes.sol';
import {Checkpoints} from "@openzeppelin/contracts/utils/structs/Checkpoints.sol";
import {SafeCast} from "@openzeppelin/contracts/utils/math/SafeCast.sol";
import {IMintable} from './interfaces/IMintable.sol';

contract TokenOne is
	IGovernanceToken,
	IAirdropCoordinator,
	ERC20,
	ERC20Permit,
	ERC20Votes,
	Ownable,
	IMintable
{
	using EnumerableSet for EnumerableSet.AddressSet;
	using EnumerableMap for EnumerableMap.AddressToUintMap;
	using Checkpoints for Checkpoints.Trace208;

	address public migrationContract;

	// The eligibility list for the airdrop
	EnumerableSet.AddressSet private eligibilityList;

	// Initial airdrop configuration
	InitialAirdropConfig public initialAirdropConfig;

	// Regular airdrop configuration
	RegularAirdropConfig public regularAirdropConfig;

	// State of the initial airdrop
	InitialAirdropState public initialAirdropState;

	// State of the regular airdrop
	mapping(uint32 => RegularAirdropState) public regularAirdropStates;
	mapping(uint32 => EnumerableMap.AddressToUintMap) private regularAirdropWinnerBalances;
	mapping(uint256 => uint32) public requestIdToIndex;

	// Mapping to check if a randomness request is for the initial airdrop
	mapping(uint256 => bool) public isInitialAirdrop;

	// Randomness
	IRandomnessProvider public randomnessProvider;

	// Voters total balance
	Checkpoints.Trace208 private _totalVotesCheckpoints;
	uint256 public immutable governanceThreshold;
	mapping(address => uint256) public voterBalances;

	// Earnings
	EnumerableMap.AddressToUintMap private earnings;

	// Events for logging important actions
	event InitialAirdropRequested(uint256 indexed requestId);
	event InitialAirdropFulfilled(uint256 indexed requestId);

	event RegularAirdropRequested(
		uint256 indexed requestId,
		uint32 indexed index,
		uint32 indexed numRequested
	);
	event RegularAirdropFulfilled(
		uint256 indexed requestId,
		uint32 indexed index,
		uint32 indexed numFulfilled
	);

	event RandomnessProviderSet(address indexed randomnessProviderAddress);
	event EarningDistributed(address indexed winner, uint256 indexed amount);

	/**
	 * @dev Constructor initializes the contract with the necessary configurations and sets up the VRF subscription.
	 */
	constructor(
		string memory tokenName,
		string memory tokenSymbol,
		InitialAirdropConfig memory _initialAirdropConfig,
		RegularAirdropConfig memory _regularAirdropConfig,
		uint256 _governanceThreshold,
		address _migrationContract
	) ERC20(tokenName, tokenSymbol) ERC20Permit(tokenName) Ownable(msg.sender) {
		require(_initialAirdropConfig.amount > 0, 'Invalid airdrop amount');
		require(_initialAirdropConfig.participants.length > 0, 'No participants');
		require(_regularAirdropConfig.amount > 0, 'Invalid regular airdrop amount');
		require(_regularAirdropConfig.airdropTimeInterval > 0, 'Invalid airdrop interval');
		require(
			_regularAirdropConfig.windowDuration <= _regularAirdropConfig.airdropTimeInterval,
			'Invalid window duration'
		);
		require(_migrationContract != address(0), "Migration contract cannot be zero address");

		initialAirdropConfig = _initialAirdropConfig;
		regularAirdropConfig = _regularAirdropConfig;

		governanceThreshold = _governanceThreshold;

		migrationContract = _migrationContract;
	}

	function setRandomnessProvider(address _randomnessProviderAddress) external onlyOwner {
		require(_randomnessProviderAddress != address(0), 'Randomness provider address cannot be zero');
		randomnessProvider = IRandomnessProvider(_randomnessProviderAddress);
		emit RandomnessProviderSet(_randomnessProviderAddress);
	}

	function regularAirdropCurrentIndex() public view returns (uint32) {
		uint256 timeSinceStart = block.timestamp - regularAirdropConfig.startTimestamp;
		return uint32(timeSinceStart / regularAirdropConfig.airdropTimeInterval);
	}

	function regularAirdropCurrentState() private view returns (RegularAirdropState storage) {
		return regularAirdropStates[regularAirdropCurrentIndex()];
	}

	function isReadyToComputeInitial() external view returns (bool) {
		return initialAirdropState.status == AirdropStatus.Fulfilled;
	}

	function isFinishedInitial() public view returns (bool) {
		return initialAirdropState.status == AirdropStatus.Computed;
	}

	function isReadyToRequestRegular() external view returns (bool) {
		return
			block.timestamp >= regularAirdropConfig.startTimestamp &&
			isFinishedInitial() &&
			isAirdropWindow() &&
			regularAirdropCurrentState().status == AirdropStatus.NotStarted;
	}

	function isReadyToComputeRegular() external view returns (bool) {
		return regularAirdropCurrentState().status == AirdropStatus.Fulfilled;
	}

	function isFinishedRegular() external view returns (bool) {
		return regularAirdropCurrentState().status == AirdropStatus.Computed;
	}

	function hasPendingEarnings() external view returns (bool) {
		return earnings.length() > 0;
	}

	/**
	 * @dev Callback function to fulfill a request
	 */
	function fulfillRandomWords(
		uint256 requestId,
		uint256[] memory randomWords,
		uint256 timepoint
	) external {
		require(
			msg.sender == address(randomnessProvider),
			'Only the randomness provider can fulfill requests'
		);
		if (isInitialAirdrop[requestId]) {
			fulfillInitialAirdrop(requestId, randomWords);
		} else {
			fulfillRegularAirdrop(requestId, randomWords, timepoint);
		}
	}

	/**
	 * @dev Requests the initial airdrop, triggering a VRF request.
	 */
	function requestInitialAirdrop() external {
		require(initialAirdropState.status == AirdropStatus.NotStarted, 'Already requested');

		uint256 totalWinners = initialAirdropConfig.numWinners;
		uint256 numParticipants = initialAirdropConfig.participants.length;
		uint32 remainder = uint32(totalWinners % numParticipants);

		initialAirdropState.status = AirdropStatus.Requested;

		if (remainder == 0) {
			isInitialAirdrop[0] = true;
			emit InitialAirdropRequested(0);
			fulfillInitialAirdrop(0, new uint256[](0));
		} else {
			uint256 requestId = randomnessProvider.requestRandomWords(remainder);
			isInitialAirdrop[requestId] = true;
			emit InitialAirdropRequested(requestId);
		}
	}

	function fulfillInitialAirdrop(uint256 requestId, uint256[] memory randomWords) internal {
		initialAirdropState.randomWords = randomWords;

		// Update status
		initialAirdropState.status = AirdropStatus.Fulfilled;
		emit InitialAirdropFulfilled(requestId);
	}

	function computeInitialAirdropEarnings() external {
		require(
			initialAirdropState.status == AirdropStatus.Fulfilled,
			'Initial Airdrop not in Fulfilled state'
		);
		address[] memory participants = initialAirdropConfig.participants;
		uint256 numParticipants = participants.length;
		uint256 numWinners = initialAirdropConfig.numWinners;
		uint256 initialAirdropAmount = initialAirdropConfig.amount;

		uint256 baseMultiplier = numWinners / numParticipants;
		uint256 remainder = numWinners % numParticipants;
		uint256 baseAmount = initialAirdropAmount * baseMultiplier;

		uint256[] memory randomWords = initialAirdropState.randomWords;

		// Assign base amounts
		if (baseAmount > 0) {
			for (uint256 i = 0; i < numParticipants; i++) {
				address winner = participants[i];

				(,uint256 currentAmount) = earnings.tryGet(winner);
				earnings.set(winner, currentAmount + baseAmount);
			}
		}

		// Assign extra amounts using randomWords
		if (remainder > 0) {
			uint256 lastIndex = numParticipants;
			
			for (uint256 i = 0; i < remainder; i++) {
				uint256 randomIndex = randomWords[i] % lastIndex;

				// Select the participant based on the random index
				address selectedParticipant = participants[randomIndex];

				// Assign additional amount to the randomly picked participant
				(,uint256 currentAmount) = earnings.tryGet(selectedParticipant);
				earnings.set(selectedParticipant, currentAmount + initialAirdropAmount);

				// Move the picked participant to the end of the array to avoid re-selection
				lastIndex--;
				if (randomIndex != lastIndex) {
					participants[randomIndex] = participants[lastIndex];
				}
			}
		}

		// Update status
		initialAirdropState.status = AirdropStatus.Computed;
	}

	/**
	 * @dev Requests a regular airdrop, triggering a VRF request.
	 */
	function requestRegularAirdrop() external {
		require(block.timestamp >= regularAirdropConfig.startTimestamp, 'Not started yet');
		require(
			initialAirdropState.status == AirdropStatus.Computed,
			'Initial Airdrop not finished'
		);
		require(
			regularAirdropCurrentState().status == AirdropStatus.NotStarted,
			'Already requested'
		);
		require(isAirdropWindow(), 'Not Airdrop Window');

		uint32 currentIndex = regularAirdropCurrentIndex();
		RegularAirdropState storage currentState = regularAirdropStates[currentIndex];

		uint32 toRequest = regularAirdropConfig.fulfillBatchSize;
		if (currentState.numRequested + toRequest > regularAirdropConfig.numWinners) {
			toRequest = regularAirdropConfig.numWinners - currentState.numRequested;
		}

		uint32 newNumRequested = currentState.numRequested + toRequest;
		currentState.numRequested = newNumRequested;

		if (newNumRequested == regularAirdropConfig.numWinners) {
			currentState.status = AirdropStatus.Requested;
		}

		uint256 requestId = randomnessProvider.requestRandomWords(toRequest);
		isInitialAirdrop[requestId] = false;
		requestIdToIndex[requestId] = currentIndex;

		if (currentState.requestTimestamp == 0) {
			currentState.requestTimestamp = block.timestamp;
		}

		emit RegularAirdropRequested(requestId, currentIndex, toRequest);
	}

	function fulfillRegularAirdrop(
		uint256 requestId,
		uint256[] memory randomWords,
		uint256 timepoint
	) internal {
		uint256 numParticipants = eligibilityList.length();
		uint32 numRequested = uint32(randomWords.length);

		uint32 index = requestIdToIndex[requestId];
		RegularAirdropState storage state = regularAirdropStates[index];

		if (numParticipants == 0) {
			state.numFulfilled += numRequested;
			if (state.numFulfilled == regularAirdropConfig.numWinners) {
				state.status = AirdropStatus.Fulfilled;
			}
			emit RegularAirdropFulfilled(requestId, index, numRequested);

			return;
		}

		if (timepoint != 0) {
			state.balanceSnapshotTimestamp = timepoint;
		} else {
			state.balanceSnapshotTimestamp = state.requestTimestamp;
		}

		EnumerableMap.AddressToUintMap storage winnerBalances = regularAirdropWinnerBalances[index];

		for (uint256 i = 0; i < numRequested; i++) {
			uint256 randomWord = randomWords[i];
			uint256 randomIndex = randomWord % numParticipants;
			address winner = eligibilityList.at(randomIndex);

			uint256 attempts = 0;
			uint256 balance = getPastVotes(winner, state.balanceSnapshotTimestamp);

			while (balance < regularAirdropConfig.eligibilityThreshold) {
				if (attempts >= 3) {
					winner = address(0);
					break;
				}
				randomWord = uint256(keccak256(abi.encode(randomWord)));
				randomIndex = randomWord % numParticipants;
				winner = eligibilityList.at(randomIndex);
				balance = getPastVotes(winner, timepoint);
				attempts++;
			}

			if (winner == address(0)) {
				continue;
			}

			state.totalBalance += balance;

			(, uint256 currentBalance) = winnerBalances.tryGet(winner);
			winnerBalances.set(winner, currentBalance + balance);
		}

		state.numFulfilled += numRequested;

		if (state.numFulfilled == regularAirdropConfig.numWinners) {
			state.status = AirdropStatus.Fulfilled;
		}

		emit RegularAirdropFulfilled(requestId, index, numRequested);
	}

	function computeRegularAirdropEarnings(uint16 batchSize) external {
		uint32 index = regularAirdropCurrentIndex();
		computeRegularAirdropEarnings(batchSize, index);
	}

	function computeRegularAirdropEarnings(uint16 batchSize, uint32 index) public {
		RegularAirdropState storage state = regularAirdropStates[index];

		require(state.status == AirdropStatus.Fulfilled, 'Not in Fulfilled state');

		EnumerableMap.AddressToUintMap storage winnerBalances = regularAirdropWinnerBalances[index];

		if (winnerBalances.length() == 0) {
			state.status = AirdropStatus.Computed;
			return;
		}

		if (batchSize == 0) {
			batchSize = uint16(winnerBalances.length());
		}

		uint256 amount = regularAirdropConfig.amount;

		for (uint256 i = 0; i < batchSize; i++) {
			(address winner, uint256 balance) = winnerBalances.at(state.lastIndexComputed);


			state.lastIndexComputed++;

			(,uint256 currentAmount) = earnings.tryGet(winner);

			if (state.lastIndexComputed == winnerBalances.length()) {
				uint256 remainder = amount - state.computedAmount;
				earnings.set(winner, currentAmount + remainder);

				state.computedAmount += remainder;
				state.status = AirdropStatus.Computed;

				break;
			} else {
				uint256 topUp = (balance * amount) / state.totalBalance;
				earnings.set(winner, currentAmount + topUp);
				state.computedAmount += topUp;
			}
		}
	}

	/**
	 * @dev Distributes the pending earnings.
	 */
	function distributeEarnings(uint16 batchSize) external {
		if (batchSize == 0) {
			batchSize = uint16(earnings.length());
		}

		for (uint256 i = 0; i < batchSize; i++) {
			if (earnings.length() == 0) {
				break;
			}

			(address account, uint256 amount) = earnings.at(0);

			// Update state
			earnings.remove(account);

			// Emit event
			emit EarningDistributed(account, amount);

			// Mint tokens
			_mint(account, amount);
		}
	}

	function claimEarnings() external {
		address account = msg.sender;
		require(earnings.contains(account), 'No earnings');

		uint256 amount = earnings.get(account);

		// Update state
		earnings.remove(account);

		// Emit event
		emit EarningDistributed(account, amount);

		// External interaction last
		_mint(account, amount);
	}

	function getTotalVotes() public view returns (uint256) {
		return _totalVotesCheckpoints.latest();
	}

	function getPastTotalVotes(uint256 timepoint) public view returns (uint256) {
		uint48 currentTimepoint = clock();
		if (timepoint >= currentTimepoint) {
			revert ERC5805FutureLookup(timepoint, currentTimepoint);
		}
		return _totalVotesCheckpoints.upperLookupRecent(SafeCast.toUint48(timepoint));
	}

	function _updateTotalVotes(address account, uint256 currentBalance) internal {
		uint256 previousBalance = voterBalances[account];
		bool wasVoter = previousBalance >= governanceThreshold;

		if (currentBalance >= governanceThreshold) {
			if (!wasVoter) {
				_totalVotesCheckpoints.push(clock(), SafeCast.toUint208(getTotalVotes() + currentBalance));
			} else {
				_totalVotesCheckpoints.push(clock(), SafeCast.toUint208(getTotalVotes() + currentBalance - previousBalance));
			}
			voterBalances[account] = currentBalance;
		} else {
			if (wasVoter) {
				_totalVotesCheckpoints.push(clock(), SafeCast.toUint208(getTotalVotes() - previousBalance));
			}
			voterBalances[account] = 0;
		}
	}

	/**
	 * @dev Updates the eligibility status of an address based on its token balance.
	 */
	function _updateEligibility(address account, uint256 currentBalance) internal {
		if (currentBalance >= regularAirdropConfig.eligibilityThreshold) {
			if (!eligibilityList.contains(account)) {
				eligibilityList.add(account);
			}
		} else if (eligibilityList.contains(account)) {
			eligibilityList.remove(account);
		}
	}

	/**
	 * @dev Overrides the ERC20 _update function to update eligibility status during transfers.
	 */
	function _update(
		address from,
		address to,
		uint256 amount
	) internal override(ERC20, ERC20Votes) {
		super._update(from, to, amount);

		if (from != address(0)) {
			uint256 fromBalance = balanceOf(from);
			_updateEligibility(from, fromBalance);
			_updateTotalVotes(from, fromBalance);
		}
		if (to != address(0)) {
			uint256 toBalance = balanceOf(to);
			_updateEligibility(to, toBalance);
			_updateTotalVotes(to, toBalance);
		}

		if (to != address(0) && delegates(to) == address(0)) {
			_delegate(to, to);
		}

		// Log the transaction to the randomness provider
		randomnessProvider.logTransaction(from, to, amount, address(this));
	}

	/**
	 * @dev Checks if the airdrop window is open based on the current time.
	 * @return bool True if the airdrop window is currently open, false otherwise.
	 */
	function isAirdropWindow() public view returns (bool) {
		return
			(block.timestamp - regularAirdropConfig.startTimestamp) %
				regularAirdropConfig.airdropTimeInterval <
			regularAirdropConfig.windowDuration;
	}

	function clock() public view override returns (uint48) {
		return uint48(block.timestamp);
	}

	// solhint-disable-next-line func-name-mixedcase
	function CLOCK_MODE() public pure override returns (string memory) {
		return 'mode=timestamp';
	}

	function nonces(
		address owner
	) public view virtual override(ERC20Permit, Nonces) returns (uint256) {
		return super.nonces(owner);
	}

	/**
	 * @dev Restrict delegation to only allow self-delegation.
	 */
	function delegate(address delegatee) public override {
		require(
			delegatee == msg.sender,
			'Can only delegate to yourself'
		);
		super.delegate(delegatee);
	}

	/**
	 * @dev Disable delegation by signature since it's incompatible with self-delegation restriction
	 */
	function delegateBySig(
		address /* delegatee */,
		uint256 /* nonce */,
		uint256 /* expiry */,
		uint8 /* v */,
		bytes32 /* r */,
		bytes32 /* s */
	) public virtual override {
		revert("Signature-based delegation is disabled");
	}

	function mint(address to, uint256 amount) external {
		require(msg.sender == migrationContract, 'Only the migration contract can mint');
		_mint(to, 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.0.0) (governance/utils/IVotes.sol)
pragma solidity ^0.8.20;

/**
 * @dev Common interface for {ERC20Votes}, {ERC721Votes}, and other {Votes}-enabled contracts.
 */
interface IVotes {
    /**
     * @dev The signature used has expired.
     */
    error VotesExpiredSignature(uint256 expiry);

    /**
     * @dev Emitted when an account changes their delegate.
     */
    event DelegateChanged(address indexed delegator, address indexed fromDelegate, address indexed toDelegate);

    /**
     * @dev Emitted when a token transfer or delegate change results in changes to a delegate's number of voting units.
     */
    event DelegateVotesChanged(address indexed delegate, uint256 previousVotes, uint256 newVotes);

    /**
     * @dev Returns the current amount of votes that `account` has.
     */
    function getVotes(address account) external view returns (uint256);

    /**
     * @dev Returns the amount of votes that `account` had at a specific moment in the past. If the `clock()` is
     * configured to use block numbers, this will return the value at the end of the corresponding block.
     */
    function getPastVotes(address account, uint256 timepoint) external view returns (uint256);

    /**
     * @dev Returns the total supply of votes available at a specific moment in the past. If the `clock()` is
     * configured to use block numbers, this will return the value at the end of the corresponding block.
     *
     * NOTE: This value is the sum of all available votes, which is not necessarily the sum of all delegated votes.
     * Votes that have not been delegated are still part of total supply, even though they would not participate in a
     * vote.
     */
    function getPastTotalSupply(uint256 timepoint) external view returns (uint256);

    /**
     * @dev Returns the delegate that `account` has chosen.
     */
    function delegates(address account) external view returns (address);

    /**
     * @dev Delegates votes from the sender to `delegatee`.
     */
    function delegate(address delegatee) external;

    /**
     * @dev Delegates votes from signer to `delegatee`.
     */
    function delegateBySig(address delegatee, uint256 nonce, uint256 expiry, uint8 v, bytes32 r, bytes32 s) external;
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (governance/utils/Votes.sol)
pragma solidity ^0.8.20;

import {IERC5805} from "../../interfaces/IERC5805.sol";
import {Context} from "../../utils/Context.sol";
import {Nonces} from "../../utils/Nonces.sol";
import {EIP712} from "../../utils/cryptography/EIP712.sol";
import {Checkpoints} from "../../utils/structs/Checkpoints.sol";
import {SafeCast} from "../../utils/math/SafeCast.sol";
import {ECDSA} from "../../utils/cryptography/ECDSA.sol";
import {Time} from "../../utils/types/Time.sol";

/**
 * @dev This is a base abstract contract that tracks voting units, which are a measure of voting power that can be
 * transferred, and provides a system of vote delegation, where an account can delegate its voting units to a sort of
 * "representative" that will pool delegated voting units from different accounts and can then use it to vote in
 * decisions. In fact, voting units _must_ be delegated in order to count as actual votes, and an account has to
 * delegate those votes to itself if it wishes to participate in decisions and does not have a trusted representative.
 *
 * This contract is often combined with a token contract such that voting units correspond to token units. For an
 * example, see {ERC721Votes}.
 *
 * The full history of delegate votes is tracked on-chain so that governance protocols can consider votes as distributed
 * at a particular block number to protect against flash loans and double voting. The opt-in delegate system makes the
 * cost of this history tracking optional.
 *
 * When using this module the derived contract must implement {_getVotingUnits} (for example, make it return
 * {ERC721-balanceOf}), and can use {_transferVotingUnits} to track a change in the distribution of those units (in the
 * previous example, it would be included in {ERC721-_update}).
 */
abstract contract Votes is Context, EIP712, Nonces, IERC5805 {
    using Checkpoints for Checkpoints.Trace208;

    bytes32 private constant DELEGATION_TYPEHASH =
        keccak256("Delegation(address delegatee,uint256 nonce,uint256 expiry)");

    mapping(address account => address) private _delegatee;

    mapping(address delegatee => Checkpoints.Trace208) private _delegateCheckpoints;

    Checkpoints.Trace208 private _totalCheckpoints;

    /**
     * @dev The clock was incorrectly modified.
     */
    error ERC6372InconsistentClock();

    /**
     * @dev Lookup to future votes is not available.
     */
    error ERC5805FutureLookup(uint256 timepoint, uint48 clock);

    /**
     * @dev Clock used for flagging checkpoints. Can be overridden to implement timestamp based
     * checkpoints (and voting), in which case {CLOCK_MODE} should be overridden as well to match.
     */
    function clock() public view virtual returns (uint48) {
        return Time.blockNumber();
    }

    /**
     * @dev Machine-readable description of the clock as specified in ERC-6372.
     */
    // solhint-disable-next-line func-name-mixedcase
    function CLOCK_MODE() public view virtual returns (string memory) {
        // Check that the clock was not modified
        if (clock() != Time.blockNumber()) {
            revert ERC6372InconsistentClock();
        }
        return "mode=blocknumber&from=default";
    }

    /**
     * @dev Returns the current amount of votes that `account` has.
     */
    function getVotes(address account) public view virtual returns (uint256) {
        return _delegateCheckpoints[account].latest();
    }

    /**
     * @dev Returns the amount of votes that `account` had at a specific moment in the past. If the `clock()` is
     * configured to use block numbers, this will return the value at the end of the corresponding block.
     *
     * Requirements:
     *
     * - `timepoint` must be in the past. If operating using block numbers, the block must be already mined.
     */
    function getPastVotes(address account, uint256 timepoint) public view virtual returns (uint256) {
        uint48 currentTimepoint = clock();
        if (timepoint >= currentTimepoint) {
            revert ERC5805FutureLookup(timepoint, currentTimepoint);
        }
        return _delegateCheckpoints[account].upperLookupRecent(SafeCast.toUint48(timepoint));
    }

    /**
     * @dev Returns the total supply of votes available at a specific moment in the past. If the `clock()` is
     * configured to use block numbers, this will return the value at the end of the corresponding block.
     *
     * NOTE: This value is the sum of all available votes, which is not necessarily the sum of all delegated votes.
     * Votes that have not been delegated are still part of total supply, even though they would not participate in a
     * vote.
     *
     * Requirements:
     *
     * - `timepoint` must be in the past. If operating using block numbers, the block must be already mined.
     */
    function getPastTotalSupply(uint256 timepoint) public view virtual returns (uint256) {
        uint48 currentTimepoint = clock();
        if (timepoint >= currentTimepoint) {
            revert ERC5805FutureLookup(timepoint, currentTimepoint);
        }
        return _totalCheckpoints.upperLookupRecent(SafeCast.toUint48(timepoint));
    }

    /**
     * @dev Returns the current total supply of votes.
     */
    function _getTotalSupply() internal view virtual returns (uint256) {
        return _totalCheckpoints.latest();
    }

    /**
     * @dev Returns the delegate that `account` has chosen.
     */
    function delegates(address account) public view virtual returns (address) {
        return _delegatee[account];
    }

    /**
     * @dev Delegates votes from the sender to `delegatee`.
     */
    function delegate(address delegatee) public virtual {
        address account = _msgSender();
        _delegate(account, delegatee);
    }

    /**
     * @dev Delegates votes from signer to `delegatee`.
     */
    function delegateBySig(
        address delegatee,
        uint256 nonce,
        uint256 expiry,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) public virtual {
        if (block.timestamp > expiry) {
            revert VotesExpiredSignature(expiry);
        }
        address signer = ECDSA.recover(
            _hashTypedDataV4(keccak256(abi.encode(DELEGATION_TYPEHASH, delegatee, nonce, expiry))),
            v,
            r,
            s
        );
        _useCheckedNonce(signer, nonce);
        _delegate(signer, delegatee);
    }

    /**
     * @dev Delegate all of `account`'s voting units to `delegatee`.
     *
     * Emits events {IVotes-DelegateChanged} and {IVotes-DelegateVotesChanged}.
     */
    function _delegate(address account, address delegatee) internal virtual {
        address oldDelegate = delegates(account);
        _delegatee[account] = delegatee;

        emit DelegateChanged(account, oldDelegate, delegatee);
        _moveDelegateVotes(oldDelegate, delegatee, _getVotingUnits(account));
    }

    /**
     * @dev Transfers, mints, or burns voting units. To register a mint, `from` should be zero. To register a burn, `to`
     * should be zero. Total supply of voting units will be adjusted with mints and burns.
     */
    function _transferVotingUnits(address from, address to, uint256 amount) internal virtual {
        if (from == address(0)) {
            _push(_totalCheckpoints, _add, SafeCast.toUint208(amount));
        }
        if (to == address(0)) {
            _push(_totalCheckpoints, _subtract, SafeCast.toUint208(amount));
        }
        _moveDelegateVotes(delegates(from), delegates(to), amount);
    }

    /**
     * @dev Moves delegated votes from one delegate to another.
     */
    function _moveDelegateVotes(address from, address to, uint256 amount) internal virtual {
        if (from != to && amount > 0) {
            if (from != address(0)) {
                (uint256 oldValue, uint256 newValue) = _push(
                    _delegateCheckpoints[from],
                    _subtract,
                    SafeCast.toUint208(amount)
                );
                emit DelegateVotesChanged(from, oldValue, newValue);
            }
            if (to != address(0)) {
                (uint256 oldValue, uint256 newValue) = _push(
                    _delegateCheckpoints[to],
                    _add,
                    SafeCast.toUint208(amount)
                );
                emit DelegateVotesChanged(to, oldValue, newValue);
            }
        }
    }

    /**
     * @dev Get number of checkpoints for `account`.
     */
    function _numCheckpoints(address account) internal view virtual returns (uint32) {
        return SafeCast.toUint32(_delegateCheckpoints[account].length());
    }

    /**
     * @dev Get the `pos`-th checkpoint for `account`.
     */
    function _checkpoints(
        address account,
        uint32 pos
    ) internal view virtual returns (Checkpoints.Checkpoint208 memory) {
        return _delegateCheckpoints[account].at(pos);
    }

    function _push(
        Checkpoints.Trace208 storage store,
        function(uint208, uint208) view returns (uint208) op,
        uint208 delta
    ) private returns (uint208 oldValue, uint208 newValue) {
        return store.push(clock(), op(store.latest(), delta));
    }

    function _add(uint208 a, uint208 b) private pure returns (uint208) {
        return a + b;
    }

    function _subtract(uint208 a, uint208 b) private pure returns (uint208) {
        return a - b;
    }

    /**
     * @dev Must return the voting units held by an account.
     */
    function _getVotingUnits(address) internal view virtual returns (uint256);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/draft-IERC6093.sol)
pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

interface IERC5267 {
    /**
     * @dev MAY be emitted to signal that the domain could have changed.
     */
    event EIP712DomainChanged();

    /**
     * @dev returns the fields and values that describe the domain separator used by this contract for EIP-712
     * signature.
     */
    function eip712Domain()
        external
        view
        returns (
            bytes1 fields,
            string memory name,
            string memory version,
            uint256 chainId,
            address verifyingContract,
            bytes32 salt,
            uint256[] memory extensions
        );
}

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

pragma solidity ^0.8.20;

import {IVotes} from "../governance/utils/IVotes.sol";
import {IERC6372} from "./IERC6372.sol";

interface IERC5805 is IERC6372, IVotes {}

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

pragma solidity ^0.8.20;

interface IERC6372 {
    /**
     * @dev Clock used for flagging checkpoints. Can be overridden to implement timestamp based checkpoints (and voting).
     */
    function clock() external view returns (uint48);

    /**
     * @dev Description of the clock
     */
    // solhint-disable-next-line func-name-mixedcase
    function CLOCK_MODE() external view returns (string memory);
}

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

pragma solidity ^0.8.20;

import {IERC20} from "./IERC20.sol";
import {IERC20Metadata} from "./extensions/IERC20Metadata.sol";
import {Context} from "../../utils/Context.sol";
import {IERC20Errors} from "../../interfaces/draft-IERC6093.sol";

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

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

    uint256 private _totalSupply;

    string private _name;
    string private _symbol;

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

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

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

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

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

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

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

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

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

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

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

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

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

        emit Transfer(from, to, value);
    }

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

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

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

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

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

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

pragma solidity ^0.8.20;

import {IERC20Permit} from "./IERC20Permit.sol";
import {ERC20} from "../ERC20.sol";
import {ECDSA} from "../../../utils/cryptography/ECDSA.sol";
import {EIP712} from "../../../utils/cryptography/EIP712.sol";
import {Nonces} from "../../../utils/Nonces.sol";

/**
 * @dev Implementation of the ERC-20 Permit extension allowing approvals to be made via signatures, as defined in
 * https://eips.ethereum.org/EIPS/eip-2612[ERC-2612].
 *
 * Adds the {permit} method, which can be used to change an account's ERC-20 allowance (see {IERC20-allowance}) by
 * presenting a message signed by the account. By not relying on `{IERC20-approve}`, the token holder account doesn't
 * need to send a transaction, and thus is not required to hold Ether at all.
 */
abstract contract ERC20Permit is ERC20, IERC20Permit, EIP712, Nonces {
    bytes32 private constant PERMIT_TYPEHASH =
        keccak256("Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)");

    /**
     * @dev Permit deadline has expired.
     */
    error ERC2612ExpiredSignature(uint256 deadline);

    /**
     * @dev Mismatched signature.
     */
    error ERC2612InvalidSigner(address signer, address owner);

    /**
     * @dev Initializes the {EIP712} domain separator using the `name` parameter, and setting `version` to `"1"`.
     *
     * It's a good idea to use the same `name` that is defined as the ERC-20 token name.
     */
    constructor(string memory name) EIP712(name, "1") {}

    /**
     * @inheritdoc IERC20Permit
     */
    function permit(
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) public virtual {
        if (block.timestamp > deadline) {
            revert ERC2612ExpiredSignature(deadline);
        }

        bytes32 structHash = keccak256(abi.encode(PERMIT_TYPEHASH, owner, spender, value, _useNonce(owner), deadline));

        bytes32 hash = _hashTypedDataV4(structHash);

        address signer = ECDSA.recover(hash, v, r, s);
        if (signer != owner) {
            revert ERC2612InvalidSigner(signer, owner);
        }

        _approve(owner, spender, value);
    }

    /**
     * @inheritdoc IERC20Permit
     */
    function nonces(address owner) public view virtual override(IERC20Permit, Nonces) returns (uint256) {
        return super.nonces(owner);
    }

    /**
     * @inheritdoc IERC20Permit
     */
    // solhint-disable-next-line func-name-mixedcase
    function DOMAIN_SEPARATOR() external view virtual returns (bytes32) {
        return _domainSeparatorV4();
    }
}

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

pragma solidity ^0.8.20;

import {ERC20} from "../ERC20.sol";
import {Votes} from "../../../governance/utils/Votes.sol";
import {Checkpoints} from "../../../utils/structs/Checkpoints.sol";

/**
 * @dev Extension of ERC-20 to support Compound-like voting and delegation. This version is more generic than Compound's,
 * and supports token supply up to 2^208^ - 1, while COMP is limited to 2^96^ - 1.
 *
 * NOTE: This contract does not provide interface compatibility with Compound's COMP token.
 *
 * This extension keeps a history (checkpoints) of each account's vote power. Vote power can be delegated either
 * by calling the {Votes-delegate} function directly, or by providing a signature to be used with {Votes-delegateBySig}. Voting
 * power can be queried through the public accessors {Votes-getVotes} and {Votes-getPastVotes}.
 *
 * By default, token balance does not account for voting power. This makes transfers cheaper. The downside is that it
 * requires users to delegate to themselves in order to activate checkpoints and have their voting power tracked.
 */
abstract contract ERC20Votes is ERC20, Votes {
    /**
     * @dev Total supply cap has been exceeded, introducing a risk of votes overflowing.
     */
    error ERC20ExceededSafeSupply(uint256 increasedSupply, uint256 cap);

    /**
     * @dev Maximum token supply. Defaults to `type(uint208).max` (2^208^ - 1).
     *
     * This maximum is enforced in {_update}. It limits the total supply of the token, which is otherwise a uint256,
     * so that checkpoints can be stored in the Trace208 structure used by {Votes}. Increasing this value will not
     * remove the underlying limitation, and will cause {_update} to fail because of a math overflow in
     * {Votes-_transferVotingUnits}. An override could be used to further restrict the total supply (to a lower value) if
     * additional logic requires it. When resolving override conflicts on this function, the minimum should be
     * returned.
     */
    function _maxSupply() internal view virtual returns (uint256) {
        return type(uint208).max;
    }

    /**
     * @dev Move voting power when tokens are transferred.
     *
     * Emits a {IVotes-DelegateVotesChanged} event.
     */
    function _update(address from, address to, uint256 value) internal virtual override {
        super._update(from, to, value);
        if (from == address(0)) {
            uint256 supply = totalSupply();
            uint256 cap = _maxSupply();
            if (supply > cap) {
                revert ERC20ExceededSafeSupply(supply, cap);
            }
        }
        _transferVotingUnits(from, to, value);
    }

    /**
     * @dev Returns the voting units of an `account`.
     *
     * WARNING: Overriding this function may compromise the internal vote accounting.
     * `ERC20Votes` assumes tokens map to voting units 1:1 and this is not easy to change.
     */
    function _getVotingUnits(address account) internal view virtual override returns (uint256) {
        return balanceOf(account);
    }

    /**
     * @dev Get number of checkpoints for `account`.
     */
    function numCheckpoints(address account) public view virtual returns (uint32) {
        return _numCheckpoints(account);
    }

    /**
     * @dev Get the `pos`-th checkpoint for `account`.
     */
    function checkpoints(address account, uint32 pos) public view virtual returns (Checkpoints.Checkpoint208 memory) {
        return _checkpoints(account, pos);
    }
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

pragma solidity ^0.8.20;

/**
 * @dev Interface of the ERC-20 Permit extension allowing approvals to be made via signatures, as defined in
 * https://eips.ethereum.org/EIPS/eip-2612[ERC-2612].
 *
 * Adds the {permit} method, which can be used to change an account's ERC-20 allowance (see {IERC20-allowance}) by
 * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't
 * need to send a transaction, and thus is not required to hold Ether at all.
 *
 * ==== Security Considerations
 *
 * There are two important considerations concerning the use of `permit`. The first is that a valid permit signature
 * expresses an allowance, and it should not be assumed to convey additional meaning. In particular, it should not be
 * considered as an intention to spend the allowance in any specific way. The second is that because permits have
 * built-in replay protection and can be submitted by anyone, they can be frontrun. A protocol that uses permits should
 * take this into consideration and allow a `permit` call to fail. Combining these two aspects, a pattern that may be
 * generally recommended is:
 *
 * ```solidity
 * function doThingWithPermit(..., uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s) public {
 *     try token.permit(msg.sender, address(this), value, deadline, v, r, s) {} catch {}
 *     doThing(..., value);
 * }
 *
 * function doThing(..., uint256 value) public {
 *     token.safeTransferFrom(msg.sender, address(this), value);
 *     ...
 * }
 * ```
 *
 * Observe that: 1) `msg.sender` is used as the owner, leaving no ambiguity as to the signer intent, and 2) the use of
 * `try/catch` allows the permit to fail and makes the code tolerant to frontrunning. (See also
 * {SafeERC20-safeTransferFrom}).
 *
 * Additionally, note that smart contract wallets (such as Argent or Safe) are not able to produce permit signatures, so
 * contracts should have entry points that don't rely on permit.
 */
interface IERC20Permit {
    /**
     * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
     * given ``owner``'s signed approval.
     *
     * IMPORTANT: The same issues {IERC20-approve} has related to transaction
     * ordering also apply here.
     *
     * Emits an {Approval} event.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     * - `deadline` must be a timestamp in the future.
     * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
     * over the EIP712-formatted function arguments.
     * - the signature must use ``owner``'s current nonce (see {nonces}).
     *
     * For more information on the signature format, see the
     * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
     * section].
     *
     * CAUTION: See Security Considerations above.
     */
    function permit(
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) external;

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

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

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

// 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/cryptography/ECDSA.sol)

pragma solidity ^0.8.20;

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

    /**
     * @dev The signature derives the `address(0)`.
     */
    error ECDSAInvalidSignature();

    /**
     * @dev The signature has an invalid length.
     */
    error ECDSAInvalidSignatureLength(uint256 length);

    /**
     * @dev The signature has an S value that is in the upper half order.
     */
    error ECDSAInvalidSignatureS(bytes32 s);

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with `signature` or an error. This will not
     * return address(0) without also returning an error description. Errors are documented using an enum (error type)
     * and a bytes32 providing additional information about the error.
     *
     * If no error is returned, then the address can be used for verification purposes.
     *
     * The `ecrecover` EVM precompile 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 {MessageHashUtils-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]
     */
    function tryRecover(
        bytes32 hash,
        bytes memory signature
    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
        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.
            assembly ("memory-safe") {
                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, bytes32(signature.length));
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature`. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM precompile 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 {MessageHashUtils-toEthSignedMessageHash} on it.
     */
    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, signature);
        _throwError(error, errorArg);
        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[ERC-2098 short signatures]
     */
    function tryRecover(
        bytes32 hash,
        bytes32 r,
        bytes32 vs
    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
        unchecked {
            bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
            // We do not check for an overflow here since the shift operation results in 0 or 1.
            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.
     */
    function recover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, r, vs);
        _throwError(error, errorArg);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `v`,
     * `r` and `s` signature fields separately.
     */
    function tryRecover(
        bytes32 hash,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
        // 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, s);
        }

        // 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, bytes32(0));
        }

        return (signer, RecoverError.NoError, bytes32(0));
    }

    /**
     * @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, bytes32 errorArg) = tryRecover(hash, v, r, s);
        _throwError(error, errorArg);
        return recovered;
    }

    /**
     * @dev Optionally reverts with the corresponding custom error according to the `error` argument provided.
     */
    function _throwError(RecoverError error, bytes32 errorArg) private pure {
        if (error == RecoverError.NoError) {
            return; // no error: do nothing
        } else if (error == RecoverError.InvalidSignature) {
            revert ECDSAInvalidSignature();
        } else if (error == RecoverError.InvalidSignatureLength) {
            revert ECDSAInvalidSignatureLength(uint256(errorArg));
        } else if (error == RecoverError.InvalidSignatureS) {
            revert ECDSAInvalidSignatureS(errorArg);
        }
    }
}

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

pragma solidity ^0.8.20;

import {MessageHashUtils} from "./MessageHashUtils.sol";
import {ShortStrings, ShortString} from "../ShortStrings.sol";
import {IERC5267} from "../../interfaces/IERC5267.sol";

/**
 * @dev https://eips.ethereum.org/EIPS/eip-712[EIP-712] is a standard for hashing and signing of typed structured data.
 *
 * The encoding scheme specified in the EIP requires a domain separator and a hash of the typed structured data, whose
 * encoding is very generic and therefore its implementation in Solidity is not feasible, thus this contract
 * does not implement the encoding itself. Protocols need to implement the type-specific encoding they need in order to
 * produce the hash of their typed data using a combination of `abi.encode` and `keccak256`.
 *
 * This contract implements the EIP-712 domain separator ({_domainSeparatorV4}) that is used as part of the encoding
 * scheme, and the final step of the encoding to obtain the message digest that is then signed via ECDSA
 * ({_hashTypedDataV4}).
 *
 * The implementation of the domain separator was designed to be as efficient as possible while still properly updating
 * the chain id to protect against replay attacks on an eventual fork of the chain.
 *
 * NOTE: This contract implements the version of the encoding known as "v4", as implemented by the JSON RPC method
 * https://docs.metamask.io/guide/signing-data.html[`eth_signTypedDataV4` in MetaMask].
 *
 * NOTE: In the upgradeable version of this contract, the cached values will correspond to the address, and the domain
 * separator of the implementation contract. This will cause the {_domainSeparatorV4} function to always rebuild the
 * separator from the immutable values, which is cheaper than accessing a cached version in cold storage.
 *
 * @custom:oz-upgrades-unsafe-allow state-variable-immutable
 */
abstract contract EIP712 is IERC5267 {
    using ShortStrings for *;

    bytes32 private constant TYPE_HASH =
        keccak256("EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)");

    // Cache the domain separator as an immutable value, but also store the chain id that it corresponds to, in order to
    // invalidate the cached domain separator if the chain id changes.
    bytes32 private immutable _cachedDomainSeparator;
    uint256 private immutable _cachedChainId;
    address private immutable _cachedThis;

    bytes32 private immutable _hashedName;
    bytes32 private immutable _hashedVersion;

    ShortString private immutable _name;
    ShortString private immutable _version;
    string private _nameFallback;
    string private _versionFallback;

    /**
     * @dev Initializes the domain separator and parameter caches.
     *
     * The meaning of `name` and `version` is specified in
     * https://eips.ethereum.org/EIPS/eip-712#definition-of-domainseparator[EIP-712]:
     *
     * - `name`: the user readable name of the signing domain, i.e. the name of the DApp or the protocol.
     * - `version`: the current major version of the signing domain.
     *
     * NOTE: These parameters cannot be changed except through a xref:learn::upgrading-smart-contracts.adoc[smart
     * contract upgrade].
     */
    constructor(string memory name, string memory version) {
        _name = name.toShortStringWithFallback(_nameFallback);
        _version = version.toShortStringWithFallback(_versionFallback);
        _hashedName = keccak256(bytes(name));
        _hashedVersion = keccak256(bytes(version));

        _cachedChainId = block.chainid;
        _cachedDomainSeparator = _buildDomainSeparator();
        _cachedThis = address(this);
    }

    /**
     * @dev Returns the domain separator for the current chain.
     */
    function _domainSeparatorV4() internal view returns (bytes32) {
        if (address(this) == _cachedThis && block.chainid == _cachedChainId) {
            return _cachedDomainSeparator;
        } else {
            return _buildDomainSeparator();
        }
    }

    function _buildDomainSeparator() private view returns (bytes32) {
        return keccak256(abi.encode(TYPE_HASH, _hashedName, _hashedVersion, block.chainid, address(this)));
    }

    /**
     * @dev Given an already https://eips.ethereum.org/EIPS/eip-712#definition-of-hashstruct[hashed struct], this
     * function returns the hash of the fully encoded EIP712 message for this domain.
     *
     * This hash can be used together with {ECDSA-recover} to obtain the signer of a message. For example:
     *
     * ```solidity
     * bytes32 digest = _hashTypedDataV4(keccak256(abi.encode(
     *     keccak256("Mail(address to,string contents)"),
     *     mailTo,
     *     keccak256(bytes(mailContents))
     * )));
     * address signer = ECDSA.recover(digest, signature);
     * ```
     */
    function _hashTypedDataV4(bytes32 structHash) internal view virtual returns (bytes32) {
        return MessageHashUtils.toTypedDataHash(_domainSeparatorV4(), structHash);
    }

    /**
     * @dev See {IERC-5267}.
     */
    function eip712Domain()
        public
        view
        virtual
        returns (
            bytes1 fields,
            string memory name,
            string memory version,
            uint256 chainId,
            address verifyingContract,
            bytes32 salt,
            uint256[] memory extensions
        )
    {
        return (
            hex"0f", // 01111
            _EIP712Name(),
            _EIP712Version(),
            block.chainid,
            address(this),
            bytes32(0),
            new uint256[](0)
        );
    }

    /**
     * @dev The name parameter for the EIP712 domain.
     *
     * NOTE: By default this function reads _name which is an immutable value.
     * It only reads from storage if necessary (in case the value is too large to fit in a ShortString).
     */
    // solhint-disable-next-line func-name-mixedcase
    function _EIP712Name() internal view returns (string memory) {
        return _name.toStringWithFallback(_nameFallback);
    }

    /**
     * @dev The version parameter for the EIP712 domain.
     *
     * NOTE: By default this function reads _version which is an immutable value.
     * It only reads from storage if necessary (in case the value is too large to fit in a ShortString).
     */
    // solhint-disable-next-line func-name-mixedcase
    function _EIP712Version() internal view returns (string memory) {
        return _version.toStringWithFallback(_versionFallback);
    }
}

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

pragma solidity ^0.8.20;

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

/**
 * @dev Signature message hash utilities for producing digests to be consumed by {ECDSA} recovery or signing.
 *
 * The library provides methods for generating a hash of a message that conforms to the
 * https://eips.ethereum.org/EIPS/eip-191[ERC-191] and https://eips.ethereum.org/EIPS/eip-712[EIP 712]
 * specifications.
 */
library MessageHashUtils {
    /**
     * @dev Returns the keccak256 digest of an ERC-191 signed data with version
     * `0x45` (`personal_sign` messages).
     *
     * The digest is calculated by prefixing a bytes32 `messageHash` with
     * `"\x19Ethereum Signed Message:\n32"` and hashing the result. It corresponds with the
     * hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
     *
     * NOTE: The `messageHash` parameter is intended to be the result of hashing a raw message with
     * keccak256, although any bytes32 value can be safely used because the final digest will
     * be re-hashed.
     *
     * See {ECDSA-recover}.
     */
    function toEthSignedMessageHash(bytes32 messageHash) internal pure returns (bytes32 digest) {
        assembly ("memory-safe") {
            mstore(0x00, "\x19Ethereum Signed Message:\n32") // 32 is the bytes-length of messageHash
            mstore(0x1c, messageHash) // 0x1c (28) is the length of the prefix
            digest := keccak256(0x00, 0x3c) // 0x3c is the length of the prefix (0x1c) + messageHash (0x20)
        }
    }

    /**
     * @dev Returns the keccak256 digest of an ERC-191 signed data with version
     * `0x45` (`personal_sign` messages).
     *
     * The digest is calculated by prefixing an arbitrary `message` with
     * `"\x19Ethereum Signed Message:\n" + len(message)` and hashing the result. It corresponds with the
     * hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
     *
     * See {ECDSA-recover}.
     */
    function toEthSignedMessageHash(bytes memory message) internal pure returns (bytes32) {
        return
            keccak256(bytes.concat("\x19Ethereum Signed Message:\n", bytes(Strings.toString(message.length)), message));
    }

    /**
     * @dev Returns the keccak256 digest of an ERC-191 signed data with version
     * `0x00` (data with intended validator).
     *
     * The digest is calculated by prefixing an arbitrary `data` with `"\x19\x00"` and the intended
     * `validator` address. Then hashing the result.
     *
     * See {ECDSA-recover}.
     */
    function toDataWithIntendedValidatorHash(address validator, bytes memory data) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked(hex"19_00", validator, data));
    }

    /**
     * @dev Returns the keccak256 digest of an EIP-712 typed data (ERC-191 version `0x01`).
     *
     * The digest is calculated from a `domainSeparator` and a `structHash`, by prefixing them with
     * `\x19\x01` and hashing the result. It corresponds to the hash signed by the
     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`] JSON-RPC method as part of EIP-712.
     *
     * See {ECDSA-recover}.
     */
    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32 digest) {
        assembly ("memory-safe") {
            let ptr := mload(0x40)
            mstore(ptr, hex"19_01")
            mstore(add(ptr, 0x02), domainSeparator)
            mstore(add(ptr, 0x22), structHash)
            digest := keccak256(ptr, 0x42)
        }
    }
}

// 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: 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) (utils/math/SignedMath.sol)

pragma solidity ^0.8.20;

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

/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @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, int256 a, int256 b) internal pure returns (int256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * int256(SafeCast.toUint(condition)));
        }
    }

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

    /**
     * @dev Returns the smallest of two signed numbers.
     */
    function min(int256 a, int256 b) internal pure returns (int256) {
        return ternary(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 {
            // Formula from the "Bit Twiddling Hacks" by Sean Eron Anderson.
            // Since `n` is a signed integer, the generated bytecode will use the SAR opcode to perform the right shift,
            // taking advantage of the most significant (or "sign" bit) in two's complement representation.
            // This opcode adds new most significant bits set to the value of the previous most significant bit. As a result,
            // the mask will either be `bytes32(0)` (if n is positive) or `~bytes32(0)` (if n is negative).
            int256 mask = n >> 255;

            // A `bytes32(0)` mask leaves the input unchanged, while a `~bytes32(0)` mask complements it.
            return uint256((n + mask) ^ mask);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (utils/Nonces.sol)
pragma solidity ^0.8.20;

/**
 * @dev Provides tracking nonces for addresses. Nonces will only increment.
 */
abstract contract Nonces {
    /**
     * @dev The nonce used for an `account` is not the expected current nonce.
     */
    error InvalidAccountNonce(address account, uint256 currentNonce);

    mapping(address account => uint256) private _nonces;

    /**
     * @dev Returns the next unused nonce for an address.
     */
    function nonces(address owner) public view virtual returns (uint256) {
        return _nonces[owner];
    }

    /**
     * @dev Consumes a nonce.
     *
     * Returns the current value and increments nonce.
     */
    function _useNonce(address owner) internal virtual returns (uint256) {
        // For each account, the nonce has an initial value of 0, can only be incremented by one, and cannot be
        // decremented or reset. This guarantees that the nonce never overflows.
        unchecked {
            // It is important to do x++ and not ++x here.
            return _nonces[owner]++;
        }
    }

    /**
     * @dev Same as {_useNonce} but checking that `nonce` is the next valid for `owner`.
     */
    function _useCheckedNonce(address owner, uint256 nonce) internal virtual {
        uint256 current = _useNonce(owner);
        if (nonce != current) {
            revert InvalidAccountNonce(owner, current);
        }
    }
}

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

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

pragma solidity ^0.8.20;

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

// | string  | 0xAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA   |
// | length  | 0x                                                              BB |
type ShortString is bytes32;

/**
 * @dev This library provides functions to convert short memory strings
 * into a `ShortString` type that can be used as an immutable variable.
 *
 * Strings of arbitrary length can be optimized using this library if
 * they are short enough (up to 31 bytes) by packing them with their
 * length (1 byte) in a single EVM word (32 bytes). Additionally, a
 * fallback mechanism can be used for every other case.
 *
 * Usage example:
 *
 * ```solidity
 * contract Named {
 *     using ShortStrings for *;
 *
 *     ShortString private immutable _name;
 *     string private _nameFallback;
 *
 *     constructor(string memory contractName) {
 *         _name = contractName.toShortStringWithFallback(_nameFallback);
 *     }
 *
 *     function name() external view returns (string memory) {
 *         return _name.toStringWithFallback(_nameFallback);
 *     }
 * }
 * ```
 */
library ShortStrings {
    // Used as an identifier for strings longer than 31 bytes.
    bytes32 private constant FALLBACK_SENTINEL = 0x00000000000000000000000000000000000000000000000000000000000000FF;

    error StringTooLong(string str);
    error InvalidShortString();

    /**
     * @dev Encode a string of at most 31 chars into a `ShortString`.
     *
     * This will trigger a `StringTooLong` error is the input string is too long.
     */
    function toShortString(string memory str) internal pure returns (ShortString) {
        bytes memory bstr = bytes(str);
        if (bstr.length > 31) {
            revert StringTooLong(str);
        }
        return ShortString.wrap(bytes32(uint256(bytes32(bstr)) | bstr.length));
    }

    /**
     * @dev Decode a `ShortString` back to a "normal" string.
     */
    function toString(ShortString sstr) internal pure returns (string memory) {
        uint256 len = byteLength(sstr);
        // using `new string(len)` would work locally but is not memory safe.
        string memory str = new string(32);
        assembly ("memory-safe") {
            mstore(str, len)
            mstore(add(str, 0x20), sstr)
        }
        return str;
    }

    /**
     * @dev Return the length of a `ShortString`.
     */
    function byteLength(ShortString sstr) internal pure returns (uint256) {
        uint256 result = uint256(ShortString.unwrap(sstr)) & 0xFF;
        if (result > 31) {
            revert InvalidShortString();
        }
        return result;
    }

    /**
     * @dev Encode a string into a `ShortString`, or write it to storage if it is too long.
     */
    function toShortStringWithFallback(string memory value, string storage store) internal returns (ShortString) {
        if (bytes(value).length < 32) {
            return toShortString(value);
        } else {
            StorageSlot.getStringSlot(store).value = value;
            return ShortString.wrap(FALLBACK_SENTINEL);
        }
    }

    /**
     * @dev Decode a string that was encoded to `ShortString` or written to storage using {setWithFallback}.
     */
    function toStringWithFallback(ShortString value, string storage store) internal pure returns (string memory) {
        if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {
            return toString(value);
        } else {
            return store;
        }
    }

    /**
     * @dev Return the length of a string that was encoded to `ShortString` or written to storage using
     * {setWithFallback}.
     *
     * WARNING: This will return the "byte length" of the string. This may not reflect the actual length in terms of
     * actual characters as the UTF-8 encoding of a single character can span over multiple bytes.
     */
    function byteLengthWithFallback(ShortString value, string storage store) internal view returns (uint256) {
        if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {
            return byteLength(value);
        } else {
            return bytes(store).length;
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Library for reading and writing primitive types to specific storage slots.
 *
 * Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.
 * This library helps with reading and writing to such slots without the need for inline assembly.
 *
 * The functions in this library return Slot structs that contain a `value` member that can be used to read or write.
 *
 * Example usage to set ERC-1967 implementation slot:
 * ```solidity
 * contract ERC1967 {
 *     // Define the slot. Alternatively, use the SlotDerivation library to derive the slot.
 *     bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;
 *
 *     function _getImplementation() internal view returns (address) {
 *         return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;
 *     }
 *
 *     function _setImplementation(address newImplementation) internal {
 *         require(newImplementation.code.length > 0);
 *         StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;
 *     }
 * }
 * ```
 *
 * TIP: Consider using this library along with {SlotDerivation}.
 */
library StorageSlot {
    struct AddressSlot {
        address value;
    }

    struct BooleanSlot {
        bool value;
    }

    struct Bytes32Slot {
        bytes32 value;
    }

    struct Uint256Slot {
        uint256 value;
    }

    struct Int256Slot {
        int256 value;
    }

    struct StringSlot {
        string value;
    }

    struct BytesSlot {
        bytes value;
    }

    /**
     * @dev Returns an `AddressSlot` with member `value` located at `slot`.
     */
    function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `BooleanSlot` with member `value` located at `slot`.
     */
    function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `Bytes32Slot` with member `value` located at `slot`.
     */
    function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `Uint256Slot` with member `value` located at `slot`.
     */
    function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `Int256Slot` with member `value` located at `slot`.
     */
    function getInt256Slot(bytes32 slot) internal pure returns (Int256Slot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `StringSlot` with member `value` located at `slot`.
     */
    function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `StringSlot` representation of the string storage pointer `store`.
     */
    function getStringSlot(string storage store) internal pure returns (StringSlot storage r) {
        assembly ("memory-safe") {
            r.slot := store.slot
        }
    }

    /**
     * @dev Returns a `BytesSlot` with member `value` located at `slot`.
     */
    function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `BytesSlot` representation of the bytes storage pointer `store`.
     */
    function getBytesSlot(bytes storage store) internal pure returns (BytesSlot storage r) {
        assembly ("memory-safe") {
            r.slot := store.slot
        }
    }
}

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

pragma solidity ^0.8.20;

import {Math} from "./math/Math.sol";
import {SignedMath} from "./math/SignedMath.sol";

/**
 * @dev String operations.
 */
library Strings {
    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;

    /**
     * @dev The `value` string doesn't fit in the specified `length`.
     */
    error StringsInsufficientHexLength(uint256 value, uint256 length);

    /**
     * @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;
            assembly ("memory-safe") {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                assembly ("memory-safe") {
                    mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toStringSigned(int256 value) internal pure returns (string memory) {
        return string.concat(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) {
        uint256 localValue = value;
        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] = HEX_DIGITS[localValue & 0xf];
            localValue >>= 4;
        }
        if (localValue != 0) {
            revert StringsInsufficientHexLength(value, length);
        }
        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 Converts an `address` with fixed length of 20 bytes to its checksummed ASCII `string` hexadecimal
     * representation, according to EIP-55.
     */
    function toChecksumHexString(address addr) internal pure returns (string memory) {
        bytes memory buffer = bytes(toHexString(addr));

        // hash the hex part of buffer (skip length + 2 bytes, length 40)
        uint256 hashValue;
        assembly ("memory-safe") {
            hashValue := shr(96, keccak256(add(buffer, 0x22), 40))
        }

        for (uint256 i = 41; i > 1; --i) {
            // possible values for buffer[i] are 48 (0) to 57 (9) and 97 (a) to 102 (f)
            if (hashValue & 0xf > 7 && uint8(buffer[i]) > 96) {
                // case shift by xoring with 0x20
                buffer[i] ^= 0x20;
            }
            hashValue >>= 4;
        }
        return string(buffer);
    }

    /**
     * @dev Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/structs/Checkpoints.sol)
// This file was procedurally generated from scripts/generate/templates/Checkpoints.js.

pragma solidity ^0.8.20;

import {Math} from "../math/Math.sol";

/**
 * @dev This library defines the `Trace*` struct, for checkpointing values as they change at different points in
 * time, and later looking up past values by block number. See {Votes} as an example.
 *
 * To create a history of checkpoints define a variable type `Checkpoints.Trace*` in your contract, and store a new
 * checkpoint for the current transaction block using the {push} function.
 */
library Checkpoints {
    /**
     * @dev A value was attempted to be inserted on a past checkpoint.
     */
    error CheckpointUnorderedInsertion();

    struct Trace224 {
        Checkpoint224[] _checkpoints;
    }

    struct Checkpoint224 {
        uint32 _key;
        uint224 _value;
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into a Trace224 so that it is stored as the checkpoint.
     *
     * Returns previous value and new value.
     *
     * IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint32).max` key set will disable the
     * library.
     */
    function push(
        Trace224 storage self,
        uint32 key,
        uint224 value
    ) internal returns (uint224 oldValue, uint224 newValue) {
        return _insert(self._checkpoints, key, value);
    }

    /**
     * @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
     * there is none.
     */
    function lowerLookup(Trace224 storage self, uint32 key) internal view returns (uint224) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
        return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     */
    function upperLookup(Trace224 storage self, uint32 key) internal view returns (uint224) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     *
     * NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
     * keys).
     */
    function upperLookupRecent(Trace224 storage self, uint32 key) internal view returns (uint224) {
        uint256 len = self._checkpoints.length;

        uint256 low = 0;
        uint256 high = len;

        if (len > 5) {
            uint256 mid = len - Math.sqrt(len);
            if (key < _unsafeAccess(self._checkpoints, mid)._key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }

        uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);

        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
     */
    function latest(Trace224 storage self) internal view returns (uint224) {
        uint256 pos = self._checkpoints.length;
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
     * in the most recent checkpoint.
     */
    function latestCheckpoint(Trace224 storage self) internal view returns (bool exists, uint32 _key, uint224 _value) {
        uint256 pos = self._checkpoints.length;
        if (pos == 0) {
            return (false, 0, 0);
        } else {
            Checkpoint224 storage ckpt = _unsafeAccess(self._checkpoints, pos - 1);
            return (true, ckpt._key, ckpt._value);
        }
    }

    /**
     * @dev Returns the number of checkpoint.
     */
    function length(Trace224 storage self) internal view returns (uint256) {
        return self._checkpoints.length;
    }

    /**
     * @dev Returns checkpoint at given position.
     */
    function at(Trace224 storage self, uint32 pos) internal view returns (Checkpoint224 memory) {
        return self._checkpoints[pos];
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
     * or by updating the last one.
     */
    function _insert(
        Checkpoint224[] storage self,
        uint32 key,
        uint224 value
    ) private returns (uint224 oldValue, uint224 newValue) {
        uint256 pos = self.length;

        if (pos > 0) {
            Checkpoint224 storage last = _unsafeAccess(self, pos - 1);
            uint32 lastKey = last._key;
            uint224 lastValue = last._value;

            // Checkpoint keys must be non-decreasing.
            if (lastKey > key) {
                revert CheckpointUnorderedInsertion();
            }

            // Update or push new checkpoint
            if (lastKey == key) {
                last._value = value;
            } else {
                self.push(Checkpoint224({_key: key, _value: value}));
            }
            return (lastValue, value);
        } else {
            self.push(Checkpoint224({_key: key, _value: value}));
            return (0, value);
        }
    }

    /**
     * @dev Return the index of the first (oldest) checkpoint with key strictly bigger than the search key, or `high`
     * if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
     * `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _upperBinaryLookup(
        Checkpoint224[] storage self,
        uint32 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key > key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }
        return high;
    }

    /**
     * @dev Return the index of the first (oldest) checkpoint with key greater or equal than the search key, or `high`
     * if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
     * `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _lowerBinaryLookup(
        Checkpoint224[] storage self,
        uint32 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key < key) {
                low = mid + 1;
            } else {
                high = mid;
            }
        }
        return high;
    }

    /**
     * @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
     */
    function _unsafeAccess(
        Checkpoint224[] storage self,
        uint256 pos
    ) private pure returns (Checkpoint224 storage result) {
        assembly {
            mstore(0, self.slot)
            result.slot := add(keccak256(0, 0x20), pos)
        }
    }

    struct Trace208 {
        Checkpoint208[] _checkpoints;
    }

    struct Checkpoint208 {
        uint48 _key;
        uint208 _value;
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into a Trace208 so that it is stored as the checkpoint.
     *
     * Returns previous value and new value.
     *
     * IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint48).max` key set will disable the
     * library.
     */
    function push(
        Trace208 storage self,
        uint48 key,
        uint208 value
    ) internal returns (uint208 oldValue, uint208 newValue) {
        return _insert(self._checkpoints, key, value);
    }

    /**
     * @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
     * there is none.
     */
    function lowerLookup(Trace208 storage self, uint48 key) internal view returns (uint208) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
        return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     */
    function upperLookup(Trace208 storage self, uint48 key) internal view returns (uint208) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     *
     * NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
     * keys).
     */
    function upperLookupRecent(Trace208 storage self, uint48 key) internal view returns (uint208) {
        uint256 len = self._checkpoints.length;

        uint256 low = 0;
        uint256 high = len;

        if (len > 5) {
            uint256 mid = len - Math.sqrt(len);
            if (key < _unsafeAccess(self._checkpoints, mid)._key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }

        uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);

        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
     */
    function latest(Trace208 storage self) internal view returns (uint208) {
        uint256 pos = self._checkpoints.length;
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
     * in the most recent checkpoint.
     */
    function latestCheckpoint(Trace208 storage self) internal view returns (bool exists, uint48 _key, uint208 _value) {
        uint256 pos = self._checkpoints.length;
        if (pos == 0) {
            return (false, 0, 0);
        } else {
            Checkpoint208 storage ckpt = _unsafeAccess(self._checkpoints, pos - 1);
            return (true, ckpt._key, ckpt._value);
        }
    }

    /**
     * @dev Returns the number of checkpoint.
     */
    function length(Trace208 storage self) internal view returns (uint256) {
        return self._checkpoints.length;
    }

    /**
     * @dev Returns checkpoint at given position.
     */
    function at(Trace208 storage self, uint32 pos) internal view returns (Checkpoint208 memory) {
        return self._checkpoints[pos];
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
     * or by updating the last one.
     */
    function _insert(
        Checkpoint208[] storage self,
        uint48 key,
        uint208 value
    ) private returns (uint208 oldValue, uint208 newValue) {
        uint256 pos = self.length;

        if (pos > 0) {
            Checkpoint208 storage last = _unsafeAccess(self, pos - 1);
            uint48 lastKey = last._key;
            uint208 lastValue = last._value;

            // Checkpoint keys must be non-decreasing.
            if (lastKey > key) {
                revert CheckpointUnorderedInsertion();
            }

            // Update or push new checkpoint
            if (lastKey == key) {
                last._value = value;
            } else {
                self.push(Checkpoint208({_key: key, _value: value}));
            }
            return (lastValue, value);
        } else {
            self.push(Checkpoint208({_key: key, _value: value}));
            return (0, value);
        }
    }

    /**
     * @dev Return the index of the first (oldest) checkpoint with key strictly bigger than the search key, or `high`
     * if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
     * `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _upperBinaryLookup(
        Checkpoint208[] storage self,
        uint48 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key > key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }
        return high;
    }

    /**
     * @dev Return the index of the first (oldest) checkpoint with key greater or equal than the search key, or `high`
     * if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
     * `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _lowerBinaryLookup(
        Checkpoint208[] storage self,
        uint48 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key < key) {
                low = mid + 1;
            } else {
                high = mid;
            }
        }
        return high;
    }

    /**
     * @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
     */
    function _unsafeAccess(
        Checkpoint208[] storage self,
        uint256 pos
    ) private pure returns (Checkpoint208 storage result) {
        assembly {
            mstore(0, self.slot)
            result.slot := add(keccak256(0, 0x20), pos)
        }
    }

    struct Trace160 {
        Checkpoint160[] _checkpoints;
    }

    struct Checkpoint160 {
        uint96 _key;
        uint160 _value;
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into a Trace160 so that it is stored as the checkpoint.
     *
     * Returns previous value and new value.
     *
     * IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint96).max` key set will disable the
     * library.
     */
    function push(
        Trace160 storage self,
        uint96 key,
        uint160 value
    ) internal returns (uint160 oldValue, uint160 newValue) {
        return _insert(self._checkpoints, key, value);
    }

    /**
     * @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
     * there is none.
     */
    function lowerLookup(Trace160 storage self, uint96 key) internal view returns (uint160) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
        return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     */
    function upperLookup(Trace160 storage self, uint96 key) internal view returns (uint160) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     *
     * NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
     * keys).
     */
    function upperLookupRecent(Trace160 storage self, uint96 key) internal view returns (uint160) {
        uint256 len = self._checkpoints.length;

        uint256 low = 0;
        uint256 high = len;

        if (len > 5) {
            uint256 mid = len - Math.sqrt(len);
            if (key < _unsafeAccess(self._checkpoints, mid)._key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }

        uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);

        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
     */
    function latest(Trace160 storage self) internal view returns (uint160) {
        uint256 pos = self._checkpoints.length;
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
     * in the most recent checkpoint.
     */
    function latestCheckpoint(Trace160 storage self) internal view returns (bool exists, uint96 _key, uint160 _value) {
        uint256 pos = self._checkpoints.length;
        if (pos == 0) {
            return (false, 0, 0);
        } else {
            Checkpoint160 storage ckpt = _unsafeAccess(self._checkpoints, pos - 1);
            return (true, ckpt._key, ckpt._value);
        }
    }

    /**
     * @dev Returns the number of checkpoint.
     */
    function length(Trace160 storage self) internal view returns (uint256) {
        return self._checkpoints.length;
    }

    /**
     * @dev Returns checkpoint at given position.
     */
    function at(Trace160 storage self, uint32 pos) internal view returns (Checkpoint160 memory) {
        return self._checkpoints[pos];
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
     * or by updating the last one.
     */
    function _insert(
        Checkpoint160[] storage self,
        uint96 key,
        uint160 value
    ) private returns (uint160 oldValue, uint160 newValue) {
        uint256 pos = self.length;

        if (pos > 0) {
            Checkpoint160 storage last = _unsafeAccess(self, pos - 1);
            uint96 lastKey = last._key;
            uint160 lastValue = last._value;

            // Checkpoint keys must be non-decreasing.
            if (lastKey > key) {
                revert CheckpointUnorderedInsertion();
            }

            // Update or push new checkpoint
            if (lastKey == key) {
                last._value = value;
            } else {
                self.push(Checkpoint160({_key: key, _value: value}));
            }
            return (lastValue, value);
        } else {
            self.push(Checkpoint160({_key: key, _value: value}));
            return (0, value);
        }
    }

    /**
     * @dev Return the index of the first (oldest) checkpoint with key strictly bigger than the search key, or `high`
     * if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
     * `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _upperBinaryLookup(
        Checkpoint160[] storage self,
        uint96 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key > key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }
        return high;
    }

    /**
     * @dev Return the index of the first (oldest) checkpoint with key greater or equal than the search key, or `high`
     * if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
     * `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _lowerBinaryLookup(
        Checkpoint160[] storage self,
        uint96 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key < key) {
                low = mid + 1;
            } else {
                high = mid;
            }
        }
        return high;
    }

    /**
     * @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
     */
    function _unsafeAccess(
        Checkpoint160[] storage self,
        uint256 pos
    ) private pure returns (Checkpoint160 storage result) {
        assembly {
            mstore(0, self.slot)
            result.slot := add(keccak256(0, 0x20), pos)
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/structs/EnumerableMap.sol)
// This file was procedurally generated from scripts/generate/templates/EnumerableMap.js.

pragma solidity ^0.8.20;

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

/**
 * @dev Library for managing an enumerable variant of Solidity's
 * https://solidity.readthedocs.io/en/latest/types.html#mapping-types[`mapping`]
 * type.
 *
 * Maps have the following properties:
 *
 * - Entries are added, removed, and checked for existence in constant time
 * (O(1)).
 * - Entries are enumerated in O(n). No guarantees are made on the ordering.
 *
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using EnumerableMap for EnumerableMap.UintToAddressMap;
 *
 *     // Declare a set state variable
 *     EnumerableMap.UintToAddressMap private myMap;
 * }
 * ```
 *
 * The following map types are supported:
 *
 * - `uint256 -> address` (`UintToAddressMap`) since v3.0.0
 * - `address -> uint256` (`AddressToUintMap`) since v4.6.0
 * - `bytes32 -> bytes32` (`Bytes32ToBytes32Map`) since v4.6.0
 * - `uint256 -> uint256` (`UintToUintMap`) since v4.7.0
 * - `bytes32 -> uint256` (`Bytes32ToUintMap`) since v4.7.0
 * - `uint256 -> bytes32` (`UintToBytes32Map`) since v5.1.0
 * - `address -> address` (`AddressToAddressMap`) since v5.1.0
 * - `address -> bytes32` (`AddressToBytes32Map`) since v5.1.0
 * - `bytes32 -> address` (`Bytes32ToAddressMap`) since v5.1.0
 *
 * [WARNING]
 * ====
 * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
 * unusable.
 * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
 *
 * In order to clean an EnumerableMap, you can either remove all elements one by one or create a fresh instance using an
 * array of EnumerableMap.
 * ====
 */
library EnumerableMap {
    using EnumerableSet for EnumerableSet.Bytes32Set;

    // To implement this library for multiple types with as little code repetition as possible, we write it in
    // terms of a generic Map type with bytes32 keys and values. The Map implementation uses private functions,
    // and user-facing implementations such as `UintToAddressMap` are just wrappers around the underlying Map.
    // This means that we can only create new EnumerableMaps for types that fit in bytes32.

    /**
     * @dev Query for a nonexistent map key.
     */
    error EnumerableMapNonexistentKey(bytes32 key);

    struct Bytes32ToBytes32Map {
        // Storage of keys
        EnumerableSet.Bytes32Set _keys;
        mapping(bytes32 key => bytes32) _values;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(Bytes32ToBytes32Map storage map, bytes32 key, bytes32 value) internal returns (bool) {
        map._values[key] = value;
        return map._keys.add(key);
    }

    /**
     * @dev Removes a key-value pair from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(Bytes32ToBytes32Map storage map, bytes32 key) internal returns (bool) {
        delete map._values[key];
        return map._keys.remove(key);
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bool) {
        return map._keys.contains(key);
    }

    /**
     * @dev Returns the number of key-value pairs in the map. O(1).
     */
    function length(Bytes32ToBytes32Map storage map) internal view returns (uint256) {
        return map._keys.length();
    }

    /**
     * @dev Returns the key-value pair stored at position `index` in the map. O(1).
     *
     * Note that there are no guarantees on the ordering of entries inside the
     * array, and it may change when more entries are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32ToBytes32Map storage map, uint256 index) internal view returns (bytes32 key, bytes32 value) {
        bytes32 atKey = map._keys.at(index);
        return (atKey, map._values[atKey]);
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bool exists, bytes32 value) {
        bytes32 val = map._values[key];
        if (val == bytes32(0)) {
            return (contains(map, key), bytes32(0));
        } else {
            return (true, val);
        }
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bytes32) {
        bytes32 value = map._values[key];
        if (value == 0 && !contains(map, key)) {
            revert EnumerableMapNonexistentKey(key);
        }
        return value;
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(Bytes32ToBytes32Map storage map) internal view returns (bytes32[] memory) {
        return map._keys.values();
    }

    // UintToUintMap

    struct UintToUintMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(UintToUintMap storage map, uint256 key, uint256 value) internal returns (bool) {
        return set(map._inner, bytes32(key), bytes32(value));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(UintToUintMap storage map, uint256 key) internal returns (bool) {
        return remove(map._inner, bytes32(key));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(UintToUintMap storage map, uint256 key) internal view returns (bool) {
        return contains(map._inner, bytes32(key));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(UintToUintMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintToUintMap storage map, uint256 index) internal view returns (uint256 key, uint256 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (uint256(atKey), uint256(val));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(UintToUintMap storage map, uint256 key) internal view returns (bool exists, uint256 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(key));
        return (success, uint256(val));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(UintToUintMap storage map, uint256 key) internal view returns (uint256) {
        return uint256(get(map._inner, bytes32(key)));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(UintToUintMap storage map) internal view returns (uint256[] memory) {
        bytes32[] memory store = keys(map._inner);
        uint256[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // UintToAddressMap

    struct UintToAddressMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(UintToAddressMap storage map, uint256 key, address value) internal returns (bool) {
        return set(map._inner, bytes32(key), bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(UintToAddressMap storage map, uint256 key) internal returns (bool) {
        return remove(map._inner, bytes32(key));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(UintToAddressMap storage map, uint256 key) internal view returns (bool) {
        return contains(map._inner, bytes32(key));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(UintToAddressMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintToAddressMap storage map, uint256 index) internal view returns (uint256 key, address value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (uint256(atKey), address(uint160(uint256(val))));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(UintToAddressMap storage map, uint256 key) internal view returns (bool exists, address value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(key));
        return (success, address(uint160(uint256(val))));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(UintToAddressMap storage map, uint256 key) internal view returns (address) {
        return address(uint160(uint256(get(map._inner, bytes32(key)))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(UintToAddressMap storage map) internal view returns (uint256[] memory) {
        bytes32[] memory store = keys(map._inner);
        uint256[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // UintToBytes32Map

    struct UintToBytes32Map {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(UintToBytes32Map storage map, uint256 key, bytes32 value) internal returns (bool) {
        return set(map._inner, bytes32(key), value);
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(UintToBytes32Map storage map, uint256 key) internal returns (bool) {
        return remove(map._inner, bytes32(key));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(UintToBytes32Map storage map, uint256 key) internal view returns (bool) {
        return contains(map._inner, bytes32(key));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(UintToBytes32Map storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintToBytes32Map storage map, uint256 index) internal view returns (uint256 key, bytes32 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (uint256(atKey), val);
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(UintToBytes32Map storage map, uint256 key) internal view returns (bool exists, bytes32 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(key));
        return (success, val);
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(UintToBytes32Map storage map, uint256 key) internal view returns (bytes32) {
        return get(map._inner, bytes32(key));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(UintToBytes32Map storage map) internal view returns (uint256[] memory) {
        bytes32[] memory store = keys(map._inner);
        uint256[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressToUintMap

    struct AddressToUintMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(AddressToUintMap storage map, address key, uint256 value) internal returns (bool) {
        return set(map._inner, bytes32(uint256(uint160(key))), bytes32(value));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(AddressToUintMap storage map, address key) internal returns (bool) {
        return remove(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(AddressToUintMap storage map, address key) internal view returns (bool) {
        return contains(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(AddressToUintMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressToUintMap storage map, uint256 index) internal view returns (address key, uint256 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (address(uint160(uint256(atKey))), uint256(val));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(AddressToUintMap storage map, address key) internal view returns (bool exists, uint256 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(uint256(uint160(key))));
        return (success, uint256(val));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(AddressToUintMap storage map, address key) internal view returns (uint256) {
        return uint256(get(map._inner, bytes32(uint256(uint160(key)))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(AddressToUintMap storage map) internal view returns (address[] memory) {
        bytes32[] memory store = keys(map._inner);
        address[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressToAddressMap

    struct AddressToAddressMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(AddressToAddressMap storage map, address key, address value) internal returns (bool) {
        return set(map._inner, bytes32(uint256(uint160(key))), bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(AddressToAddressMap storage map, address key) internal returns (bool) {
        return remove(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(AddressToAddressMap storage map, address key) internal view returns (bool) {
        return contains(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(AddressToAddressMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressToAddressMap storage map, uint256 index) internal view returns (address key, address value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (address(uint160(uint256(atKey))), address(uint160(uint256(val))));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(AddressToAddressMap storage map, address key) internal view returns (bool exists, address value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(uint256(uint160(key))));
        return (success, address(uint160(uint256(val))));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(AddressToAddressMap storage map, address key) internal view returns (address) {
        return address(uint160(uint256(get(map._inner, bytes32(uint256(uint160(key)))))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(AddressToAddressMap storage map) internal view returns (address[] memory) {
        bytes32[] memory store = keys(map._inner);
        address[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressToBytes32Map

    struct AddressToBytes32Map {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(AddressToBytes32Map storage map, address key, bytes32 value) internal returns (bool) {
        return set(map._inner, bytes32(uint256(uint160(key))), value);
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(AddressToBytes32Map storage map, address key) internal returns (bool) {
        return remove(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(AddressToBytes32Map storage map, address key) internal view returns (bool) {
        return contains(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(AddressToBytes32Map storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressToBytes32Map storage map, uint256 index) internal view returns (address key, bytes32 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (address(uint160(uint256(atKey))), val);
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(AddressToBytes32Map storage map, address key) internal view returns (bool exists, bytes32 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(uint256(uint160(key))));
        return (success, val);
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(AddressToBytes32Map storage map, address key) internal view returns (bytes32) {
        return get(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(AddressToBytes32Map storage map) internal view returns (address[] memory) {
        bytes32[] memory store = keys(map._inner);
        address[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // Bytes32ToUintMap

    struct Bytes32ToUintMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(Bytes32ToUintMap storage map, bytes32 key, uint256 value) internal returns (bool) {
        return set(map._inner, key, bytes32(value));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(Bytes32ToUintMap storage map, bytes32 key) internal returns (bool) {
        return remove(map._inner, key);
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(Bytes32ToUintMap storage map, bytes32 key) internal view returns (bool) {
        return contains(map._inner, key);
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(Bytes32ToUintMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32ToUintMap storage map, uint256 index) internal view returns (bytes32 key, uint256 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (atKey, uint256(val));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(Bytes32ToUintMap storage map, bytes32 key) internal view returns (bool exists, uint256 value) {
        (bool success, bytes32 val) = tryGet(map._inner, key);
        return (success, uint256(val));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(Bytes32ToUintMap storage map, bytes32 key) internal view returns (uint256) {
        return uint256(get(map._inner, key));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(Bytes32ToUintMap storage map) internal view returns (bytes32[] memory) {
        bytes32[] memory store = keys(map._inner);
        bytes32[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // Bytes32ToAddressMap

    struct Bytes32ToAddressMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(Bytes32ToAddressMap storage map, bytes32 key, address value) internal returns (bool) {
        return set(map._inner, key, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(Bytes32ToAddressMap storage map, bytes32 key) internal returns (bool) {
        return remove(map._inner, key);
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(Bytes32ToAddressMap storage map, bytes32 key) internal view returns (bool) {
        return contains(map._inner, key);
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(Bytes32ToAddressMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32ToAddressMap storage map, uint256 index) internal view returns (bytes32 key, address value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (atKey, address(uint160(uint256(val))));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(Bytes32ToAddressMap storage map, bytes32 key) internal view returns (bool exists, address value) {
        (bool success, bytes32 val) = tryGet(map._inner, key);
        return (success, address(uint160(uint256(val))));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(Bytes32ToAddressMap storage map, bytes32 key) internal view returns (address) {
        return address(uint160(uint256(get(map._inner, key))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(Bytes32ToAddressMap storage map) internal view returns (bytes32[] memory) {
        bytes32[] memory store = keys(map._inner);
        bytes32[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/structs/EnumerableSet.sol)
// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.

pragma solidity ^0.8.20;

/**
 * @dev Library for managing
 * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive
 * types.
 *
 * Sets have the following properties:
 *
 * - Elements are added, removed, and checked for existence in constant time
 * (O(1)).
 * - Elements are enumerated in O(n). No guarantees are made on the ordering.
 *
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using EnumerableSet for EnumerableSet.AddressSet;
 *
 *     // Declare a set state variable
 *     EnumerableSet.AddressSet private mySet;
 * }
 * ```
 *
 * As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`)
 * and `uint256` (`UintSet`) are supported.
 *
 * [WARNING]
 * ====
 * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
 * unusable.
 * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
 *
 * In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an
 * array of EnumerableSet.
 * ====
 */
library EnumerableSet {
    // To implement this library for multiple types with as little code
    // repetition as possible, we write it in terms of a generic Set type with
    // bytes32 values.
    // The Set implementation uses private functions, and user-facing
    // implementations (such as AddressSet) are just wrappers around the
    // underlying Set.
    // This means that we can only create new EnumerableSets for types that fit
    // in bytes32.

    struct Set {
        // Storage of set values
        bytes32[] _values;
        // Position is the index of the value in the `values` array plus 1.
        // Position 0 is used to mean a value is not in the set.
        mapping(bytes32 value => uint256) _positions;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function _add(Set storage set, bytes32 value) private returns (bool) {
        if (!_contains(set, value)) {
            set._values.push(value);
            // The value is stored at length-1, but we add 1 to all indexes
            // and use 0 as a sentinel value
            set._positions[value] = set._values.length;
            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function _remove(Set storage set, bytes32 value) private returns (bool) {
        // We cache the value's position to prevent multiple reads from the same storage slot
        uint256 position = set._positions[value];

        if (position != 0) {
            // Equivalent to contains(set, value)
            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in
            // the array, and then remove the last element (sometimes called as 'swap and pop').
            // This modifies the order of the array, as noted in {at}.

            uint256 valueIndex = position - 1;
            uint256 lastIndex = set._values.length - 1;

            if (valueIndex != lastIndex) {
                bytes32 lastValue = set._values[lastIndex];

                // Move the lastValue to the index where the value to delete is
                set._values[valueIndex] = lastValue;
                // Update the tracked position of the lastValue (that was just moved)
                set._positions[lastValue] = position;
            }

            // Delete the slot where the moved value was stored
            set._values.pop();

            // Delete the tracked position for the deleted slot
            delete set._positions[value];

            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function _contains(Set storage set, bytes32 value) private view returns (bool) {
        return set._positions[value] != 0;
    }

    /**
     * @dev Returns the number of values on the set. O(1).
     */
    function _length(Set storage set) private view returns (uint256) {
        return set._values.length;
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function _at(Set storage set, uint256 index) private view returns (bytes32) {
        return set._values[index];
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function _values(Set storage set) private view returns (bytes32[] memory) {
        return set._values;
    }

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _add(set._inner, value);
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _remove(set._inner, value);
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {
        return _contains(set._inner, value);
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(Bytes32Set storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {
        return _at(set._inner, index);
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {
        bytes32[] memory store = _values(set._inner);
        bytes32[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(AddressSet storage set, address value) internal returns (bool) {
        return _add(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(AddressSet storage set, address value) internal returns (bool) {
        return _remove(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(AddressSet storage set, address value) internal view returns (bool) {
        return _contains(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(AddressSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressSet storage set, uint256 index) internal view returns (address) {
        return address(uint160(uint256(_at(set._inner, index))));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(AddressSet storage set) internal view returns (address[] memory) {
        bytes32[] memory store = _values(set._inner);
        address[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(UintSet storage set, uint256 value) internal returns (bool) {
        return _add(set._inner, bytes32(value));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(UintSet storage set, uint256 value) internal returns (bool) {
        return _remove(set._inner, bytes32(value));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(UintSet storage set, uint256 value) internal view returns (bool) {
        return _contains(set._inner, bytes32(value));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(UintSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintSet storage set, uint256 index) internal view returns (uint256) {
        return uint256(_at(set._inner, index));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(UintSet storage set) internal view returns (uint256[] memory) {
        bytes32[] memory store = _values(set._inner);
        uint256[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }
}

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

pragma solidity ^0.8.20;

import {Math} from "../math/Math.sol";
import {SafeCast} from "../math/SafeCast.sol";

/**
 * @dev This library provides helpers for manipulating time-related objects.
 *
 * It uses the following types:
 * - `uint48` for timepoints
 * - `uint32` for durations
 *
 * While the library doesn't provide specific types for timepoints and duration, it does provide:
 * - a `Delay` type to represent duration that can be programmed to change value automatically at a given point
 * - additional helper functions
 */
library Time {
    using Time for *;

    /**
     * @dev Get the block timestamp as a Timepoint.
     */
    function timestamp() internal view returns (uint48) {
        return SafeCast.toUint48(block.timestamp);
    }

    /**
     * @dev Get the block number as a Timepoint.
     */
    function blockNumber() internal view returns (uint48) {
        return SafeCast.toUint48(block.number);
    }

    // ==================================================== Delay =====================================================
    /**
     * @dev A `Delay` is a uint32 duration that can be programmed to change value automatically at a given point in the
     * future. The "effect" timepoint describes when the transitions happens from the "old" value to the "new" value.
     * This allows updating the delay applied to some operation while keeping some guarantees.
     *
     * In particular, the {update} function guarantees that if the delay is reduced, the old delay still applies for
     * some time. For example if the delay is currently 7 days to do an upgrade, the admin should not be able to set
     * the delay to 0 and upgrade immediately. If the admin wants to reduce the delay, the old delay (7 days) should
     * still apply for some time.
     *
     *
     * The `Delay` type is 112 bits long, and packs the following:
     *
     * ```
     *   | [uint48]: effect date (timepoint)
     *   |           | [uint32]: value before (duration)
     *   ↓           ↓       ↓ [uint32]: value after (duration)
     * 0xAAAAAAAAAAAABBBBBBBBCCCCCCCC
     * ```
     *
     * NOTE: The {get} and {withUpdate} functions operate using timestamps. Block number based delays are not currently
     * supported.
     */
    type Delay is uint112;

    /**
     * @dev Wrap a duration into a Delay to add the one-step "update in the future" feature
     */
    function toDelay(uint32 duration) internal pure returns (Delay) {
        return Delay.wrap(duration);
    }

    /**
     * @dev Get the value at a given timepoint plus the pending value and effect timepoint if there is a scheduled
     * change after this timepoint. If the effect timepoint is 0, then the pending value should not be considered.
     */
    function _getFullAt(
        Delay self,
        uint48 timepoint
    ) private pure returns (uint32 valueBefore, uint32 valueAfter, uint48 effect) {
        (valueBefore, valueAfter, effect) = self.unpack();
        return effect <= timepoint ? (valueAfter, 0, 0) : (valueBefore, valueAfter, effect);
    }

    /**
     * @dev Get the current value plus the pending value and effect timepoint if there is a scheduled change. If the
     * effect timepoint is 0, then the pending value should not be considered.
     */
    function getFull(Delay self) internal view returns (uint32 valueBefore, uint32 valueAfter, uint48 effect) {
        return _getFullAt(self, timestamp());
    }

    /**
     * @dev Get the current value.
     */
    function get(Delay self) internal view returns (uint32) {
        (uint32 delay, , ) = self.getFull();
        return delay;
    }

    /**
     * @dev Update a Delay object so that it takes a new duration after a timepoint that is automatically computed to
     * enforce the old delay at the moment of the update. Returns the updated Delay object and the timestamp when the
     * new delay becomes effective.
     */
    function withUpdate(
        Delay self,
        uint32 newValue,
        uint32 minSetback
    ) internal view returns (Delay updatedDelay, uint48 effect) {
        uint32 value = self.get();
        uint32 setback = uint32(Math.max(minSetback, value > newValue ? value - newValue : 0));
        effect = timestamp() + setback;
        return (pack(value, newValue, effect), effect);
    }

    /**
     * @dev Split a delay into its components: valueBefore, valueAfter and effect (transition timepoint).
     */
    function unpack(Delay self) internal pure returns (uint32 valueBefore, uint32 valueAfter, uint48 effect) {
        uint112 raw = Delay.unwrap(self);

        valueAfter = uint32(raw);
        valueBefore = uint32(raw >> 32);
        effect = uint48(raw >> 64);

        return (valueBefore, valueAfter, effect);
    }

    /**
     * @dev pack the components into a Delay object.
     */
    function pack(uint32 valueBefore, uint32 valueAfter, uint48 effect) internal pure returns (Delay) {
        return Delay.wrap((uint112(effect) << 64) | (uint112(valueBefore) << 32) | uint112(valueAfter));
    }
}

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

import {AirdropStatus, InitialAirdropConfig, RegularAirdropConfig} from '../types/TokenOneTypes.sol';
import {IRandomnessProvider} from './IRandomnessProvider.sol';
import {IRandomnessConsumer} from './IRandomnessConsumer.sol';

interface IAirdropCoordinator is IRandomnessConsumer {
	// Getter functions for key state variables
	function randomnessProvider() external view returns (IRandomnessProvider);

	// Airdrop-related status functions
	function isReadyToComputeInitial() external view returns (bool);

	function isFinishedInitial() external view returns (bool);

	function isReadyToRequestRegular() external view returns (bool);

	function isReadyToComputeRegular() external view returns (bool);

	function isFinishedRegular() external view returns (bool);

	function hasPendingEarnings() external view returns (bool);

	function isAirdropWindow() external view returns (bool);

	// Administrative functions
	function setRandomnessProvider(address _randomnessProviderAddress) external;

	// Airdrop functions
	function requestInitialAirdrop() external;

	function computeInitialAirdropEarnings() external;

	function requestRegularAirdrop() external;

	function computeRegularAirdropEarnings(uint16 batchSize) external;

	// Earnings distribution
	function distributeEarnings(uint16 batchSize) external;
}

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

interface IGovernanceToken {
	// Getter functions for key state variables
	function getTotalVotes() external view returns (uint256);

	function getPastTotalVotes(uint256 timepoint) external view returns (uint256);

	function governanceThreshold() external view returns (uint256);
}

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;

interface IMintable {
    function mint(address to, uint256 amount) external;
}

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

interface IRandomnessConsumer {
	function fulfillRandomWords(
		uint256 requestId,
		uint256[] calldata randomWords,
		uint256 timepoint
	) external;
}

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

import {ITransactionLogger} from './ITransactionLogger.sol';

interface IRandomnessProvider is ITransactionLogger {
	function requestRandomWords(uint32 numWords) external returns (uint256);

	function routine() external;
}

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

interface ITransactionLogger {
	function logTransaction(
		address from,
		address to,
		uint256 amount,
		address token
	) external;
}

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

// Enum to track the status of airdrops
enum AirdropStatus {
	NotStarted,
	Requested,
	Fulfilled,
	Computed
}

// Structure to store initial airdrop configuration details
struct InitialAirdropConfig {
	address[] participants; // List of participants eligible for the initial airdrop
	uint8 numWinners; // Number of winners to select in the initial airdrop
	uint256 amount; // Amount of tokens to airdrop to each winner
}

// Structure to store the state of the initial airdrop
struct InitialAirdropState {
	AirdropStatus status; // Current status of the initial airdrop
	uint256[] randomWords; // Random words generated for the initial airdrop
}

// Structure to store ongoing airdrop configuration details
struct RegularAirdropConfig {
	uint256 startTimestamp; // Start time of the airdrop
	uint256 eligibilityThreshold; // Minimum balance required to be eligible for the airdrop
	uint256 airdropTimeInterval; // Interval between airdrops
	uint8 numWinners; // Number of winners to select in each airdrop
	uint256 amount; // Amount of tokens to airdrop to each winner
	uint256 windowDuration; // Duration of the airdrop window
	uint8 fulfillBatchSize; // Size of the batch when making draws
}

// Structure to store the state of regular airdrops
struct RegularAirdropState {
	uint256 requestTimestamp;
	uint256 balanceSnapshotTimestamp;
	uint32 numRequested; // Number of draws that have been requested
	uint32 numFulfilled; // Number of draws that have been fulfilled
	uint256 computedAmount; // Amount of distribution tokens computed for the airdrop
	uint256 lastIndexComputed; // Index of the last winner computed
	uint256 totalBalance; // Total balance of all winners
	AirdropStatus status; // Status of the regular airdrop
}

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"string","name":"tokenName","type":"string"},{"internalType":"string","name":"tokenSymbol","type":"string"},{"components":[{"internalType":"address[]","name":"participants","type":"address[]"},{"internalType":"uint8","name":"numWinners","type":"uint8"},{"internalType":"uint256","name":"amount","type":"uint256"}],"internalType":"struct InitialAirdropConfig","name":"_initialAirdropConfig","type":"tuple"},{"components":[{"internalType":"uint256","name":"startTimestamp","type":"uint256"},{"internalType":"uint256","name":"eligibilityThreshold","type":"uint256"},{"internalType":"uint256","name":"airdropTimeInterval","type":"uint256"},{"internalType":"uint8","name":"numWinners","type":"uint8"},{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"uint256","name":"windowDuration","type":"uint256"},{"internalType":"uint8","name":"fulfillBatchSize","type":"uint8"}],"internalType":"struct RegularAirdropConfig","name":"_regularAirdropConfig","type":"tuple"},{"internalType":"uint256","name":"_governanceThreshold","type":"uint256"},{"internalType":"address","name":"_migrationContract","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"CheckpointUnorderedInsertion","type":"error"},{"inputs":[],"name":"ECDSAInvalidSignature","type":"error"},{"inputs":[{"internalType":"uint256","name":"length","type":"uint256"}],"name":"ECDSAInvalidSignatureLength","type":"error"},{"inputs":[{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"ECDSAInvalidSignatureS","type":"error"},{"inputs":[{"internalType":"uint256","name":"increasedSupply","type":"uint256"},{"internalType":"uint256","name":"cap","type":"uint256"}],"name":"ERC20ExceededSafeSupply","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"allowance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientAllowance","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"balance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientBalance","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC20InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC20InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC20InvalidSender","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"}],"name":"ERC20InvalidSpender","type":"error"},{"inputs":[{"internalType":"uint256","name":"deadline","type":"uint256"}],"name":"ERC2612ExpiredSignature","type":"error"},{"inputs":[{"internalType":"address","name":"signer","type":"address"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC2612InvalidSigner","type":"error"},{"inputs":[{"internalType":"uint256","name":"timepoint","type":"uint256"},{"internalType":"uint48","name":"clock","type":"uint48"}],"name":"ERC5805FutureLookup","type":"error"},{"inputs":[],"name":"ERC6372InconsistentClock","type":"error"},{"inputs":[{"internalType":"bytes32","name":"key","type":"bytes32"}],"name":"EnumerableMapNonexistentKey","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint256","name":"currentNonce","type":"uint256"}],"name":"InvalidAccountNonce","type":"error"},{"inputs":[],"name":"InvalidShortString","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":[{"internalType":"uint8","name":"bits","type":"uint8"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"SafeCastOverflowedUintDowncast","type":"error"},{"inputs":[{"internalType":"string","name":"str","type":"string"}],"name":"StringTooLong","type":"error"},{"inputs":[{"internalType":"uint256","name":"expiry","type":"uint256"}],"name":"VotesExpiredSignature","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"spender","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"delegator","type":"address"},{"indexed":true,"internalType":"address","name":"fromDelegate","type":"address"},{"indexed":true,"internalType":"address","name":"toDelegate","type":"address"}],"name":"DelegateChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"delegate","type":"address"},{"indexed":false,"internalType":"uint256","name":"previousVotes","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"newVotes","type":"uint256"}],"name":"DelegateVotesChanged","type":"event"},{"anonymous":false,"inputs":[],"name":"EIP712DomainChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"winner","type":"address"},{"indexed":true,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"EarningDistributed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"requestId","type":"uint256"}],"name":"InitialAirdropFulfilled","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"requestId","type":"uint256"}],"name":"InitialAirdropRequested","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":"randomnessProviderAddress","type":"address"}],"name":"RandomnessProviderSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"requestId","type":"uint256"},{"indexed":true,"internalType":"uint32","name":"index","type":"uint32"},{"indexed":true,"internalType":"uint32","name":"numFulfilled","type":"uint32"}],"name":"RegularAirdropFulfilled","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"requestId","type":"uint256"},{"indexed":true,"internalType":"uint32","name":"index","type":"uint32"},{"indexed":true,"internalType":"uint32","name":"numRequested","type":"uint32"}],"name":"RegularAirdropRequested","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"CLOCK_MODE","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"pure","type":"function"},{"inputs":[],"name":"DOMAIN_SEPARATOR","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"spender","type":"address"}],"name":"allowance","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"approve","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint32","name":"pos","type":"uint32"}],"name":"checkpoints","outputs":[{"components":[{"internalType":"uint48","name":"_key","type":"uint48"},{"internalType":"uint208","name":"_value","type":"uint208"}],"internalType":"struct Checkpoints.Checkpoint208","name":"","type":"tuple"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"claimEarnings","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"clock","outputs":[{"internalType":"uint48","name":"","type":"uint48"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"computeInitialAirdropEarnings","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint16","name":"batchSize","type":"uint16"}],"name":"computeRegularAirdropEarnings","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint16","name":"batchSize","type":"uint16"},{"internalType":"uint32","name":"index","type":"uint32"}],"name":"computeRegularAirdropEarnings","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"decimals","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"delegatee","type":"address"}],"name":"delegate","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"uint8","name":"","type":"uint8"},{"internalType":"bytes32","name":"","type":"bytes32"},{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"delegateBySig","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"delegates","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint16","name":"batchSize","type":"uint16"}],"name":"distributeEarnings","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"eip712Domain","outputs":[{"internalType":"bytes1","name":"fields","type":"bytes1"},{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"version","type":"string"},{"internalType":"uint256","name":"chainId","type":"uint256"},{"internalType":"address","name":"verifyingContract","type":"address"},{"internalType":"bytes32","name":"salt","type":"bytes32"},{"internalType":"uint256[]","name":"extensions","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"requestId","type":"uint256"},{"internalType":"uint256[]","name":"randomWords","type":"uint256[]"},{"internalType":"uint256","name":"timepoint","type":"uint256"}],"name":"fulfillRandomWords","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"timepoint","type":"uint256"}],"name":"getPastTotalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"timepoint","type":"uint256"}],"name":"getPastTotalVotes","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint256","name":"timepoint","type":"uint256"}],"name":"getPastVotes","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getTotalVotes","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"getVotes","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"governanceThreshold","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"hasPendingEarnings","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"initialAirdropConfig","outputs":[{"internalType":"uint8","name":"numWinners","type":"uint8"},{"internalType":"uint256","name":"amount","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"initialAirdropState","outputs":[{"internalType":"enum AirdropStatus","name":"status","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isAirdropWindow","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isFinishedInitial","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isFinishedRegular","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"isInitialAirdrop","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isReadyToComputeInitial","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isReadyToComputeRegular","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isReadyToRequestRegular","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"migrationContract","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"mint","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"nonces","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"numCheckpoints","outputs":[{"internalType":"uint32","name":"","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"},{"internalType":"uint256","name":"deadline","type":"uint256"},{"internalType":"uint8","name":"v","type":"uint8"},{"internalType":"bytes32","name":"r","type":"bytes32"},{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"permit","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"randomnessProvider","outputs":[{"internalType":"contract IRandomnessProvider","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"regularAirdropConfig","outputs":[{"internalType":"uint256","name":"startTimestamp","type":"uint256"},{"internalType":"uint256","name":"eligibilityThreshold","type":"uint256"},{"internalType":"uint256","name":"airdropTimeInterval","type":"uint256"},{"internalType":"uint8","name":"numWinners","type":"uint8"},{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"uint256","name":"windowDuration","type":"uint256"},{"internalType":"uint8","name":"fulfillBatchSize","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"regularAirdropCurrentIndex","outputs":[{"internalType":"uint32","name":"","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint32","name":"","type":"uint32"}],"name":"regularAirdropStates","outputs":[{"internalType":"uint256","name":"requestTimestamp","type":"uint256"},{"internalType":"uint256","name":"balanceSnapshotTimestamp","type":"uint256"},{"internalType":"uint32","name":"numRequested","type":"uint32"},{"internalType":"uint32","name":"numFulfilled","type":"uint32"},{"internalType":"uint256","name":"computedAmount","type":"uint256"},{"internalType":"uint256","name":"lastIndexComputed","type":"uint256"},{"internalType":"uint256","name":"totalBalance","type":"uint256"},{"internalType":"enum AirdropStatus","name":"status","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"requestIdToIndex","outputs":[{"internalType":"uint32","name":"","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"requestInitialAirdrop","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"requestRegularAirdrop","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_randomnessProviderAddress","type":"address"}],"name":"setRandomnessProvider","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transfer","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transferFrom","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"voterBalances","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"}]

6101806040523480156200001257600080fd5b50604051620048a9380380620048a9833981016040819052620000359162000757565b338680604051806040016040528060018152602001603160f81b815250898981600390816200006591906200096a565b5060046200007482826200096a565b50620000869150839050600562000432565b610120526200009781600662000432565b61014052815160208084019190912060e052815190820120610100524660a0526200012560e05161010051604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201529081019290925260608201524660808201523060a082015260009060c00160405160208183030381529060405280519060200120905090565b60805250503060c052506001600160a01b0381166200015f57604051631e4fbdf760e01b8152600060048201526024015b60405180910390fd5b6200016a816200046b565b506000846040015111620001c15760405162461bcd60e51b815260206004820152601660248201527f496e76616c69642061697264726f7020616d6f756e7400000000000000000000604482015260640162000156565b835151620002045760405162461bcd60e51b815260206004820152600f60248201526e4e6f207061727469636970616e747360881b604482015260640162000156565b60008360800151116200025a5760405162461bcd60e51b815260206004820152601e60248201527f496e76616c696420726567756c61722061697264726f7020616d6f756e740000604482015260640162000156565b6000836040015111620002b05760405162461bcd60e51b815260206004820152601860248201527f496e76616c69642061697264726f7020696e74657276616c0000000000000000604482015260640162000156565b82604001518360a0015111156200030a5760405162461bcd60e51b815260206004820152601760248201527f496e76616c69642077696e646f77206475726174696f6e000000000000000000604482015260640162000156565b6001600160a01b038116620003745760405162461bcd60e51b815260206004820152602960248201527f4d6967726174696f6e20636f6e74726163742063616e6e6f74206265207a65726044820152686f206164647265737360b81b606482015260840162000156565b835180518591600f916200039091839160209091019062000500565b5060208281015160018301805460ff1990811660ff93841617909155604094850151600290940193909355865160125590860151601355918501516014556060850151601580548316918416919091179055608085015160165560a085015160175560c0909401516018805490951691161790925561016052600c80546001600160a01b0319166001600160a01b039092169190911790555062000a90915050565b600060208351101562000452576200044a83620004bd565b905062000465565b816200045f84826200096a565b5060ff90505b92915050565b600b80546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e090600090a35050565b600080829050601f81511115620004eb578260405163305a27a960e01b815260040162000156919062000a36565b8051620004f88262000a6b565b179392505050565b82805482825590600052602060002090810192821562000558579160200282015b828111156200055857825182546001600160a01b0319166001600160a01b0390911617825560209092019160019091019062000521565b50620005669291506200056a565b5090565b5b808211156200056657600081556001016200056b565b634e487b7160e01b600052604160045260246000fd5b604051606081016001600160401b0381118282101715620005bc57620005bc62000581565b60405290565b604051601f8201601f191681016001600160401b0381118282101715620005ed57620005ed62000581565b604052919050565b60005b8381101562000612578181015183820152602001620005f8565b50506000910152565b600082601f8301126200062d57600080fd5b81516001600160401b0381111562000649576200064962000581565b6200065e601f8201601f1916602001620005c2565b8181528460208386010111156200067457600080fd5b62000687826020830160208701620005f5565b949350505050565b80516001600160a01b0381168114620006a757600080fd5b919050565b805160ff81168114620006a757600080fd5b600060e08284031215620006d157600080fd5b60405160e081016001600160401b0381118282101715620006f657620006f662000581565b80604052508091508251815260208301516020820152604083015160408201526200072460608401620006ac565b60608201526080830151608082015260a083015160a08201526200074b60c08401620006ac565b60c08201525092915050565b60008060008060008061018087890312156200077257600080fd5b86516001600160401b03808211156200078a57600080fd5b620007988a838b016200061b565b9750602091508189015181811115620007b057600080fd5b620007be8b828c016200061b565b975050604089015181811115620007d457600080fd5b89016060818c031215620007e757600080fd5b620007f162000597565b8151838111156200080157600080fd5b8201601f81018d136200081357600080fd5b80518481111562000828576200082862000581565b8060051b94506200083b868601620005c2565b818152948201860194868101908f8711156200085657600080fd5b928701925b868410156200087f576200086f846200068f565b825292870192908701906200085b565b84525062000892915050828501620006ac565b848201526040820151604082015280975050505050620008b68860608901620006be565b92506101408701519150620008cf61016088016200068f565b90509295509295509295565b600181811c90821680620008f057607f821691505b6020821081036200091157634e487b7160e01b600052602260045260246000fd5b50919050565b601f8211156200096557600081815260208120601f850160051c81016020861015620009405750805b601f850160051c820191505b8181101562000961578281556001016200094c565b5050505b505050565b81516001600160401b0381111562000986576200098662000581565b6200099e81620009978454620008db565b8462000917565b602080601f831160018114620009d65760008415620009bd5750858301515b600019600386901b1c1916600185901b17855562000961565b600085815260208120601f198616915b8281101562000a0757888601518255948401946001909101908401620009e6565b508582101562000a265787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b602081526000825180602084015262000a57816040850160208701620005f5565b601f01601f19169190910160400192915050565b80516020808301519190811015620009115760001960209190910360031b1b16919050565b60805160a05160c05160e05161010051610120516101405161016051613dac62000afd600039600081816105e50152612e58015260006120800152600061205301526000611ddb01526000611db301526000611d0e01526000611d3801526000611d620152613dac6000f3fe608060405234801561001057600080fd5b50600436106103785760003560e01c80637ecebe00116101d3578063bc705aa211610104578063d9ceab13116100a2578063dde47d971161007c578063dde47d971461086f578063eadf016d14610877578063f1127ed81461087f578063f2fde38b146108be57600080fd5b8063d9ceab1314610826578063dbda93a91461082e578063dd62ed3e1461083657600080fd5b8063c87b4b55116100de578063c87b4b55146107c7578063ce9bf5ac146107ed578063ceb4a76a14610800578063d505accf1461081357600080fd5b8063bc705aa214610749578063bee54460146107ac578063c3cda520146107b457600080fd5b806395d89b4111610171578063a34b0ede1161014b578063a34b0ede14610713578063a9059cbb1461071b578063aed89f351461072e578063b15fbc141461073657600080fd5b806395d89b41146106f05780639a0e7d66146106f85780639ab24eb01461070057600080fd5b80638da5cb5b116101ad5780638da5cb5b146106ae5780638e539e8c146106bf57806391ddadf4146106d2578063932c2a3f146106e857600080fd5b80637ecebe001461066d57806384b0196e146106805780638969547c1461069b57600080fd5b806342449df6116102ad5780636477bf471161024b5780636fcfff45116102255780636fcfff451461060f57806370a0823114610622578063715018a61461064b578063747036c81461065357600080fd5b80636477bf471461057057806366e37eae146105e057806369ca60d61461060757600080fd5b80634d723945116102875780634d72394514610518578063587cde1e146105425780635c19a95c146105555780636251812b1461056857600080fd5b806342449df6146104c85780634bf5d7e9146104db5780634c932c981461050557600080fd5b80632ab093801161031a5780633688c030116102f45780633688c0301461046a5780633992609e1461048d5780633a46b1a8146104a057806340c10f19146104b357600080fd5b80632ab093801461044b578063313ce567146104535780633644e5151461046257600080fd5b80630fee1a20116103565780630fee1a20146103e857806318160ddd1461041357806323b872dd1461041b578063255f71731461042e57600080fd5b806301d215bf1461037d57806306fdde03146103b0578063095ea7b3146103c5575b600080fd5b61039d61038b36600461370b565b60216020526000908152604090205481565b6040519081526020015b60405180910390f35b6103b86108d1565b6040516103a7919061376c565b6103d86103d336600461377f565b610963565b60405190151581526020016103a7565b600c546103fb906001600160a01b031681565b6040516001600160a01b0390911681526020016103a7565b60025461039d565b6103d86104293660046137a9565b61097d565b6104366109a1565b60405163ffffffff90911681526020016103a7565b6103d86109c9565b604051601281526020016103a7565b61039d6109dc565b6103d86104783660046137e5565b601e6020526000908152604090205460ff1681565b61039d61049b3660046137e5565b6109eb565b61039d6104ae36600461377f565b610a50565b6104c66104c136600461377f565b610ac7565b005b6104c66104d6366004613810565b610b3b565b60408051808201909152600e81526d06d6f64653d74696d657374616d760941b60208201526103b8565b6104c6610513366004613810565b610b51565b6010546011546105299160ff169082565b6040805160ff90931683526020830191909152016103a7565b6103fb61055036600461370b565b610bfc565b6104c661056336600461370b565b610c1a565b6103d8610c7e565b6105cc61057e36600461383f565b601b6020526000908152604090208054600182015460028301546003840154600485015460058601546006909601549495939463ffffffff8085169564010000000090950416939060ff1688565b6040516103a7989796959493929190613892565b61039d7f000000000000000000000000000000000000000000000000000000000000000081565b6103d8610ca0565b61043661061d36600461370b565b610ca9565b61039d61063036600461370b565b6001600160a01b031660009081526020819052604090205490565b6104c6610cb4565b6019546106609060ff1681565b6040516103a791906138e4565b61039d61067b36600461370b565b610cc8565b610688610cd3565b6040516103a797969594939291906138f2565b6104c66106a9366004613988565b610d19565b600b546001600160a01b03166103fb565b61039d6106cd3660046137e5565b610f0e565b60405165ffffffffffff421681526020016103a7565b6103d8610f5e565b6103b8610f86565b61039d610f95565b61039d61070e36600461370b565b610faf565b6103d8610fdf565b6103d861072936600461377f565b611030565b6104c661103e565b6104c661074436600461370b565b611209565b6012546013546014546015546016546017546018546107719695949360ff9081169392911687565b6040805197885260208801969096529486019390935260ff9182166060860152608085015260a08401919091521660c082015260e0016103a7565b6104c66112c4565b6104c66107c23660046139cc565b6115d7565b6104366107d53660046137e5565b601d6020526000908152604090205463ffffffff1681565b601f546103fb906001600160a01b031681565b6104c661080e366004613a3a565b61162e565b6104c6610821366004613b0c565b6116ce565b6104c6611808565b6103d86118a9565b61039d610844366004613b76565b6001600160a01b03918216600090815260016020908152604080832093909416825291909152205490565b6104c66118b2565b6103d8611ba3565b61089261088d366004613ba0565b611bac565b60408051825165ffffffffffff1681526020928301516001600160d01b031692810192909252016103a7565b6104c66108cc36600461370b565b611bd1565b6060600380546108e090613bbc565b80601f016020809104026020016040519081016040528092919081815260200182805461090c90613bbc565b80156109595780601f1061092e57610100808354040283529160200191610959565b820191906000526020600020905b81548152906001019060200180831161093c57829003601f168201915b5050505050905090565b600033610971818585611c0c565b60019150505b92915050565b60003361098b858285611c19565b610996858585611c97565b506001949350505050565b60125460009081906109b39042613c0c565b6014549091506109c39082613c35565b91505090565b6000806109d66022611cf6565b11905090565b60006109e6611d01565b905090565b60004265ffffffffffff81168310610a2c57604051637669fc0f60e11b81526004810184905265ffffffffffff821660248201526044015b60405180910390fd5b610a40610a3884611e2c565b602090611e63565b6001600160d01b03169392505050565b60004265ffffffffffff81168310610a8c57604051637669fc0f60e11b81526004810184905265ffffffffffff82166024820152604401610a23565b610ab6610a9884611e2c565b6001600160a01b038616600090815260096020526040902090611e63565b6001600160d01b0316949350505050565b600c546001600160a01b03163314610b2d5760405162461bcd60e51b8152602060048201526024808201527f4f6e6c7920746865206d6967726174696f6e20636f6e74726163742063616e206044820152631b5a5b9d60e21b6064820152608401610a23565b610b378282611f19565b5050565b6000610b456109a1565b9050610b378282610d19565b8061ffff16600003610b6a57610b676022611cf6565b90505b60005b8161ffff16811015610b3757610b836022611cf6565b15610b3757600080610b96602282611f4f565b9092509050610ba6602283611f6d565b5060405181906001600160a01b038416907f76acee09c4cee70a742aaaf2dd1e8e6b42128e9e3f46ca4749c443ebd143903b90600090a3610be78282611f19565b50508080610bf490613c49565b915050610b6d565b6001600160a01b039081166000908152600860205260409020541690565b6001600160a01b0381163314610c725760405162461bcd60e51b815260206004820152601d60248201527f43616e206f6e6c792064656c656761746520746f20796f757273656c660000006044820152606401610a23565b610c7b81611f82565b50565b600060035b60195460ff166003811115610c9a57610c9a61385a565b14905090565b60006002610c83565b600061097782611f8d565b610cbc611faf565b610cc66000611fdc565b565b60006109778261202e565b600060608060008060006060610ce761204c565b610cef612079565b60408051600080825260208201909252600f60f81b9b939a50919850469750309650945092509050565b63ffffffff81166000908152601b602052604090206002600682015460ff166003811115610d4957610d4961385a565b14610d8f5760405162461bcd60e51b81526020600482015260166024820152754e6f7420696e2046756c66696c6c656420737461746560501b6044820152606401610a23565b63ffffffff82166000908152601c60205260409020610dad81611cf6565b600003610dc75750600601805460ff191660031790555050565b8361ffff16600003610ddf57610ddc81611cf6565b93505b60165460005b8561ffff16811015610f0657600080610e0b866004015486611f4f90919063ffffffff16565b6004880180549294509092506000610e2283613c49565b9091555060009050610e356022846120a6565b915050610e4186611cf6565b876004015403610ea9576000876003015486610e5d9190613c0c565b9050610e7684610e6d8385613c62565b602291906120be565b5080886003016000828254610e8b9190613c62565b9091555050505060068601805460ff1916600317905550610f069050565b6005870154600090610ebb8785613c75565b610ec59190613c35565b9050610ed584610e6d8385613c62565b5080886003016000828254610eea9190613c62565b9091555050505050508080610efe90613c49565b915050610de5565b505050505050565b60004265ffffffffffff81168310610f4a57604051637669fc0f60e11b81526004810184905265ffffffffffff82166024820152604401610a23565b610a40610f5684611e2c565b600a90611e63565b6017546014546012546000929190610f769042613c0c565b610f809190613c8c565b10905090565b6060600480546108e090613bbc565b6000610fa160206120dc565b6001600160d01b0316905090565b6001600160a01b0381166000908152600960205260408120610fd0906120dc565b6001600160d01b031692915050565b6012546000904210801590610ff75750610ff7610c7e565b80156110065750611006610f5e565b80156109e6575060005b611018612115565b6006015460ff166003811115610c9a57610c9a61385a565b600033610971818585611c97565b600060195460ff1660038111156110575761105761385a565b146110985760405162461bcd60e51b8152602060048201526011602482015270105b1c9958591e481c995c5d595cdd1959607a1b6044820152606401610a23565b601054600f5460ff9091169060006110b08284613c8c565b6019805460ff19166001179055905063ffffffff811660000361114a576000808052601e6020527f65ce8396b736f5da9d881cc6fbcb11ef9721292dc41ec8c40879fd9edea5744d805460ff191660011790556040517f63a60aec1cc2c0811b98fcaaa3a576ead8529a2e1f2a4a975a67645a7a4a704b908290a2604080516000808252602082019092526111459190612142565b505050565b601f5460405163e726f2e160e01b815263ffffffff831660048201526000916001600160a01b03169063e726f2e1906024016020604051808303816000875af115801561119b573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906111bf9190613ca0565b6000818152601e6020526040808220805460ff191660011790555191925082917f63a60aec1cc2c0811b98fcaaa3a576ead8529a2e1f2a4a975a67645a7a4a704b9190a250505050565b611211611faf565b6001600160a01b03811661127a5760405162461bcd60e51b815260206004820152602a60248201527f52616e646f6d6e6573732070726f766964657220616464726573732063616e6e6044820152696f74206265207a65726f60b01b6064820152608401610a23565b601f80546001600160a01b0319166001600160a01b0383169081179091556040517ffb1e10d2175872e37567b16968825f055dcb4e8747097191057e0e32c565f2e290600090a250565b6012544210156113085760405162461bcd60e51b815260206004820152600f60248201526e139bdd081cdd185c9d1959081e595d608a1b6044820152606401610a23565b600360195460ff1660038111156113215761132161385a565b1461136e5760405162461bcd60e51b815260206004820152601c60248201527f496e697469616c2041697264726f70206e6f742066696e6973686564000000006044820152606401610a23565b6000611378612115565b6006015460ff1660038111156113905761139061385a565b146113d15760405162461bcd60e51b8152602060048201526011602482015270105b1c9958591e481c995c5d595cdd1959607a1b6044820152606401610a23565b6113d9610f5e565b61141a5760405162461bcd60e51b81526020600482015260126024820152714e6f742041697264726f702057696e646f7760701b6044820152606401610a23565b60006114246109a1565b63ffffffff8082166000908152601b602052604090206018546015546002830154949550919360ff91821693929091169161146191849116613cb9565b63ffffffff16111561148b5760028201546015546114889163ffffffff169060ff16613cd6565b90505b60028201546000906114a490839063ffffffff16613cb9565b60028401805463ffffffff191663ffffffff831690811790915560155491925060ff90911690036114df5760068301805460ff191660011790555b601f5460405163e726f2e160e01b815263ffffffff841660048201526000916001600160a01b03169063e726f2e1906024016020604051808303816000875af1158015611530573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906115549190613ca0565b6000818152601e60209081526040808320805460ff19169055601d9091528120805463ffffffff191663ffffffff8916179055855491925003611595574284555b8263ffffffff168563ffffffff16827f2b9bf2127eda5d4d048efae423a08b5e75601a8813ba41169d4c745e5a0f05a960405160405180910390a45050505050565b60405162461bcd60e51b815260206004820152602660248201527f5369676e61747572652d62617365642064656c65676174696f6e2069732064696044820152651cd8589b195960d21b6064820152608401610a23565b601f546001600160a01b031633146116a25760405162461bcd60e51b815260206004820152603160248201527f4f6e6c79207468652072616e646f6d6e6573732070726f76696465722063616e6044820152702066756c66696c6c20726571756573747360781b6064820152608401610a23565b6000838152601e602052604090205460ff16156116c3576111458383612142565b611145838383612192565b834211156116f25760405163313c898160e11b815260048101859052602401610a23565b60007f6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c988888861173f8c6001600160a01b0316600090815260076020526040902080546001810190915590565b6040805160208101969096526001600160a01b0394851690860152929091166060840152608083015260a082015260c0810186905260e001604051602081830303815290604052805190602001209050600061179a826124b3565b905060006117aa828787876124e0565b9050896001600160a01b0316816001600160a01b0316146117f1576040516325c0072360e11b81526001600160a01b0380831660048301528b166024820152604401610a23565b6117fc8a8a8a611c0c565b50505050505050505050565b3361181460228261250e565b61184e5760405162461bcd60e51b815260206004820152600b60248201526a4e6f206561726e696e677360a81b6044820152606401610a23565b600061185b602283612523565b9050611868602283611f6d565b5060405181906001600160a01b038416907f76acee09c4cee70a742aaaf2dd1e8e6b42128e9e3f46ca4749c443ebd143903b90600090a3610b378282611f19565b60006002611010565b600260195460ff1660038111156118cb576118cb61385a565b146119275760405162461bcd60e51b815260206004820152602660248201527f496e697469616c2041697264726f70206e6f7420696e2046756c66696c6c656460448201526520737461746560d01b6064820152608401610a23565b6000600f60000180548060200260200160405190810160405280929190818152602001828054801561198257602002820191906000526020600020905b81546001600160a01b03168152600190910190602001808311611964575b50508351601054601154959650909460ff90911693509150600090506119a88484613c35565b905060006119b68585613c8c565b905060006119c48385613c75565b905060006019600101805480602002602001604051908101604052809291908181526020018280548015611a1757602002820191906000526020600020905b815481526020019060010190808311611a03575b505050505090506000821115611a905760005b87811015611a8e576000898281518110611a4657611a46613cf3565b602002602001015190506000611a668260226120a690919063ffffffff16565b9150611a78905082610e6d8784613c62565b5050508080611a8690613c49565b915050611a2a565b505b8215611b8c578660005b84811015611b8957600082848381518110611ab757611ab7613cf3565b6020026020010151611ac99190613c8c565b905060008b8281518110611adf57611adf613cf3565b602002602001015190506000611aff8260226120a690919063ffffffff16565b9150611b11905082610e6d8c84613c62565b5084611b1c81613d09565b955050848314611b73578c8581518110611b3857611b38613cf3565b60200260200101518d8481518110611b5257611b52613cf3565b60200260200101906001600160a01b031690816001600160a01b0316815250505b5050508080611b8190613c49565b915050611a9a565b50505b50506019805460ff19166003179055505050505050565b60006003611010565b6040805180820190915260008082526020820152611bca8383612538565b9392505050565b611bd9611faf565b6001600160a01b038116611c0357604051631e4fbdf760e01b815260006004820152602401610a23565b610c7b81611fdc565b611145838383600161256e565b6001600160a01b038381166000908152600160209081526040808320938616835292905220546000198114611c915781811015611c8257604051637dc7a0d960e11b81526001600160a01b03841660048201526024810182905260448101839052606401610a23565b611c918484848403600061256e565b50505050565b6001600160a01b038316611cc157604051634b637e8f60e11b815260006004820152602401610a23565b6001600160a01b038216611ceb5760405163ec442f0560e01b815260006004820152602401610a23565b611145838383612643565b60006109778261277b565b6000306001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016148015611d5a57507f000000000000000000000000000000000000000000000000000000000000000046145b15611d8457507f000000000000000000000000000000000000000000000000000000000000000090565b6109e6604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a082015260009060c00160405160208183030381529060405280519060200120905090565b600065ffffffffffff821115611e5f576040516306dfcc6560e41b81526030600482015260248101839052604401610a23565b5090565b815460009081816005811115611ec2576000611e7e84612786565b611e889085613c0c565b60008881526020902090915081015465ffffffffffff9081169087161015611eb257809150611ec0565b611ebd816001613c62565b92505b505b6000611ed0878785856128df565b90508015611f0b57611ef587611ee7600184613c0c565b600091825260209091200190565b54600160301b90046001600160d01b0316611f0e565b60005b979650505050505050565b6001600160a01b038216611f435760405163ec442f0560e01b815260006004820152602401610a23565b610b3760008383612643565b6000808080611f5e8686612941565b909450925050505b9250929050565b6000611bca836001600160a01b03841661296c565b33610b378183612989565b6001600160a01b03811660009081526009602052604081205461097790612a04565b600b546001600160a01b03163314610cc65760405163118cdaa760e01b8152336004820152602401610a23565b600b80546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e090600090a35050565b6001600160a01b038116600090815260076020526040812054610977565b60606109e67f00000000000000000000000000000000000000000000000000000000000000006005612a35565b60606109e67f00000000000000000000000000000000000000000000000000000000000000006006612a35565b6000808080611f5e866001600160a01b038716612ae0565b60006120d4846001600160a01b03851684612b1a565b949350505050565b8054600090801561210c576120f683611ee7600184613c0c565b54600160301b90046001600160d01b0316611bca565b60009392505050565b6000601b60006121236109a1565b63ffffffff1663ffffffff168152602001908152602001600020905090565b805161215590601a906020840190613698565b506019805460ff1916600217905560405182907fcd5df508256a8a6aec0e2f78ec823018eda8966c485f430b7540e68ed6da514690600090a25050565b600061219e600d612b37565b83516000868152601d602090815260408083205463ffffffff16808452601b909252822093945091929084900361228357828160020160048282829054906101000a900463ffffffff166121f29190613cb9565b82546101009290920a63ffffffff818102199093169183160217909155601554600284015460ff90911664010000000090910490911603905061223f5760068101805460ff191660021790555b8263ffffffff168263ffffffff16887ff16a5d9fa8df21eac52c5f3d65760ff8760b265923216898d4a8e5a8a582327260405160405180910390a450505050505050565b8415612295576001810185905561229d565b805460018201555b63ffffffff82166000908152601c60205260408120905b8463ffffffff168110156123fd5760008882815181106122d6576122d6613cf3565b60200260200101519050600087826122ee9190613c8c565b905060006122fd600d83612b41565b9050600080612310838960010154610a50565b90505b60135481101561238b576003821061232e576000925061238b565b60408051602081018790520160408051601f198184030181529190528051602090910120945061235e8b86613c8c565b935061236b600d85612b41565b9250612377838d610a50565b90508161238381613c49565b925050612313565b6001600160a01b0383166123a35750505050506123eb565b808860050160008282546123b79190613c62565b90915550600090506123c988856120a6565b91506123e39050846123db8484613c62565b8a91906120be565b505050505050505b806123f581613c49565b9150506122b4565b50838260020160048282829054906101000a900463ffffffff166124219190613cb9565b82546101009290920a63ffffffff818102199093169183160217909155601554600285015460ff90911664010000000090910490911603905061246e5760068201805460ff191660021790555b8363ffffffff168363ffffffff16897ff16a5d9fa8df21eac52c5f3d65760ff8760b265923216898d4a8e5a8a582327260405160405180910390a45050505050505050565b60006109776124c0611d01565b8360405161190160f01b8152600281019290925260228201526042902090565b6000806000806124f288888888612b4d565b9250925092506125028282612c1c565b50909695505050505050565b6000611bca836001600160a01b038416612cd5565b6000611bca836001600160a01b038416612ce1565b60408051808201909152600080825260208201526001600160a01b0383166000908152600960205260409020611bca9083612d28565b6001600160a01b0384166125985760405163e602df0560e01b815260006004820152602401610a23565b6001600160a01b0383166125c257604051634a1406b160e11b815260006004820152602401610a23565b6001600160a01b0380851660009081526001602090815260408083209387168352929052208290558015611c9157826001600160a01b0316846001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9258460405161263591815260200190565b60405180910390a350505050565b61264e838383612d98565b6001600160a01b0383161561268c576001600160a01b0383166000908152602081905260409020546126808482612dff565b61268a8482612e3d565b505b6001600160a01b038216156126ca576001600160a01b0382166000908152602081905260409020546126be8382612dff565b6126c88382612e3d565b505b6001600160a01b038216158015906126f3575060006126e883610bfc565b6001600160a01b0316145b15612702576127028283612989565b601f546040516311c07af760e01b81526001600160a01b038581166004830152848116602483015260448201849052306064830152909116906311c07af790608401600060405180830381600087803b15801561275e57600080fd5b505af1158015612772573d6000803e3d6000fd5b50505050505050565b600061097782612b37565b600060018211612794575090565b816001600160801b82106127ad5760809190911c9060401b5b6801000000000000000082106127c85760409190911c9060201b5b64010000000082106127df5760209190911c9060101b5b6201000082106127f45760109190911c9060081b5b61010082106128085760089190911c9060041b5b6010821061281b5760049190911c9060021b5b600482106128275760011b5b600302600190811c9081858161283f5761283f613c1f565b048201901c9050600181858161285757612857613c1f565b048201901c9050600181858161286f5761286f613c1f565b048201901c9050600181858161288757612887613c1f565b048201901c9050600181858161289f5761289f613c1f565b048201901c905060018185816128b7576128b7613c1f565b048201901c90506128d68185816128d0576128d0613c1f565b04821190565b90039392505050565b60005b818310156129395760006128f68484612f34565b60008781526020902090915065ffffffffffff86169082015465ffffffffffff16111561292557809250612933565b612930816001613c62565b93505b506128e2565b509392505050565b6000808061294f8585612b41565b600081815260029690960160205260409095205494959350505050565b60008181526002830160205260408120819055611bca8383612f4f565b600061299483610bfc565b6001600160a01b0384811660008181526008602052604080822080546001600160a01b031916888616908117909155905194955093928516927f3134e8a2e6d97e929a7e54011ea5485d7d196dd5f0ba4d4ef95803e8e3fc257f9190a461114581836129ff86612f5b565b612f79565b600063ffffffff821115611e5f576040516306dfcc6560e41b81526020600482015260248101839052604401610a23565b606060ff8314612a4f57612a48836130e5565b9050610977565b818054612a5b90613bbc565b80601f0160208091040260200160405190810160405280929190818152602001828054612a8790613bbc565b8015612ad45780601f10612aa957610100808354040283529160200191612ad4565b820191906000526020600020905b815481529060010190602001808311612ab757829003601f168201915b50505050509050610977565b6000818152600283016020526040812054819080612b0f57612b028585612cd5565b925060009150611f669050565b600192509050611f66565b600082815260028401602052604081208290556120d48484613124565b6000610977825490565b6000611bca8383613130565b600080807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a0841115612b885750600091506003905082612c12565b604080516000808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015612bdc573d6000803e3d6000fd5b5050604051601f1901519150506001600160a01b038116612c0857506000925060019150829050612c12565b9250600091508190505b9450945094915050565b6000826003811115612c3057612c3061385a565b03612c39575050565b6001826003811115612c4d57612c4d61385a565b03612c6b5760405163f645eedf60e01b815260040160405180910390fd5b6002826003811115612c7f57612c7f61385a565b03612ca05760405163fce698f760e01b815260048101829052602401610a23565b6003826003811115612cb457612cb461385a565b03610b37576040516335e2f38360e21b815260048101829052602401610a23565b6000611bca838361315a565b600081815260028301602052604081205480158015612d075750612d058484612cd5565b155b15611bca5760405163015ab34360e11b815260048101849052602401610a23565b6040805180820190915260008082526020820152826000018263ffffffff1681548110612d5757612d57613cf3565b60009182526020918290206040805180820190915291015465ffffffffffff81168252600160301b90046001600160d01b0316918101919091529392505050565b612da3838383613172565b6001600160a01b038316612df4576000612dbc60025490565b90506001600160d01b0380821115612df157604051630e58ae9360e11b81526004810183905260248101829052604401610a23565b50505b61114583838361329c565b6013548110612e2257612e13600d836132fb565b610b3757611145600d8361331d565b612e2d600d836132fb565b15610b3757611145600d83613332565b6001600160a01b0382166000908152602160205260409020547f000000000000000000000000000000000000000000000000000000000000000080821015908310612efe5780612eb657612eaf42612ea685612e97610f95565b612ea19190613c62565b613347565b6020919061337b565b5050612ede565b612edb42612ea68486612ec7610f95565b612ed19190613c62565b612ea19190613c0c565b50505b6001600160a01b0384166000908152602160205260409020839055611c91565b8015612f1757612f1442612ea684612ed1610f95565b50505b5050506001600160a01b0316600090815260216020526040812055565b6000612f436002848418613c35565b611bca90848416613c62565b6000611bca8383613396565b6001600160a01b038116600090815260208190526040812054610977565b816001600160a01b0316836001600160a01b031614158015612f9b5750600081115b15611145576001600160a01b03831615613043576001600160a01b03831660009081526009602052604081208190612fde90613490612fd986613347565b61349c565b6001600160d01b031691506001600160d01b03169150846001600160a01b03167fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a7248383604051613038929190918252602082015260400190565b60405180910390a250505b6001600160a01b03821615611145576001600160a01b0382166000908152600960205260408120819061307c906134c1612fd986613347565b6001600160d01b031691506001600160d01b03169150836001600160a01b03167fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a72483836040516130d6929190918252602082015260400190565b60405180910390a25050505050565b606060006130f2836134cd565b604080516020808252818301909252919250600091906020820181803683375050509182525060208101929092525090565b6000611bca83836134f5565b600082600001828154811061314757613147613cf3565b9060005260206000200154905092915050565b60008181526001830160205260408120541515611bca565b6001600160a01b03831661319d5780600260008282546131929190613c62565b9091555061320f9050565b6001600160a01b038316600090815260208190526040902054818110156131f05760405163391434e360e21b81526001600160a01b03851660048201526024810182905260448101839052606401610a23565b6001600160a01b03841660009081526020819052604090209082900390555b6001600160a01b03821661322b5760028054829003905561324a565b6001600160a01b03821660009081526020819052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8360405161328f91815260200190565b60405180910390a3505050565b6001600160a01b0383166132be576132bb600a6134c1612fd984613347565b50505b6001600160a01b0382166132e0576132dd600a613490612fd984613347565b50505b6111456132ec84610bfc565b6132f584610bfc565b83612f79565b6001600160a01b03811660009081526001830160205260408120541515611bca565b6000611bca836001600160a01b0384166134f5565b6000611bca836001600160a01b038416613396565b60006001600160d01b03821115611e5f576040516306dfcc6560e41b815260d0600482015260248101839052604401610a23565b600080613389858585613544565b915091505b935093915050565b6000818152600183016020526040812054801561347f5760006133ba600183613c0c565b85549091506000906133ce90600190613c0c565b90508082146134335760008660000182815481106133ee576133ee613cf3565b906000526020600020015490508087600001848154811061341157613411613cf3565b6000918252602080832090910192909255918252600188019052604090208390555b855486908061344457613444613d20565b600190038181906000526020600020016000905590558560010160008681526020019081526020016000206000905560019350505050610977565b6000915050610977565b5092915050565b6000611bca8284613d36565b600080613389426134b96134af886120dc565b868863ffffffff16565b87919061337b565b6000611bca8284613d56565b600060ff8216601f81111561097757604051632cd44ac360e21b815260040160405180910390fd5b600081815260018301602052604081205461353c57508154600181810184556000848152602080822090930184905584548482528286019093526040902091909155610977565b506000610977565b82546000908190801561363d57600061356287611ee7600185613c0c565b805490915065ffffffffffff80821691600160301b90046001600160d01b03169088168211156135a557604051632520601d60e01b815260040160405180910390fd5b8765ffffffffffff168265ffffffffffff16036135de57825465ffffffffffff16600160301b6001600160d01b0389160217835561362f565b6040805180820190915265ffffffffffff808a1682526001600160d01b03808a1660208085019182528d54600181018f5560008f81529190912094519151909216600160301b029216919091179101555b945085935061338e92505050565b50506040805180820190915265ffffffffffff80851682526001600160d01b0380851660208085019182528854600181018a5560008a815291822095519251909316600160301b02919093161792019190915590508161338e565b8280548282559060005260206000209081019282156136d3579160200282015b828111156136d35782518255916020019190600101906136b8565b50611e5f9291505b80821115611e5f57600081556001016136db565b80356001600160a01b038116811461370657600080fd5b919050565b60006020828403121561371d57600080fd5b611bca826136ef565b6000815180845260005b8181101561374c57602081850181015186830182015201613730565b506000602082860101526020601f19601f83011685010191505092915050565b602081526000611bca6020830184613726565b6000806040838503121561379257600080fd5b61379b836136ef565b946020939093013593505050565b6000806000606084860312156137be57600080fd5b6137c7846136ef565b92506137d5602085016136ef565b9150604084013590509250925092565b6000602082840312156137f757600080fd5b5035919050565b803561ffff8116811461370657600080fd5b60006020828403121561382257600080fd5b611bca826137fe565b803563ffffffff8116811461370657600080fd5b60006020828403121561385157600080fd5b611bca8261382b565b634e487b7160e01b600052602160045260246000fd5b6004811061388e57634e487b7160e01b600052602160045260246000fd5b9052565b8881526020810188905263ffffffff8781166040830152861660608201526080810185905260a0810184905260c0810183905261010081016138d760e0830184613870565b9998505050505050505050565b602081016109778284613870565b60ff60f81b881681526000602060e08184015261391260e084018a613726565b8381036040850152613924818a613726565b606085018990526001600160a01b038816608086015260a0850187905284810360c0860152855180825283870192509083019060005b818110156139765783518352928401929184019160010161395a565b50909c9b505050505050505050505050565b6000806040838503121561399b57600080fd5b6139a4836137fe565b91506139b26020840161382b565b90509250929050565b803560ff8116811461370657600080fd5b60008060008060008060c087890312156139e557600080fd5b6139ee876136ef565b95506020870135945060408701359350613a0a606088016139bb565b92506080870135915060a087013590509295509295509295565b634e487b7160e01b600052604160045260246000fd5b600080600060608486031215613a4f57600080fd5b8335925060208085013567ffffffffffffffff80821115613a6f57600080fd5b818701915087601f830112613a8357600080fd5b813581811115613a9557613a95613a24565b8060051b604051601f19603f83011681018181108582111715613aba57613aba613a24565b60405291825284820192508381018501918a831115613ad857600080fd5b938501935b82851015613af657843584529385019392850192613add565b979a979950505050604095909501359450505050565b600080600080600080600060e0888a031215613b2757600080fd5b613b30886136ef565b9650613b3e602089016136ef565b95506040880135945060608801359350613b5a608089016139bb565b925060a0880135915060c0880135905092959891949750929550565b60008060408385031215613b8957600080fd5b613b92836136ef565b91506139b2602084016136ef565b60008060408385031215613bb357600080fd5b6139a4836136ef565b600181811c90821680613bd057607f821691505b602082108103613bf057634e487b7160e01b600052602260045260246000fd5b50919050565b634e487b7160e01b600052601160045260246000fd5b8181038181111561097757610977613bf6565b634e487b7160e01b600052601260045260246000fd5b600082613c4457613c44613c1f565b500490565b600060018201613c5b57613c5b613bf6565b5060010190565b8082018082111561097757610977613bf6565b808202811582820484141761097757610977613bf6565b600082613c9b57613c9b613c1f565b500690565b600060208284031215613cb257600080fd5b5051919050565b63ffffffff81811683821601908082111561348957613489613bf6565b63ffffffff82811682821603908082111561348957613489613bf6565b634e487b7160e01b600052603260045260246000fd5b600081613d1857613d18613bf6565b506000190190565b634e487b7160e01b600052603160045260246000fd5b6001600160d01b0382811682821603908082111561348957613489613bf6565b6001600160d01b0381811683821601908082111561348957613489613bf656fea26469706673582212209ec52245637df58d1f15fcfb224c9147073e03a85f4c0f6558028f301d96c3ff64736f6c63430008140033000000000000000000000000000000000000000000000000000000000000018000000000000000000000000000000000000000000000000000000000000001c000000000000000000000000000000000000000000000000000000000000002000000000000000000000000000000000000000000000000000000000067cd12400000000000000000000000000000000000000000000000056bc75e2d631000000000000000000000000000000000000000000000000000000000000000093a80000000000000000000000000000000000000000000000000000000000000006400000000000000000000000000000000000000000000021e19e0c9bab2400000000000000000000000000000000000000000000000000000000000000002a300000000000000000000000000000000000000000000000000000000000000000a00000000000000000000000000000000000000000000152d02c7e14af680000000000000000000000000000073cfcbc576ed24f4e383a9d83ccf8155ff7f8f7100000000000000000000000000000000000000000000000000000000000000034f6e65000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000034f4e4500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000060000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d3c21bcecceda10000000000000000000000000000000000000000000000000000000000000000000011000000000000000000000000f0def4ea31206e16f8c4068d8151286c7c408ee20000000000000000000000000137be282dbc517183d5c78f98323ac412a4a08f0000000000000000000000002927b21118900c6122375f9de209344cbff03824000000000000000000000000ff938aa1e4b57680691af61a9e9a8631c80e0d27000000000000000000000000aa25a2c9cad9f66aede9920e629b679a4a3f32ab0000000000000000000000002fba151c3faf8f6e9496cd8967c0b372ccd5c11200000000000000000000000003590026cc8974aa833f3a01307c99e1a4fa1da5000000000000000000000000b4d82fd709a11c793cb8aee9a3b47b83efce92ec000000000000000000000000dadb28fb1ce2f960a7223ea76f06f0b49945142300000000000000000000000004c7baff653ae6297cd57abebaf1e46e5fbdb32b0000000000000000000000003b646ef054c3dfd0e306e9118efb204150d22de9000000000000000000000000ec77cb7840bac0f1fa67e486da8b497430744ef6000000000000000000000000db9c2e68b132affe6a3ab3f9f45e79adede22b740000000000000000000000008ea4a2236d9e9d7761ccca77739a114de9d5a09500000000000000000000000089c0c6ca333546cdcd20431b061b084413a371aa000000000000000000000000b369b114d424acef6060721c38dfdd767da4505b00000000000000000000000009e5daed6e4a6cd54fe2f64a5e8892da4efb1754

0x608060405234801561001057600080fd5b50600436106103785760003560e01c80637ecebe00116101d3578063bc705aa211610104578063d9ceab13116100a2578063dde47d971161007c578063dde47d971461086f578063eadf016d14610877578063f1127ed81461087f578063f2fde38b146108be57600080fd5b8063d9ceab1314610826578063dbda93a91461082e578063dd62ed3e1461083657600080fd5b8063c87b4b55116100de578063c87b4b55146107c7578063ce9bf5ac146107ed578063ceb4a76a14610800578063d505accf1461081357600080fd5b8063bc705aa214610749578063bee54460146107ac578063c3cda520146107b457600080fd5b806395d89b4111610171578063a34b0ede1161014b578063a34b0ede14610713578063a9059cbb1461071b578063aed89f351461072e578063b15fbc141461073657600080fd5b806395d89b41146106f05780639a0e7d66146106f85780639ab24eb01461070057600080fd5b80638da5cb5b116101ad5780638da5cb5b146106ae5780638e539e8c146106bf57806391ddadf4146106d2578063932c2a3f146106e857600080fd5b80637ecebe001461066d57806384b0196e146106805780638969547c1461069b57600080fd5b806342449df6116102ad5780636477bf471161024b5780636fcfff45116102255780636fcfff451461060f57806370a0823114610622578063715018a61461064b578063747036c81461065357600080fd5b80636477bf471461057057806366e37eae146105e057806369ca60d61461060757600080fd5b80634d723945116102875780634d72394514610518578063587cde1e146105425780635c19a95c146105555780636251812b1461056857600080fd5b806342449df6146104c85780634bf5d7e9146104db5780634c932c981461050557600080fd5b80632ab093801161031a5780633688c030116102f45780633688c0301461046a5780633992609e1461048d5780633a46b1a8146104a057806340c10f19146104b357600080fd5b80632ab093801461044b578063313ce567146104535780633644e5151461046257600080fd5b80630fee1a20116103565780630fee1a20146103e857806318160ddd1461041357806323b872dd1461041b578063255f71731461042e57600080fd5b806301d215bf1461037d57806306fdde03146103b0578063095ea7b3146103c5575b600080fd5b61039d61038b36600461370b565b60216020526000908152604090205481565b6040519081526020015b60405180910390f35b6103b86108d1565b6040516103a7919061376c565b6103d86103d336600461377f565b610963565b60405190151581526020016103a7565b600c546103fb906001600160a01b031681565b6040516001600160a01b0390911681526020016103a7565b60025461039d565b6103d86104293660046137a9565b61097d565b6104366109a1565b60405163ffffffff90911681526020016103a7565b6103d86109c9565b604051601281526020016103a7565b61039d6109dc565b6103d86104783660046137e5565b601e6020526000908152604090205460ff1681565b61039d61049b3660046137e5565b6109eb565b61039d6104ae36600461377f565b610a50565b6104c66104c136600461377f565b610ac7565b005b6104c66104d6366004613810565b610b3b565b60408051808201909152600e81526d06d6f64653d74696d657374616d760941b60208201526103b8565b6104c6610513366004613810565b610b51565b6010546011546105299160ff169082565b6040805160ff90931683526020830191909152016103a7565b6103fb61055036600461370b565b610bfc565b6104c661056336600461370b565b610c1a565b6103d8610c7e565b6105cc61057e36600461383f565b601b6020526000908152604090208054600182015460028301546003840154600485015460058601546006909601549495939463ffffffff8085169564010000000090950416939060ff1688565b6040516103a7989796959493929190613892565b61039d7f00000000000000000000000000000000000000000000152d02c7e14af680000081565b6103d8610ca0565b61043661061d36600461370b565b610ca9565b61039d61063036600461370b565b6001600160a01b031660009081526020819052604090205490565b6104c6610cb4565b6019546106609060ff1681565b6040516103a791906138e4565b61039d61067b36600461370b565b610cc8565b610688610cd3565b6040516103a797969594939291906138f2565b6104c66106a9366004613988565b610d19565b600b546001600160a01b03166103fb565b61039d6106cd3660046137e5565b610f0e565b60405165ffffffffffff421681526020016103a7565b6103d8610f5e565b6103b8610f86565b61039d610f95565b61039d61070e36600461370b565b610faf565b6103d8610fdf565b6103d861072936600461377f565b611030565b6104c661103e565b6104c661074436600461370b565b611209565b6012546013546014546015546016546017546018546107719695949360ff9081169392911687565b6040805197885260208801969096529486019390935260ff9182166060860152608085015260a08401919091521660c082015260e0016103a7565b6104c66112c4565b6104c66107c23660046139cc565b6115d7565b6104366107d53660046137e5565b601d6020526000908152604090205463ffffffff1681565b601f546103fb906001600160a01b031681565b6104c661080e366004613a3a565b61162e565b6104c6610821366004613b0c565b6116ce565b6104c6611808565b6103d86118a9565b61039d610844366004613b76565b6001600160a01b03918216600090815260016020908152604080832093909416825291909152205490565b6104c66118b2565b6103d8611ba3565b61089261088d366004613ba0565b611bac565b60408051825165ffffffffffff1681526020928301516001600160d01b031692810192909252016103a7565b6104c66108cc36600461370b565b611bd1565b6060600380546108e090613bbc565b80601f016020809104026020016040519081016040528092919081815260200182805461090c90613bbc565b80156109595780601f1061092e57610100808354040283529160200191610959565b820191906000526020600020905b81548152906001019060200180831161093c57829003601f168201915b5050505050905090565b600033610971818585611c0c565b60019150505b92915050565b60003361098b858285611c19565b610996858585611c97565b506001949350505050565b60125460009081906109b39042613c0c565b6014549091506109c39082613c35565b91505090565b6000806109d66022611cf6565b11905090565b60006109e6611d01565b905090565b60004265ffffffffffff81168310610a2c57604051637669fc0f60e11b81526004810184905265ffffffffffff821660248201526044015b60405180910390fd5b610a40610a3884611e2c565b602090611e63565b6001600160d01b03169392505050565b60004265ffffffffffff81168310610a8c57604051637669fc0f60e11b81526004810184905265ffffffffffff82166024820152604401610a23565b610ab6610a9884611e2c565b6001600160a01b038616600090815260096020526040902090611e63565b6001600160d01b0316949350505050565b600c546001600160a01b03163314610b2d5760405162461bcd60e51b8152602060048201526024808201527f4f6e6c7920746865206d6967726174696f6e20636f6e74726163742063616e206044820152631b5a5b9d60e21b6064820152608401610a23565b610b378282611f19565b5050565b6000610b456109a1565b9050610b378282610d19565b8061ffff16600003610b6a57610b676022611cf6565b90505b60005b8161ffff16811015610b3757610b836022611cf6565b15610b3757600080610b96602282611f4f565b9092509050610ba6602283611f6d565b5060405181906001600160a01b038416907f76acee09c4cee70a742aaaf2dd1e8e6b42128e9e3f46ca4749c443ebd143903b90600090a3610be78282611f19565b50508080610bf490613c49565b915050610b6d565b6001600160a01b039081166000908152600860205260409020541690565b6001600160a01b0381163314610c725760405162461bcd60e51b815260206004820152601d60248201527f43616e206f6e6c792064656c656761746520746f20796f757273656c660000006044820152606401610a23565b610c7b81611f82565b50565b600060035b60195460ff166003811115610c9a57610c9a61385a565b14905090565b60006002610c83565b600061097782611f8d565b610cbc611faf565b610cc66000611fdc565b565b60006109778261202e565b600060608060008060006060610ce761204c565b610cef612079565b60408051600080825260208201909252600f60f81b9b939a50919850469750309650945092509050565b63ffffffff81166000908152601b602052604090206002600682015460ff166003811115610d4957610d4961385a565b14610d8f5760405162461bcd60e51b81526020600482015260166024820152754e6f7420696e2046756c66696c6c656420737461746560501b6044820152606401610a23565b63ffffffff82166000908152601c60205260409020610dad81611cf6565b600003610dc75750600601805460ff191660031790555050565b8361ffff16600003610ddf57610ddc81611cf6565b93505b60165460005b8561ffff16811015610f0657600080610e0b866004015486611f4f90919063ffffffff16565b6004880180549294509092506000610e2283613c49565b9091555060009050610e356022846120a6565b915050610e4186611cf6565b876004015403610ea9576000876003015486610e5d9190613c0c565b9050610e7684610e6d8385613c62565b602291906120be565b5080886003016000828254610e8b9190613c62565b9091555050505060068601805460ff1916600317905550610f069050565b6005870154600090610ebb8785613c75565b610ec59190613c35565b9050610ed584610e6d8385613c62565b5080886003016000828254610eea9190613c62565b9091555050505050508080610efe90613c49565b915050610de5565b505050505050565b60004265ffffffffffff81168310610f4a57604051637669fc0f60e11b81526004810184905265ffffffffffff82166024820152604401610a23565b610a40610f5684611e2c565b600a90611e63565b6017546014546012546000929190610f769042613c0c565b610f809190613c8c565b10905090565b6060600480546108e090613bbc565b6000610fa160206120dc565b6001600160d01b0316905090565b6001600160a01b0381166000908152600960205260408120610fd0906120dc565b6001600160d01b031692915050565b6012546000904210801590610ff75750610ff7610c7e565b80156110065750611006610f5e565b80156109e6575060005b611018612115565b6006015460ff166003811115610c9a57610c9a61385a565b600033610971818585611c97565b600060195460ff1660038111156110575761105761385a565b146110985760405162461bcd60e51b8152602060048201526011602482015270105b1c9958591e481c995c5d595cdd1959607a1b6044820152606401610a23565b601054600f5460ff9091169060006110b08284613c8c565b6019805460ff19166001179055905063ffffffff811660000361114a576000808052601e6020527f65ce8396b736f5da9d881cc6fbcb11ef9721292dc41ec8c40879fd9edea5744d805460ff191660011790556040517f63a60aec1cc2c0811b98fcaaa3a576ead8529a2e1f2a4a975a67645a7a4a704b908290a2604080516000808252602082019092526111459190612142565b505050565b601f5460405163e726f2e160e01b815263ffffffff831660048201526000916001600160a01b03169063e726f2e1906024016020604051808303816000875af115801561119b573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906111bf9190613ca0565b6000818152601e6020526040808220805460ff191660011790555191925082917f63a60aec1cc2c0811b98fcaaa3a576ead8529a2e1f2a4a975a67645a7a4a704b9190a250505050565b611211611faf565b6001600160a01b03811661127a5760405162461bcd60e51b815260206004820152602a60248201527f52616e646f6d6e6573732070726f766964657220616464726573732063616e6e6044820152696f74206265207a65726f60b01b6064820152608401610a23565b601f80546001600160a01b0319166001600160a01b0383169081179091556040517ffb1e10d2175872e37567b16968825f055dcb4e8747097191057e0e32c565f2e290600090a250565b6012544210156113085760405162461bcd60e51b815260206004820152600f60248201526e139bdd081cdd185c9d1959081e595d608a1b6044820152606401610a23565b600360195460ff1660038111156113215761132161385a565b1461136e5760405162461bcd60e51b815260206004820152601c60248201527f496e697469616c2041697264726f70206e6f742066696e6973686564000000006044820152606401610a23565b6000611378612115565b6006015460ff1660038111156113905761139061385a565b146113d15760405162461bcd60e51b8152602060048201526011602482015270105b1c9958591e481c995c5d595cdd1959607a1b6044820152606401610a23565b6113d9610f5e565b61141a5760405162461bcd60e51b81526020600482015260126024820152714e6f742041697264726f702057696e646f7760701b6044820152606401610a23565b60006114246109a1565b63ffffffff8082166000908152601b602052604090206018546015546002830154949550919360ff91821693929091169161146191849116613cb9565b63ffffffff16111561148b5760028201546015546114889163ffffffff169060ff16613cd6565b90505b60028201546000906114a490839063ffffffff16613cb9565b60028401805463ffffffff191663ffffffff831690811790915560155491925060ff90911690036114df5760068301805460ff191660011790555b601f5460405163e726f2e160e01b815263ffffffff841660048201526000916001600160a01b03169063e726f2e1906024016020604051808303816000875af1158015611530573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906115549190613ca0565b6000818152601e60209081526040808320805460ff19169055601d9091528120805463ffffffff191663ffffffff8916179055855491925003611595574284555b8263ffffffff168563ffffffff16827f2b9bf2127eda5d4d048efae423a08b5e75601a8813ba41169d4c745e5a0f05a960405160405180910390a45050505050565b60405162461bcd60e51b815260206004820152602660248201527f5369676e61747572652d62617365642064656c65676174696f6e2069732064696044820152651cd8589b195960d21b6064820152608401610a23565b601f546001600160a01b031633146116a25760405162461bcd60e51b815260206004820152603160248201527f4f6e6c79207468652072616e646f6d6e6573732070726f76696465722063616e6044820152702066756c66696c6c20726571756573747360781b6064820152608401610a23565b6000838152601e602052604090205460ff16156116c3576111458383612142565b611145838383612192565b834211156116f25760405163313c898160e11b815260048101859052602401610a23565b60007f6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c988888861173f8c6001600160a01b0316600090815260076020526040902080546001810190915590565b6040805160208101969096526001600160a01b0394851690860152929091166060840152608083015260a082015260c0810186905260e001604051602081830303815290604052805190602001209050600061179a826124b3565b905060006117aa828787876124e0565b9050896001600160a01b0316816001600160a01b0316146117f1576040516325c0072360e11b81526001600160a01b0380831660048301528b166024820152604401610a23565b6117fc8a8a8a611c0c565b50505050505050505050565b3361181460228261250e565b61184e5760405162461bcd60e51b815260206004820152600b60248201526a4e6f206561726e696e677360a81b6044820152606401610a23565b600061185b602283612523565b9050611868602283611f6d565b5060405181906001600160a01b038416907f76acee09c4cee70a742aaaf2dd1e8e6b42128e9e3f46ca4749c443ebd143903b90600090a3610b378282611f19565b60006002611010565b600260195460ff1660038111156118cb576118cb61385a565b146119275760405162461bcd60e51b815260206004820152602660248201527f496e697469616c2041697264726f70206e6f7420696e2046756c66696c6c656460448201526520737461746560d01b6064820152608401610a23565b6000600f60000180548060200260200160405190810160405280929190818152602001828054801561198257602002820191906000526020600020905b81546001600160a01b03168152600190910190602001808311611964575b50508351601054601154959650909460ff90911693509150600090506119a88484613c35565b905060006119b68585613c8c565b905060006119c48385613c75565b905060006019600101805480602002602001604051908101604052809291908181526020018280548015611a1757602002820191906000526020600020905b815481526020019060010190808311611a03575b505050505090506000821115611a905760005b87811015611a8e576000898281518110611a4657611a46613cf3565b602002602001015190506000611a668260226120a690919063ffffffff16565b9150611a78905082610e6d8784613c62565b5050508080611a8690613c49565b915050611a2a565b505b8215611b8c578660005b84811015611b8957600082848381518110611ab757611ab7613cf3565b6020026020010151611ac99190613c8c565b905060008b8281518110611adf57611adf613cf3565b602002602001015190506000611aff8260226120a690919063ffffffff16565b9150611b11905082610e6d8c84613c62565b5084611b1c81613d09565b955050848314611b73578c8581518110611b3857611b38613cf3565b60200260200101518d8481518110611b5257611b52613cf3565b60200260200101906001600160a01b031690816001600160a01b0316815250505b5050508080611b8190613c49565b915050611a9a565b50505b50506019805460ff19166003179055505050505050565b60006003611010565b6040805180820190915260008082526020820152611bca8383612538565b9392505050565b611bd9611faf565b6001600160a01b038116611c0357604051631e4fbdf760e01b815260006004820152602401610a23565b610c7b81611fdc565b611145838383600161256e565b6001600160a01b038381166000908152600160209081526040808320938616835292905220546000198114611c915781811015611c8257604051637dc7a0d960e11b81526001600160a01b03841660048201526024810182905260448101839052606401610a23565b611c918484848403600061256e565b50505050565b6001600160a01b038316611cc157604051634b637e8f60e11b815260006004820152602401610a23565b6001600160a01b038216611ceb5760405163ec442f0560e01b815260006004820152602401610a23565b611145838383612643565b60006109778261277b565b6000306001600160a01b037f00000000000000000000000091c65c2a9a3adfe2424ecc4a4890b8334c3a821216148015611d5a57507f000000000000000000000000000000000000000000000000000000000000000146145b15611d8457507f64da775f48e087bf0de3d658565434c5208c28b71f811c88d96c61ba429f050090565b6109e6604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f872e508af28b75433e402d45bfb8739bacffeb9443d5e4e60a567e45b20ce0b9918101919091527fc89efdaa54c0f20c7adf612882df0950f5a951637e0307cdcb4c672f298b8bc660608201524660808201523060a082015260009060c00160405160208183030381529060405280519060200120905090565b600065ffffffffffff821115611e5f576040516306dfcc6560e41b81526030600482015260248101839052604401610a23565b5090565b815460009081816005811115611ec2576000611e7e84612786565b611e889085613c0c565b60008881526020902090915081015465ffffffffffff9081169087161015611eb257809150611ec0565b611ebd816001613c62565b92505b505b6000611ed0878785856128df565b90508015611f0b57611ef587611ee7600184613c0c565b600091825260209091200190565b54600160301b90046001600160d01b0316611f0e565b60005b979650505050505050565b6001600160a01b038216611f435760405163ec442f0560e01b815260006004820152602401610a23565b610b3760008383612643565b6000808080611f5e8686612941565b909450925050505b9250929050565b6000611bca836001600160a01b03841661296c565b33610b378183612989565b6001600160a01b03811660009081526009602052604081205461097790612a04565b600b546001600160a01b03163314610cc65760405163118cdaa760e01b8152336004820152602401610a23565b600b80546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e090600090a35050565b6001600160a01b038116600090815260076020526040812054610977565b60606109e67f4f6e6500000000000000000000000000000000000000000000000000000000036005612a35565b60606109e67f31000000000000000000000000000000000000000000000000000000000000016006612a35565b6000808080611f5e866001600160a01b038716612ae0565b60006120d4846001600160a01b03851684612b1a565b949350505050565b8054600090801561210c576120f683611ee7600184613c0c565b54600160301b90046001600160d01b0316611bca565b60009392505050565b6000601b60006121236109a1565b63ffffffff1663ffffffff168152602001908152602001600020905090565b805161215590601a906020840190613698565b506019805460ff1916600217905560405182907fcd5df508256a8a6aec0e2f78ec823018eda8966c485f430b7540e68ed6da514690600090a25050565b600061219e600d612b37565b83516000868152601d602090815260408083205463ffffffff16808452601b909252822093945091929084900361228357828160020160048282829054906101000a900463ffffffff166121f29190613cb9565b82546101009290920a63ffffffff818102199093169183160217909155601554600284015460ff90911664010000000090910490911603905061223f5760068101805460ff191660021790555b8263ffffffff168263ffffffff16887ff16a5d9fa8df21eac52c5f3d65760ff8760b265923216898d4a8e5a8a582327260405160405180910390a450505050505050565b8415612295576001810185905561229d565b805460018201555b63ffffffff82166000908152601c60205260408120905b8463ffffffff168110156123fd5760008882815181106122d6576122d6613cf3565b60200260200101519050600087826122ee9190613c8c565b905060006122fd600d83612b41565b9050600080612310838960010154610a50565b90505b60135481101561238b576003821061232e576000925061238b565b60408051602081018790520160408051601f198184030181529190528051602090910120945061235e8b86613c8c565b935061236b600d85612b41565b9250612377838d610a50565b90508161238381613c49565b925050612313565b6001600160a01b0383166123a35750505050506123eb565b808860050160008282546123b79190613c62565b90915550600090506123c988856120a6565b91506123e39050846123db8484613c62565b8a91906120be565b505050505050505b806123f581613c49565b9150506122b4565b50838260020160048282829054906101000a900463ffffffff166124219190613cb9565b82546101009290920a63ffffffff818102199093169183160217909155601554600285015460ff90911664010000000090910490911603905061246e5760068201805460ff191660021790555b8363ffffffff168363ffffffff16897ff16a5d9fa8df21eac52c5f3d65760ff8760b265923216898d4a8e5a8a582327260405160405180910390a45050505050505050565b60006109776124c0611d01565b8360405161190160f01b8152600281019290925260228201526042902090565b6000806000806124f288888888612b4d565b9250925092506125028282612c1c565b50909695505050505050565b6000611bca836001600160a01b038416612cd5565b6000611bca836001600160a01b038416612ce1565b60408051808201909152600080825260208201526001600160a01b0383166000908152600960205260409020611bca9083612d28565b6001600160a01b0384166125985760405163e602df0560e01b815260006004820152602401610a23565b6001600160a01b0383166125c257604051634a1406b160e11b815260006004820152602401610a23565b6001600160a01b0380851660009081526001602090815260408083209387168352929052208290558015611c9157826001600160a01b0316846001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9258460405161263591815260200190565b60405180910390a350505050565b61264e838383612d98565b6001600160a01b0383161561268c576001600160a01b0383166000908152602081905260409020546126808482612dff565b61268a8482612e3d565b505b6001600160a01b038216156126ca576001600160a01b0382166000908152602081905260409020546126be8382612dff565b6126c88382612e3d565b505b6001600160a01b038216158015906126f3575060006126e883610bfc565b6001600160a01b0316145b15612702576127028283612989565b601f546040516311c07af760e01b81526001600160a01b038581166004830152848116602483015260448201849052306064830152909116906311c07af790608401600060405180830381600087803b15801561275e57600080fd5b505af1158015612772573d6000803e3d6000fd5b50505050505050565b600061097782612b37565b600060018211612794575090565b816001600160801b82106127ad5760809190911c9060401b5b6801000000000000000082106127c85760409190911c9060201b5b64010000000082106127df5760209190911c9060101b5b6201000082106127f45760109190911c9060081b5b61010082106128085760089190911c9060041b5b6010821061281b5760049190911c9060021b5b600482106128275760011b5b600302600190811c9081858161283f5761283f613c1f565b048201901c9050600181858161285757612857613c1f565b048201901c9050600181858161286f5761286f613c1f565b048201901c9050600181858161288757612887613c1f565b048201901c9050600181858161289f5761289f613c1f565b048201901c905060018185816128b7576128b7613c1f565b048201901c90506128d68185816128d0576128d0613c1f565b04821190565b90039392505050565b60005b818310156129395760006128f68484612f34565b60008781526020902090915065ffffffffffff86169082015465ffffffffffff16111561292557809250612933565b612930816001613c62565b93505b506128e2565b509392505050565b6000808061294f8585612b41565b600081815260029690960160205260409095205494959350505050565b60008181526002830160205260408120819055611bca8383612f4f565b600061299483610bfc565b6001600160a01b0384811660008181526008602052604080822080546001600160a01b031916888616908117909155905194955093928516927f3134e8a2e6d97e929a7e54011ea5485d7d196dd5f0ba4d4ef95803e8e3fc257f9190a461114581836129ff86612f5b565b612f79565b600063ffffffff821115611e5f576040516306dfcc6560e41b81526020600482015260248101839052604401610a23565b606060ff8314612a4f57612a48836130e5565b9050610977565b818054612a5b90613bbc565b80601f0160208091040260200160405190810160405280929190818152602001828054612a8790613bbc565b8015612ad45780601f10612aa957610100808354040283529160200191612ad4565b820191906000526020600020905b815481529060010190602001808311612ab757829003601f168201915b50505050509050610977565b6000818152600283016020526040812054819080612b0f57612b028585612cd5565b925060009150611f669050565b600192509050611f66565b600082815260028401602052604081208290556120d48484613124565b6000610977825490565b6000611bca8383613130565b600080807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a0841115612b885750600091506003905082612c12565b604080516000808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015612bdc573d6000803e3d6000fd5b5050604051601f1901519150506001600160a01b038116612c0857506000925060019150829050612c12565b9250600091508190505b9450945094915050565b6000826003811115612c3057612c3061385a565b03612c39575050565b6001826003811115612c4d57612c4d61385a565b03612c6b5760405163f645eedf60e01b815260040160405180910390fd5b6002826003811115612c7f57612c7f61385a565b03612ca05760405163fce698f760e01b815260048101829052602401610a23565b6003826003811115612cb457612cb461385a565b03610b37576040516335e2f38360e21b815260048101829052602401610a23565b6000611bca838361315a565b600081815260028301602052604081205480158015612d075750612d058484612cd5565b155b15611bca5760405163015ab34360e11b815260048101849052602401610a23565b6040805180820190915260008082526020820152826000018263ffffffff1681548110612d5757612d57613cf3565b60009182526020918290206040805180820190915291015465ffffffffffff81168252600160301b90046001600160d01b0316918101919091529392505050565b612da3838383613172565b6001600160a01b038316612df4576000612dbc60025490565b90506001600160d01b0380821115612df157604051630e58ae9360e11b81526004810183905260248101829052604401610a23565b50505b61114583838361329c565b6013548110612e2257612e13600d836132fb565b610b3757611145600d8361331d565b612e2d600d836132fb565b15610b3757611145600d83613332565b6001600160a01b0382166000908152602160205260409020547f00000000000000000000000000000000000000000000152d02c7e14af680000080821015908310612efe5780612eb657612eaf42612ea685612e97610f95565b612ea19190613c62565b613347565b6020919061337b565b5050612ede565b612edb42612ea68486612ec7610f95565b612ed19190613c62565b612ea19190613c0c565b50505b6001600160a01b0384166000908152602160205260409020839055611c91565b8015612f1757612f1442612ea684612ed1610f95565b50505b5050506001600160a01b0316600090815260216020526040812055565b6000612f436002848418613c35565b611bca90848416613c62565b6000611bca8383613396565b6001600160a01b038116600090815260208190526040812054610977565b816001600160a01b0316836001600160a01b031614158015612f9b5750600081115b15611145576001600160a01b03831615613043576001600160a01b03831660009081526009602052604081208190612fde90613490612fd986613347565b61349c565b6001600160d01b031691506001600160d01b03169150846001600160a01b03167fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a7248383604051613038929190918252602082015260400190565b60405180910390a250505b6001600160a01b03821615611145576001600160a01b0382166000908152600960205260408120819061307c906134c1612fd986613347565b6001600160d01b031691506001600160d01b03169150836001600160a01b03167fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a72483836040516130d6929190918252602082015260400190565b60405180910390a25050505050565b606060006130f2836134cd565b604080516020808252818301909252919250600091906020820181803683375050509182525060208101929092525090565b6000611bca83836134f5565b600082600001828154811061314757613147613cf3565b9060005260206000200154905092915050565b60008181526001830160205260408120541515611bca565b6001600160a01b03831661319d5780600260008282546131929190613c62565b9091555061320f9050565b6001600160a01b038316600090815260208190526040902054818110156131f05760405163391434e360e21b81526001600160a01b03851660048201526024810182905260448101839052606401610a23565b6001600160a01b03841660009081526020819052604090209082900390555b6001600160a01b03821661322b5760028054829003905561324a565b6001600160a01b03821660009081526020819052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8360405161328f91815260200190565b60405180910390a3505050565b6001600160a01b0383166132be576132bb600a6134c1612fd984613347565b50505b6001600160a01b0382166132e0576132dd600a613490612fd984613347565b50505b6111456132ec84610bfc565b6132f584610bfc565b83612f79565b6001600160a01b03811660009081526001830160205260408120541515611bca565b6000611bca836001600160a01b0384166134f5565b6000611bca836001600160a01b038416613396565b60006001600160d01b03821115611e5f576040516306dfcc6560e41b815260d0600482015260248101839052604401610a23565b600080613389858585613544565b915091505b935093915050565b6000818152600183016020526040812054801561347f5760006133ba600183613c0c565b85549091506000906133ce90600190613c0c565b90508082146134335760008660000182815481106133ee576133ee613cf3565b906000526020600020015490508087600001848154811061341157613411613cf3565b6000918252602080832090910192909255918252600188019052604090208390555b855486908061344457613444613d20565b600190038181906000526020600020016000905590558560010160008681526020019081526020016000206000905560019350505050610977565b6000915050610977565b5092915050565b6000611bca8284613d36565b600080613389426134b96134af886120dc565b868863ffffffff16565b87919061337b565b6000611bca8284613d56565b600060ff8216601f81111561097757604051632cd44ac360e21b815260040160405180910390fd5b600081815260018301602052604081205461353c57508154600181810184556000848152602080822090930184905584548482528286019093526040902091909155610977565b506000610977565b82546000908190801561363d57600061356287611ee7600185613c0c565b805490915065ffffffffffff80821691600160301b90046001600160d01b03169088168211156135a557604051632520601d60e01b815260040160405180910390fd5b8765ffffffffffff168265ffffffffffff16036135de57825465ffffffffffff16600160301b6001600160d01b0389160217835561362f565b6040805180820190915265ffffffffffff808a1682526001600160d01b03808a1660208085019182528d54600181018f5560008f81529190912094519151909216600160301b029216919091179101555b945085935061338e92505050565b50506040805180820190915265ffffffffffff80851682526001600160d01b0380851660208085019182528854600181018a5560008a815291822095519251909316600160301b02919093161792019190915590508161338e565b8280548282559060005260206000209081019282156136d3579160200282015b828111156136d35782518255916020019190600101906136b8565b50611e5f9291505b80821115611e5f57600081556001016136db565b80356001600160a01b038116811461370657600080fd5b919050565b60006020828403121561371d57600080fd5b611bca826136ef565b6000815180845260005b8181101561374c57602081850181015186830182015201613730565b506000602082860101526020601f19601f83011685010191505092915050565b602081526000611bca6020830184613726565b6000806040838503121561379257600080fd5b61379b836136ef565b946020939093013593505050565b6000806000606084860312156137be57600080fd5b6137c7846136ef565b92506137d5602085016136ef565b9150604084013590509250925092565b6000602082840312156137f757600080fd5b5035919050565b803561ffff8116811461370657600080fd5b60006020828403121561382257600080fd5b611bca826137fe565b803563ffffffff8116811461370657600080fd5b60006020828403121561385157600080fd5b611bca8261382b565b634e487b7160e01b600052602160045260246000fd5b6004811061388e57634e487b7160e01b600052602160045260246000fd5b9052565b8881526020810188905263ffffffff8781166040830152861660608201526080810185905260a0810184905260c0810183905261010081016138d760e0830184613870565b9998505050505050505050565b602081016109778284613870565b60ff60f81b881681526000602060e08184015261391260e084018a613726565b8381036040850152613924818a613726565b606085018990526001600160a01b038816608086015260a0850187905284810360c0860152855180825283870192509083019060005b818110156139765783518352928401929184019160010161395a565b50909c9b505050505050505050505050565b6000806040838503121561399b57600080fd5b6139a4836137fe565b91506139b26020840161382b565b90509250929050565b803560ff8116811461370657600080fd5b60008060008060008060c087890312156139e557600080fd5b6139ee876136ef565b95506020870135945060408701359350613a0a606088016139bb565b92506080870135915060a087013590509295509295509295565b634e487b7160e01b600052604160045260246000fd5b600080600060608486031215613a4f57600080fd5b8335925060208085013567ffffffffffffffff80821115613a6f57600080fd5b818701915087601f830112613a8357600080fd5b813581811115613a9557613a95613a24565b8060051b604051601f19603f83011681018181108582111715613aba57613aba613a24565b60405291825284820192508381018501918a831115613ad857600080fd5b938501935b82851015613af657843584529385019392850192613add565b979a979950505050604095909501359450505050565b600080600080600080600060e0888a031215613b2757600080fd5b613b30886136ef565b9650613b3e602089016136ef565b95506040880135945060608801359350613b5a608089016139bb565b925060a0880135915060c0880135905092959891949750929550565b60008060408385031215613b8957600080fd5b613b92836136ef565b91506139b2602084016136ef565b60008060408385031215613bb357600080fd5b6139a4836136ef565b600181811c90821680613bd057607f821691505b602082108103613bf057634e487b7160e01b600052602260045260246000fd5b50919050565b634e487b7160e01b600052601160045260246000fd5b8181038181111561097757610977613bf6565b634e487b7160e01b600052601260045260246000fd5b600082613c4457613c44613c1f565b500490565b600060018201613c5b57613c5b613bf6565b5060010190565b8082018082111561097757610977613bf6565b808202811582820484141761097757610977613bf6565b600082613c9b57613c9b613c1f565b500690565b600060208284031215613cb257600080fd5b5051919050565b63ffffffff81811683821601908082111561348957613489613bf6565b63ffffffff82811682821603908082111561348957613489613bf6565b634e487b7160e01b600052603260045260246000fd5b600081613d1857613d18613bf6565b506000190190565b634e487b7160e01b600052603160045260246000fd5b6001600160d01b0382811682821603908082111561348957613489613bf6565b6001600160d01b0381811683821601908082111561348957613489613bf656fea26469706673582212209ec52245637df58d1f15fcfb224c9147073e03a85f4c0f6558028f301d96c3ff64736f6c63430008140033

000000000000000000000000000000000000000000000000000000000000018000000000000000000000000000000000000000000000000000000000000001c000000000000000000000000000000000000000000000000000000000000002000000000000000000000000000000000000000000000000000000000067cd12400000000000000000000000000000000000000000000000056bc75e2d631000000000000000000000000000000000000000000000000000000000000000093a80000000000000000000000000000000000000000000000000000000000000006400000000000000000000000000000000000000000000021e19e0c9bab2400000000000000000000000000000000000000000000000000000000000000002a300000000000000000000000000000000000000000000000000000000000000000a00000000000000000000000000000000000000000000152d02c7e14af680000000000000000000000000000073cfcbc576ed24f4e383a9d83ccf8155ff7f8f7100000000000000000000000000000000000000000000000000000000000000034f6e65000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000034f4e4500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000060000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d3c21bcecceda10000000000000000000000000000000000000000000000000000000000000000000011000000000000000000000000f0def4ea31206e16f8c4068d8151286c7c408ee20000000000000000000000000137be282dbc517183d5c78f98323ac412a4a08f0000000000000000000000002927b21118900c6122375f9de209344cbff03824000000000000000000000000ff938aa1e4b57680691af61a9e9a8631c80e0d27000000000000000000000000aa25a2c9cad9f66aede9920e629b679a4a3f32ab0000000000000000000000002fba151c3faf8f6e9496cd8967c0b372ccd5c11200000000000000000000000003590026cc8974aa833f3a01307c99e1a4fa1da5000000000000000000000000b4d82fd709a11c793cb8aee9a3b47b83efce92ec000000000000000000000000dadb28fb1ce2f960a7223ea76f06f0b49945142300000000000000000000000004c7baff653ae6297cd57abebaf1e46e5fbdb32b0000000000000000000000003b646ef054c3dfd0e306e9118efb204150d22de9000000000000000000000000ec77cb7840bac0f1fa67e486da8b497430744ef6000000000000000000000000db9c2e68b132affe6a3ab3f9f45e79adede22b740000000000000000000000008ea4a2236d9e9d7761ccca77739a114de9d5a09500000000000000000000000089c0c6ca333546cdcd20431b061b084413a371aa000000000000000000000000b369b114d424acef6060721c38dfdd767da4505b00000000000000000000000009e5daed6e4a6cd54fe2f64a5e8892da4efb1754

-----Decoded View---------------
Arg [0] : tokenName (string): One
Arg [1] : tokenSymbol (string): ONE
Arg [2] : _initialAirdropConfig (tuple): 
     Arg [1] : participants (address[]): 0xF0dEf4EA31206E16F8C4068d8151286c7C408EE2,0x0137bE282dBc517183D5c78F98323aC412A4A08F,0x2927B21118900C6122375f9De209344Cbff03824,0xfF938AA1E4B57680691af61A9E9a8631C80e0d27,0xaA25a2C9cad9f66AedE9920E629B679A4A3F32aB,0x2fBa151C3FAf8f6e9496cd8967C0b372cCD5C112,0x03590026cC8974Aa833F3A01307c99e1A4fa1dA5,0xb4d82Fd709A11c793cb8aeE9a3b47b83eFce92Ec,0xdadB28FB1CE2F960A7223Ea76f06F0B499451423,0x04C7BAfF653aE6297cD57abEBAf1E46e5FBdb32B,0x3B646EF054c3dFd0E306e9118Efb204150d22DE9,0xEc77cB7840BAc0f1fa67e486DA8B497430744Ef6,0xDb9c2E68b132aFfe6a3Ab3F9F45E79adeDe22b74,0x8eA4a2236d9e9d7761CcCA77739A114dE9d5a095,0x89C0C6Ca333546CDcD20431b061b084413A371Aa,0xb369b114d424Acef6060721C38Dfdd767da4505b,0x09e5daeD6E4a6CD54fe2F64a5e8892DA4eFB1754
     Arg [2] : numWinners (uint8): 0
     Arg [3] : amount (uint256): 1000000000000000000000000

Arg [3] : _regularAirdropConfig (tuple): 
     Arg [1] : startTimestamp (uint256): 1741492800
     Arg [2] : eligibilityThreshold (uint256): 100000000000000000000
     Arg [3] : airdropTimeInterval (uint256): 604800
     Arg [4] : numWinners (uint8): 100
     Arg [5] : amount (uint256): 10000000000000000000000
     Arg [6] : windowDuration (uint256): 172800
     Arg [7] : fulfillBatchSize (uint8): 10

Arg [4] : _governanceThreshold (uint256): 100000000000000000000000
Arg [5] : _migrationContract (address): 0x73cfCBc576ED24F4e383a9D83CCf8155fF7f8F71

-----Encoded View---------------
37 Constructor Arguments found :
Arg [0] : 0000000000000000000000000000000000000000000000000000000000000180
Arg [1] : 00000000000000000000000000000000000000000000000000000000000001c0
Arg [2] : 0000000000000000000000000000000000000000000000000000000000000200
Arg [3] : 0000000000000000000000000000000000000000000000000000000067cd1240
Arg [4] : 0000000000000000000000000000000000000000000000056bc75e2d63100000
Arg [5] : 0000000000000000000000000000000000000000000000000000000000093a80
Arg [6] : 0000000000000000000000000000000000000000000000000000000000000064
Arg [7] : 00000000000000000000000000000000000000000000021e19e0c9bab2400000
Arg [8] : 000000000000000000000000000000000000000000000000000000000002a300
Arg [9] : 000000000000000000000000000000000000000000000000000000000000000a
Arg [10] : 00000000000000000000000000000000000000000000152d02c7e14af6800000
Arg [11] : 00000000000000000000000073cfcbc576ed24f4e383a9d83ccf8155ff7f8f71
Arg [12] : 0000000000000000000000000000000000000000000000000000000000000003
Arg [13] : 4f6e650000000000000000000000000000000000000000000000000000000000
Arg [14] : 0000000000000000000000000000000000000000000000000000000000000003
Arg [15] : 4f4e450000000000000000000000000000000000000000000000000000000000
Arg [16] : 0000000000000000000000000000000000000000000000000000000000000060
Arg [17] : 0000000000000000000000000000000000000000000000000000000000000000
Arg [18] : 00000000000000000000000000000000000000000000d3c21bcecceda1000000
Arg [19] : 0000000000000000000000000000000000000000000000000000000000000011
Arg [20] : 000000000000000000000000f0def4ea31206e16f8c4068d8151286c7c408ee2
Arg [21] : 0000000000000000000000000137be282dbc517183d5c78f98323ac412a4a08f
Arg [22] : 0000000000000000000000002927b21118900c6122375f9de209344cbff03824
Arg [23] : 000000000000000000000000ff938aa1e4b57680691af61a9e9a8631c80e0d27
Arg [24] : 000000000000000000000000aa25a2c9cad9f66aede9920e629b679a4a3f32ab
Arg [25] : 0000000000000000000000002fba151c3faf8f6e9496cd8967c0b372ccd5c112
Arg [26] : 00000000000000000000000003590026cc8974aa833f3a01307c99e1a4fa1da5
Arg [27] : 000000000000000000000000b4d82fd709a11c793cb8aee9a3b47b83efce92ec
Arg [28] : 000000000000000000000000dadb28fb1ce2f960a7223ea76f06f0b499451423
Arg [29] : 00000000000000000000000004c7baff653ae6297cd57abebaf1e46e5fbdb32b
Arg [30] : 0000000000000000000000003b646ef054c3dfd0e306e9118efb204150d22de9
Arg [31] : 000000000000000000000000ec77cb7840bac0f1fa67e486da8b497430744ef6
Arg [32] : 000000000000000000000000db9c2e68b132affe6a3ab3f9f45e79adede22b74
Arg [33] : 0000000000000000000000008ea4a2236d9e9d7761ccca77739a114de9d5a095
Arg [34] : 00000000000000000000000089c0c6ca333546cdcd20431b061b084413a371aa
Arg [35] : 000000000000000000000000b369b114d424acef6060721c38dfdd767da4505b
Arg [36] : 00000000000000000000000009e5daed6e4a6cd54fe2f64a5e8892da4efb1754