Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Is this a proxy?
• Similar
• Submit Audit
• Compare

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

import {UUPSUpgradeable} from "@openzeppelin/contracts-upgradeable/proxy/utils/UUPSUpgradeable.sol";
import {OwnableUpgradeable} from "@openzeppelin/contracts-upgradeable/access/OwnableUpgradeable.sol";
import {Math} from "@openzeppelin/contracts/utils/math/Math.sol";

import {PaintswapVRFConsumerUpgradeable} from "@paintswap/vrf/contracts/PaintswapVRFConsumerUpgradeable.sol";

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

import {IClanMemberLeftCB} from "../interfaces/IClanMemberLeftCB.sol";
import {ICombatants} from "../interfaces/ICombatants.sol";
import {IPlayers} from "../interfaces/IPlayers.sol";
import {IWorldActions} from "../interfaces/IWorldActions.sol";
import {RandomnessBeacon} from "../RandomnessBeacon.sol";
import {IClans} from "../interfaces/IClans.sol";
import {IBankFactory} from "../interfaces/IBankFactory.sol";
import {IBrushToken} from "../interfaces/external/IBrushToken.sol";

import {SkillLibrary} from "../libraries/SkillLibrary.sol";
import {EstforLibrary} from "../EstforLibrary.sol";
import {PlayersLibrary} from "../Players/PlayersLibrary.sol";

// solhint-disable-next-line no-global-import
import "../globals/all.sol";

// Randomly spawn raid monsters and bosses
// Colonel can decide to fight in raids
// Spawning needs calling manually (every 8 hours or w.e it is set to)
// 1-3 Random spawn with different stats, you can pick one to kill. Loot is given based on total rolls of the monster?
contract Raids is UUPSUpgradeable, OwnableUpgradeable, PaintswapVRFConsumerUpgradeable, ICombatants, IClanMemberLeftCB {
  using SkillLibrary for uint8;
  using SkillLibrary for Skill;

  event AssignCombatants(
    uint256 clanId,
    uint64[] playerIds,
    address from,
    uint256 leaderPlayerId,
    uint256 cooldownTimestamp
  );
  event RequestFightRaid(uint256 playerId, uint56 clanId, uint256 raidId, uint256 requestId);
  event SetExpectedGasLimitFulfill(uint256 expectedGasLimitFulfill);
  event SetSpawnRaidCooldown(uint256 spawnRaidCooldown);
  event RequestSpawnRaid(uint256 playerId, uint256 requestId);
  event AddBaseRaids(uint256[] baseRaidIds, BaseRaid[] baseRaids);
  event EditBaseRaids(uint256[] baseRaidIds, BaseRaid[] baseRaids);
  event RemoveCombatant(uint256 playerId, uint256 clanId);
  event NewRaidsSpawned(uint40 startRaidId, RaidInfo[] raidInfos, uint256 requestId);
  event RaidBattleOutcome(
    uint256 clanId,
    uint256 raidId,
    uint256 requestId,
    uint256 regenerateId,
    uint256 regenerateAmountUsed,
    uint16[] choiceIds,
    uint256 bossChoiceId,
    bool defeatedRaid,
    uint256[] lootTokenIds,
    uint256[] lootTokenAmounts
  );
  event SetPreventRaids(bool preventRaids);
  event SetMaxClanCombatants(uint256 maxClanCombatants);
  event SetCombatActions(uint16[] combatActionIds);

  error NotOwnerOfPlayerAndActive();
  error RequestDoesNotExist();
  error CallerNotSamWitchVRF();
  error RankNotHighEnough();
  error RaidInProgress();
  error LengthMismatch();
  error OnlyCombatantsHelper();
  error OnlyClans();
  error PreviousRaidNotSpawnedYet();
  error TooManyCombatants();
  error ClanCombatantsChangeCooldown();
  error RaidAlreadyExists();
  error RaidDoesNotExist();
  error NotInRange();
  error RaidsPrevented();
  error NoCombatants();

  struct BaseRaid {
    uint8 tier;
    // Boss stats
    int16 minHealth;
    int16 maxHealth;
    int16 minMeleeAttack;
    int16 maxMeleeAttack;
    int16 minMagicAttack;
    int16 maxMagicAttack;
    int16 minRangedAttack;
    int16 maxRangedAttack;
    int16 minMeleeDefence;
    int16 maxMeleeDefence;
    int16 minMagicDefence;
    int16 maxMagicDefence;
    int16 minRangedDefence;
    int16 maxRangedDefence;
    uint16[16] randomLootTokenIds; // 1 slot
    uint32[16] randomLootTokenAmounts; // 2 slots
    uint16[16] randomChances; // 1 slot
  }

  struct ClanInfo {
    IBank bank;
    uint40 attackingCooldownTimestamp;
    uint40 assignCombatantsCooldownTimestamp;
    bool currentlyAttacking;
    uint64[] playerIds;
    uint96 totalBrushClaimable; // TODO Needed?
  }

  struct RaidInfo {
    uint16 baseRaidId;
    int16 health;
    int16 meleeAttack;
    int16 magicAttack;
    int16 rangedAttack;
    int16 meleeDefence;
    int16 magicDefence;
    int16 rangedDefence;
    uint8 tier;
    uint16[5] combatActionIds;
  }

  struct PendingRaidAttack {
    uint40 clanId;
    uint40 raidId;
    uint16 regenerateId; // Food from the bank to use for the current combat
  }

  uint256 private constant NUM_WORDS = 3;
  uint256 private constant CALLBACK_GAS_LIMIT_SPAWN = 500_000;

  uint40 private _nextRaidId;
  uint40 private _currentRaidExpireTime;
  uint256 private _raidSpawnRequestId;
  IPlayers private _players;
  IClans private _clans;
  bool private _preventRaids;
  address private _unused; // Unused, previously was vrfRequestInfo
  address private unused1; // Unused, previously was oracle
  ItemNFT private _itemNFT;
  address private _unused2; // Unused, previously was samwitchVRF
  uint24 private _expectedGasLimitFulfill;
  uint16 private _maxBaseRaidId;
  address private _combatantsHelper;
  uint24 private _combatantChangeCooldown;
  uint8 private _maxClanCombatants;
  uint24 private _spawnRaidCooldown;
  IBankFactory private _bankFactory;
  IBrushToken private _brush;
  IWorldActions private _worldActions;
  RandomnessBeacon private _randomnessBeacon;

  uint16[] private _combatActionIds; // Small monsters that might spawn
  mapping(uint256 clanId => ClanInfo clanInfo) private _clanInfos;
  mapping(uint256 baseRaidId => BaseRaid baseRaid) private _baseRaids;
  mapping(uint256 raidId => RaidInfo) private _raidInfos;
  mapping(uint256 requestId => PendingRaidAttack pendingRaidAttack) private _requestIdToPendingRaidAttack;

  modifier isOwnerOfPlayerAndActive(uint256 playerId) {
    require(_players.isOwnerOfPlayerAndActive(_msgSender(), playerId), NotOwnerOfPlayerAndActive());
    _;
  }

  modifier isMinimumRank(uint256 clanId, uint256 playerId, ClanRank clanRank) {
    require(_clans.getRank(clanId, playerId) >= clanRank, RankNotHighEnough());
    _;
  }

  modifier onlyCombatantsHelper() {
    require(_msgSender() == _combatantsHelper, OnlyCombatantsHelper());
    _;
  }

  modifier onlyClans() {
    require(_msgSender() == address(_clans), OnlyClans());
    _;
  }

  /// @custom:oz-upgrades-unsafe-allow constructor
  constructor() {
    _disableInitializers();
  }

  function initialize(
    IPlayers players,
    ItemNFT itemNFT,
    IClans clans,
    address paintswapVRFConsumer,
    uint24 spawnRaidCooldown,
    IBrushToken brush,
    IWorldActions worldActions,
    RandomnessBeacon randomnessBeacon,
    uint8 maxClanCombatants,
    uint16[] calldata combatActionIds,
    bool isBeta
  ) external initializer {
    __Ownable_init(_msgSender());
    __UUPSUpgradeable_init();
    __PaintswapVRFConsumerUpgradeable_init(paintswapVRFConsumer);

    _players = players;
    _itemNFT = itemNFT;
    _clans = clans;
    _brush = brush;
    _combatantChangeCooldown = isBeta ? 5 minutes : 3 days;
    _worldActions = worldActions;
    _randomnessBeacon = randomnessBeacon;
    _nextRaidId = 1;
    setMaxClanCombatants(maxClanCombatants);
    setSpawnRaidCooldown(spawnRaidCooldown);
    setExpectedGasLimitFulfill(2_000_000);
    setCombatActions(combatActionIds);
  }

  function initializeV3(address paintswapVRFConsumer) external reinitializer(3) {
    __PaintswapVRFConsumerUpgradeable_init(paintswapVRFConsumer);
  }

  function requestSpawnRaid(uint64 playerId) external payable isOwnerOfPlayerAndActive(playerId) {
    // Spawn a random monster
    // Must be after the last raid is finished
    require(_raidSpawnRequestId == 0, PreviousRaidNotSpawnedYet());
    require(_currentRaidExpireTime <= block.timestamp, RaidInProgress());
    require(!_preventRaids, RaidsPrevented());

    _raidSpawnRequestId = _requestRandomnessPayInNative(
      CALLBACK_GAS_LIMIT_SPAWN,
      NUM_WORDS,
      msg.sender,
      _calculateRequestPriceNative(CALLBACK_GAS_LIMIT_SPAWN)
    );
    _currentRaidExpireTime = uint40(block.timestamp + _spawnRaidCooldown);

    emit RequestSpawnRaid(playerId, _raidSpawnRequestId);
  }

  function requestFightRaid(
    uint64 playerId,
    uint40 clanId,
    uint40 raidId,
    uint16 regenerateId
  ) external payable isOwnerOfPlayerAndActive(playerId) isMinimumRank(clanId, playerId, ClanRank.COLONEL) {
    require(!_preventRaids, RaidsPrevented());
    uint256 playerLength = _clanInfos[clanId].playerIds.length;
    require(playerLength != 0, NoCombatants());
    address bankAddress = address(_clanInfos[clanId].bank);
    if (bankAddress == address(0)) {
      bankAddress = _bankFactory.getBankAddress(clanId);
      _clanInfos[clanId].bank = IBank(bankAddress);
    }

    // Requires raid passes taken from the bank
    _itemNFT.burn(bankAddress, RAID_PASS, playerLength);

    uint40 currentRaid = _nextRaidId;
    require(raidId < currentRaid && raidId >= currentRaid - NUM_WORDS, RaidDoesNotExist());

    uint256 requestId = _requestRandomnessPayInNative(_expectedGasLimitFulfill, NUM_WORDS, msg.sender, msg.value);

    _requestIdToPendingRaidAttack[requestId].raidId = raidId;
    _requestIdToPendingRaidAttack[requestId].clanId = clanId;
    _requestIdToPendingRaidAttack[requestId].regenerateId = regenerateId;
    emit RequestFightRaid(playerId, clanId, raidId, requestId);
  }

  function _spawnRaid(uint256 requestId, uint256[] calldata randomWords) private {
    uint40 currentRaidId = _nextRaidId;

    // Spawn A few raid monsters
    RaidInfo[] memory raidInfos = new RaidInfo[](NUM_WORDS);
    uint16 maxBaseRaidId = _maxBaseRaidId;
    for (uint256 i; i < NUM_WORDS; ++i) {
      // Spawn a raid monster (first 2 bytes for the base raid id)
      uint256 randomWord = randomWords[i];
      uint16 baseRaidId = uint16(randomWord % maxBaseRaidId) + 1;
      BaseRaid storage baseRaid = _baseRaids[baseRaidId];

      uint256 combatActionIdsLength = _combatActionIds.length;
      uint16[5] memory combatActionIds = [
        EstforLibrary._getRandomFromArray16(randomWord, 128, _combatActionIds, combatActionIdsLength),
        EstforLibrary._getRandomFromArray16(randomWord, 144, _combatActionIds, combatActionIdsLength),
        EstforLibrary._getRandomFromArray16(randomWord, 160, _combatActionIds, combatActionIdsLength),
        EstforLibrary._getRandomFromArray16(randomWord, 176, _combatActionIds, combatActionIdsLength),
        EstforLibrary._getRandomFromArray16(randomWord, 192, _combatActionIds, combatActionIdsLength)
      ];

      RaidInfo memory raidInfo = RaidInfo({
        baseRaidId: baseRaidId,
        health: EstforLibrary._getRandomInRange16(randomWord, 16, baseRaid.minHealth, baseRaid.maxHealth),
        meleeAttack: EstforLibrary._getRandomInRange16(
          randomWord,
          32,
          baseRaid.minMeleeAttack,
          baseRaid.maxMeleeAttack
        ),
        magicAttack: EstforLibrary._getRandomInRange16(
          randomWord,
          48,
          baseRaid.minMagicAttack,
          baseRaid.maxMagicAttack
        ),
        rangedAttack: EstforLibrary._getRandomInRange16(
          randomWord,
          64,
          baseRaid.minRangedAttack,
          baseRaid.maxRangedAttack
        ),
        meleeDefence: EstforLibrary._getRandomInRange16(
          randomWord,
          80,
          baseRaid.minMeleeDefence,
          baseRaid.maxMeleeDefence
        ),
        magicDefence: EstforLibrary._getRandomInRange16(
          randomWord,
          96,
          baseRaid.minMagicDefence,
          baseRaid.maxMagicDefence
        ),
        rangedDefence: EstforLibrary._getRandomInRange16(
          randomWord,
          112,
          baseRaid.minRangedDefence,
          baseRaid.maxRangedDefence
        ),
        combatActionIds: combatActionIds,
        tier: baseRaid.tier
      });

      _raidInfos[uint40(currentRaidId + i)] = raidInfo;
      raidInfos[i] = raidInfo;
    }

    _nextRaidId = uint40(currentRaidId + NUM_WORDS);

    delete _raidSpawnRequestId;
    emit NewRaidsSpawned(currentRaidId, raidInfos, requestId); // These raids are spawned for everyone
  }

  function _fightRaid(uint256 requestId, uint256[] calldata randomWords) private {
    // Actually doing the raid
    uint256 clanId = _requestIdToPendingRaidAttack[requestId].clanId;
    require(clanId != 0, RequestDoesNotExist());

    uint256 raidId = _requestIdToPendingRaidAttack[requestId].raidId;

    uint256 randomWord = randomWords[0];

    // Food to use
    uint16 regenerateId = _requestIdToPendingRaidAttack[requestId].regenerateId;

    uint256 lootLength;
    bool defeatedRaid = true;

    address bank = address(_clanInfos[clanId].bank);
    uint256 elapsedTime = 7 hours; // of combat with the small monsters

    CombatStats memory combatStats; // All combatants
    ClanInfo storage clanInfo = _clanInfos[clanId];
    uint64[] memory playerIds = clanInfo.playerIds;
    for (uint256 i; i < playerIds.length; ++i) {
      uint64 playerId = playerIds[i];
      // TODO Make a getLevels function
      combatStats.health += int16(int256(_players.getLevel(playerId, Skill.HEALTH)));
      combatStats.meleeAttack += int16(int256(_players.getLevel(playerId, Skill.MELEE)));
      combatStats.magicAttack += int16(int256(_players.getLevel(playerId, Skill.MAGIC)));
      combatStats.rangedAttack += int16(int256(_players.getLevel(playerId, Skill.RANGED)));
      int16 defence = int16(int256(_players.getLevel(playerId, Skill.DEFENCE)));
      combatStats.meleeDefence += defence;
      combatStats.magicDefence += defence;
      combatStats.rangedDefence += defence;
    }

    PendingQueuedActionEquipmentState[] memory pendingQueuedActionEquipmentStates;

    (uint8 alphaCombat, uint8 betaCombat, uint8 alphaCombatHealing) = _players.getAlphaCombatParams();

    // Pick a random actionChoice, if you aren't high enough you don't count
    // Pick a random one of these
    uint16[3] memory actionChoiceIds = [
      ACTIONCHOICE_MELEE_BASIC_SWORD,
      ACTIONCHOICE_RANGED_BASIC_BOW,
      ACTIONCHOICE_MAGIC_SHADOW_BLAST
    ];

    RaidInfo storage raidInfo = _raidInfos[raidId];
    uint16[5] memory combatActionIds = raidInfo.combatActionIds;
    uint256 numRaidBossRolls = 32;
    uint256 maxLootLength = MAX_GUARANTEED_REWARDS_PER_ACTION * combatActionIds.length + numRaidBossRolls;

    uint256[] memory lootTokenIds = new uint256[](maxLootLength);
    uint256[] memory lootTokenAmounts = new uint256[](maxLootLength);

    uint256 totalFoodConsumed;
    uint256 choiceIdsLength = combatActionIds.length;
    uint16[] memory choiceIds = new uint16[](choiceIdsLength);
    uint16 bossChoiceId;
    for (uint256 i = 0; i < choiceIdsLength; ++i) {
      // Random actionChoiceIds
      uint16 actionId = combatActionIds[i];
      uint16 choiceId = EstforLibrary._getRandomFrom3ElementArray16(randomWord, i * 16, actionChoiceIds);
      choiceIds[i] = choiceId;

      CombatStats memory enemyCombatStats = _worldActions.getCombatStats(actionId);
      ActionChoice memory actionChoice = _worldActions.getActionChoice(NONE, choiceId);

      (ActionRewards memory actionRewards, Skill actionSkill, uint256 numSpawnedPerHour) = _worldActions
        .getRewardsHelper(actionId);

      numSpawnedPerHour *= 5 ** raidInfo.tier; // 5, 25, 125

      // Fight the smaller monsters
      (
        uint256 xpElapsedTime,
        uint256 combatElapsedTime,
        uint16 baseInputItemsConsumedNum,
        uint16 foodConsumed,
        bool died
      ) = PlayersLibrary.determineBattleOutcome(
          bank,
          address(_itemNFT),
          elapsedTime,
          actionChoice,
          regenerateId,
          numSpawnedPerHour,
          combatStats,
          enemyCombatStats,
          alphaCombat,
          betaCombat,
          alphaCombatHealing,
          pendingQueuedActionEquipmentStates
        );

      totalFoodConsumed += foodConsumed;

      if (died) {
        defeatedRaid = false;
        break;
      }

      bool isCombat = true; //
      uint16 monstersKilled = uint16((numSpawnedPerHour * xpElapsedTime) / (SPAWN_MUL * 3600));
      uint8 successPercent = 100;
      (uint256[] memory newIds, uint256[] memory newAmounts) = _getGuaranteedRewards(
        xpElapsedTime,
        actionRewards,
        monstersKilled,
        isCombat,
        successPercent
      );

      for (uint256 j = 0; j < newIds.length; ++j) {
        lootTokenIds[lootLength] = newIds[j];
        lootTokenAmounts[lootLength++] = newAmounts[j];
      }
    }

    if (defeatedRaid) {
      // Now do raid boss battle
      uint256 numSpawnedPerHour = 1 * SPAWN_MUL; // 1 per hour
      bossChoiceId = EstforLibrary._getRandomFrom3ElementArray16(randomWord, 0, actionChoiceIds);

      CombatStats memory enemyCombatStats = CombatStats({
        health: raidInfo.health,
        meleeAttack: raidInfo.meleeAttack,
        magicAttack: raidInfo.magicAttack,
        rangedAttack: raidInfo.rangedAttack,
        meleeDefence: raidInfo.meleeDefence,
        magicDefence: raidInfo.magicDefence,
        rangedDefence: raidInfo.rangedDefence
      });

      uint256 elapsedTimeBoss = 1 hours; // of combat
      ActionChoice memory actionChoice = _worldActions.getActionChoice(NONE, bossChoiceId);
      // Fight the raid boss (must kill within 1 hour)
      (
        uint256 xpElapsedTime,
        uint256 combatElapsedTime,
        uint16 baseInputItemsConsumedNum,
        uint16 foodConsumed,
        bool died
      ) = PlayersLibrary.determineBattleOutcome(
          bank,
          address(_itemNFT),
          elapsedTimeBoss,
          actionChoice,
          regenerateId,
          numSpawnedPerHour,
          combatStats,
          enemyCombatStats,
          alphaCombat,
          betaCombat,
          alphaCombatHealing,
          pendingQueuedActionEquipmentStates
        );

      totalFoodConsumed += foodConsumed;
      defeatedRaid = !died;
      if (defeatedRaid) {
        uint16 raidBossesKilled = uint16((numSpawnedPerHour * xpElapsedTime) / (SPAWN_MUL * 3600));
        defeatedRaid = !died && raidBossesKilled == 1;
        if (defeatedRaid) {
          // Give 32 rolls for the raid boss and get the random rewards
          BaseRaid storage baseRaid = _baseRaids[raidInfo.baseRaidId];
          uint256 numWords = numRaidBossRolls / 16; // 16 per word
          uint256 length = baseRaid.randomLootTokenIds.length;
          bytes memory randomBytes = abi.encodePacked(randomWords[1:1 + numWords]); // we use randomWords[0] above already
          for (uint256 i; i < numRaidBossRolls; ++i) {
            uint16 rand = _getSlice(randomBytes, i);
            uint16 itemTokenId;
            uint32 amount;
            uint16[16] memory randomLootTokenIds = baseRaid.randomLootTokenIds;
            uint32[16] memory randomLootTokenAmounts = baseRaid.randomLootTokenAmounts;
            uint16[16] memory randomChances = baseRaid.randomChances;
            for (uint256 j; j < length; ++j) {
              if (rand > randomChances[j]) {
                break;
              }
              itemTokenId = randomLootTokenIds[j];
              amount = randomLootTokenAmounts[j];
            }

            lootTokenIds[lootLength] = itemTokenId;
            lootTokenAmounts[lootLength++] = amount;
          }
        }
      }
    }

    defeatedRaid = defeatedRaid && _itemNFT.balanceOf(bank, regenerateId) >= totalFoodConsumed;

    if (!defeatedRaid) {
      lootLength = 0;
    } else {
      // If they don't have enough in the bank then use the maximum possible
      totalFoodConsumed = Math.min(totalFoodConsumed, _itemNFT.balanceOf(bank, regenerateId));
    }

    assembly ("memory-safe") {
      mstore(lootTokenIds, lootLength)
      mstore(lootTokenAmounts, lootLength)
    }

    if (totalFoodConsumed != 0) {
      _itemNFT.burn(bank, regenerateId, totalFoodConsumed);
    }

    // Mint to the bank
    if (lootTokenIds.length != 0) {
      IBank(bank).setAllowBreachedCapacity(true);
      _itemNFT.mintBatch(bank, lootTokenIds, lootTokenAmounts);
      IBank(bank).setAllowBreachedCapacity(false);
    }

    emit RaidBattleOutcome(
      clanId,
      _requestIdToPendingRaidAttack[requestId].raidId,
      uint256(requestId),
      regenerateId,
      totalFoodConsumed,
      choiceIds,
      bossChoiceId,
      defeatedRaid,
      lootTokenIds,
      lootTokenAmounts
    );
  }

  /// @notice Called by the SamWitchVRF contract to fulfill the request
  function _fulfillRandomWords(uint256 requestId, uint256[] calldata randomWords) internal override {
    require(randomWords.length == NUM_WORDS, LengthMismatch());

    if (_raidSpawnRequestId == requestId) {
      _spawnRaid(requestId, randomWords);
    } else {
      _fightRaid(requestId, randomWords);
    }
  }

  function _getSlice(bytes memory b, uint256 index) private pure returns (uint16) {
    uint256 key = index * 2;
    return uint16(b[key] | (bytes2(b[key + 1]) >> 8));
  }

  function _getGuaranteedRewards(
    uint256 xpElapsedTime,
    ActionRewards memory actionRewards,
    uint16 monstersKilled,
    bool isCombat,
    uint8 successPercent
  ) private pure returns (uint256[] memory ids, uint256[] memory amounts) {
    ids = new uint256[](MAX_GUARANTEED_REWARDS_PER_ACTION);
    amounts = new uint256[](MAX_GUARANTEED_REWARDS_PER_ACTION);

    uint256 length = PlayersLibrary._appendGuaranteedRewards(
      ids,
      amounts,
      xpElapsedTime,
      actionRewards,
      monstersKilled,
      isCombat,
      successPercent
    );

    assembly ("memory-safe") {
      mstore(ids, length)
      mstore(amounts, length)
    }
  }

  function assignCombatants(
    uint256 clanId,
    uint64[] calldata playerIds,
    uint256 combatantCooldownTimestamp,
    uint256 leaderPlayerId
  ) external override onlyCombatantsHelper {
    _checkCanAssignCombatants(clanId, playerIds);

    _clanInfos[clanId].playerIds = playerIds;
    _clanInfos[clanId].assignCombatantsCooldownTimestamp = uint40(block.timestamp + _combatantChangeCooldown);
    emit AssignCombatants(clanId, playerIds, _msgSender(), leaderPlayerId, combatantCooldownTimestamp);
  }

  function _checkCanAssignCombatants(uint256 clanId, uint64[] calldata playerIds) private view {
    require(playerIds.length <= _maxClanCombatants, TooManyCombatants());
    // Can only change combatants every so often
    require(_clanInfos[clanId].assignCombatantsCooldownTimestamp <= block.timestamp, ClanCombatantsChangeCooldown());
  }

  function clanMemberLeft(uint256 clanId, uint256 playerId) external override onlyClans {
    // Remove a player combatant if they are currently assigned in this clan
    ClanInfo storage clanInfo = _clanInfos[clanId];
    if (clanInfo.playerIds.length != 0) {
      uint256 searchIndex = EstforLibrary._binarySearch(clanInfo.playerIds, playerId);
      if (searchIndex != type(uint256).max) {
        // Shift the whole array to delete the element
        for (uint256 i = searchIndex; i < clanInfo.playerIds.length - 1; ++i) {
          clanInfo.playerIds[i] = clanInfo.playerIds[i + 1];
        }
        clanInfo.playerIds.pop();
        emit RemoveCombatant(playerId, clanId);
      }
    }
  }

  function _setRaid(BaseRaid calldata baseRaid, uint256 baseId) private {
    require(
      baseRaid.randomLootTokenIds.length == baseRaid.randomLootTokenAmounts.length &&
        baseRaid.randomLootTokenIds.length == baseRaid.randomChances.length,
      LengthMismatch()
    );
    require(baseRaid.minHealth > 0 && baseRaid.minHealth <= baseRaid.maxHealth, NotInRange());
    require(baseRaid.minMeleeAttack <= baseRaid.maxMeleeAttack, NotInRange());
    require(baseRaid.minMagicAttack <= baseRaid.maxMagicAttack, NotInRange());
    require(baseRaid.minRangedAttack <= baseRaid.maxRangedAttack, NotInRange());
    require(baseRaid.minMeleeDefence <= baseRaid.maxMeleeDefence, NotInRange());
    require(baseRaid.minMagicDefence <= baseRaid.maxMagicDefence, NotInRange());
    require(baseRaid.minRangedDefence <= baseRaid.maxRangedDefence, NotInRange());
    _baseRaids[baseId] = baseRaid;
  }

  function _checkBaseRaid(BaseRaid calldata baseRaid, uint256 id) private pure {}

  function _baseRaidExists(uint256 baseId) private view returns (bool) {
    return _baseRaids[baseId].minHealth != 0;
  }

  function isCombatant(uint256 clanId, uint256 playerId) external view override returns (bool) {
    uint64[] storage playerIds = _clanInfos[clanId].playerIds;
    if (playerIds.length == 0) {
      return false;
    }

    uint256 searchIndex = EstforLibrary._binarySearch(playerIds, playerId);
    return searchIndex != type(uint256).max;
  }

  function getRaidInfo(uint256 raidId) external view returns (RaidInfo memory) {
    return _raidInfos[raidId];
  }

  function getAttackCost() public view returns (uint256) {
    return _calculateRequestPriceNative(_expectedGasLimitFulfill);
  }

  function setExpectedGasLimitFulfill(uint24 expectedGasLimitFulfill) public onlyOwner {
    _expectedGasLimitFulfill = expectedGasLimitFulfill;
    emit SetExpectedGasLimitFulfill(expectedGasLimitFulfill);
  }

  function addBaseRaids(uint256[] calldata baseRaidIds, BaseRaid[] calldata baseRaids) external onlyOwner {
    require(baseRaids.length == baseRaidIds.length, LengthMismatch());
    for (uint256 i; i < baseRaids.length; ++i) {
      BaseRaid calldata baseRaid = baseRaids[i];
      uint256 baseRaidId = baseRaidIds[i];
      require(!_baseRaidExists(baseRaidId), RaidAlreadyExists());
      _setRaid(baseRaid, baseRaidId);
    }
    _maxBaseRaidId = uint16(baseRaidIds.length);
    emit AddBaseRaids(baseRaidIds, baseRaids);
  }

  function editBaseRaids(uint256[] calldata baseRaidIds, BaseRaid[] calldata baseRaids) external onlyOwner {
    require(baseRaids.length == baseRaidIds.length, LengthMismatch());
    for (uint256 i = 0; i < baseRaids.length; ++i) {
      BaseRaid calldata baseRaid = baseRaids[i];
      uint256 baseRaidId = baseRaidIds[i];
      require(_baseRaidExists(baseRaidId), RaidDoesNotExist());
      _setRaid(baseRaid, baseRaidId);
    }
    emit EditBaseRaids(baseRaidIds, baseRaids);
  }

  function setSpawnRaidCooldown(uint24 spawnRaidCooldown) public onlyOwner {
    _spawnRaidCooldown = spawnRaidCooldown;
    emit SetSpawnRaidCooldown(spawnRaidCooldown);
  }

  function setMaxClanCombatants(uint8 maxClanCombatants) public onlyOwner {
    _maxClanCombatants = maxClanCombatants;
    emit SetMaxClanCombatants(maxClanCombatants);
  }

  function setPreventRaids(bool preventRaids) external onlyOwner {
    _preventRaids = preventRaids;
    emit SetPreventRaids(preventRaids);
  }

  function setCombatActions(uint16[] calldata combatActionIds) public onlyOwner {
    _combatActionIds = combatActionIds;
    emit SetCombatActions(combatActionIds);
  }

  function initializeAddresses(address combatantsHelper, IBankFactory bankFactory) external onlyOwner {
    _combatantsHelper = combatantsHelper;
    _bankFactory = bankFactory;
  }

  receive() external payable {}

  // solhint-disable-next-line no-empty-blocks
  function _authorizeUpgrade(address newImplementation) internal override onlyOwner {}
}

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

pragma solidity ^0.8.20;

import {ContextUpgradeable} from "../utils/ContextUpgradeable.sol";
import {Initializable} from "../proxy/utils/Initializable.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 OwnableUpgradeable is Initializable, ContextUpgradeable {
    /// @custom:storage-location erc7201:openzeppelin.storage.Ownable
    struct OwnableStorage {
        address _owner;
    }

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.Ownable")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant OwnableStorageLocation = 0x9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c199300;

    function _getOwnableStorage() private pure returns (OwnableStorage storage $) {
        assembly ("memory-safe") {
            $.slot := OwnableStorageLocation
        }
    }

    /**
     * @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.
     */
    function __Ownable_init(address initialOwner) internal onlyInitializing {
        __Ownable_init_unchained(initialOwner);
    }

    function __Ownable_init_unchained(address initialOwner) internal onlyInitializing {
        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) {
        OwnableStorage storage $ = _getOwnableStorage();
        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 {
        OwnableStorage storage $ = _getOwnableStorage();
        address oldOwner = $._owner;
        $._owner = newOwner;
        emit OwnershipTransferred(oldOwner, newOwner);
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (proxy/utils/Initializable.sol)

pragma solidity ^0.8.20;

/**
 * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed
 * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an
 * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer
 * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.
 *
 * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be
 * reused. This mechanism prevents re-execution of each "step" but allows the creation of new initialization steps in
 * case an upgrade adds a module that needs to be initialized.
 *
 * For example:
 *
 * [.hljs-theme-light.nopadding]
 * ```solidity
 * contract MyToken is ERC20Upgradeable {
 *     function initialize() initializer public {
 *         __ERC20_init("MyToken", "MTK");
 *     }
 * }
 *
 * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {
 *     function initializeV2() reinitializer(2) public {
 *         __ERC20Permit_init("MyToken");
 *     }
 * }
 * ```
 *
 * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as
 * possible by providing the encoded function call as the `_data` argument to {ERC1967Proxy-constructor}.
 *
 * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure
 * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.
 *
 * [CAUTION]
 * ====
 * Avoid leaving a contract uninitialized.
 *
 * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation
 * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke
 * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:
 *
 * [.hljs-theme-light.nopadding]
 * ```
 * /// @custom:oz-upgrades-unsafe-allow constructor
 * constructor() {
 *     _disableInitializers();
 * }
 * ```
 * ====
 */
abstract contract Initializable {
    /**
     * @dev Storage of the initializable contract.
     *
     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions
     * when using with upgradeable contracts.
     *
     * @custom:storage-location erc7201:openzeppelin.storage.Initializable
     */
    struct InitializableStorage {
        /**
         * @dev Indicates that the contract has been initialized.
         */
        uint64 _initialized;
        /**
         * @dev Indicates that the contract is in the process of being initialized.
         */
        bool _initializing;
    }

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.Initializable")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant INITIALIZABLE_STORAGE = 0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00;

    /**
     * @dev The contract is already initialized.
     */
    error InvalidInitialization();

    /**
     * @dev The contract is not initializing.
     */
    error NotInitializing();

    /**
     * @dev Triggered when the contract has been initialized or reinitialized.
     */
    event Initialized(uint64 version);

    /**
     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,
     * `onlyInitializing` functions can be used to initialize parent contracts.
     *
     * Similar to `reinitializer(1)`, except that in the context of a constructor an `initializer` may be invoked any
     * number of times. This behavior in the constructor can be useful during testing and is not expected to be used in
     * production.
     *
     * Emits an {Initialized} event.
     */
    modifier initializer() {
        // solhint-disable-next-line var-name-mixedcase
        InitializableStorage storage $ = _getInitializableStorage();

        // Cache values to avoid duplicated sloads
        bool isTopLevelCall = !$._initializing;
        uint64 initialized = $._initialized;

        // Allowed calls:
        // - initialSetup: the contract is not in the initializing state and no previous version was
        //                 initialized
        // - construction: the contract is initialized at version 1 (no reininitialization) and the
        //                 current contract is just being deployed
        bool initialSetup = initialized == 0 && isTopLevelCall;
        bool construction = initialized == 1 && address(this).code.length == 0;

        if (!initialSetup && !construction) {
            revert InvalidInitialization();
        }
        $._initialized = 1;
        if (isTopLevelCall) {
            $._initializing = true;
        }
        _;
        if (isTopLevelCall) {
            $._initializing = false;
            emit Initialized(1);
        }
    }

    /**
     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the
     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be
     * used to initialize parent contracts.
     *
     * A reinitializer may be used after the original initialization step. This is essential to configure modules that
     * are added through upgrades and that require initialization.
     *
     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`
     * cannot be nested. If one is invoked in the context of another, execution will revert.
     *
     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in
     * a contract, executing them in the right order is up to the developer or operator.
     *
     * WARNING: Setting the version to 2**64 - 1 will prevent any future reinitialization.
     *
     * Emits an {Initialized} event.
     */
    modifier reinitializer(uint64 version) {
        // solhint-disable-next-line var-name-mixedcase
        InitializableStorage storage $ = _getInitializableStorage();

        if ($._initializing || $._initialized >= version) {
            revert InvalidInitialization();
        }
        $._initialized = version;
        $._initializing = true;
        _;
        $._initializing = false;
        emit Initialized(version);
    }

    /**
     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the
     * {initializer} and {reinitializer} modifiers, directly or indirectly.
     */
    modifier onlyInitializing() {
        _checkInitializing();
        _;
    }

    /**
     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.
     */
    function _checkInitializing() internal view virtual {
        if (!_isInitializing()) {
            revert NotInitializing();
        }
    }

    /**
     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.
     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized
     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called
     * through proxies.
     *
     * Emits an {Initialized} event the first time it is successfully executed.
     */
    function _disableInitializers() internal virtual {
        // solhint-disable-next-line var-name-mixedcase
        InitializableStorage storage $ = _getInitializableStorage();

        if ($._initializing) {
            revert InvalidInitialization();
        }
        if ($._initialized != type(uint64).max) {
            $._initialized = type(uint64).max;
            emit Initialized(type(uint64).max);
        }
    }

    /**
     * @dev Returns the highest version that has been initialized. See {reinitializer}.
     */
    function _getInitializedVersion() internal view returns (uint64) {
        return _getInitializableStorage()._initialized;
    }

    /**
     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.
     */
    function _isInitializing() internal view returns (bool) {
        return _getInitializableStorage()._initializing;
    }

    /**
     * @dev Returns a pointer to the storage namespace.
     */
    // solhint-disable-next-line var-name-mixedcase
    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {
        assembly ("memory-safe") {
            $.slot := INITIALIZABLE_STORAGE
        }
    }
}

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

pragma solidity ^0.8.20;

import {IERC1822Proxiable} from "@openzeppelin/contracts/interfaces/draft-IERC1822.sol";
import {ERC1967Utils} from "@openzeppelin/contracts/proxy/ERC1967/ERC1967Utils.sol";
import {Initializable} from "./Initializable.sol";

/**
 * @dev An upgradeability mechanism designed for UUPS proxies. The functions included here can perform an upgrade of an
 * {ERC1967Proxy}, when this contract is set as the implementation behind such a proxy.
 *
 * A security mechanism ensures that an upgrade does not turn off upgradeability accidentally, although this risk is
 * reinstated if the upgrade retains upgradeability but removes the security mechanism, e.g. by replacing
 * `UUPSUpgradeable` with a custom implementation of upgrades.
 *
 * The {_authorizeUpgrade} function must be overridden to include access restriction to the upgrade mechanism.
 */
abstract contract UUPSUpgradeable is Initializable, IERC1822Proxiable {
    /// @custom:oz-upgrades-unsafe-allow state-variable-immutable
    address private immutable __self = address(this);

    /**
     * @dev The version of the upgrade interface of the contract. If this getter is missing, both `upgradeTo(address)`
     * and `upgradeToAndCall(address,bytes)` are present, and `upgradeTo` must be used if no function should be called,
     * while `upgradeToAndCall` will invoke the `receive` function if the second argument is the empty byte string.
     * If the getter returns `"5.0.0"`, only `upgradeToAndCall(address,bytes)` is present, and the second argument must
     * be the empty byte string if no function should be called, making it impossible to invoke the `receive` function
     * during an upgrade.
     */
    string public constant UPGRADE_INTERFACE_VERSION = "5.0.0";

    /**
     * @dev The call is from an unauthorized context.
     */
    error UUPSUnauthorizedCallContext();

    /**
     * @dev The storage `slot` is unsupported as a UUID.
     */
    error UUPSUnsupportedProxiableUUID(bytes32 slot);

    /**
     * @dev Check that the execution is being performed through a delegatecall call and that the execution context is
     * a proxy contract with an implementation (as defined in ERC-1967) pointing to self. This should only be the case
     * for UUPS and transparent proxies that are using the current contract as their implementation. Execution of a
     * function through ERC-1167 minimal proxies (clones) would not normally pass this test, but is not guaranteed to
     * fail.
     */
    modifier onlyProxy() {
        _checkProxy();
        _;
    }

    /**
     * @dev Check that the execution is not being performed through a delegate call. This allows a function to be
     * callable on the implementing contract but not through proxies.
     */
    modifier notDelegated() {
        _checkNotDelegated();
        _;
    }

    function __UUPSUpgradeable_init() internal onlyInitializing {
    }

    function __UUPSUpgradeable_init_unchained() internal onlyInitializing {
    }
    /**
     * @dev Implementation of the ERC-1822 {proxiableUUID} function. This returns the storage slot used by the
     * implementation. It is used to validate the implementation's compatibility when performing an upgrade.
     *
     * IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks
     * bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this
     * function revert if invoked through a proxy. This is guaranteed by the `notDelegated` modifier.
     */
    function proxiableUUID() external view virtual notDelegated returns (bytes32) {
        return ERC1967Utils.IMPLEMENTATION_SLOT;
    }

    /**
     * @dev Upgrade the implementation of the proxy to `newImplementation`, and subsequently execute the function call
     * encoded in `data`.
     *
     * Calls {_authorizeUpgrade}.
     *
     * Emits an {Upgraded} event.
     *
     * @custom:oz-upgrades-unsafe-allow-reachable delegatecall
     */
    function upgradeToAndCall(address newImplementation, bytes memory data) public payable virtual onlyProxy {
        _authorizeUpgrade(newImplementation);
        _upgradeToAndCallUUPS(newImplementation, data);
    }

    /**
     * @dev Reverts if the execution is not performed via delegatecall or the execution
     * context is not of a proxy with an ERC-1967 compliant implementation pointing to self.
     * See {_onlyProxy}.
     */
    function _checkProxy() internal view virtual {
        if (
            address(this) == __self || // Must be called through delegatecall
            ERC1967Utils.getImplementation() != __self // Must be called through an active proxy
        ) {
            revert UUPSUnauthorizedCallContext();
        }
    }

    /**
     * @dev Reverts if the execution is performed via delegatecall.
     * See {notDelegated}.
     */
    function _checkNotDelegated() internal view virtual {
        if (address(this) != __self) {
            // Must not be called through delegatecall
            revert UUPSUnauthorizedCallContext();
        }
    }

    /**
     * @dev Function that should revert when `msg.sender` is not authorized to upgrade the contract. Called by
     * {upgradeToAndCall}.
     *
     * Normally, this function will use an xref:access.adoc[access control] modifier such as {Ownable-onlyOwner}.
     *
     * ```solidity
     * function _authorizeUpgrade(address) internal onlyOwner {}
     * ```
     */
    function _authorizeUpgrade(address newImplementation) internal virtual;

    /**
     * @dev Performs an implementation upgrade with a security check for UUPS proxies, and additional setup call.
     *
     * As a security check, {proxiableUUID} is invoked in the new implementation, and the return value
     * is expected to be the implementation slot in ERC-1967.
     *
     * Emits an {IERC1967-Upgraded} event.
     */
    function _upgradeToAndCallUUPS(address newImplementation, bytes memory data) private {
        try IERC1822Proxiable(newImplementation).proxiableUUID() returns (bytes32 slot) {
            if (slot != ERC1967Utils.IMPLEMENTATION_SLOT) {
                revert UUPSUnsupportedProxiableUUID(slot);
            }
            ERC1967Utils.upgradeToAndCall(newImplementation, data);
        } catch {
            // The implementation is not UUPS
            revert ERC1967Utils.ERC1967InvalidImplementation(newImplementation);
        }
    }
}

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

pragma solidity ^0.8.20;

import {IERC1155} from "@openzeppelin/contracts/token/ERC1155/IERC1155.sol";
import {IERC1155MetadataURI} from "@openzeppelin/contracts/token/ERC1155/extensions/IERC1155MetadataURI.sol";
import {ERC1155Utils} from "@openzeppelin/contracts/token/ERC1155/utils/ERC1155Utils.sol";
import {ContextUpgradeable} from "../../utils/ContextUpgradeable.sol";
import {IERC165} from "@openzeppelin/contracts/utils/introspection/IERC165.sol";
import {ERC165Upgradeable} from "../../utils/introspection/ERC165Upgradeable.sol";
import {Arrays} from "@openzeppelin/contracts/utils/Arrays.sol";
import {IERC1155Errors} from "@openzeppelin/contracts/interfaces/draft-IERC6093.sol";
import {Initializable} from "../../proxy/utils/Initializable.sol";

/**
 * @dev Implementation of the basic standard multi-token.
 * See https://eips.ethereum.org/EIPS/eip-1155
 * Originally based on code by Enjin: https://github.com/enjin/erc-1155
 */
abstract contract ERC1155Upgradeable is Initializable, ContextUpgradeable, ERC165Upgradeable, IERC1155, IERC1155MetadataURI, IERC1155Errors {
    using Arrays for uint256[];
    using Arrays for address[];

    /// @custom:storage-location erc7201:openzeppelin.storage.ERC1155
    struct ERC1155Storage {
        mapping(uint256 id => mapping(address account => uint256)) _balances;

        mapping(address account => mapping(address operator => bool)) _operatorApprovals;

        // Used as the URI for all token types by relying on ID substitution, e.g. https://token-cdn-domain/{id}.json
        string _uri;
    }

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.ERC1155")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant ERC1155StorageLocation = 0x88be536d5240c274a3b1d3a1be54482fd9caa294f08c62a7cde569f49a3c4500;

    function _getERC1155Storage() private pure returns (ERC1155Storage storage $) {
        assembly ("memory-safe") {
            $.slot := ERC1155StorageLocation
        }
    }

    /**
     * @dev See {_setURI}.
     */
    function __ERC1155_init(string memory uri_) internal onlyInitializing {
        __ERC1155_init_unchained(uri_);
    }

    function __ERC1155_init_unchained(string memory uri_) internal onlyInitializing {
        _setURI(uri_);
    }

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override(ERC165Upgradeable, IERC165) returns (bool) {
        return
            interfaceId == type(IERC1155).interfaceId ||
            interfaceId == type(IERC1155MetadataURI).interfaceId ||
            super.supportsInterface(interfaceId);
    }

    /**
     * @dev See {IERC1155MetadataURI-uri}.
     *
     * This implementation returns the same URI for *all* token types. It relies
     * on the token type ID substitution mechanism
     * https://eips.ethereum.org/EIPS/eip-1155#metadata[defined in the ERC].
     *
     * Clients calling this function must replace the `\{id\}` substring with the
     * actual token type ID.
     */
    function uri(uint256 /* id */) public view virtual returns (string memory) {
        ERC1155Storage storage $ = _getERC1155Storage();
        return $._uri;
    }

    /**
     * @dev See {IERC1155-balanceOf}.
     */
    function balanceOf(address account, uint256 id) public view virtual returns (uint256) {
        ERC1155Storage storage $ = _getERC1155Storage();
        return $._balances[id][account];
    }

    /**
     * @dev See {IERC1155-balanceOfBatch}.
     *
     * Requirements:
     *
     * - `accounts` and `ids` must have the same length.
     */
    function balanceOfBatch(
        address[] memory accounts,
        uint256[] memory ids
    ) public view virtual returns (uint256[] memory) {
        if (accounts.length != ids.length) {
            revert ERC1155InvalidArrayLength(ids.length, accounts.length);
        }

        uint256[] memory batchBalances = new uint256[](accounts.length);

        for (uint256 i = 0; i < accounts.length; ++i) {
            batchBalances[i] = balanceOf(accounts.unsafeMemoryAccess(i), ids.unsafeMemoryAccess(i));
        }

        return batchBalances;
    }

    /**
     * @dev See {IERC1155-setApprovalForAll}.
     */
    function setApprovalForAll(address operator, bool approved) public virtual {
        _setApprovalForAll(_msgSender(), operator, approved);
    }

    /**
     * @dev See {IERC1155-isApprovedForAll}.
     */
    function isApprovedForAll(address account, address operator) public view virtual returns (bool) {
        ERC1155Storage storage $ = _getERC1155Storage();
        return $._operatorApprovals[account][operator];
    }

    /**
     * @dev See {IERC1155-safeTransferFrom}.
     */
    function safeTransferFrom(address from, address to, uint256 id, uint256 value, bytes memory data) public virtual {
        address sender = _msgSender();
        if (from != sender && !isApprovedForAll(from, sender)) {
            revert ERC1155MissingApprovalForAll(sender, from);
        }
        _safeTransferFrom(from, to, id, value, data);
    }

    /**
     * @dev See {IERC1155-safeBatchTransferFrom}.
     */
    function safeBatchTransferFrom(
        address from,
        address to,
        uint256[] memory ids,
        uint256[] memory values,
        bytes memory data
    ) public virtual {
        address sender = _msgSender();
        if (from != sender && !isApprovedForAll(from, sender)) {
            revert ERC1155MissingApprovalForAll(sender, from);
        }
        _safeBatchTransferFrom(from, to, ids, values, data);
    }

    /**
     * @dev Transfers a `value` amount of tokens of type `id` from `from` to `to`. Will mint (or burn) if `from`
     * (or `to`) is the zero address.
     *
     * Emits a {TransferSingle} event if the arrays contain one element, and {TransferBatch} otherwise.
     *
     * Requirements:
     *
     * - If `to` refers to a smart contract, it must implement either {IERC1155Receiver-onERC1155Received}
     *   or {IERC1155Receiver-onERC1155BatchReceived} and return the acceptance magic value.
     * - `ids` and `values` must have the same length.
     *
     * NOTE: The ERC-1155 acceptance check is not performed in this function. See {_updateWithAcceptanceCheck} instead.
     */
    function _update(address from, address to, uint256[] memory ids, uint256[] memory values) internal virtual {
        ERC1155Storage storage $ = _getERC1155Storage();
        if (ids.length != values.length) {
            revert ERC1155InvalidArrayLength(ids.length, values.length);
        }

        address operator = _msgSender();

        for (uint256 i = 0; i < ids.length; ++i) {
            uint256 id = ids.unsafeMemoryAccess(i);
            uint256 value = values.unsafeMemoryAccess(i);

            if (from != address(0)) {
                uint256 fromBalance = $._balances[id][from];
                if (fromBalance < value) {
                    revert ERC1155InsufficientBalance(from, fromBalance, value, id);
                }
                unchecked {
                    // Overflow not possible: value <= fromBalance
                    $._balances[id][from] = fromBalance - value;
                }
            }

            if (to != address(0)) {
                $._balances[id][to] += value;
            }
        }

        if (ids.length == 1) {
            uint256 id = ids.unsafeMemoryAccess(0);
            uint256 value = values.unsafeMemoryAccess(0);
            emit TransferSingle(operator, from, to, id, value);
        } else {
            emit TransferBatch(operator, from, to, ids, values);
        }
    }

    /**
     * @dev Version of {_update} that performs the token acceptance check by calling
     * {IERC1155Receiver-onERC1155Received} or {IERC1155Receiver-onERC1155BatchReceived} on the receiver address if it
     * contains code (eg. is a smart contract at the moment of execution).
     *
     * IMPORTANT: Overriding this function is discouraged because it poses a reentrancy risk from the receiver. So any
     * update to the contract state after this function would break the check-effect-interaction pattern. Consider
     * overriding {_update} instead.
     */
    function _updateWithAcceptanceCheck(
        address from,
        address to,
        uint256[] memory ids,
        uint256[] memory values,
        bytes memory data
    ) internal virtual {
        _update(from, to, ids, values);
        if (to != address(0)) {
            address operator = _msgSender();
            if (ids.length == 1) {
                uint256 id = ids.unsafeMemoryAccess(0);
                uint256 value = values.unsafeMemoryAccess(0);
                ERC1155Utils.checkOnERC1155Received(operator, from, to, id, value, data);
            } else {
                ERC1155Utils.checkOnERC1155BatchReceived(operator, from, to, ids, values, data);
            }
        }
    }

    /**
     * @dev Transfers a `value` tokens of token type `id` from `from` to `to`.
     *
     * Emits a {TransferSingle} event.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - `from` must have a balance of tokens of type `id` of at least `value` amount.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155Received} and return the
     * acceptance magic value.
     */
    function _safeTransferFrom(address from, address to, uint256 id, uint256 value, bytes memory data) internal {
        if (to == address(0)) {
            revert ERC1155InvalidReceiver(address(0));
        }
        if (from == address(0)) {
            revert ERC1155InvalidSender(address(0));
        }
        (uint256[] memory ids, uint256[] memory values) = _asSingletonArrays(id, value);
        _updateWithAcceptanceCheck(from, to, ids, values, data);
    }

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {_safeTransferFrom}.
     *
     * Emits a {TransferBatch} event.
     *
     * Requirements:
     *
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155BatchReceived} and return the
     * acceptance magic value.
     * - `ids` and `values` must have the same length.
     */
    function _safeBatchTransferFrom(
        address from,
        address to,
        uint256[] memory ids,
        uint256[] memory values,
        bytes memory data
    ) internal {
        if (to == address(0)) {
            revert ERC1155InvalidReceiver(address(0));
        }
        if (from == address(0)) {
            revert ERC1155InvalidSender(address(0));
        }
        _updateWithAcceptanceCheck(from, to, ids, values, data);
    }

    /**
     * @dev Sets a new URI for all token types, by relying on the token type ID
     * substitution mechanism
     * https://eips.ethereum.org/EIPS/eip-1155#metadata[defined in the ERC].
     *
     * By this mechanism, any occurrence of the `\{id\}` substring in either the
     * URI or any of the values in the JSON file at said URI will be replaced by
     * clients with the token type ID.
     *
     * For example, the `https://token-cdn-domain/\{id\}.json` URI would be
     * interpreted by clients as
     * `https://token-cdn-domain/000000000000000000000000000000000000000000000000000000000004cce0.json`
     * for token type ID 0x4cce0.
     *
     * See {uri}.
     *
     * Because these URIs cannot be meaningfully represented by the {URI} event,
     * this function emits no events.
     */
    function _setURI(string memory newuri) internal virtual {
        ERC1155Storage storage $ = _getERC1155Storage();
        $._uri = newuri;
    }

    /**
     * @dev Creates a `value` amount of tokens of type `id`, and assigns them to `to`.
     *
     * Emits a {TransferSingle} event.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155Received} and return the
     * acceptance magic value.
     */
    function _mint(address to, uint256 id, uint256 value, bytes memory data) internal {
        if (to == address(0)) {
            revert ERC1155InvalidReceiver(address(0));
        }
        (uint256[] memory ids, uint256[] memory values) = _asSingletonArrays(id, value);
        _updateWithAcceptanceCheck(address(0), to, ids, values, data);
    }

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {_mint}.
     *
     * Emits a {TransferBatch} event.
     *
     * Requirements:
     *
     * - `ids` and `values` must have the same length.
     * - `to` cannot be the zero address.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155BatchReceived} and return the
     * acceptance magic value.
     */
    function _mintBatch(address to, uint256[] memory ids, uint256[] memory values, bytes memory data) internal {
        if (to == address(0)) {
            revert ERC1155InvalidReceiver(address(0));
        }
        _updateWithAcceptanceCheck(address(0), to, ids, values, data);
    }

    /**
     * @dev Destroys a `value` amount of tokens of type `id` from `from`
     *
     * Emits a {TransferSingle} event.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `from` must have at least `value` amount of tokens of type `id`.
     */
    function _burn(address from, uint256 id, uint256 value) internal {
        if (from == address(0)) {
            revert ERC1155InvalidSender(address(0));
        }
        (uint256[] memory ids, uint256[] memory values) = _asSingletonArrays(id, value);
        _updateWithAcceptanceCheck(from, address(0), ids, values, "");
    }

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {_burn}.
     *
     * Emits a {TransferBatch} event.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `from` must have at least `value` amount of tokens of type `id`.
     * - `ids` and `values` must have the same length.
     */
    function _burnBatch(address from, uint256[] memory ids, uint256[] memory values) internal {
        if (from == address(0)) {
            revert ERC1155InvalidSender(address(0));
        }
        _updateWithAcceptanceCheck(from, address(0), ids, values, "");
    }

    /**
     * @dev Approve `operator` to operate on all of `owner` tokens
     *
     * Emits an {ApprovalForAll} event.
     *
     * Requirements:
     *
     * - `operator` cannot be the zero address.
     */
    function _setApprovalForAll(address owner, address operator, bool approved) internal virtual {
        ERC1155Storage storage $ = _getERC1155Storage();
        if (operator == address(0)) {
            revert ERC1155InvalidOperator(address(0));
        }
        $._operatorApprovals[owner][operator] = approved;
        emit ApprovalForAll(owner, operator, approved);
    }

    /**
     * @dev Creates an array in memory with only one value for each of the elements provided.
     */
    function _asSingletonArrays(
        uint256 element1,
        uint256 element2
    ) private pure returns (uint256[] memory array1, uint256[] memory array2) {
        assembly ("memory-safe") {
            // Load the free memory pointer
            array1 := mload(0x40)
            // Set array length to 1
            mstore(array1, 1)
            // Store the single element at the next word after the length (where content starts)
            mstore(add(array1, 0x20), element1)

            // Repeat for next array locating it right after the first array
            array2 := add(array1, 0x40)
            mstore(array2, 1)
            mstore(add(array2, 0x20), element2)

            // Update the free memory pointer by pointing after the second array
            mstore(0x40, add(array2, 0x40))
        }
    }
}

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

pragma solidity ^0.8.20;
import {Initializable} from "../proxy/utils/Initializable.sol";

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

    function __Context_init_unchained() internal onlyInitializing {
    }
    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/introspection/ERC165.sol)

pragma solidity ^0.8.20;

import {IERC165} from "@openzeppelin/contracts/utils/introspection/IERC165.sol";
import {Initializable} from "../../proxy/utils/Initializable.sol";

/**
 * @dev Implementation of the {IERC165} interface.
 *
 * Contracts that want to implement ERC-165 should inherit from this contract and override {supportsInterface} to check
 * for the additional interface id that will be supported. For example:
 *
 * ```solidity
 * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
 *     return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);
 * }
 * ```
 */
abstract contract ERC165Upgradeable is Initializable, IERC165 {
    function __ERC165_init() internal onlyInitializing {
    }

    function __ERC165_init_unchained() internal onlyInitializing {
    }
    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {
        return interfaceId == type(IERC165).interfaceId;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/draft-IERC1822.sol)

pragma solidity ^0.8.20;

/**
 * @dev ERC-1822: Universal Upgradeable Proxy Standard (UUPS) documents a method for upgradeability through a simplified
 * proxy whose upgrades are fully controlled by the current implementation.
 */
interface IERC1822Proxiable {
    /**
     * @dev Returns the storage slot that the proxiable contract assumes is being used to store the implementation
     * address.
     *
     * IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks
     * bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this
     * function revert if invoked through a proxy.
     */
    function proxiableUUID() external view returns (bytes32);
}

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

pragma solidity ^0.8.20;

/**
 * @dev ERC-1967: Proxy Storage Slots. This interface contains the events defined in the ERC.
 */
interface IERC1967 {
    /**
     * @dev Emitted when the implementation is upgraded.
     */
    event Upgraded(address indexed implementation);

    /**
     * @dev Emitted when the admin account has changed.
     */
    event AdminChanged(address previousAdmin, address newAdmin);

    /**
     * @dev Emitted when the beacon is changed.
     */
    event BeaconUpgraded(address indexed beacon);
}

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

pragma solidity ^0.8.20;

import {IERC165} from "../utils/introspection/IERC165.sol";

/**
 * @dev Interface for the NFT Royalty Standard.
 *
 * A standardized way to retrieve royalty payment information for non-fungible tokens (NFTs) to enable universal
 * support for royalty payments across all NFT marketplaces and ecosystem participants.
 */
interface IERC2981 is IERC165 {
    /**
     * @dev Returns how much royalty is owed and to whom, based on a sale price that may be denominated in any unit of
     * exchange. The royalty amount is denominated and should be paid in that same unit of exchange.
     *
     * NOTE: ERC-2981 allows setting the royalty to 100% of the price. In that case all the price would be sent to the
     * royalty receiver and 0 tokens to the seller. Contracts dealing with royalty should consider empty transfers.
     */
    function royaltyInfo(
        uint256 tokenId,
        uint256 salePrice
    ) external view returns (address receiver, uint256 royaltyAmount);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (proxy/beacon/IBeacon.sol)

pragma solidity ^0.8.20;

/**
 * @dev This is the interface that {BeaconProxy} expects of its beacon.
 */
interface IBeacon {
    /**
     * @dev Must return an address that can be used as a delegate call target.
     *
     * {UpgradeableBeacon} will check that this address is a contract.
     */
    function implementation() external view returns (address);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (proxy/ERC1967/ERC1967Utils.sol)

pragma solidity ^0.8.21;

import {IBeacon} from "../beacon/IBeacon.sol";
import {IERC1967} from "../../interfaces/IERC1967.sol";
import {Address} from "../../utils/Address.sol";
import {StorageSlot} from "../../utils/StorageSlot.sol";

/**
 * @dev This library provides getters and event emitting update functions for
 * https://eips.ethereum.org/EIPS/eip-1967[ERC-1967] slots.
 */
library ERC1967Utils {
    /**
     * @dev Storage slot with the address of the current implementation.
     * This is the keccak-256 hash of "eip1967.proxy.implementation" subtracted by 1.
     */
    // solhint-disable-next-line private-vars-leading-underscore
    bytes32 internal constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;

    /**
     * @dev The `implementation` of the proxy is invalid.
     */
    error ERC1967InvalidImplementation(address implementation);

    /**
     * @dev The `admin` of the proxy is invalid.
     */
    error ERC1967InvalidAdmin(address admin);

    /**
     * @dev The `beacon` of the proxy is invalid.
     */
    error ERC1967InvalidBeacon(address beacon);

    /**
     * @dev An upgrade function sees `msg.value > 0` that may be lost.
     */
    error ERC1967NonPayable();

    /**
     * @dev Returns the current implementation address.
     */
    function getImplementation() internal view returns (address) {
        return StorageSlot.getAddressSlot(IMPLEMENTATION_SLOT).value;
    }

    /**
     * @dev Stores a new address in the ERC-1967 implementation slot.
     */
    function _setImplementation(address newImplementation) private {
        if (newImplementation.code.length == 0) {
            revert ERC1967InvalidImplementation(newImplementation);
        }
        StorageSlot.getAddressSlot(IMPLEMENTATION_SLOT).value = newImplementation;
    }

    /**
     * @dev Performs implementation upgrade with additional setup call if data is nonempty.
     * This function is payable only if the setup call is performed, otherwise `msg.value` is rejected
     * to avoid stuck value in the contract.
     *
     * Emits an {IERC1967-Upgraded} event.
     */
    function upgradeToAndCall(address newImplementation, bytes memory data) internal {
        _setImplementation(newImplementation);
        emit IERC1967.Upgraded(newImplementation);

        if (data.length > 0) {
            Address.functionDelegateCall(newImplementation, data);
        } else {
            _checkNonPayable();
        }
    }

    /**
     * @dev Storage slot with the admin of the contract.
     * This is the keccak-256 hash of "eip1967.proxy.admin" subtracted by 1.
     */
    // solhint-disable-next-line private-vars-leading-underscore
    bytes32 internal constant ADMIN_SLOT = 0xb53127684a568b3173ae13b9f8a6016e243e63b6e8ee1178d6a717850b5d6103;

    /**
     * @dev Returns the current admin.
     *
     * TIP: To get this value clients can read directly from the storage slot shown below (specified by ERC-1967) using
     * the https://eth.wiki/json-rpc/API#eth_getstorageat[`eth_getStorageAt`] RPC call.
     * `0xb53127684a568b3173ae13b9f8a6016e243e63b6e8ee1178d6a717850b5d6103`
     */
    function getAdmin() internal view returns (address) {
        return StorageSlot.getAddressSlot(ADMIN_SLOT).value;
    }

    /**
     * @dev Stores a new address in the ERC-1967 admin slot.
     */
    function _setAdmin(address newAdmin) private {
        if (newAdmin == address(0)) {
            revert ERC1967InvalidAdmin(address(0));
        }
        StorageSlot.getAddressSlot(ADMIN_SLOT).value = newAdmin;
    }

    /**
     * @dev Changes the admin of the proxy.
     *
     * Emits an {IERC1967-AdminChanged} event.
     */
    function changeAdmin(address newAdmin) internal {
        emit IERC1967.AdminChanged(getAdmin(), newAdmin);
        _setAdmin(newAdmin);
    }

    /**
     * @dev The storage slot of the UpgradeableBeacon contract which defines the implementation for this proxy.
     * This is the keccak-256 hash of "eip1967.proxy.beacon" subtracted by 1.
     */
    // solhint-disable-next-line private-vars-leading-underscore
    bytes32 internal constant BEACON_SLOT = 0xa3f0ad74e5423aebfd80d3ef4346578335a9a72aeaee59ff6cb3582b35133d50;

    /**
     * @dev Returns the current beacon.
     */
    function getBeacon() internal view returns (address) {
        return StorageSlot.getAddressSlot(BEACON_SLOT).value;
    }

    /**
     * @dev Stores a new beacon in the ERC-1967 beacon slot.
     */
    function _setBeacon(address newBeacon) private {
        if (newBeacon.code.length == 0) {
            revert ERC1967InvalidBeacon(newBeacon);
        }

        StorageSlot.getAddressSlot(BEACON_SLOT).value = newBeacon;

        address beaconImplementation = IBeacon(newBeacon).implementation();
        if (beaconImplementation.code.length == 0) {
            revert ERC1967InvalidImplementation(beaconImplementation);
        }
    }

    /**
     * @dev Change the beacon and trigger a setup call if data is nonempty.
     * This function is payable only if the setup call is performed, otherwise `msg.value` is rejected
     * to avoid stuck value in the contract.
     *
     * Emits an {IERC1967-BeaconUpgraded} event.
     *
     * CAUTION: Invoking this function has no effect on an instance of {BeaconProxy} since v5, since
     * it uses an immutable beacon without looking at the value of the ERC-1967 beacon slot for
     * efficiency.
     */
    function upgradeBeaconToAndCall(address newBeacon, bytes memory data) internal {
        _setBeacon(newBeacon);
        emit IERC1967.BeaconUpgraded(newBeacon);

        if (data.length > 0) {
            Address.functionDelegateCall(IBeacon(newBeacon).implementation(), data);
        } else {
            _checkNonPayable();
        }
    }

    /**
     * @dev Reverts if `msg.value` is not zero. It can be used to avoid `msg.value` stuck in the contract
     * if an upgrade doesn't perform an initialization call.
     */
    function _checkNonPayable() private {
        if (msg.value > 0) {
            revert ERC1967NonPayable();
        }
    }
}

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

pragma solidity ^0.8.20;

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

/**
 * @dev Interface of the optional ERC1155MetadataExtension interface, as defined
 * in the https://eips.ethereum.org/EIPS/eip-1155#metadata-extensions[ERC].
 */
interface IERC1155MetadataURI is IERC1155 {
    /**
     * @dev Returns the URI for token type `id`.
     *
     * If the `\{id\}` substring is present in the URI, it must be replaced by
     * clients with the actual token type ID.
     */
    function uri(uint256 id) external view returns (string memory);
}

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

pragma solidity ^0.8.20;

import {IERC165} from "../../utils/introspection/IERC165.sol";

/**
 * @dev Required interface of an ERC-1155 compliant contract, as defined in the
 * https://eips.ethereum.org/EIPS/eip-1155[ERC].
 */
interface IERC1155 is IERC165 {
    /**
     * @dev Emitted when `value` amount of tokens of type `id` are transferred from `from` to `to` by `operator`.
     */
    event TransferSingle(address indexed operator, address indexed from, address indexed to, uint256 id, uint256 value);

    /**
     * @dev Equivalent to multiple {TransferSingle} events, where `operator`, `from` and `to` are the same for all
     * transfers.
     */
    event TransferBatch(
        address indexed operator,
        address indexed from,
        address indexed to,
        uint256[] ids,
        uint256[] values
    );

    /**
     * @dev Emitted when `account` grants or revokes permission to `operator` to transfer their tokens, according to
     * `approved`.
     */
    event ApprovalForAll(address indexed account, address indexed operator, bool approved);

    /**
     * @dev Emitted when the URI for token type `id` changes to `value`, if it is a non-programmatic URI.
     *
     * If an {URI} event was emitted for `id`, the standard
     * https://eips.ethereum.org/EIPS/eip-1155#metadata-extensions[guarantees] that `value` will equal the value
     * returned by {IERC1155MetadataURI-uri}.
     */
    event URI(string value, uint256 indexed id);

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

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {balanceOf}.
     *
     * Requirements:
     *
     * - `accounts` and `ids` must have the same length.
     */
    function balanceOfBatch(
        address[] calldata accounts,
        uint256[] calldata ids
    ) external view returns (uint256[] memory);

    /**
     * @dev Grants or revokes permission to `operator` to transfer the caller's tokens, according to `approved`,
     *
     * Emits an {ApprovalForAll} event.
     *
     * Requirements:
     *
     * - `operator` cannot be the zero address.
     */
    function setApprovalForAll(address operator, bool approved) external;

    /**
     * @dev Returns true if `operator` is approved to transfer ``account``'s tokens.
     *
     * See {setApprovalForAll}.
     */
    function isApprovedForAll(address account, address operator) external view returns (bool);

    /**
     * @dev Transfers a `value` amount of tokens of type `id` from `from` to `to`.
     *
     * WARNING: This function can potentially allow a reentrancy attack when transferring tokens
     * to an untrusted contract, when invoking {onERC1155Received} on the receiver.
     * Ensure to follow the checks-effects-interactions pattern and consider employing
     * reentrancy guards when interacting with untrusted contracts.
     *
     * Emits a {TransferSingle} event.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - If the caller is not `from`, it must have been approved to spend ``from``'s tokens via {setApprovalForAll}.
     * - `from` must have a balance of tokens of type `id` of at least `value` amount.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155Received} and return the
     * acceptance magic value.
     */
    function safeTransferFrom(address from, address to, uint256 id, uint256 value, bytes calldata data) external;

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {safeTransferFrom}.
     *
     * WARNING: This function can potentially allow a reentrancy attack when transferring tokens
     * to an untrusted contract, when invoking {onERC1155BatchReceived} on the receiver.
     * Ensure to follow the checks-effects-interactions pattern and consider employing
     * reentrancy guards when interacting with untrusted contracts.
     *
     * Emits either a {TransferSingle} or a {TransferBatch} event, depending on the length of the array arguments.
     *
     * Requirements:
     *
     * - `ids` and `values` must have the same length.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155BatchReceived} and return the
     * acceptance magic value.
     */
    function safeBatchTransferFrom(
        address from,
        address to,
        uint256[] calldata ids,
        uint256[] calldata values,
        bytes calldata data
    ) external;
}

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

pragma solidity ^0.8.20;

import {IERC165} from "../../utils/introspection/IERC165.sol";

/**
 * @dev Interface that must be implemented by smart contracts in order to receive
 * ERC-1155 token transfers.
 */
interface IERC1155Receiver is IERC165 {
    /**
     * @dev Handles the receipt of a single ERC-1155 token type. This function is
     * called at the end of a `safeTransferFrom` after the balance has been updated.
     *
     * NOTE: To accept the transfer, this must return
     * `bytes4(keccak256("onERC1155Received(address,address,uint256,uint256,bytes)"))`
     * (i.e. 0xf23a6e61, or its own function selector).
     *
     * @param operator The address which initiated the transfer (i.e. msg.sender)
     * @param from The address which previously owned the token
     * @param id The ID of the token being transferred
     * @param value The amount of tokens being transferred
     * @param data Additional data with no specified format
     * @return `bytes4(keccak256("onERC1155Received(address,address,uint256,uint256,bytes)"))` if transfer is allowed
     */
    function onERC1155Received(
        address operator,
        address from,
        uint256 id,
        uint256 value,
        bytes calldata data
    ) external returns (bytes4);

    /**
     * @dev Handles the receipt of a multiple ERC-1155 token types. This function
     * is called at the end of a `safeBatchTransferFrom` after the balances have
     * been updated.
     *
     * NOTE: To accept the transfer(s), this must return
     * `bytes4(keccak256("onERC1155BatchReceived(address,address,uint256[],uint256[],bytes)"))`
     * (i.e. 0xbc197c81, or its own function selector).
     *
     * @param operator The address which initiated the batch transfer (i.e. msg.sender)
     * @param from The address which previously owned the token
     * @param ids An array containing ids of each token being transferred (order and length must match values array)
     * @param values An array containing amounts of each token being transferred (order and length must match ids array)
     * @param data Additional data with no specified format
     * @return `bytes4(keccak256("onERC1155BatchReceived(address,address,uint256[],uint256[],bytes)"))` if transfer is allowed
     */
    function onERC1155BatchReceived(
        address operator,
        address from,
        uint256[] calldata ids,
        uint256[] calldata values,
        bytes calldata data
    ) external returns (bytes4);
}

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

pragma solidity ^0.8.20;

import {IERC1155Receiver} from "../IERC1155Receiver.sol";
import {IERC1155Errors} from "../../../interfaces/draft-IERC6093.sol";

/**
 * @dev Library that provide common ERC-1155 utility functions.
 *
 * See https://eips.ethereum.org/EIPS/eip-1155[ERC-1155].
 *
 * _Available since v5.1._
 */
library ERC1155Utils {
    /**
     * @dev Performs an acceptance check for the provided `operator` by calling {IERC1155-onERC1155Received}
     * on the `to` address. The `operator` is generally the address that initiated the token transfer (i.e. `msg.sender`).
     *
     * The acceptance call is not executed and treated as a no-op if the target address doesn't contain code (i.e. an EOA).
     * Otherwise, the recipient must implement {IERC1155Receiver-onERC1155Received} and return the acceptance magic value to accept
     * the transfer.
     */
    function checkOnERC1155Received(
        address operator,
        address from,
        address to,
        uint256 id,
        uint256 value,
        bytes memory data
    ) internal {
        if (to.code.length > 0) {
            try IERC1155Receiver(to).onERC1155Received(operator, from, id, value, data) returns (bytes4 response) {
                if (response != IERC1155Receiver.onERC1155Received.selector) {
                    // Tokens rejected
                    revert IERC1155Errors.ERC1155InvalidReceiver(to);
                }
            } catch (bytes memory reason) {
                if (reason.length == 0) {
                    // non-IERC1155Receiver implementer
                    revert IERC1155Errors.ERC1155InvalidReceiver(to);
                } else {
                    assembly ("memory-safe") {
                        revert(add(32, reason), mload(reason))
                    }
                }
            }
        }
    }

    /**
     * @dev Performs a batch acceptance check for the provided `operator` by calling {IERC1155-onERC1155BatchReceived}
     * on the `to` address. The `operator` is generally the address that initiated the token transfer (i.e. `msg.sender`).
     *
     * The acceptance call is not executed and treated as a no-op if the target address doesn't contain code (i.e. an EOA).
     * Otherwise, the recipient must implement {IERC1155Receiver-onERC1155Received} and return the acceptance magic value to accept
     * the transfer.
     */
    function checkOnERC1155BatchReceived(
        address operator,
        address from,
        address to,
        uint256[] memory ids,
        uint256[] memory values,
        bytes memory data
    ) internal {
        if (to.code.length > 0) {
            try IERC1155Receiver(to).onERC1155BatchReceived(operator, from, ids, values, data) returns (
                bytes4 response
            ) {
                if (response != IERC1155Receiver.onERC1155BatchReceived.selector) {
                    // Tokens rejected
                    revert IERC1155Errors.ERC1155InvalidReceiver(to);
                }
            } catch (bytes memory reason) {
                if (reason.length == 0) {
                    // non-IERC1155Receiver implementer
                    revert IERC1155Errors.ERC1155InvalidReceiver(to);
                } else {
                    assembly ("memory-safe") {
                        revert(add(32, reason), mload(reason))
                    }
                }
            }
        }
    }
}

// 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.1.0) (utils/Address.sol)

pragma solidity ^0.8.20;

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

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev There's no code at `target` (it is not a contract).
     */
    error AddressEmptyCode(address target);

    /**
     * @dev Replacement for Solidity's `transfer`: sends `amount` wei to
     * `recipient`, forwarding all available gas and reverting on errors.
     *
     * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
     * of certain opcodes, possibly making contracts go over the 2300 gas limit
     * imposed by `transfer`, making them unable to receive funds via
     * `transfer`. {sendValue} removes this limitation.
     *
     * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].
     *
     * IMPORTANT: because control is transferred to `recipient`, care must be
     * taken to not create reentrancy vulnerabilities. Consider using
     * {ReentrancyGuard} or the
     * https://solidity.readthedocs.io/en/v0.8.20/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
     */
    function sendValue(address payable recipient, uint256 amount) internal {
        if (address(this).balance < amount) {
            revert Errors.InsufficientBalance(address(this).balance, amount);
        }

        (bool success, ) = recipient.call{value: amount}("");
        if (!success) {
            revert Errors.FailedCall();
        }
    }

    /**
     * @dev Performs a Solidity function call using a low level `call`. A
     * plain `call` is an unsafe replacement for a function call: use this
     * function instead.
     *
     * If `target` reverts with a revert reason or custom error, it is bubbled
     * up by this function (like regular Solidity function calls). However, if
     * the call reverted with no returned reason, this function reverts with a
     * {Errors.FailedCall} error.
     *
     * Returns the raw returned data. To convert to the expected return value,
     * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
     *
     * Requirements:
     *
     * - `target` must be a contract.
     * - calling `target` with `data` must not revert.
     */
    function functionCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but also transferring `value` wei to `target`.
     *
     * Requirements:
     *
     * - the calling contract must have an ETH balance of at least `value`.
     * - the called Solidity function must be `payable`.
     */
    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {
        if (address(this).balance < value) {
            revert Errors.InsufficientBalance(address(this).balance, value);
        }
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a static call.
     */
    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
        (bool success, bytes memory returndata) = target.staticcall(data);
        return verifyCallResultFromTarget(target, success, returndata);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a delegate call.
     */
    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
        (bool success, bytes memory returndata) = target.delegatecall(data);
        return verifyCallResultFromTarget(target, success, returndata);
    }

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and reverts if the target
     * was not a contract or bubbling up the revert reason (falling back to {Errors.FailedCall}) in case
     * of an unsuccessful call.
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata
    ) internal view returns (bytes memory) {
        if (!success) {
            _revert(returndata);
        } else {
            // only check if target is a contract if the call was successful and the return data is empty
            // otherwise we already know that it was a contract
            if (returndata.length == 0 && target.code.length == 0) {
                revert AddressEmptyCode(target);
            }
            return returndata;
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and reverts if it wasn't, either by bubbling the
     * revert reason or with a default {Errors.FailedCall} error.
     */
    function verifyCallResult(bool success, bytes memory returndata) internal pure returns (bytes memory) {
        if (!success) {
            _revert(returndata);
        } else {
            return returndata;
        }
    }

    /**
     * @dev Reverts with returndata if present. Otherwise reverts with {Errors.FailedCall}.
     */
    function _revert(bytes memory returndata) private pure {
        // Look for revert reason and bubble it up if present
        if (returndata.length > 0) {
            // The easiest way to bubble the revert reason is using memory via assembly
            assembly ("memory-safe") {
                let returndata_size := mload(returndata)
                revert(add(32, returndata), returndata_size)
            }
        } else {
            revert Errors.FailedCall();
        }
    }
}

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

pragma solidity ^0.8.20;

import {Comparators} from "./Comparators.sol";
import {SlotDerivation} from "./SlotDerivation.sol";
import {StorageSlot} from "./StorageSlot.sol";
import {Math} from "./math/Math.sol";

/**
 * @dev Collection of functions related to array types.
 */
library Arrays {
    using SlotDerivation for bytes32;
    using StorageSlot for bytes32;

    /**
     * @dev Sort an array of uint256 (in memory) following the provided comparator function.
     *
     * This function does the sorting "in place", meaning that it overrides the input. The object is returned for
     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
     *
     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
     * consume more gas than is available in a block, leading to potential DoS.
     *
     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
     */
    function sort(
        uint256[] memory array,
        function(uint256, uint256) pure returns (bool) comp
    ) internal pure returns (uint256[] memory) {
        _quickSort(_begin(array), _end(array), comp);
        return array;
    }

    /**
     * @dev Variant of {sort} that sorts an array of uint256 in increasing order.
     */
    function sort(uint256[] memory array) internal pure returns (uint256[] memory) {
        sort(array, Comparators.lt);
        return array;
    }

    /**
     * @dev Sort an array of address (in memory) following the provided comparator function.
     *
     * This function does the sorting "in place", meaning that it overrides the input. The object is returned for
     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
     *
     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
     * consume more gas than is available in a block, leading to potential DoS.
     *
     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
     */
    function sort(
        address[] memory array,
        function(address, address) pure returns (bool) comp
    ) internal pure returns (address[] memory) {
        sort(_castToUint256Array(array), _castToUint256Comp(comp));
        return array;
    }

    /**
     * @dev Variant of {sort} that sorts an array of address in increasing order.
     */
    function sort(address[] memory array) internal pure returns (address[] memory) {
        sort(_castToUint256Array(array), Comparators.lt);
        return array;
    }

    /**
     * @dev Sort an array of bytes32 (in memory) following the provided comparator function.
     *
     * This function does the sorting "in place", meaning that it overrides the input. The object is returned for
     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
     *
     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
     * consume more gas than is available in a block, leading to potential DoS.
     *
     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
     */
    function sort(
        bytes32[] memory array,
        function(bytes32, bytes32) pure returns (bool) comp
    ) internal pure returns (bytes32[] memory) {
        sort(_castToUint256Array(array), _castToUint256Comp(comp));
        return array;
    }

    /**
     * @dev Variant of {sort} that sorts an array of bytes32 in increasing order.
     */
    function sort(bytes32[] memory array) internal pure returns (bytes32[] memory) {
        sort(_castToUint256Array(array), Comparators.lt);
        return array;
    }

    /**
     * @dev Performs a quick sort of a segment of memory. The segment sorted starts at `begin` (inclusive), and stops
     * at end (exclusive). Sorting follows the `comp` comparator.
     *
     * Invariant: `begin <= end`. This is the case when initially called by {sort} and is preserved in subcalls.
     *
     * IMPORTANT: Memory locations between `begin` and `end` are not validated/zeroed. This function should
     * be used only if the limits are within a memory array.
     */
    function _quickSort(uint256 begin, uint256 end, function(uint256, uint256) pure returns (bool) comp) private pure {
        unchecked {
            if (end - begin < 0x40) return;

            // Use first element as pivot
            uint256 pivot = _mload(begin);
            // Position where the pivot should be at the end of the loop
            uint256 pos = begin;

            for (uint256 it = begin + 0x20; it < end; it += 0x20) {
                if (comp(_mload(it), pivot)) {
                    // If the value stored at the iterator's position comes before the pivot, we increment the
                    // position of the pivot and move the value there.
                    pos += 0x20;
                    _swap(pos, it);
                }
            }

            _swap(begin, pos); // Swap pivot into place
            _quickSort(begin, pos, comp); // Sort the left side of the pivot
            _quickSort(pos + 0x20, end, comp); // Sort the right side of the pivot
        }
    }

    /**
     * @dev Pointer to the memory location of the first element of `array`.
     */
    function _begin(uint256[] memory array) private pure returns (uint256 ptr) {
        assembly ("memory-safe") {
            ptr := add(array, 0x20)
        }
    }

    /**
     * @dev Pointer to the memory location of the first memory word (32bytes) after `array`. This is the memory word
     * that comes just after the last element of the array.
     */
    function _end(uint256[] memory array) private pure returns (uint256 ptr) {
        unchecked {
            return _begin(array) + array.length * 0x20;
        }
    }

    /**
     * @dev Load memory word (as a uint256) at location `ptr`.
     */
    function _mload(uint256 ptr) private pure returns (uint256 value) {
        assembly ("memory-safe") {
            value := mload(ptr)
        }
    }

    /**
     * @dev Swaps the elements memory location `ptr1` and `ptr2`.
     */
    function _swap(uint256 ptr1, uint256 ptr2) private pure {
        assembly ("memory-safe") {
            let value1 := mload(ptr1)
            let value2 := mload(ptr2)
            mstore(ptr1, value2)
            mstore(ptr2, value1)
        }
    }

    /// @dev Helper: low level cast address memory array to uint256 memory array
    function _castToUint256Array(address[] memory input) private pure returns (uint256[] memory output) {
        assembly ("memory-safe") {
            output := input
        }
    }

    /// @dev Helper: low level cast bytes32 memory array to uint256 memory array
    function _castToUint256Array(bytes32[] memory input) private pure returns (uint256[] memory output) {
        assembly ("memory-safe") {
            output := input
        }
    }

    /// @dev Helper: low level cast address comp function to uint256 comp function
    function _castToUint256Comp(
        function(address, address) pure returns (bool) input
    ) private pure returns (function(uint256, uint256) pure returns (bool) output) {
        assembly ("memory-safe") {
            output := input
        }
    }

    /// @dev Helper: low level cast bytes32 comp function to uint256 comp function
    function _castToUint256Comp(
        function(bytes32, bytes32) pure returns (bool) input
    ) private pure returns (function(uint256, uint256) pure returns (bool) output) {
        assembly ("memory-safe") {
            output := input
        }
    }

    /**
     * @dev Searches a sorted `array` and returns the first index that contains
     * a value greater or equal to `element`. If no such index exists (i.e. all
     * values in the array are strictly less than `element`), the array length is
     * returned. Time complexity O(log n).
     *
     * NOTE: The `array` is expected to be sorted in ascending order, and to
     * contain no repeated elements.
     *
     * IMPORTANT: Deprecated. This implementation behaves as {lowerBound} but lacks
     * support for repeated elements in the array. The {lowerBound} function should
     * be used instead.
     */
    function findUpperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

        if (high == 0) {
            return 0;
        }

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeAccess(array, mid).value > element) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }

        // At this point `low` is the exclusive upper bound. We will return the inclusive upper bound.
        if (low > 0 && unsafeAccess(array, low - 1).value == element) {
            return low - 1;
        } else {
            return low;
        }
    }

    /**
     * @dev Searches an `array` sorted in ascending order and returns the first
     * index that contains a value greater or equal than `element`. If no such index
     * exists (i.e. all values in the array are strictly less than `element`), the array
     * length is returned. Time complexity O(log n).
     *
     * See C++'s https://en.cppreference.com/w/cpp/algorithm/lower_bound[lower_bound].
     */
    function lowerBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

        if (high == 0) {
            return 0;
        }

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeAccess(array, mid).value < element) {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            } else {
                high = mid;
            }
        }

        return low;
    }

    /**
     * @dev Searches an `array` sorted in ascending order and returns the first
     * index that contains a value strictly greater than `element`. If no such index
     * exists (i.e. all values in the array are strictly less than `element`), the array
     * length is returned. Time complexity O(log n).
     *
     * See C++'s https://en.cppreference.com/w/cpp/algorithm/upper_bound[upper_bound].
     */
    function upperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

        if (high == 0) {
            return 0;
        }

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeAccess(array, mid).value > element) {
                high = mid;
            } else {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            }
        }

        return low;
    }

    /**
     * @dev Same as {lowerBound}, but with an array in memory.
     */
    function lowerBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

        if (high == 0) {
            return 0;
        }

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeMemoryAccess(array, mid) < element) {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            } else {
                high = mid;
            }
        }

        return low;
    }

    /**
     * @dev Same as {upperBound}, but with an array in memory.
     */
    function upperBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

        if (high == 0) {
            return 0;
        }

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeMemoryAccess(array, mid) > element) {
                high = mid;
            } else {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            }
        }

        return low;
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeAccess(address[] storage arr, uint256 pos) internal pure returns (StorageSlot.AddressSlot storage) {
        bytes32 slot;
        assembly ("memory-safe") {
            slot := arr.slot
        }
        return slot.deriveArray().offset(pos).getAddressSlot();
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeAccess(bytes32[] storage arr, uint256 pos) internal pure returns (StorageSlot.Bytes32Slot storage) {
        bytes32 slot;
        assembly ("memory-safe") {
            slot := arr.slot
        }
        return slot.deriveArray().offset(pos).getBytes32Slot();
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeAccess(uint256[] storage arr, uint256 pos) internal pure returns (StorageSlot.Uint256Slot storage) {
        bytes32 slot;
        assembly ("memory-safe") {
            slot := arr.slot
        }
        return slot.deriveArray().offset(pos).getUint256Slot();
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeMemoryAccess(address[] memory arr, uint256 pos) internal pure returns (address res) {
        assembly ("memory-safe") {
            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
        }
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeMemoryAccess(bytes32[] memory arr, uint256 pos) internal pure returns (bytes32 res) {
        assembly ("memory-safe") {
            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
        }
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeMemoryAccess(uint256[] memory arr, uint256 pos) internal pure returns (uint256 res) {
        assembly ("memory-safe") {
            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
        }
    }

    /**
     * @dev Helper to set the length of an dynamic array. Directly writing to `.length` is forbidden.
     *
     * WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
     */
    function unsafeSetLength(address[] storage array, uint256 len) internal {
        assembly ("memory-safe") {
            sstore(array.slot, len)
        }
    }

    /**
     * @dev Helper to set the length of an dynamic array. Directly writing to `.length` is forbidden.
     *
     * WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
     */
    function unsafeSetLength(bytes32[] storage array, uint256 len) internal {
        assembly ("memory-safe") {
            sstore(array.slot, len)
        }
    }

    /**
     * @dev Helper to set the length of an dynamic array. Directly writing to `.length` is forbidden.
     *
     * WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
     */
    function unsafeSetLength(uint256[] storage array, uint256 len) internal {
        assembly ("memory-safe") {
            sstore(array.slot, len)
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Provides a set of functions to compare values.
 *
 * _Available since v5.1._
 */
library Comparators {
    function lt(uint256 a, uint256 b) internal pure returns (bool) {
        return a < b;
    }

    function gt(uint256 a, uint256 b) internal pure returns (bool) {
        return a > b;
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Collection of common custom errors used in multiple contracts
 *
 * IMPORTANT: Backwards compatibility is not guaranteed in future versions of the library.
 * It is recommended to avoid relying on the error API for critical functionality.
 *
 * _Available since v5.1._
 */
library Errors {
    /**
     * @dev The ETH balance of the account is not enough to perform the operation.
     */
    error InsufficientBalance(uint256 balance, uint256 needed);

    /**
     * @dev A call to an address target failed. The target may have reverted.
     */
    error FailedCall();

    /**
     * @dev The deployment failed.
     */
    error FailedDeployment();

    /**
     * @dev A necessary precompile is missing.
     */
    error MissingPrecompile(address);
}

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

pragma solidity ^0.8.20;

/**
 * @dev Interface of the ERC-165 standard, as defined in the
 * https://eips.ethereum.org/EIPS/eip-165[ERC].
 *
 * Implementers can declare support of contract interfaces, which can then be
 * queried by others ({ERC165Checker}).
 *
 * For an implementation, see {ERC165}.
 */
interface IERC165 {
    /**
     * @dev Returns true if this contract implements the interface defined by
     * `interfaceId`. See the corresponding
     * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section]
     * to learn more about how these ids are created.
     *
     * This function call must use less than 30 000 gas.
     */
    function supportsInterface(bytes4 interfaceId) external view returns (bool);
}

// 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 ("memory-safe") {
                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 ("memory-safe") {
                // 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 ("memory-safe") {
                // 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/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/SlotDerivation.sol)
// This file was procedurally generated from scripts/generate/templates/SlotDerivation.js.

pragma solidity ^0.8.20;

/**
 * @dev Library for computing storage (and transient storage) locations from namespaces and deriving slots
 * corresponding to standard patterns. The derivation method for array and mapping matches the storage layout used by
 * the solidity language / compiler.
 *
 * See https://docs.soliditylang.org/en/v0.8.20/internals/layout_in_storage.html#mappings-and-dynamic-arrays[Solidity docs for mappings and dynamic arrays.].
 *
 * Example usage:
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using StorageSlot for bytes32;
 *     using SlotDerivation for bytes32;
 *
 *     // Declare a namespace
 *     string private constant _NAMESPACE = "<namespace>" // eg. OpenZeppelin.Slot
 *
 *     function setValueInNamespace(uint256 key, address newValue) internal {
 *         _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value = newValue;
 *     }
 *
 *     function getValueInNamespace(uint256 key) internal view returns (address) {
 *         return _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value;
 *     }
 * }
 * ```
 *
 * TIP: Consider using this library along with {StorageSlot}.
 *
 * NOTE: This library provides a way to manipulate storage locations in a non-standard way. Tooling for checking
 * upgrade safety will ignore the slots accessed through this library.
 *
 * _Available since v5.1._
 */
library SlotDerivation {
    /**
     * @dev Derive an ERC-7201 slot from a string (namespace).
     */
    function erc7201Slot(string memory namespace) internal pure returns (bytes32 slot) {
        assembly ("memory-safe") {
            mstore(0x00, sub(keccak256(add(namespace, 0x20), mload(namespace)), 1))
            slot := and(keccak256(0x00, 0x20), not(0xff))
        }
    }

    /**
     * @dev Add an offset to a slot to get the n-th element of a structure or an array.
     */
    function offset(bytes32 slot, uint256 pos) internal pure returns (bytes32 result) {
        unchecked {
            return bytes32(uint256(slot) + pos);
        }
    }

    /**
     * @dev Derive the location of the first element in an array from the slot where the length is stored.
     */
    function deriveArray(bytes32 slot) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, slot)
            result := keccak256(0x00, 0x20)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, address key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, and(key, shr(96, not(0))))
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, bool key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, iszero(iszero(key)))
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, bytes32 key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, key)
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, uint256 key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, key)
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, int256 key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, key)
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, string memory key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            let length := mload(key)
            let begin := add(key, 0x20)
            let end := add(begin, length)
            let cache := mload(end)
            mstore(end, slot)
            result := keccak256(begin, add(length, 0x20))
            mstore(end, cache)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, bytes memory key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            let length := mload(key)
            let begin := add(key, 0x20)
            let end := add(begin, length)
            let cache := mload(end)
            mstore(end, slot)
            result := keccak256(begin, add(length, 0x20))
            mstore(end, cache)
        }
    }
}

// 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
pragma solidity >=0.8.20;

interface IPaintswapVRFConsumer {
  /**
   * @notice rawFulfillRandomWords handles the VRF response and your contract must implement it!
   *
   * @param requestId The Id initially returned by requestRandomness
   * @param randomWords The VRF output expanded to the requested number of words
   */
  function rawFulfillRandomWords(
    uint256 requestId,
    uint256[] calldata randomWords
  ) external;
}

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

interface IPaintswapVRFCoordinator {
  /* -------------------------------------------------------------------------- */
  /*                                 Events                                     */
  /* -------------------------------------------------------------------------- */

  /// @dev Emitted when a request is made to PaintswapVRFCoordinator
  event RandomWordsRequested(
    uint256 indexed requestId,
    uint256 callbackGasLimit,
    uint256 numWords,
    address indexed origin,
    address indexed consumer,
    uint256 nonce,
    address refundee,
    uint256 gasPricePaid,
    uint256 requestedAt
  );
  /// @dev Emitted when PaintswapVRFCoordinator fulfills a request
  event RandomWordsFulfilled(
    uint256 indexed requestId,
    uint256[] randomWords,
    address indexed oracle,
    bool callSuccess,
    uint256 fulfilledAt
  );
  /// @dev Emitted when a consumer callback is not successful
  event ConsumerCallbackFailed(
    uint256 indexed requestId,
    uint8 indexed reason, // 1 = not enough gas, 2 = no code, 3 = reverted or out of gas
    address indexed target,
    uint256 gasLeft
  );
  /// @dev Emitted when excess gas payment is refunded to the refundee
  event RequestGasRefunded(
    uint256 indexed requestId,
    address indexed refundee,
    uint256 gasRefunded,
    bool refundedSuccessfully
  );
  /// @dev Emitted when the excess gas is refunded to the refundee
  event FulfillmentGasRefunded(
    uint256 indexed requestId,
    address indexed refundee,
    uint256 gasRefunded,
    bool refundedSuccessfully
  );
  /// @dev Emitted when the signer address is updated
  event SignerAddressUpdated(address indexed signerAddress);
  /// @dev Emitted when a new oracle is registered
  event OracleRegistered(address indexed oracle);
  /// @dev Emitted whne the gas price history window is updated
  event GasPriceHistoryWindowUpdated(uint256 newWindow);
  /// @dev Emitted when request limits are updated
  event RandomRequestLimitsUpdated(
    uint32 minimumGasLimit,
    uint32 maximumGasLimit,
    uint16 maxNumWords
  );

  /* -------------------------------------------------------------------------- */
  /*                                 Errors                                     */
  /* -------------------------------------------------------------------------- */

  /// @dev Revert when submitted address is the zero address
  error ZeroAddress();
  /// @dev Revert when the oracle is already registered
  error OracleAlreadyRegistered(address oracle);
  /// @dev Revert when the oracle has an insufficient balance
  error InsufficientOracleBalance(address oracle, uint256 balance);
  /// @dev Revert when the address is not an oracle
  error NotOracle(address invalid);
  /// @dev Revert when the request has an insufficient gas limit to fulfill
  error InsufficientGasLimit(uint256 sent, uint256 required);
  /// @dev Revert when the consumer gas limit is too high
  error OverConsumerGasLimit(uint256 sent, uint256 max);
  /// @dev Revert when the payment is too low for the requested gas limit
  error InsufficientGasPayment(uint256 sent, uint256 required);
  /// @dev Revert when the request has an invalid number of words
  error InvalidNumWords(uint256 numWords, uint256 max);
  /// @dev Revert when the fufillment call does not match the commitment
  error CommitmentMismatch(uint256 requestId);
  /// @dev Revert when the oracle has an invalid public key
  error InvalidPublicKey(
    uint256 requestId,
    address proofSigner,
    address vrfSigner
  );
  /// @dev Revert when the proof is invalid
  error InvalidProof(uint256 requestId);
  /// @dev Revert when the withdraw fails
  error WithdrawFailed(address recipient, uint256 amount);
  /// @dev Revert when the gas price history is invalid
  error InvalidGasPriceHistoryWindow(uint256 window);
  /// @dev Revert when funding has failed
  error FundingFailed(address oracle, uint256 amount);

  /* -------------------------------------------------------------------------- */
  /*                               Oracle structs                               */
  /* -------------------------------------------------------------------------- */

  struct VRFStatistics {
    uint64 totalRequests;
    uint64 totalWordsRequested;
    uint64 successfulFulfillments;
    uint64 failedFulfillments;
  }

  /* -------------------------------------------------------------------------- */
  /*                               Oracle enums                                 */
  /* -------------------------------------------------------------------------- */

  enum CallbackStatus {
    PENDING,
    SUCCESS,
    FAILURE
  }

  /* -------------------------------------------------------------------------- */
  /*                               Oracle methods                               */
  /* -------------------------------------------------------------------------- */

  /// @notice Calculate the payment for a given amount of gas using native currency
  /// @param callbackGasLimit The amount of gas to provide for the callback
  /// @return payment The amount to pay
  function calculateRequestPriceNative(
    uint256 callbackGasLimit
  ) external view returns (uint256 payment);

  /// @notice Request some random words
  ///
  /// @param callbackGasLimit The amount of gas to provide for the callback
  /// @param numWords The number of words to request
  /// @param refundee The address to refund the gas fees to
  /// @return requestId The ID of the request
  function requestRandomnessPayInNative(
    uint256 callbackGasLimit,
    uint256 numWords,
    address refundee
  ) external payable returns (uint256 requestId);

  /// @notice Check to see if a request is pending
  ///
  /// @param requestId The ID of the request
  /// @return isPending True if the request is pending, false otherwise/does not exist
  function isRequestPending(
    uint256 requestId
  ) external view returns (bool isPending);

  /// @notice Fulfill the request for random words
  ///
  /// @param requestId The ID of the request
  /// @param consumer The address to fulfill the request
  /// @param consumer The amount of gas fees paid to fulfill the request
  /// @param numWords The number of words to fulfill
  /// @param refundee The address to refund the gas fees to
  /// @param gasPricePaid The gas price paid for the request
  /// @param publicKey The public key of the oracle
  /// @param proof The proof of the random words
  /// @param uPoint The `u` EC point defined as `U = s*B - c*Y`
  /// @param vComponents The components required to compute `v` as `V = s*H - c*Gamma`
  /// @param proofCtr The proof counter
  /// @return callSuccess If the fulfillment call succeeded
  function fulfillRandomWords(
    uint256 requestId,
    address consumer,
    uint256 callbackGasLimit,
    uint256 numWords,
    address refundee,
    uint256 gasPricePaid,
    uint256[2] memory publicKey,
    uint256[4] memory proof,
    uint256[2] memory uPoint,
    uint256[4] memory vComponents,
    uint8 proofCtr
  ) external returns (bool callSuccess);
}

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

import {IPaintswapVRFCoordinator} from "./interfaces/IPaintswapVRFCoordinator.sol";
import {IPaintswapVRFConsumer} from "./interfaces/IPaintswapVRFConsumer.sol";

/**
 * @title PaintswapVRFConsumerBase
 * @notice Shared logic for VRF consumer contracts (both upgradeable and non-upgradeable).
 * @dev Children must implement `_getVRFCoordinator()` to supply the coordinator reference
 *      and `_fulfillRandomWords()` to process received randomness.
 */
abstract contract PaintswapVRFConsumerBase is IPaintswapVRFConsumer {
  /**
   * @dev Error thrown when a function restricted to the VRF coordinator is called by another address
   * @param sender The address that attempted to call the function
   * @param coordinator The address of the authorized VRF coordinator
   */
  error OnlyVRFCoordinator(address sender, address coordinator);

  /**
   * @dev Error thrown when a zero address is provided where it is not allowed
   */
  error ZeroAddress();

  event VRFCoordinatorSet(address indexed coordinator);

  /**
   * @dev Restricts function access to only the VRF coordinator
   * @notice Functions with this modifier can only be called by the VRF coordinator contract
   */
  modifier onlyCoordinator() {
    IPaintswapVRFCoordinator coord = _getVRFCoordinator();
    if (msg.sender != address(coord)) {
      revert OnlyVRFCoordinator(msg.sender, address(coord));
    }
    _;
  }

  /**
   * @dev Must return the active VRF coordinator reference.
   * @dev Implemented differently by non-upgradeable vs upgradeable variants.
   */
  function _getVRFCoordinator()
    internal
    view
    virtual
    returns (IPaintswapVRFCoordinator);

  /**
   * @dev Calculates the price in native currency for a randomness request
   * @param callbackGasLimit Maximum gas allowed for the fulfillment callback
   * @return requestPrice The price in native currency for the request
   * @notice The price depends on the current gas price and the callback gas limit
   */
  function _calculateRequestPriceNative(
    uint256 callbackGasLimit
  ) internal view returns (uint256 requestPrice) {
    requestPrice = _getVRFCoordinator().calculateRequestPriceNative(
      callbackGasLimit
    );
  }

  /**
   * @dev Requests random words from the VRF coordinator, paying with native currency, specifying a refundee
   * @param callbackGasLimit Maximum gas allowed for the fulfillment callback
   * @param numWords Number of random words to request
   * @param refundee Address to receive any unused gas refund
   * @param gasPayment Amount of native currency to pay for the request
   * @return requestId Unique identifier for this randomness request
   * @notice The contract must have sufficient balance to cover the value parameter
   */
  function _requestRandomnessPayInNative(
    uint256 callbackGasLimit,
    uint256 numWords,
    address refundee,
    uint256 gasPayment
  ) internal returns (uint256 requestId) {
    return
      _getVRFCoordinator().requestRandomnessPayInNative{value: gasPayment}(
        callbackGasLimit,
        numWords,
        refundee
      );
  }

  /**
   * @dev Processes the received random words
   * @param requestId The ID of the request that corresponds to these random words
   * @param randomWords The array of random words received from the VRF coordinator
   * @notice This function must be implemented by the inheriting contract
   */
  function _fulfillRandomWords(
    uint256 requestId,
    uint256[] calldata randomWords
  ) internal virtual;

  /**
   * @dev Callback function called by the VRF coordinator to deliver random words
   * @dev Special care should be taken when overriding this function. Use `_fulfillRandomWords()` instead.
   * @param requestId The ID of the request to which these random words belong
   * @param randomWords The array of random words for the request
   * @notice This function can only be called by the VRF coordinator
   */
  function rawFulfillRandomWords(
    uint256 requestId,
    uint256[] calldata randomWords
  ) external override onlyCoordinator {
    _fulfillRandomWords(requestId, randomWords);
  }
}

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

import {Initializable} from "@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol";

import {IPaintswapVRFCoordinator} from "./interfaces/IPaintswapVRFCoordinator.sol";
import {PaintswapVRFConsumerBase} from "./PaintswapVRFConsumerBase.sol";
import {PaintswapVRFConsumerStorage as VRFS} from "./storage/PaintswapVRFConsumerStorage.sol";

/**
 * @title PaintswapVRFConsumerUpgradeable (UUPS, namespaced storage)
 * @notice Upgradeable VRF consumer base that stores the coordinator in a custom storage slot.
 * @dev Inherit and implement `_fulfillRandomWords`. Call `initialize` instead of a constructor.
 */
abstract contract PaintswapVRFConsumerUpgradeable is
  Initializable,
  PaintswapVRFConsumerBase
{
  /// @custom:oz-upgrades-unsafe-allow constructor
  constructor() {
    _disableInitializers();
  }

  /**
   * @notice Initialize with the VRF coordinator.
   * @param vrfCoordinator Address of the Paintswap VRF coordinator
   */
  function __PaintswapVRFConsumerUpgradeable_init(
    address vrfCoordinator
  ) internal onlyInitializing {
    _setVRFCoordinator(vrfCoordinator);
  }

  /**
   * @notice Set the VRF coordinator
   * @param newCoordinator Address of the new Paintswap VRF coordinator
   */
  function _setVRFCoordinator(address newCoordinator) private {
    require(newCoordinator != address(0), ZeroAddress());
    VRFS.layout().vrfCoordinator = IPaintswapVRFCoordinator(newCoordinator);
    emit VRFCoordinatorSet(newCoordinator);
  }

  /**
   * @notice Get the VRF coordinator
   * @return Address of the Paintswap VRF coordinator
   */
  function _getVRFCoordinator()
    internal
    view
    override
    returns (IPaintswapVRFCoordinator)
  {
    return VRFS.layout().vrfCoordinator;
  }
}

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

import {IPaintswapVRFCoordinator} from "../interfaces/IPaintswapVRFCoordinator.sol";

/**
 * @title PaintswapVRFConsumerStorage
 * @notice ERC-7201 style namespaced storage for the VRF consumer.
 *
 * Namespace: paintswap.storage.vrf-consumer
 * keccak256: 0x55babfd4afb3639f1ad2bd51b6ac6a46a851aaaf7dddc61bc22c3b70fc381d87
 * SLOT:      0x55babfd4afb3639f1ad2bd51b6ac6a46a851aaaf7dddc61bc22c3b70fc381d86
 */
library PaintswapVRFConsumerStorage {
  bytes32 internal constant SLOT =
    0x55babfd4afb3639f1ad2bd51b6ac6a46a851aaaf7dddc61bc22c3b70fc381d86;

  struct Layout {
    IPaintswapVRFCoordinator vrfCoordinator;
  }

  function layout() internal pure returns (Layout storage l) {
    bytes32 slot = SLOT;
    assembly {
      l.slot := slot
    }
  }
}

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

import {UUPSUpgradeable} from "@openzeppelin/contracts-upgradeable/proxy/utils/UUPSUpgradeable.sol";
import {OwnableUpgradeable} from "@openzeppelin/contracts-upgradeable/access/OwnableUpgradeable.sol";

contract AdminAccess is UUPSUpgradeable, OwnableUpgradeable {
  mapping(address admin => bool isAdmin) private _admins;
  mapping(address admin => bool isAdmin) private _promotionalAdmins;

  /// @custom:oz-upgrades-unsafe-allow constructor
  constructor() {
    _disableInitializers();
  }

  function initialize(address[] calldata admins, address[] calldata promotionalAdmins) public initializer {
    __Ownable_init(_msgSender());
    __UUPSUpgradeable_init();

    _updateAdmins(admins, true);
    _updatePromotionalAdmins(promotionalAdmins, true);
  }

  function _updateAdmins(address[] calldata admins, bool hasAdmin) internal {
    uint256 bounds = admins.length;
    for (uint256 i; i < bounds; ++i) {
      _admins[admins[i]] = hasAdmin;
    }
  }

  function _updatePromotionalAdmins(address[] calldata promotionalAdmins, bool hasAdmin) internal {
    uint256 bounds = promotionalAdmins.length;
    for (uint256 i; i < bounds; ++i) {
      _promotionalAdmins[promotionalAdmins[i]] = hasAdmin;
    }
  }

  function isAdmin(address admin) external view returns (bool) {
    return _admins[admin];
  }

  function addAdmins(address[] calldata admins) external onlyOwner {
    _updateAdmins(admins, true);
  }

  function removeAdmins(address[] calldata admins) external onlyOwner {
    _updateAdmins(admins, false);
  }

  function isPromotionalAdmin(address admin) external view returns (bool) {
    return _promotionalAdmins[admin];
  }

  function addPromotionalAdmins(address[] calldata admins) external onlyOwner {
    _updatePromotionalAdmins(admins, true);
  }

  function removePromotionalAdmins(address[] calldata admins) external onlyOwner {
    _updatePromotionalAdmins(admins, false);
  }

  // solhint-disable-next-line no-empty-blocks
  function _authorizeUpgrade(address newImplementation) internal override onlyOwner {}
}

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

import {IPlayers} from "./interfaces/IPlayers.sol";

// solhint-disable-next-line no-global-import
import "./globals/all.sol";

// This file contains methods for interacting with generic functions like trimming strings, lowercase etc.
// Also has some shared functions for rewards
library EstforLibrary {
  error RandomRewardsMustBeInOrder(uint16 chance1, uint16 chance2);
  error RandomRewardNoDuplicates();
  error GuaranteedRewardsNoDuplicates();
  error TooManyGuaranteedRewards();
  error TooManyRandomRewards();

  function isWhitespace(bytes1 _char) internal pure returns (bool) {
    return
      _char == 0x20 || // Space
      _char == 0x09 || // Tab
      _char == 0x0a || // Line feed
      _char == 0x0D || // Carriage return
      _char == 0x0B || // Vertical tab
      _char == 0x00; // empty byte
  }

  function leftTrim(string memory str) internal pure returns (string memory) {
    bytes memory b = bytes(str);
    uint256 strLen = b.length;
    uint256 start = type(uint256).max;
    // Find the index of the first non-whitespace character
    for (uint256 i = 0; i < strLen; ++i) {
      bytes1 char = b[i];
      if (!isWhitespace(char)) {
        start = i;
        break;
      }
    }

    if (start == type(uint256).max) {
      return "";
    }
    // Copy the remainder to a new string
    bytes memory trimmedBytes = new bytes(strLen - start);
    for (uint256 i = start; i < strLen; ++i) {
      trimmedBytes[i - start] = b[i];
    }
    return string(trimmedBytes);
  }

  function rightTrim(string calldata str) internal pure returns (string memory) {
    bytes memory b = bytes(str);
    uint256 strLen = b.length;
    if (strLen == 0) {
      return "";
    }
    int end = -1;
    // Find the index of the last non-whitespace character
    for (int i = int(strLen) - 1; i >= 0; --i) {
      bytes1 char = b[uint256(i)];
      if (!isWhitespace(char)) {
        end = i;
        break;
      }
    }

    if (end == -1) {
      return "";
    }

    bytes memory trimmedBytes = new bytes(uint256(end) + 1);
    for (uint256 i = 0; i <= uint256(end); ++i) {
      trimmedBytes[i] = b[i];
    }
    return string(trimmedBytes);
  }

  function trim(string calldata str) external pure returns (string memory) {
    return leftTrim(rightTrim(str));
  }

  // Assumes the string is already trimmed
  function containsValidNameCharacters(string calldata name) external pure returns (bool) {
    bytes memory b = bytes(name);
    bool lastCharIsWhitespace;
    for (uint256 i = 0; i < b.length; ++i) {
      bytes1 char = b[i];

      bool isUpperCaseLetter = (char >= 0x41) && (char <= 0x5A); // A-Z
      bool isLowerCaseLetter = (char >= 0x61) && (char <= 0x7A); // a-z
      bool isDigit = (char >= 0x30) && (char <= 0x39); // 0-9
      bool isSpecialCharacter = (char == 0x2D) || (char == 0x5F) || (char == 0x2E) || (char == 0x20); // "-", "_", ".", and " "
      bool _isWhitespace = isWhitespace(char);
      bool hasMultipleWhitespaceInRow = lastCharIsWhitespace && _isWhitespace;
      lastCharIsWhitespace = _isWhitespace;
      if ((!isUpperCaseLetter && !isLowerCaseLetter && !isDigit && !isSpecialCharacter) || hasMultipleWhitespaceInRow) {
        return false;
      }
    }
    return true;
  }

  function containsValidDiscordCharacters(string calldata discord) external pure returns (bool) {
    bytes memory discordBytes = bytes(discord);
    for (uint256 i = 0; i < discordBytes.length; ++i) {
      bytes1 char = discordBytes[i];

      bool isUpperCaseLetter = (char >= 0x41) && (char <= 0x5A); // A-Z
      bool isLowerCaseLetter = (char >= 0x61) && (char <= 0x7A); // a-z
      bool isDigit = (char >= 0x30) && (char <= 0x39); // 0-9
      if (!isUpperCaseLetter && !isLowerCaseLetter && !isDigit) {
        return false;
      }
    }

    return true;
  }

  function containsValidTelegramCharacters(string calldata telegram) external pure returns (bool) {
    bytes memory telegramBytes = bytes(telegram);
    for (uint256 i = 0; i < telegramBytes.length; ++i) {
      bytes1 char = telegramBytes[i];

      bool isUpperCaseLetter = (char >= 0x41) && (char <= 0x5A); // A-Z
      bool isLowerCaseLetter = (char >= 0x61) && (char <= 0x7A); // a-z
      bool isDigit = (char >= 0x30) && (char <= 0x39); // 0-9
      bool isPlus = char == 0x2B; // "+"
      if (!isUpperCaseLetter && !isLowerCaseLetter && !isDigit && !isPlus) {
        return false;
      }
    }

    return true;
  }

  function containsValidTwitterCharacters(string calldata twitter) external pure returns (bool) {
    bytes memory twitterBytes = bytes(twitter);
    for (uint256 i = 0; i < twitterBytes.length; ++i) {
      bytes1 char = twitterBytes[i];

      bool isUpperCaseLetter = (char >= 0x41) && (char <= 0x5A); // A-Z
      bool isLowerCaseLetter = (char >= 0x61) && (char <= 0x7A); // a-z
      bool isDigit = (char >= 0x30) && (char <= 0x39); // 0-9
      if (!isUpperCaseLetter && !isLowerCaseLetter && !isDigit) {
        return false;
      }
    }

    return true;
  }

  function containsBaselineSocialNameCharacters(string calldata socialMediaName) external pure returns (bool) {
    bytes memory socialMediaNameBytes = bytes(socialMediaName);
    for (uint256 i = 0; i < socialMediaNameBytes.length; ++i) {
      bytes1 char = socialMediaNameBytes[i];

      bool isUpperCaseLetter = (char >= 0x41) && (char <= 0x5A); // A-Z
      bool isLowerCaseLetter = (char >= 0x61) && (char <= 0x7A); // a-z
      bool isDigit = (char >= 0x30) && (char <= 0x39); // 0-9
      bool isUnderscore = char == 0x5F; // "_"
      bool isPeriod = char == 0x2E; // "."
      bool isPlus = char == 0x2B; // "+"
      if (!isUpperCaseLetter && !isLowerCaseLetter && !isDigit && !isUnderscore && !isPeriod && !isPlus) {
        return false;
      }
    }

    return true;
  }

  function toLower(string memory str) internal pure returns (string memory) {
    bytes memory lowerStr = abi.encodePacked(str);
    for (uint256 i = 0; i < lowerStr.length; ++i) {
      bytes1 char = lowerStr[i];
      if ((char >= 0x41) && (char <= 0x5A)) {
        // So we add 32 to make it lowercase
        lowerStr[i] = bytes1(uint8(char) + 32);
      }
    }
    return string(lowerStr);
  }

  // This should match the one below, useful when a calldata array is needed and for external testing
  function _binarySearchMemory(uint64[] calldata array, uint256 target) internal pure returns (uint256) {
    uint256 low = 0;
    uint256 high = array.length - 1;

    while (low <= high) {
      uint256 mid = low + (high - low) / 2;

      if (array[mid] == target) {
        return mid; // Element found
      } else if (array[mid] < target) {
        low = mid + 1;
      } else {
        // Check to prevent underflow
        if (mid != 0) {
          high = mid - 1;
        } else {
          // If mid is 0 and _arr[mid] is not the target, the element is not in the array
          break;
        }
      }
    }

    return type(uint256).max; // Element not found
  }

  function binarySearchMemory(uint64[] calldata array, uint256 target) external pure returns (uint256) {
    return _binarySearchMemory(array, target);
  }

  // This should match the one above
  function _binarySearch(uint64[] storage array, uint256 target) internal view returns (uint256) {
    uint256 low = 0;
    uint256 high = array.length - 1;

    while (low <= high) {
      uint256 mid = low + (high - low) / 2;

      if (array[mid] == target) {
        return mid; // Element found
      } else if (array[mid] < target) {
        low = mid + 1;
      } else {
        // Check to prevent underflow
        if (mid != 0) {
          high = mid - 1;
        } else {
          // If mid is 0 and _arr[mid] is not the target, the element is not in the array
          break;
        }
      }
    }

    return type(uint256).max; // Element not found
  }

  function binarySearch(uint64[] storage array, uint256 target) external view returns (uint256) {
    return _binarySearch(array, target);
  }

  function _shuffleArray(uint64[] memory array, uint256 randomNumber) internal pure returns (uint64[] memory output) {
    for (uint256 i; i < array.length; ++i) {
      uint256 n = i + (randomNumber % (array.length - i));
      if (i != n) {
        uint64 temp = array[n];
        array[n] = array[i];
        array[i] = temp;
      }
    }
    return array;
  }

  function _getRandomInRange16(
    uint256 randomWord,
    uint256 shift,
    int16 minValue,
    int16 maxValue
  ) internal pure returns (int16) {
    return int16(minValue + (int16(int256((randomWord >> shift) & 0xFFFF) % (maxValue - minValue + 1))));
  }

  function _getRandomFromArray16(
    uint256 randomWord,
    uint256 shift,
    uint16[] storage arr,
    uint256 arrLength
  ) internal view returns (uint16) {
    return arr[_getRandomIndexFromArray16(randomWord, shift, arrLength)];
  }

  function _getRandomFrom3ElementArray16(
    uint256 randomWord,
    uint256 shift,
    uint16[3] memory arr
  ) internal pure returns (uint16) {
    return arr[_getRandomIndexFromArray16(randomWord, shift, arr.length)];
  }

  function _getRandomIndexFromArray16(
    uint256 randomWord,
    uint256 shift,
    uint256 arrLength
  ) internal pure returns (uint16) {
    return uint16(((randomWord >> shift) & 0xFFFF) % arrLength);
  }

  function setActionGuaranteedRewards(
    GuaranteedReward[] calldata guaranteedRewards,
    ActionRewards storage actionRewards
  ) external {
    _setActionGuaranteedRewards(guaranteedRewards, actionRewards);
  }

  function setActionRandomRewards(RandomReward[] calldata randomRewards, ActionRewards storage actionRewards) external {
    _setActionRandomRewards(randomRewards, actionRewards);
  }

  function _setActionGuaranteedRewards(
    GuaranteedReward[] calldata guaranteedRewards,
    ActionRewards storage actionRewards
  ) internal {
    uint256 guaranteedRewardsLength = guaranteedRewards.length;
    if (guaranteedRewardsLength != 0) {
      actionRewards.guaranteedRewardTokenId1 = guaranteedRewards[0].itemTokenId;
      actionRewards.guaranteedRewardRate1 = guaranteedRewards[0].rate;
    }
    if (guaranteedRewardsLength > 1) {
      actionRewards.guaranteedRewardTokenId2 = guaranteedRewards[1].itemTokenId;
      actionRewards.guaranteedRewardRate2 = guaranteedRewards[1].rate;
      require(
        actionRewards.guaranteedRewardTokenId1 != actionRewards.guaranteedRewardTokenId2,
        GuaranteedRewardsNoDuplicates()
      );
    }
    if (guaranteedRewardsLength > 2) {
      actionRewards.guaranteedRewardTokenId3 = guaranteedRewards[2].itemTokenId;
      actionRewards.guaranteedRewardRate3 = guaranteedRewards[2].rate;

      uint256 bounds = guaranteedRewardsLength - 1;
      for (uint256 i; i < bounds; ++i) {
        require(
          guaranteedRewards[i].itemTokenId != guaranteedRewards[guaranteedRewardsLength - 1].itemTokenId,
          GuaranteedRewardsNoDuplicates()
        );
      }
    }
    require(guaranteedRewardsLength <= 3, TooManyGuaranteedRewards());
  }

  // Random rewards have most common one first
  function _setActionRandomRewards(
    RandomReward[] calldata randomRewards,
    ActionRewards storage actionRewards
  ) internal {
    uint256 randomRewardsLength = randomRewards.length;
    if (randomRewardsLength != 0) {
      actionRewards.randomRewardTokenId1 = randomRewards[0].itemTokenId;
      actionRewards.randomRewardChance1 = randomRewards[0].chance;
      actionRewards.randomRewardAmount1 = randomRewards[0].amount;
    }
    if (randomRewardsLength > 1) {
      actionRewards.randomRewardTokenId2 = randomRewards[1].itemTokenId;
      actionRewards.randomRewardChance2 = randomRewards[1].chance;
      actionRewards.randomRewardAmount2 = randomRewards[1].amount;

      require(
        actionRewards.randomRewardChance2 <= actionRewards.randomRewardChance1,
        RandomRewardsMustBeInOrder(randomRewards[0].chance, randomRewards[1].chance)
      );
      require(actionRewards.randomRewardTokenId1 != actionRewards.randomRewardTokenId2, RandomRewardNoDuplicates());
    }
    if (randomRewardsLength > 2) {
      actionRewards.randomRewardTokenId3 = randomRewards[2].itemTokenId;
      actionRewards.randomRewardChance3 = randomRewards[2].chance;
      actionRewards.randomRewardAmount3 = randomRewards[2].amount;

      require(
        actionRewards.randomRewardChance3 <= actionRewards.randomRewardChance2,
        RandomRewardsMustBeInOrder(randomRewards[1].chance, randomRewards[2].chance)
      );

      uint256 bounds = randomRewardsLength - 1;
      for (uint256 i; i < bounds; ++i) {
        require(
          randomRewards[i].itemTokenId != randomRewards[randomRewardsLength - 1].itemTokenId,
          RandomRewardNoDuplicates()
        );
      }
    }
    if (randomRewards.length > 3) {
      actionRewards.randomRewardTokenId4 = randomRewards[3].itemTokenId;
      actionRewards.randomRewardChance4 = randomRewards[3].chance;
      actionRewards.randomRewardAmount4 = randomRewards[3].amount;
      require(
        actionRewards.randomRewardChance4 <= actionRewards.randomRewardChance3,
        RandomRewardsMustBeInOrder(randomRewards[2].chance, randomRewards[3].chance)
      );
      uint256 bounds = randomRewards.length - 1;
      for (uint256 i; i < bounds; ++i) {
        require(
          randomRewards[i].itemTokenId != randomRewards[randomRewards.length - 1].itemTokenId,
          RandomRewardNoDuplicates()
        );
      }
    }

    require(randomRewards.length <= 4, TooManyRandomRewards());
  }

  function _get16bitSlice(bytes memory b, uint256 index) internal pure returns (uint16) {
    uint256 key = index * 2;
    return uint16(b[key] | (bytes2(b[key + 1]) >> 8));
  }

  // Helper function to get random value between min and max (inclusive) for uint8
  function _getRandomInRange8(uint8 minValue, uint8 maxValue, uint8 randomness) internal pure returns (uint8) {
    if (maxValue <= minValue) {
      return minValue;
    }

    uint8 range = maxValue - minValue + 1;
    // Use modulo to get value in range and add minValue
    return uint8((uint16(randomness) % uint16(range)) + uint16(minValue));
  }
}

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

import {Skill, Attire, CombatStyle, CombatStats} from "./misc.sol";
import {GuaranteedReward, RandomReward} from "./rewards.sol";

enum ActionQueueStrategy {
  OVERWRITE,
  APPEND,
  KEEP_LAST_IN_PROGRESS
}

struct QueuedActionInput {
  Attire attire;
  uint16 actionId;
  uint16 regenerateId; // Food (combat), maybe something for non-combat later
  uint16 choiceId; // Melee/Ranged/Magic (combat), logs, ore (non-combat)
  uint16 rightHandEquipmentTokenId; // Axe/Sword/bow, can be empty
  uint16 leftHandEquipmentTokenId; // Shield, can be empty
  uint24 timespan; // How long to queue the action for
  uint8 combatStyle; // CombatStyle specific style of combat
  uint40 petId; // id of the pet (can be empty)
}

struct QueuedAction {
  uint16 actionId;
  uint16 regenerateId; // Food (combat), maybe something for non-combat later
  uint16 choiceId; // Melee/Ranged/Magic (combat), logs, ore (non-combat)
  uint16 rightHandEquipmentTokenId; // Axe/Sword/bow, can be empty
  uint16 leftHandEquipmentTokenId; // Shield, can be empty
  uint24 timespan; // How long to queue the action for
  uint24 prevProcessedTime; // How long the action has been processed for previously
  uint24 prevProcessedXPTime; // How much XP has been gained for this action so far
  uint64 queueId; // id of this queued action
  bytes1 packed; // 1st bit is isValid (not used yet), 2nd bit is for hasPet (decides if the 2nd storage slot is read)
  uint8 combatStyle;
  uint24 reserved;
  // Next storage slot
  uint40 petId; // id of the pet (can be empty)
}

// This is only used as an input arg (and events)
struct ActionInput {
  uint16 actionId;
  ActionInfo info;
  GuaranteedReward[] guaranteedRewards;
  RandomReward[] randomRewards;
  CombatStats combatStats;
}

struct ActionInfo {
  uint8 skill;
  bool actionChoiceRequired; // If true, then the user must choose an action choice
  uint24 xpPerHour;
  uint32 minXP;
  uint24 numSpawned; // Mostly for combat, capped respawn rate for xp/drops. Per hour, base 10000
  uint16 handItemTokenIdRangeMin; // Inclusive
  uint16 handItemTokenIdRangeMax; // Inclusive
  uint8 successPercent; // 0-100
  uint8 worldLocation; // 0 is the main starting world
  bool isFullModeOnly;
  bool isAvailable;
  uint16 questPrerequisiteId;
}

uint16 constant ACTIONCHOICE_MELEE_BASIC_SWORD = 1500;
uint16 constant ACTIONCHOICE_MAGIC_SHADOW_BLAST = 2000;
uint16 constant ACTIONCHOICE_RANGED_BASIC_BOW = 3000;

// Allows for 2, 4 or 8 hour respawn time
uint256 constant SPAWN_MUL = 1000;
uint256 constant RATE_MUL = 1000;
uint256 constant GUAR_MUL = 10; // Guaranteeded reward multiplier (1 decimal, allows for 2 hour action times)

uint256 constant MAX_QUEUEABLE_ACTIONS = 3; // Available slots to queue actions

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

import "./actions.sol";
import "./items.sol";
import "./misc.sol";
import "./players.sol";
import "./rewards.sol";
import "./quests.sol";
import "./promotions.sol";
import "./clans.sol";
import "./pets.sol";

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

import {IBank} from "../interfaces/IBank.sol";

enum ClanRank {
  NONE, // Not in a clan
  COMMONER, // Member of the clan
  SCOUT, // Invite and kick commoners
  COLONEL, // Can launch attacks and assign combatants
  TREASURER, // Can withdraw from bank
  LEADER, // Can edit clan details
  OWNER // Can do everything and transfer ownership
}

enum BattleResultEnum {
  DRAW,
  WIN,
  LOSE
}

struct ClanBattleInfo {
  uint40 lastClanIdAttackOtherClanIdCooldownTimestamp;
  uint8 numReattacks;
  uint40 lastOtherClanIdAttackClanIdCooldownTimestamp;
  uint8 numReattacksOtherClan;
}

// Packed for gas efficiency
struct Vault {
  bool claimed; // Only applies to the first one, if it's claimed without the second one being claimed
  uint40 timestamp;
  uint80 amount;
  uint40 timestamp1;
  uint80 amount1;
}

struct VaultClanInfo {
  IBank bank;
  uint96 totalBrushLocked;
  // New storage slot
  uint40 attackingCooldownTimestamp;
  uint40 assignCombatantsCooldownTimestamp;
  bool currentlyAttacking;
  uint24 defendingVaultsOffset;
  uint40 blockAttacksTimestamp;
  uint8 blockAttacksCooldownHours;
  bool isInMMRArray;
  uint40 superAttackCooldownTimestamp;
  uint64[] playerIds;
  Vault[] defendingVaults; // Append only, and use defendingVaultsOffset to decide where the real start is
}

uint256 constant MAX_CLAN_COMBATANTS = 20;
uint256 constant CLAN_WARS_GAS_PRICE_WINDOW_SIZE = 4;

bool constant XP_EMITTED_ELSEWHERE = true;

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

uint16 constant NONE = 0;

uint16 constant COMBAT_BASE = 2048;
// Melee
uint16 constant SWORD_BASE = COMBAT_BASE;
uint16 constant BRONZE_SWORD = SWORD_BASE;

// Woodcutting (2816 - 3071)
uint16 constant WOODCUTTING_BASE = 2816;
uint16 constant BRONZE_AXE = WOODCUTTING_BASE;

// Firemaking (3328 - 3583)
uint16 constant FIRE_BASE = 3328;
uint16 constant MAGIC_FIRE_STARTER = FIRE_BASE;
uint16 constant FIRE_MAX = FIRE_BASE + 255;

// Fishing (3072 - 3327)
uint16 constant FISHING_BASE = 3072;
uint16 constant NET_STICK = FISHING_BASE;

// Mining (2560 - 2815)
uint16 constant MINING_BASE = 2560;
uint16 constant BRONZE_PICKAXE = MINING_BASE;

// Magic
uint16 constant STAFF_BASE = COMBAT_BASE + 50;
uint16 constant TOTEM_STAFF = STAFF_BASE;

// Ranged
uint16 constant BOW_BASE = COMBAT_BASE + 100;
uint16 constant BASIC_BOW = BOW_BASE;

// Cooked fish
uint16 constant COOKED_FISH_BASE = 11008;
uint16 constant COOKED_FEOLA = COOKED_FISH_BASE + 3;

// Scrolls
uint16 constant SCROLL_BASE = 12032;
uint16 constant SHADOW_SCROLL = SCROLL_BASE;

// Eggs
uint16 constant EGG_BASE = 12544;
uint16 constant SECRET_EGG_1_TIER1 = EGG_BASE;
uint16 constant SECRET_EGG_2_TIER1 = EGG_BASE + 1;
uint16 constant EGG_MAX = 12799;

// Boosts
uint16 constant BOOST_BASE = 12800;
uint16 constant COMBAT_BOOST = BOOST_BASE;
uint16 constant XP_BOOST = BOOST_BASE + 1;
uint16 constant GATHERING_BOOST = BOOST_BASE + 2;
uint16 constant SKILL_BOOST = BOOST_BASE + 3;
uint16 constant ABSENCE_BOOST = BOOST_BASE + 4;
uint16 constant LUCKY_POTION = BOOST_BASE + 5;
uint16 constant LUCK_OF_THE_DRAW = BOOST_BASE + 6;
uint16 constant PRAY_TO_THE_BEARDIE = BOOST_BASE + 7;
uint16 constant PRAY_TO_THE_BEARDIE_2 = BOOST_BASE + 8;
uint16 constant PRAY_TO_THE_BEARDIE_3 = BOOST_BASE + 9;
uint16 constant BOOST_RESERVED_1 = BOOST_BASE + 10;
uint16 constant BOOST_RESERVED_2 = BOOST_BASE + 11;
uint16 constant BOOST_RESERVED_3 = BOOST_BASE + 12;
uint16 constant GO_OUTSIDE = BOOST_BASE + 13;
uint16 constant RAINING_RARES = BOOST_BASE + 14;
uint16 constant CLAN_BOOSTER = BOOST_BASE + 15;
uint16 constant CLAN_BOOSTER_2 = BOOST_BASE + 16;
uint16 constant CLAN_BOOSTER_3 = BOOST_BASE + 17;
uint16 constant BOOST_RESERVED_4 = BOOST_BASE + 18;
uint16 constant BOOST_RESERVED_5 = BOOST_BASE + 19;
uint16 constant BOOST_RESERVED_6 = BOOST_BASE + 20;
uint16 constant BOOST_MAX = 13055;

uint16 constant SPECIAL_BASE = 13312;
uint16 constant SPECIAL_MAX = 13567;

// Miscs
uint16 constant MISC_BASE = 65535;
uint16 constant RAID_PASS = MISC_BASE - 1;

struct BulkTransferInfo {
  uint256[] tokenIds;
  uint256[] amounts;
  address to;
}

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

enum BoostType {
  NONE,
  ANY_XP,
  COMBAT_XP,
  NON_COMBAT_XP,
  GATHERING,
  ABSENCE,
  PASSIVE_SKIP_CHANCE,
  // Clan wars
  PVP_BLOCK,
  PVP_REATTACK,
  PVP_SUPER_ATTACK,
  // Combat stats
  COMBAT_FIXED
}

struct Equipment {
  uint16 itemTokenId;
  uint24 amount;
}

enum Skill {
  NONE,
  COMBAT, // This is a helper which incorporates all combat skills, attack <-> magic, defence, health etc
  MELEE,
  RANGED,
  MAGIC,
  DEFENCE,
  HEALTH,
  RESERVED_COMBAT,
  MINING,
  WOODCUTTING,
  FISHING,
  SMITHING,
  THIEVING,
  CRAFTING,
  COOKING,
  FIREMAKING,
  FARMING,
  ALCHEMY,
  FLETCHING,
  FORGING,
  RESERVED2,
  RESERVED3,
  RESERVED4,
  RESERVED5,
  RESERVED6,
  RESERVED7,
  RESERVED8,
  RESERVED9,
  RESERVED10,
  RESERVED11,
  RESERVED12,
  RESERVED13,
  RESERVED14,
  RESERVED15,
  RESERVED16,
  RESERVED17,
  RESERVED18,
  RESERVED19,
  RESERVED20,
  TRAVELING // Helper Skill for travelling
}

struct Attire {
  uint16 head;
  uint16 neck;
  uint16 body;
  uint16 arms;
  uint16 legs;
  uint16 feet;
  uint16 ring;
  uint16 reserved1;
}

struct CombatStats {
  // From skill points
  int16 meleeAttack;
  int16 magicAttack;
  int16 rangedAttack;
  int16 health;
  // These include equipment
  int16 meleeDefence;
  int16 magicDefence;
  int16 rangedDefence;
}

enum CombatStyle {
  NONE,
  ATTACK,
  DEFENCE
}

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

import {Skill} from "./misc.sol";

enum PetSkin {
  NONE,
  DEFAULT,
  OG,
  ONEKIN,
  FROST,
  CRYSTAL,
  ANNIV1,
  KRAGSTYR,
  ANNIV2
}

enum PetEnhancementType {
  NONE,
  MELEE,
  MAGIC,
  RANGED,
  DEFENCE,
  HEALTH,
  MELEE_AND_DEFENCE,
  MAGIC_AND_DEFENCE,
  RANGED_AND_DEFENCE
}

struct Pet {
  Skill skillEnhancement1;
  uint8 skillFixedEnhancement1;
  uint8 skillPercentageEnhancement1;
  Skill skillEnhancement2;
  uint8 skillFixedEnhancement2;
  uint8 skillPercentageEnhancement2;
  uint40 lastAssignmentTimestamp;
  address owner; // Will be used as an optimization to avoid having to look up the owner of the pet in another storage slot
  bool isTransferable;
  // New storage slot
  uint24 baseId;
  // These are used when training a pet
  uint40 lastTrainedTimestamp;
  uint8 skillFixedEnhancementMax1; // The maximum possible value for skillFixedEnhancement1 when training
  uint8 skillFixedEnhancementMax2;
  uint8 skillPercentageEnhancementMax1;
  uint8 skillPercentageEnhancementMax2;
  uint64 xp;
}

struct BasePetMetadata {
  string description;
  uint8 tier;
  PetSkin skin;
  PetEnhancementType enhancementType;
  Skill skillEnhancement1;
  uint8 skillFixedMin1;
  uint8 skillFixedMax1;
  uint8 skillFixedIncrement1;
  uint8 skillPercentageMin1;
  uint8 skillPercentageMax1;
  uint8 skillPercentageIncrement1;
  uint8 skillMinLevel1;
  Skill skillEnhancement2;
  uint8 skillFixedMin2;
  uint8 skillFixedMax2;
  uint8 skillFixedIncrement2;
  uint8 skillPercentageMin2;
  uint8 skillPercentageMax2;
  uint8 skillPercentageIncrement2;
  uint8 skillMinLevel2;
  uint16 fixedStarThreshold;
  uint16 percentageStarThreshold;
  bool isTransferable;
}

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

import {QueuedAction} from "./actions.sol";
import {Skill, BoostType, CombatStats, Equipment} from "./misc.sol";
import {PlayerQuest} from "./quests.sol";

// 4 bytes for each level. 0x00000000 is the first level, 0x00000054 is the second, etc.
bytes constant XP_BYTES = hex"0000000000000054000000AE0000010E00000176000001E60000025E000002DE00000368000003FD0000049B00000546000005FC000006C000000792000008730000096400000A6600000B7B00000CA400000DE100000F36000010A200001229000013CB0000158B0000176B0000196E00001B9400001DE20000205A000022FF000025D5000028DD00002C1E00002F99000033540000375200003B9A000040300000451900004A5C00004FFF0000560900005C810000637000006ADD000072D100007B570000847900008E42000098BE0000A3F90000B0020000BCE70000CAB80000D9860000E9630000FA6200010C990001201D0001350600014B6F0001637300017D2E000198C10001B64E0001D5F80001F7E600021C430002433B00026CFD000299BE0002C9B30002FD180003342B00036F320003AE730003F23D00043AE3000488BE0004DC2F0005359B000595700005FC2400066A360006E02D00075E990007E6160008774C000912EB0009B9B4000A6C74000B2C06000BF956000CD561000DC134000EBDF3000FCCD40010EF2400122648001373BF0014D9230016582C0017F2B00019AAA9001B8234001D7B95001F99390021DDBC00244BE60026E6B60029B15F002CAF51002FE43A0033540D00370303003AF5A4003F30CC0043B9B0004895E3004DCB600053609100595C53005FC6030066A585006E034D0075E86C007E5E980087703B0091287D009B935300A6BD8F00B2B4EE00BF882800CD470500DC026F00EBCC8500FCB8B7010EDBD5";
uint256 constant MAX_LEVEL = 140; // Original max level
uint256 constant MAX_LEVEL_1 = 160; // TODO: Update later
uint256 constant MAX_LEVEL_2 = 190; // TODO: Update later

enum EquipPosition {
  NONE,
  HEAD,
  NECK,
  BODY,
  ARMS,
  LEGS,
  FEET,
  RING,
  SPARE2,
  LEFT_HAND,
  RIGHT_HAND,
  BOTH_HANDS,
  QUIVER,
  MAGIC_BAG,
  FOOD,
  AUX, // wood, seeds  etc..
  BOOST_VIAL,
  EXTRA_BOOST_VIAL,
  GLOBAL_BOOST_VIAL,
  CLAN_BOOST_VIAL,
  PASSIVE_BOOST_VIAL,
  LOCKED_VAULT,
  TERRITORY
}

struct Player {
  uint40 currentActionStartTimestamp; // The in-progress start time of the first queued action
  Skill currentActionProcessedSkill1; // The skill that the queued action has already gained XP in
  uint24 currentActionProcessedXPGained1; // The amount of XP that the queued action has already gained
  Skill currentActionProcessedSkill2;
  uint24 currentActionProcessedXPGained2;
  Skill currentActionProcessedSkill3;
  uint24 currentActionProcessedXPGained3;
  uint16 currentActionProcessedFoodConsumed;
  uint16 currentActionProcessedBaseInputItemsConsumedNum; // e.g scrolls, crafting materials etc
  Skill skillBoosted1; // The first skill that is boosted
  Skill skillBoosted2; // The second skill that is boosted (if applicable)
  uint48 totalXP;
  uint16 totalLevel; // Doesn't automatically add new skills to it
  bytes1 packedData; // Contains worldLocation in first 6 bits (0 is the main starting randomnessBeacon), and full mode unlocked in the upper most bit
  // TODO: Can be up to 7
  QueuedAction[] actionQueue;
  string name; // Raw name
  // New storage slot
  uint40 lastActiveTimestamp; // Last time they did something (queued action)
}

struct Item {
  EquipPosition equipPosition;
  bytes1 packedData; // 0x1 exists, upper most bit is full mode
  uint16 questPrerequisiteId;
  // Can it be transferred?
  bool isTransferable; // TODO: Move into packedData
  // Food
  uint16 healthRestored;
  // Boost vial
  BoostType boostType;
  uint16 boostValue; // Varies, could be the % increase
  uint24 boostDuration; // How long the effect of the boost last
  // Combat stats
  int16 meleeAttack;
  int16 magicAttack;
  int16 rangedAttack;
  int16 meleeDefence;
  int16 magicDefence;
  int16 rangedDefence;
  int16 health;
  // Minimum requirements in this skill to use this item (can be NONE)
  Skill skill;
  uint32 minXP;
}

// Used for events and also things like extra boost info
struct BoostInfo {
  uint40 startTime;
  uint24 duration;
  uint16 value;
  uint16 itemTokenId; // Get the effect of it
  BoostType boostType;
}

struct StandardBoostInfo {
  uint40 startTime;
  uint24 duration;
  uint16 value;
  uint16 itemTokenId; // Get the effect of it
  BoostType boostType;
  // Another boost slot for storing the last boost someone had active
  uint40 lastStartTime;
  uint24 lastDuration;
  uint16 lastValue;
  uint16 lastItemTokenId;
  BoostType lastBoostType;
  uint40 cooldown; // Just put here for packing
}

struct ExtendedBoostInfo {
  uint40 startTime;
  uint24 duration;
  uint16 value;
  uint16 itemTokenId; // Get the effect of it
  BoostType boostType;
  // Last boost
  uint40 lastStartTime;
  uint24 lastDuration;
  uint16 lastValue;
  uint16 lastItemTokenId;
  BoostType lastBoostType;
  // Others
  uint40 cooldown; // Just put here for packing
  bytes1 packedData; // 1st bit is hasExtraBoost. This is typically for a wish boost. Gas optimization to read this first
  // New storage slot for another boost (only wish boost for heroes currently)
  uint40 extraStartTime;
  uint24 extraDuration;
  uint16 extraValue;
  uint16 extraItemTokenId;
  BoostType extraBoostType;
  // Last extra boost
  uint40 lastExtraStartTime;
  uint24 lastExtraDuration;
  uint16 lastExtraValue;
  uint16 lastExtraItemTokenId;
  BoostType lastExtraBoostType;
}

// This is effectively a ratio to produce 1 of outputTokenId.
// Available choices that can be undertaken for an action
struct ActionChoiceInput {
  uint8 skill; // Skill that this action choice is related to
  uint24 rate; // Rate of output produced per hour (base 1000) 3 decimals
  uint24 xpPerHour;
  uint16[] inputTokenIds;
  uint24[] inputAmounts;
  uint16 outputTokenId;
  uint8 outputAmount;
  uint8 successPercent; // 0-100
  uint16 handItemTokenIdRangeMin; // Inclusive
  uint16 handItemTokenIdRangeMax; // Inclusive
  bool isFullModeOnly;
  bool isAvailable;
  uint16 questPrerequisiteId;
  uint8[] skills; // Skills required to do this action choice
  uint32[] skillMinXPs; // Min XP in the corresponding skills to be able to do this action choice
  int16[] skillDiffs; // How much the skill is increased/decreased by this action choice
}

struct ActionChoice {
  uint8 skill; // Skill that this action choice is related to
  uint24 rate; // Rate of output produced per hour (base 1000) 3 decimals
  uint24 xpPerHour;
  uint16 inputTokenId1;
  uint24 inputAmount1;
  uint16 inputTokenId2;
  uint24 inputAmount2;
  uint16 inputTokenId3;
  uint24 inputAmount3;
  uint16 outputTokenId;
  uint8 outputAmount;
  uint8 successPercent; // 0-100
  uint8 skill1; // Skills required to do this action choice, commonly the same as skill
  uint32 skillMinXP1; // Min XP in the skill to be able to do this action choice
  int16 skillDiff1; // How much the skill is increased/decreased by this action choice
  uint8 skill2;
  uint32 skillMinXP2;
  int16 skillDiff2;
  uint8 skill3;
  uint32 skillMinXP3;
  int16 skillDiff3;
  uint16 handItemTokenIdRangeMin; // Inclusive
  uint16 handItemTokenIdRangeMax; // Inclusive
  uint16 questPrerequisiteId;
  // FullMode is last bit, first 6 bits is worldLocation,
  // 2nd last bit is if there are other skills in next storage slot to check,
  // 3rd last bit if the input amounts should be used
  bytes1 packedData;
}

// Must be in the same order as Skill enum
struct PackedXP {
  uint40 melee;
  uint40 ranged;
  uint40 magic;
  uint40 defence;
  uint40 health;
  uint40 reservedCombat;
  bytes2 packedDataIsMaxed; // 2 bits per skill to indicate whether the maxed skill is reached. I think this was added in case we added a new max level which a user had already passed so old & new levels are the same and it would not trigger a level up event.
  // Next slot
  uint40 mining;
  uint40 woodcutting;
  uint40 fishing;
  uint40 smithing;
  uint40 thieving;
  uint40 crafting;
  bytes2 packedDataIsMaxed1; // 2 bits per skill to indicate whether the maxed skill is reached
  // Next slot
  uint40 cooking;
  uint40 firemaking;
  uint40 farming;
  uint40 alchemy;
  uint40 fletching;
  uint40 forging;
  bytes2 packedDataIsMaxed2; // 2 bits per skill to indicate whether the maxed skill is reached
}

struct AvatarInfo {
  string name;
  string description;
  string imageURI;
  Skill[2] startSkills; // Can be NONE
}

struct PastRandomRewardInfo {
  uint16 itemTokenId;
  uint24 amount;
  uint64 queueId;
}

struct PendingQueuedActionEquipmentState {
  uint256[] consumedItemTokenIds;
  uint256[] consumedAmounts;
  uint256[] producedItemTokenIds;
  uint256[] producedAmounts;
}

struct PendingQueuedActionMetadata {
  uint32 xpGained; // total xp gained
  uint32 rolls;
  bool died;
  uint16 actionId;
  uint64 queueId;
  uint24 elapsedTime;
  uint24 xpElapsedTime;
  uint8 checkpoint;
}

struct PendingQueuedActionData {
  // The amount of XP that the queued action has already gained
  Skill skill1;
  uint24 xpGained1;
  Skill skill2; // Most likely health
  uint24 xpGained2;
  Skill skill3; // Could come
  uint24 xpGained3;
  // How much food is consumed in the current action so far
  uint16 foodConsumed;
  // How many base consumables are consumed in the current action so far
  uint16 baseInputItemsConsumedNum;
}

struct PendingQueuedActionProcessed {
  // XP gained during this session
  Skill[] skills;
  uint32[] xpGainedSkills;
  // Data for the current action which has been previously processed, this is used to store on the Player
  PendingQueuedActionData currentAction;
}

struct QuestState {
  uint256[] consumedItemTokenIds;
  uint256[] consumedAmounts;
  uint256[] rewardItemTokenIds;
  uint256[] rewardAmounts;
  PlayerQuest[] activeQuestInfo;
  uint256[] questsCompleted;
  Skill[] skills; // Skills gained XP in
  uint32[] xpGainedSkills; // XP gained in these skills
}

struct LotteryWinnerInfo {
  uint16 lotteryId;
  uint24 raffleId;
  uint16 itemTokenId;
  uint16 amount;
  bool instantConsume;
  uint64 playerId;
}

struct PendingQueuedActionState {
  // These 2 are in sync. Separated to reduce gas/deployment costs as these are passed down many layers.
  PendingQueuedActionEquipmentState[] equipmentStates;
  PendingQueuedActionMetadata[] actionMetadatas;
  QueuedAction[] remainingQueuedActions;
  PastRandomRewardInfo[] producedPastRandomRewards;
  uint256[] xpRewardItemTokenIds;
  uint256[] xpRewardAmounts;
  uint256[] dailyRewardItemTokenIds;
  uint256[] dailyRewardAmounts;
  PendingQueuedActionProcessed processedData;
  bytes32 dailyRewardMask;
  QuestState quests;
  uint256 numPastRandomRewardInstancesToRemove;
  uint8 worldLocation;
  LotteryWinnerInfo lotteryWinner;
}

struct FullAttireBonusInput {
  Skill skill;
  uint8 bonusXPPercent;
  uint8 bonusRewardsPercent; // 3 = 3%
  uint16[5] itemTokenIds; // 0 = head, 1 = body, 2 arms, 3 body, 4 = feet
}

// Contains everything you need to create an item
struct ItemInput {
  CombatStats combatStats;
  uint16 tokenId;
  EquipPosition equipPosition;
  bool isTransferable;
  bool isFullModeOnly;
  bool isAvailable;
  uint16 questPrerequisiteId;
  // Minimum requirements in this skill
  Skill skill;
  uint32 minXP;
  // Food
  uint16 healthRestored;
  // Boost
  BoostType boostType;
  uint16 boostValue; // Varies, could be the % increase
  uint24 boostDuration; // How long the effect of the boost vial last
  // uri
  string metadataURI;
  string name;
}

/* Order head, neck, body, arms, legs, feet, ring, reserved1,
   leftHandEquipment, rightHandEquipment,
   Not used yet: input1, input2,input3, regenerate, reserved2, reserved3 */
struct CheckpointEquipments {
  uint16[16] itemTokenIds;
  uint16[16] balances;
}

struct ActivePlayerInfo {
  uint64 playerId;
  uint40 checkpoint;
  uint24 timespan;
  uint24 timespan1;
  uint24 timespan2;
}

struct PlayerInfo {
  uint24 avatarId;
  uint24 originalAvatarId; // The base avatar id that you were born with
  uint40 mintedTimestamp;
  uint40 upgradedTimestamp; // What time you upgraded your avatar
}

uint8 constant START_LEVEL = 17; // Needs updating when there is a new skill. Only useful for new heroes.

uint256 constant MAX_UNIQUE_TICKETS = 64;
// Used in a bunch of places
uint256 constant IS_FULL_MODE_BIT = 7;

// Passive/Instant/InstantVRF/Actions/ActionChoices/Item action
uint256 constant IS_AVAILABLE_BIT = 6;

// Passive actions
uint256 constant HAS_RANDOM_REWARDS_BIT = 5;

// The rest use world location for first 4 bits

// Queued action
uint256 constant HAS_PET_BIT = 2;
uint256 constant IS_VALID_BIT = 1;

// Player Boost
uint256 constant HAS_EXTRA_BOOST_BIT = 1;
uint256 constant BOOST_VERSION_BIT = 0;

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

enum Promotion {
  NONE,
  STARTER,
  HALLOWEEN_2023,
  XMAS_2023,
  HALLOWEEN_2024,
  HOLIDAY4, // Just have placeholders for now
  HOLIDAY5,
  HOLIDAY6,
  HOLIDAY7,
  HOLIDAY8,
  HOLIDAY9,
  HOLIDAY10
}

enum PromotionMintStatus {
  NONE,
  SUCCESS,
  PROMOTION_ALREADY_CLAIMED,
  ORACLE_NOT_CALLED,
  MINTING_OUTSIDE_AVAILABLE_DATE,
  PLAYER_DOES_NOT_QUALIFY,
  PLAYER_NOT_HIT_ENOUGH_CLAIMS_FOR_STREAK_BONUS,
  DEPENDENT_QUEST_NOT_COMPLETED
}

struct PromotionInfoInput {
  Promotion promotion;
  uint40 startTime;
  uint40 endTime; // Exclusive
  uint8 numDailyRandomItemsToPick; // Number of items to pick
  uint40 minTotalXP; // Minimum xp required to claim
  uint256 tokenCost; // Cost in brush to start the promotion, max 16mil
  // Special promotion specific (like 1kin)
  uint8 redeemCodeLength; // Length of the redeem code
  bool adminOnly; // Only admins can mint the promotion, like for 1kin (Not used yet)
  bool promotionTiedToUser; // If the promotion is tied to a user
  bool promotionTiedToPlayer; // If the promotion is tied to the player
  bool promotionMustOwnPlayer; // Must own the player to get the promotion
  // Evolution specific
  bool evolvedHeroOnly; // Only allow evolved heroes to claim
  // Multiday specific
  bool isMultiday; // The promotion is multi-day
  uint256 brushCostMissedDay; // Cost in brush to mint the promotion if they miss a day (in ether), max 25.6 (base 100)
  uint8 numDaysHitNeededForStreakBonus; // How many days to hit for the streak bonus
  uint8 numDaysClaimablePeriodStreakBonus; // If there is a streak bonus, how many days to claim it after the promotion ends. If no final day bonus, set to 0
  uint8 numRandomStreakBonusItemsToPick1; // Number of items to pick for the streak bonus
  uint8 numRandomStreakBonusItemsToPick2; // Number of random items to pick for the streak bonus
  uint16[] randomStreakBonusItemTokenIds1;
  uint32[] randomStreakBonusAmounts1;
  uint16[] randomStreakBonusItemTokenIds2;
  uint32[] randomStreakBonusAmounts2;
  uint16[] guaranteedStreakBonusItemTokenIds;
  uint16[] guaranteedStreakBonusAmounts;
  // Single and multiday
  uint16[] guaranteedItemTokenIds; // Guaranteed items for the promotions each day, if empty then they are handled in a specific way for the promotion like daily rewards
  uint32[] guaranteedAmounts; // Corresponding amounts to the itemTokenIds
  uint16[] randomItemTokenIds; // Possible items for the promotions each day, if empty then they are handled in a specific way for the promotion like daily rewards
  uint32[] randomAmounts; // Corresponding amounts to the randomItemTokenIds
  // Quests
  uint16 questPrerequisiteId;
}

struct PromotionInfo {
  Promotion promotion;
  uint40 startTime;
  uint8 numDays;
  uint8 numDailyRandomItemsToPick; // Number of items to pick
  uint40 minTotalXP; // Minimum xp required to claim
  uint24 tokenCost; // Cost in brush to mint the promotion (in ether), max 16mil
  // Quests
  uint16 questPrerequisiteId;
  // Special promotion specific (like 1kin), could pack these these later
  uint8 redeemCodeLength; // Length of the redeem code
  bool adminOnly; // Only admins can mint the promotion, like for 1kin
  bool promotionTiedToUser; // If the promotion is tied to a user
  bool promotionTiedToPlayer; // If the promotion is tied to the player
  bool promotionMustOwnPlayer; // Must own the player to get the promotion
  // Evolution specific
  bool evolvedHeroOnly; // Only allow evolved heroes to claim
  // Multiday specific
  bool isMultiday; // The promotion is multi-day
  uint8 brushCostMissedDay; // Cost in brush to mint the promotion if they miss a day (in ether), max 25.5, base 100
  uint8 numDaysHitNeededForStreakBonus; // How many days to hit for the streak bonus
  uint8 numDaysClaimablePeriodStreakBonus; // If there is a streak bonus, how many days to claim it after the promotion ends. If no final day bonus, set to 0
  uint8 numRandomStreakBonusItemsToPick1; // Number of items to pick for the streak bonus
  uint8 numRandomStreakBonusItemsToPick2; // Number of random items to pick for the streak bonus
  // Misc
  uint16[] randomStreakBonusItemTokenIds1;
  uint32[] randomStreakBonusAmounts1;
  uint16[] randomStreakBonusItemTokenIds2; // Not used yet
  uint32[] randomStreakBonusAmounts2; // Not used yet
  uint16[] guaranteedStreakBonusItemTokenIds; // Not used yet
  uint16[] guaranteedStreakBonusAmounts; // Not used yet
  // Single and multiday
  uint16[] guaranteedItemTokenIds; // Guaranteed items for the promotions each day, if empty then they are handled in a specific way for the promotion like daily rewards
  uint32[] guaranteedAmounts; // Corresponding amounts to the itemTokenIds
  uint16[] randomItemTokenIds; // Possible items for the promotions each day, if empty then they are handled in a specific way for the promotion like daily rewards
  uint32[] randomAmounts; // Corresponding amounts to the randomItemTokenIds
}

uint256 constant BRUSH_COST_MISSED_DAY_MUL = 10;

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

import {Skill} from "./misc.sol";

struct QuestInput {
  uint16 dependentQuestId; // The quest that must be completed before this one can be started
  uint16 actionId1; // action to do
  uint16 actionNum1; // how many (up to 65535)
  uint16 actionId2; // another action to do
  uint16 actionNum2; // how many (up to 65535)
  uint16 actionChoiceId; // actionChoice to perform
  uint16 actionChoiceNum; // how many to do (base number), (up to 65535)
  Skill skillReward; // The skill to reward XP to
  uint24 skillXPGained; // The amount of XP to give (up to 65535)
  uint16 rewardItemTokenId1; // Reward an item
  uint16 rewardAmount1; // amount of the reward (up to 65535)
  uint16 rewardItemTokenId2; // Reward another item
  uint16 rewardAmount2; // amount of the reward (up to 65535)
  uint16 burnItemTokenId; // Burn an item
  uint16 burnAmount; // amount of the burn (up to 65535)
  uint16 questId; // Unique id for this quest
  bool isFullModeOnly; // If true this quest requires the user be evolved
  uint8 worldLocation; // 0 is the main starting world
}

struct Quest {
  uint16 dependentQuestId; // The quest that must be completed before this one can be started
  uint16 actionId1; // action to do
  uint16 actionNum1; // how many (up to 65535)
  uint16 actionId2; // another action to do
  uint16 actionNum2; // how many (up to 65535)
  uint16 actionChoiceId; // actionChoice to perform
  uint16 actionChoiceNum; // how many to do (base number), (up to 65535)
  Skill skillReward; // The skill to reward XP to
  uint24 skillXPGained; // The amount of XP to give (up to 65535)
  uint16 rewardItemTokenId1; // Reward an item
  uint16 rewardAmount1; // amount of the reward (up to 65535)
  uint16 rewardItemTokenId2; // Reward another item
  uint16 rewardAmount2; // amount of the reward (up to 65535)
  uint16 burnItemTokenId; // Burn an item
  uint16 burnAmount; // amount of the burn (up to 65535)
  uint16 reserved; // Reserved for future use (previously was questId and cleared)
  bytes1 packedData; // FullMode is last bit, first 6 bits is worldLocation
}

struct PlayerQuest {
  uint32 questId;
  uint16 actionCompletedNum1;
  uint16 actionCompletedNum2;
  uint16 actionChoiceCompletedNum;
  uint16 burnCompletedAmount;
}

uint256 constant QUEST_PURSE_STRINGS = 5; // MAKE SURE THIS MATCHES definitions

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

import {BoostType, Equipment} from "./misc.sol";

struct GuaranteedReward {
  uint16 itemTokenId;
  uint16 rate; // num per hour (base 10, 1 decimal) for actions and num per duration for passive actions
}

struct RandomReward {
  uint16 itemTokenId;
  uint16 chance; // out of 65535
  uint8 amount; // out of 255
}

struct PendingRandomReward {
  uint16 actionId;
  uint40 startTime;
  uint24 xpElapsedTime;
  uint16 boostItemTokenId;
  uint24 elapsedTime;
  uint40 boostStartTime; // When the boost was started
  uint24 sentinelElapsedTime;
  // Full equipment at the time this was generated
  uint8 fullAttireBonusRewardsPercent;
  uint64 queueId; // TODO: Could reduce this if more stuff is needed
}

struct ActionRewards {
  uint16 guaranteedRewardTokenId1;
  uint16 guaranteedRewardRate1; // Num per hour base 10 (1 decimal) for actions (Max 6553.5 per hour), num per duration for passive actions
  uint16 guaranteedRewardTokenId2;
  uint16 guaranteedRewardRate2;
  uint16 guaranteedRewardTokenId3;
  uint16 guaranteedRewardRate3;
  // Random chance rewards
  uint16 randomRewardTokenId1;
  uint16 randomRewardChance1; // out of 65535
  uint8 randomRewardAmount1; // out of 255
  uint16 randomRewardTokenId2;
  uint16 randomRewardChance2;
  uint8 randomRewardAmount2;
  uint16 randomRewardTokenId3;
  uint16 randomRewardChance3;
  uint8 randomRewardAmount3;
  uint16 randomRewardTokenId4;
  uint16 randomRewardChance4;
  uint8 randomRewardAmount4;
  // No more room in this storage slot!
}

struct XPThresholdReward {
  uint32 xpThreshold;
  Equipment[] rewards;
}

enum InstantVRFActionType {
  NONE,
  GENERIC,
  FORGING,
  EGG
}

struct InstantVRFActionInput {
  uint16 actionId;
  uint16[] inputTokenIds;
  uint24[] inputAmounts;
  bytes data;
  InstantVRFActionType actionType;
  bool isFullModeOnly;
  bool isAvailable;
  uint16 questPrerequisiteId;
}

struct InstantVRFRandomReward {
  uint16 itemTokenId;
  uint16 chance; // out of 65535
  uint16 amount; // out of 65535
}

uint256 constant MAX_GUARANTEED_REWARDS_PER_ACTION = 3;
uint256 constant MAX_RANDOM_REWARDS_PER_ACTION = 4;
uint256 constant MAX_REWARDS_PER_ACTION = MAX_GUARANTEED_REWARDS_PER_ACTION + MAX_RANDOM_REWARDS_PER_ACTION;
uint256 constant MAX_CONSUMED_PER_ACTION = 3;
uint256 constant MAX_QUEST_REWARDS = 2;

uint256 constant TIER_1_DAILY_REWARD_START_XP = 0;
uint256 constant TIER_2_DAILY_REWARD_START_XP = 7_650;
uint256 constant TIER_3_DAILY_REWARD_START_XP = 33_913;
uint256 constant TIER_4_DAILY_REWARD_START_XP = 195_864;
uint256 constant TIER_5_DAILY_REWARD_START_XP = 784_726;
uint256 constant TIER_6_DAILY_REWARD_START_XP = 2_219_451;

// 4 bytes for each threshold, starts at 500 xp in decimal
bytes constant XP_THRESHOLD_REWARDS = hex"00000000000001F4000003E8000009C40000138800002710000075300000C350000186A00001D4C0000493E0000557300007A120000927C0000B71B0000DBBA0000F424000124F800016E360001B7740001E8480002625A0002932E0002DC6C0003567E0003D0900004C4B40005B8D80006ACFC0007A1200008954400098968000A7D8C000B71B0000C65D4000D59F8000E4E1C0";

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

import {IERC20} from "@openzeppelin/contracts/token/ERC20/IERC20.sol";

interface IBrushToken is IERC20 {
  function burn(uint256 amount) external;

  function burnFrom(address account, uint256 amount) external;

  function transferFromBulk(address from, address[] calldata tos, uint256[] calldata amounts) external;

  function transferOwnership(address newOwner) external;
}

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

interface IBank {
  function initialize() external;

  function initializeAddresses(
    uint256 clanId,
    address bankRegistry,
    address bankRelay,
    address playerNFT,
    address itemNFT,
    address clans,
    address players,
    address lockedBankVaults,
    address raids
  ) external;

  function depositToken(address sender, address from, uint256 playerId, address token, uint256 amount) external;

  function setAllowBreachedCapacity(bool allow) external;
}

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

interface IBankFactory {
  function getBankAddress(uint256 clanId) external view returns (address);

  function getCreatedHere(address bank) external view returns (bool);

  function createBank(address from, uint256 clanId) external returns (address);
}

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

interface IClanMemberLeftCB {
  function clanMemberLeft(uint256 clanId, uint256 playerId) external;
}

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

import {ClanRank} from "../globals/clans.sol";

interface IClans {
  function canWithdraw(uint256 clanId, uint256 playerId) external view returns (bool);

  function isClanMember(uint256 clanId, uint256 playerId) external view returns (bool);

  function maxBankCapacity(uint256 clanId) external view returns (uint16);

  function maxMemberCapacity(uint256 clanId) external view returns (uint16);

  function getRank(uint256 clanId, uint256 playerId) external view returns (ClanRank);

  function setMMR(uint256 clanId, uint16 mmr) external;

  function getMMR(uint256 clanId) external view returns (uint16);

  function addXP(uint256 clanId, uint40 xp, bool xpEmittedElsewhere) external;

  function getClanBankAddress(uint256 clanId) external view returns (address);
}

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

interface ICombatants {
  function isCombatant(uint256 clanId, uint256 playerId) external view returns (bool);

  function assignCombatants(
    uint256 clanId,
    uint64[] calldata playerIds,
    uint256 combatantCooldownTimestamp,
    uint256 leaderPlayerId
  ) external;
}

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

import {Item} from "../globals/players.sol";

interface IItemNFT {
  function balanceOfs(address account, uint16[] memory ids) external view returns (uint256[] memory);

  function balanceOfs10(address account, uint16[10] memory ids) external view returns (uint256[] memory);

  function balanceOf(address account, uint256 id) external view returns (uint256);

  function getItem(uint16 tokenId) external view returns (Item memory);

  function getItems(uint16[] calldata tokenIds) external view returns (Item[] memory);

  function totalSupply(uint256 id) external view returns (uint256); // ERC1155Supply

  function totalSupply() external view returns (uint256); // ERC1155Supply

  function mint(address to, uint256 id, uint256 quantity) external;

  function mintBatch(address to, uint256[] calldata ids, uint256[] calldata quantities) external;

  function burn(address account, uint256 id, uint256 value) external;

  function burnBatch(address account, uint256[] calldata ids, uint256[] calldata values) external;

  function getTimestampFirstMint(uint256 id) external view returns (uint256);

  function exists(uint256 id) external view returns (bool);
}

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

interface IOracleCB {
  function newOracleRandomWords(uint256 randomWord) external;
}

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

import "../globals/misc.sol";
import "../globals/players.sol";

interface IPlayers {
  function clearEverythingBeforeTokenTransfer(address from, uint256 tokenId) external;

  function beforeTokenTransferTo(address to, uint256 tokenId) external;

  function getURI(
    uint256 playerId,
    string calldata name,
    string calldata avatarName,
    string calldata avatarDescription,
    string calldata imageURI
  ) external view returns (string memory);

  function mintedPlayer(
    address from,
    uint256 playerId,
    Skill[2] calldata startSkills,
    bool makeActive,
    uint256[] calldata startingItemTokenIds,
    uint256[] calldata startingAmounts
  ) external;

  function upgradePlayer(uint256 playerId) external;

  function isPlayerEvolved(uint256 playerId) external view returns (bool);

  function isOwnerOfPlayerAndActive(address from, uint256 playerId) external view returns (bool);

  function getAlphaCombatParams() external view returns (uint8 alphaCombat, uint8 betaCombat, uint8 alphaCombatHealing);

  function getActivePlayer(address owner) external view returns (uint256 playerId);

  function getPlayerXP(uint256 playerId, Skill skill) external view returns (uint256 xp);

  function getLastActiveTimestamp(uint256 playerId) external view returns (uint256 lastActiveTimestamp);

  function getLevel(uint256 playerId, Skill skill) external view returns (uint256 level);

  function getTotalXP(uint256 playerId) external view returns (uint256 totalXP);

  function getTotalLevel(uint256 playerId) external view returns (uint256 totalLevel);

  function getActiveBoost(uint256 playerId) external view returns (ExtendedBoostInfo memory);

  function modifyXP(address from, uint256 playerId, Skill skill, uint56 xp, bool skipEffects) external;

  function beforeItemNFTTransfer(address from, address to, uint256[] calldata ids, uint256[] calldata amounts) external;
}

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

import {CombatStats, Skill} from "../globals/misc.sol";
import {ActionChoice} from "../globals/players.sol";
import {ActionRewards} from "../globals/rewards.sol";
import {ActionInfo} from "../globals/actions.sol";

interface IWorldActions {
  function getXPPerHour(uint16 actionId, uint16 actionChoiceId) external view returns (uint24 xpPerHour);

  function getNumSpawn(uint16 actionId) external view returns (uint256 numSpawned);

  function getActionSuccessPercentAndMinXP(uint16 actionId) external view returns (uint8 successPercent, uint32 minXP);

  function getCombatStats(uint16 actionId) external view returns (CombatStats memory stats);

  function getActionChoice(uint16 actionId, uint16 choiceId) external view returns (ActionChoice memory choice);

  function getRewardsHelper(
    uint16 actionId
  ) external view returns (ActionRewards memory, Skill skill, uint256 numSpawned); // , uint8 worldLocation);

  function getSkill(uint256 actionId) external view returns (Skill skill);

  function getActionRewards(uint256 actionId) external view returns (ActionRewards memory);

  function getActionInfo(uint256 actionId) external view returns (ActionInfo memory info);
}

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

import {ERC1155Upgradeable} from "@openzeppelin/contracts-upgradeable/token/ERC1155/ERC1155Upgradeable.sol";

import {UUPSUpgradeable} from "@openzeppelin/contracts-upgradeable/proxy/utils/UUPSUpgradeable.sol";
import {OwnableUpgradeable} from "@openzeppelin/contracts-upgradeable/access/OwnableUpgradeable.sol";
import {IERC2981, IERC165} from "@openzeppelin/contracts/interfaces/IERC2981.sol";

import {IItemNFT} from "./interfaces/IItemNFT.sol";
import {IPlayers} from "./interfaces/IPlayers.sol";
import {ItemNFTLibrary} from "./ItemNFTLibrary.sol";
import {IBankFactory} from "./interfaces/IBankFactory.sol";
import {AdminAccess} from "./AdminAccess.sol";

import {BoostType, BulkTransferInfo, CombatStats, EquipPosition, Item, ItemInput, Skill, IS_FULL_MODE_BIT, IS_AVAILABLE_BIT} from "./globals/all.sol";

// The NFT contract contains data related to the items and who owns them
contract ItemNFT is UUPSUpgradeable, OwnableUpgradeable, ERC1155Upgradeable, IERC2981, IItemNFT {
  event AddItems(ItemInput[] items);
  event EditItems(ItemInput[] items);
  event RemoveItems(uint16[] tokenIds);

  error IdTooHigh();
  error ItemNotTransferable();
  error InvalidTokenId();
  error ItemAlreadyExists();
  error ItemDoesNotExist(uint16);
  error EquipmentPositionShouldNotChange();
  error NotMinter(address minter);
  error NotBurner();
  error LengthMismatch();

  struct ItemInfo {
    uint40 timestampFirstMint;
    uint216 balance; // can be smaller if we want to pack more data
  }

  uint16 private _totalSupplyAll;
  string private _baseURI;

  AdminAccess private _adminAccess;
  bool private _isBeta;
  IBankFactory private _bankFactory;
  IPlayers private _players;

  // Royalties
  address private _royaltyReceiver;
  uint8 private _royaltyFee; // base 1000, highest is 25.5

  mapping(uint256 itemId => ItemInfo itemInfo) private _itemInfos; // (timestampFirstMint, balance)
  mapping(uint256 itemId => string tokenURI) private _tokenURIs;
  mapping(uint256 itemId => CombatStats combatStats) private _combatStats;
  mapping(uint256 itemId => Item item) private _items;
  mapping(address account => bool isApproved) private _approvals;

  modifier onlyMinters() {
    address sender = _msgSender();
    require(_isApproved(sender) || (_adminAccess.isAdmin(sender) && _isBeta), NotMinter(sender));
    _;
  }

  modifier onlyBurners(address from) {
    address sender = _msgSender();
    require(sender == from || isApprovedForAll(from, sender), NotBurner());
    _;
  }

  /// @custom:oz-upgrades-unsafe-allow constructor
  constructor() {
    _disableInitializers();
  }

  function initialize(
    address royaltyReceiver,
    string calldata baseURI,
    AdminAccess adminAccess,
    bool isBeta
  ) external initializer {
    __Ownable_init(_msgSender());
    __UUPSUpgradeable_init();
    __ERC1155_init("");

    _baseURI = baseURI;
    _royaltyFee = 30; // 3%
    _royaltyReceiver = royaltyReceiver;
    _adminAccess = adminAccess;
    _isBeta = isBeta;
  }

  function mint(address to, uint256 tokenId, uint256 amount) external override onlyMinters {
    _mintItem(to, tokenId, amount);
  }

  function mintBatch(address to, uint256[] calldata ids, uint256[] calldata amounts) external override onlyMinters {
    _mintBatchItems(to, ids, amounts);
  }

  function burnBatch(
    address from,
    uint256[] calldata tokenIds,
    uint256[] calldata amounts
  ) external override onlyBurners(from) {
    _burnBatch(from, tokenIds, amounts);
  }

  function burn(address from, uint256 tokenId, uint256 amount) external override onlyBurners(from) {
    _burn(from, tokenId, amount);
  }

  function _getMinRequirement(uint16 tokenId) private view returns (Skill, uint32, bool isFullModeOnly) {
    Item memory item = _items[tokenId];
    return (item.skill, item.minXP, _isItemFullMode(tokenId));
  }

  function _isItemFullMode(uint256 tokenId) private view returns (bool) {
    return uint8(_items[tokenId].packedData >> IS_FULL_MODE_BIT) & 1 == 1;
  }

  // TODO: Not used yet
  function _isItemAvailable(uint16 tokenId) private view returns (bool) {
    return uint8(_items[tokenId].packedData >> IS_AVAILABLE_BIT) & 1 == 1;
  }

  function _premint(uint256 tokenId, uint256 amount) private returns (uint256 numNewUniqueItems) {
    require(tokenId < type(uint16).max, IdTooHigh());
    uint256 existingBalance = _itemInfos[tokenId].balance;
    if (existingBalance == 0) {
      // Brand new item
      _itemInfos[tokenId].timestampFirstMint = uint40(block.timestamp);
      numNewUniqueItems++;
    }
    _itemInfos[tokenId].balance = uint216(existingBalance + amount);
  }

  function _mintItem(address to, uint256 tokenId, uint256 amount) internal {
    uint256 newlyMintedItems = _premint(tokenId, amount);
    if (newlyMintedItems != 0) {
      ++_totalSupplyAll;
    }
    _mint(to, uint256(tokenId), amount, "");
  }

  function _mintBatchItems(address to, uint256[] memory tokenIds, uint256[] memory amounts) internal {
    uint256 numNewItems;
    uint256 tokenIdsLength = tokenIds.length;
    for (uint256 i; i < tokenIdsLength; ++i) {
      numNewItems = numNewItems + _premint(tokenIds[i], amounts[i]);
    }
    if (numNewItems != 0) {
      _totalSupplyAll += uint16(numNewItems);
    }
    _mintBatch(to, tokenIds, amounts, "");
  }

  function safeBulkTransfer(BulkTransferInfo[] calldata nftsInfo) external {
    if (nftsInfo.length == 0) {
      return;
    }
    for (uint256 i = 0; i < nftsInfo.length; ++i) {
      BulkTransferInfo memory nftInfo = nftsInfo[i];
      address to = nftInfo.to;
      if (nftInfo.tokenIds.length == 1) {
        safeTransferFrom(_msgSender(), to, nftInfo.tokenIds[0], nftInfo.amounts[0], "");
      } else {
        safeBatchTransferFrom(_msgSender(), to, nftInfo.tokenIds, nftInfo.amounts, "");
      }
    }
  }

  function _getItem(uint16 tokenId) private view returns (Item storage) {
    require(exists(tokenId), ItemDoesNotExist(tokenId));
    return _items[tokenId];
  }

  // If an item is burnt, remove it from the total
  function _removeAnyBurntFromTotal(uint256[] memory ids, uint256[] memory amounts) private {
    uint256 totalSupplyDelta;
    for (uint256 i = 0; i < ids.length; ++i) {
      uint256 newBalance = _itemInfos[ids[i]].balance - amounts[i];
      if (newBalance == 0) {
        ++totalSupplyDelta;
      }
      _itemInfos[ids[i]].balance = uint216(newBalance);
    }
    _totalSupplyAll -= uint16(totalSupplyDelta);
  }

  function _checkIsTransferable(address from, uint256[] memory ids) private view {
    bool anyNonTransferable;
    for (uint256 i = 0; i < ids.length; ++i) {
      if (exists(ids[i]) && !_items[ids[i]].isTransferable) {
        anyNonTransferable = true;
        break;
      }
    }

    // Check if this is from a bank, that's the only place it's allowed to transfer non-transferable items
    require(!anyNonTransferable || _bankFactory.getCreatedHere(from), ItemNotTransferable());
  }

  function _update(address from, address to, uint256[] memory ids, uint256[] memory amounts) internal virtual override {
    if (amounts.length != 0 && from != to) {
      bool isBurnt = to == address(0) || to == address(0xdEaD);
      bool isMinted = from == address(0);
      if (isBurnt) {
        _removeAnyBurntFromTotal(ids, amounts);
      } else if (!isMinted) {
        _checkIsTransferable(from, ids);
      }
      _players.beforeItemNFTTransfer(from, to, ids, amounts);
    }
    super._update(from, to, ids, amounts);
  }

  function _setItem(ItemInput calldata input) private {
    require(input.tokenId != 0, InvalidTokenId());
    ItemNFTLibrary.setItem(input, _items[input.tokenId]);
    _tokenURIs[input.tokenId] = input.metadataURI;
  }

  function _editItem(ItemInput calldata inputItem) private {
    require(exists(inputItem.tokenId), ItemDoesNotExist(inputItem.tokenId));
    EquipPosition oldPosition = _items[inputItem.tokenId].equipPosition;
    EquipPosition newPosition = inputItem.equipPosition;

    bool isRightHandPositionSwapWithBothHands = (oldPosition == EquipPosition.RIGHT_HAND &&
      newPosition == EquipPosition.BOTH_HANDS) ||
      (oldPosition == EquipPosition.BOTH_HANDS && newPosition == EquipPosition.RIGHT_HAND);

    // Allowed to go from BOTH_HANDS to RIGHT_HAND or RIGHT_HAND to BOTH_HANDS
    require(
      oldPosition == newPosition || oldPosition == EquipPosition.NONE || isRightHandPositionSwapWithBothHands,
      EquipmentPositionShouldNotChange()
    );
    _setItem(inputItem);
  }

  function _isApproved(address account) private view returns (bool) {
    return _approvals[account];
  }

  function uri(uint256 tokenId) public view virtual override returns (string memory) {
    require(exists(tokenId), ItemDoesNotExist(uint16(tokenId)));
    return string(abi.encodePacked(_baseURI, _tokenURIs[tokenId]));
  }

  function exists(uint256 tokenId) public view override returns (bool) {
    return _items[tokenId].packedData != 0;
  }

  function totalSupply(uint256 tokenId) external view override returns (uint256) {
    return _itemInfos[tokenId].balance;
  }

  function totalSupply() external view override returns (uint256) {
    return _totalSupplyAll;
  }

  function getItem(uint16 tokenId) external view override returns (Item memory) {
    return _getItem(tokenId);
  }

  function getItems(uint16[] calldata tokenIds) external view override returns (Item[] memory items) {
    uint256 tokenIdsLength = tokenIds.length;
    items = new Item[](tokenIdsLength);
    for (uint256 i; i < tokenIdsLength; ++i) {
      items[i] = _getItem(tokenIds[i]);
    }
  }

  function getTimestampFirstMint(uint256 tokenId) external view override returns (uint256) {
    return _itemInfos[tokenId].timestampFirstMint;
  }

  function getEquipPositionAndMinRequirement(
    uint16 item
  ) external view returns (Skill skill, uint32 minXP, EquipPosition equipPosition, bool isFullModeOnly) {
    (skill, minXP, isFullModeOnly) = _getMinRequirement(item);
    equipPosition = getEquipPosition(item);
  }

  function getMinRequirements(
    uint16[] calldata tokenIds
  ) external view returns (Skill[] memory skills, uint32[] memory minXPs, bool[] memory isFullModeOnly) {
    skills = new Skill[](tokenIds.length);
    minXPs = new uint32[](tokenIds.length);
    isFullModeOnly = new bool[](tokenIds.length);
    uint256 tokenIdsLength = tokenIds.length;
    for (uint256 i; i < tokenIdsLength; ++i) {
      (skills[i], minXPs[i], isFullModeOnly[i]) = _getMinRequirement(tokenIds[i]);
    }
  }

  function getEquipPositions(uint16[] calldata tokenIds) external view returns (EquipPosition[] memory equipPositions) {
    uint256 tokenIdsLength = tokenIds.length;
    equipPositions = new EquipPosition[](tokenIdsLength);
    for (uint256 i; i < tokenIdsLength; ++i) {
      equipPositions[i] = getEquipPosition(tokenIds[i]);
    }
  }

  function getEquipPosition(uint16 tokenId) public view returns (EquipPosition) {
    require(exists(tokenId), ItemDoesNotExist(uint16(tokenId)));
    return _items[tokenId].equipPosition;
  }

  /**
   * @dev See {IERC1155-balanceOfBatch}. This implementation is not standard ERC1155, it's optimized for the single account case
   */
  function balanceOfs(
    address account,
    uint16[] memory ids
  ) external view override returns (uint256[] memory batchBalances) {
    batchBalances = new uint256[](ids.length);
    for (uint256 i = 0; i < ids.length; ++i) {
      batchBalances[i] = balanceOf(account, ids[i]);
    }
  }

  function balanceOfs10(
    address account,
    uint16[10] memory ids
  ) external view override returns (uint256[] memory batchBalances) {
    batchBalances = new uint256[](ids.length);
    for (uint256 i = 0; i < ids.length; ++i) {
      batchBalances[i] = balanceOf(account, ids[i]);
    }
  }

  function balanceOf(address account, uint256 id) public view override(IItemNFT, ERC1155Upgradeable) returns (uint256) {
    return ERC1155Upgradeable.balanceOf(account, id);
  }

  function royaltyInfo(
    uint256 /*tokenId*/,
    uint256 salePrice
  ) external view override returns (address receiver, uint256 royaltyAmount) {
    uint256 amount = (salePrice * _royaltyFee) / 1000;
    return (_royaltyReceiver, amount);
  }

  function getBoostInfo(
    uint16 tokenId
  ) external view returns (BoostType boostType, uint16 boostValue, uint24 boostDuration) {
    Item storage item = _getItem(tokenId);
    return (item.boostType, item.boostValue, item.boostDuration);
  }

  /**
   * @dev See {IERC1155-isApprovedForAll}.
   */
  function isApprovedForAll(address account, address operator) public view virtual override returns (bool) {
    return super.isApprovedForAll(account, operator) || _approvals[operator];
  }

  function supportsInterface(bytes4 interfaceId) public view override(IERC165, ERC1155Upgradeable) returns (bool) {
    return interfaceId == type(IERC2981).interfaceId || super.supportsInterface(interfaceId);
  }

  function name() external view returns (string memory) {
    return string(abi.encodePacked("Estfor Items", _isBeta ? " (Beta)" : ""));
  }

  function symbol() external view returns (string memory) {
    return string(abi.encodePacked("EK_I", _isBeta ? "B" : ""));
  }

  function addItems(ItemInput[] calldata inputItems) external onlyOwner {
    uint256 length = inputItems.length;
    for (uint256 i; i < length; ++i) {
      require(!exists(inputItems[i].tokenId), ItemAlreadyExists());
      _setItem(inputItems[i]);
    }

    emit AddItems(inputItems);
  }

  function editItems(ItemInput[] calldata inputItems) external onlyOwner {
    for (uint256 i = 0; i < inputItems.length; ++i) {
      _editItem(inputItems[i]);
    }

    emit EditItems(inputItems);
  }

  // This should be only used when an item is not in active use
  // because it could mess up queued actions potentially
  function removeItems(uint16[] calldata itemTokenIds) external onlyOwner {
    for (uint256 i = 0; i < itemTokenIds.length; ++i) {
      require(exists(itemTokenIds[i]), ItemDoesNotExist(itemTokenIds[i]));
      delete _items[itemTokenIds[i]];
      delete _tokenURIs[itemTokenIds[i]];
    }

    emit RemoveItems(itemTokenIds);
  }

  function initializeAddresses(IBankFactory bankFactory, IPlayers players) external onlyOwner {
    _bankFactory = bankFactory;
    _players = players;
  }

  function setApproved(address[] calldata accounts, bool isApproved) external onlyOwner {
    for (uint256 i = 0; i < accounts.length; ++i) {
      _approvals[accounts[i]] = isApproved;
    }
  }

  function setBaseURI(string calldata baseURI) external onlyOwner {
    _baseURI = baseURI;
  }

  function airdrop(address[] calldata tos, uint256 tokenId, uint256[] calldata amounts) external onlyOwner {
    require(tos.length == amounts.length, LengthMismatch());
    for (uint256 i = 0; i < tos.length; ++i) {
      _mintItem(tos[i], tokenId, amounts[i]);
    }
  }

  // solhint-disable-next-line no-empty-blocks
  function _authorizeUpgrade(address newImplementation) internal override onlyOwner {}
}

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

// solhint-disable-next-line no-global-import
import "./globals/players.sol";

// This file contains methods for interacting with the item NFT, used to decrease implementation deployment bytecode code.
library ItemNFTLibrary {
  function setItem(ItemInput calldata inputItem, Item storage item) external {
    bool hasCombat;
    CombatStats calldata combatStats = inputItem.combatStats;
    assembly ("memory-safe") {
      hasCombat := not(iszero(combatStats))
    }
    item.equipPosition = inputItem.equipPosition;
    item.isTransferable = inputItem.isTransferable;

    bytes1 packedData = bytes1(uint8(0x1)); // Exists
    packedData = packedData | bytes1(uint8(inputItem.isFullModeOnly ? 1 << IS_FULL_MODE_BIT : 0));
    if (inputItem.isAvailable) {
      packedData |= bytes1(uint8(1 << IS_AVAILABLE_BIT));
    }

    item.packedData = packedData;

    item.questPrerequisiteId = inputItem.questPrerequisiteId;

    if (hasCombat) {
      // Combat stats
      item.meleeAttack = inputItem.combatStats.meleeAttack;
      item.rangedAttack = inputItem.combatStats.rangedAttack;
      item.magicAttack = inputItem.combatStats.magicAttack;
      item.meleeDefence = inputItem.combatStats.meleeDefence;
      item.rangedDefence = inputItem.combatStats.rangedDefence;
      item.magicDefence = inputItem.combatStats.magicDefence;
      item.health = inputItem.combatStats.health;
    }

    if (inputItem.healthRestored != 0) {
      item.healthRestored = inputItem.healthRestored;
    }

    if (inputItem.boostType != BoostType.NONE) {
      item.boostType = inputItem.boostType;
      item.boostValue = inputItem.boostValue;
      item.boostDuration = inputItem.boostDuration;
    }

    item.minXP = inputItem.minXP;
    item.skill = inputItem.skill;
  }
}

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

import {CombatStyle} from "../globals/misc.sol";

library CombatStyleLibrary {
  error InvalidCombatStyleId(uint8 combatStyle);

  function _asCombatStyle(uint8 combatStyle) internal pure returns (CombatStyle) {
    require(
      combatStyle >= uint8(type(CombatStyle).min) && combatStyle <= uint8(type(CombatStyle).max),
      InvalidCombatStyleId(combatStyle)
    );
    return CombatStyle(combatStyle);
  }

  function _isCombatStyle(CombatStyle combatStyle) internal pure returns (bool) {
    return combatStyle != CombatStyle.NONE;
  }

  function _isCombatStyle(uint8 combatStyle) internal pure returns (bool) {
    return _isCombatStyle(_asCombatStyle(combatStyle));
  }
}

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

import {Skill} from "../globals/misc.sol";

library SkillLibrary {
  error InvalidSkillId(uint8 skill);

  function _asSkill(uint8 skill) internal pure returns (Skill) {
    require(skill >= uint8(type(Skill).min) && skill <= uint8(type(Skill).max), InvalidSkillId(skill));
    return Skill(skill);
  }

  function _isSkill(uint8 skill) internal pure returns (bool) {
    return _isSkill(_asSkill(skill));
  }

  function _isSkill(uint8 skill, Skill check) internal pure returns (bool) {
    return _isSkill(_asSkill(skill), check);
  }

  function _isSkillCombat(uint8 skill) internal pure returns (bool) {
    return _isSkillCombat(_asSkill(skill));
  }

  function _isSkillNone(uint8 skill) internal pure returns (bool) {
    return _isSkillNone(_asSkill(skill));
  }

  function _asUint8(Skill skill) internal pure returns (uint8) {
    return uint8(skill);
  }

  function _isSkill(Skill skill) internal pure returns (bool) {
    return !_isSkill(skill, Skill.NONE);
  }

  function _isSkill(Skill skill, Skill check) internal pure returns (bool) {
    return skill == check;
  }

  function _isSkillCombat(Skill skill) internal pure returns (bool) {
    return _isSkill(skill, Skill.COMBAT);
  }

  function _isSkillNone(Skill skill) internal pure returns (bool) {
    return _isSkill(skill, Skill.NONE);
  }
}

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

import {Math} from "@openzeppelin/contracts/utils/math/Math.sol";

import {IItemNFT} from "../interfaces/IItemNFT.sol";
import {IWorldActions} from "../interfaces/IWorldActions.sol";

import {CombatStyleLibrary} from "../libraries/CombatStyleLibrary.sol";
import {SkillLibrary} from "../libraries/SkillLibrary.sol";

import {Skill, CombatStats, CombatStyle, BoostType, Attire} from "../globals/misc.sol";
import {PendingQueuedActionEquipmentState, QueuedAction, ActionChoice, StandardBoostInfo, ExtendedBoostInfo, PackedXP, PendingQueuedActionProcessed, Item, Player, Player, XP_BYTES, IS_FULL_MODE_BIT, HAS_EXTRA_BOOST_BIT, CheckpointEquipments} from "../globals/players.sol";
import {ActionRewards} from "../globals/rewards.sol";
import {NONE} from "../globals/items.sol";
import {RATE_MUL, SPAWN_MUL, GUAR_MUL} from "../globals/actions.sol";

// This file contains methods for interacting with the player that is used to decrease implementation deployment bytecode code.
library PlayersLibrary {
  using CombatStyleLibrary for uint8;
  using SkillLibrary for uint8;
  using SkillLibrary for Skill;

  error InvalidXPSkill();
  error InvalidAction();
  error SkillForPetNotHandledYet();

  // This is to prevent some precision loss in the healing calculations
  uint256 constant HEALING_SCALE = 1_000_000;

  function _getLevel(uint256 xp) internal pure returns (uint16) {
    uint256 low;
    uint256 high = XP_BYTES.length / 4;

    while (low < high) {
      uint256 mid = (low + high) / 2;

      // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
      if (_getXP(mid) > xp) {
        high = mid;
      } else {
        low = mid + 1;
      }
    }

    if (low != 0) {
      return uint16(low);
    } else {
      return 1;
    }
  }

  function getLevel(uint256 xp) external pure returns (uint16) {
    return _getLevel(xp);
  }

  function _getXP(uint256 index) private pure returns (uint32) {
    uint256 key = index * 4;
    return
      uint32(
        XP_BYTES[key] |
          (bytes4(XP_BYTES[key + 1]) >> 8) |
          (bytes4(XP_BYTES[key + 2]) >> 16) |
          (bytes4(XP_BYTES[key + 3]) >> 24)
      );
  }

  function _getRealBalance(
    uint256 originalBalance,
    uint256 itemId,
    PendingQueuedActionEquipmentState[] memory pendingQueuedActionEquipmentStates
  ) private pure returns (uint256 balance) {
    balance = originalBalance;
    for (uint256 i; i < pendingQueuedActionEquipmentStates.length; ++i) {
      PendingQueuedActionEquipmentState memory pendingQueuedActionEquipmentState = pendingQueuedActionEquipmentStates[
        i
      ];
      for (uint256 j; j < pendingQueuedActionEquipmentState.producedItemTokenIds.length; ++j) {
        if (pendingQueuedActionEquipmentState.producedItemTokenIds[j] == itemId) {
          balance += pendingQueuedActionEquipmentState.producedAmounts[j];
        }
      }
      for (uint256 j; j < pendingQueuedActionEquipmentState.consumedItemTokenIds.length; ++j) {
        if (pendingQueuedActionEquipmentState.consumedItemTokenIds[j] == itemId) {
          if (balance >= pendingQueuedActionEquipmentState.consumedAmounts[j]) {
            balance -= pendingQueuedActionEquipmentState.consumedAmounts[j];
          } else {
            balance = 0;
          }
        }
      }
    }
  }

  function getBalanceUsingCheckpoint(
    uint256 itemId,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates,
    CheckpointEquipments calldata checkpointEquipments
  ) private pure returns (uint256 balance) {
    for (uint256 i; i < checkpointEquipments.itemTokenIds.length; ++i) {
      if (checkpointEquipments.itemTokenIds[i] == itemId) {
        return _getRealBalance(checkpointEquipments.balances[i], itemId, pendingQueuedActionEquipmentStates);
      }
    }
  }

  function getBalancesUsingCheckpoint(
    uint16[] memory itemIds,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates,
    CheckpointEquipments calldata checkpointEquipments
  ) private pure returns (uint256[] memory balances) {
    balances = new uint256[](itemIds.length);

    for (uint256 i; i < checkpointEquipments.itemTokenIds.length; ++i) {
      uint256 itemTokenId = checkpointEquipments.itemTokenIds[i];
      uint256 checkpointBalance = checkpointEquipments.balances[i];
      for (uint256 j; j < itemIds.length; ++j) {
        if (itemIds[j] == itemTokenId) {
          balances[j] = _getRealBalance(checkpointBalance, itemIds[j], pendingQueuedActionEquipmentStates);
          break;
        }
      }
    }
  }

  // This takes into account any intermediate changes from previous actions from view functions
  // as those cannot affect the blockchain state with balanceOf
  function getBalanceUsingCurrentBalance(
    address from,
    uint256 itemId,
    address itemNFT,
    PendingQueuedActionEquipmentState[] memory pendingQueuedActionEquipmentStates
  ) public view returns (uint256 balance) {
    balance = _getRealBalance(IItemNFT(itemNFT).balanceOf(from, itemId), itemId, pendingQueuedActionEquipmentStates);
  }

  function getBalanceUsingCurrentBalances(
    address from,
    uint16[] memory itemIds,
    address itemNFT,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates
  ) public view returns (uint256[] memory balances) {
    balances = IItemNFT(itemNFT).balanceOfs(from, itemIds);
    uint256 bounds = balances.length;
    for (uint256 i; i < bounds; ++i) {
      balances[i] = _getRealBalance(balances[i], itemIds[i], pendingQueuedActionEquipmentStates);
    }
  }

  function _getMaxRequiredRatio(
    address from,
    ActionChoice memory actionChoice,
    uint16 baseInputItemsConsumedNum,
    IItemNFT itemNFT,
    PendingQueuedActionEquipmentState[] memory pendingQueuedActionEquipmentStates
  ) private view returns (uint256 maxRequiredRatio) {
    maxRequiredRatio = baseInputItemsConsumedNum;

    if (baseInputItemsConsumedNum != 0) {
      if (actionChoice.inputTokenId1 != 0) {
        maxRequiredRatio = _getMaxRequiredRatioPartial(
          from,
          actionChoice.inputTokenId1,
          actionChoice.inputAmount1,
          maxRequiredRatio,
          itemNFT,
          pendingQueuedActionEquipmentStates
        );
      }
      if (actionChoice.inputTokenId2 != 0) {
        maxRequiredRatio = _getMaxRequiredRatioPartial(
          from,
          actionChoice.inputTokenId2,
          actionChoice.inputAmount2,
          maxRequiredRatio,
          itemNFT,
          pendingQueuedActionEquipmentStates
        );
      }
      if (actionChoice.inputTokenId3 != 0) {
        maxRequiredRatio = _getMaxRequiredRatioPartial(
          from,
          actionChoice.inputTokenId3,
          actionChoice.inputAmount3,
          maxRequiredRatio,
          itemNFT,
          pendingQueuedActionEquipmentStates
        );
      }
    }
  }

  function _getMaxRequiredRatioPartial(
    address from,
    uint16 inputTokenId,
    uint256 inputAmount,
    uint256 prevConsumeMaxRatio,
    IItemNFT itemNFT,
    PendingQueuedActionEquipmentState[] memory pendingQueuedActionEquipmentStates
  ) private view returns (uint256 maxRequiredRatio) {
    uint256 balance = getBalanceUsingCurrentBalance(
      from,
      inputTokenId,
      address(itemNFT),
      pendingQueuedActionEquipmentStates
    );
    uint256 tempMaxRequiredRatio = balance / inputAmount;
    if (tempMaxRequiredRatio < prevConsumeMaxRatio) {
      maxRequiredRatio = tempMaxRequiredRatio;
    } else {
      maxRequiredRatio = prevConsumeMaxRatio;
    }
  }

  function _max(int a, int b) private pure returns (int) {
    return a > b ? a : b;
  }

  function _dmgPerMinute(int attack, int defence, uint8 alphaCombat, uint8 betaCombat) private pure returns (uint256) {
    if (attack == 0) {
      return 0;
    }
    // Negative defence is capped at the negative of the attack value.
    // So an attack of 10 and defence of -15 is the same as attack -10.
    defence = _max(-attack, defence);
    return uint256(_max(1, int128(attack) * int8(alphaCombat) + (attack * 2 - defence) * int8(betaCombat)));
  }

  function dmg(
    int attack,
    int defence,
    uint8 alphaCombat,
    uint8 betaCombat,
    uint256 elapsedTime
  ) public pure returns (uint32) {
    return uint32((_dmgPerMinute(attack, defence, alphaCombat, betaCombat) * elapsedTime) / 60);
  }

  function _fullDmg(
    CombatStats memory combatStats,
    CombatStats memory enemyCombatStats,
    uint8 alphaCombat,
    uint8 betaCombat,
    uint256 elapsedTime
  ) private pure returns (uint32 fullDmg) {
    fullDmg = dmg(combatStats.meleeAttack, enemyCombatStats.meleeDefence, alphaCombat, betaCombat, elapsedTime);
    fullDmg += dmg(combatStats.rangedAttack, enemyCombatStats.rangedDefence, alphaCombat, betaCombat, elapsedTime);
    fullDmg += dmg(combatStats.magicAttack, enemyCombatStats.magicDefence, alphaCombat, betaCombat, elapsedTime);
  }

  function _timeToKill(
    int attack,
    int defence,
    uint8 alphaCombat,
    uint8 betaCombat,
    int16 enemyHealth
  ) private pure returns (uint256) {
    // Formula is max(1, a(atk) + b(2 * atk - def))
    // Always do at least 1 damage per minute
    uint256 dmgPerMinute = _dmgPerMinute(attack, defence, alphaCombat, betaCombat);
    return Math.ceilDiv(uint256(uint16(enemyHealth)) * 60, dmgPerMinute);
  }

  function _timeToKillPlayer(
    CombatStats memory combatStats,
    CombatStats memory enemyCombatStats,
    uint8 alphaCombat,
    uint8 betaCombat,
    int health
  ) private pure returns (uint256) {
    uint256 dmgPerMinute = _dmgPerMinute(
      enemyCombatStats.meleeAttack,
      combatStats.meleeDefence,
      alphaCombat,
      betaCombat
    );
    dmgPerMinute += _dmgPerMinute(enemyCombatStats.rangedAttack, combatStats.rangedDefence, alphaCombat, betaCombat);
    dmgPerMinute += _dmgPerMinute(enemyCombatStats.magicAttack, combatStats.magicDefence, alphaCombat, betaCombat);
    return Math.ceilDiv(uint256(health) * 60, dmgPerMinute);
  }

  function _getTimeToKill(
    Skill skill,
    CombatStats memory combatStats,
    CombatStats memory enemyCombatStats,
    uint8 alphaCombat,
    uint8 betaCombat,
    int16 enemyHealth
  ) private pure returns (uint256 timeToKill) {
    int16 attack;
    int16 defence;
    if (skill == Skill.MELEE) {
      attack = combatStats.meleeAttack;
      defence = enemyCombatStats.meleeDefence;
    } else if (skill == Skill.RANGED) {
      attack = combatStats.rangedAttack;
      defence = enemyCombatStats.rangedDefence;
    } else if (skill == Skill.MAGIC) {
      attack = combatStats.magicAttack;
      defence = enemyCombatStats.magicDefence;
    } else {
      assert(false);
    }

    timeToKill = _timeToKill(attack, defence, alphaCombat, betaCombat, enemyHealth);
  }

  function _getDmgDealtByPlayer(
    ActionChoice memory actionChoice,
    CombatStats memory combatStats,
    CombatStats memory enemyCombatStats,
    uint8 alphaCombat,
    uint8 betaCombat,
    uint256 elapsedTime
  ) private pure returns (uint32 dmgDealt) {
    Skill skill = actionChoice.skill._asSkill();
    if (skill == Skill.MELEE) {
      dmgDealt = dmg(combatStats.meleeAttack, enemyCombatStats.meleeDefence, alphaCombat, betaCombat, elapsedTime);
    } else if (skill == Skill.RANGED) {
      dmgDealt = dmg(combatStats.rangedAttack, enemyCombatStats.rangedDefence, alphaCombat, betaCombat, elapsedTime);
    } else if (skill == Skill.MAGIC) {
      // Assumes this is a magic action
      dmgDealt = dmg(combatStats.magicAttack, enemyCombatStats.magicDefence, alphaCombat, betaCombat, elapsedTime);
    } else {
      assert(false);
    }
  }

  function determineBattleOutcome(
    address from,
    address itemNFT,
    uint256 elapsedTime,
    ActionChoice calldata actionChoice,
    uint16 regenerateId,
    uint256 numSpawnedPerHour,
    CombatStats memory combatStats,
    CombatStats calldata enemyCombatStats,
    uint8 alphaCombat,
    uint8 betaCombat,
    uint8 alphaCombatHealing,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates
  )
    external
    view
    returns (
      uint256 xpElapsedTime,
      uint256 combatElapsedTime,
      uint16 baseInputItemsConsumedNum,
      uint16 foodConsumed,
      bool died
    )
  {
    return
      _determineBattleOutcome(
        from,
        itemNFT,
        elapsedTime,
        actionChoice,
        regenerateId,
        numSpawnedPerHour,
        combatStats,
        enemyCombatStats,
        alphaCombat,
        betaCombat,
        alphaCombatHealing,
        pendingQueuedActionEquipmentStates
      );
  }

  function _determineBattleOutcome(
    address from,
    address itemNFT,
    uint256 elapsedTime,
    ActionChoice memory actionChoice,
    uint16 regenerateId,
    uint256 numSpawnedPerHour,
    CombatStats memory combatStats,
    CombatStats memory enemyCombatStats,
    uint8 alphaCombat,
    uint8 betaCombat,
    uint8 alphaCombatHealing,
    PendingQueuedActionEquipmentState[] memory pendingQueuedActionEquipmentStates
  )
    internal
    view
    returns (
      uint256 xpElapsedTime,
      uint256 combatElapsedTime,
      uint16 baseInputItemsConsumedNum,
      uint16 foodConsumed,
      bool died
    )
  {
    uint256 respawnTime = (3600 * SPAWN_MUL) / numSpawnedPerHour;
    uint32 dmgDealt = _getDmgDealtByPlayer(
      actionChoice,
      combatStats,
      enemyCombatStats,
      alphaCombat,
      betaCombat,
      respawnTime
    );

    uint256 combatTimePerKill = _getTimeToKill(
      actionChoice.skill._asSkill(),
      combatStats,
      enemyCombatStats,
      alphaCombat,
      betaCombat,
      enemyCombatStats.health
    );

    // Steps for this:
    // 1 - Work out best case scenario for how many we can kill in the elapsed time assuming we have enough food and consumables
    // 2 - Now work out how many we can kill in the combat time based on how many consumables we actually have
    // 3 - Now work out how many we can kill in the elapsed time based on how much food we actually have and adjust combat time
    // 3.5 - If not enough food (i.e died) then backtrack the scrolls.

    // Time spent in comabt with the enemies that were killed, needed in case foodConsumed gets maxed out
    uint256 combatElapsedTimeKilling;
    uint256 numKilled;
    bool canKillAll = dmgDealt > uint16(enemyCombatStats.health);
    if (canKillAll) {
      // But how many can we kill in the time that has elapsed?
      numKilled = (elapsedTime * numSpawnedPerHour) / (3600 * SPAWN_MUL);
      uint256 combatTimePerEnemy = Math.ceilDiv(uint16(enemyCombatStats.health) * respawnTime, dmgDealt);
      combatElapsedTime = combatTimePerEnemy * numKilled;
      combatElapsedTimeKilling = combatElapsedTime;
      // Add remainder combat time to current monster you are fighting
      combatElapsedTime += Math.min(combatTimePerEnemy, elapsedTime - respawnTime * numKilled);
    } else {
      numKilled = elapsedTime / combatTimePerKill;
      combatElapsedTimeKilling = combatTimePerKill * numKilled;
      combatElapsedTime = elapsedTime;
    }

    xpElapsedTime = respawnTime * numKilled;

    // Step 2 - Work out how many consumables are used
    // Check how many to consume, and also adjust xpElapsedTime if they don't have enough consumables
    uint256 maxRequiredBaseInputItemsConsumedRatio = baseInputItemsConsumedNum;
    if (actionChoice.rate != 0) {
      baseInputItemsConsumedNum = uint16(
        Math.max(numKilled, Math.ceilDiv(combatElapsedTime * actionChoice.rate, 3600 * RATE_MUL))
      );

      // This checks the balances
      maxRequiredBaseInputItemsConsumedRatio = _getMaxRequiredRatio(
        from,
        actionChoice,
        baseInputItemsConsumedNum,
        IItemNFT(itemNFT),
        pendingQueuedActionEquipmentStates
      );

      if (baseInputItemsConsumedNum == 0) {
        // Requires input items but we don't have any. In combat the entire time getting rekt
        xpElapsedTime = 0;
        combatElapsedTime = elapsedTime;
      } else if (baseInputItemsConsumedNum > maxRequiredBaseInputItemsConsumedRatio) {
        numKilled = (numKilled * maxRequiredBaseInputItemsConsumedRatio) / baseInputItemsConsumedNum;
        xpElapsedTime = respawnTime * numKilled;
        baseInputItemsConsumedNum = uint16(maxRequiredBaseInputItemsConsumedRatio);

        if (canKillAll) {
          uint256 combatTimePerEnemy = Math.ceilDiv(uint16(enemyCombatStats.health) * respawnTime, dmgDealt);
          combatElapsedTime = combatTimePerEnemy * numKilled;
          combatElapsedTimeKilling = combatElapsedTime;
          combatElapsedTime += elapsedTime - (respawnTime * numKilled);
        } else {
          // In combat the entire time
          combatElapsedTime = elapsedTime;
          combatElapsedTimeKilling = combatTimePerKill * numKilled;
        }
      }
    }

    // Calculate combat damage
    // Step 3 - Calculate raw damage taken
    int32 totalHealthLost = int32(_fullDmg(enemyCombatStats, combatStats, alphaCombat, betaCombat, combatElapsedTime));

    // Take away our health points from the total dealt to us
    totalHealthLost -= combatStats.health;

    int32 totalHealthLostOnlyKilled = int32(
      _fullDmg(enemyCombatStats, combatStats, alphaCombat, betaCombat, combatElapsedTimeKilling)
    );

    totalHealthLostOnlyKilled -= combatStats.health;

    int32 playerHealth = combatStats.health;
    uint256 totalFoodRequiredKilling;
    (foodConsumed, totalFoodRequiredKilling, died) = _getFoodConsumed(
      from,
      regenerateId,
      totalHealthLost > 0 ? uint32(totalHealthLost) : 0,
      totalHealthLostOnlyKilled > 0 ? uint32(totalHealthLostOnlyKilled) : 0,
      playerHealth,
      alphaCombatHealing,
      itemNFT,
      pendingQueuedActionEquipmentStates
    );

    // Didn't have enough food to survive the best case combat scenario
    if (died) {
      uint256 healthRestored;
      if (regenerateId != NONE) {
        Item memory item = IItemNFT(itemNFT).getItem(regenerateId);
        healthRestored = item.healthRestored;
      }

      // Calculate total health using raw values
      int256 totalHealth = playerHealth + int256(uint256(foodConsumed * healthRestored));
      // How much combat time is required to kill the player
      uint256 killPlayerTime = _timeToKillPlayer(combatStats, enemyCombatStats, alphaCombat, betaCombat, totalHealth);

      combatElapsedTime = Math.min(combatElapsedTime, killPlayerTime); // Needed?
      if (healthRestored == 0 || totalHealthLost <= 0) {
        // No food attached or didn't lose any health

        if (canKillAll) {
          uint256 combatTimePerEnemy = Math.ceilDiv(uint16(enemyCombatStats.health) * respawnTime, dmgDealt);
          numKilled = combatElapsedTime / combatTimePerEnemy;
        } else {
          // In combat the entire time
          numKilled = combatElapsedTime / combatTimePerKill;
        }
      } else {
        // How many can we kill with the food we did consume
        if (totalFoodRequiredKilling != 0) {
          if (foodConsumed < totalFoodRequiredKilling) {
            numKilled = (numKilled * foodConsumed) / totalFoodRequiredKilling;
          }
        } else {
          numKilled = 0;
        }
      }
      xpElapsedTime = respawnTime * numKilled;

      // Step 3.5 - Wasn't enough food, so work out how many consumables we actually used.
      if (actionChoice.rate != 0) {
        // Make sure we use at least 1 per kill
        baseInputItemsConsumedNum = uint16(
          Math.max(numKilled, Math.ceilDiv(combatElapsedTime * actionChoice.rate, 3600 * RATE_MUL))
        );

        // Make sure we don't go above the maximum amount of consumables (scrolls/arrows) that we actually have
        if (baseInputItemsConsumedNum > maxRequiredBaseInputItemsConsumedRatio) {
          uint256 newMaxRequiredBaseInputItemsConsumedRatio = _getMaxRequiredRatio(
            from,
            actionChoice,
            baseInputItemsConsumedNum,
            IItemNFT(itemNFT),
            pendingQueuedActionEquipmentStates
          );

          baseInputItemsConsumedNum = uint16(
            Math.min(baseInputItemsConsumedNum, newMaxRequiredBaseInputItemsConsumedRatio)
          );
        }
      }
    }
  }

  function _calculateHealingDoneFromHealth(
    uint256 health,
    uint256 alphaCombatHealing
  ) private pure returns (uint256 healingDoneFromHealth) {
    // healing fraction = 1 + (alphaCombatHealing * health / 100)
    uint256 scaledHealth = ((HEALING_SCALE * alphaCombatHealing) / 100) * health;
    uint256 divisor = 100;
    healingDoneFromHealth = HEALING_SCALE + scaledHealth / divisor;
  }

  function _calculateTotalFoodRequired(
    uint256 totalHealthLost,
    uint256 healthRestoredFromItem,
    uint256 healingDoneFromHealth
  ) private pure returns (uint256 totalFoodRequired) {
    uint256 numerator = totalHealthLost * HEALING_SCALE;
    uint256 denominator = healthRestoredFromItem * healingDoneFromHealth;
    totalFoodRequired = Math.ceilDiv(numerator, denominator);
  }

  function _getFoodConsumed(
    address from,
    uint16 regenerateId,
    uint32 totalHealthLost,
    uint32 totalHealthLostKilling,
    int32 totalHealthPlayer,
    uint256 alphaCombatHealing,
    address itemNFT,
    PendingQueuedActionEquipmentState[] memory pendingQueuedActionEquipmentStates
  ) private view returns (uint16 foodConsumed, uint256 totalFoodRequiredKilling, bool died) {
    uint256 healthRestoredFromItem;
    if (regenerateId != NONE) {
      Item memory item = IItemNFT(itemNFT).getItem(regenerateId);
      healthRestoredFromItem = item.healthRestored;
    }

    if (healthRestoredFromItem == 0 || totalHealthLost <= 0) {
      // No food attached or didn't lose any health
      died = totalHealthLost != 0;
    } else {
      // Only use positive values for healing bonus
      uint256 effectiveHealth = totalHealthPlayer > 0 ? uint32(totalHealthPlayer) : 0;
      uint256 healingDoneFromHealth = _calculateHealingDoneFromHealth(effectiveHealth, alphaCombatHealing);
      uint256 totalFoodRequired = _calculateTotalFoodRequired(
        totalHealthLost,
        healthRestoredFromItem,
        healingDoneFromHealth
      );
      totalFoodRequiredKilling = _calculateTotalFoodRequired(
        totalHealthLostKilling,
        healthRestoredFromItem,
        healingDoneFromHealth
      );

      uint256 balance = getBalanceUsingCurrentBalance(from, regenerateId, itemNFT, pendingQueuedActionEquipmentStates);

      // Can only consume a maximum of 65535 food
      if (totalFoodRequired > type(uint16).max) {
        died = true;
      } else {
        died = totalFoodRequired > balance;
      }

      if (died) {
        foodConsumed = uint16(balance > type(uint16).max ? type(uint16).max : balance);
      } else {
        foodConsumed = uint16(totalFoodRequired);
      }
    }
  }

  function getNonCombatAdjustedElapsedTime(
    address from,
    address itemNFT,
    uint256 elapsedTime,
    ActionChoice calldata actionChoice,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates
  ) external view returns (uint256 xpElapsedTime, uint16 baseInputItemsConsumedNum) {
    // Check the max that can be used
    baseInputItemsConsumedNum = uint16((elapsedTime * actionChoice.rate) / (3600 * RATE_MUL));

    if (baseInputItemsConsumedNum != 0) {
      // This checks the balances
      uint256 maxRequiredRatio = _getMaxRequiredRatio(
        from,
        actionChoice,
        baseInputItemsConsumedNum,
        IItemNFT(itemNFT),
        pendingQueuedActionEquipmentStates
      );
      bool hadEnoughConsumables = baseInputItemsConsumedNum <= maxRequiredRatio;
      if (!hadEnoughConsumables) {
        baseInputItemsConsumedNum = uint16(maxRequiredRatio);
      }
    }

    // Work out what the actual elapsedTime should be had all those been made
    xpElapsedTime = (uint256(baseInputItemsConsumedNum) * 3600 * RATE_MUL) / actionChoice.rate;
  }

  function _getBoostedTime(
    uint256 actionStartTime,
    uint256 elapsedTime,
    uint40 boostStartTime,
    uint24 boostDuration
  ) internal pure returns (uint24 boostedTime) {
    // Calculate time overlap between action and boost periods
    uint256 actionEndTime = actionStartTime + elapsedTime;
    uint256 boostEndTime = boostStartTime + boostDuration;

    // If there's no overlap or no elapsed time, boosted time is 0
    if (actionStartTime >= boostEndTime || actionEndTime <= boostStartTime || elapsedTime == 0) {
      boostedTime = 0;
    } else {
      // Calculate overlap using max of start times and min of end times
      uint256 overlapStart = actionStartTime > boostStartTime ? actionStartTime : boostStartTime;
      uint256 overlapEnd = actionEndTime < boostEndTime ? actionEndTime : boostEndTime;
      boostedTime = uint24(overlapEnd - overlapStart);
    }
  }

  function getBoostedTime(
    uint256 actionStartTime,
    uint256 elapsedTime,
    uint40 boostStartTime,
    uint24 boostDuration
  ) external pure returns (uint24) {
    return _getBoostedTime(actionStartTime, elapsedTime, boostStartTime, boostDuration);
  }

  function _getXPFromBoostImpl(
    bool isCombatSkill,
    uint256 actionStartTime,
    uint256 xpElapsedTime,
    uint24 xpPerHour,
    BoostType boostType,
    uint40 boostStartTime,
    uint24 boostDuration,
    uint16 boostValue
  ) private pure returns (uint32 boostPointsAccrued) {
    if (
      boostType == BoostType.ANY_XP ||
      (isCombatSkill && boostType == BoostType.COMBAT_XP) ||
      (!isCombatSkill && boostType == BoostType.NON_COMBAT_XP)
    ) {
      uint256 boostedTime = _getBoostedTime(actionStartTime, xpElapsedTime, boostStartTime, boostDuration);
      boostPointsAccrued = uint32((boostedTime * xpPerHour * boostValue) / (3600 * 100));
    }
  }

  function _getXPFromBoost(
    bool isCombatSkill,
    uint256 actionStartTime,
    uint256 xpElapsedTime,
    uint24 xpPerHour,
    BoostType boostType,
    uint40 boostStartTime,
    uint24 boostDuration,
    uint16 boostValue
  ) private pure returns (uint32 boostPointsAccrued) {
    return
      _getXPFromBoostImpl(
        isCombatSkill,
        actionStartTime,
        xpElapsedTime,
        xpPerHour,
        boostType,
        boostStartTime,
        boostDuration,
        boostValue
      );
  }

  function _extraBoostFromFullAttire(
    uint16[] memory itemTokenIds,
    uint256[] memory balances,
    uint16[5] calldata expectedItemTokenIds
  ) private pure returns (bool matches) {
    // Check if they have the full equipment required
    if (itemTokenIds.length == 5) {
      for (uint256 i; i < 5; ++i) {
        if (itemTokenIds[i] != expectedItemTokenIds[i] || balances[i] == 0) {
          return false;
        }
      }
      return true;
    }
  }

  function subtractMatchingRewards(
    uint256[] calldata newIds,
    uint256[] calldata newAmounts,
    uint256[] calldata prevNewIds,
    uint256[] calldata prevNewAmounts
  ) external pure returns (uint256[] memory ids, uint256[] memory amounts) {
    // Subtract previous rewards. If amount is zero after, replace with end and reduce the array size
    ids = newIds;
    amounts = newAmounts;
    uint256 prevNewIdsLength = prevNewIds.length;
    for (uint256 i; i < prevNewIdsLength; ++i) {
      uint16 prevNewId = uint16(prevNewIds[i]);
      uint24 prevNewAmount = uint24(prevNewAmounts[i]);
      uint256 length = ids.length;
      for (uint256 j = 0; j < length; ++j) {
        if (ids[j] == prevNewId) {
          amounts[j] -= prevNewAmount;
          if (amounts[j] == 0) {
            ids[j] = ids[ids.length - 1];
            amounts[j] = amounts[amounts.length - 1];

            assembly ("memory-safe") {
              mstore(ids, length)
              mstore(amounts, length)
            }
            --length;
          }
          break;
        }
      }
    }
  }

  function _readXP(Skill skill, PackedXP storage packedXP) internal view returns (uint256) {
    require(!skill._isSkillCombat() && !skill._isSkill(Skill.TRAVELING), InvalidXPSkill());
    if (skill._isSkillNone()) {
      return 0;
    }
    uint256 offset = 2; // Accounts for NONE & COMBAT meta-skills
    uint256 val = uint8(skill) - offset;
    uint256 slotNum = val / 6;
    uint256 relativePos = val % 6;

    uint256 slotVal;
    assembly ("memory-safe") {
      slotVal := sload(add(packedXP.slot, slotNum))
    }

    return uint40(slotVal >> (relativePos * 40));
  }

  function readXP(Skill skill, PackedXP storage packedXP) external view returns (uint256) {
    return _readXP(skill, packedXP);
  }

  function getCombatStatsFromHero(
    PendingQueuedActionProcessed calldata pendingQueuedActionProcessed,
    PackedXP storage packedXP
  ) external view returns (CombatStats memory combatStats) {
    combatStats.meleeAttack = int16(
      _getLevel(_getAbsoluteActionStartXP(Skill.MELEE, pendingQueuedActionProcessed, packedXP))
    );
    combatStats.rangedAttack = int16(
      _getLevel(_getAbsoluteActionStartXP(Skill.RANGED, pendingQueuedActionProcessed, packedXP))
    );
    combatStats.magicAttack = int16(
      _getLevel(_getAbsoluteActionStartXP(Skill.MAGIC, pendingQueuedActionProcessed, packedXP))
    );
    combatStats.health = int16(
      _getLevel(_getAbsoluteActionStartXP(Skill.HEALTH, pendingQueuedActionProcessed, packedXP))
    );
    uint16 defenceLevel = _getLevel(_getAbsoluteActionStartXP(Skill.DEFENCE, pendingQueuedActionProcessed, packedXP));
    combatStats.meleeDefence = int16(defenceLevel);
    combatStats.rangedDefence = int16(defenceLevel);
    combatStats.magicDefence = int16(defenceLevel);
  }

  function updateCombatStatsFromAttire(
    CombatStats memory combatStats,
    address itemNFT,
    Attire storage attire,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates,
    CheckpointEquipments calldata checkpointEquipments
  ) external view returns (CombatStats memory statsOut) {
    statsOut = combatStats;
    bool skipNonFullAttire;
    (uint16[] memory itemTokenIds, uint256[] memory balances) = getAttireWithBalance(
      attire,
      skipNonFullAttire,
      pendingQueuedActionEquipmentStates,
      checkpointEquipments
    );
    if (itemTokenIds.length != 0) {
      Item[] memory items = IItemNFT(itemNFT).getItems(itemTokenIds);
      for (uint256 i = 0; i < items.length; ++i) {
        if (balances[i] != 0) {
          _updateCombatStatsFromItem(statsOut, items[i]);
        }
      }
    }
  }

  // none of the combat stats are allowed to be negative at this point
  function updateCombatStatsFromPet(
    CombatStats memory combatStats,
    uint8 skillEnhancement1,
    uint8 skillFixedEnhancement1,
    uint8 skillPercentageEnhancement1,
    uint8 skillEnhancement2,
    uint8 skillFixedEnhancement2,
    uint8 skillPercentageEnhancement2
  ) external pure returns (CombatStats memory statsOut) {
    statsOut = combatStats;
    Skill skill1 = skillEnhancement1._asSkill();
    if (skill1 == Skill.HEALTH) {
      statsOut.health += int16(skillFixedEnhancement1 + (uint16(statsOut.health) * skillPercentageEnhancement1) / 100);
    } else if (skill1 == Skill.MELEE) {
      statsOut.meleeAttack += int16(
        skillFixedEnhancement1 + (uint16(statsOut.meleeAttack) * skillPercentageEnhancement1) / 100
      );
    } else if (skill1 == Skill.RANGED) {
      statsOut.rangedAttack += int16(
        skillFixedEnhancement1 + (uint16(statsOut.rangedAttack) * skillPercentageEnhancement1) / 100
      );
    } else if (skill1 == Skill.MAGIC) {
      statsOut.magicAttack += int16(
        skillFixedEnhancement1 + (uint16(statsOut.magicAttack) * skillPercentageEnhancement1) / 100
      );
    } else if (skill1 == Skill.DEFENCE) {
      statsOut.meleeDefence += int16(
        skillFixedEnhancement1 + (uint16(statsOut.meleeDefence) * skillPercentageEnhancement1) / 100
      );
      statsOut.rangedDefence += int16(
        skillFixedEnhancement1 + (uint16(statsOut.rangedDefence) * skillPercentageEnhancement1) / 100
      );
      statsOut.magicDefence += int16(
        skillFixedEnhancement1 + (uint16(statsOut.magicDefence) * skillPercentageEnhancement1) / 100
      );
    } else {
      revert SkillForPetNotHandledYet();
    }

    Skill skill2 = skillEnhancement2._asSkill();
    if (skill2 != Skill.NONE) {
      if (skill2 == Skill.DEFENCE) {
        statsOut.meleeDefence += int16(
          skillFixedEnhancement2 + (uint16(statsOut.meleeDefence) * skillPercentageEnhancement2) / 100
        );
        statsOut.rangedDefence += int16(
          skillFixedEnhancement2 + (uint16(statsOut.rangedDefence) * skillPercentageEnhancement2) / 100
        );
        statsOut.magicDefence += int16(
          skillFixedEnhancement2 + (uint16(statsOut.magicDefence) * skillPercentageEnhancement2) / 100
        );
      } else {
        revert SkillForPetNotHandledYet();
      }
    }
  }

  // 2 versions of getAttireWithBalance exist, 1 has storage attire and the other has calldata attire. This is to
  // allow more versions of versions to accept storage attire.
  function getAttireWithBalance(
    Attire calldata attire,
    bool skipNonFullAttire,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates,
    CheckpointEquipments calldata checkpointEquipments
  ) public pure returns (uint16[] memory itemTokenIds, uint256[] memory balances) {
    uint256 attireLength;
    itemTokenIds = new uint16[](7);
    if (attire.head != NONE) {
      itemTokenIds[attireLength++] = attire.head;
    }
    if (attire.neck != NONE && !skipNonFullAttire) {
      itemTokenIds[attireLength++] = attire.neck;
    }
    if (attire.body != NONE) {
      itemTokenIds[attireLength++] = attire.body;
    }
    if (attire.arms != NONE) {
      itemTokenIds[attireLength++] = attire.arms;
    }
    if (attire.legs != NONE) {
      itemTokenIds[attireLength++] = attire.legs;
    }
    if (attire.feet != NONE) {
      itemTokenIds[attireLength++] = attire.feet;
    }
    if (attire.ring != NONE && !skipNonFullAttire) {
      itemTokenIds[attireLength++] = attire.ring;
    }

    assembly ("memory-safe") {
      mstore(itemTokenIds, attireLength)
    }

    if (attireLength != 0) {
      balances = getBalancesUsingCheckpoint(itemTokenIds, pendingQueuedActionEquipmentStates, checkpointEquipments);
    }
  }

  function getAttireTokenIds(
    Attire memory attire,
    bool skipNonFullAttire
  ) public pure returns (uint16[] memory itemTokenIds) {
    uint256 attireLength;
    itemTokenIds = new uint16[](7);
    if (attire.head != NONE) {
      itemTokenIds[attireLength++] = attire.head;
    }
    if (attire.neck != NONE && !skipNonFullAttire) {
      itemTokenIds[attireLength++] = attire.neck;
    }
    if (attire.body != NONE) {
      itemTokenIds[attireLength++] = attire.body;
    }
    if (attire.arms != NONE) {
      itemTokenIds[attireLength++] = attire.arms;
    }
    if (attire.legs != NONE) {
      itemTokenIds[attireLength++] = attire.legs;
    }
    if (attire.feet != NONE) {
      itemTokenIds[attireLength++] = attire.feet;
    }
    if (attire.ring != NONE && !skipNonFullAttire) {
      itemTokenIds[attireLength++] = attire.ring;
    }
    assembly ("memory-safe") {
      mstore(itemTokenIds, attireLength)
    }
  }

  function getAttireWithCurrentBalance(
    address from,
    Attire memory attire,
    address itemNFT,
    bool skipNonFullAttire
  ) external view returns (uint16[] memory itemTokenIds, uint256[] memory balances) {
    itemTokenIds = getAttireTokenIds(attire, skipNonFullAttire);
    if (itemTokenIds.length != 0) {
      balances = IItemNFT(itemNFT).balanceOfs(from, itemTokenIds);
    }
  }

  function getAttireWithBalance(
    Attire storage attire,
    bool skipNonFullAttire,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates,
    CheckpointEquipments calldata checkpointEquipments
  ) public pure returns (uint16[] memory itemTokenIds, uint256[] memory balances) {
    itemTokenIds = getAttireTokenIds(attire, skipNonFullAttire);
    if (itemTokenIds.length != 0) {
      balances = getBalancesUsingCheckpoint(itemTokenIds, pendingQueuedActionEquipmentStates, checkpointEquipments);
    }
  }

  // Subtract any existing xp gained from the first in-progress actions and add the new xp gained
  function getAbsoluteActionStartXP(
    uint8 skillId,
    PendingQueuedActionProcessed calldata pendingQueuedActionProcessed,
    PackedXP storage packedXP
  ) public view returns (uint256) {
    return _getAbsoluteActionStartXP(skillId._asSkill(), pendingQueuedActionProcessed, packedXP);
  }

  // Subtract any existing xp gained from the first in-progress actions and add the new xp gained
  function _getAbsoluteActionStartXP(
    Skill skill,
    PendingQueuedActionProcessed calldata pendingQueuedActionProcessed,
    PackedXP storage packedXP
  ) internal view returns (uint256) {
    uint256 xp = _readXP(skill, packedXP);
    if (pendingQueuedActionProcessed.currentAction.skill1 == skill) {
      xp -= pendingQueuedActionProcessed.currentAction.xpGained1;
    } else if (pendingQueuedActionProcessed.currentAction.skill2 == skill) {
      xp -= pendingQueuedActionProcessed.currentAction.xpGained2;
    } else if (pendingQueuedActionProcessed.currentAction.skill3 == skill) {
      xp -= pendingQueuedActionProcessed.currentAction.xpGained3;
    }

    // Add any new xp gained from previous actions now completed that haven't been pushed to the blockchain yet. For instance
    // battling monsters may increase your level so you are stronger for a later queued action.
    for (uint256 i; i < pendingQueuedActionProcessed.skills.length; ++i) {
      if (pendingQueuedActionProcessed.skills[i] == skill) {
        xp += pendingQueuedActionProcessed.xpGainedSkills[i];
      }
    }

    return xp;
  }

  function updateStatsFromHandEquipment(
    address itemNFT,
    uint16[2] calldata handEquipmentTokenIds,
    CombatStats calldata combatStats,
    bool isCombat,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates,
    uint16 handItemTokenIdRangeMin,
    CheckpointEquipments calldata checkpointEquipments
  ) external view returns (bool missingRequiredHandEquipment, CombatStats memory statsOut) {
    statsOut = combatStats;
    for (uint256 i = 0; i < handEquipmentTokenIds.length; ++i) {
      uint16 handEquipmentTokenId = handEquipmentTokenIds[i];
      if (handEquipmentTokenId != NONE) {
        uint256 balance = getBalanceUsingCheckpoint(
          handEquipmentTokenId,
          pendingQueuedActionEquipmentStates,
          checkpointEquipments
        );
        if (balance == 0) {
          // Assume that if the player doesn't have the non-combat item that this action cannot be done or if the action choice required it (e.g range bows)
          if (!isCombat || handItemTokenIdRangeMin != NONE) {
            missingRequiredHandEquipment = true;
          }
        } else if (isCombat) {
          // Update the combat stats
          Item memory item = IItemNFT(itemNFT).getItem(handEquipmentTokenId);
          _updateCombatStatsFromItem(statsOut, item);
        }
      }
    }
  }

  function _updateCombatStatsFromItem(CombatStats memory combatStats, Item memory item) internal pure {
    combatStats.meleeAttack += item.meleeAttack;
    combatStats.rangedAttack += item.rangedAttack;
    combatStats.magicAttack += item.magicAttack;
    combatStats.meleeDefence += item.meleeDefence;
    combatStats.rangedDefence += item.rangedDefence;
    combatStats.magicDefence += item.magicDefence;
    combatStats.health += item.health;
  }

  function getBonusAvatarXPPercent(Player storage player, uint8 skillId) public view returns (uint8 bonusPercent) {
    return _getBonusAvatarXPPercent(player, skillId._asSkill());
  }

  function _getBonusAvatarXPPercent(Player storage player, Skill skill) internal view returns (uint8 bonusPercent) {
    bool hasBonusSkill = player.skillBoosted1 == skill || player.skillBoosted2 == skill;
    if (!hasBonusSkill) {
      return 0;
    }
    bool bothSet = player.skillBoosted1 != Skill.NONE && player.skillBoosted2 != Skill.NONE;
    bonusPercent = bothSet ? 5 : 10;
    // Upgraded characters get double base bonus stats
    bool isUpgraded = uint8(player.packedData >> IS_FULL_MODE_BIT) & 1 == 1;
    bonusPercent = isUpgraded ? bonusPercent * 2 : bonusPercent;
  }

  function _extraFromAvatar(
    Player storage player,
    Skill skill,
    uint256 elapsedTime,
    uint24 xpPerHour
  ) internal view returns (uint32 extraPointsAccrued) {
    uint8 bonusPercent = _getBonusAvatarXPPercent(player, skill);
    extraPointsAccrued = uint32((elapsedTime * xpPerHour * bonusPercent) / (3600 * 100));
  }

  function getPointsAccrued(
    Player storage player,
    QueuedAction storage queuedAction,
    uint256 startTime,
    uint8 skillId,
    uint256 xpElapsedTime,
    Attire storage attire,
    ExtendedBoostInfo storage playerBoost,
    StandardBoostInfo storage globalBoost,
    StandardBoostInfo storage clanBoost,
    address worldActions,
    uint8 bonusAttirePercent,
    uint16[5] calldata expectedItemTokenIds,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates,
    CheckpointEquipments calldata checkpointEquipments
  ) external view returns (uint32 pointsAccrued, uint32 pointsAccruedExclBaseBoost) {
    Skill skill = skillId._asSkill();
    bool isCombatSkill = queuedAction.combatStyle._isCombatStyle();
    uint24 xpPerHour = IWorldActions(worldActions).getXPPerHour(
      queuedAction.actionId,
      isCombatSkill ? NONE : queuedAction.choiceId
    );
    // Add logs right after base XP calculation
    pointsAccrued = uint32((xpElapsedTime * xpPerHour) / 3600);
    // Normal Player specific boosts
    pointsAccrued += _getXPFromBoost(
      isCombatSkill,
      startTime,
      xpElapsedTime,
      xpPerHour,
      playerBoost.boostType,
      playerBoost.startTime,
      playerBoost.duration,
      playerBoost.value
    );
    pointsAccrued += _getXPFromBoost(
      isCombatSkill,
      startTime,
      xpElapsedTime,
      xpPerHour,
      playerBoost.lastBoostType,
      playerBoost.lastStartTime,
      playerBoost.lastDuration,
      playerBoost.lastValue
    );
    // Any extra boosts like wish or lucky boosts. Only needed if bit is set (TODO)
    if (((uint8(playerBoost.packedData) >> HAS_EXTRA_BOOST_BIT) & 1) == 1) {
      pointsAccrued += _getXPFromBoost(
        isCombatSkill,
        startTime,
        xpElapsedTime,
        xpPerHour,
        playerBoost.extraBoostType,
        playerBoost.extraStartTime,
        playerBoost.extraDuration,
        playerBoost.extraValue
      );
      pointsAccrued += _getXPFromBoost(
        isCombatSkill,
        startTime,
        xpElapsedTime,
        xpPerHour,
        playerBoost.lastExtraBoostType,
        playerBoost.lastExtraStartTime,
        playerBoost.lastExtraDuration,
        playerBoost.lastExtraValue
      );
    }
    // Global boost
    StandardBoostInfo memory globalBoost_ = globalBoost;
    pointsAccrued += _getXPFromBoost(
      isCombatSkill,
      startTime,
      xpElapsedTime,
      xpPerHour,
      globalBoost_.boostType,
      globalBoost_.startTime,
      globalBoost_.duration,
      globalBoost_.value
    );
    pointsAccrued += _getXPFromBoost(
      isCombatSkill,
      startTime,
      xpElapsedTime,
      xpPerHour,
      globalBoost_.lastBoostType,
      globalBoost_.lastStartTime,
      globalBoost_.lastDuration,
      globalBoost_.lastValue
    );
    StandardBoostInfo memory clanBoost_ = clanBoost;
    // Clan boost
    pointsAccrued += _getXPFromBoost(
      isCombatSkill,
      startTime,
      xpElapsedTime,
      xpPerHour,
      clanBoost_.boostType,
      clanBoost_.startTime,
      clanBoost_.duration,
      clanBoost_.value
    );
    pointsAccrued += _getXPFromBoost(
      isCombatSkill,
      startTime,
      xpElapsedTime,
      xpPerHour,
      clanBoost_.lastBoostType,
      clanBoost_.lastStartTime,
      clanBoost_.lastDuration,
      clanBoost_.lastValue
    );

    pointsAccrued += _extraXPFromFullAttire(
      attire,
      xpElapsedTime,
      xpPerHour,
      bonusAttirePercent,
      expectedItemTokenIds,
      pendingQueuedActionEquipmentStates,
      checkpointEquipments
    );
    pointsAccruedExclBaseBoost = pointsAccrued;
    pointsAccrued += _extraFromAvatar(player, skill, xpElapsedTime, xpPerHour);
  }

  function _extraXPFromFullAttire(
    Attire storage attire,
    uint256 elapsedTime,
    uint24 xpPerHour,
    uint8 bonusPercent,
    uint16[5] calldata expectedItemTokenIds,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates,
    CheckpointEquipments calldata checkpointEquipments
  ) internal pure returns (uint32 extraPointsAccrued) {
    if (bonusPercent == 0) {
      return 0;
    }
    // Check if they have the full equipment set, if so they can get some bonus
    bool skipNonFullAttire = true;
    (uint16[] memory itemTokenIds, uint256[] memory balances) = getAttireWithBalance(
      attire,
      skipNonFullAttire,
      pendingQueuedActionEquipmentStates,
      checkpointEquipments
    );
    bool hasFullAttire = _extraBoostFromFullAttire(itemTokenIds, balances, expectedItemTokenIds);
    if (hasFullAttire) {
      extraPointsAccrued = uint32((elapsedTime * xpPerHour * bonusPercent) / (3600 * 100));
    }
  }

  function getSuccessPercent(
    uint16 actionId,
    uint8 actionSkillId,
    bool isCombat,
    PendingQueuedActionProcessed calldata pendingQueuedActionProcessed,
    address worldActions,
    uint256 maxSuccessPercentChange,
    PackedXP storage packedXP
  ) external view returns (uint8 successPercent) {
    successPercent = 100;
    (uint8 actionSuccessPercent, uint32 minXP) = IWorldActions(worldActions).getActionSuccessPercentAndMinXP(actionId);
    if (actionSuccessPercent != 100) {
      require(!isCombat, InvalidAction());

      uint256 minLevel = _getLevel(minXP);
      uint256 skillLevel = _getLevel(
        _getAbsoluteActionStartXP(actionSkillId._asSkill(), pendingQueuedActionProcessed, packedXP)
      );
      uint256 extraBoost = skillLevel - minLevel;

      successPercent = uint8(Math.min(maxSuccessPercentChange, actionSuccessPercent + extraBoost));
    }
  }

  function getFullAttireBonusRewardsPercent(
    Attire storage attire,
    PendingQueuedActionEquipmentState[] calldata pendingQueuedActionEquipmentStates,
    uint8 bonusRewardsPercent,
    uint16[5] calldata fullAttireBonusItemTokenIds,
    CheckpointEquipments calldata checkpointEquipments
  ) external pure returns (uint8 fullAttireBonusRewardsPercent) {
    if (bonusRewardsPercent == 0) {
      return 0;
    }

    // Check if they have the full equipment set, if so they can get some bonus
    bool skipNonFullAttire = true;
    (uint16[] memory itemTokenIds, uint256[] memory balances) = getAttireWithBalance(
      attire,
      skipNonFullAttire,
      pendingQueuedActionEquipmentStates,
      checkpointEquipments
    );
    bool hasFullAttire = _extraBoostFromFullAttire(itemTokenIds, balances, fullAttireBonusItemTokenIds);

    if (hasFullAttire) {
      fullAttireBonusRewardsPercent = bonusRewardsPercent;
    }
  }

  function _appendGuaranteedRewards(
    uint256[] memory ids,
    uint256[] memory amounts,
    uint256 elapsedTime,
    ActionRewards memory actionRewards,
    uint16 monstersKilled,
    bool isCombat,
    uint8 successPercent
  ) internal pure returns (uint256 length) {
    length = _appendGuaranteedReward(
      ids,
      amounts,
      elapsedTime,
      actionRewards.guaranteedRewardTokenId1,
      actionRewards.guaranteedRewardRate1,
      length,
      monstersKilled,
      isCombat,
      successPercent
    );
    length = _appendGuaranteedReward(
      ids,
      amounts,
      elapsedTime,
      actionRewards.guaranteedRewardTokenId2,
      actionRewards.guaranteedRewardRate2,
      length,
      monstersKilled,
      isCombat,
      successPercent
    );
    length = _appendGuaranteedReward(
      ids,
      amounts,
      elapsedTime,
      actionRewards.guaranteedRewardTokenId3,
      actionRewards.guaranteedRewardRate3,
      length,
      monstersKilled,
      isCombat,
      successPercent
    );
  }

  function _appendGuaranteedReward(
    uint256[] memory ids,
    uint256[] memory amounts,
    uint256 elapsedTime,
    uint16 rewardTokenId,
    uint24 rewardRate,
    uint256 oldLength,
    uint16 monstersKilled,
    bool isCombat,
    uint8 successPercent
  ) internal pure returns (uint256 length) {
    length = oldLength;
    if (rewardTokenId != NONE) {
      uint256 numRewards;
      if (isCombat) {
        numRewards = (monstersKilled * rewardRate) / GUAR_MUL; // rate is per kill
      } else {
        numRewards = (elapsedTime * rewardRate * successPercent) / (3600 * GUAR_MUL * 100);
      }

      if (numRewards != 0) {
        ids[length] = rewardTokenId;
        amounts[length] = numRewards;
        length++;
      }
    }
  }
}

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

import {UUPSUpgradeable} from "@openzeppelin/contracts-upgradeable/proxy/utils/UUPSUpgradeable.sol";
import {OwnableUpgradeable} from "@openzeppelin/contracts-upgradeable/access/OwnableUpgradeable.sol";

import {SkillLibrary} from "./libraries/SkillLibrary.sol";
import {IOracleCB} from "./interfaces/IOracleCB.sol";
import {IWorldActions} from "./interfaces/IWorldActions.sol";

import {PaintswapVRFConsumerUpgradeable} from "@paintswap/vrf/contracts/PaintswapVRFConsumerUpgradeable.sol";

// solhint-disable-next-line no-global-import
import "./globals/all.sol";

contract RandomnessBeacon is UUPSUpgradeable, OwnableUpgradeable, PaintswapVRFConsumerUpgradeable {
  using SkillLibrary for uint8;
  using SkillLibrary for Skill;

  event RequestSent(uint256 requestId, uint256 numWords, uint256 lastRandomWordsUpdatedTime);
  event RequestFulfilled(uint256 requestId, uint256 randomWord);

  error RandomWordsCannotBeUpdatedYet();
  error CanOnlyRequestAfterTheNextCheckpoint(uint256 currentTime, uint256 checkpoint);
  error NoValidRandomWord();
  error LengthMismatch();
  error CallbackGasLimitTooHigh();
  error RandomWordsAlreadyInitialized();

  uint256 private constant NUM_WORDS = 1;
  uint256 public constant MIN_RANDOM_WORDS_UPDATE_TIME = 1 days;
  uint256 public constant NUM_DAYS_RANDOM_WORDS_INITIALIZED = 3;

  uint40 private _lastRandomWordsUpdatedTime;
  uint40 private _startTime;
  uint24 private _expectedGasLimitFulfill;
  address private _unused; // Unused, previously was samwitchVRF
  IOracleCB private _wishingWell;
  IOracleCB private _dailyRewardsScheduler;
  uint256 private _isRandomWordsInitialized; // Doesn't need to be packed with anything, only called on initialization

  uint256[] private _requestIds; // Each one is a set of random words for 1 day
  mapping(uint256 requestId => uint256 randomWord) private _randomWords;

  /// @custom:oz-upgrades-unsafe-allow constructor
  constructor() {
    _disableInitializers();
  }

  function initialize(address paintswapVRFConsumer) external initializer {
    __Ownable_init(_msgSender());
    __UUPSUpgradeable_init();
    __PaintswapVRFConsumerUpgradeable_init(paintswapVRFConsumer);

    uint40 startTime = uint40(
      (block.timestamp / MIN_RANDOM_WORDS_UPDATE_TIME) *
        MIN_RANDOM_WORDS_UPDATE_TIME -
        (NUM_DAYS_RANDOM_WORDS_INITIALIZED + 1) *
        1 days
    );
    _startTime = startTime; // Floor to the nearest day 00:00 UTC
    _lastRandomWordsUpdatedTime = uint40(startTime + NUM_DAYS_RANDOM_WORDS_INITIALIZED * 1 days);
    _expectedGasLimitFulfill = 600_000;
  }

  function initializeV3(address paintswapVRFConsumer) external reinitializer(3) {
    __PaintswapVRFConsumerUpgradeable_init(paintswapVRFConsumer);
  }

  function requestIds(uint256 requestId) external view returns (uint256) {
    return _requestIds[requestId];
  }

  function getRandomWords(uint256 requestId) external view returns (uint256) {
    return _randomWords[requestId];
  }

  function lastRandomWordsUpdatedTime() external view returns (uint256) {
    return _lastRandomWordsUpdatedTime;
  }

  function requestRandomWords() external returns (uint256 requestId) {
    // Last one has not been fulfilled yet
    require(
      _requestIds.length == 0 || _randomWords[_requestIds[_requestIds.length - 1]] != 0,
      RandomWordsCannotBeUpdatedYet()
    );
    uint40 newLastRandomWordsUpdatedTime = uint40(_lastRandomWordsUpdatedTime + MIN_RANDOM_WORDS_UPDATE_TIME);
    require(
      newLastRandomWordsUpdatedTime <= block.timestamp,
      CanOnlyRequestAfterTheNextCheckpoint(block.timestamp, newLastRandomWordsUpdatedTime)
    );

    requestId = _requestRandomnessPayInNative(_expectedGasLimitFulfill, NUM_WORDS, address(this), getRequestCost());
    _requestIds.push(requestId);
    _lastRandomWordsUpdatedTime = newLastRandomWordsUpdatedTime;
    emit RequestSent(requestId, NUM_WORDS, newLastRandomWordsUpdatedTime);
    return requestId;
  }

  function getRequestCost() public view returns (uint256) {
    return _calculateRequestPriceNative(_expectedGasLimitFulfill);
  }

  function _fulfillRandomWords(uint256 requestId, uint256[] calldata randomWords) internal override {
    _fulfillRandomWordsImpl(requestId, randomWords);
  }

  function _fulfillRandomWordsImpl(uint256 requestId, uint256[] memory randomWords) internal {
    require(randomWords.length == NUM_WORDS, LengthMismatch());

    uint256 randomWord = randomWords[0];
    _randomWords[requestId] = randomWord;
    _wishingWell.newOracleRandomWords(randomWord);
    _dailyRewardsScheduler.newOracleRandomWords(randomWord);
    emit RequestFulfilled(requestId, randomWord);
  }

  function _getRandomWordOffset(uint256 timestamp) private view returns (int) {
    if (timestamp < _startTime) {
      return -1;
    }
    return int((timestamp - _startTime) / MIN_RANDOM_WORDS_UPDATE_TIME);
  }

  function _getRandomWord(uint256 timestamp) private view returns (uint256) {
    int _offset = _getRandomWordOffset(timestamp);
    if (_offset < 0 || _requestIds.length <= uint256(_offset)) {
      return 0;
    }
    return _randomWords[_requestIds[uint256(_offset)]];
  }

  function _getRandomComponent(
    bytes32 word,
    uint256 startTimestamp,
    uint256 endTimestamp,
    uint256 id
  ) private pure returns (bytes32) {
    return keccak256(abi.encodePacked(word, startTimestamp, endTimestamp, id));
  }

  function initializeAddresses(IOracleCB wishingWell, IOracleCB dailyRewardsScheduler) external onlyOwner {
    _wishingWell = IOracleCB(wishingWell);
    _dailyRewardsScheduler = IOracleCB(dailyRewardsScheduler);
  }

  function hasRandomWord(uint256 timestamp) external view returns (bool) {
    return _getRandomWord(timestamp) != 0;
  }

  function getRandomWord(uint256 timestamp) public view returns (uint256 randomWord) {
    randomWord = _getRandomWord(timestamp);
    require(randomWord != 0, NoValidRandomWord());
  }

  function getMultipleWords(uint256 timestamp) public view returns (uint256[4] memory words) {
    for (uint256 i; i < 4; ++i) {
      words[i] = getRandomWord(timestamp - (i * 1 days));
    }
  }

  function getRandomBytes(
    uint256 numTickets,
    uint256 startTimestamp,
    uint256 endTimestamp,
    uint256 id // player or pet id for instance
  ) external view returns (bytes memory randomBytes) {
    if (numTickets <= 16) {
      // 32 bytes
      bytes32 word = bytes32(getRandomWord(endTimestamp));
      randomBytes = abi.encodePacked(_getRandomComponent(word, startTimestamp, endTimestamp, id));
    } else if (numTickets <= MAX_UNIQUE_TICKETS) {
      // 4 * 32 bytes
      uint256[4] memory multipleWords = getMultipleWords(endTimestamp);
      for (uint256 i; i < 4; ++i) {
        multipleWords[i] = uint256(_getRandomComponent(bytes32(multipleWords[i]), startTimestamp, endTimestamp, id));
        // XOR all the words with the first fresh random number to give more randomness to the existing random words
        if (i != 0) {
          multipleWords[i] = uint256(keccak256(abi.encodePacked(multipleWords[i] ^ multipleWords[0])));
        }
      }
      randomBytes = abi.encodePacked(multipleWords);
    } else {
      assert(false);
    }
  }

  function getStartTime() external view returns (uint256) {
    return _startTime;
  }

  function initializeRandomWords() external onlyOwner {
    // Initialize a few days worth of random words so that we have enough data to fetch the first day
    require(_isRandomWordsInitialized == 0, RandomWordsAlreadyInitialized());
    _isRandomWordsInitialized = 1;
    for (uint256 i; i < NUM_DAYS_RANDOM_WORDS_INITIALIZED; ++i) {
      uint256 requestId = 200 + i;
      _requestIds.push(requestId);
      emit RequestSent(requestId, NUM_WORDS, _startTime + (i * 1 days) + 1 days);
      uint256[] memory randomWords = new uint256[](1);
      randomWords[0] = uint256(keccak256(abi.encodePacked(block.chainid == 31337 ? address(31337) : address(this), i)));
      _fulfillRandomWordsImpl(requestId, randomWords);
    }
  }

  function setExpectedGasLimitFulfill(uint256 gasLimit) external onlyOwner {
    require(gasLimit <= 3_000_000, CallbackGasLimitTooHigh());
    _expectedGasLimitFulfill = uint24(gasLimit);
  }

  function getLastRequestId() external view returns (uint256) {
    if (_requestIds.length == 0) {
      return 0;
    }
    return _requestIds[_requestIds.length - 1];
  }

  receive() external payable {}

  // solhint-disable-next-line no-empty-blocks
  function _authorizeUpgrade(address newImplementation) internal override onlyOwner {}
}

{
  "evmVersion": "cancun",
  "optimizer": {
    "enabled": true,
    "runs": 320,
    "details": {
      "yul": true
    }
  },
  "viaIR": true,
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "metadata": {
    "useLiteralContent": true
  },
  "libraries": {
    "contracts/Clans/Raids.sol": {
      "PlayersLibrary": "0xc9ceda474642e39f05c3e8fed75b3f45ed4ae210"
    }
  }
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"target","type":"address"}],"name":"AddressEmptyCode","type":"error"},{"inputs":[],"name":"CallerNotSamWitchVRF","type":"error"},{"inputs":[],"name":"ClanCombatantsChangeCooldown","type":"error"},{"inputs":[{"internalType":"address","name":"implementation","type":"address"}],"name":"ERC1967InvalidImplementation","type":"error"},{"inputs":[],"name":"ERC1967NonPayable","type":"error"},{"inputs":[],"name":"FailedCall","type":"error"},{"inputs":[],"name":"InvalidInitialization","type":"error"},{"inputs":[],"name":"LengthMismatch","type":"error"},{"inputs":[],"name":"NoCombatants","type":"error"},{"inputs":[],"name":"NotInRange","type":"error"},{"inputs":[],"name":"NotInitializing","type":"error"},{"inputs":[],"name":"NotOwnerOfPlayerAndActive","type":"error"},{"inputs":[],"name":"OnlyClans","type":"error"},{"inputs":[],"name":"OnlyCombatantsHelper","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"address","name":"coordinator","type":"address"}],"name":"OnlyVRFCoordinator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[],"name":"PreviousRaidNotSpawnedYet","type":"error"},{"inputs":[],"name":"RaidAlreadyExists","type":"error"},{"inputs":[],"name":"RaidDoesNotExist","type":"error"},{"inputs":[],"name":"RaidInProgress","type":"error"},{"inputs":[],"name":"RaidsPrevented","type":"error"},{"inputs":[],"name":"RankNotHighEnough","type":"error"},{"inputs":[],"name":"RequestDoesNotExist","type":"error"},{"inputs":[],"name":"TooManyCombatants","type":"error"},{"inputs":[],"name":"UUPSUnauthorizedCallContext","type":"error"},{"inputs":[{"internalType":"bytes32","name":"slot","type":"bytes32"}],"name":"UUPSUnsupportedProxiableUUID","type":"error"},{"inputs":[],"name":"ZeroAddress","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256[]","name":"baseRaidIds","type":"uint256[]"},{"components":[{"internalType":"uint8","name":"tier","type":"uint8"},{"internalType":"int16","name":"minHealth","type":"int16"},{"internalType":"int16","name":"maxHealth","type":"int16"},{"internalType":"int16","name":"minMeleeAttack","type":"int16"},{"internalType":"int16","name":"maxMeleeAttack","type":"int16"},{"internalType":"int16","name":"minMagicAttack","type":"int16"},{"internalType":"int16","name":"maxMagicAttack","type":"int16"},{"internalType":"int16","name":"minRangedAttack","type":"int16"},{"internalType":"int16","name":"maxRangedAttack","type":"int16"},{"internalType":"int16","name":"minMeleeDefence","type":"int16"},{"internalType":"int16","name":"maxMeleeDefence","type":"int16"},{"internalType":"int16","name":"minMagicDefence","type":"int16"},{"internalType":"int16","name":"maxMagicDefence","type":"int16"},{"internalType":"int16","name":"minRangedDefence","type":"int16"},{"internalType":"int16","name":"maxRangedDefence","type":"int16"},{"internalType":"uint16[16]","name":"randomLootTokenIds","type":"uint16[16]"},{"internalType":"uint32[16]","name":"randomLootTokenAmounts","type":"uint32[16]"},{"internalType":"uint16[16]","name":"randomChances","type":"uint16[16]"}],"indexed":false,"internalType":"struct Raids.BaseRaid[]","name":"baseRaids","type":"tuple[]"}],"name":"AddBaseRaids","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"clanId","type":"uint256"},{"indexed":false,"internalType":"uint64[]","name":"playerIds","type":"uint64[]"},{"indexed":false,"internalType":"address","name":"from","type":"address"},{"indexed":false,"internalType":"uint256","name":"leaderPlayerId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"cooldownTimestamp","type":"uint256"}],"name":"AssignCombatants","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256[]","name":"baseRaidIds","type":"uint256[]"},{"components":[{"internalType":"uint8","name":"tier","type":"uint8"},{"internalType":"int16","name":"minHealth","type":"int16"},{"internalType":"int16","name":"maxHealth","type":"int16"},{"internalType":"int16","name":"minMeleeAttack","type":"int16"},{"internalType":"int16","name":"maxMeleeAttack","type":"int16"},{"internalType":"int16","name":"minMagicAttack","type":"int16"},{"internalType":"int16","name":"maxMagicAttack","type":"int16"},{"internalType":"int16","name":"minRangedAttack","type":"int16"},{"internalType":"int16","name":"maxRangedAttack","type":"int16"},{"internalType":"int16","name":"minMeleeDefence","type":"int16"},{"internalType":"int16","name":"maxMeleeDefence","type":"int16"},{"internalType":"int16","name":"minMagicDefence","type":"int16"},{"internalType":"int16","name":"maxMagicDefence","type":"int16"},{"internalType":"int16","name":"minRangedDefence","type":"int16"},{"internalType":"int16","name":"maxRangedDefence","type":"int16"},{"internalType":"uint16[16]","name":"randomLootTokenIds","type":"uint16[16]"},{"internalType":"uint32[16]","name":"randomLootTokenAmounts","type":"uint32[16]"},{"internalType":"uint16[16]","name":"randomChances","type":"uint16[16]"}],"indexed":false,"internalType":"struct Raids.BaseRaid[]","name":"baseRaids","type":"tuple[]"}],"name":"EditBaseRaids","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint64","name":"version","type":"uint64"}],"name":"Initialized","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint40","name":"startRaidId","type":"uint40"},{"components":[{"internalType":"uint16","name":"baseRaidId","type":"uint16"},{"internalType":"int16","name":"health","type":"int16"},{"internalType":"int16","name":"meleeAttack","type":"int16"},{"internalType":"int16","name":"magicAttack","type":"int16"},{"internalType":"int16","name":"rangedAttack","type":"int16"},{"internalType":"int16","name":"meleeDefence","type":"int16"},{"internalType":"int16","name":"magicDefence","type":"int16"},{"internalType":"int16","name":"rangedDefence","type":"int16"},{"internalType":"uint8","name":"tier","type":"uint8"},{"internalType":"uint16[5]","name":"combatActionIds","type":"uint16[5]"}],"indexed":false,"internalType":"struct Raids.RaidInfo[]","name":"raidInfos","type":"tuple[]"},{"indexed":false,"internalType":"uint256","name":"requestId","type":"uint256"}],"name":"NewRaidsSpawned","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":false,"internalType":"uint256","name":"clanId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"raidId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"requestId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"regenerateId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"regenerateAmountUsed","type":"uint256"},{"indexed":false,"internalType":"uint16[]","name":"choiceIds","type":"uint16[]"},{"indexed":false,"internalType":"uint256","name":"bossChoiceId","type":"uint256"},{"indexed":false,"internalType":"bool","name":"defeatedRaid","type":"bool"},{"indexed":false,"internalType":"uint256[]","name":"lootTokenIds","type":"uint256[]"},{"indexed":false,"internalType":"uint256[]","name":"lootTokenAmounts","type":"uint256[]"}],"name":"RaidBattleOutcome","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"playerId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"clanId","type":"uint256"}],"name":"RemoveCombatant","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"playerId","type":"uint256"},{"indexed":false,"internalType":"uint56","name":"clanId","type":"uint56"},{"indexed":false,"internalType":"uint256","name":"raidId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"requestId","type":"uint256"}],"name":"RequestFightRaid","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"playerId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"requestId","type":"uint256"}],"name":"RequestSpawnRaid","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint16[]","name":"combatActionIds","type":"uint16[]"}],"name":"SetCombatActions","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"expectedGasLimitFulfill","type":"uint256"}],"name":"SetExpectedGasLimitFulfill","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"maxClanCombatants","type":"uint256"}],"name":"SetMaxClanCombatants","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"bool","name":"preventRaids","type":"bool"}],"name":"SetPreventRaids","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"spawnRaidCooldown","type":"uint256"}],"name":"SetSpawnRaidCooldown","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"implementation","type":"address"}],"name":"Upgraded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"coordinator","type":"address"}],"name":"VRFCoordinatorSet","type":"event"},{"inputs":[],"name":"UPGRADE_INTERFACE_VERSION","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256[]","name":"baseRaidIds","type":"uint256[]"},{"components":[{"internalType":"uint8","name":"tier","type":"uint8"},{"internalType":"int16","name":"minHealth","type":"int16"},{"internalType":"int16","name":"maxHealth","type":"int16"},{"internalType":"int16","name":"minMeleeAttack","type":"int16"},{"internalType":"int16","name":"maxMeleeAttack","type":"int16"},{"internalType":"int16","name":"minMagicAttack","type":"int16"},{"internalType":"int16","name":"maxMagicAttack","type":"int16"},{"internalType":"int16","name":"minRangedAttack","type":"int16"},{"internalType":"int16","name":"maxRangedAttack","type":"int16"},{"internalType":"int16","name":"minMeleeDefence","type":"int16"},{"internalType":"int16","name":"maxMeleeDefence","type":"int16"},{"internalType":"int16","name":"minMagicDefence","type":"int16"},{"internalType":"int16","name":"maxMagicDefence","type":"int16"},{"internalType":"int16","name":"minRangedDefence","type":"int16"},{"internalType":"int16","name":"maxRangedDefence","type":"int16"},{"internalType":"uint16[16]","name":"randomLootTokenIds","type":"uint16[16]"},{"internalType":"uint32[16]","name":"randomLootTokenAmounts","type":"uint32[16]"},{"internalType":"uint16[16]","name":"randomChances","type":"uint16[16]"}],"internalType":"struct Raids.BaseRaid[]","name":"baseRaids","type":"tuple[]"}],"name":"addBaseRaids","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"clanId","type":"uint256"},{"internalType":"uint64[]","name":"playerIds","type":"uint64[]"},{"internalType":"uint256","name":"combatantCooldownTimestamp","type":"uint256"},{"internalType":"uint256","name":"leaderPlayerId","type":"uint256"}],"name":"assignCombatants","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"clanId","type":"uint256"},{"internalType":"uint256","name":"playerId","type":"uint256"}],"name":"clanMemberLeft","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256[]","name":"baseRaidIds","type":"uint256[]"},{"components":[{"internalType":"uint8","name":"tier","type":"uint8"},{"internalType":"int16","name":"minHealth","type":"int16"},{"internalType":"int16","name":"maxHealth","type":"int16"},{"internalType":"int16","name":"minMeleeAttack","type":"int16"},{"internalType":"int16","name":"maxMeleeAttack","type":"int16"},{"internalType":"int16","name":"minMagicAttack","type":"int16"},{"internalType":"int16","name":"maxMagicAttack","type":"int16"},{"internalType":"int16","name":"minRangedAttack","type":"int16"},{"internalType":"int16","name":"maxRangedAttack","type":"int16"},{"internalType":"int16","name":"minMeleeDefence","type":"int16"},{"internalType":"int16","name":"maxMeleeDefence","type":"int16"},{"internalType":"int16","name":"minMagicDefence","type":"int16"},{"internalType":"int16","name":"maxMagicDefence","type":"int16"},{"internalType":"int16","name":"minRangedDefence","type":"int16"},{"internalType":"int16","name":"maxRangedDefence","type":"int16"},{"internalType":"uint16[16]","name":"randomLootTokenIds","type":"uint16[16]"},{"internalType":"uint32[16]","name":"randomLootTokenAmounts","type":"uint32[16]"},{"internalType":"uint16[16]","name":"randomChances","type":"uint16[16]"}],"internalType":"struct Raids.BaseRaid[]","name":"baseRaids","type":"tuple[]"}],"name":"editBaseRaids","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"getAttackCost","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"raidId","type":"uint256"}],"name":"getRaidInfo","outputs":[{"components":[{"internalType":"uint16","name":"baseRaidId","type":"uint16"},{"internalType":"int16","name":"health","type":"int16"},{"internalType":"int16","name":"meleeAttack","type":"int16"},{"internalType":"int16","name":"magicAttack","type":"int16"},{"internalType":"int16","name":"rangedAttack","type":"int16"},{"internalType":"int16","name":"meleeDefence","type":"int16"},{"internalType":"int16","name":"magicDefence","type":"int16"},{"internalType":"int16","name":"rangedDefence","type":"int16"},{"internalType":"uint8","name":"tier","type":"uint8"},{"internalType":"uint16[5]","name":"combatActionIds","type":"uint16[5]"}],"internalType":"struct Raids.RaidInfo","name":"","type":"tuple"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"contract IPlayers","name":"players","type":"address"},{"internalType":"contract ItemNFT","name":"itemNFT","type":"address"},{"internalType":"contract IClans","name":"clans","type":"address"},{"internalType":"address","name":"paintswapVRFConsumer","type":"address"},{"internalType":"uint24","name":"spawnRaidCooldown","type":"uint24"},{"internalType":"contract IBrushToken","name":"brush","type":"address"},{"internalType":"contract IWorldActions","name":"worldActions","type":"address"},{"internalType":"contract RandomnessBeacon","name":"randomnessBeacon","type":"address"},{"internalType":"uint8","name":"maxClanCombatants","type":"uint8"},{"internalType":"uint16[]","name":"combatActionIds","type":"uint16[]"},{"internalType":"bool","name":"isBeta","type":"bool"}],"name":"initialize","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"combatantsHelper","type":"address"},{"internalType":"contract IBankFactory","name":"bankFactory","type":"address"}],"name":"initializeAddresses","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"paintswapVRFConsumer","type":"address"}],"name":"initializeV3","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"clanId","type":"uint256"},{"internalType":"uint256","name":"playerId","type":"uint256"}],"name":"isCombatant","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"proxiableUUID","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"requestId","type":"uint256"},{"internalType":"uint256[]","name":"randomWords","type":"uint256[]"}],"name":"rawFulfillRandomWords","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint64","name":"playerId","type":"uint64"},{"internalType":"uint40","name":"clanId","type":"uint40"},{"internalType":"uint40","name":"raidId","type":"uint40"},{"internalType":"uint16","name":"regenerateId","type":"uint16"}],"name":"requestFightRaid","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint64","name":"playerId","type":"uint64"}],"name":"requestSpawnRaid","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint16[]","name":"combatActionIds","type":"uint16[]"}],"name":"setCombatActions","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint24","name":"expectedGasLimitFulfill","type":"uint24"}],"name":"setExpectedGasLimitFulfill","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint8","name":"maxClanCombatants","type":"uint8"}],"name":"setMaxClanCombatants","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"preventRaids","type":"bool"}],"name":"setPreventRaids","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint24","name":"spawnRaidCooldown","type":"uint24"}],"name":"setSpawnRaidCooldown","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newImplementation","type":"address"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"upgradeToAndCall","outputs":[],"stateMutability":"payable","type":"function"},{"stateMutability":"payable","type":"receive"}]

60a06040523461003c5730608052610015610040565b61001d610040565b60405161570c90816100d782396080518181816112ad01526113b30152f35b5f80fd5b5f5160206157e35f395f51905f525460ff8160401c166100c7576002600160401b03196001600160401b038216016100755750565b6001600160401b0319166001600160401b039081175f5160206157e35f395f51905f52556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d290602090a1565b63f92ee8a960e01b5f5260045ffdfe6105a0604052600436101561001b575b3615610019575f80fd5b005b5f610400525f3560e01c806309a1d92914613ec35780630bbbb65b14613c985780631fe543e3146118a4578063223c6d78146117fb5780632fc150ea1461178557806330b7bdad146117155780633101cfcb146115d25780634f1ef2861461133557806350309b051461131257806352d1902d1461129057806356684a6814610ff657806361c9fd2a14610cce578063649357c314610c56578063715018a614610be457806374eb92d114610b725780638da5cb5b14610b3d578063ad3cb1cc14610ad9578063b07463ce146109e2578063b87351a614610922578063e1b0bd76146108ac578063e82b8a4414610399578063ef242ace1461021a578063f2fde38b146101ea5763f76e782a0361000f57346101e357610400513660031901126101e3576007545f5160206156775f395f51905f52546040516318cda7a360e31b815260a09290921c62ffffff166004830152602090829060249082906001600160a01b03165afa80156101d557610400519061019e575b604051908152602090f35b506020813d6020116101cd575b816101b8602093836145b3565b810103126101c95760209051610193565b5f80fd5b3d91506101ab565b6040513d61040051823e3d90fd5b6104005180fd5b346101e35760203660031901126101e3576102136102066144af565b61020e614b3a565b614abc565b6104005180f35b346101e357610228366145ef565b6001600160a01b0360035416330361038457816104005152600e6020526001604061040051200191825461025d576104005180f35b6102678284614fbb565b60018101610276575b50610213565b83545f1981019081116102e5578110156102ff5760018101908181116102e5576001600160401b036102aa60019387614a9b565b90549060031b1c166102dd6102bf8388614a9b565b81939154906001600160401b03809160031b9316831b921b19161790565b905501610276565b634e487b7160e01b61040051526011600452602461040051fd5b5090825491821561036a577f1edc2b7b43df588e9e4c216a340d4aad41c9a47bd341383338a2175056beab95936040935f19019061033d8282614a9b565b6001600160401b03825491610400515060031b1b191690555582519182526020820152a180808080610270565b634e487b7160e01b61040051526031600452602461040051fd5b631d02671d60e21b6104005152600461040051fd5b60803660031901126101e3576103ad614605565b60243564ffffffffff8116908190036101e35760443564ffffffffff81168082036101e3576064359361ffff851685036101e35760025460405163e743862960e01b81523360048201526001600160401b039290921660248301819052949190602090829060449082906001600160a01b03165afa9081156101d5576104005191610872575b501561085d57600354604051632bf0856760e11b81528260048201528560248201526020816044816001600160a01b0386165afa9081156101d5576104005191610822575b506007811015610808576003116107f35760a01c60ff166107de57806104005152600e602052600160406104005120015480156107c957816104005152600e6020526001600160a01b03604061040051205416908115610718575b6001600160a01b036006541690813b156101e357604051637a94c56560e11b81526001600160a01b0393909316600484015261fffe6024840152604483015261040051908290606490829084905af180156101d5576106fd575b5064ffffffffff61040051541680831090816106e7575b50156106d25762ffffff60075460a01c1692610400515060206001600160a01b035f5160206156775f395f51905f5254169460646040518097819363cb9bb27f60e01b835260048301526003602483015233604483015234905af19384156101d5576104005194610678575b7f61832b402a9c5849abe9476c2b3600de998a0cf33885b98ef288f100c6bf20c26080878787878c888461040051526011602052604061040051209069ffffffffff000000000082549160281b169069ffffffffff000000000019161790558361040051526011602052604061040051208264ffffffffff198254161790558361040051526011602052604061040051209061ffff60501b82549160501b169061ffff60501b1916179055604051938452602084015260408301526060820152a16104005180f35b94935091906020853d6020116106ca575b81610696602093836145b3565b810103126101c9579351929390917f61832b402a9c5849abe9476c2b3600de998a0cf33885b98ef288f100c6bf20c26105b0565b3d9150610689565b631503d0d760e11b6104005152600461040051fd5b6002198101915081116102e55782101586610544565b6104005161070a916145b3565b610400516101e3578561052d565b6024915060206001600160a01b036009541660405193848092631e7bbfab60e01b82528760048301525afa9182156101d5576104005192610785575b506104008051849052600e602052516040902080546001600160a01b0319166001600160a01b0384161790556104d3565b9091506020813d6020116107c1575b816107a1602093836145b3565b810103126101e357516001600160a01b03811681036101e3579087610754565b3d9150610794565b634d55013d60e01b6104005152600461040051fd5b63797bd16b60e01b6104005152600461040051fd5b63d52ab5d160e01b6104005152600461040051fd5b634e487b7160e01b61040051526021600452602461040051fd5b90506020813d602011610855575b8161083d602093836145b3565b810103126101e3575160078110156101e35787610478565b3d9150610830565b630a71f87f60e31b6104005152600461040051fd5b90506020813d6020116108a4575b8161088d602093836145b3565b810103126101e35761089e906149cb565b86610433565b3d9150610880565b346101e35760203660031901126101e3577fd18a46b4b6e426a637b309ecda91b8979f4b9ff8ba397d33cc21975868f9a8e260206108e86144c5565b6108f0614b3a565b6008805462ffffff60c01b191660c083901b62ffffff60c01b1617905560405162ffffff919091168152a16104005180f35b346101e35760203660031901126101e35761093b6149f9565b50600435610400515260106020526101c0604061040051206109cd60016040519261096584614597565b60ff815461ffff811686528060101c840b60208701528060201c840b60408701528060301c840b60608701528060401c840b60808701528060501c840b60a08701528060601c840b60c08701528060701c840b60e087015260801c1661010085015201614a56565b6101208201526109e0604051809261461b565bf35b346101e3576109f036614507565b906109f9614b3a565b828203610ac457610400515b828110610a6557507fa98eafc1174ba40f58bdcfb5eac8a1427f8198b3a41a3116964ce81f88783c599391610a5b9160075461ffff60b81b8660b81b169061ffff60b81b1916176007556040519485948561479e565b0390a16104005180f35b610a7081848461473d565b90610a7c81868861474e565b3591610a99835f52600f60205260405f205460081c60010b151590565b610aaf57600192610aa991614b7b565b01610a05565b631bdc180d60e31b6104005152600461040051fd5b631fec674760e31b6104005152600461040051fd5b346101e357610400513660031901126101e3576040805190610afb81836145b3565b600582526020820191640352e302e360dc1b83528151928391602083525180918160208501528484015e61040051828201840152601f01601f19168101030190f35b346101e357610400513660031901126101e35760206001600160a01b035f5160206156575f395f51905f525416604051908152f35b346101e35760203660031901126101e357600435801515908190036101e35760207fd8c28305f04886d9e23a0854a325fa2cfb96e24ac1ace936e3f13643aa8583d191610bbd614b3a565b6003805460ff60a01b191660a083901b60ff60a01b16179055604051908152a16104005180f35b346101e357610400513660031901126101e357610bff614b3a565b5f5160206156575f395f51905f5280546001600160a01b0319811690915561040051906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a36104005180f35b346101e35760203660031901126101e35760043560ff8116908181036101e3577f4f54a0bb0df8a35f3887bec08b0faa868f57b6052aaa6842765663cb6a6d5d6991602091610ca3614b3a565b6008805460ff60b81b191660b89290921b60ff60b81b16919091179055604051908152a16104005180f35b346101e35760803660031901126101e3576004356024356001600160401b0381116101e357610d019036906004016144d7565b6008929192546001600160a01b0381163303610fe15760b81c60ff168111610fcc57816104005152600e60205264ffffffffff604061040051205460c81c164210610fb757816104005152600e602052600160406104005120016001600160401b038211610f9d57600160401b8211610f9d578054828255808310610f42575b5083906104005152602061040051208260021c90610400515b828110610eed57506003198416840380610e94575b50505050610dc762ffffff60085460a01c16426149d8565b826104005152600e602052604061040051209081549064ffffffffff60c81b9060c81b169064ffffffffff60c81b1916179055806040519260a0840190845260a060208501525260c08201929061040051905b808210610e6457336040850152606435606085015260443560808501527f1a275904484710dcd12bdb55c20cfdc8c34f9cf7bdd594c5ff66317be2572b7884860385a16104005180f35b90919361040051508435906001600160401b0382168092036101e357602081600193829352019501920190610e1a565b610400519390845b818110610eb157505050015583808080610daf565b9091946020610ee3600192610ec5896149e5565b908560031b6001600160401b03809160031b9316831b921b19161790565b9601929101610e9c565b61040051805b60048110610f08575082820155600101610d9a565b94906020610f39600192610f1b856149e5565b908960031b6001600160401b03809160031b9316831b921b19161790565b92019501610ef3565b610f769082610400515260206104005120600380860160021c820192601887831b1680610f7c575b500160021c0190614718565b84610d81565b610f97905f198601908154905f199060200360031b1c169055565b89610f6a565b634e487b7160e01b61040051526041600452602461040051fd5b63848514ed60e01b6104005152600461040051fd5b631275f70160e01b6104005152600461040051fd5b63281c9cb760e21b6104005152600461040051fd5b60203660031901126101e3576001600160401b03611012614605565b60025460405163e743862960e01b8152336004820152919092166024820181905291602090829060449082906001600160a01b03165afa9081156101d5576104005191611256575b501561085d576001546112415764ffffffffff610400515460281c16421061122c5760ff60035460a01c166107de575f5160206156775f395f51905f52546040516318cda7a360e31b81526207a120600482015290602090829060249082906001600160a01b03165afa9081156101d55761040051916111fa575b505f5160206156775f395f51905f525460405163cb9bb27f60e01b81526207a1206004820152600360248201523360448201529160209183916064918391906001600160a01b03165af19081156101d55761040051916111a8575b7f7ee5a9ee72fd588b03e699797b08a33171fad93a3f5d546d899fc24c39fd5452604084848060015561116d62ffffff60085460c01c16426149d8565b69ffffffffff000000000061040051549160281b169069ffffffffff0000000000191617610400515582519182526020820152a16104005180f35b90506020813d6020116111f2575b816111c3602093836145b3565b810103126101c957517f7ee5a9ee72fd588b03e699797b08a33171fad93a3f5d546d899fc24c39fd5452611130565b3d91506111b6565b90506020813d602011611224575b81611215602093836145b3565b810103126101c95751826110d5565b3d9150611208565b63f0023c6760e01b6104005152600461040051fd5b633f1675a760e01b6104005152600461040051fd5b90506020813d602011611288575b81611271602093836145b3565b810103126101e357611282906149cb565b8261105a565b3d9150611264565b346101e357610400513660031901126101e3576001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001630036112fd5760206040517f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8152f35b63703e46dd60e11b6104005152600461040051fd5b346101e357602061132b611325366145ef565b9061499e565b6040519015158152f35b60403660031901126101e3576113496144af565b602435906001600160401b0382116101e357366023830112156101e357816004013590611375826145d4565b9161138360405193846145b3565b808352602083019336602483830101116101e3576024829101853760206104005191840101526001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001680301490811561159d575b506112fd576113eb614b3a565b6040516352d1902d60e01b81526001600160a01b0382169390602081600481885afa610400519181611569575b506114365784634c9c8ce360e01b6104005152600452602461040051fd5b807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8692036115515750823b15611539577f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc80546001600160a01b03191682179055610400517fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b9080a282511561151b5761150b92610400519161040051915190845af43d15611513573d916114eb836145d4565b926114f960405194856145b3565b8352610400513d90602085013e61558a565b506104005180f35b60609161558a565b50505034156102135763b398979f60e01b6104005152600461040051fd5b634c9c8ce360e01b6104005152600452602461040051fd5b632a87526960e21b6104005152600452602461040051fd5b9091506020813d602011611595575b81611585602093836145b3565b810103126101e357519086611418565b3d9150611578565b90506001600160a01b037f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54161415846113de565b346101e35760203660031901126101e3576115eb6144af565b5f5160206156b75f395f51905f52549060ff8260401c168015611701575b6116ec57680100000000000000036001600160a01b039268ffffffffffffffffff1916175f5160206156b75f395f51905f5255611644615082565b1680156116d7576020816116787fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2936146cf565b604051907fe3b8b28236cd5346ea32e7cd9586665899a275beb35e4e32feeedb3c846cd0696104005161040051a260ff60401b195f5160206156b75f395f51905f5254165f5160206156b75f395f51905f525560038152a16104005180f35b63d92e233d60e01b6104005152600461040051fd5b63f92ee8a960e01b6104005152600461040051fd5b5060036001600160401b0383161015611609565b346101e35760403660031901126101e35761172e6144af565b602435906001600160a01b0382168092036101e3576001600160a01b0390611754614b3a565b166001600160601b0360a01b60085416176008556001600160601b0360a01b60095416176009556104005161040051f35b346101e35760203660031901126101e3577f49b98b5066c079ce5d03fa1b58f85e07295e2baf54b78dc4da95bb1d4aa60b4c60206117c16144c5565b6117c9614b3a565b6007805462ffffff60a01b191660a083901b62ffffff60a01b1617905560405162ffffff919091168152a16104005180f35b346101e35761180936614507565b90611812614b3a565b828203610ac457610400515b82811061185957507f143a35a38316c239db437402169f606a77599d1a42b132a5a05df7fb6a8763219391610a5b916040519485948561479e565b61186481848461473d565b9061187081868861474e565b359161188d835f52600f60205260405f205460081c60010b151590565b156106d25760019261189e91614b7b565b0161181e565b346101c95760403660031901126101c9576024356001600160401b0381116101c9576118d49036906004016144d7565b6001600160a01b035f5160206156775f395f51905f525416803303613c82575060038103613c73576001546004350361208957610400515464ffffffffff166102805260806103408190526040516102a081905261193291906145b3565b60036102a05152601f196103405101610400515b81811061206f57505060075460b81c61ffff16610260526104005191905b60038310611a3257505050600361028051018061028051116102e55764ffffffffff1664ffffffffff19610400515416176104005155610400516001556040516060810190610280518152606060208201526102a051518092526103405181019160206102a0510190610400515b818110611a1157505050807f83c6c88ae557796e7a823cc91a07ec6ac44a78d517db6abee0ed1642282281639260043560408301520390a16104005180f35b90919360206101c082611a27600194895161461b565b0195019291016119d2565b611a3d83828461474e565b3592600161ffff611a51610260518761554a565b160161ffff81116102e55761ffff81166104005152600f60205260406104005120600d54906040519160a083018381106001600160401b03821117610f9d576040526104005150611aab8161ffff8a610340511c1661554a565b600d5461ffff821610156120555761ffff90600d610400515260f0620ffff060206104005120610fff8460041c1601549260041b16161c1683526104005150611afb8161ffff8a60901c1661554a565b600d5461ffff821610156120555761ffff90600d610400515260f0620ffff060206104005120610fff8460041c1601549260041b16161c1660208401526104005150611b4e8161ffff8a60a01c1661554a565b600d5461ffff821610156120555761ffff90600d610400515260f0620ffff060206104005120610fff8460041c1601549260041b16161c1660408401526104005150611ba18161ffff8a60b01c1661554a565b90600d5461ffff831610156120555761ffff611bf492600d610400515260f0620ffff060206104005120610fff8460041c1601549260041b16161c166060850152610400515061ffff8960c01c1661554a565b600d5461ffff821610156120555761ffff90600d610400515260f0620ffff060206104005120610fff8460041c1601549260041b16161c1661034051830152548060081c60010b6104005150808260181c60010b03617fff8113617fff198212176102e557611c62906150c1565b60010b90811561203b57611c829161ffff8a60101c160760010b906150da565b908060281c60010b6104005150808260381c60010b03617fff8113617fff198212176102e557611cb1906150c1565b60010b90811561203b57611cd19161ffff8b60201c160760010b906150da565b9761040051508160481c60010b8260581c60010b03617fff8113617fff198212176102e557611cff906150c1565b60010b801561203b57611d249061ffff8360301c160760010b8360481c60010b6150da565b8260681c60010b6104005150808460781c60010b03617fff8113617fff198212176102e557611d52906150c1565b60010b90811561203b57611d729161ffff8560401c160760010b906150da565b9161040051508360881c60010b8460981c60010b03617fff8113617fff198212176102e557611da0906150c1565b60010b801561203b57611dc59061ffff8360501c160760010b8560881c60010b6150da565b9261040051508460a81c60010b8560b81c60010b03617fff8113617fff198212176102e557611df3906150c1565b60010b801561203b57611e189061ffff8460601c160760010b8660a81c60010b6150da565b9161040051508560c81c60010b8660d81c60010b03617fff8113617fff198212176102e557611e46906150c1565b60010b90811561203b5760701c61ffff160760010b8560c81c60010b90611e6c916150da565b9360405198611e7a8a614597565b61ffff168952602089019660010b8752604089019c60010b8d52606089019360010b84526103405189019160010b825260a089019060010b815260c089019260010b835260e089019460010b855261010089019560ff1686526101208901978852896102805190611eea916149d8565b64ffffffffff166104005152601060205261040051604090209c8d928a5161ffff169354985160101b915160201b955160301b905160401b925160501b945160601b965160701b9760ff60801b9051610340511b169860ff60801b199661ffff60701b199561ffff60601b199461ffff60501b199361ffff60401b199267ffff000000000000199165ffffffffffff191617169063ffff00001617169065ffff000000001617169067ffff0000000000001617169061ffff60401b1617169061ffff60501b1617169061ffff60601b16179061ffff60701b161717865551946104005195610400515b6005811061200a575050946001809495960155611ff3826102a0516150ad565b52612001816102a0516150ad565b50019190611964565b9096602061203260019261ffff8b51169085851b61ffff809160031b9316831b921b19161790565b98019101611fd3565b634e487b7160e01b61040051526012600452602461040051fd5b634e487b7160e01b61040051526032600452602461040051fd5b60209061207a6149f9565b82826102a05101015201611946565b906004355f52601160205264ffffffffff60405f205416610360526103605115613c64576004355f52601160205264ffffffffff60405f205460281c168215613c50576004355f52601160205261ffff60405f205460501c16610420525f610520525f61052052600161044052610360515f52600e6020526001600160a01b0360405f2054166103005260405160e05261212460e05161457c565b5f60e051525f602060e05101525f604060e05101525f606060e05101525f608060e05101525f60a060e05101525f60c060e0510152610360515f52600e6020526104405160405f2001604051808260208294549384815201905f5260205f20925f905b806003830110613bfc576121bd945491818110613be0575b818110613bc1575b818110613ba2575b10613b94575b5003826145b3565b6002546001600160a01b0316905f5b6104405161387a575b5050906060600492604051938480926314db786360e11b82525afa908115612c36575f610560525f925f9261381e575b506040516102e08190526001600160401b03606082019081119111176137185760606102e09493929451016040526105dc6102e05152610bb860206102e05101526107d060406102e05101525f52601060205260405f2061058052612271610440516105805101614a56565b6105005261227d615104565b6104c052612289615104565b610540525f6103c05260c06104a08190526040516104608190526122ad91906145b3565b600561046051526104a0515060a03660206104605101375f6103808190526104e0526080610480525b60056104e05110156138175761ffff6104e05160051b610500510151166103e0526104e0516104e05160041b046010146104e0511517156129185761ffff6123318160038186356104e05160041b1c1606166102e051615568565b5116806123446104e051610460516150ad565b52600b54604051634a2f04a160e01b81526103e0516004820152906001600160a01b031660e082602481845afa918215612c36575f92613758575b50604051633da45a2760e21b81525f600482015261ffff90931660248401526103208380604481015b0381845afa928315612c36575f93613733575b506040516103a0818152632c172a2960e11b9091526103e051815160040152516102809160249082905afa908115612c36575f610320525f916134dc575b60ff6105805154610480511c16606e81116129185761267a9261241f9160050a90614705565b6101c0526001600160a01b0360065416926040516102c0526304cd71ef60e01b6102c051526106046102c05101936103005160046102c051015260246102c051015261627060446102c051015260ff81511660646102c051015262ffffff60208201511660846102c051015262ffffff60408201511660a46102c051015261ffff60608201511660c46102c051015262ffffff610480518201511660e46102c051015261ffff60a0820151166101046102c051015262ffffff6104a051820151166101246102c051015261ffff60e0820151166101446102c051015262ffffff610100820151166101646102c051015261ffff610120820151166101846102c051015260ff610140820151166101a46102c051015260ff610160820151166101c46102c051015260ff610180820151166101e46102c051015263ffffffff6101a0820151166102046102c05101526101c081015160010b6102246102c051015260ff6101e0820151166102446102c051015263ffffffff610200820151166102646102c051015261022081015160010b6102846102c051015260ff610240820151166102a46102c051015263ffffffff610260820151166102c46102c051015261028081015160010b6102e46102c051015261ffff6102a0820151166103046102c051015261ffff6102c0820151166103246102c051015261ffff6102e0820151166103446102c051015261030060ff60f81b910151166103646102c0510152610420516103846102c05101526101c0516103a46102c051015261266c6103c46102c0510160e05161539e565b6104a46102c051019061539e565b60ff61056051166105846102c051015260ff82166105a46102c051015260ff84166105c46102c05101526106006105e46102c05101526060518091526106246102c0510161062060048360051b6102c0510101019161048051915f905b8282106134865750506102c05160a09390925082900390508173c9ceda474642e39f05c3e8fed75b3f45ed4ae2105af4610240526102405115612c36575f610200525f610100525f6101e05261024051613433575b61274061ffff61010051166103c0516149d8565b6103c0526101e05161292c576236ee80612760610200516101c051614705565b046040516101805261277861048051610180516145b3565b60036101805152601f196104805101366020610180510137604051610160526127a761048051610160516145b3565b60036101605152601f19610480510136602061016051013761ffff61032051511661ffff602061032051015116905f91816128ce575b5050906128186128489261ffff6040610320510151169061ffff84169161ffff606061032051015116906102005161016051610180516155e4565b61ffff80610480516103205101511692169161ffff60a061032051015116906102005161016051610180516155e4565b80610180515261016051525f5b61018051518110156128be5780612871600192610180516150ad565b51612882610520516104c0516150ad565b5261289081610160516150ad565b516105205160c0526128a461052051615427565b610520526128b760c051610540516150ad565b5201612855565b506104e0805160010190526122d6565b61ffff84160262ffffff811690810361291857600a90049081156127dd579091506128fc5f610180516150ad565b5261290a5f610160516150ad565b5260016128186128486127dd565b634e487b7160e01b5f52601160045260245ffd5b90915f610440525b61044051612d68575b505050506104405161044051612cda575b158015612c41575f610520525b610520516104c051526105205161054051526103c051612bca575b6104c05151612a83575b6004356104005152601160205264ffffffffff604061040051205460281c169060405190610140820192610360518352602083015260043560408301526104205160608301526103c0516104805183015261014060a083015261046051518093526101608201926020610460510190610400515b818110612a6957505050612a61612a4f7fb78e3028a75862669dc0598dc46a06b63ffcb2f616739b601e2cac64fb93917194849361ffff61038051166104a0518601521560e08501528381036101008501526104c0516153f4565b828103610120840152610540516153f4565b0390a1610213565b825161ffff168652602095860195909201916001016129f4565b610300513b156101e357604051632e68af5d60e11b815260016004820152610400518160248161040051610300515af180156101d557612baf575b506001600160a01b0360065416803b156101e3576040519063d81d0a1560e01b82526103005160048301526060602483015281612b01606482016104c0516153f4565b916003198284030160448301528180612b216104005195610540516153f4565b039161040051905af180156101d557612b94575b50610300513b156101e357604051632e68af5d60e11b8152610400516004820152610400518160248161040051610300515af180156101d557612b79575b50612980565b61040051612b86916145b3565b610400516101e35781612b73565b61040051612ba1916145b3565b610400516101e35781612b35565b61040051612bbc916145b3565b610400516101e35781612abe565b6001600160a01b0360065416803b156101c9575f8091606460405180948193637a94c56560e11b83526103005160048401526104205160248401526103c05160448401525af18015612c3657612c21575b50612976565b5f612c2b916145b3565b5f6104005281612c1b565b6040513d5f823e3d90fd5b600654604051627eeac760e11b815261042051610300516001600160a01b03908116600484015261ffff9091166024830152909160209183916044918391165afa908115612c36575f91612ca8575b50806103c05110816103c0511802186103c05261295b565b90506020813d602011612cd2575b81612cc3602093836145b3565b810103126101c9575182612c90565b3d9150612cb6565b50600654604051627eeac760e11b815261042051610300516001600160a01b03908116600484015261ffff9091166024830152909160209183916044918391165afa908115612c36575f91612d36575b506103c051111561294e565b90506020813d602011612d60575b81612d51602093836145b3565b810103126101c9575181612d2a565b3d9150612d44565b61ffff612d808160038187351606166102e051615568565b51166103805261058051549060405191612d998361457c565b8060201c60010b83528060301c60010b60208401528060401c60010b60408401528060101c60010b60608401528060501c60010b610480518401528060601c60010b60a084015260701c60010b6104a0518301526001600160a01b03600b5416926103206040518095633da45a2760e21b82528180612e2f6103805160048301919091602061ffff60408301945f845216910152565b03915afa938415612c36575f946133fb575b509060ff80926130306001600160a01b036006541695604051976304cd71ef60e01b89526106048901976103005160048b015260248a0152610e1060448a01528481511660648a015262ffffff60208201511660848a015262ffffff60408201511660a48a015261ffff60608201511660c48a015262ffffff610480518201511660e48a015261ffff60a0820151166101048a015262ffffff6104a051820151166101248a015261ffff60e0820151166101448a015262ffffff610100820151166101648a015261ffff610120820151166101848a015284610140820151166101a48a015284610160820151166101c48a015284610180820151166101e48a015263ffffffff6101a0820151166102048a01526101c081015160010b6102248a0152846101e0820151166102448a015263ffffffff610200820151166102648a015261022081015160010b6102848a015284610240820151166102a48a015263ffffffff610260820151166102c48a015261028081015160010b6102e48a015261ffff6102a0820151166103048a015261ffff6102c0820151166103248a015261ffff6102e0820151166103448a01526103008560f81b91015116610364890152610420516103848901526103e86103a48901526130256103c4890160e05161539e565b6104a488019061539e565b816105605116610584870152166105a4850152166105c48301526106006105e483015260605180915281610624810161062060048460051b840101019261048051915f905b82821061337b5750505050808260a09350038173c9ceda474642e39f05c3e8fed75b3f45ed4ae2105af48015612c36575f915f905f92613339575b5061ffff6130c291166103c0516149d8565b6103c0521561044052610440516130da575b8061293d565b806103e802906103e88204036129185761044051906236ee8090048161332a575b50806104405261310c575b806130d4565b61ffff6105805154165f52600f60205260405f20916003116101c95760406020815192016020830137604081526131446060826145b3565b5f5b602081106131545750613106565b8060011b81810460021482151715612918576001600160f81b03196131798285615579565b5116906001810181116129185760ff60f01b906131999060010185615579565b5160081c161760f01c5f905f60a0525f60a0526131b860018601615435565b604051905f60028801835b601060078401106132a157505050906131de610200826145b3565b6131ea60048801615435565b5f608052915b601060805110613246575b505050509061ffff60019216613217610520516104c0516150ad565b526105205161322581615427565b6105205261323f63ffffffff60a0511691610540516150ad565b5201613146565b9091929361ffff61325960805186615539565b5116851161329b575061ffff61327160805183615539565b51169363ffffffff61328560805185615539565b511660a0526001608051016080529291906131f0565b936131fb565b6001610100600892845463ffffffff8116825263ffffffff8160201c16602083015263ffffffff8160401c16604083015263ffffffff8160601c16606083015263ffffffff81610480511c166104805183015263ffffffff8160a01c1660a083015263ffffffff816104a0511c166104a05183015260e01c60e0820152019201920191906131c3565b6001915061ffff1614836130fb565b61ffff93506130c29250613365915060a03d60a011613374575b61335d81836145b3565b810190615362565b949391509491509391506130b0565b503d613353565b91935091936020806133ec60019361061f196003198b83030101865288519060606133db6133c96133b98551610480518652610480518601906153f4565b87860151858203898701526153f4565b604085015184820360408601526153f4565b9201519060608184039101526153f4565b96019201920185939192613075565b60ff9291945061342383916103203d811161342c575b61341b81836145b3565b810190615165565b94919250612e41565b503d613411565b60a03d811161347f575b8061344e61345c926102c0516145b3565b6102c051016102c051615362565b61012052610140525050610200526101405161010052610120516101e05261272c565b503d61343d565b909192936020806134ca60019361061f9b999a9b196003196102c05183030101865288519060606133db6133c96133b98551610480518652610480518601906153f4565b960192019201909291969594966126d7565b90506102803d811161372c575b6134f6816103a0516145b3565b6103a0519081010361028081126101c957610240136101c9576040516102205261024061022051016102205181106001600160401b03821117613718576040526135426103a051615145565b610220515261355660206103a05101615145565b602061022051015261356d60406103a05101615145565b604061022051015261358460606103a05101615145565b606061022051015261359d610480516103a05101615145565b610480516102205101526135b660a06103a05101615145565b60a06102205101526135cf6104a0516103a05101615145565b6104a0516102205101526135e860e06103a05101615145565b60e06102205101526136006101006103a051016150f6565b6101006102205101526136196101206103a05101615145565b6101206102205101526136326101406103a05101615145565b61014061022051015261364b6101606103a051016150f6565b6101606102205101526136646101806103a05101615145565b61018061022051015261367d6101a06103a05101615145565b6101a06102205101526136966101c06103a051016150f6565b6101c06102205101526136af6101e06103a05101615145565b6101e06102205101526136c86102006103a05101615145565b6102006102205101526136e16102206103a051016150f6565b6102208051015260286102406103a051015110156101c9576102606103a05101516101a05261022051610320526101a051906123f9565b634e487b7160e01b5f52604160045260245ffd5b503d6134e9565b610280919350613751906103203d811161342c5761341b81836145b3565b92906123bb565b92915060e0833d821161380f575b8161377360e093836145b3565b810103126101c9576103206123a893613800604051916137928361457c565b61379b81615127565b83526137a960208201615127565b60208401526137ba60408201615127565b60408401526137cb60608201615127565b60608401526137de610480518201615127565b610480518401526137f160a08201615127565b60a08401526104a05101615127565b6104a05182015292935061237f565b3d9150613766565b9091612934565b925090506060823d606011613872575b8161383b606093836145b3565b810103126101c95761384c826150f6565b91613865604061385e602084016150f6565b92016150f6565b9261056052919085612205565b3d915061382e565b8151811015613b8f576001600160401b0361389582846150ad565b5116604051631a4cd3f560e11b815281600482015260066024820152602081604481885afa8015612c36575f90613b5c575b6138e29150610440510b606060e0510151610440510b6150da565b610440510b606060e0510152604051631a4cd3f560e11b815281600482015260026024820152602081604481885afa8015612c36575f90613b29575b6139369150610440510b60e05151610440510b6150da565b610440510b60e05152604051631a4cd3f560e11b815281600482015260046024820152602081604481885afa8015612c36575f90613af6575b61398a9150610440510b602060e0510151610440510b6150da565b610440510b602060e0510152604051631a4cd3f560e11b815281600482015260036024820152602081604481885afa8015612c36575f90613ac3575b6139e19150610440510b604060e0510151610440510b6150da565b610440510b604060e051015260405190631a4cd3f560e11b8252600482015260056024820152602081604481875afa8015612c36575f90613a90575b613a7a9150610440510b613a3c81608060e0510151610440510b6150da565b610440510b608060e0510152613a5d8160a060e0510151610440510b6150da565b610440510b60a060e051015260c060e0510151610440510b6150da565b610440510b60c060e051015261044051016121cc565b506020813d8211613abb575b81613aa9602093836145b3565b810103126101c957613a7a9051613a1d565b3d9150613a9c565b506020813d8211613aee575b81613adc602093836145b3565b810103126101c9576139e190516139c6565b3d9150613acf565b506020813d8211613b21575b81613b0f602093836145b3565b810103126101c95761398a905161396f565b3d9150613b02565b506020813d8211613b54575b81613b42602093836145b3565b810103126101c957613936905161391e565b3d9150613b35565b506020813d8211613b87575b81613b75602093836145b3565b810103126101c9576138e290516138c7565b3d9150613b68565b6121d5565b60c01c8152602001876121b5565b926020906001600160401b038460801c168152019261044051016121af565b926020906001600160401b038460401c168152019261044051016121a7565b926020906001600160401b03841681520192610440510161219f565b91600491935060809085546001600160401b03811682526001600160401b038160401c1660208301526001600160401b0381841c16604083015260c01c606082015201936104405101920184929391612187565b634e487b7160e01b5f52603260045260245ffd5b637037cbb560e11b5f5260045ffd5b631fec674760e31b5f5260045ffd5b6320138a9f60e01b5f523360045260245260445ffd5b346101c95760203660031901126101c9576004356001600160401b0381116101c957613cc89036906004016144d7565b613cd0614b3a565b6001600160401b03811161371857600160401b811161371857600d5481600d55808210613e3a575b5081600d5f528160041c5f5b818110613de15750600f198316830380613d84575b50505060405190806020830160208452526040820192905f5b818110613d61577f03c6adabe22258ad3583b10b4c69bf02b991a27564e46516f3ea09b62e67386284860385a1005b90919360208060019261ffff613d76896146c0565b168152019501929101613d32565b915f925f5b818110613dab575050505f5160206156975f395f51905f520155828080613d19565b9091936020613dd7600192613dbf8861472e565b9085851b61ffff809160031b9316831b921b19161790565b9501929101613d89565b5f5f5b60108110613e0657505f5160206156975f395f51905f52820155600101613d04565b93906020613e31600192613e198561472e565b9088851b61ffff809160031b9316831b921b19161790565b92019401613de4565b613e7d90600f80840160041c91601e8560011b1680613e83575b500160041c5f5160206156975f395f51905f5201905f5160206156975f395f51905f5201614718565b82613cf8565b613ebd907fd7b6990105719101dabeb77144f2a3385c8033acd3af97e9423a695e81ad1eb48501908154905f199060200360031b1c169055565b86613e54565b346101c9576101603660031901126101c9576004356001600160a01b0381168091036101c957602435906001600160a01b0382168092036101c957604435906001600160a01b0382168092036101c957606435906001600160a01b0382168092036101c9576084359162ffffff831683036101c95760a435926001600160a01b0384168094036101c95760c4356001600160a01b0381168091036101c95760e435906001600160a01b0382168092036101c957610104359060ff821682036101c957610124356001600160401b0381116101c957613fa59036906004016144d7565b989097610144359182151583036101c9575f5160206156b75f395f51905f52549b60ff8d60401c16159c8d6001600160401b038216801591826144a7575b50600114908161449d575b159081614494575b506144855767ffffffffffffffff1981166001175f5160206156b75f395f51905f52558d614459575b50614028615082565b614030615082565b61403933614abc565b614041615082565b614049615082565b881561444a577fd18a46b4b6e426a637b309ecda91b8979f4b9ff8ba397d33cc21975868f9a8e2998961407d60209b6146cf565b7fe3b8b28236cd5346ea32e7cd9586665899a275beb35e4e32feeedb3c846cd0695f80a26001600160601b0360a01b60025416176002556001600160601b0360a01b60065416176006556001600160601b0360a01b60035416176003556001600160601b0360a01b600a541617600a555f146144405761012c925b6008549362ffffff60a01b9060a01b16918262ffffff60a01b198616176008556001600160601b0360a01b600b541617600b556001600160601b0360a01b600c541617600c55600164ffffffffff195f5416175f55614155614b3a565b7f4f54a0bb0df8a35f3887bec08b0faa868f57b6052aaa6842765663cb6a6d5d698560ff60b81b8460b81b1693848463ffffffff60a01b198816171760085560ff60405191168152a16141a6614b3a565b62ffffff60c01b8460c01b169266ffffffffffffff60a01b191617171760085562ffffff60405191168152a16141da614b3a565b6007805462ffffff60a01b1916613d0960a71b179055604051621e848081527f49b98b5066c079ce5d03fa1b58f85e07295e2baf54b78dc4da95bb1d4aa60b4c90602090a1614227614b3a565b6001600160401b03821161371857600160401b821161371857600d5482600d558083106143b8575b5080600d5f528260041c5f5b8181106143775750600f198416840380614332575b50505060405191806020840160208552526040830191905f5b81811061430f57857f03c6adabe22258ad3583b10b4c69bf02b991a27564e46516f3ea09b62e67386286860387a16142bd57005b60ff60401b195f5160206156b75f395f51905f5254165f5160206156b75f395f51905f52557fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2602060405160018152a1005b90919260208060019261ffff614324886146c0565b168152019401929101614289565b915f925f5b818110614359575050505f5160206156975f395f51905f520155838080614270565b909193602061436d600192613dbf8861472e565b9501929101614337565b5f5f5b6010811061439c57505f5160206156975f395f51905f5282015560010161425b565b939060206143af600192613e198561472e565b9201940161437a565b6143fa90600f80850160041c91601e8660011b168061440057500160041c5f5160206156975f395f51905f5201905f5160206156975f395f51905f5201614718565b8361424f565b61443a907fd7b6990105719101dabeb77144f2a3385c8033acd3af97e9423a695e81ad1eb48501908154905f199060200360031b1c169055565b87613e54565b6203f480926140f8565b63d92e233d60e01b5f5260045ffd5b68ffffffffffffffffff191668010000000000000001175f5160206156b75f395f51905f52558d61401f565b63f92ee8a960e01b5f5260045ffd5b9050158f613ff6565b303b159150613fee565b91508f613fe3565b600435906001600160a01b03821682036101c957565b6004359062ffffff821682036101c957565b9181601f840112156101c9578235916001600160401b0383116101c9576020808501948460051b0101116101c957565b9060406003198301126101c9576004356001600160401b0381116101c95782614532916004016144d7565b929092916024356001600160401b0381116101c957826023820112156101c9578060040135926001600160401b0384116101c95760246107e08502830101116101c9576024019190565b60e081019081106001600160401b0382111761371857604052565b61014081019081106001600160401b0382111761371857604052565b90601f801991011681019081106001600160401b0382111761371857604052565b6001600160401b03811161371857601f01601f191660200190565b60409060031901126101c9576004359060243590565b600435906001600160401b03821682036101c957565b610120809161ffff8151168452602081015160010b6020850152604081015160010b6040850152606081015160010b6060850152608081015160010b608085015260a081015160010b60a085015260c081015160010b60c085015260e081015160010b60e085015260ff61010082015116610100850152015191015f905b600582106146a657505050565b60208060019261ffff865116815201930191019091614699565b359061ffff821682036101c957565b6001600160a01b03166001600160601b0360a01b5f5160206156775f395f51905f525416175f5160206156775f395f51905f5255565b8181029291811591840414171561291857565b818110614723575050565b5f8155600101614718565b3561ffff811681036101c95790565b9190811015613c50576107e0020190565b9190811015613c505760051b0190565b35908160010b82036101c957565b905f905b6010821061477d57505050565b60208060019261ffff61478f876146c0565b16815201930191019091614770565b6040808252810183905292939290916001600160fb1b0381116101c957608092849160051b8091606085013782019160608301906020606082860301910152520191905f905b8082106147f15750505090565b909192833560ff81168091036101c957815261480f6020850161475e565b60010b60208201526148236040850161475e565b60010b60408201526148376060850161475e565b60010b606082015261484b6080850161475e565b60010b608082015261485f60a0850161475e565b60010b60a082015261487360c0850161475e565b60010b60c082015261488760e0850161475e565b60010b60e082015261489c610100850161475e565b60010b6101008201526148b2610120850161475e565b60010b6101208201526148c8610140850161475e565b60010b6101408201526148de610160850161475e565b60010b6101608201526148f4610180850161475e565b60010b61018082015261490a6101a0850161475e565b60010b6101a08201526149206101c0850161475e565b60010b6101c082015261493b6101e082016101e0860161476c565b6103e081016103e08501905f905b60108210614978575050506107e0808261496d6105e0600195016105e0890161476c565b0194019201906147e4565b82359063ffffffff82168092036101c95760208160019382935201930191019091614949565b5f52600e602052600160405f2001908154156149c5576149c0905f1992614fbb565b141590565b50505f90565b519081151582036101c957565b9190820180921161291857565b356001600160401b03811681036101c95790565b60405190614a0682614597565b815f81525f60208201525f60408201525f60608201525f60808201525f60a08201525f60c08201525f60e08201525f61010082015261012060405191614a4d60a0846145b3565b60a03684370152565b9061ffff60405192548181168452818160101c166020850152818160201c166040850152818160301c16606085015260401c166080830152614a9960a0836145b3565b565b9190918054831015613c50575f52601860205f208360021c019260031b1690565b6001600160a01b03168015614b27576001600160a01b035f5160206156575f395f51905f5254826001600160601b0360a01b8216175f5160206156575f395f51905f5255167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a3565b631e4fbdf760e01b5f525f60045260245ffd5b6001600160a01b035f5160206156575f395f51905f5254163303614b5a57565b63118cdaa760e01b5f523360045260245ffd5b358060010b81036101c95790565b60208101915f614b8a84614b6d565b60010b1380614f97575b15614f88576060820190614ba782614b6d565b906080840191614bb683614b6d565b60010b9060010b13614f885760a08401614bcf81614b6d565b9060c0860191614bde83614b6d565b60010b9060010b13614f885760e0860196614bf888614b6d565b97610100880198614c088a614b6d565b60010b9060010b13614f8857610120880192614c2384614b6d565b6101408a0190614c3282614b6d565b60010b9060010b13614f88576101608a0192614c4d84614b6d565b956101808c0196614c5d88614b6d565b60010b9060010b13614f88578b996101a08b01996101c0614c7d8c614b6d565b9c019b614c898d614b6d565b60010b9060010b13614f88575f52600f60205260405f209d8d359760ff89168099036101c9578f948f955491614cbe90614b6d565b60081b95604001614cce90614b6d565b60181b9e614cdb90614b6d565b60281b93614ce890614b6d565b60381b97614cf590614b6d565b60481b9b614d0290614b6d565b60581b90614d0f90614b6d565b60681b92614d1c90614b6d565b60781b94614d2990614b6d565b60881b96614d3690614b6d565b60981b98614d4390614b6d565b60a81b9a614d5090614b6d565b60b81b9c614d5d90614b6d565b60c81b9d614d6a90614b6d565b60d81b61ffff60d81b1661ffff60a81b909b1661ffff60981b90991661ffff60881b90971661ffff60781b90951661ffff60681b9093166cffff00000000000000000000009091166affff0000000000000000009c909c1668ffff000000000000009890981666ffff00000000009490941664ffff0000009f909f1662ffff00969096167fffffff0000000000000000000000000000000000000000000000000000000000929092167fffffff000000000000000000000000000000000000000000000000ffffffffff9a909a169990991717939093179b909b179a909a179290921795909517929092179190911795909517919091179390931761ffff60b81b919091161761ffff60c81b91909116171782556101e081015f5b60018110614f505750506103e081015f5b60028110614f025750506105e0015f5b60018110614eb357505050565b5f5f5b60108110614ece575083820160040155600101614ea6565b92906020614ef9600192614ee18561472e565b9087851b61ffff809160031b9316831b921b19161790565b92019301614eb6565b5f5f5b60088110614f1d575084820160020155600101614e96565b9290813563ffffffff81168082036101c9576001926020925063ffffffff8760051b92831b921b19161792019301614f05565b5f5f5b60108110614f6c57509060019182828701015501614e85565b92906020614f7f600192614ee18561472e565b92019301614f53565b636311fcc960e11b5f5260045ffd5b50614fa183614b6d565b614fad60408401614b6d565b60010b9060010b1315614b94565b91905f83545f1981019081116129185793919092935b80841115614fe3575b505050505f1990565b83810381811161291857614ffa9060011c856149d8565b93826001600160401b0361500e8787614a9b565b90549060031b1c16145f14615024575050505090565b826001600160401b0361503c87879998959697614a9b565b90549060031b1c16105f14615061575060018101809111612918575b92939190614fd1565b9150801561507a575f1981019081116129185790615058565b839450614fda565b60ff5f5160206156b75f395f51905f525460401c161561509e57565b631afcd79f60e31b5f5260045ffd5b8051821015613c505760209160051b010190565b600190810b0190617fff8213617fff1983121761291857565b9060010b9060010b0190617fff198212617fff83131761291857565b519060ff821682036101c957565b604051610600919061511683826145b3565b602f815291601f1901366020840137565b51908160010b82036101c957565b519062ffffff821682036101c957565b519061ffff821682036101c957565b519063ffffffff821682036101c957565b90816103209103126101c957604051906103208201908282106001600160401b03831117613718576103009160405261519d816150f6565b83526151ab60208201615135565b60208401526151bc60408201615135565b60408401526151cd60608201615145565b60608401526151de60808201615135565b60808401526151ef60a08201615145565b60a084015261520060c08201615135565b60c084015261521160e08201615145565b60e08401526152236101008201615135565b6101008401526152366101208201615145565b61012084015261524961014082016150f6565b61014084015261525c61016082016150f6565b61016084015261526f61018082016150f6565b6101808401526152826101a08201615154565b6101a08401526152956101c08201615127565b6101c08401526152a86101e082016150f6565b6101e08401526152bb6102008201615154565b6102008401526152ce6102208201615127565b6102208401526152e161024082016150f6565b6102408401526152f46102608201615154565b6102608401526153076102808201615127565b61028084015261531a6102a08201615145565b6102a084015261532d6102c08201615145565b6102c08401526153406102e08201615145565b6102e084015201516001600160f81b0319811681036101c95761030082015290565b908160a09103126101c95780519160208201519161538260408201615145565b9161539b608061539460608501615145565b93016149cb565b90565b60c08091805160010b8452602081015160010b6020850152604081015160010b6040850152606081015160010b6060850152608081015160010b608085015260a081015160010b60a0850152015160010b910152565b90602080835192838152019201905f5b8181106154115750505090565b8251845260209384019390920191600101615404565b5f1981146129185760010190565b60405191905f835b6010600f83011061545757505050614a99610200836145b3565b6001610200601092855461ffff8116825261ffff81861c16602083015261ffff8160201c16604083015261ffff8160301c16606083015261ffff8160401c16608083015261ffff8160501c1660a083015261ffff8160601c1660c083015261ffff8160701c1660e083015261ffff8160801c1661010083015261ffff8160901c1661012083015261ffff8160a01c1661014083015261ffff8160b01c1661016083015261ffff8160c01c1661018083015261ffff8160d01c166101a083015261ffff8160e01c166101c083015260f01c6101e08201520193019101909161543d565b906010811015613c505760051b0190565b8115615554570690565b634e487b7160e01b5f52601260045260245ffd5b906003811015613c505760051b0190565b908151811015613c50570160200190565b906155ae575080511561559f57805190602001fd5b63d6bda27560e01b5f5260045ffd5b815115806155db575b6155bf575090565b6001600160a01b0390639996b31560e01b5f521660045260245ffd5b50803b156155b7565b93915091959461ffff85971691826155ff575b505050505050565b62ffffff61ffff911691160262ffffff811690810361291857600a90049283615629575b806155f7565b61564b95965091849161563f83615645956150ad565b526150ad565b52615427565b905f8080808061562356fe9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c19930055babfd4afb3639f1ad2bd51b6ac6a46a851aaaf7dddc61bc22c3b70fc381d86d7b6990105719101dabeb77144f2a3385c8033acd3af97e9423a695e81ad1eb5f0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00a264697066735822122008a27d3a5fecb6e4c8fe3dc8e74d433307011647d944350e37e7383d856c945664736f6c634300081c0033f0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00

0x6105a0604052600436101561001b575b3615610019575f80fd5b005b5f610400525f3560e01c806309a1d92914613ec35780630bbbb65b14613c985780631fe543e3146118a4578063223c6d78146117fb5780632fc150ea1461178557806330b7bdad146117155780633101cfcb146115d25780634f1ef2861461133557806350309b051461131257806352d1902d1461129057806356684a6814610ff657806361c9fd2a14610cce578063649357c314610c56578063715018a614610be457806374eb92d114610b725780638da5cb5b14610b3d578063ad3cb1cc14610ad9578063b07463ce146109e2578063b87351a614610922578063e1b0bd76146108ac578063e82b8a4414610399578063ef242ace1461021a578063f2fde38b146101ea5763f76e782a0361000f57346101e357610400513660031901126101e3576007545f5160206156775f395f51905f52546040516318cda7a360e31b815260a09290921c62ffffff166004830152602090829060249082906001600160a01b03165afa80156101d557610400519061019e575b604051908152602090f35b506020813d6020116101cd575b816101b8602093836145b3565b810103126101c95760209051610193565b5f80fd5b3d91506101ab565b6040513d61040051823e3d90fd5b6104005180fd5b346101e35760203660031901126101e3576102136102066144af565b61020e614b3a565b614abc565b6104005180f35b346101e357610228366145ef565b6001600160a01b0360035416330361038457816104005152600e6020526001604061040051200191825461025d576104005180f35b6102678284614fbb565b60018101610276575b50610213565b83545f1981019081116102e5578110156102ff5760018101908181116102e5576001600160401b036102aa60019387614a9b565b90549060031b1c166102dd6102bf8388614a9b565b81939154906001600160401b03809160031b9316831b921b19161790565b905501610276565b634e487b7160e01b61040051526011600452602461040051fd5b5090825491821561036a577f1edc2b7b43df588e9e4c216a340d4aad41c9a47bd341383338a2175056beab95936040935f19019061033d8282614a9b565b6001600160401b03825491610400515060031b1b191690555582519182526020820152a180808080610270565b634e487b7160e01b61040051526031600452602461040051fd5b631d02671d60e21b6104005152600461040051fd5b60803660031901126101e3576103ad614605565b60243564ffffffffff8116908190036101e35760443564ffffffffff81168082036101e3576064359361ffff851685036101e35760025460405163e743862960e01b81523360048201526001600160401b039290921660248301819052949190602090829060449082906001600160a01b03165afa9081156101d5576104005191610872575b501561085d57600354604051632bf0856760e11b81528260048201528560248201526020816044816001600160a01b0386165afa9081156101d5576104005191610822575b506007811015610808576003116107f35760a01c60ff166107de57806104005152600e602052600160406104005120015480156107c957816104005152600e6020526001600160a01b03604061040051205416908115610718575b6001600160a01b036006541690813b156101e357604051637a94c56560e11b81526001600160a01b0393909316600484015261fffe6024840152604483015261040051908290606490829084905af180156101d5576106fd575b5064ffffffffff61040051541680831090816106e7575b50156106d25762ffffff60075460a01c1692610400515060206001600160a01b035f5160206156775f395f51905f5254169460646040518097819363cb9bb27f60e01b835260048301526003602483015233604483015234905af19384156101d5576104005194610678575b7f61832b402a9c5849abe9476c2b3600de998a0cf33885b98ef288f100c6bf20c26080878787878c888461040051526011602052604061040051209069ffffffffff000000000082549160281b169069ffffffffff000000000019161790558361040051526011602052604061040051208264ffffffffff198254161790558361040051526011602052604061040051209061ffff60501b82549160501b169061ffff60501b1916179055604051938452602084015260408301526060820152a16104005180f35b94935091906020853d6020116106ca575b81610696602093836145b3565b810103126101c9579351929390917f61832b402a9c5849abe9476c2b3600de998a0cf33885b98ef288f100c6bf20c26105b0565b3d9150610689565b631503d0d760e11b6104005152600461040051fd5b6002198101915081116102e55782101586610544565b6104005161070a916145b3565b610400516101e3578561052d565b6024915060206001600160a01b036009541660405193848092631e7bbfab60e01b82528760048301525afa9182156101d5576104005192610785575b506104008051849052600e602052516040902080546001600160a01b0319166001600160a01b0384161790556104d3565b9091506020813d6020116107c1575b816107a1602093836145b3565b810103126101e357516001600160a01b03811681036101e3579087610754565b3d9150610794565b634d55013d60e01b6104005152600461040051fd5b63797bd16b60e01b6104005152600461040051fd5b63d52ab5d160e01b6104005152600461040051fd5b634e487b7160e01b61040051526021600452602461040051fd5b90506020813d602011610855575b8161083d602093836145b3565b810103126101e3575160078110156101e35787610478565b3d9150610830565b630a71f87f60e31b6104005152600461040051fd5b90506020813d6020116108a4575b8161088d602093836145b3565b810103126101e35761089e906149cb565b86610433565b3d9150610880565b346101e35760203660031901126101e3577fd18a46b4b6e426a637b309ecda91b8979f4b9ff8ba397d33cc21975868f9a8e260206108e86144c5565b6108f0614b3a565b6008805462ffffff60c01b191660c083901b62ffffff60c01b1617905560405162ffffff919091168152a16104005180f35b346101e35760203660031901126101e35761093b6149f9565b50600435610400515260106020526101c0604061040051206109cd60016040519261096584614597565b60ff815461ffff811686528060101c840b60208701528060201c840b60408701528060301c840b60608701528060401c840b60808701528060501c840b60a08701528060601c840b60c08701528060701c840b60e087015260801c1661010085015201614a56565b6101208201526109e0604051809261461b565bf35b346101e3576109f036614507565b906109f9614b3a565b828203610ac457610400515b828110610a6557507fa98eafc1174ba40f58bdcfb5eac8a1427f8198b3a41a3116964ce81f88783c599391610a5b9160075461ffff60b81b8660b81b169061ffff60b81b1916176007556040519485948561479e565b0390a16104005180f35b610a7081848461473d565b90610a7c81868861474e565b3591610a99835f52600f60205260405f205460081c60010b151590565b610aaf57600192610aa991614b7b565b01610a05565b631bdc180d60e31b6104005152600461040051fd5b631fec674760e31b6104005152600461040051fd5b346101e357610400513660031901126101e3576040805190610afb81836145b3565b600582526020820191640352e302e360dc1b83528151928391602083525180918160208501528484015e61040051828201840152601f01601f19168101030190f35b346101e357610400513660031901126101e35760206001600160a01b035f5160206156575f395f51905f525416604051908152f35b346101e35760203660031901126101e357600435801515908190036101e35760207fd8c28305f04886d9e23a0854a325fa2cfb96e24ac1ace936e3f13643aa8583d191610bbd614b3a565b6003805460ff60a01b191660a083901b60ff60a01b16179055604051908152a16104005180f35b346101e357610400513660031901126101e357610bff614b3a565b5f5160206156575f395f51905f5280546001600160a01b0319811690915561040051906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a36104005180f35b346101e35760203660031901126101e35760043560ff8116908181036101e3577f4f54a0bb0df8a35f3887bec08b0faa868f57b6052aaa6842765663cb6a6d5d6991602091610ca3614b3a565b6008805460ff60b81b191660b89290921b60ff60b81b16919091179055604051908152a16104005180f35b346101e35760803660031901126101e3576004356024356001600160401b0381116101e357610d019036906004016144d7565b6008929192546001600160a01b0381163303610fe15760b81c60ff168111610fcc57816104005152600e60205264ffffffffff604061040051205460c81c164210610fb757816104005152600e602052600160406104005120016001600160401b038211610f9d57600160401b8211610f9d578054828255808310610f42575b5083906104005152602061040051208260021c90610400515b828110610eed57506003198416840380610e94575b50505050610dc762ffffff60085460a01c16426149d8565b826104005152600e602052604061040051209081549064ffffffffff60c81b9060c81b169064ffffffffff60c81b1916179055806040519260a0840190845260a060208501525260c08201929061040051905b808210610e6457336040850152606435606085015260443560808501527f1a275904484710dcd12bdb55c20cfdc8c34f9cf7bdd594c5ff66317be2572b7884860385a16104005180f35b90919361040051508435906001600160401b0382168092036101e357602081600193829352019501920190610e1a565b610400519390845b818110610eb157505050015583808080610daf565b9091946020610ee3600192610ec5896149e5565b908560031b6001600160401b03809160031b9316831b921b19161790565b9601929101610e9c565b61040051805b60048110610f08575082820155600101610d9a565b94906020610f39600192610f1b856149e5565b908960031b6001600160401b03809160031b9316831b921b19161790565b92019501610ef3565b610f769082610400515260206104005120600380860160021c820192601887831b1680610f7c575b500160021c0190614718565b84610d81565b610f97905f198601908154905f199060200360031b1c169055565b89610f6a565b634e487b7160e01b61040051526041600452602461040051fd5b63848514ed60e01b6104005152600461040051fd5b631275f70160e01b6104005152600461040051fd5b63281c9cb760e21b6104005152600461040051fd5b60203660031901126101e3576001600160401b03611012614605565b60025460405163e743862960e01b8152336004820152919092166024820181905291602090829060449082906001600160a01b03165afa9081156101d5576104005191611256575b501561085d576001546112415764ffffffffff610400515460281c16421061122c5760ff60035460a01c166107de575f5160206156775f395f51905f52546040516318cda7a360e31b81526207a120600482015290602090829060249082906001600160a01b03165afa9081156101d55761040051916111fa575b505f5160206156775f395f51905f525460405163cb9bb27f60e01b81526207a1206004820152600360248201523360448201529160209183916064918391906001600160a01b03165af19081156101d55761040051916111a8575b7f7ee5a9ee72fd588b03e699797b08a33171fad93a3f5d546d899fc24c39fd5452604084848060015561116d62ffffff60085460c01c16426149d8565b69ffffffffff000000000061040051549160281b169069ffffffffff0000000000191617610400515582519182526020820152a16104005180f35b90506020813d6020116111f2575b816111c3602093836145b3565b810103126101c957517f7ee5a9ee72fd588b03e699797b08a33171fad93a3f5d546d899fc24c39fd5452611130565b3d91506111b6565b90506020813d602011611224575b81611215602093836145b3565b810103126101c95751826110d5565b3d9150611208565b63f0023c6760e01b6104005152600461040051fd5b633f1675a760e01b6104005152600461040051fd5b90506020813d602011611288575b81611271602093836145b3565b810103126101e357611282906149cb565b8261105a565b3d9150611264565b346101e357610400513660031901126101e3576001600160a01b037f0000000000000000000000004db743bc55facdc46241b6d0472eb943fbea9dd21630036112fd5760206040517f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8152f35b63703e46dd60e11b6104005152600461040051fd5b346101e357602061132b611325366145ef565b9061499e565b6040519015158152f35b60403660031901126101e3576113496144af565b602435906001600160401b0382116101e357366023830112156101e357816004013590611375826145d4565b9161138360405193846145b3565b808352602083019336602483830101116101e3576024829101853760206104005191840101526001600160a01b037f0000000000000000000000004db743bc55facdc46241b6d0472eb943fbea9dd21680301490811561159d575b506112fd576113eb614b3a565b6040516352d1902d60e01b81526001600160a01b0382169390602081600481885afa610400519181611569575b506114365784634c9c8ce360e01b6104005152600452602461040051fd5b807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8692036115515750823b15611539577f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc80546001600160a01b03191682179055610400517fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b9080a282511561151b5761150b92610400519161040051915190845af43d15611513573d916114eb836145d4565b926114f960405194856145b3565b8352610400513d90602085013e61558a565b506104005180f35b60609161558a565b50505034156102135763b398979f60e01b6104005152600461040051fd5b634c9c8ce360e01b6104005152600452602461040051fd5b632a87526960e21b6104005152600452602461040051fd5b9091506020813d602011611595575b81611585602093836145b3565b810103126101e357519086611418565b3d9150611578565b90506001600160a01b037f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54161415846113de565b346101e35760203660031901126101e3576115eb6144af565b5f5160206156b75f395f51905f52549060ff8260401c168015611701575b6116ec57680100000000000000036001600160a01b039268ffffffffffffffffff1916175f5160206156b75f395f51905f5255611644615082565b1680156116d7576020816116787fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2936146cf565b604051907fe3b8b28236cd5346ea32e7cd9586665899a275beb35e4e32feeedb3c846cd0696104005161040051a260ff60401b195f5160206156b75f395f51905f5254165f5160206156b75f395f51905f525560038152a16104005180f35b63d92e233d60e01b6104005152600461040051fd5b63f92ee8a960e01b6104005152600461040051fd5b5060036001600160401b0383161015611609565b346101e35760403660031901126101e35761172e6144af565b602435906001600160a01b0382168092036101e3576001600160a01b0390611754614b3a565b166001600160601b0360a01b60085416176008556001600160601b0360a01b60095416176009556104005161040051f35b346101e35760203660031901126101e3577f49b98b5066c079ce5d03fa1b58f85e07295e2baf54b78dc4da95bb1d4aa60b4c60206117c16144c5565b6117c9614b3a565b6007805462ffffff60a01b191660a083901b62ffffff60a01b1617905560405162ffffff919091168152a16104005180f35b346101e35761180936614507565b90611812614b3a565b828203610ac457610400515b82811061185957507f143a35a38316c239db437402169f606a77599d1a42b132a5a05df7fb6a8763219391610a5b916040519485948561479e565b61186481848461473d565b9061187081868861474e565b359161188d835f52600f60205260405f205460081c60010b151590565b156106d25760019261189e91614b7b565b0161181e565b346101c95760403660031901126101c9576024356001600160401b0381116101c9576118d49036906004016144d7565b6001600160a01b035f5160206156775f395f51905f525416803303613c82575060038103613c73576001546004350361208957610400515464ffffffffff166102805260806103408190526040516102a081905261193291906145b3565b60036102a05152601f196103405101610400515b81811061206f57505060075460b81c61ffff16610260526104005191905b60038310611a3257505050600361028051018061028051116102e55764ffffffffff1664ffffffffff19610400515416176104005155610400516001556040516060810190610280518152606060208201526102a051518092526103405181019160206102a0510190610400515b818110611a1157505050807f83c6c88ae557796e7a823cc91a07ec6ac44a78d517db6abee0ed1642282281639260043560408301520390a16104005180f35b90919360206101c082611a27600194895161461b565b0195019291016119d2565b611a3d83828461474e565b3592600161ffff611a51610260518761554a565b160161ffff81116102e55761ffff81166104005152600f60205260406104005120600d54906040519160a083018381106001600160401b03821117610f9d576040526104005150611aab8161ffff8a610340511c1661554a565b600d5461ffff821610156120555761ffff90600d610400515260f0620ffff060206104005120610fff8460041c1601549260041b16161c1683526104005150611afb8161ffff8a60901c1661554a565b600d5461ffff821610156120555761ffff90600d610400515260f0620ffff060206104005120610fff8460041c1601549260041b16161c1660208401526104005150611b4e8161ffff8a60a01c1661554a565b600d5461ffff821610156120555761ffff90600d610400515260f0620ffff060206104005120610fff8460041c1601549260041b16161c1660408401526104005150611ba18161ffff8a60b01c1661554a565b90600d5461ffff831610156120555761ffff611bf492600d610400515260f0620ffff060206104005120610fff8460041c1601549260041b16161c166060850152610400515061ffff8960c01c1661554a565b600d5461ffff821610156120555761ffff90600d610400515260f0620ffff060206104005120610fff8460041c1601549260041b16161c1661034051830152548060081c60010b6104005150808260181c60010b03617fff8113617fff198212176102e557611c62906150c1565b60010b90811561203b57611c829161ffff8a60101c160760010b906150da565b908060281c60010b6104005150808260381c60010b03617fff8113617fff198212176102e557611cb1906150c1565b60010b90811561203b57611cd19161ffff8b60201c160760010b906150da565b9761040051508160481c60010b8260581c60010b03617fff8113617fff198212176102e557611cff906150c1565b60010b801561203b57611d249061ffff8360301c160760010b8360481c60010b6150da565b8260681c60010b6104005150808460781c60010b03617fff8113617fff198212176102e557611d52906150c1565b60010b90811561203b57611d729161ffff8560401c160760010b906150da565b9161040051508360881c60010b8460981c60010b03617fff8113617fff198212176102e557611da0906150c1565b60010b801561203b57611dc59061ffff8360501c160760010b8560881c60010b6150da565b9261040051508460a81c60010b8560b81c60010b03617fff8113617fff198212176102e557611df3906150c1565b60010b801561203b57611e189061ffff8460601c160760010b8660a81c60010b6150da565b9161040051508560c81c60010b8660d81c60010b03617fff8113617fff198212176102e557611e46906150c1565b60010b90811561203b5760701c61ffff160760010b8560c81c60010b90611e6c916150da565b9360405198611e7a8a614597565b61ffff168952602089019660010b8752604089019c60010b8d52606089019360010b84526103405189019160010b825260a089019060010b815260c089019260010b835260e089019460010b855261010089019560ff1686526101208901978852896102805190611eea916149d8565b64ffffffffff166104005152601060205261040051604090209c8d928a5161ffff169354985160101b915160201b955160301b905160401b925160501b945160601b965160701b9760ff60801b9051610340511b169860ff60801b199661ffff60701b199561ffff60601b199461ffff60501b199361ffff60401b199267ffff000000000000199165ffffffffffff191617169063ffff00001617169065ffff000000001617169067ffff0000000000001617169061ffff60401b1617169061ffff60501b1617169061ffff60601b16179061ffff60701b161717865551946104005195610400515b6005811061200a575050946001809495960155611ff3826102a0516150ad565b52612001816102a0516150ad565b50019190611964565b9096602061203260019261ffff8b51169085851b61ffff809160031b9316831b921b19161790565b98019101611fd3565b634e487b7160e01b61040051526012600452602461040051fd5b634e487b7160e01b61040051526032600452602461040051fd5b60209061207a6149f9565b82826102a05101015201611946565b906004355f52601160205264ffffffffff60405f205416610360526103605115613c64576004355f52601160205264ffffffffff60405f205460281c168215613c50576004355f52601160205261ffff60405f205460501c16610420525f610520525f61052052600161044052610360515f52600e6020526001600160a01b0360405f2054166103005260405160e05261212460e05161457c565b5f60e051525f602060e05101525f604060e05101525f606060e05101525f608060e05101525f60a060e05101525f60c060e0510152610360515f52600e6020526104405160405f2001604051808260208294549384815201905f5260205f20925f905b806003830110613bfc576121bd945491818110613be0575b818110613bc1575b818110613ba2575b10613b94575b5003826145b3565b6002546001600160a01b0316905f5b6104405161387a575b5050906060600492604051938480926314db786360e11b82525afa908115612c36575f610560525f925f9261381e575b506040516102e08190526001600160401b03606082019081119111176137185760606102e09493929451016040526105dc6102e05152610bb860206102e05101526107d060406102e05101525f52601060205260405f2061058052612271610440516105805101614a56565b6105005261227d615104565b6104c052612289615104565b610540525f6103c05260c06104a08190526040516104608190526122ad91906145b3565b600561046051526104a0515060a03660206104605101375f6103808190526104e0526080610480525b60056104e05110156138175761ffff6104e05160051b610500510151166103e0526104e0516104e05160041b046010146104e0511517156129185761ffff6123318160038186356104e05160041b1c1606166102e051615568565b5116806123446104e051610460516150ad565b52600b54604051634a2f04a160e01b81526103e0516004820152906001600160a01b031660e082602481845afa918215612c36575f92613758575b50604051633da45a2760e21b81525f600482015261ffff90931660248401526103208380604481015b0381845afa928315612c36575f93613733575b506040516103a0818152632c172a2960e11b9091526103e051815160040152516102809160249082905afa908115612c36575f610320525f916134dc575b60ff6105805154610480511c16606e81116129185761267a9261241f9160050a90614705565b6101c0526001600160a01b0360065416926040516102c0526304cd71ef60e01b6102c051526106046102c05101936103005160046102c051015260246102c051015261627060446102c051015260ff81511660646102c051015262ffffff60208201511660846102c051015262ffffff60408201511660a46102c051015261ffff60608201511660c46102c051015262ffffff610480518201511660e46102c051015261ffff60a0820151166101046102c051015262ffffff6104a051820151166101246102c051015261ffff60e0820151166101446102c051015262ffffff610100820151166101646102c051015261ffff610120820151166101846102c051015260ff610140820151166101a46102c051015260ff610160820151166101c46102c051015260ff610180820151166101e46102c051015263ffffffff6101a0820151166102046102c05101526101c081015160010b6102246102c051015260ff6101e0820151166102446102c051015263ffffffff610200820151166102646102c051015261022081015160010b6102846102c051015260ff610240820151166102a46102c051015263ffffffff610260820151166102c46102c051015261028081015160010b6102e46102c051015261ffff6102a0820151166103046102c051015261ffff6102c0820151166103246102c051015261ffff6102e0820151166103446102c051015261030060ff60f81b910151166103646102c0510152610420516103846102c05101526101c0516103a46102c051015261266c6103c46102c0510160e05161539e565b6104a46102c051019061539e565b60ff61056051166105846102c051015260ff82166105a46102c051015260ff84166105c46102c05101526106006105e46102c05101526060518091526106246102c0510161062060048360051b6102c0510101019161048051915f905b8282106134865750506102c05160a09390925082900390508173c9ceda474642e39f05c3e8fed75b3f45ed4ae2105af4610240526102405115612c36575f610200525f610100525f6101e05261024051613433575b61274061ffff61010051166103c0516149d8565b6103c0526101e05161292c576236ee80612760610200516101c051614705565b046040516101805261277861048051610180516145b3565b60036101805152601f196104805101366020610180510137604051610160526127a761048051610160516145b3565b60036101605152601f19610480510136602061016051013761ffff61032051511661ffff602061032051015116905f91816128ce575b5050906128186128489261ffff6040610320510151169061ffff84169161ffff606061032051015116906102005161016051610180516155e4565b61ffff80610480516103205101511692169161ffff60a061032051015116906102005161016051610180516155e4565b80610180515261016051525f5b61018051518110156128be5780612871600192610180516150ad565b51612882610520516104c0516150ad565b5261289081610160516150ad565b516105205160c0526128a461052051615427565b610520526128b760c051610540516150ad565b5201612855565b506104e0805160010190526122d6565b61ffff84160262ffffff811690810361291857600a90049081156127dd579091506128fc5f610180516150ad565b5261290a5f610160516150ad565b5260016128186128486127dd565b634e487b7160e01b5f52601160045260245ffd5b90915f610440525b61044051612d68575b505050506104405161044051612cda575b158015612c41575f610520525b610520516104c051526105205161054051526103c051612bca575b6104c05151612a83575b6004356104005152601160205264ffffffffff604061040051205460281c169060405190610140820192610360518352602083015260043560408301526104205160608301526103c0516104805183015261014060a083015261046051518093526101608201926020610460510190610400515b818110612a6957505050612a61612a4f7fb78e3028a75862669dc0598dc46a06b63ffcb2f616739b601e2cac64fb93917194849361ffff61038051166104a0518601521560e08501528381036101008501526104c0516153f4565b828103610120840152610540516153f4565b0390a1610213565b825161ffff168652602095860195909201916001016129f4565b610300513b156101e357604051632e68af5d60e11b815260016004820152610400518160248161040051610300515af180156101d557612baf575b506001600160a01b0360065416803b156101e3576040519063d81d0a1560e01b82526103005160048301526060602483015281612b01606482016104c0516153f4565b916003198284030160448301528180612b216104005195610540516153f4565b039161040051905af180156101d557612b94575b50610300513b156101e357604051632e68af5d60e11b8152610400516004820152610400518160248161040051610300515af180156101d557612b79575b50612980565b61040051612b86916145b3565b610400516101e35781612b73565b61040051612ba1916145b3565b610400516101e35781612b35565b61040051612bbc916145b3565b610400516101e35781612abe565b6001600160a01b0360065416803b156101c9575f8091606460405180948193637a94c56560e11b83526103005160048401526104205160248401526103c05160448401525af18015612c3657612c21575b50612976565b5f612c2b916145b3565b5f6104005281612c1b565b6040513d5f823e3d90fd5b600654604051627eeac760e11b815261042051610300516001600160a01b03908116600484015261ffff9091166024830152909160209183916044918391165afa908115612c36575f91612ca8575b50806103c05110816103c0511802186103c05261295b565b90506020813d602011612cd2575b81612cc3602093836145b3565b810103126101c9575182612c90565b3d9150612cb6565b50600654604051627eeac760e11b815261042051610300516001600160a01b03908116600484015261ffff9091166024830152909160209183916044918391165afa908115612c36575f91612d36575b506103c051111561294e565b90506020813d602011612d60575b81612d51602093836145b3565b810103126101c9575181612d2a565b3d9150612d44565b61ffff612d808160038187351606166102e051615568565b51166103805261058051549060405191612d998361457c565b8060201c60010b83528060301c60010b60208401528060401c60010b60408401528060101c60010b60608401528060501c60010b610480518401528060601c60010b60a084015260701c60010b6104a0518301526001600160a01b03600b5416926103206040518095633da45a2760e21b82528180612e2f6103805160048301919091602061ffff60408301945f845216910152565b03915afa938415612c36575f946133fb575b509060ff80926130306001600160a01b036006541695604051976304cd71ef60e01b89526106048901976103005160048b015260248a0152610e1060448a01528481511660648a015262ffffff60208201511660848a015262ffffff60408201511660a48a015261ffff60608201511660c48a015262ffffff610480518201511660e48a015261ffff60a0820151166101048a015262ffffff6104a051820151166101248a015261ffff60e0820151166101448a015262ffffff610100820151166101648a015261ffff610120820151166101848a015284610140820151166101a48a015284610160820151166101c48a015284610180820151166101e48a015263ffffffff6101a0820151166102048a01526101c081015160010b6102248a0152846101e0820151166102448a015263ffffffff610200820151166102648a015261022081015160010b6102848a015284610240820151166102a48a015263ffffffff610260820151166102c48a015261028081015160010b6102e48a015261ffff6102a0820151166103048a015261ffff6102c0820151166103248a015261ffff6102e0820151166103448a01526103008560f81b91015116610364890152610420516103848901526103e86103a48901526130256103c4890160e05161539e565b6104a488019061539e565b816105605116610584870152166105a4850152166105c48301526106006105e483015260605180915281610624810161062060048460051b840101019261048051915f905b82821061337b5750505050808260a09350038173c9ceda474642e39f05c3e8fed75b3f45ed4ae2105af48015612c36575f915f905f92613339575b5061ffff6130c291166103c0516149d8565b6103c0521561044052610440516130da575b8061293d565b806103e802906103e88204036129185761044051906236ee8090048161332a575b50806104405261310c575b806130d4565b61ffff6105805154165f52600f60205260405f20916003116101c95760406020815192016020830137604081526131446060826145b3565b5f5b602081106131545750613106565b8060011b81810460021482151715612918576001600160f81b03196131798285615579565b5116906001810181116129185760ff60f01b906131999060010185615579565b5160081c161760f01c5f905f60a0525f60a0526131b860018601615435565b604051905f60028801835b601060078401106132a157505050906131de610200826145b3565b6131ea60048801615435565b5f608052915b601060805110613246575b505050509061ffff60019216613217610520516104c0516150ad565b526105205161322581615427565b6105205261323f63ffffffff60a0511691610540516150ad565b5201613146565b9091929361ffff61325960805186615539565b5116851161329b575061ffff61327160805183615539565b51169363ffffffff61328560805185615539565b511660a0526001608051016080529291906131f0565b936131fb565b6001610100600892845463ffffffff8116825263ffffffff8160201c16602083015263ffffffff8160401c16604083015263ffffffff8160601c16606083015263ffffffff81610480511c166104805183015263ffffffff8160a01c1660a083015263ffffffff816104a0511c166104a05183015260e01c60e0820152019201920191906131c3565b6001915061ffff1614836130fb565b61ffff93506130c29250613365915060a03d60a011613374575b61335d81836145b3565b810190615362565b949391509491509391506130b0565b503d613353565b91935091936020806133ec60019361061f196003198b83030101865288519060606133db6133c96133b98551610480518652610480518601906153f4565b87860151858203898701526153f4565b604085015184820360408601526153f4565b9201519060608184039101526153f4565b96019201920185939192613075565b60ff9291945061342383916103203d811161342c575b61341b81836145b3565b810190615165565b94919250612e41565b503d613411565b60a03d811161347f575b8061344e61345c926102c0516145b3565b6102c051016102c051615362565b61012052610140525050610200526101405161010052610120516101e05261272c565b503d61343d565b909192936020806134ca60019361061f9b999a9b196003196102c05183030101865288519060606133db6133c96133b98551610480518652610480518601906153f4565b960192019201909291969594966126d7565b90506102803d811161372c575b6134f6816103a0516145b3565b6103a0519081010361028081126101c957610240136101c9576040516102205261024061022051016102205181106001600160401b03821117613718576040526135426103a051615145565b610220515261355660206103a05101615145565b602061022051015261356d60406103a05101615145565b604061022051015261358460606103a05101615145565b606061022051015261359d610480516103a05101615145565b610480516102205101526135b660a06103a05101615145565b60a06102205101526135cf6104a0516103a05101615145565b6104a0516102205101526135e860e06103a05101615145565b60e06102205101526136006101006103a051016150f6565b6101006102205101526136196101206103a05101615145565b6101206102205101526136326101406103a05101615145565b61014061022051015261364b6101606103a051016150f6565b6101606102205101526136646101806103a05101615145565b61018061022051015261367d6101a06103a05101615145565b6101a06102205101526136966101c06103a051016150f6565b6101c06102205101526136af6101e06103a05101615145565b6101e06102205101526136c86102006103a05101615145565b6102006102205101526136e16102206103a051016150f6565b6102208051015260286102406103a051015110156101c9576102606103a05101516101a05261022051610320526101a051906123f9565b634e487b7160e01b5f52604160045260245ffd5b503d6134e9565b610280919350613751906103203d811161342c5761341b81836145b3565b92906123bb565b92915060e0833d821161380f575b8161377360e093836145b3565b810103126101c9576103206123a893613800604051916137928361457c565b61379b81615127565b83526137a960208201615127565b60208401526137ba60408201615127565b60408401526137cb60608201615127565b60608401526137de610480518201615127565b610480518401526137f160a08201615127565b60a08401526104a05101615127565b6104a05182015292935061237f565b3d9150613766565b9091612934565b925090506060823d606011613872575b8161383b606093836145b3565b810103126101c95761384c826150f6565b91613865604061385e602084016150f6565b92016150f6565b9261056052919085612205565b3d915061382e565b8151811015613b8f576001600160401b0361389582846150ad565b5116604051631a4cd3f560e11b815281600482015260066024820152602081604481885afa8015612c36575f90613b5c575b6138e29150610440510b606060e0510151610440510b6150da565b610440510b606060e0510152604051631a4cd3f560e11b815281600482015260026024820152602081604481885afa8015612c36575f90613b29575b6139369150610440510b60e05151610440510b6150da565b610440510b60e05152604051631a4cd3f560e11b815281600482015260046024820152602081604481885afa8015612c36575f90613af6575b61398a9150610440510b602060e0510151610440510b6150da565b610440510b602060e0510152604051631a4cd3f560e11b815281600482015260036024820152602081604481885afa8015612c36575f90613ac3575b6139e19150610440510b604060e0510151610440510b6150da565b610440510b604060e051015260405190631a4cd3f560e11b8252600482015260056024820152602081604481875afa8015612c36575f90613a90575b613a7a9150610440510b613a3c81608060e0510151610440510b6150da565b610440510b608060e0510152613a5d8160a060e0510151610440510b6150da565b610440510b60a060e051015260c060e0510151610440510b6150da565b610440510b60c060e051015261044051016121cc565b506020813d8211613abb575b81613aa9602093836145b3565b810103126101c957613a7a9051613a1d565b3d9150613a9c565b506020813d8211613aee575b81613adc602093836145b3565b810103126101c9576139e190516139c6565b3d9150613acf565b506020813d8211613b21575b81613b0f602093836145b3565b810103126101c95761398a905161396f565b3d9150613b02565b506020813d8211613b54575b81613b42602093836145b3565b810103126101c957613936905161391e565b3d9150613b35565b506020813d8211613b87575b81613b75602093836145b3565b810103126101c9576138e290516138c7565b3d9150613b68565b6121d5565b60c01c8152602001876121b5565b926020906001600160401b038460801c168152019261044051016121af565b926020906001600160401b038460401c168152019261044051016121a7565b926020906001600160401b03841681520192610440510161219f565b91600491935060809085546001600160401b03811682526001600160401b038160401c1660208301526001600160401b0381841c16604083015260c01c606082015201936104405101920184929391612187565b634e487b7160e01b5f52603260045260245ffd5b637037cbb560e11b5f5260045ffd5b631fec674760e31b5f5260045ffd5b6320138a9f60e01b5f523360045260245260445ffd5b346101c95760203660031901126101c9576004356001600160401b0381116101c957613cc89036906004016144d7565b613cd0614b3a565b6001600160401b03811161371857600160401b811161371857600d5481600d55808210613e3a575b5081600d5f528160041c5f5b818110613de15750600f198316830380613d84575b50505060405190806020830160208452526040820192905f5b818110613d61577f03c6adabe22258ad3583b10b4c69bf02b991a27564e46516f3ea09b62e67386284860385a1005b90919360208060019261ffff613d76896146c0565b168152019501929101613d32565b915f925f5b818110613dab575050505f5160206156975f395f51905f520155828080613d19565b9091936020613dd7600192613dbf8861472e565b9085851b61ffff809160031b9316831b921b19161790565b9501929101613d89565b5f5f5b60108110613e0657505f5160206156975f395f51905f52820155600101613d04565b93906020613e31600192613e198561472e565b9088851b61ffff809160031b9316831b921b19161790565b92019401613de4565b613e7d90600f80840160041c91601e8560011b1680613e83575b500160041c5f5160206156975f395f51905f5201905f5160206156975f395f51905f5201614718565b82613cf8565b613ebd907fd7b6990105719101dabeb77144f2a3385c8033acd3af97e9423a695e81ad1eb48501908154905f199060200360031b1c169055565b86613e54565b346101c9576101603660031901126101c9576004356001600160a01b0381168091036101c957602435906001600160a01b0382168092036101c957604435906001600160a01b0382168092036101c957606435906001600160a01b0382168092036101c9576084359162ffffff831683036101c95760a435926001600160a01b0384168094036101c95760c4356001600160a01b0381168091036101c95760e435906001600160a01b0382168092036101c957610104359060ff821682036101c957610124356001600160401b0381116101c957613fa59036906004016144d7565b989097610144359182151583036101c9575f5160206156b75f395f51905f52549b60ff8d60401c16159c8d6001600160401b038216801591826144a7575b50600114908161449d575b159081614494575b506144855767ffffffffffffffff1981166001175f5160206156b75f395f51905f52558d614459575b50614028615082565b614030615082565b61403933614abc565b614041615082565b614049615082565b881561444a577fd18a46b4b6e426a637b309ecda91b8979f4b9ff8ba397d33cc21975868f9a8e2998961407d60209b6146cf565b7fe3b8b28236cd5346ea32e7cd9586665899a275beb35e4e32feeedb3c846cd0695f80a26001600160601b0360a01b60025416176002556001600160601b0360a01b60065416176006556001600160601b0360a01b60035416176003556001600160601b0360a01b600a541617600a555f146144405761012c925b6008549362ffffff60a01b9060a01b16918262ffffff60a01b198616176008556001600160601b0360a01b600b541617600b556001600160601b0360a01b600c541617600c55600164ffffffffff195f5416175f55614155614b3a565b7f4f54a0bb0df8a35f3887bec08b0faa868f57b6052aaa6842765663cb6a6d5d698560ff60b81b8460b81b1693848463ffffffff60a01b198816171760085560ff60405191168152a16141a6614b3a565b62ffffff60c01b8460c01b169266ffffffffffffff60a01b191617171760085562ffffff60405191168152a16141da614b3a565b6007805462ffffff60a01b1916613d0960a71b179055604051621e848081527f49b98b5066c079ce5d03fa1b58f85e07295e2baf54b78dc4da95bb1d4aa60b4c90602090a1614227614b3a565b6001600160401b03821161371857600160401b821161371857600d5482600d558083106143b8575b5080600d5f528260041c5f5b8181106143775750600f198416840380614332575b50505060405191806020840160208552526040830191905f5b81811061430f57857f03c6adabe22258ad3583b10b4c69bf02b991a27564e46516f3ea09b62e67386286860387a16142bd57005b60ff60401b195f5160206156b75f395f51905f5254165f5160206156b75f395f51905f52557fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2602060405160018152a1005b90919260208060019261ffff614324886146c0565b168152019401929101614289565b915f925f5b818110614359575050505f5160206156975f395f51905f520155838080614270565b909193602061436d600192613dbf8861472e565b9501929101614337565b5f5f5b6010811061439c57505f5160206156975f395f51905f5282015560010161425b565b939060206143af600192613e198561472e565b9201940161437a565b6143fa90600f80850160041c91601e8660011b168061440057500160041c5f5160206156975f395f51905f5201905f5160206156975f395f51905f5201614718565b8361424f565b61443a907fd7b6990105719101dabeb77144f2a3385c8033acd3af97e9423a695e81ad1eb48501908154905f199060200360031b1c169055565b87613e54565b6203f480926140f8565b63d92e233d60e01b5f5260045ffd5b68ffffffffffffffffff191668010000000000000001175f5160206156b75f395f51905f52558d61401f565b63f92ee8a960e01b5f5260045ffd5b9050158f613ff6565b303b159150613fee565b91508f613fe3565b600435906001600160a01b03821682036101c957565b6004359062ffffff821682036101c957565b9181601f840112156101c9578235916001600160401b0383116101c9576020808501948460051b0101116101c957565b9060406003198301126101c9576004356001600160401b0381116101c95782614532916004016144d7565b929092916024356001600160401b0381116101c957826023820112156101c9578060040135926001600160401b0384116101c95760246107e08502830101116101c9576024019190565b60e081019081106001600160401b0382111761371857604052565b61014081019081106001600160401b0382111761371857604052565b90601f801991011681019081106001600160401b0382111761371857604052565b6001600160401b03811161371857601f01601f191660200190565b60409060031901126101c9576004359060243590565b600435906001600160401b03821682036101c957565b610120809161ffff8151168452602081015160010b6020850152604081015160010b6040850152606081015160010b6060850152608081015160010b608085015260a081015160010b60a085015260c081015160010b60c085015260e081015160010b60e085015260ff61010082015116610100850152015191015f905b600582106146a657505050565b60208060019261ffff865116815201930191019091614699565b359061ffff821682036101c957565b6001600160a01b03166001600160601b0360a01b5f5160206156775f395f51905f525416175f5160206156775f395f51905f5255565b8181029291811591840414171561291857565b818110614723575050565b5f8155600101614718565b3561ffff811681036101c95790565b9190811015613c50576107e0020190565b9190811015613c505760051b0190565b35908160010b82036101c957565b905f905b6010821061477d57505050565b60208060019261ffff61478f876146c0565b16815201930191019091614770565b6040808252810183905292939290916001600160fb1b0381116101c957608092849160051b8091606085013782019160608301906020606082860301910152520191905f905b8082106147f15750505090565b909192833560ff81168091036101c957815261480f6020850161475e565b60010b60208201526148236040850161475e565b60010b60408201526148376060850161475e565b60010b606082015261484b6080850161475e565b60010b608082015261485f60a0850161475e565b60010b60a082015261487360c0850161475e565b60010b60c082015261488760e0850161475e565b60010b60e082015261489c610100850161475e565b60010b6101008201526148b2610120850161475e565b60010b6101208201526148c8610140850161475e565b60010b6101408201526148de610160850161475e565b60010b6101608201526148f4610180850161475e565b60010b61018082015261490a6101a0850161475e565b60010b6101a08201526149206101c0850161475e565b60010b6101c082015261493b6101e082016101e0860161476c565b6103e081016103e08501905f905b60108210614978575050506107e0808261496d6105e0600195016105e0890161476c565b0194019201906147e4565b82359063ffffffff82168092036101c95760208160019382935201930191019091614949565b5f52600e602052600160405f2001908154156149c5576149c0905f1992614fbb565b141590565b50505f90565b519081151582036101c957565b9190820180921161291857565b356001600160401b03811681036101c95790565b60405190614a0682614597565b815f81525f60208201525f60408201525f60608201525f60808201525f60a08201525f60c08201525f60e08201525f61010082015261012060405191614a4d60a0846145b3565b60a03684370152565b9061ffff60405192548181168452818160101c166020850152818160201c166040850152818160301c16606085015260401c166080830152614a9960a0836145b3565b565b9190918054831015613c50575f52601860205f208360021c019260031b1690565b6001600160a01b03168015614b27576001600160a01b035f5160206156575f395f51905f5254826001600160601b0360a01b8216175f5160206156575f395f51905f5255167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a3565b631e4fbdf760e01b5f525f60045260245ffd5b6001600160a01b035f5160206156575f395f51905f5254163303614b5a57565b63118cdaa760e01b5f523360045260245ffd5b358060010b81036101c95790565b60208101915f614b8a84614b6d565b60010b1380614f97575b15614f88576060820190614ba782614b6d565b906080840191614bb683614b6d565b60010b9060010b13614f885760a08401614bcf81614b6d565b9060c0860191614bde83614b6d565b60010b9060010b13614f885760e0860196614bf888614b6d565b97610100880198614c088a614b6d565b60010b9060010b13614f8857610120880192614c2384614b6d565b6101408a0190614c3282614b6d565b60010b9060010b13614f88576101608a0192614c4d84614b6d565b956101808c0196614c5d88614b6d565b60010b9060010b13614f88578b996101a08b01996101c0614c7d8c614b6d565b9c019b614c898d614b6d565b60010b9060010b13614f88575f52600f60205260405f209d8d359760ff89168099036101c9578f948f955491614cbe90614b6d565b60081b95604001614cce90614b6d565b60181b9e614cdb90614b6d565b60281b93614ce890614b6d565b60381b97614cf590614b6d565b60481b9b614d0290614b6d565b60581b90614d0f90614b6d565b60681b92614d1c90614b6d565b60781b94614d2990614b6d565b60881b96614d3690614b6d565b60981b98614d4390614b6d565b60a81b9a614d5090614b6d565b60b81b9c614d5d90614b6d565b60c81b9d614d6a90614b6d565b60d81b61ffff60d81b1661ffff60a81b909b1661ffff60981b90991661ffff60881b90971661ffff60781b90951661ffff60681b9093166cffff00000000000000000000009091166affff0000000000000000009c909c1668ffff000000000000009890981666ffff00000000009490941664ffff0000009f909f1662ffff00969096167fffffff0000000000000000000000000000000000000000000000000000000000929092167fffffff000000000000000000000000000000000000000000000000ffffffffff9a909a169990991717939093179b909b179a909a179290921795909517929092179190911795909517919091179390931761ffff60b81b919091161761ffff60c81b91909116171782556101e081015f5b60018110614f505750506103e081015f5b60028110614f025750506105e0015f5b60018110614eb357505050565b5f5f5b60108110614ece575083820160040155600101614ea6565b92906020614ef9600192614ee18561472e565b9087851b61ffff809160031b9316831b921b19161790565b92019301614eb6565b5f5f5b60088110614f1d575084820160020155600101614e96565b9290813563ffffffff81168082036101c9576001926020925063ffffffff8760051b92831b921b19161792019301614f05565b5f5f5b60108110614f6c57509060019182828701015501614e85565b92906020614f7f600192614ee18561472e565b92019301614f53565b636311fcc960e11b5f5260045ffd5b50614fa183614b6d565b614fad60408401614b6d565b60010b9060010b1315614b94565b91905f83545f1981019081116129185793919092935b80841115614fe3575b505050505f1990565b83810381811161291857614ffa9060011c856149d8565b93826001600160401b0361500e8787614a9b565b90549060031b1c16145f14615024575050505090565b826001600160401b0361503c87879998959697614a9b565b90549060031b1c16105f14615061575060018101809111612918575b92939190614fd1565b9150801561507a575f1981019081116129185790615058565b839450614fda565b60ff5f5160206156b75f395f51905f525460401c161561509e57565b631afcd79f60e31b5f5260045ffd5b8051821015613c505760209160051b010190565b600190810b0190617fff8213617fff1983121761291857565b9060010b9060010b0190617fff198212617fff83131761291857565b519060ff821682036101c957565b604051610600919061511683826145b3565b602f815291601f1901366020840137565b51908160010b82036101c957565b519062ffffff821682036101c957565b519061ffff821682036101c957565b519063ffffffff821682036101c957565b90816103209103126101c957604051906103208201908282106001600160401b03831117613718576103009160405261519d816150f6565b83526151ab60208201615135565b60208401526151bc60408201615135565b60408401526151cd60608201615145565b60608401526151de60808201615135565b60808401526151ef60a08201615145565b60a084015261520060c08201615135565b60c084015261521160e08201615145565b60e08401526152236101008201615135565b6101008401526152366101208201615145565b61012084015261524961014082016150f6565b61014084015261525c61016082016150f6565b61016084015261526f61018082016150f6565b6101808401526152826101a08201615154565b6101a08401526152956101c08201615127565b6101c08401526152a86101e082016150f6565b6101e08401526152bb6102008201615154565b6102008401526152ce6102208201615127565b6102208401526152e161024082016150f6565b6102408401526152f46102608201615154565b6102608401526153076102808201615127565b61028084015261531a6102a08201615145565b6102a084015261532d6102c08201615145565b6102c08401526153406102e08201615145565b6102e084015201516001600160f81b0319811681036101c95761030082015290565b908160a09103126101c95780519160208201519161538260408201615145565b9161539b608061539460608501615145565b93016149cb565b90565b60c08091805160010b8452602081015160010b6020850152604081015160010b6040850152606081015160010b6060850152608081015160010b608085015260a081015160010b60a0850152015160010b910152565b90602080835192838152019201905f5b8181106154115750505090565b8251845260209384019390920191600101615404565b5f1981146129185760010190565b60405191905f835b6010600f83011061545757505050614a99610200836145b3565b6001610200601092855461ffff8116825261ffff81861c16602083015261ffff8160201c16604083015261ffff8160301c16606083015261ffff8160401c16608083015261ffff8160501c1660a083015261ffff8160601c1660c083015261ffff8160701c1660e083015261ffff8160801c1661010083015261ffff8160901c1661012083015261ffff8160a01c1661014083015261ffff8160b01c1661016083015261ffff8160c01c1661018083015261ffff8160d01c166101a083015261ffff8160e01c166101c083015260f01c6101e08201520193019101909161543d565b906010811015613c505760051b0190565b8115615554570690565b634e487b7160e01b5f52601260045260245ffd5b906003811015613c505760051b0190565b908151811015613c50570160200190565b906155ae575080511561559f57805190602001fd5b63d6bda27560e01b5f5260045ffd5b815115806155db575b6155bf575090565b6001600160a01b0390639996b31560e01b5f521660045260245ffd5b50803b156155b7565b93915091959461ffff85971691826155ff575b505050505050565b62ffffff61ffff911691160262ffffff811690810361291857600a90049283615629575b806155f7565b61564b95965091849161563f83615645956150ad565b526150ad565b52615427565b905f8080808061562356fe9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c19930055babfd4afb3639f1ad2bd51b6ac6a46a851aaaf7dddc61bc22c3b70fc381d86d7b6990105719101dabeb77144f2a3385c8033acd3af97e9423a695e81ad1eb5f0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00a264697066735822122008a27d3a5fecb6e4c8fe3dc8e74d433307011647d944350e37e7383d856c945664736f6c634300081c0033