Contracts
Last updated
Last updated
Returns the Contract Application Binary Interface ( ABI ) of a verified smart contract.
Find verified contracts on our Verified Contracts Source Code page.
https://api.xaiscan.io/api
?module=contract
&action=getabi
&address=0xC36DF997067FFEfa55202454235E91F9Ec3649Cd
&apikey=YourApiKeyTokenTry this endpoint in your browser
Query Parameters
| Parameter | Description |
|---|---|
Sample Response
{
"status": "1",
"message": "OK",
"result": "[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_validatorPool\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_rewardDivider\",\"type\":\"uint256\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"validator\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"l2BlockNumber\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"name\":\"Rewarded\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"value\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"address\",\"name\":\"to\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"address\",\"name\":\"from\",\"type\":\"address\"}],\"name\":\"Withdrawal\",\"type\":\"event\"},{\"inputs\":[],\"name\":\"MIN_WITHDRAWAL_AMOUNT\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"RECIPIENT\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"REWARD_DIVIDER\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"VALIDATOR_POOL\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_addr\",\"type\":\"address\"}],\"name\":\"balanceOf\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_validator\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_l2BlockNumber\",\"type\":\"uint256\"}],\"name\":\"reward\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"totalProcessed\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"totalReserved\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"version\",\"outputs\":[{\"internalType\":\"string\",\"name\":\"\",\"type\":\"string\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"withdraw\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}]"
}A simple sample for retrieving the contractABI using Web3.js and Jquery to interact with a contract.
var Web3 = require('web3');
var web3 = new Web3(new Web3.providers.HttpProvider());
var version = web3.version.api;
$.getJSON('https://api.xaiscan.io/api?module=contract&action=getabi&address=0xfc724f3f942bbc63f14fe4dd4b9128c23c693909&apikey=YourApiKeyToken', function (data) {
var contractABI = "";
contractABI = JSON.parse(data.result);
if (contractABI != ''){
var MyContract = web3.eth.contract(contractABI);
var myContractInstance = MyContract.at("0xfb6916095ca1df60bb79ce92ce3ea74c37c5d359");
var result = myContractInstance.memberId("0xfe8ad7dd2f564a877cc23feea6c0a9cc2e783715");
console.log("result1 : " + result);
var result = myContractInstance.members(1);
console.log("result2 : " + result);
} else {
console.log("Error" );
}
});Returns the Solidity source code of a verified smart contract.
https://api.xaiscan.io/api
?module=contract
&action=getsourcecode
&address=0xC36DF997067FFEfa55202454235E91F9Ec3649Cd
&apikey=YourApiKeyToken Query Parameters
Sample Response
{
"status": "1",
"message": "OK",
"result": [
{
"SourceCode": "{{\r\n \"language\": \"Solidity\",\r\n \"sources\": {\r\n \"contracts/L1/ResourceMetering.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.15;\\n\\nimport { Initializable } from \\\"@openzeppelin/contracts/proxy/utils/Initializable.sol\\\";\\nimport { Math } from \\\"@openzeppelin/contracts/utils/math/Math.sol\\\";\\n\\nimport { Arithmetic } from \\\"../libraries/Arithmetic.sol\\\";\\nimport { Burn } from \\\"../libraries/Burn.sol\\\";\\n\\n/**\\n * @custom:upgradeable\\n * @title ResourceMetering\\n * @notice ResourceMetering implements an EIP-1559 style resource metering system where pricing\\n * updates automatically based on current demand.\\n */\\nabstract contract ResourceMetering is Initializable {\\n /**\\n * @notice Represents the various parameters that control the way in which resources are\\n * metered. Corresponds to the EIP-1559 resource metering system.\\n *\\n * @custom:field prevBaseFee Base fee from the previous block(s).\\n * @custom:field prevBoughtGas Amount of gas bought so far in the current block.\\n * @custom:field prevBlockNum Last block number that the base fee was updated.\\n */\\n struct ResourceParams {\\n uint128 prevBaseFee;\\n uint64 prevBoughtGas;\\n uint64 prevBlockNum;\\n }\\n\\n /**\\n * @notice Represents the configuration for the EIP-1559 based curve for the deposit gas\\n * market. These values should be set with care as it is possible to set them in\\n * a way that breaks the deposit gas market. The target resource limit is defined as\\n * maxResourceLimit / elasticityMultiplier. This struct was designed to fit within a\\n * single word. There is additional space for additions in the future.\\n *\\n * @custom:field maxResourceLimit Represents the maximum amount of deposit gas that\\n * can be purchased per block.\\n * @custom:field elasticityMultiplier Determines the target resource limit along with\\n * the resource limit.\\n * @custom:field baseFeeMaxChangeDenominator Determines max change on fee per block.\\n * @custom:field minimumBaseFee The min deposit base fee, it is clamped to this\\n * value.\\n * @custom:field systemTxMaxGas The amount of gas supplied to the system\\n * transaction. This should be set to the same number\\n * that the kroma-node sets as the gas limit for the\\n * system transaction.\\n * @custom:field maximumBaseFee The max deposit base fee, it is clamped to this\\n * value.\\n */\\n struct ResourceConfig {\\n uint32 maxResourceLimit;\\n uint8 elasticityMultiplier;\\n uint8 baseFeeMaxChangeDenominator;\\n uint32 minimumBaseFee;\\n uint32 systemTxMaxGas;\\n uint128 maximumBaseFee;\\n }\\n\\n /**\\n * @notice EIP-1559 style gas parameters.\\n */\\n ResourceParams public params;\\n\\n /**\\n * @notice Reserve extra slots (to a total of 50) in the storage layout for future upgrades.\\n */\\n uint256[48] private __gap;\\n\\n /**\\n * @notice Meters access to a function based an amount of a requested resource.\\n *\\n * @param _amount Amount of the resource requested.\\n */\\n modifier metered(uint64 _amount) {\\n // Record initial gas amount so we can refund for it later.\\n uint256 initialGas = gasleft();\\n\\n // Run the underlying function.\\n _;\\n\\n // Run the metering function.\\n _metered(_amount, initialGas);\\n }\\n\\n /**\\n * @notice An internal function that holds all of the logic for metering a resource.\\n *\\n * @param _amount Amount of the resource requested.\\n * @param _initialGas The amount of gas before any modifier execution.\\n */\\n function _metered(uint64 _amount, uint256 _initialGas) internal {\\n // Update block number and base fee if necessary.\\n uint256 blockDiff = block.number - params.prevBlockNum;\\n\\n ResourceConfig memory config = _resourceConfig();\\n int256 targetResourceLimit = int256(uint256(config.maxResourceLimit)) /\\n int256(uint256(config.elasticityMultiplier));\\n\\n if (blockDiff > 0) {\\n // Handle updating EIP-1559 style gas parameters. We use EIP-1559 to restrict the rate\\n // at which deposits can be created and therefore limit the potential for deposits to\\n // spam the L2 system. Fee scheme is very similar to EIP-1559 with minor changes.\\n int256 gasUsedDelta = int256(uint256(params.prevBoughtGas)) - targetResourceLimit;\\n int256 baseFeeDelta = (int256(uint256(params.prevBaseFee)) * gasUsedDelta) /\\n (targetResourceLimit * int256(uint256(config.baseFeeMaxChangeDenominator)));\\n\\n // Update base fee by adding the base fee delta and clamp the resulting value between\\n // min and max.\\n int256 newBaseFee = Arithmetic.clamp({\\n _value: int256(uint256(params.prevBaseFee)) + baseFeeDelta,\\n _min: int256(uint256(config.minimumBaseFee)),\\n _max: int256(uint256(config.maximumBaseFee))\\n });\\n\\n // If we skipped more than one block, we also need to account for every empty block.\\n // Empty block means there was no demand for deposits in that block, so we should\\n // reflect this lack of demand in the fee.\\n if (blockDiff > 1) {\\n // Update the base fee by repeatedly applying the exponent 1-(1/change_denominator)\\n // blockDiff - 1 times. Simulates multiple empty blocks. Clamp the resulting value\\n // between min and max.\\n newBaseFee = Arithmetic.clamp({\\n _value: Arithmetic.cdexp({\\n _coefficient: newBaseFee,\\n _denominator: int256(uint256(config.baseFeeMaxChangeDenominator)),\\n _exponent: int256(blockDiff - 1)\\n }),\\n _min: int256(uint256(config.minimumBaseFee)),\\n _max: int256(uint256(config.maximumBaseFee))\\n });\\n }\\n\\n // Update new base fee, reset bought gas, and update block number.\\n params.prevBaseFee = uint128(uint256(newBaseFee));\\n params.prevBoughtGas = 0;\\n params.prevBlockNum = uint64(block.number);\\n }\\n\\n // Make sure we can actually buy the resource amount requested by the user.\\n params.prevBoughtGas += _amount;\\n require(\\n int256(uint256(params.prevBoughtGas)) <= int256(uint256(config.maxResourceLimit)),\\n \\\"ResourceMetering: cannot buy more gas than available gas limit\\\"\\n );\\n\\n // Determine the amount of ETH to be paid.\\n uint256 resourceCost = uint256(_amount) * uint256(params.prevBaseFee);\\n\\n // We currently charge for this ETH amount as an L1 gas burn, so we convert the ETH amount\\n // into gas by dividing by the L1 base fee. We assume a minimum base fee of 1 gwei to avoid\\n // division by zero for L1s that don't support 1559 or to avoid excessive gas burns during\\n // periods of extremely low L1 demand. One-day average gas fee hasn't dipped below 1 gwei\\n // during any 1 day period in the last 5 years, so should be fine.\\n uint256 gasCost = resourceCost / Math.max(block.basefee, 1 gwei);\\n\\n // Give the user a refund based on the amount of gas they used to do all of the work up to\\n // this point. Since we're at the end of the modifier, this should be pretty accurate. Acts\\n // effectively like a dynamic stipend (with a minimum value).\\n uint256 usedGas = _initialGas - gasleft();\\n if (gasCost > usedGas) {\\n Burn.gas(gasCost - usedGas);\\n }\\n }\\n\\n /**\\n * @notice Virtual function that returns the resource config. Contracts that inherit this\\n * contract must implement this function.\\n *\\n * @return ResourceConfig\\n */\\n function _resourceConfig() internal virtual returns (ResourceConfig memory);\\n\\n /**\\n * @notice Sets initial resource parameter values. This function must either be called by the\\n * initializer function of an upgradeable child contract.\\n */\\n // solhint-disable-next-line func-name-mixedcase\\n function __ResourceMetering_init() internal onlyInitializing {\\n params = ResourceParams({\\n prevBaseFee: 1 gwei,\\n prevBoughtGas: 0,\\n prevBlockNum: uint64(block.number)\\n });\\n }\\n}\\n\"\r\n },\r\n \"contracts/L2/L2StandardBridge.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.15;\\n\\nimport { Predeploys } from \\\"../libraries/Predeploys.sol\\\";\\nimport { Semver } from \\\"../universal/Semver.sol\\\";\\nimport { StandardBridge } from \\\"../universal/StandardBridge.sol\\\";\\n\\n/**\\n * @custom:proxied\\n * @custom:predeploy 0x4200000000000000000000000000000000000009\\n * @title L2StandardBridge\\n * @notice The L2StandardBridge is responsible for transfering ETH and ERC20 tokens between L1 and\\n * L2. In the case that an ERC20 token is native to L2, it will be escrowed within this\\n * contract. If the ERC20 token is native to L1, it will be burnt.\\n * NOTE: this contract is not intended to support all variations of ERC20 tokens. Examples\\n * of some token types that may not be properly supported by this contract include, but are\\n * not limited to: tokens with transfer fees, rebasing tokens, and tokens with blocklists.\\n */\\ncontract L2StandardBridge is StandardBridge, Semver {\\n /**\\n * @custom:semver 1.0.0\\n *\\n * @param _otherBridge Address of the L1StandardBridge.\\n */\\n constructor(address payable _otherBridge)\\n Semver(1, 0, 0)\\n StandardBridge(payable(Predeploys.L2_CROSS_DOMAIN_MESSENGER), _otherBridge)\\n {}\\n\\n /**\\n * @notice Allows EOAs to bridge ETH by sending directly to the bridge.\\n */\\n receive() external payable override onlyEOA {\\n _initiateBridgeETH(\\n msg.sender,\\n msg.sender,\\n msg.value,\\n RECEIVE_DEFAULT_GAS_LIMIT,\\n bytes(\\\"\\\")\\n );\\n }\\n}\\n\"\r\n },\r\n \"contracts/L2/ValidatorRewardVault.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.15;\\n\\nimport { L2StandardBridge } from \\\"../L2/L2StandardBridge.sol\\\";\\nimport { Predeploys } from \\\"../libraries/Predeploys.sol\\\";\\nimport { FeeVault } from \\\"../universal/FeeVault.sol\\\";\\nimport { Semver } from \\\"../universal/Semver.sol\\\";\\nimport { AddressAliasHelper } from \\\"../vendor/AddressAliasHelper.sol\\\";\\n\\n/**\\n * @custom:proxied\\n * @custom:predeploy 0x4200000000000000000000000000000000000008\\n * @title ValidatorRewardVault\\n * @notice The ValidatorRewardVault accumulates transaction fees and pays rewards to validators.\\n */\\ncontract ValidatorRewardVault is FeeVault, Semver {\\n /**\\n * @notice Address of the ValidatorPool contract on L1.\\n */\\n address public immutable VALIDATOR_POOL;\\n\\n /**\\n * @notice A value to divide the vault balance by when determining the reward amount.\\n */\\n uint256 public immutable REWARD_DIVIDER;\\n\\n /**\\n * @notice The reward balance that the validator is eligible to receive.\\n */\\n mapping(address => uint256) internal rewards;\\n\\n /**\\n * @notice A mapping of whether the reward corresponding to the L2 block number has been paid.\\n */\\n mapping(uint256 => bool) internal isPaid;\\n\\n /**\\n * @notice The amount of determined as rewards.\\n */\\n uint256 public totalReserved;\\n\\n /**\\n * @notice Emitted when the balance of a validator has increased.\\n *\\n * @param validator Address of the validator.\\n * @param l2BlockNumber The L2 block number of the output root.\\n * @param amount Amount of the reward.\\n */\\n event Rewarded(address indexed validator, uint256 indexed l2BlockNumber, uint256 amount);\\n\\n /**\\n * @custom:semver 1.0.0\\n *\\n * @param _validatorPool Address of the ValidatorPool contract on L1.\\n * @param _rewardDivider A value to divide the vault balance by when determining the reward amount.\\n */\\n constructor(address _validatorPool, uint256 _rewardDivider)\\n FeeVault(address(0), 0)\\n Semver(1, 0, 0)\\n {\\n VALIDATOR_POOL = _validatorPool;\\n REWARD_DIVIDER = _rewardDivider;\\n }\\n\\n /**\\n * @notice Rewards the validator for submitting the output.\\n * ValidatorPool contract on L1 calls this function over the portal when output is finalized.\\n *\\n * @param _validator Address of the validator.\\n * @param _l2BlockNumber The L2 block number of the output root.\\n */\\n function reward(address _validator, uint256 _l2BlockNumber) external {\\n require(\\n AddressAliasHelper.undoL1ToL2Alias(msg.sender) == VALIDATOR_POOL,\\n \\\"ValidatorRewardVault: function can only be called from the ValidatorPool\\\"\\n );\\n\\n require(_validator != address(0), \\\"ValidatorRewardVault: validator address cannot be 0\\\");\\n\\n require(\\n !isPaid[_l2BlockNumber],\\n \\\"ValidatorRewardVault: the reward has already been paid for the L2 block number\\\"\\n );\\n\\n uint256 amount = _determineRewardAmount();\\n\\n unchecked {\\n totalReserved += amount;\\n rewards[_validator] += amount;\\n }\\n\\n isPaid[_l2BlockNumber] = true;\\n\\n emit Rewarded(_validator, _l2BlockNumber, amount);\\n }\\n\\n /**\\n * @notice Withdraws all of the sender's balance.\\n * Reverts if the balance is less than the minimum withdrawal amount.\\n */\\n function withdraw() external override {\\n uint256 balance = rewards[msg.sender];\\n\\n require(\\n balance >= MIN_WITHDRAWAL_AMOUNT,\\n \\\"ValidatorRewardVault: withdrawal amount must be greater than minimum withdrawal amount\\\"\\n );\\n\\n rewards[msg.sender] = 0;\\n\\n unchecked {\\n totalReserved -= balance;\\n totalProcessed += balance;\\n }\\n\\n emit Withdrawal(balance, msg.sender, msg.sender);\\n\\n L2StandardBridge(payable(Predeploys.L2_STANDARD_BRIDGE)).bridgeETHTo{ value: balance }(\\n msg.sender,\\n WITHDRAWAL_MIN_GAS,\\n bytes(\\\"\\\")\\n );\\n }\\n\\n /**\\n * @notice Determines the reward amount.\\n *\\n * @return Amount of the reward.\\n */\\n function _determineRewardAmount() internal view returns (uint256) {\\n return (address(this).balance - totalReserved) / REWARD_DIVIDER;\\n }\\n\\n /**\\n * @notice Returns the reward balance of the given address.\\n *\\n * @param _addr Address to lookup.\\n *\\n * @return The reward balance of the given address.\\n */\\n function balanceOf(address _addr) external view returns (uint256) {\\n return rewards[_addr];\\n }\\n}\\n\"\r\n },\r\n \"contracts/libraries/Arithmetic.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.15;\\n\\nimport { Math } from \\\"@openzeppelin/contracts/utils/math/Math.sol\\\";\\nimport { SignedMath } from \\\"@openzeppelin/contracts/utils/math/SignedMath.sol\\\";\\nimport { FixedPointMathLib } from \\\"@rari-capital/solmate/src/utils/FixedPointMathLib.sol\\\";\\n\\n/**\\n * @title Arithmetic\\n * @notice Even more math than before.\\n */\\nlibrary Arithmetic {\\n /**\\n * @notice Clamps a value between a minimum and maximum.\\n *\\n * @param _value The value to clamp.\\n * @param _min The minimum value.\\n * @param _max The maximum value.\\n *\\n * @return The clamped value.\\n */\\n function clamp(\\n int256 _value,\\n int256 _min,\\n int256 _max\\n ) internal pure returns (int256) {\\n return SignedMath.min(SignedMath.max(_value, _min), _max);\\n }\\n\\n /**\\n * @notice Clamps a value between a minimum and maximum.\\n *\\n * @param _value The value to clamp.\\n * @param _min The minimum value.\\n * @param _max The maximum value.\\n *\\n * @return The clamped value.\\n */\\n function clamp(\\n uint256 _value,\\n uint256 _min,\\n uint256 _max\\n ) internal pure returns (uint256) {\\n return Math.min(Math.max(_value, _min), _max);\\n }\\n\\n /**\\n * @notice (c)oefficient (d)enominator (exp)onentiation function.\\n * Returns the result of: c * (1 - 1/d)^exp.\\n *\\n * @param _coefficient Coefficient of the function.\\n * @param _denominator Fractional denominator.\\n * @param _exponent Power function exponent.\\n *\\n * @return Result of c * (1 - 1/d)^exp.\\n */\\n function cdexp(\\n int256 _coefficient,\\n int256 _denominator,\\n int256 _exponent\\n ) internal pure returns (int256) {\\n return\\n (_coefficient *\\n (FixedPointMathLib.powWad(1e18 - (1e18 / _denominator), _exponent * 1e18))) / 1e18;\\n }\\n}\\n\"\r\n },\r\n \"contracts/libraries/Burn.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.15;\\n\\nimport { SafeCall } from \\\"./SafeCall.sol\\\";\\n\\n/**\\n * @title Burn\\n * @notice Utilities for burning stuff.\\n */\\nlibrary Burn {\\n /**\\n * Burns a given amount of ETH.\\n * Note that execution engine of Blast does not support SELFDESTRUCT opcode, so it sends ETH to zero address.\\n *\\n * @param _amount Amount of ETH to burn.\\n */\\n function eth(uint256 _amount) internal {\\n SafeCall.call(address(0), gasleft(), _amount, \\\"\\\");\\n }\\n\\n /**\\n * Burns a given amount of gas.\\n *\\n * @param _amount Amount of gas to burn.\\n */\\n function gas(uint256 _amount) internal view {\\n uint256 i = 0;\\n uint256 initialGas = gasleft();\\n while (initialGas - gasleft() < _amount) {\\n ++i;\\n }\\n }\\n}\\n\"\r\n },\r\n \"contracts/libraries/Constants.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity ^0.8.0;\\n\\nimport { ResourceMetering } from \\\"../L1/ResourceMetering.sol\\\";\\n\\n/**\\n * @title Constants\\n * @notice Constants is a library for storing constants. Simple! Don't put everything in here, just\\n * the stuff used in multiple contracts. Constants that only apply to a single contract\\n * should be defined in that contract instead.\\n */\\nlibrary Constants {\\n /**\\n * @notice Special address to be used as the tx origin for gas estimation calls in the\\n * KromaPortal and CrossDomainMessenger calls. You only need to use this address if\\n * the minimum gas limit specified by the user is not actually enough to execute the\\n * given message and you're attempting to estimate the actual necessary gas limit. We\\n * use address(1) because it's the ecrecover precompile and therefore guaranteed to\\n * never have any code on any EVM chain.\\n */\\n address internal constant ESTIMATION_ADDRESS = address(1);\\n\\n /**\\n * @notice Value used for the L2 sender storage slot in both the KromaPortal and the\\n * CrossDomainMessenger contracts before an actual sender is set. This value is\\n * non-zero to reduce the gas cost of message passing transactions.\\n */\\n address internal constant DEFAULT_L2_SENDER = 0x000000000000000000000000000000000000dEaD;\\n\\n /**\\n * @notice Returns the default values for the ResourceConfig. These are the recommended values\\n * for a production network.\\n */\\n function DEFAULT_RESOURCE_CONFIG()\\n internal\\n pure\\n returns (ResourceMetering.ResourceConfig memory)\\n {\\n ResourceMetering.ResourceConfig memory config = ResourceMetering.ResourceConfig({\\n maxResourceLimit: 20_000_000,\\n elasticityMultiplier: 10,\\n baseFeeMaxChangeDenominator: 8,\\n minimumBaseFee: 1 gwei,\\n systemTxMaxGas: 1_000_000,\\n maximumBaseFee: type(uint128).max\\n });\\n return config;\\n }\\n\\n /**\\n * @notice The denominator of the validator reward.\\n * DO NOT change this value if the L2 chain is already operational.\\n */\\n uint256 internal constant VALIDATOR_REWARD_DENOMINATOR = 10000;\\n\\n /**\\n * @notice An address that identifies that current submission round is a public round.\\n */\\n address internal constant VALIDATOR_PUBLIC_ROUND_ADDRESS = address(type(uint160).max);\\n}\\n\"\r\n },\r\n \"contracts/libraries/Encoding.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity ^0.8.0;\\n\\nimport { Hashing } from \\\"./Hashing.sol\\\";\\nimport { Types } from \\\"./Types.sol\\\";\\nimport { RLPWriter } from \\\"./rlp/RLPWriter.sol\\\";\\n\\n/**\\n * @title Encoding\\n * @notice Encoding handles Blast's various different encoding schemes.\\n */\\nlibrary Encoding {\\n /**\\n * @notice RLP encodes the L2 transaction that would be generated when a given deposit is sent\\n * to the L2 system. Useful for searching for a deposit in the L2 system. The\\n * transaction is prefixed with 0x7e to identify its EIP-2718 type.\\n *\\n * @param _tx User deposit transaction to encode.\\n *\\n * @return RLP encoded L2 deposit transaction.\\n */\\n function encodeDepositTransaction(Types.UserDepositTransaction memory _tx)\\n internal\\n pure\\n returns (bytes memory)\\n {\\n bytes32 source = Hashing.hashDepositSource(_tx.l1BlockHash, _tx.logIndex);\\n bytes[] memory raw = new bytes[](7);\\n raw[0] = RLPWriter.writeBytes(abi.encodePacked(source));\\n raw[1] = RLPWriter.writeAddress(_tx.from);\\n raw[2] = _tx.isCreation ? RLPWriter.writeBytes(\\\"\\\") : RLPWriter.writeAddress(_tx.to);\\n raw[3] = RLPWriter.writeUint(_tx.mint);\\n raw[4] = RLPWriter.writeUint(_tx.value);\\n raw[5] = RLPWriter.writeUint(uint256(_tx.gasLimit));\\n raw[6] = RLPWriter.writeBytes(_tx.data);\\n return abi.encodePacked(uint8(0x7e), RLPWriter.writeList(raw));\\n }\\n\\n /**\\n * @notice Encodes the cross domain message based on the version that is encoded into the\\n * message nonce.\\n *\\n * @param _nonce Message nonce with version encoded into the first two bytes.\\n * @param _sender Address of the sender of the message.\\n * @param _target Address of the target of the message.\\n * @param _value ETH value to send to the target.\\n * @param _gasLimit Gas limit to use for the message.\\n * @param _data Data to send with the message.\\n *\\n * @return Encoded cross domain message.\\n */\\n function encodeCrossDomainMessage(\\n uint256 _nonce,\\n address _sender,\\n address _target,\\n uint256 _value,\\n uint256 _gasLimit,\\n bytes memory _data\\n ) internal pure returns (bytes memory) {\\n (, uint16 version) = decodeVersionedNonce(_nonce);\\n if (version == 0) {\\n return encodeCrossDomainMessageV0(_nonce, _sender, _target, _value, _gasLimit, _data);\\n } else {\\n revert(\\\"Encoding: unknown cross domain message version\\\");\\n }\\n }\\n\\n /**\\n * @notice Encodes a cross domain message based on the V0 (current) encoding.\\n *\\n * @param _nonce Message nonce.\\n * @param _sender Address of the sender of the message.\\n * @param _target Address of the target of the message.\\n * @param _value ETH value to send to the target.\\n * @param _gasLimit Gas limit to use for the message.\\n * @param _data Data to send with the message.\\n *\\n * @return Encoded cross domain message.\\n */\\n function encodeCrossDomainMessageV0(\\n uint256 _nonce,\\n address _sender,\\n address _target,\\n uint256 _value,\\n uint256 _gasLimit,\\n bytes memory _data\\n ) internal pure returns (bytes memory) {\\n return\\n abi.encodeWithSignature(\\n \\\"relayMessage(uint256,address,address,uint256,uint256,bytes)\\\",\\n _nonce,\\n _sender,\\n _target,\\n _value,\\n _gasLimit,\\n _data\\n );\\n }\\n\\n /**\\n * @notice Adds a version number into the first two bytes of a message nonce.\\n *\\n * @param _nonce Message nonce to encode into.\\n * @param _version Version number to encode into the message nonce.\\n *\\n * @return Message nonce with version encoded into the first two bytes.\\n */\\n function encodeVersionedNonce(uint240 _nonce, uint16 _version) internal pure returns (uint256) {\\n uint256 nonce;\\n assembly {\\n nonce := or(shl(240, _version), _nonce)\\n }\\n return nonce;\\n }\\n\\n /**\\n * @notice Pulls the version out of a version-encoded nonce.\\n *\\n * @param _nonce Message nonce with version encoded into the first two bytes.\\n *\\n * @return Nonce without encoded version.\\n * @return Version of the message.\\n */\\n function decodeVersionedNonce(uint256 _nonce) internal pure returns (uint240, uint16) {\\n uint240 nonce;\\n uint16 version;\\n assembly {\\n nonce := and(_nonce, 0x0000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff)\\n version := shr(240, _nonce)\\n }\\n return (nonce, version);\\n }\\n}\\n\"\r\n },\r\n \"contracts/libraries/Hashing.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity ^0.8.0;\\n\\nimport { Encoding } from \\\"./Encoding.sol\\\";\\nimport { RLPWriter } from \\\"./rlp/RLPWriter.sol\\\";\\nimport { Types } from \\\"./Types.sol\\\";\\n\\n/**\\n * @title Hashing\\n * @notice Hashing handles Blast's various different hashing schemes.\\n */\\nlibrary Hashing {\\n /**\\n * @notice Computes the hash of the RLP encoded L2 transaction that would be generated when a\\n * given deposit is sent to the L2 system. Useful for searching for a deposit in the L2\\n * system.\\n *\\n * @param _tx User deposit transaction to hash.\\n *\\n * @return Hash of the RLP encoded L2 deposit transaction.\\n */\\n function hashDepositTransaction(Types.UserDepositTransaction memory _tx)\\n internal\\n pure\\n returns (bytes32)\\n {\\n return keccak256(Encoding.encodeDepositTransaction(_tx));\\n }\\n\\n /**\\n * @notice Computes the deposit transaction's \\\"source hash\\\", a value that guarantees the hash\\n * of the L2 transaction that corresponds to a deposit is unique and is\\n * deterministically generated from L1 transaction data.\\n *\\n * @param _l1BlockHash Hash of the L1 block where the deposit was included.\\n * @param _logIndex The index of the log that created the deposit transaction.\\n *\\n * @return Hash of the deposit transaction's \\\"source hash\\\".\\n */\\n function hashDepositSource(bytes32 _l1BlockHash, uint64 _logIndex)\\n internal\\n pure\\n returns (bytes32)\\n {\\n bytes32 depositId = keccak256(abi.encode(_l1BlockHash, _logIndex));\\n return keccak256(abi.encode(bytes32(0), depositId));\\n }\\n\\n /**\\n * @notice Hashes the cross domain message based on the version that is encoded into the\\n * message nonce.\\n *\\n * @param _nonce Message nonce with version encoded into the first two bytes.\\n * @param _sender Address of the sender of the message.\\n * @param _target Address of the target of the message.\\n * @param _value ETH value to send to the target.\\n * @param _gasLimit Gas limit to use for the message.\\n * @param _data Data to send with the message.\\n *\\n * @return Hashed cross domain message.\\n */\\n function hashCrossDomainMessage(\\n uint256 _nonce,\\n address _sender,\\n address _target,\\n uint256 _value,\\n uint256 _gasLimit,\\n bytes memory _data\\n ) internal pure returns (bytes32) {\\n (, uint16 version) = Encoding.decodeVersionedNonce(_nonce);\\n if (version == 0) {\\n return hashCrossDomainMessageV0(_nonce, _sender, _target, _value, _gasLimit, _data);\\n } else {\\n revert(\\\"Hashing: unknown cross domain message version\\\");\\n }\\n }\\n\\n /**\\n * @notice Hashes a cross domain message based on the V0 (current) encoding.\\n *\\n * @param _nonce Message nonce.\\n * @param _sender Address of the sender of the message.\\n * @param _target Address of the target of the message.\\n * @param _value ETH value to send to the target.\\n * @param _gasLimit Gas limit to use for the message.\\n * @param _data Data to send with the message.\\n *\\n * @return Hashed cross domain message.\\n */\\n function hashCrossDomainMessageV0(\\n uint256 _nonce,\\n address _sender,\\n address _target,\\n uint256 _value,\\n uint256 _gasLimit,\\n bytes memory _data\\n ) internal pure returns (bytes32) {\\n return\\n keccak256(\\n Encoding.encodeCrossDomainMessageV0(\\n _nonce,\\n _sender,\\n _target,\\n _value,\\n _gasLimit,\\n _data\\n )\\n );\\n }\\n\\n /**\\n * @notice Derives the withdrawal hash according to the encoding in the L2 Withdrawer contract\\n *\\n * @param _tx Withdrawal transaction to hash.\\n *\\n * @return Hashed withdrawal transaction.\\n */\\n function hashWithdrawal(Types.WithdrawalTransaction memory _tx)\\n internal\\n pure\\n returns (bytes32)\\n {\\n return\\n keccak256(\\n abi.encode(_tx.nonce, _tx.sender, _tx.target, _tx.value, _tx.gasLimit, _tx.data)\\n );\\n }\\n\\n /**\\n * @notice Hashes the various elements of an output root proof into an output root hash which\\n * can be used to check if the proof is valid.\\n *\\n * @param _outputRootProof Output root proof which should be hashed to an output root.\\n *\\n * @return Hashed output root proof.\\n */\\n function hashOutputRootProof(Types.OutputRootProof memory _outputRootProof)\\n internal\\n pure\\n returns (bytes32)\\n {\\n if (_outputRootProof.version == bytes32(uint256(0))) {\\n return hashOutputRootProofV0(_outputRootProof);\\n } else {\\n revert(\\\"Hashing: unknown output root proof version\\\");\\n }\\n }\\n\\n /**\\n * @notice Hashes the various elements of an output root proof into an output root hash which\\n * can be used to check if the proof is valid. (version 0)\\n *\\n * @param _outputRootProof Output root proof which should be hashed to an output root.\\n *\\n * @return Hashed output root proof.\\n */\\n function hashOutputRootProofV0(Types.OutputRootProof memory _outputRootProof)\\n internal\\n pure\\n returns (bytes32)\\n {\\n return\\n keccak256(\\n abi.encode(\\n _outputRootProof.version,\\n _outputRootProof.stateRoot,\\n _outputRootProof.messagePasserStorageRoot,\\n _outputRootProof.blockHash,\\n _outputRootProof.nextBlockHash\\n )\\n );\\n }\\n\\n /**\\n * @notice Fills the values of the block hash fields to a given bytes.\\n *\\n * @param _publicInput Public input which should be hashed to a block hash.\\n * @param _rlps Pre-RLP encoded data which should be hashed to a block hash.\\n * @param _raw An array of bytes to be populated.\\n */\\n function _fillBlockHashFieldsToBytes(\\n Types.PublicInput memory _publicInput,\\n Types.BlockHeaderRLP memory _rlps,\\n bytes[] memory _raw\\n ) private pure {\\n _raw[0] = RLPWriter.writeBytes(abi.encodePacked(_publicInput.parentHash));\\n _raw[1] = _rlps.uncleHash;\\n _raw[2] = _rlps.coinbase;\\n _raw[3] = RLPWriter.writeBytes(abi.encodePacked(_publicInput.stateRoot));\\n _raw[4] = RLPWriter.writeBytes(abi.encodePacked(_publicInput.transactionsRoot));\\n _raw[5] = _rlps.receiptsRoot;\\n _raw[6] = _rlps.logsBloom;\\n _raw[7] = _rlps.difficulty;\\n _raw[8] = RLPWriter.writeUint(_publicInput.number);\\n _raw[9] = RLPWriter.writeUint(_publicInput.gasLimit);\\n _raw[10] = _rlps.gasUsed;\\n _raw[11] = RLPWriter.writeUint(_publicInput.timestamp);\\n _raw[12] = _rlps.extraData;\\n _raw[13] = _rlps.mixHash;\\n _raw[14] = _rlps.nonce;\\n _raw[15] = RLPWriter.writeUint(_publicInput.baseFee);\\n }\\n\\n /**\\n * @notice Hashes the various elements of a block header into a block hash(before shanghai).\\n *\\n * @param _publicInput Public input which should be hashed to a block hash.\\n * @param _rlps Pre-RLP encoded data which should be hashed to a block hash.\\n *\\n * @return Hashed block header.\\n */\\n function hashBlockHeader(\\n Types.PublicInput memory _publicInput,\\n Types.BlockHeaderRLP memory _rlps\\n ) internal pure returns (bytes32) {\\n bytes[] memory raw = new bytes[](16);\\n _fillBlockHashFieldsToBytes(_publicInput, _rlps, raw);\\n return keccak256(RLPWriter.writeList(raw));\\n }\\n\\n /**\\n * @notice Hashes the various elements of a block header into a block hash(after shanghai).\\n *\\n * @param _publicInput Public input which should be hashed to a block hash.\\n * @param _rlps Pre-RLP encoded data which should be hashed to a block hash.\\n *\\n * @return Hashed block header.\\n */\\n function hashBlockHeaderShanghai(\\n Types.PublicInput memory _publicInput,\\n Types.BlockHeaderRLP memory _rlps\\n ) internal pure returns (bytes32) {\\n bytes[] memory raw = new bytes[](17);\\n _fillBlockHashFieldsToBytes(_publicInput, _rlps, raw);\\n raw[16] = RLPWriter.writeBytes(abi.encodePacked(_publicInput.withdrawalsRoot));\\n return keccak256(RLPWriter.writeList(raw));\\n }\\n\\n /**\\n * @notice Hashes the various elements of a public input into a public input hash.\\n *\\n * @param _prevStateRoot Previous state root.\\n * @param _publicInput Public input which should be hashed to a public input hash.\\n * @param _dummyHashes Dummy hashes returned from generateDummyHashes().\\n *\\n * @return Hashed block header.\\n */\\n function hashPublicInput(\\n bytes32 _prevStateRoot,\\n Types.PublicInput memory _publicInput,\\n bytes32[] memory _dummyHashes\\n ) internal pure returns (bytes32) {\\n return\\n keccak256(\\n abi.encodePacked(\\n _prevStateRoot,\\n _publicInput.stateRoot,\\n _publicInput.withdrawalsRoot,\\n _publicInput.blockHash,\\n _publicInput.parentHash,\\n _publicInput.number,\\n _publicInput.timestamp,\\n _publicInput.baseFee,\\n _publicInput.gasLimit,\\n uint16(_publicInput.txHashes.length),\\n _publicInput.txHashes,\\n _dummyHashes\\n )\\n );\\n }\\n\\n /**\\n * @notice Generates a bytes32 array filled with a dummy hash for the given length.\\n *\\n * @param _dummyHashes Dummy hash.\\n * @param _length A length of the array.\\n *\\n * @return Bytes32 array filled with dummy hash.\\n */\\n function generateDummyHashes(bytes32 _dummyHashes, uint256 _length)\\n internal\\n pure\\n returns (bytes32[] memory)\\n {\\n bytes32[] memory hashes = new bytes32[](_length);\\n for (uint256 i = 0; i < _length; i++) {\\n hashes[i] = _dummyHashes;\\n }\\n return hashes;\\n }\\n}\\n\"\r\n },\r\n \"contracts/libraries/Predeploys.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity ^0.8.0;\\n\\n/**\\n * @title Predeploys\\n * @notice Contains constant addresses for contracts that are pre-deployed to the L2 system.\\n */\\nlibrary Predeploys {\\n /**\\n * @notice Address of the ProxyAdmin predeploy.\\n */\\n address internal constant PROXY_ADMIN = 0x4200000000000000000000000000000000000000;\\n\\n /**\\n * @notice Address of the L1Block predeploy.\\n */\\n address internal constant L1_BLOCK_ATTRIBUTES = 0x4200000000000000000000000000000000000002;\\n\\n /**\\n * @notice Address of the L2ToL1MessagePasser predeploy.\\n */\\n address internal constant L2_TO_L1_MESSAGE_PASSER = 0x4200000000000000000000000000000000000003;\\n\\n /**\\n * @notice Address of the L2CrossDomainMessenger predeploy.\\n */\\n address internal constant L2_CROSS_DOMAIN_MESSENGER =\\n 0x4200000000000000000000000000000000000004;\\n\\n /**\\n * @notice Address of the GasPriceOracle predeploy. Includes fee information\\n * and helpers for computing the L1 portion of the transaction fee.\\n */\\n address internal constant GAS_PRICE_ORACLE = 0x4200000000000000000000000000000000000005;\\n\\n /**\\n * @notice Address of the ProtocolVault predeploy.\\n */\\n address internal constant PROTOCOL_VAULT = 0x4200000000000000000000000000000000000006;\\n\\n /**\\n * @notice Address of the ProposerRewardVault predeploy.\\n */\\n address internal constant PROPOSER_REWARD_VAULT = 0x4200000000000000000000000000000000000007;\\n\\n /**\\n * @notice Address of the ValidatorRewardVault predeploy.\\n */\\n address internal constant VALIDATOR_REWARD_VAULT = 0x4200000000000000000000000000000000000008;\\n\\n /**\\n * @notice Address of the L2StandardBridge predeploy.\\n */\\n address internal constant L2_STANDARD_BRIDGE = 0x4200000000000000000000000000000000000009;\\n\\n /**\\n * @notice Address of the L2ERC721Bridge predeploy.\\n */\\n address internal constant L2_ERC721_BRIDGE = 0x420000000000000000000000000000000000000A;\\n\\n /**\\n * @notice Address of the KromaMintableERC20Factory predeploy.\\n */\\n address internal constant KROMA_MINTABLE_ERC20_FACTORY =\\n 0x420000000000000000000000000000000000000B;\\n\\n /**\\n * @notice Address of the KromaMintableERC721Factory predeploy.\\n */\\n address internal constant KROMA_MINTABLE_ERC721_FACTORY =\\n 0x420000000000000000000000000000000000000c;\\n}\\n\"\r\n },\r\n \"contracts/libraries/SafeCall.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.15;\\n\\n/**\\n * @title SafeCall\\n * @notice Perform low level safe calls\\n */\\nlibrary SafeCall {\\n /**\\n * @notice Perform a low level call without copying any returndata\\n *\\n * @param _target Address to call\\n * @param _gas Amount of gas to pass to the call\\n * @param _value Amount of value to pass to the call\\n * @param _calldata Calldata to pass to the call\\n */\\n function call(\\n address _target,\\n uint256 _gas,\\n uint256 _value,\\n bytes memory _calldata\\n ) internal returns (bool) {\\n bool _success;\\n assembly {\\n _success := call(\\n _gas, // gas\\n _target, // recipient\\n _value, // ether value\\n add(_calldata, 32), // inloc\\n mload(_calldata), // inlen\\n 0, // outloc\\n 0 // outlen\\n )\\n }\\n return _success;\\n }\\n\\n /**\\n * @notice Helper function to determine if there is sufficient gas remaining within the context\\n * to guarantee that the minimum gas requirement for a call will be met as well as\\n * optionally reserving a specified amount of gas for after the call has concluded.\\n *\\n * @param _minGas The minimum amount of gas that may be passed to the target context.\\n * @param _reservedGas Optional amount of gas to reserve for the caller after the execution\\n * of the target context.\\n *\\n * @return `true` if there is enough gas remaining to safely supply `_minGas` to the target\\n * context as well as reserve `_reservedGas` for the caller after the execution of\\n * the target context.\\n *\\n * @dev !!!!! FOOTGUN ALERT !!!!!\\n * 1.) The 40_000 base buffer is to account for the worst case of the dynamic cost of the\\n * `CALL` opcode's `address_access_cost`, `positive_value_cost`, and\\n * `value_to_empty_account_cost` factors with an added buffer of 5,700 gas. It is\\n * still possible to self-rekt by initiating a withdrawal with a minimum gas limit\\n * that does not account for the `memory_expansion_cost` & `code_execution_cost`\\n * factors of the dynamic cost of the `CALL` opcode.\\n * 2.) This function should *directly* precede the external call if possible. There is an\\n * added buffer to account for gas consumed between this check and the call, but it\\n * is only 5,700 gas.\\n * 3.) Because EIP-150 ensures that a maximum of 63/64ths of the remaining gas in the call\\n * frame may be passed to a subcontext, we need to ensure that the gas will not be\\n * truncated.\\n * 4.) Use wisely. This function is not a silver bullet.\\n */\\n function hasMinGas(uint256 _minGas, uint256 _reservedGas) internal view returns (bool) {\\n bool _hasMinGas;\\n assembly {\\n // Equation: gas × 63 ≥ minGas × 64 + 63(40_000 + reservedGas)\\n _hasMinGas := iszero(\\n lt(mul(gas(), 63), add(mul(_minGas, 64), mul(add(40000, _reservedGas), 63)))\\n )\\n }\\n return _hasMinGas;\\n }\\n\\n /**\\n * @notice Perform a low level call without copying any returndata. This function\\n * will revert if the call cannot be performed with the specified minimum\\n * gas.\\n *\\n * @param _target Address to call\\n * @param _minGas The minimum amount of gas that may be passed to the call\\n * @param _value Amount of value to pass to the call\\n * @param _calldata Calldata to pass to the call\\n */\\n function callWithMinGas(\\n address _target,\\n uint256 _minGas,\\n uint256 _value,\\n bytes memory _calldata\\n ) internal returns (bool) {\\n bool _success;\\n bool _hasMinGas = hasMinGas(_minGas, 0);\\n assembly {\\n // Assertion: gasleft() >= (_minGas * 64) / 63 + 40_000\\n if iszero(_hasMinGas) {\\n // Store the \\\"Error(string)\\\" selector in scratch space.\\n mstore(0, 0x08c379a0)\\n // Store the pointer to the string length in scratch space.\\n mstore(32, 32)\\n // Store the string.\\n //\\n // SAFETY:\\n // - We pad the beginning of the string with two zero bytes as well as the\\n // length (24) to ensure that we override the free memory pointer at offset\\n // 0x40. This is necessary because the free memory pointer is likely to\\n // be greater than 1 byte when this function is called, but it is incredibly\\n // unlikely that it will be greater than 3 bytes. As for the data within\\n // 0x60, it is ensured that it is 0 due to 0x60 being the zero offset.\\n // - It's fine to clobber the free memory pointer, we're reverting.\\n mstore(88, 0x0000185361666543616c6c3a204e6f7420656e6f75676820676173)\\n\\n // Revert with 'Error(\\\"SafeCall: Not enough gas\\\")'\\n revert(28, 100)\\n }\\n\\n // The call will be supplied at least ((_minGas * 64) / 63 + 40_000 - 49) gas due to the\\n // above assertion. This ensures that, in all circumstances (except for when the\\n // `_minGas` does not account for the `memory_expansion_cost` and `code_execution_cost`\\n // factors of the dynamic cost of the `CALL` opcode), the call will receive at least\\n // the minimum amount of gas specified.\\n _success := call(\\n gas(), // gas\\n _target, // recipient\\n _value, // ether value\\n add(_calldata, 32), // inloc\\n mload(_calldata), // inlen\\n 0x00, // outloc\\n 0x00 // outlen\\n )\\n }\\n return _success;\\n }\\n}\\n\"\r\n },\r\n \"contracts/libraries/Types.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity ^0.8.9;\\n\\n/**\\n * @title Types\\n * @notice Contains various types used throughout the Blast contract system.\\n */\\nlibrary Types {\\n /**\\n * @notice CheckpointOutput represents a commitment to the state of L2 checkpoint. The timestamp\\n * is the L1 timestamp that the output root is posted. This timestamp is used to verify\\n * that the finalization period has passed since the output root was submitted.\\n *\\n * @custom:field submitter Address of the output submitter.\\n * @custom:field outputRoot Hash of the L2 output.\\n * @custom:field timestamp Timestamp of the L1 block that the output root was submitted in.\\n * @custom:field l2BlockNumber L2 block number that the output corresponds to.\\n */\\n struct CheckpointOutput {\\n address submitter;\\n bytes32 outputRoot;\\n uint128 timestamp;\\n uint128 l2BlockNumber;\\n }\\n\\n /**\\n * @notice Struct representing the elements that are hashed together to generate an output root\\n * which itself represents a snapshot of the L2 state.\\n *\\n * @custom:field version Version of the output root.\\n * @custom:field stateRoot Root of the state trie at the block of this output.\\n * @custom:field messagePasserStorageRoot Root of the message passer storage trie.\\n * @custom:field blockHash Hash of the block this output was generated from.\\n * @custom:field nextBlockHash Hash of the next block.\\n */\\n struct OutputRootProof {\\n bytes32 version;\\n bytes32 stateRoot;\\n bytes32 messagePasserStorageRoot;\\n bytes32 blockHash;\\n bytes32 nextBlockHash;\\n }\\n\\n /**\\n * @notice Struct representing the elements that are hashed together to generate a public input.\\n *\\n * @custom:field blockHash The hash of the block.\\n * @custom:field parentHash The hash of the previous block.\\n * @custom:field timestamp The block time.\\n * @custom:field number The block number.\\n * @custom:field gasLimit Maximum gas allowed.\\n * @custom:field baseFee The base fee per gas.\\n * @custom:field transactionsRoot Root hash of the transactions.\\n * @custom:field stateRoot Root hash of the state trie.\\n * @custom:field withdrawalsRoot Root hash of the withdrawals.\\n * @custom:field txHashes Array of hash of the transaction.\\n */\\n struct PublicInput {\\n bytes32 blockHash;\\n bytes32 parentHash;\\n uint64 timestamp;\\n uint64 number;\\n uint64 gasLimit;\\n uint256 baseFee;\\n bytes32 transactionsRoot;\\n bytes32 stateRoot;\\n bytes32 withdrawalsRoot;\\n bytes32[] txHashes;\\n }\\n\\n /**\\n * @notice Struct representing the elements that are hashed together to generate a block hash.\\n * Some of fields that are contained in PublicInput are omitted.\\n *\\n * @custom:field uncleHash RLP encoded uncle hash.\\n * @custom:field coinbase RLP encoded coinbase.\\n * @custom:field receiptsRoot RLP encoded receipts root.\\n * @custom:field logsBloom RLP encoded logs bloom.\\n * @custom:field difficulty RLP encoded difficulty.\\n * @custom:field gasUsed RLP encoded gas used.\\n * @custom:field extraData RLP encoded extra data.\\n * @custom:field mixHash RLP encoded mix hash.\\n * @custom:field nonce RLP encoded nonce.\\n */\\n struct BlockHeaderRLP {\\n bytes uncleHash;\\n bytes coinbase;\\n bytes receiptsRoot;\\n bytes logsBloom;\\n bytes difficulty;\\n bytes gasUsed;\\n bytes extraData;\\n bytes mixHash;\\n bytes nonce;\\n }\\n\\n /**\\n * @notice Struct representing a deposit transaction (L1 => L2 transaction) created by an end\\n * user (as opposed to a system deposit transaction generated by the system).\\n *\\n * @custom:field from Address of the sender of the transaction.\\n * @custom:field to Address of the recipient of the transaction.\\n * @custom:field isCreation True if the transaction is a contract creation.\\n * @custom:field value Value to send to the recipient.\\n * @custom:field mint Amount of ETH to mint.\\n * @custom:field gasLimit Gas limit of the transaction.\\n * @custom:field data Data of the transaction.\\n * @custom:field l1BlockHash Hash of the block the transaction was submitted in.\\n * @custom:field logIndex Index of the log in the block the transaction was submitted in.\\n */\\n struct UserDepositTransaction {\\n address from;\\n address to;\\n bool isCreation;\\n uint256 value;\\n uint256 mint;\\n uint64 gasLimit;\\n bytes data;\\n bytes32 l1BlockHash;\\n uint64 logIndex;\\n }\\n\\n /**\\n * @notice Struct representing a withdrawal transaction.\\n *\\n * @custom:field nonce Nonce of the withdrawal transaction\\n * @custom:field sender Address of the sender of the transaction.\\n * @custom:field target Address of the recipient of the transaction.\\n * @custom:field value Value to send to the recipient.\\n * @custom:field gasLimit Gas limit of the transaction.\\n * @custom:field data Data of the transaction.\\n */\\n struct WithdrawalTransaction {\\n uint256 nonce;\\n address sender;\\n address target;\\n uint256 value;\\n uint256 gasLimit;\\n bytes data;\\n }\\n\\n /**\\n * @notice Struct representing a challenge.\\n *\\n * @custom:field turn The current turn.\\n * @custom:field timeoutAt Timeout timestamp of the next turn.\\n * @custom:field asserter Address of the asserter.\\n * @custom:field challenger Address of the challenger.\\n * @custom:field segments Array of the segment.\\n * @custom:field segStart The L2 block number of the first segment.\\n * @custom:field segSize The number of L2 blocks.\\n */\\n struct Challenge {\\n uint8 turn;\\n uint64 timeoutAt;\\n address asserter;\\n address challenger;\\n bytes32[] segments;\\n uint256 segSize;\\n uint256 segStart;\\n }\\n\\n /**\\n * @notice Struct representing a validator's bond.\\n *\\n * @custom:field amount Amount of the lock.\\n * @custom:field expiresAt The expiration timestamp of bond.\\n */\\n struct Bond {\\n uint128 amount;\\n uint128 expiresAt;\\n }\\n\\n /**\\n * @notice Struct representing multisig transaction data.\\n *\\n * @custom:field target The destination address to run the transaction.\\n * @custom:field executed Record whether a transaction was executed or not.\\n * @custom:field value The value passed in while executing the transaction.\\n * @custom:field data Calldata for transaction.\\n */\\n struct MultiSigTransaction {\\n address target;\\n bool executed;\\n uint256 value;\\n bytes data;\\n }\\n\\n /**\\n * @notice Struct representing multisig confirmation data.\\n *\\n * @custom:field confirmationCount The sum of confirmations.\\n * @custom:field confirmedBy Map data that stores whether confirmation is performed by account.\\n */\\n struct MultiSigConfirmation {\\n uint256 confirmationCount;\\n mapping(address => bool) confirmedBy;\\n }\\n\\n /**\\n * @notice Struct representing the data for verifying the public input.\\n *\\n * @custom:field srcOutputRootProof Proof of the source output root.\\n * @custom:field dstOutputRootProof Proof of the destination output root.\\n * @custom:field publicInput Ingredients to compute the public input used by ZK proof verification.\\n * @custom:field rlps Pre-encoded RLPs to compute the next block hash\\n * of the source output root proof.\\n * @custom:field l2ToL1MessagePasserBalance Balance of the L2ToL1MessagePasser account.\\n * @custom:field l2ToL1MessagePasserCodeHash Codehash of the L2ToL1MessagePasser account.\\n * @custom:field merkleProof Merkle proof of L2ToL1MessagePasser account against the state root.\\n */\\n struct PublicInputProof {\\n OutputRootProof srcOutputRootProof;\\n OutputRootProof dstOutputRootProof;\\n PublicInput publicInput;\\n BlockHeaderRLP rlps;\\n bytes32 l2ToL1MessagePasserBalance;\\n bytes32 l2ToL1MessagePasserCodeHash;\\n bytes[] merkleProof;\\n }\\n}\\n\"\r\n },\r\n \"contracts/libraries/rlp/RLPWriter.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity ^0.8.0;\\n\\n/**\\n * @custom:attribution https://github.com/bakaoh/solidity-rlp-encode\\n * @title RLPWriter\\n * @author RLPWriter is a library for encoding Solidity types to RLP bytes. Adapted from Bakaoh's\\n * RLPEncode library (https://github.com/bakaoh/solidity-rlp-encode) with minor\\n * modifications to improve legibility.\\n */\\nlibrary RLPWriter {\\n /**\\n * @notice RLP encodes a byte string.\\n *\\n * @param _in The byte string to encode.\\n *\\n * @return The RLP encoded string in bytes.\\n */\\n function writeBytes(bytes memory _in) internal pure returns (bytes memory) {\\n bytes memory encoded;\\n\\n if (_in.length == 1 && uint8(_in[0]) < 128) {\\n encoded = _in;\\n } else {\\n encoded = abi.encodePacked(_writeLength(_in.length, 128), _in);\\n }\\n\\n return encoded;\\n }\\n\\n /**\\n * @notice RLP encodes a list of RLP encoded byte byte strings.\\n *\\n * @param _in The list of RLP encoded byte strings.\\n *\\n * @return The RLP encoded list of items in bytes.\\n */\\n function writeList(bytes[] memory _in) internal pure returns (bytes memory) {\\n bytes memory list = _flatten(_in);\\n return abi.encodePacked(_writeLength(list.length, 192), list);\\n }\\n\\n /**\\n * @notice RLP encodes a string.\\n *\\n * @param _in The string to encode.\\n *\\n * @return The RLP encoded string in bytes.\\n */\\n function writeString(string memory _in) internal pure returns (bytes memory) {\\n return writeBytes(bytes(_in));\\n }\\n\\n /**\\n * @notice RLP encodes an address.\\n *\\n * @param _in The address to encode.\\n *\\n * @return The RLP encoded address in bytes.\\n */\\n function writeAddress(address _in) internal pure returns (bytes memory) {\\n return writeBytes(abi.encodePacked(_in));\\n }\\n\\n /**\\n * @notice RLP encodes a uint.\\n *\\n * @param _in The uint256 to encode.\\n *\\n * @return The RLP encoded uint256 in bytes.\\n */\\n function writeUint(uint256 _in) internal pure returns (bytes memory) {\\n return writeBytes(_toBinary(_in));\\n }\\n\\n /**\\n * @notice RLP encodes a bool.\\n *\\n * @param _in The bool to encode.\\n *\\n * @return The RLP encoded bool in bytes.\\n */\\n function writeBool(bool _in) internal pure returns (bytes memory) {\\n bytes memory encoded = new bytes(1);\\n encoded[0] = (_in ? bytes1(0x01) : bytes1(0x80));\\n return encoded;\\n }\\n\\n /**\\n * @notice Encode the first byte and then the `len` in binary form if `length` is more than 55.\\n *\\n * @param _len The length of the string or the payload.\\n * @param _offset 128 if item is string, 192 if item is list.\\n *\\n * @return RLP encoded bytes.\\n */\\n function _writeLength(uint256 _len, uint256 _offset) private pure returns (bytes memory) {\\n bytes memory encoded;\\n\\n if (_len < 56) {\\n encoded = new bytes(1);\\n encoded[0] = bytes1(uint8(_len) + uint8(_offset));\\n } else {\\n uint256 lenLen;\\n uint256 i = 1;\\n while (_len / i != 0) {\\n lenLen++;\\n i *= 256;\\n }\\n\\n encoded = new bytes(lenLen + 1);\\n encoded[0] = bytes1(uint8(lenLen) + uint8(_offset) + 55);\\n for (i = 1; i <= lenLen; i++) {\\n encoded[i] = bytes1(uint8((_len / (256**(lenLen - i))) % 256));\\n }\\n }\\n\\n return encoded;\\n }\\n\\n /**\\n * @notice Encode integer in big endian binary form with no leading zeroes.\\n *\\n * @param _x The integer to encode.\\n *\\n * @return RLP encoded bytes.\\n */\\n function _toBinary(uint256 _x) private pure returns (bytes memory) {\\n bytes memory b = abi.encodePacked(_x);\\n\\n uint256 i = 0;\\n for (; i < 32; i++) {\\n if (b[i] != 0) {\\n break;\\n }\\n }\\n\\n bytes memory res = new bytes(32 - i);\\n for (uint256 j = 0; j < res.length; j++) {\\n res[j] = b[i++];\\n }\\n\\n return res;\\n }\\n\\n /**\\n * @custom:attribution https://github.com/Arachnid/solidity-stringutils\\n * @notice Copies a piece of memory to another location.\\n *\\n * @param _dest Destination location.\\n * @param _src Source location.\\n * @param _len Length of memory to copy.\\n */\\n function _memcpy(\\n uint256 _dest,\\n uint256 _src,\\n uint256 _len\\n ) private pure {\\n uint256 dest = _dest;\\n uint256 src = _src;\\n uint256 len = _len;\\n\\n for (; len >= 32; len -= 32) {\\n assembly {\\n mstore(dest, mload(src))\\n }\\n dest += 32;\\n src += 32;\\n }\\n\\n uint256 mask;\\n unchecked {\\n mask = 256**(32 - len) - 1;\\n }\\n assembly {\\n let srcpart := and(mload(src), not(mask))\\n let destpart := and(mload(dest), mask)\\n mstore(dest, or(destpart, srcpart))\\n }\\n }\\n\\n /**\\n * @custom:attribution https://github.com/sammayo/solidity-rlp-encoder\\n * @notice Flattens a list of byte strings into one byte string.\\n *\\n * @param _list List of byte strings to flatten.\\n *\\n * @return The flattened byte string.\\n */\\n function _flatten(bytes[] memory _list) private pure returns (bytes memory) {\\n if (_list.length == 0) {\\n return new bytes(0);\\n }\\n\\n uint256 len;\\n uint256 i = 0;\\n for (; i < _list.length; i++) {\\n len += _list[i].length;\\n }\\n\\n bytes memory flattened = new bytes(len);\\n uint256 flattenedPtr;\\n assembly {\\n flattenedPtr := add(flattened, 0x20)\\n }\\n\\n for (i = 0; i < _list.length; i++) {\\n bytes memory item = _list[i];\\n\\n uint256 listPtr;\\n assembly {\\n listPtr := add(item, 0x20)\\n }\\n\\n _memcpy(flattenedPtr, listPtr, item.length);\\n flattenedPtr += _list[i].length;\\n }\\n\\n return flattened;\\n }\\n}\\n\"\r\n },\r\n \"contracts/universal/CrossDomainMessenger.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.15;\\n\\nimport {\\n PausableUpgradeable\\n} from \\\"@openzeppelin/contracts-upgradeable/security/PausableUpgradeable.sol\\\";\\n\\nimport { Constants } from \\\"../libraries/Constants.sol\\\";\\nimport { Encoding } from \\\"../libraries/Encoding.sol\\\";\\nimport { Hashing } from \\\"../libraries/Hashing.sol\\\";\\nimport { SafeCall } from \\\"../libraries/SafeCall.sol\\\";\\n\\n/**\\n * @custom:upgradeable\\n * @title CrossDomainMessenger\\n * @notice CrossDomainMessenger is a base contract that provides the core logic for the L1 and L2\\n * cross-chain messenger contracts. It's designed to be a universal interface that only\\n * needs to be extended slightly to provide low-level message passing functionality on each\\n * chain it's deployed on. Currently only designed for message passing between two paired\\n * chains and does not support one-to-many interactions.\\n *\\n * Any changes to this contract MUST result in a semver bump for contracts that inherit it.\\n */\\nabstract contract CrossDomainMessenger is PausableUpgradeable {\\n /**\\n * @notice Current message version identifier.\\n */\\n uint16 public constant MESSAGE_VERSION = 0;\\n\\n /**\\n * @notice Constant overhead added to the base gas for a message.\\n */\\n uint64 public constant RELAY_CONSTANT_OVERHEAD = 200_000;\\n\\n /**\\n * @notice Numerator for dynamic overhead added to the base gas for a message.\\n */\\n uint64 public constant MIN_GAS_DYNAMIC_OVERHEAD_NUMERATOR = 64;\\n\\n /**\\n * @notice Denominator for dynamic overhead added to the base gas for a message.\\n */\\n uint64 public constant MIN_GAS_DYNAMIC_OVERHEAD_DENOMINATOR = 63;\\n\\n /**\\n * @notice Extra gas added to base gas for each byte of calldata in a message.\\n */\\n uint64 public constant MIN_GAS_CALLDATA_OVERHEAD = 16;\\n\\n /**\\n * @notice Gas reserved for performing the external call in `relayMessage`.\\n */\\n uint64 public constant RELAY_CALL_OVERHEAD = 40_000;\\n\\n /**\\n * @notice Gas reserved for finalizing the execution of `relayMessage` after the safe call.\\n */\\n uint64 public constant RELAY_RESERVED_GAS = 40_000;\\n\\n /**\\n * @notice Gas reserved for the execution between the `hasMinGas` check and the external\\n * call in `relayMessage`.\\n */\\n uint64 public constant RELAY_GAS_CHECK_BUFFER = 5_000;\\n\\n /**\\n * @notice Address of the paired CrossDomainMessenger contract on the other chain.\\n */\\n address public immutable OTHER_MESSENGER;\\n\\n /**\\n * @notice Mapping of message hashes to boolean receipt values. Note that a message will only\\n * be present in this mapping if it has successfully been relayed on this chain, and\\n * can therefore not be relayed again.\\n */\\n mapping(bytes32 => bool) public successfulMessages;\\n\\n /**\\n * @notice Address of the sender of the currently executing message on the other chain. If the\\n * value of this variable is the default value (0x00000000...dead) then no message is\\n * currently being executed. Use the xDomainMessageSender getter which will throw an\\n * error if this is the case.\\n */\\n address internal xDomainMsgSender;\\n\\n /**\\n * @notice Nonce for the next message to be sent, without the message version applied. Use the\\n * messageNonce getter which will insert the message version into the nonce to give you\\n * the actual nonce to be used for the message.\\n */\\n uint240 internal msgNonce;\\n\\n /**\\n * @notice Mapping of message hashes to a boolean if and only if the message has failed to be\\n * executed at least once. A message will not be present in this mapping if it\\n * successfully executed on the first attempt.\\n */\\n mapping(bytes32 => bool) public failedMessages;\\n\\n /**\\n * @notice Reserve extra slots in the storage layout for future upgrades.\\n * A gap size of 45 was chosen here, so that the first slot used in a child contract\\n * would be a multiple of 50.\\n */\\n uint256[45] private __gap;\\n\\n /**\\n * @notice Emitted whenever a message is sent to the other chain.\\n *\\n * @param target Address of the recipient of the message.\\n * @param sender Address of the sender of the message.\\n * @param value ETH value sent along with the message to the recipient.\\n * @param message Message to trigger the recipient address with.\\n * @param messageNonce Unique nonce attached to the message.\\n * @param gasLimit Minimum gas limit that the message can be executed with.\\n */\\n event SentMessage(\\n address indexed target,\\n address indexed sender,\\n uint256 value,\\n bytes message,\\n uint256 messageNonce,\\n uint256 gasLimit\\n );\\n\\n /**\\n * @notice Emitted whenever a message is successfully relayed on this chain.\\n *\\n * @param msgHash Hash of the message that was relayed.\\n */\\n event RelayedMessage(bytes32 indexed msgHash);\\n\\n /**\\n * @notice Emitted whenever a message fails to be relayed on this chain.\\n *\\n * @param msgHash Hash of the message that failed to be relayed.\\n */\\n event FailedRelayedMessage(bytes32 indexed msgHash);\\n\\n /**\\n * @param _otherMessenger Address of the messenger on the paired chain.\\n */\\n constructor(address _otherMessenger) {\\n OTHER_MESSENGER = _otherMessenger;\\n }\\n\\n /**\\n * @notice Sends a message to some target address on the other chain. Note that if the call\\n * always reverts, then the message will be unrelayable, and any ETH sent will be\\n * permanently locked. The same will occur if the target on the other chain is\\n * considered unsafe (see the _isUnsafeTarget() function).\\n *\\n * @param _target Target contract or wallet address.\\n * @param _message Message to trigger the target address with.\\n * @param _minGasLimit Minimum gas limit that the message can be executed with.\\n */\\n function sendMessage(\\n address _target,\\n bytes calldata _message,\\n uint32 _minGasLimit\\n ) external payable {\\n // Triggers a message to the other messenger. Note that the amount of gas provided to the\\n // message is the amount of gas requested by the user PLUS the base gas value. We want to\\n // guarantee the property that the call to the target contract will always have at least\\n // the minimum gas limit specified by the user.\\n _sendMessage(\\n OTHER_MESSENGER,\\n baseGas(_message, _minGasLimit),\\n msg.value,\\n abi.encodeWithSelector(\\n this.relayMessage.selector,\\n messageNonce(),\\n msg.sender,\\n _target,\\n msg.value,\\n _minGasLimit,\\n _message\\n )\\n );\\n\\n emit SentMessage(_target, msg.sender, msg.value, _message, messageNonce(), _minGasLimit);\\n\\n unchecked {\\n ++msgNonce;\\n }\\n }\\n\\n /**\\n * @notice Relays a message that was sent by the other CrossDomainMessenger contract. Can only\\n * be executed via cross-chain call from the other messenger OR if the message was\\n * already received once and is currently being replayed.\\n *\\n * @param _nonce Nonce of the message being relayed.\\n * @param _sender Address of the user who sent the message.\\n * @param _target Address that the message is targeted at.\\n * @param _value ETH value to send with the message.\\n * @param _minGasLimit Minimum amount of gas that the message can be executed with.\\n * @param _message Message to send to the target.\\n */\\n function relayMessage(\\n uint256 _nonce,\\n address _sender,\\n address _target,\\n uint256 _value,\\n uint256 _minGasLimit,\\n bytes calldata _message\\n ) external payable {\\n (, uint16 version) = Encoding.decodeVersionedNonce(_nonce);\\n require(\\n version < 1,\\n \\\"CrossDomainMessenger: only version 0 messages is supported at this time\\\"\\n );\\n\\n // We use the v0 message hash as the unique identifier for the message because it commits\\n // to the value and minimum gas limit of the message.\\n bytes32 versionedHash = Hashing.hashCrossDomainMessageV0(\\n _nonce,\\n _sender,\\n _target,\\n _value,\\n _minGasLimit,\\n _message\\n );\\n\\n if (_isOtherMessenger()) {\\n // These properties should always hold when the message is first submitted (as\\n // opposed to being replayed).\\n assert(msg.value == _value);\\n assert(!failedMessages[versionedHash]);\\n } else {\\n require(\\n msg.value == 0,\\n \\\"CrossDomainMessenger: value must be zero unless message is from a system address\\\"\\n );\\n\\n require(\\n failedMessages[versionedHash],\\n \\\"CrossDomainMessenger: message cannot be replayed\\\"\\n );\\n }\\n\\n require(\\n _isUnsafeTarget(_target) == false,\\n \\\"CrossDomainMessenger: cannot send message to blocked system address\\\"\\n );\\n\\n require(\\n successfulMessages[versionedHash] == false,\\n \\\"CrossDomainMessenger: message has already been relayed\\\"\\n );\\n\\n // If there is not enough gas left to perform the external call and finish the execution,\\n // return early and assign the message to the failedMessages mapping.\\n // We are asserting that we have enough gas to:\\n // 1. Call the target contract (_minGasLimit + RELAY_CALL_OVERHEAD + RELAY_GAS_CHECK_BUFFER)\\n // 1.a. The RELAY_CALL_OVERHEAD is included in `hasMinGas`.\\n // 2. Finish the execution after the external call (RELAY_RESERVED_GAS).\\n //\\n // If `xDomainMsgSender` is not the default L2 sender, this function\\n // is being re-entered. This marks the message as failed to allow it to be replayed.\\n if (\\n !SafeCall.hasMinGas(_minGasLimit, RELAY_RESERVED_GAS + RELAY_GAS_CHECK_BUFFER) ||\\n xDomainMsgSender != Constants.DEFAULT_L2_SENDER\\n ) {\\n failedMessages[versionedHash] = true;\\n emit FailedRelayedMessage(versionedHash);\\n\\n // Revert in this case if the transaction was triggered by the estimation address. This\\n // should only be possible during gas estimation or we have bigger problems. Reverting\\n // here will make the behavior of gas estimation change such that the gas limit\\n // computed will be the amount required to relay the message, even if that amount is\\n // greater than the minimum gas limit specified by the user.\\n if (tx.origin == Constants.ESTIMATION_ADDRESS) {\\n revert(\\\"CrossDomainMessenger: failed to relay message\\\");\\n }\\n\\n return;\\n }\\n\\n xDomainMsgSender = _sender;\\n bool success = SafeCall.call(_target, gasleft() - RELAY_RESERVED_GAS, _value, _message);\\n xDomainMsgSender = Constants.DEFAULT_L2_SENDER;\\n\\n if (success) {\\n successfulMessages[versionedHash] = true;\\n emit RelayedMessage(versionedHash);\\n } else {\\n failedMessages[versionedHash] = true;\\n emit FailedRelayedMessage(versionedHash);\\n\\n // Revert in this case if the transaction was triggered by the estimation address. This\\n // should only be possible during gas estimation or we have bigger problems. Reverting\\n // here will make the behavior of gas estimation change such that the gas limit\\n // computed will be the amount required to relay the message, even if that amount is\\n // greater than the minimum gas limit specified by the user.\\n if (tx.origin == Constants.ESTIMATION_ADDRESS) {\\n revert(\\\"CrossDomainMessenger: failed to relay message\\\");\\n }\\n }\\n }\\n\\n /**\\n * @notice Retrieves the address of the contract or wallet that initiated the currently\\n * executing message on the other chain. Will throw an error if there is no message\\n * currently being executed. Allows the recipient of a call to see who triggered it.\\n *\\n * @return Address of the sender of the currently executing message on the other chain.\\n */\\n function xDomainMessageSender() external view returns (address) {\\n require(\\n xDomainMsgSender != Constants.DEFAULT_L2_SENDER,\\n \\\"CrossDomainMessenger: xDomainMessageSender is not set\\\"\\n );\\n\\n return xDomainMsgSender;\\n }\\n\\n /**\\n * @notice Retrieves the next message nonce. Message version will be added to the upper two\\n * bytes of the message nonce. Message version allows us to treat messages as having\\n * different structures.\\n *\\n * @return Nonce of the next message to be sent, with added message version.\\n */\\n function messageNonce() public view returns (uint256) {\\n return Encoding.encodeVersionedNonce(msgNonce, MESSAGE_VERSION);\\n }\\n\\n /**\\n * @notice Computes the amount of gas required to guarantee that a given message will be\\n * received on the other chain without running out of gas. Guaranteeing that a message\\n * will not run out of gas is important because this ensures that a message can always\\n * be replayed on the other chain if it fails to execute completely.\\n *\\n * @param _message Message to compute the amount of required gas for.\\n * @param _minGasLimit Minimum desired gas limit when message goes to target.\\n *\\n * @return Amount of gas required to guarantee message receipt.\\n */\\n function baseGas(bytes calldata _message, uint32 _minGasLimit) public pure returns (uint64) {\\n return\\n // Constant overhead\\n RELAY_CONSTANT_OVERHEAD +\\n // Calldata overhead\\n (uint64(_message.length) * MIN_GAS_CALLDATA_OVERHEAD) +\\n // Dynamic overhead (EIP-150)\\n ((_minGasLimit * MIN_GAS_DYNAMIC_OVERHEAD_NUMERATOR) /\\n MIN_GAS_DYNAMIC_OVERHEAD_DENOMINATOR) +\\n // Gas reserved for the worst-case cost of 3/5 of the `CALL` opcode's dynamic gas\\n // factors. (Conservative)\\n RELAY_CALL_OVERHEAD +\\n // Relay reserved gas (to ensure execution of `relayMessage` completes after the\\n // subcontext finishes executing) (Conservative)\\n RELAY_RESERVED_GAS +\\n // Gas reserved for the execution between the `hasMinGas` check and the `CALL`\\n // opcode. (Conservative)\\n RELAY_GAS_CHECK_BUFFER;\\n }\\n\\n /**\\n * @notice Intializer.\\n */\\n // solhint-disable-next-line func-name-mixedcase\\n function __CrossDomainMessenger_init() internal onlyInitializing {\\n xDomainMsgSender = Constants.DEFAULT_L2_SENDER;\\n }\\n\\n /**\\n * @notice Sends a low-level message to the other messenger. Needs to be implemented by child\\n * contracts because the logic for this depends on the network where the messenger is\\n * being deployed.\\n *\\n * @param _to Recipient of the message on the other chain.\\n * @param _gasLimit Minimum gas limit the message can be executed with.\\n * @param _value Amount of ETH to send with the message.\\n * @param _data Message data.\\n */\\n function _sendMessage(\\n address _to,\\n uint64 _gasLimit,\\n uint256 _value,\\n bytes memory _data\\n ) internal virtual;\\n\\n /**\\n * @notice Checks whether the message is coming from the other messenger. Implemented by child\\n * contracts because the logic for this depends on the network where the messenger is\\n * being deployed.\\n *\\n * @return Whether the message is coming from the other messenger.\\n */\\n function _isOtherMessenger() internal view virtual returns (bool);\\n\\n /**\\n * @notice Checks whether a given call target is a system address that could cause the\\n * messenger to peform an unsafe action. This is NOT a mechanism for blocking user\\n * addresses. This is ONLY used to prevent the execution of messages to specific\\n * system addresses that could cause security issues, e.g., having the\\n * CrossDomainMessenger send messages to itself.\\n *\\n * @param _target Address of the contract to check.\\n *\\n * @return Whether or not the address is an unsafe system address.\\n */\\n function _isUnsafeTarget(address _target) internal view virtual returns (bool);\\n}\\n\"\r\n },\r\n \"contracts/universal/FeeVault.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.15;\\n\\nimport { Predeploys } from \\\"../libraries/Predeploys.sol\\\";\\nimport { L2StandardBridge } from \\\"../L2/L2StandardBridge.sol\\\";\\n\\n/**\\n * @title FeeVault\\n * @notice The FeeVault contract contains the basic logic for the various different vault contracts\\n * used to hold fee revenue generated by the L2 system.\\n */\\nabstract contract FeeVault {\\n /**\\n * @notice Emits each time that a withdrawal occurs.\\n *\\n * @param value Amount that was withdrawn (in wei).\\n * @param to Address that the funds were sent to.\\n * @param from Address that triggered the withdrawal.\\n */\\n event Withdrawal(uint256 value, address to, address from);\\n\\n /**\\n * @notice Minimum balance before a withdrawal can be triggered.\\n */\\n uint256 public immutable MIN_WITHDRAWAL_AMOUNT;\\n\\n /**\\n * @notice Wallet that will receive the fees on L1.\\n */\\n address public immutable RECIPIENT;\\n\\n /**\\n * @notice The minimum gas limit for the FeeVault withdrawal transaction.\\n */\\n uint32 internal constant WITHDRAWAL_MIN_GAS = 35_000;\\n\\n /**\\n * @notice Total amount of wei processed by the contract.\\n */\\n uint256 public totalProcessed;\\n\\n /**\\n * @param _recipient Wallet that will receive the fees on L1.\\n * @param _minWithdrawalAmount Minimum balance before a withdrawal can be triggered.\\n */\\n constructor(address _recipient, uint256 _minWithdrawalAmount) {\\n MIN_WITHDRAWAL_AMOUNT = _minWithdrawalAmount;\\n RECIPIENT = _recipient;\\n }\\n\\n /**\\n * @notice Allow the contract to receive ETH.\\n */\\n receive() external payable {}\\n\\n /**\\n * @notice Triggers a withdrawal of funds to the L1 fee wallet.\\n */\\n function withdraw() external virtual {\\n require(\\n address(this).balance >= MIN_WITHDRAWAL_AMOUNT,\\n \\\"FeeVault: withdrawal amount must be greater than minimum withdrawal amount\\\"\\n );\\n\\n uint256 value = address(this).balance;\\n totalProcessed += value;\\n\\n emit Withdrawal(value, RECIPIENT, msg.sender);\\n\\n L2StandardBridge(payable(Predeploys.L2_STANDARD_BRIDGE)).bridgeETHTo{ value: value }(\\n RECIPIENT,\\n WITHDRAWAL_MIN_GAS,\\n bytes(\\\"\\\")\\n );\\n }\\n}\\n\"\r\n },\r\n \"contracts/universal/IKromaMintableERC20.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity ^0.8.0;\\n\\nimport { IERC165 } from \\\"@openzeppelin/contracts/utils/introspection/IERC165.sol\\\";\\n\\n/**\\n * @title IKromaMintableERC20\\n * @notice This interface is available on the KromaMintableERC20 contract. We declare it as a\\n * separate interface so that it can be used in custom implementations of\\n * KromaMintableERC20.\\n */\\ninterface IKromaMintableERC20 {\\n function REMOTE_TOKEN() external view returns (address);\\n\\n function BRIDGE() external view returns (address);\\n\\n function mint(address _to, uint256 _amount) external;\\n\\n function burn(address _from, uint256 _amount) external;\\n}\\n\"\r\n },\r\n \"contracts/universal/KromaMintableERC20.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.15;\\n\\nimport { ERC20 } from \\\"@openzeppelin/contracts/token/ERC20/ERC20.sol\\\";\\nimport { IERC165 } from \\\"@openzeppelin/contracts/utils/introspection/IERC165.sol\\\";\\n\\nimport { Semver } from \\\"../universal/Semver.sol\\\";\\nimport { IKromaMintableERC20 } from \\\"./IKromaMintableERC20.sol\\\";\\n\\n/**\\n * @title KromaMintableERC20\\n * @notice KromaMintableERC20 is a standard extension of the base ERC20 token contract designed\\n * to allow the StandardBridge contracts to mint and burn tokens. This makes it possible to\\n * use a KromaMintableRC20 as the L2 representation of an L1 token, or vice-versa.\\n * Designed to be backwards compatible with the older StandardL2ERC20 token which was only\\n * meant for use on L2.\\n */\\ncontract KromaMintableERC20 is IKromaMintableERC20, ERC20, Semver {\\n /**\\n * @notice Address of the corresponding version of this token on the remote chain.\\n */\\n address public immutable REMOTE_TOKEN;\\n\\n /**\\n * @notice Address of the StandardBridge on this network.\\n */\\n address public immutable BRIDGE;\\n\\n /**\\n * @notice Emitted whenever tokens are minted for an account.\\n *\\n * @param account Address of the account tokens are being minted for.\\n * @param amount Amount of tokens minted.\\n */\\n event Mint(address indexed account, uint256 amount);\\n\\n /**\\n * @notice Emitted whenever tokens are burned from an account.\\n *\\n * @param account Address of the account tokens are being burned from.\\n * @param amount Amount of tokens burned.\\n */\\n event Burn(address indexed account, uint256 amount);\\n\\n /**\\n * @notice A modifier that only allows the bridge to call\\n */\\n modifier onlyBridge() {\\n require(msg.sender == BRIDGE, \\\"KromaMintableERC20: only bridge can mint and burn\\\");\\n _;\\n }\\n\\n /**\\n * @custom:semver 1.0.0\\n *\\n * @param _bridge Address of the L2 standard bridge.\\n * @param _remoteToken Address of the corresponding L1 token.\\n * @param _name ERC20 name.\\n * @param _symbol ERC20 symbol.\\n */\\n constructor(\\n address _bridge,\\n address _remoteToken,\\n string memory _name,\\n string memory _symbol\\n ) ERC20(_name, _symbol) Semver(1, 0, 0) {\\n REMOTE_TOKEN = _remoteToken;\\n BRIDGE = _bridge;\\n }\\n\\n /**\\n * @notice Allows the StandardBridge on this network to mint tokens.\\n *\\n * @param _to Address to mint tokens to.\\n * @param _amount Amount of tokens to mint.\\n */\\n function mint(address _to, uint256 _amount)\\n external\\n virtual\\n override(IKromaMintableERC20)\\n onlyBridge\\n {\\n _mint(_to, _amount);\\n emit Mint(_to, _amount);\\n }\\n\\n /**\\n * @notice Allows the StandardBridge on this network to burn tokens.\\n *\\n * @param _from Address to burn tokens from.\\n * @param _amount Amount of tokens to burn.\\n */\\n function burn(address _from, uint256 _amount)\\n external\\n virtual\\n override(IKromaMintableERC20)\\n onlyBridge\\n {\\n _burn(_from, _amount);\\n emit Burn(_from, _amount);\\n }\\n\\n /**\\n * @notice ERC165 interface check function.\\n *\\n * @param _interfaceId Interface ID to check.\\n *\\n * @return Whether or not the interface is supported by this contract.\\n */\\n function supportsInterface(bytes4 _interfaceId) external pure returns (bool) {\\n bytes4 iface1 = type(IERC165).interfaceId;\\n // Interface corresponding to the updated KromaMintableERC20 (this contract).\\n bytes4 iface2 = type(IKromaMintableERC20).interfaceId;\\n return _interfaceId == iface1 || _interfaceId == iface2;\\n }\\n}\\n\"\r\n },\r\n \"contracts/universal/Semver.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity ^0.8.15;\\n\\nimport { Strings } from \\\"@openzeppelin/contracts/utils/Strings.sol\\\";\\n\\n/**\\n * @title Semver\\n * @notice Semver is a simple contract for managing contract versions.\\n */\\ncontract Semver {\\n /**\\n * @notice Contract version number (major).\\n */\\n uint256 private immutable MAJOR_VERSION;\\n\\n /**\\n * @notice Contract version number (minor).\\n */\\n uint256 private immutable MINOR_VERSION;\\n\\n /**\\n * @notice Contract version number (patch).\\n */\\n uint256 private immutable PATCH_VERSION;\\n\\n /**\\n * @param _major Version number (major).\\n * @param _minor Version number (minor).\\n * @param _patch Version number (patch).\\n */\\n constructor(\\n uint256 _major,\\n uint256 _minor,\\n uint256 _patch\\n ) {\\n MAJOR_VERSION = _major;\\n MINOR_VERSION = _minor;\\n PATCH_VERSION = _patch;\\n }\\n\\n /**\\n * @notice Returns the full semver contract version.\\n *\\n * @return Semver contract version as a string.\\n */\\n function version() public view virtual returns (string memory) {\\n return\\n string(\\n abi.encodePacked(\\n Strings.toString(MAJOR_VERSION),\\n \\\".\\\",\\n Strings.toString(MINOR_VERSION),\\n \\\".\\\",\\n Strings.toString(PATCH_VERSION)\\n )\\n );\\n }\\n}\\n\"\r\n },\r\n \"contracts/universal/StandardBridge.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.15;\\n\\nimport { Address } from \\\"@openzeppelin/contracts/utils/Address.sol\\\";\\nimport { ERC165Checker } from \\\"@openzeppelin/contracts/utils/introspection/ERC165Checker.sol\\\";\\nimport { IERC20 } from \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\nimport { SafeERC20 } from \\\"@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol\\\";\\n\\nimport { SafeCall } from \\\"../libraries/SafeCall.sol\\\";\\nimport { CrossDomainMessenger } from \\\"./CrossDomainMessenger.sol\\\";\\nimport { IKromaMintableERC20 } from \\\"./IKromaMintableERC20.sol\\\";\\nimport { KromaMintableERC20 } from \\\"./KromaMintableERC20.sol\\\";\\n\\n/**\\n * @custom:upgradeable\\n * @title StandardBridge\\n * @notice StandardBridge is a base contract for the L1 and L2 standard ERC20 bridges. It handles\\n * the core bridging logic, including escrowing tokens that are native to the local chain\\n * and minting/burning tokens that are native to the remote chain.\\n */\\nabstract contract StandardBridge {\\n using SafeERC20 for IERC20;\\n\\n /**\\n * @notice The L2 gas limit set when eth is depoisited using the receive() function.\\n */\\n uint32 internal constant RECEIVE_DEFAULT_GAS_LIMIT = 200_000;\\n\\n /**\\n * @notice Messenger contract on this domain.\\n */\\n CrossDomainMessenger public immutable MESSENGER;\\n\\n /**\\n * @notice Corresponding bridge on the other domain.\\n */\\n StandardBridge public immutable OTHER_BRIDGE;\\n\\n /**\\n * @notice Mapping that stores deposits for a given pair of local and remote tokens.\\n */\\n mapping(address => mapping(address => uint256)) public deposits;\\n\\n /**\\n * @notice Reserve extra slots (to a total of 50) in the storage layout for future upgrades.\\n * A gap size of 49 was chosen here, so that the first slot used in a child contract\\n * would be a multiple of 50.\\n */\\n uint256[49] private __gap;\\n\\n /**\\n * @notice Emitted when an ETH bridge is initiated to the other chain.\\n *\\n * @param from Address of the sender.\\n * @param to Address of the receiver.\\n * @param amount Amount of ETH sent.\\n * @param extraData Extra data sent with the transaction.\\n */\\n event ETHBridgeInitiated(\\n address indexed from,\\n address indexed to,\\n uint256 amount,\\n bytes extraData\\n );\\n\\n /**\\n * @notice Emitted when an ETH bridge is finalized on this chain.\\n *\\n * @param from Address of the sender.\\n * @param to Address of the receiver.\\n * @param amount Amount of ETH sent.\\n * @param extraData Extra data sent with the transaction.\\n */\\n event ETHBridgeFinalized(\\n address indexed from,\\n address indexed to,\\n uint256 amount,\\n bytes extraData\\n );\\n\\n /**\\n * @notice Emitted when an ERC20 bridge is initiated to the other chain.\\n *\\n * @param localToken Address of the ERC20 on this chain.\\n * @param remoteToken Address of the ERC20 on the remote chain.\\n * @param from Address of the sender.\\n * @param to Address of the receiver.\\n * @param amount Amount of the ERC20 sent.\\n * @param extraData Extra data sent with the transaction.\\n */\\n event ERC20BridgeInitiated(\\n address indexed localToken,\\n address indexed remoteToken,\\n address indexed from,\\n address to,\\n uint256 amount,\\n bytes extraData\\n );\\n\\n /**\\n * @notice Emitted when an ERC20 bridge is finalized on this chain.\\n *\\n * @param localToken Address of the ERC20 on this chain.\\n * @param remoteToken Address of the ERC20 on the remote chain.\\n * @param from Address of the sender.\\n * @param to Address of the receiver.\\n * @param amount Amount of the ERC20 sent.\\n * @param extraData Extra data sent with the transaction.\\n */\\n event ERC20BridgeFinalized(\\n address indexed localToken,\\n address indexed remoteToken,\\n address indexed from,\\n address to,\\n uint256 amount,\\n bytes extraData\\n );\\n\\n /**\\n * @notice Only allow EOAs to call the functions. Note that this is not safe against contracts\\n * calling code within their constructors, but also doesn't really matter since we're\\n * just trying to prevent users accidentally depositing with smart contract wallets.\\n */\\n modifier onlyEOA() {\\n require(\\n !Address.isContract(msg.sender),\\n \\\"StandardBridge: function can only be called from an EOA\\\"\\n );\\n _;\\n }\\n\\n /**\\n * @notice Ensures that the caller is a cross-chain message from the other bridge.\\n */\\n modifier onlyOtherBridge() {\\n require(\\n msg.sender == address(MESSENGER) &&\\n MESSENGER.xDomainMessageSender() == address(OTHER_BRIDGE),\\n \\\"StandardBridge: function can only be called from the other bridge\\\"\\n );\\n _;\\n }\\n\\n /**\\n * @param _messenger Address of CrossDomainMessenger on this network.\\n * @param _otherBridge Address of the other StandardBridge contract.\\n */\\n constructor(address payable _messenger, address payable _otherBridge) {\\n MESSENGER = CrossDomainMessenger(_messenger);\\n OTHER_BRIDGE = StandardBridge(_otherBridge);\\n }\\n\\n /**\\n * @notice Allows EOAs to bridge ETH by sending directly to the bridge.\\n * Must be implemented by contracts that inherit.\\n */\\n receive() external payable virtual;\\n\\n /**\\n * @notice Sends ETH to the sender's address on the other chain.\\n *\\n * @param _minGasLimit Minimum amount of gas that the bridge can be relayed with.\\n * @param _extraData Extra data to be sent with the transaction. Note that the recipient will\\n * not be triggered with this data, but it will be emitted and can be used\\n * to identify the transaction.\\n */\\n function bridgeETH(uint32 _minGasLimit, bytes calldata _extraData) public payable onlyEOA {\\n _initiateBridgeETH(msg.sender, msg.sender, msg.value, _minGasLimit, _extraData);\\n }\\n\\n /**\\n * @notice Sends ETH to a receiver's address on the other chain. Note that if ETH is sent to a\\n * smart contract and the call fails, the ETH will be temporarily locked in the\\n * StandardBridge on the other chain until the call is replayed. If the call cannot be\\n * replayed with any amount of gas (call always reverts), then the ETH will be\\n * permanently locked in the StandardBridge on the other chain. ETH will also\\n * be locked if the receiver is the other bridge, because finalizeBridgeETH will revert\\n * in that case.\\n *\\n * @param _to Address of the receiver.\\n * @param _minGasLimit Minimum amount of gas that the bridge can be relayed with.\\n * @param _extraData Extra data to be sent with the transaction. Note that the recipient will\\n * not be triggered with this data, but it will be emitted and can be used\\n * to identify the transaction.\\n */\\n function bridgeETHTo(\\n address _to,\\n uint32 _minGasLimit,\\n bytes calldata _extraData\\n ) public payable {\\n _initiateBridgeETH(msg.sender, _to, msg.value, _minGasLimit, _extraData);\\n }\\n\\n /**\\n * @notice Sends ERC20 tokens to the sender's address on the other chain. Note that if the\\n * ERC20 token on the other chain does not recognize the local token as the correct\\n * pair token, the ERC20 bridge will fail and the tokens will be returned to sender on\\n * this chain.\\n *\\n * @param _localToken Address of the ERC20 on this chain.\\n * @param _remoteToken Address of the corresponding token on the remote chain.\\n * @param _amount Amount of local tokens to deposit.\\n * @param _minGasLimit Minimum amount of gas that the bridge can be relayed with.\\n * @param _extraData Extra data to be sent with the transaction. Note that the recipient will\\n * not be triggered with this data, but it will be emitted and can be used\\n * to identify the transaction.\\n */\\n function bridgeERC20(\\n address _localToken,\\n address _remoteToken,\\n uint256 _amount,\\n uint32 _minGasLimit,\\n bytes calldata _extraData\\n ) public onlyEOA {\\n _initiateBridgeERC20(\\n _localToken,\\n _remoteToken,\\n msg.sender,\\n msg.sender,\\n _amount,\\n _minGasLimit,\\n _extraData\\n );\\n }\\n\\n /**\\n * @notice Sends ERC20 tokens to a receiver's address on the other chain. Note that if the\\n * ERC20 token on the other chain does not recognize the local token as the correct\\n * pair token, the ERC20 bridge will fail and the tokens will be returned to sender on\\n * this chain.\\n *\\n * @param _localToken Address of the ERC20 on this chain.\\n * @param _remoteToken Address of the corresponding token on the remote chain.\\n * @param _to Address of the receiver.\\n * @param _amount Amount of local tokens to deposit.\\n * @param _minGasLimit Minimum amount of gas that the bridge can be relayed with.\\n * @param _extraData Extra data to be sent with the transaction. Note that the recipient will\\n * not be triggered with this data, but it will be emitted and can be used\\n * to identify the transaction.\\n */\\n function bridgeERC20To(\\n address _localToken,\\n address _remoteToken,\\n address _to,\\n uint256 _amount,\\n uint32 _minGasLimit,\\n bytes calldata _extraData\\n ) public {\\n _initiateBridgeERC20(\\n _localToken,\\n _remoteToken,\\n msg.sender,\\n _to,\\n _amount,\\n _minGasLimit,\\n _extraData\\n );\\n }\\n\\n /**\\n * @notice Finalizes an ETH bridge on this chain. Can only be triggered by the other\\n * StandardBridge contract on the remote chain.\\n *\\n * @param _from Address of the sender.\\n * @param _to Address of the receiver.\\n * @param _amount Amount of ETH being bridged.\\n * @param _extraData Extra data to be sent with the transaction. Note that the recipient will\\n * not be triggered with this data, but it will be emitted and can be used\\n * to identify the transaction.\\n */\\n function finalizeBridgeETH(\\n address _from,\\n address _to,\\n uint256 _amount,\\n bytes calldata _extraData\\n ) public payable onlyOtherBridge {\\n require(msg.value == _amount, \\\"StandardBridge: amount sent does not match amount required\\\");\\n require(_to != address(this), \\\"StandardBridge: cannot send to self\\\");\\n require(_to != address(MESSENGER), \\\"StandardBridge: cannot send to messenger\\\");\\n\\n emit ETHBridgeFinalized(_from, _to, _amount, _extraData);\\n\\n bool success = SafeCall.call(_to, gasleft(), _amount, hex\\\"\\\");\\n require(success, \\\"StandardBridge: ETH transfer failed\\\");\\n }\\n\\n /**\\n * @notice Finalizes an ERC20 bridge on this chain. Can only be triggered by the other\\n * StandardBridge contract on the remote chain.\\n *\\n * @param _localToken Address of the ERC20 on this chain.\\n * @param _remoteToken Address of the corresponding token on the remote chain.\\n * @param _from Address of the sender.\\n * @param _to Address of the receiver.\\n * @param _amount Amount of the ERC20 being bridged.\\n * @param _extraData Extra data to be sent with the transaction. Note that the recipient will\\n * not be triggered with this data, but it will be emitted and can be used\\n * to identify the transaction.\\n */\\n function finalizeBridgeERC20(\\n address _localToken,\\n address _remoteToken,\\n address _from,\\n address _to,\\n uint256 _amount,\\n bytes calldata _extraData\\n ) public onlyOtherBridge {\\n if (_isKromaMintableERC20(_localToken)) {\\n require(\\n _isCorrectTokenPair(_localToken, _remoteToken),\\n \\\"StandardBridge: wrong remote token for Blast Mintable ERC20 local token\\\"\\n );\\n\\n KromaMintableERC20(_localToken).mint(_to, _amount);\\n } else {\\n deposits[_localToken][_remoteToken] = deposits[_localToken][_remoteToken] - _amount;\\n IERC20(_localToken).safeTransfer(_to, _amount);\\n }\\n\\n emit ERC20BridgeFinalized(_localToken, _remoteToken, _from, _to, _amount, _extraData);\\n }\\n\\n /**\\n * @notice Initiates a bridge of ETH through the CrossDomainMessenger.\\n *\\n * @param _from Address of the sender.\\n * @param _to Address of the receiver.\\n * @param _amount Amount of ETH being bridged.\\n * @param _minGasLimit Minimum amount of gas that the bridge can be relayed with.\\n * @param _extraData Extra data to be sent with the transaction. Note that the recipient will\\n * not be triggered with this data, but it will be emitted and can be used\\n * to identify the transaction.\\n */\\n function _initiateBridgeETH(\\n address _from,\\n address _to,\\n uint256 _amount,\\n uint32 _minGasLimit,\\n bytes memory _extraData\\n ) internal {\\n require(\\n msg.value == _amount,\\n \\\"StandardBridge: bridging ETH must include sufficient ETH value\\\"\\n );\\n\\n emit ETHBridgeInitiated(_from, _to, _amount, _extraData);\\n\\n MESSENGER.sendMessage{ value: _amount }(\\n address(OTHER_BRIDGE),\\n abi.encodeWithSelector(\\n this.finalizeBridgeETH.selector,\\n _from,\\n _to,\\n _amount,\\n _extraData\\n ),\\n _minGasLimit\\n );\\n }\\n\\n /**\\n * @notice Sends ERC20 tokens to a receiver's address on the other chain.\\n *\\n * @param _localToken Address of the ERC20 on this chain.\\n * @param _remoteToken Address of the corresponding token on the remote chain.\\n * @param _to Address of the receiver.\\n * @param _amount Amount of local tokens to deposit.\\n * @param _minGasLimit Minimum amount of gas that the bridge can be relayed with.\\n * @param _extraData Extra data to be sent with the transaction. Note that the recipient will\\n * not be triggered with this data, but it will be emitted and can be used\\n * to identify the transaction.\\n */\\n function _initiateBridgeERC20(\\n address _localToken,\\n address _remoteToken,\\n address _from,\\n address _to,\\n uint256 _amount,\\n uint32 _minGasLimit,\\n bytes memory _extraData\\n ) internal {\\n if (_isKromaMintableERC20(_localToken)) {\\n require(\\n _isCorrectTokenPair(_localToken, _remoteToken),\\n \\\"StandardBridge: wrong remote token for Blast Mintable ERC20 local token\\\"\\n );\\n\\n KromaMintableERC20(_localToken).burn(_from, _amount);\\n } else {\\n IERC20(_localToken).safeTransferFrom(_from, address(this), _amount);\\n deposits[_localToken][_remoteToken] = deposits[_localToken][_remoteToken] + _amount;\\n }\\n\\n emit ERC20BridgeInitiated(_localToken, _remoteToken, _from, _to, _amount, _extraData);\\n\\n MESSENGER.sendMessage(\\n address(OTHER_BRIDGE),\\n abi.encodeWithSelector(\\n this.finalizeBridgeERC20.selector,\\n // Because this call will be executed on the remote chain, we reverse the order of\\n // the remote and local token addresses relative to their order in the\\n // finalizeBridgeERC20 function.\\n _remoteToken,\\n _localToken,\\n _from,\\n _to,\\n _amount,\\n _extraData\\n ),\\n _minGasLimit\\n );\\n }\\n\\n /**\\n * @notice Checks if a given address is a KromaMintableERC20. Not perfect, but good enough.\\n * Just the way we like it.\\n *\\n * @param _token Address of the token to check.\\n *\\n * @return True if the token is a KromaMintableERC20.\\n */\\n function _isKromaMintableERC20(address _token) internal view returns (bool) {\\n return ERC165Checker.supportsInterface(_token, type(IKromaMintableERC20).interfaceId);\\n }\\n\\n /**\\n * @notice Checks if the \\\"other token\\\" is the correct pair token for the KromaMintableERC20.\\n *\\n * @param _mintableToken KromaMintableERC20 to check against.\\n * @param _otherToken Pair token to check.\\n *\\n * @return True if the other token is the correct pair token for the KromaMintableERC20.\\n */\\n function _isCorrectTokenPair(address _mintableToken, address _otherToken)\\n internal\\n view\\n returns (bool)\\n {\\n return _otherToken == KromaMintableERC20(_mintableToken).REMOTE_TOKEN();\\n }\\n}\\n\"\r\n },\r\n \"contracts/vendor/AddressAliasHelper.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: Apache-2.0\\n\\n/*\\n * Copyright 2019-2021, Offchain Labs, Inc.\\n *\\n * Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n * you may not use this file except in compliance with the License.\\n * You may obtain a copy of the License at\\n *\\n * http://www.apache.org/licenses/LICENSE-2.0\\n *\\n * Unless required by applicable law or agreed to in writing, software\\n * distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n * See the License for the specific language governing permissions and\\n * limitations under the License.\\n */\\n\\npragma solidity ^0.8.0;\\n\\nlibrary AddressAliasHelper {\\n uint160 constant offset = uint160(0x1111000000000000000000000000000000001111);\\n\\n /// @notice Utility function that converts the address in the L1 that submitted a tx to\\n /// the inbox to the msg.sender viewed in the L2\\n /// @param l1Address the address in the L1 that triggered the tx to L2\\n /// @return l2Address L2 address as viewed in msg.sender\\n function applyL1ToL2Alias(address l1Address) internal pure returns (address l2Address) {\\n unchecked {\\n l2Address = address(uint160(l1Address) + offset);\\n }\\n }\\n\\n /// @notice Utility function that converts the msg.sender viewed in the L2 to the\\n /// address in the L1 that submitted a tx to the inbox\\n /// @param l2Address L2 address as viewed in msg.sender\\n /// @return l1Address the address in the L1 that triggered the tx to L2\\n function undoL1ToL2Alias(address l2Address) internal pure returns (address l1Address) {\\n unchecked {\\n l1Address = address(uint160(l2Address) - offset);\\n }\\n }\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/proxy/utils/Initializable.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/Initializable.sol)\\n\\npragma solidity ^0.8.2;\\n\\nimport \\\"../../utils/Address.sol\\\";\\n\\n/**\\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\\n *\\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\\n * reused. This mechanism prevents re-execution of each \\\"step\\\" but allows the creation of new initialization steps in\\n * case an upgrade adds a module that needs to be initialized.\\n *\\n * For example:\\n *\\n * [.hljs-theme-light.nopadding]\\n * ```solidity\\n * contract MyToken is ERC20Upgradeable {\\n * function initialize() initializer public {\\n * __ERC20_init(\\\"MyToken\\\", \\\"MTK\\\");\\n * }\\n * }\\n *\\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\\n * function initializeV2() reinitializer(2) public {\\n * __ERC20Permit_init(\\\"MyToken\\\");\\n * }\\n * }\\n * ```\\n *\\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\\n * possible by providing the encoded function call as the `_data` argument to {ERC1967Proxy-constructor}.\\n *\\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\\n *\\n * [CAUTION]\\n * ====\\n * Avoid leaving a contract uninitialized.\\n *\\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\\n *\\n * [.hljs-theme-light.nopadding]\\n * ```\\n * /// @custom:oz-upgrades-unsafe-allow constructor\\n * constructor() {\\n * _disableInitializers();\\n * }\\n * ```\\n * ====\\n */\\nabstract contract Initializable {\\n /**\\n * @dev Indicates that the contract has been initialized.\\n * @custom:oz-retyped-from bool\\n */\\n uint8 private _initialized;\\n\\n /**\\n * @dev Indicates that the contract is in the process of being initialized.\\n */\\n bool private _initializing;\\n\\n /**\\n * @dev Triggered when the contract has been initialized or reinitialized.\\n */\\n event Initialized(uint8 version);\\n\\n /**\\n * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\\n * `onlyInitializing` functions can be used to initialize parent contracts.\\n *\\n * Similar to `reinitializer(1)`, except that functions marked with `initializer` can be nested in the context of a\\n * constructor.\\n *\\n * Emits an {Initialized} event.\\n */\\n modifier initializer() {\\n bool isTopLevelCall = !_initializing;\\n require(\\n (isTopLevelCall && _initialized < 1) || (!Address.isContract(address(this)) && _initialized == 1),\\n \\\"Initializable: contract is already initialized\\\"\\n );\\n _initialized = 1;\\n if (isTopLevelCall) {\\n _initializing = true;\\n }\\n _;\\n if (isTopLevelCall) {\\n _initializing = false;\\n emit Initialized(1);\\n }\\n }\\n\\n /**\\n * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\\n * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\\n * used to initialize parent contracts.\\n *\\n * A reinitializer may be used after the original initialization step. This is essential to configure modules that\\n * are added through upgrades and that require initialization.\\n *\\n * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\\n * cannot be nested. If one is invoked in the context of another, execution will revert.\\n *\\n * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\\n * a contract, executing them in the right order is up to the developer or operator.\\n *\\n * WARNING: setting the version to 255 will prevent any future reinitialization.\\n *\\n * Emits an {Initialized} event.\\n */\\n modifier reinitializer(uint8 version) {\\n require(!_initializing && _initialized < version, \\\"Initializable: contract is already initialized\\\");\\n _initialized = version;\\n _initializing = true;\\n _;\\n _initializing = false;\\n emit Initialized(version);\\n }\\n\\n /**\\n * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\\n * {initializer} and {reinitializer} modifiers, directly or indirectly.\\n */\\n modifier onlyInitializing() {\\n require(_initializing, \\\"Initializable: contract is not initializing\\\");\\n _;\\n }\\n\\n /**\\n * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\\n * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\\n * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\\n * through proxies.\\n *\\n * Emits an {Initialized} event the first time it is successfully executed.\\n */\\n function _disableInitializers() internal virtual {\\n require(!_initializing, \\\"Initializable: contract is initializing\\\");\\n if (_initialized != type(uint8).max) {\\n _initialized = type(uint8).max;\\n emit Initialized(type(uint8).max);\\n }\\n }\\n\\n /**\\n * @dev Returns the highest version that has been initialized. See {reinitializer}.\\n */\\n function _getInitializedVersion() internal view returns (uint8) {\\n return _initialized;\\n }\\n\\n /**\\n * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\\n */\\n function _isInitializing() internal view returns (bool) {\\n return _initializing;\\n }\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/token/ERC20/ERC20.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC20/ERC20.sol)\\n\\npragma solidity ^0.8.0;\\n\\nimport \\\"./IERC20.sol\\\";\\nimport \\\"./extensions/IERC20Metadata.sol\\\";\\nimport \\\"../../utils/Context.sol\\\";\\n\\n/**\\n * @dev Implementation of the {IERC20} interface.\\n *\\n * This implementation is agnostic to the way tokens are created. This means\\n * that a supply mechanism has to be added in a derived contract using {_mint}.\\n * For a generic mechanism see {ERC20PresetMinterPauser}.\\n *\\n * TIP: For a detailed writeup see our guide\\n * https://forum.openzeppelin.com/t/how-to-implement-erc20-supply-mechanisms/226[How\\n * to implement supply mechanisms].\\n *\\n * The default value of {decimals} is 18. To change this, you should override\\n * this function so it returns a different value.\\n *\\n * We have followed general OpenZeppelin Contracts guidelines: functions revert\\n * instead returning `false` on failure. This behavior is nonetheless\\n * conventional and does not conflict with the expectations of ERC20\\n * applications.\\n *\\n * Additionally, an {Approval} event is emitted on calls to {transferFrom}.\\n * This allows applications to reconstruct the allowance for all accounts just\\n * by listening to said events. Other implementations of the EIP may not emit\\n * these events, as it isn't required by the specification.\\n *\\n * Finally, the non-standard {decreaseAllowance} and {increaseAllowance}\\n * functions have been added to mitigate the well-known issues around setting\\n * allowances. See {IERC20-approve}.\\n */\\ncontract ERC20 is Context, IERC20, IERC20Metadata {\\n mapping(address => uint256) private _balances;\\n\\n mapping(address => mapping(address => uint256)) private _allowances;\\n\\n uint256 private _totalSupply;\\n\\n string private _name;\\n string private _symbol;\\n\\n /**\\n * @dev Sets the values for {name} and {symbol}.\\n *\\n * All two of these values are immutable: they can only be set once during\\n * construction.\\n */\\n constructor(string memory name_, string memory symbol_) {\\n _name = name_;\\n _symbol = symbol_;\\n }\\n\\n /**\\n * @dev Returns the name of the token.\\n */\\n function name() public view virtual override returns (string memory) {\\n return _name;\\n }\\n\\n /**\\n * @dev Returns the symbol of the token, usually a shorter version of the\\n * name.\\n */\\n function symbol() public view virtual override returns (string memory) {\\n return _symbol;\\n }\\n\\n /**\\n * @dev Returns the number of decimals used to get its user representation.\\n * For example, if `decimals` equals `2`, a balance of `505` tokens should\\n * be displayed to a user as `5.05` (`505 / 10 ** 2`).\\n *\\n * Tokens usually opt for a value of 18, imitating the relationship between\\n * Ether and Wei. This is the default value returned by this function, unless\\n * it's overridden.\\n *\\n * NOTE: This information is only used for _display_ purposes: it in\\n * no way affects any of the arithmetic of the contract, including\\n * {IERC20-balanceOf} and {IERC20-transfer}.\\n */\\n function decimals() public view virtual override returns (uint8) {\\n return 18;\\n }\\n\\n /**\\n * @dev See {IERC20-totalSupply}.\\n */\\n function totalSupply() public view virtual override returns (uint256) {\\n return _totalSupply;\\n }\\n\\n /**\\n * @dev See {IERC20-balanceOf}.\\n */\\n function balanceOf(address account) public view virtual override returns (uint256) {\\n return _balances[account];\\n }\\n\\n /**\\n * @dev See {IERC20-transfer}.\\n *\\n * Requirements:\\n *\\n * - `to` cannot be the zero address.\\n * - the caller must have a balance of at least `amount`.\\n */\\n function transfer(address to, uint256 amount) public virtual override returns (bool) {\\n address owner = _msgSender();\\n _transfer(owner, to, amount);\\n return true;\\n }\\n\\n /**\\n * @dev See {IERC20-allowance}.\\n */\\n function allowance(address owner, address spender) public view virtual override returns (uint256) {\\n return _allowances[owner][spender];\\n }\\n\\n /**\\n * @dev See {IERC20-approve}.\\n *\\n * NOTE: If `amount` is the maximum `uint256`, the allowance is not updated on\\n * `transferFrom`. This is semantically equivalent to an infinite approval.\\n *\\n * Requirements:\\n *\\n * - `spender` cannot be the zero address.\\n */\\n function approve(address spender, uint256 amount) public virtual override returns (bool) {\\n address owner = _msgSender();\\n _approve(owner, spender, amount);\\n return true;\\n }\\n\\n /**\\n * @dev See {IERC20-transferFrom}.\\n *\\n * Emits an {Approval} event indicating the updated allowance. This is not\\n * required by the EIP. See the note at the beginning of {ERC20}.\\n *\\n * NOTE: Does not update the allowance if the current allowance\\n * is the maximum `uint256`.\\n *\\n * Requirements:\\n *\\n * - `from` and `to` cannot be the zero address.\\n * - `from` must have a balance of at least `amount`.\\n * - the caller must have allowance for ``from``'s tokens of at least\\n * `amount`.\\n */\\n function transferFrom(address from, address to, uint256 amount) public virtual override returns (bool) {\\n address spender = _msgSender();\\n _spendAllowance(from, spender, amount);\\n _transfer(from, to, amount);\\n return true;\\n }\\n\\n /**\\n * @dev Atomically increases the allowance granted to `spender` by the caller.\\n *\\n * This is an alternative to {approve} that can be used as a mitigation for\\n * problems described in {IERC20-approve}.\\n *\\n * Emits an {Approval} event indicating the updated allowance.\\n *\\n * Requirements:\\n *\\n * - `spender` cannot be the zero address.\\n */\\n function increaseAllowance(address spender, uint256 addedValue) public virtual returns (bool) {\\n address owner = _msgSender();\\n _approve(owner, spender, allowance(owner, spender) + addedValue);\\n return true;\\n }\\n\\n /**\\n * @dev Atomically decreases the allowance granted to `spender` by the caller.\\n *\\n * This is an alternative to {approve} that can be used as a mitigation for\\n * problems described in {IERC20-approve}.\\n *\\n * Emits an {Approval} event indicating the updated allowance.\\n *\\n * Requirements:\\n *\\n * - `spender` cannot be the zero address.\\n * - `spender` must have allowance for the caller of at least\\n * `subtractedValue`.\\n */\\n function decreaseAllowance(address spender, uint256 subtractedValue) public virtual returns (bool) {\\n address owner = _msgSender();\\n uint256 currentAllowance = allowance(owner, spender);\\n require(currentAllowance >= subtractedValue, \\\"ERC20: decreased allowance below zero\\\");\\n unchecked {\\n _approve(owner, spender, currentAllowance - subtractedValue);\\n }\\n\\n return true;\\n }\\n\\n /**\\n * @dev Moves `amount` of tokens from `from` to `to`.\\n *\\n * This internal function is equivalent to {transfer}, and can be used to\\n * e.g. implement automatic token fees, slashing mechanisms, etc.\\n *\\n * Emits a {Transfer} event.\\n *\\n * Requirements:\\n *\\n * - `from` cannot be the zero address.\\n * - `to` cannot be the zero address.\\n * - `from` must have a balance of at least `amount`.\\n */\\n function _transfer(address from, address to, uint256 amount) internal virtual {\\n require(from != address(0), \\\"ERC20: transfer from the zero address\\\");\\n require(to != address(0), \\\"ERC20: transfer to the zero address\\\");\\n\\n _beforeTokenTransfer(from, to, amount);\\n\\n uint256 fromBalance = _balances[from];\\n require(fromBalance >= amount, \\\"ERC20: transfer amount exceeds balance\\\");\\n unchecked {\\n _balances[from] = fromBalance - amount;\\n // Overflow not possible: the sum of all balances is capped by totalSupply, and the sum is preserved by\\n // decrementing then incrementing.\\n _balances[to] += amount;\\n }\\n\\n emit Transfer(from, to, amount);\\n\\n _afterTokenTransfer(from, to, amount);\\n }\\n\\n /** @dev Creates `amount` tokens and assigns them to `account`, increasing\\n * the total supply.\\n *\\n * Emits a {Transfer} event with `from` set to the zero address.\\n *\\n * Requirements:\\n *\\n * - `account` cannot be the zero address.\\n */\\n function _mint(address account, uint256 amount) internal virtual {\\n require(account != address(0), \\\"ERC20: mint to the zero address\\\");\\n\\n _beforeTokenTransfer(address(0), account, amount);\\n\\n _totalSupply += amount;\\n unchecked {\\n // Overflow not possible: balance + amount is at most totalSupply + amount, which is checked above.\\n _balances[account] += amount;\\n }\\n emit Transfer(address(0), account, amount);\\n\\n _afterTokenTransfer(address(0), account, amount);\\n }\\n\\n /**\\n * @dev Destroys `amount` tokens from `account`, reducing the\\n * total supply.\\n *\\n * Emits a {Transfer} event with `to` set to the zero address.\\n *\\n * Requirements:\\n *\\n * - `account` cannot be the zero address.\\n * - `account` must have at least `amount` tokens.\\n */\\n function _burn(address account, uint256 amount) internal virtual {\\n require(account != address(0), \\\"ERC20: burn from the zero address\\\");\\n\\n _beforeTokenTransfer(account, address(0), amount);\\n\\n uint256 accountBalance = _balances[account];\\n require(accountBalance >= amount, \\\"ERC20: burn amount exceeds balance\\\");\\n unchecked {\\n _balances[account] = accountBalance - amount;\\n // Overflow not possible: amount <= accountBalance <= totalSupply.\\n _totalSupply -= amount;\\n }\\n\\n emit Transfer(account, address(0), amount);\\n\\n _afterTokenTransfer(account, address(0), amount);\\n }\\n\\n /**\\n * @dev Sets `amount` as the allowance of `spender` over the `owner` s tokens.\\n *\\n * This internal function is equivalent to `approve`, and can be used to\\n * e.g. set automatic allowances for certain subsystems, etc.\\n *\\n * Emits an {Approval} event.\\n *\\n * Requirements:\\n *\\n * - `owner` cannot be the zero address.\\n * - `spender` cannot be the zero address.\\n */\\n function _approve(address owner, address spender, uint256 amount) internal virtual {\\n require(owner != address(0), \\\"ERC20: approve from the zero address\\\");\\n require(spender != address(0), \\\"ERC20: approve to the zero address\\\");\\n\\n _allowances[owner][spender] = amount;\\n emit Approval(owner, spender, amount);\\n }\\n\\n /**\\n * @dev Updates `owner` s allowance for `spender` based on spent `amount`.\\n *\\n * Does not update the allowance amount in case of infinite allowance.\\n * Revert if not enough allowance is available.\\n *\\n * Might emit an {Approval} event.\\n */\\n function _spendAllowance(address owner, address spender, uint256 amount) internal virtual {\\n uint256 currentAllowance = allowance(owner, spender);\\n if (currentAllowance != type(uint256).max) {\\n require(currentAllowance >= amount, \\\"ERC20: insufficient allowance\\\");\\n unchecked {\\n _approve(owner, spender, currentAllowance - amount);\\n }\\n }\\n }\\n\\n /**\\n * @dev Hook that is called before any transfer of tokens. This includes\\n * minting and burning.\\n *\\n * Calling conditions:\\n *\\n * - when `from` and `to` are both non-zero, `amount` of ``from``'s tokens\\n * will be transferred to `to`.\\n * - when `from` is zero, `amount` tokens will be minted for `to`.\\n * - when `to` is zero, `amount` of ``from``'s tokens will be burned.\\n * - `from` and `to` are never both zero.\\n *\\n * To learn more about hooks, head to xref:ROOT:extending-contracts.adoc#using-hooks[Using Hooks].\\n */\\n function _beforeTokenTransfer(address from, address to, uint256 amount) internal virtual {}\\n\\n /**\\n * @dev Hook that is called after any transfer of tokens. This includes\\n * minting and burning.\\n *\\n * Calling conditions:\\n *\\n * - when `from` and `to` are both non-zero, `amount` of ``from``'s tokens\\n * has been transferred to `to`.\\n * - when `from` is zero, `amount` tokens have been minted for `to`.\\n * - when `to` is zero, `amount` of ``from``'s tokens have been burned.\\n * - `from` and `to` are never both zero.\\n *\\n * To learn more about hooks, head to xref:ROOT:extending-contracts.adoc#using-hooks[Using Hooks].\\n */\\n function _afterTokenTransfer(address from, address to, uint256 amount) internal virtual {}\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/token/ERC20/IERC20.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC20/IERC20.sol)\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Interface of the ERC20 standard as defined in the EIP.\\n */\\ninterface IERC20 {\\n /**\\n * @dev Emitted when `value` tokens are moved from one account (`from`) to\\n * another (`to`).\\n *\\n * Note that `value` may be zero.\\n */\\n event Transfer(address indexed from, address indexed to, uint256 value);\\n\\n /**\\n * @dev Emitted when the allowance of a `spender` for an `owner` is set by\\n * a call to {approve}. `value` is the new allowance.\\n */\\n event Approval(address indexed owner, address indexed spender, uint256 value);\\n\\n /**\\n * @dev Returns the amount of tokens in existence.\\n */\\n function totalSupply() external view returns (uint256);\\n\\n /**\\n * @dev Returns the amount of tokens owned by `account`.\\n */\\n function balanceOf(address account) external view returns (uint256);\\n\\n /**\\n * @dev Moves `amount` tokens from the caller's account to `to`.\\n *\\n * Returns a boolean value indicating whether the operation succeeded.\\n *\\n * Emits a {Transfer} event.\\n */\\n function transfer(address to, uint256 amount) external returns (bool);\\n\\n /**\\n * @dev Returns the remaining number of tokens that `spender` will be\\n * allowed to spend on behalf of `owner` through {transferFrom}. This is\\n * zero by default.\\n *\\n * This value changes when {approve} or {transferFrom} are called.\\n */\\n function allowance(address owner, address spender) external view returns (uint256);\\n\\n /**\\n * @dev Sets `amount` as the allowance of `spender` over the caller's tokens.\\n *\\n * Returns a boolean value indicating whether the operation succeeded.\\n *\\n * IMPORTANT: Beware that changing an allowance with this method brings the risk\\n * that someone may use both the old and the new allowance by unfortunate\\n * transaction ordering. One possible solution to mitigate this race\\n * condition is to first reduce the spender's allowance to 0 and set the\\n * desired value afterwards:\\n * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\\n *\\n * Emits an {Approval} event.\\n */\\n function approve(address spender, uint256 amount) external returns (bool);\\n\\n /**\\n * @dev Moves `amount` tokens from `from` to `to` using the\\n * allowance mechanism. `amount` is then deducted from the caller's\\n * allowance.\\n *\\n * Returns a boolean value indicating whether the operation succeeded.\\n *\\n * Emits a {Transfer} event.\\n */\\n function transferFrom(address from, address to, uint256 amount) external returns (bool);\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts v4.4.1 (token/ERC20/extensions/IERC20Metadata.sol)\\n\\npragma solidity ^0.8.0;\\n\\nimport \\\"../IERC20.sol\\\";\\n\\n/**\\n * @dev Interface for the optional metadata functions from the ERC20 standard.\\n *\\n * _Available since v4.1._\\n */\\ninterface IERC20Metadata is IERC20 {\\n /**\\n * @dev Returns the name of the token.\\n */\\n function name() external view returns (string memory);\\n\\n /**\\n * @dev Returns the symbol of the token.\\n */\\n function symbol() external view returns (string memory);\\n\\n /**\\n * @dev Returns the decimals places of the token.\\n */\\n function decimals() external view returns (uint8);\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC20/extensions/IERC20Permit.sol)\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in\\n * https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].\\n *\\n * Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by\\n * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't\\n * need to send a transaction, and thus is not required to hold Ether at all.\\n */\\ninterface IERC20Permit {\\n /**\\n * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,\\n * given ``owner``'s signed approval.\\n *\\n * IMPORTANT: The same issues {IERC20-approve} has related to transaction\\n * ordering also apply here.\\n *\\n * Emits an {Approval} event.\\n *\\n * Requirements:\\n *\\n * - `spender` cannot be the zero address.\\n * - `deadline` must be a timestamp in the future.\\n * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`\\n * over the EIP712-formatted function arguments.\\n * - the signature must use ``owner``'s current nonce (see {nonces}).\\n *\\n * For more information on the signature format, see the\\n * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP\\n * section].\\n */\\n function permit(\\n address owner,\\n address spender,\\n uint256 value,\\n uint256 deadline,\\n uint8 v,\\n bytes32 r,\\n bytes32 s\\n ) external;\\n\\n /**\\n * @dev Returns the current nonce for `owner`. This value must be\\n * included whenever a signature is generated for {permit}.\\n *\\n * Every successful call to {permit} increases ``owner``'s nonce by one. This\\n * prevents a signature from being used multiple times.\\n */\\n function nonces(address owner) external view returns (uint256);\\n\\n /**\\n * @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.\\n */\\n // solhint-disable-next-line func-name-mixedcase\\n function DOMAIN_SEPARATOR() external view returns (bytes32);\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.3) (token/ERC20/utils/SafeERC20.sol)\\n\\npragma solidity ^0.8.0;\\n\\nimport \\\"../IERC20.sol\\\";\\nimport \\\"../extensions/IERC20Permit.sol\\\";\\nimport \\\"../../../utils/Address.sol\\\";\\n\\n/**\\n * @title SafeERC20\\n * @dev Wrappers around ERC20 operations that throw on failure (when the token\\n * contract returns false). Tokens that return no value (and instead revert or\\n * throw on failure) are also supported, non-reverting calls are assumed to be\\n * successful.\\n * To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,\\n * which allows you to call the safe operations as `token.safeTransfer(...)`, etc.\\n */\\nlibrary SafeERC20 {\\n using Address for address;\\n\\n /**\\n * @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,\\n * non-reverting calls are assumed to be successful.\\n */\\n function safeTransfer(IERC20 token, address to, uint256 value) internal {\\n _callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value));\\n }\\n\\n /**\\n * @dev Transfer `value` amount of `token` from `from` to `to`, spending the approval given by `from` to the\\n * calling contract. If `token` returns no value, non-reverting calls are assumed to be successful.\\n */\\n function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal {\\n _callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value));\\n }\\n\\n /**\\n * @dev Deprecated. This function has issues similar to the ones found in\\n * {IERC20-approve}, and its usage is discouraged.\\n *\\n * Whenever possible, use {safeIncreaseAllowance} and\\n * {safeDecreaseAllowance} instead.\\n */\\n function safeApprove(IERC20 token, address spender, uint256 value) internal {\\n // safeApprove should only be called when setting an initial allowance,\\n // or when resetting it to zero. To increase and decrease it, use\\n // 'safeIncreaseAllowance' and 'safeDecreaseAllowance'\\n require(\\n (value == 0) || (token.allowance(address(this), spender) == 0),\\n \\\"SafeERC20: approve from non-zero to non-zero allowance\\\"\\n );\\n _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value));\\n }\\n\\n /**\\n * @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,\\n * non-reverting calls are assumed to be successful.\\n */\\n function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {\\n uint256 oldAllowance = token.allowance(address(this), spender);\\n _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, oldAllowance + value));\\n }\\n\\n /**\\n * @dev Decrease the calling contract's allowance toward `spender` by `value`. If `token` returns no value,\\n * non-reverting calls are assumed to be successful.\\n */\\n function safeDecreaseAllowance(IERC20 token, address spender, uint256 value) internal {\\n unchecked {\\n uint256 oldAllowance = token.allowance(address(this), spender);\\n require(oldAllowance >= value, \\\"SafeERC20: decreased allowance below zero\\\");\\n _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, oldAllowance - value));\\n }\\n }\\n\\n /**\\n * @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,\\n * non-reverting calls are assumed to be successful. Meant to be used with tokens that require the approval\\n * to be set to zero before setting it to a non-zero value, such as USDT.\\n */\\n function forceApprove(IERC20 token, address spender, uint256 value) internal {\\n bytes memory approvalCall = abi.encodeWithSelector(token.approve.selector, spender, value);\\n\\n if (!_callOptionalReturnBool(token, approvalCall)) {\\n _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, 0));\\n _callOptionalReturn(token, approvalCall);\\n }\\n }\\n\\n /**\\n * @dev Use a ERC-2612 signature to set the `owner` approval toward `spender` on `token`.\\n * Revert on invalid signature.\\n */\\n function safePermit(\\n IERC20Permit token,\\n address owner,\\n address spender,\\n uint256 value,\\n uint256 deadline,\\n uint8 v,\\n bytes32 r,\\n bytes32 s\\n ) internal {\\n uint256 nonceBefore = token.nonces(owner);\\n token.permit(owner, spender, value, deadline, v, r, s);\\n uint256 nonceAfter = token.nonces(owner);\\n require(nonceAfter == nonceBefore + 1, \\\"SafeERC20: permit did not succeed\\\");\\n }\\n\\n /**\\n * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement\\n * on the return value: the return value is optional (but if data is returned, it must not be false).\\n * @param token The token targeted by the call.\\n * @param data The call data (encoded using abi.encode or one of its variants).\\n */\\n function _callOptionalReturn(IERC20 token, bytes memory data) private {\\n // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since\\n // we're implementing it ourselves. We use {Address-functionCall} to perform this call, which verifies that\\n // the target address contains contract code and also asserts for success in the low-level call.\\n\\n bytes memory returndata = address(token).functionCall(data, \\\"SafeERC20: low-level call failed\\\");\\n require(returndata.length == 0 || abi.decode(returndata, (bool)), \\\"SafeERC20: ERC20 operation did not succeed\\\");\\n }\\n\\n /**\\n * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement\\n * on the return value: the return value is optional (but if data is returned, it must not be false).\\n * @param token The token targeted by the call.\\n * @param data The call data (encoded using abi.encode or one of its variants).\\n *\\n * This is a variant of {_callOptionalReturn} that silents catches all reverts and returns a bool instead.\\n */\\n function _callOptionalReturnBool(IERC20 token, bytes memory data) private returns (bool) {\\n // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since\\n // we're implementing it ourselves. We cannot use {Address-functionCall} here since this should return false\\n // and not revert is the subcall reverts.\\n\\n (bool success, bytes memory returndata) = address(token).call(data);\\n return\\n success && (returndata.length == 0 || abi.decode(returndata, (bool))) && Address.isContract(address(token));\\n }\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/utils/Address.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/Address.sol)\\n\\npragma solidity ^0.8.1;\\n\\n/**\\n * @dev Collection of functions related to the address type\\n */\\nlibrary Address {\\n /**\\n * @dev Returns true if `account` is a contract.\\n *\\n * [IMPORTANT]\\n * ====\\n * It is unsafe to assume that an address for which this function returns\\n * false is an externally-owned account (EOA) and not a contract.\\n *\\n * Among others, `isContract` will return false for the following\\n * types of addresses:\\n *\\n * - an externally-owned account\\n * - a contract in construction\\n * - an address where a contract will be created\\n * - an address where a contract lived, but was destroyed\\n *\\n * Furthermore, `isContract` will also return true if the target contract within\\n * the same transaction is already scheduled for destruction by `SELFDESTRUCT`,\\n * which only has an effect at the end of a transaction.\\n * ====\\n *\\n * [IMPORTANT]\\n * ====\\n * You shouldn't rely on `isContract` to protect against flash loan attacks!\\n *\\n * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets\\n * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract\\n * constructor.\\n * ====\\n */\\n function isContract(address account) internal view returns (bool) {\\n // This method relies on extcodesize/address.code.length, which returns 0\\n // for contracts in construction, since the code is only stored at the end\\n // of the constructor execution.\\n\\n return account.code.length > 0;\\n }\\n\\n /**\\n * @dev Replacement for Solidity's `transfer`: sends `amount` wei to\\n * `recipient`, forwarding all available gas and reverting on errors.\\n *\\n * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost\\n * of certain opcodes, possibly making contracts go over the 2300 gas limit\\n * imposed by `transfer`, making them unable to receive funds via\\n * `transfer`. {sendValue} removes this limitation.\\n *\\n * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].\\n *\\n * IMPORTANT: because control is transferred to `recipient`, care must be\\n * taken to not create reentrancy vulnerabilities. Consider using\\n * {ReentrancyGuard} or the\\n * https://solidity.readthedocs.io/en/v0.8.0/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].\\n */\\n function sendValue(address payable recipient, uint256 amount) internal {\\n require(address(this).balance >= amount, \\\"Address: insufficient balance\\\");\\n\\n (bool success, ) = recipient.call{value: amount}(\\\"\\\");\\n require(success, \\\"Address: unable to send value, recipient may have reverted\\\");\\n }\\n\\n /**\\n * @dev Performs a Solidity function call using a low level `call`. A\\n * plain `call` is an unsafe replacement for a function call: use this\\n * function instead.\\n *\\n * If `target` reverts with a revert reason, it is bubbled up by this\\n * function (like regular Solidity function calls).\\n *\\n * Returns the raw returned data. To convert to the expected return value,\\n * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].\\n *\\n * Requirements:\\n *\\n * - `target` must be a contract.\\n * - calling `target` with `data` must not revert.\\n *\\n * _Available since v3.1._\\n */\\n function functionCall(address target, bytes memory data) internal returns (bytes memory) {\\n return functionCallWithValue(target, data, 0, \\\"Address: low-level call failed\\\");\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with\\n * `errorMessage` as a fallback revert reason when `target` reverts.\\n *\\n * _Available since v3.1._\\n */\\n function functionCall(\\n address target,\\n bytes memory data,\\n string memory errorMessage\\n ) internal returns (bytes memory) {\\n return functionCallWithValue(target, data, 0, errorMessage);\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\\n * but also transferring `value` wei to `target`.\\n *\\n * Requirements:\\n *\\n * - the calling contract must have an ETH balance of at least `value`.\\n * - the called Solidity function must be `payable`.\\n *\\n * _Available since v3.1._\\n */\\n function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {\\n return functionCallWithValue(target, data, value, \\\"Address: low-level call with value failed\\\");\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but\\n * with `errorMessage` as a fallback revert reason when `target` reverts.\\n *\\n * _Available since v3.1._\\n */\\n function functionCallWithValue(\\n address target,\\n bytes memory data,\\n uint256 value,\\n string memory errorMessage\\n ) internal returns (bytes memory) {\\n require(address(this).balance >= value, \\\"Address: insufficient balance for call\\\");\\n (bool success, bytes memory returndata) = target.call{value: value}(data);\\n return verifyCallResultFromTarget(target, success, returndata, errorMessage);\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\\n * but performing a static call.\\n *\\n * _Available since v3.3._\\n */\\n function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {\\n return functionStaticCall(target, data, \\\"Address: low-level static call failed\\\");\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\\n * but performing a static call.\\n *\\n * _Available since v3.3._\\n */\\n function functionStaticCall(\\n address target,\\n bytes memory data,\\n string memory errorMessage\\n ) internal view returns (bytes memory) {\\n (bool success, bytes memory returndata) = target.staticcall(data);\\n return verifyCallResultFromTarget(target, success, returndata, errorMessage);\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\\n * but performing a delegate call.\\n *\\n * _Available since v3.4._\\n */\\n function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {\\n return functionDelegateCall(target, data, \\\"Address: low-level delegate call failed\\\");\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\\n * but performing a delegate call.\\n *\\n * _Available since v3.4._\\n */\\n function functionDelegateCall(\\n address target,\\n bytes memory data,\\n string memory errorMessage\\n ) internal returns (bytes memory) {\\n (bool success, bytes memory returndata) = target.delegatecall(data);\\n return verifyCallResultFromTarget(target, success, returndata, errorMessage);\\n }\\n\\n /**\\n * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling\\n * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.\\n *\\n * _Available since v4.8._\\n */\\n function verifyCallResultFromTarget(\\n address target,\\n bool success,\\n bytes memory returndata,\\n string memory errorMessage\\n ) internal view returns (bytes memory) {\\n if (success) {\\n if (returndata.length == 0) {\\n // only check isContract if the call was successful and the return data is empty\\n // otherwise we already know that it was a contract\\n require(isContract(target), \\\"Address: call to non-contract\\\");\\n }\\n return returndata;\\n } else {\\n _revert(returndata, errorMessage);\\n }\\n }\\n\\n /**\\n * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the\\n * revert reason or using the provided one.\\n *\\n * _Available since v4.3._\\n */\\n function verifyCallResult(\\n bool success,\\n bytes memory returndata,\\n string memory errorMessage\\n ) internal pure returns (bytes memory) {\\n if (success) {\\n return returndata;\\n } else {\\n _revert(returndata, errorMessage);\\n }\\n }\\n\\n function _revert(bytes memory returndata, string memory errorMessage) private pure {\\n // Look for revert reason and bubble it up if present\\n if (returndata.length > 0) {\\n // The easiest way to bubble the revert reason is using memory via assembly\\n /// @solidity memory-safe-assembly\\n assembly {\\n let returndata_size := mload(returndata)\\n revert(add(32, returndata), returndata_size)\\n }\\n } else {\\n revert(errorMessage);\\n }\\n }\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/utils/Context.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Provides information about the current execution context, including the\\n * sender of the transaction and its data. While these are generally available\\n * via msg.sender and msg.data, they should not be accessed in such a direct\\n * manner, since when dealing with meta-transactions the account sending and\\n * paying for execution may not be the actual sender (as far as an application\\n * is concerned).\\n *\\n * This contract is only required for intermediate, library-like contracts.\\n */\\nabstract contract Context {\\n function _msgSender() internal view virtual returns (address) {\\n return msg.sender;\\n }\\n\\n function _msgData() internal view virtual returns (bytes calldata) {\\n return msg.data;\\n }\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/utils/Strings.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/Strings.sol)\\n\\npragma solidity ^0.8.0;\\n\\nimport \\\"./math/Math.sol\\\";\\nimport \\\"./math/SignedMath.sol\\\";\\n\\n/**\\n * @dev String operations.\\n */\\nlibrary Strings {\\n bytes16 private constant _SYMBOLS = \\\"0123456789abcdef\\\";\\n uint8 private constant _ADDRESS_LENGTH = 20;\\n\\n /**\\n * @dev Converts a `uint256` to its ASCII `string` decimal representation.\\n */\\n function toString(uint256 value) internal pure returns (string memory) {\\n unchecked {\\n uint256 length = Math.log10(value) + 1;\\n string memory buffer = new string(length);\\n uint256 ptr;\\n /// @solidity memory-safe-assembly\\n assembly {\\n ptr := add(buffer, add(32, length))\\n }\\n while (true) {\\n ptr--;\\n /// @solidity memory-safe-assembly\\n assembly {\\n mstore8(ptr, byte(mod(value, 10), _SYMBOLS))\\n }\\n value /= 10;\\n if (value == 0) break;\\n }\\n return buffer;\\n }\\n }\\n\\n /**\\n * @dev Converts a `int256` to its ASCII `string` decimal representation.\\n */\\n function toString(int256 value) internal pure returns (string memory) {\\n return string(abi.encodePacked(value < 0 ? \\\"-\\\" : \\\"\\\", toString(SignedMath.abs(value))));\\n }\\n\\n /**\\n * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.\\n */\\n function toHexString(uint256 value) internal pure returns (string memory) {\\n unchecked {\\n return toHexString(value, Math.log256(value) + 1);\\n }\\n }\\n\\n /**\\n * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.\\n */\\n function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {\\n bytes memory buffer = new bytes(2 * length + 2);\\n buffer[0] = \\\"0\\\";\\n buffer[1] = \\\"x\\\";\\n for (uint256 i = 2 * length + 1; i > 1; --i) {\\n buffer[i] = _SYMBOLS[value & 0xf];\\n value >>= 4;\\n }\\n require(value == 0, \\\"Strings: hex length insufficient\\\");\\n return string(buffer);\\n }\\n\\n /**\\n * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation.\\n */\\n function toHexString(address addr) internal pure returns (string memory) {\\n return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH);\\n }\\n\\n /**\\n * @dev Returns true if the two strings are equal.\\n */\\n function equal(string memory a, string memory b) internal pure returns (bool) {\\n return keccak256(bytes(a)) == keccak256(bytes(b));\\n }\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/utils/introspection/ERC165Checker.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/introspection/ERC165Checker.sol)\\n\\npragma solidity ^0.8.0;\\n\\nimport \\\"./IERC165.sol\\\";\\n\\n/**\\n * @dev Library used to query support of an interface declared via {IERC165}.\\n *\\n * Note that these functions return the actual result of the query: they do not\\n * `revert` if an interface is not supported. It is up to the caller to decide\\n * what to do in these cases.\\n */\\nlibrary ERC165Checker {\\n // As per the EIP-165 spec, no interface should ever match 0xffffffff\\n bytes4 private constant _INTERFACE_ID_INVALID = 0xffffffff;\\n\\n /**\\n * @dev Returns true if `account` supports the {IERC165} interface.\\n */\\n function supportsERC165(address account) internal view returns (bool) {\\n // Any contract that implements ERC165 must explicitly indicate support of\\n // InterfaceId_ERC165 and explicitly indicate non-support of InterfaceId_Invalid\\n return\\n supportsERC165InterfaceUnchecked(account, type(IERC165).interfaceId) &&\\n !supportsERC165InterfaceUnchecked(account, _INTERFACE_ID_INVALID);\\n }\\n\\n /**\\n * @dev Returns true if `account` supports the interface defined by\\n * `interfaceId`. Support for {IERC165} itself is queried automatically.\\n *\\n * See {IERC165-supportsInterface}.\\n */\\n function supportsInterface(address account, bytes4 interfaceId) internal view returns (bool) {\\n // query support of both ERC165 as per the spec and support of _interfaceId\\n return supportsERC165(account) && supportsERC165InterfaceUnchecked(account, interfaceId);\\n }\\n\\n /**\\n * @dev Returns a boolean array where each value corresponds to the\\n * interfaces passed in and whether they're supported or not. This allows\\n * you to batch check interfaces for a contract where your expectation\\n * is that some interfaces may not be supported.\\n *\\n * See {IERC165-supportsInterface}.\\n *\\n * _Available since v3.4._\\n */\\n function getSupportedInterfaces(\\n address account,\\n bytes4[] memory interfaceIds\\n ) internal view returns (bool[] memory) {\\n // an array of booleans corresponding to interfaceIds and whether they're supported or not\\n bool[] memory interfaceIdsSupported = new bool[](interfaceIds.length);\\n\\n // query support of ERC165 itself\\n if (supportsERC165(account)) {\\n // query support of each interface in interfaceIds\\n for (uint256 i = 0; i < interfaceIds.length; i++) {\\n interfaceIdsSupported[i] = supportsERC165InterfaceUnchecked(account, interfaceIds[i]);\\n }\\n }\\n\\n return interfaceIdsSupported;\\n }\\n\\n /**\\n * @dev Returns true if `account` supports all the interfaces defined in\\n * `interfaceIds`. Support for {IERC165} itself is queried automatically.\\n *\\n * Batch-querying can lead to gas savings by skipping repeated checks for\\n * {IERC165} support.\\n *\\n * See {IERC165-supportsInterface}.\\n */\\n function supportsAllInterfaces(address account, bytes4[] memory interfaceIds) internal view returns (bool) {\\n // query support of ERC165 itself\\n if (!supportsERC165(account)) {\\n return false;\\n }\\n\\n // query support of each interface in interfaceIds\\n for (uint256 i = 0; i < interfaceIds.length; i++) {\\n if (!supportsERC165InterfaceUnchecked(account, interfaceIds[i])) {\\n return false;\\n }\\n }\\n\\n // all interfaces supported\\n return true;\\n }\\n\\n /**\\n * @notice Query if a contract implements an interface, does not check ERC165 support\\n * @param account The address of the contract to query for support of an interface\\n * @param interfaceId The interface identifier, as specified in ERC-165\\n * @return true if the contract at account indicates support of the interface with\\n * identifier interfaceId, false otherwise\\n * @dev Assumes that account contains a contract that supports ERC165, otherwise\\n * the behavior of this method is undefined. This precondition can be checked\\n * with {supportsERC165}.\\n *\\n * Some precompiled contracts will falsely indicate support for a given interface, so caution\\n * should be exercised when using this function.\\n *\\n * Interface identification is specified in ERC-165.\\n */\\n function supportsERC165InterfaceUnchecked(address account, bytes4 interfaceId) internal view returns (bool) {\\n // prepare call\\n bytes memory encodedParams = abi.encodeWithSelector(IERC165.supportsInterface.selector, interfaceId);\\n\\n // perform static call\\n bool success;\\n uint256 returnSize;\\n uint256 returnValue;\\n assembly {\\n success := staticcall(30000, account, add(encodedParams, 0x20), mload(encodedParams), 0x00, 0x20)\\n returnSize := returndatasize()\\n returnValue := mload(0x00)\\n }\\n\\n return success && returnSize >= 0x20 && returnValue > 0;\\n }\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/utils/introspection/IERC165.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts v4.4.1 (utils/introspection/IERC165.sol)\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Interface of the ERC165 standard, as defined in the\\n * https://eips.ethereum.org/EIPS/eip-165[EIP].\\n *\\n * Implementers can declare support of contract interfaces, which can then be\\n * queried by others ({ERC165Checker}).\\n *\\n * For an implementation, see {ERC165}.\\n */\\ninterface IERC165 {\\n /**\\n * @dev Returns true if this contract implements the interface defined by\\n * `interfaceId`. See the corresponding\\n * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[EIP section]\\n * to learn more about how these ids are created.\\n *\\n * This function call must use less than 30 000 gas.\\n */\\n function supportsInterface(bytes4 interfaceId) external view returns (bool);\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/utils/math/Math.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/math/Math.sol)\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Standard math utilities missing in the Solidity language.\\n */\\nlibrary Math {\\n enum Rounding {\\n Down, // Toward negative infinity\\n Up, // Toward infinity\\n Zero // Toward zero\\n }\\n\\n /**\\n * @dev Returns the largest of two numbers.\\n */\\n function max(uint256 a, uint256 b) internal pure returns (uint256) {\\n return a > b ? a : b;\\n }\\n\\n /**\\n * @dev Returns the smallest of two numbers.\\n */\\n function min(uint256 a, uint256 b) internal pure returns (uint256) {\\n return a < b ? a : b;\\n }\\n\\n /**\\n * @dev Returns the average of two numbers. The result is rounded towards\\n * zero.\\n */\\n function average(uint256 a, uint256 b) internal pure returns (uint256) {\\n // (a + b) / 2 can overflow.\\n return (a & b) + (a ^ b) / 2;\\n }\\n\\n /**\\n * @dev Returns the ceiling of the division of two numbers.\\n *\\n * This differs from standard division with `/` in that it rounds up instead\\n * of rounding down.\\n */\\n function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {\\n // (a + b - 1) / b can overflow on addition, so we distribute.\\n return a == 0 ? 0 : (a - 1) / b + 1;\\n }\\n\\n /**\\n * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0\\n * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv)\\n * with further edits by Uniswap Labs also under MIT license.\\n */\\n function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {\\n unchecked {\\n // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use\\n // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256\\n // variables such that product = prod1 * 2^256 + prod0.\\n uint256 prod0; // Least significant 256 bits of the product\\n uint256 prod1; // Most significant 256 bits of the product\\n assembly {\\n let mm := mulmod(x, y, not(0))\\n prod0 := mul(x, y)\\n prod1 := sub(sub(mm, prod0), lt(mm, prod0))\\n }\\n\\n // Handle non-overflow cases, 256 by 256 division.\\n if (prod1 == 0) {\\n // Solidity will revert if denominator == 0, unlike the div opcode on its own.\\n // The surrounding unchecked block does not change this fact.\\n // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.\\n return prod0 / denominator;\\n }\\n\\n // Make sure the result is less than 2^256. Also prevents denominator == 0.\\n require(denominator > prod1, \\\"Math: mulDiv overflow\\\");\\n\\n ///////////////////////////////////////////////\\n // 512 by 256 division.\\n ///////////////////////////////////////////////\\n\\n // Make division exact by subtracting the remainder from [prod1 prod0].\\n uint256 remainder;\\n assembly {\\n // Compute remainder using mulmod.\\n remainder := mulmod(x, y, denominator)\\n\\n // Subtract 256 bit number from 512 bit number.\\n prod1 := sub(prod1, gt(remainder, prod0))\\n prod0 := sub(prod0, remainder)\\n }\\n\\n // Factor powers of two out of denominator and compute largest power of two divisor of denominator. Always >= 1.\\n // See https://cs.stackexchange.com/q/138556/92363.\\n\\n // Does not overflow because the denominator cannot be zero at this stage in the function.\\n uint256 twos = denominator & (~denominator + 1);\\n assembly {\\n // Divide denominator by twos.\\n denominator := div(denominator, twos)\\n\\n // Divide [prod1 prod0] by twos.\\n prod0 := div(prod0, twos)\\n\\n // Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one.\\n twos := add(div(sub(0, twos), twos), 1)\\n }\\n\\n // Shift in bits from prod1 into prod0.\\n prod0 |= prod1 * twos;\\n\\n // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such\\n // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for\\n // four bits. That is, denominator * inv = 1 mod 2^4.\\n uint256 inverse = (3 * denominator) ^ 2;\\n\\n // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works\\n // in modular arithmetic, doubling the correct bits in each step.\\n inverse *= 2 - denominator * inverse; // inverse mod 2^8\\n inverse *= 2 - denominator * inverse; // inverse mod 2^16\\n inverse *= 2 - denominator * inverse; // inverse mod 2^32\\n inverse *= 2 - denominator * inverse; // inverse mod 2^64\\n inverse *= 2 - denominator * inverse; // inverse mod 2^128\\n inverse *= 2 - denominator * inverse; // inverse mod 2^256\\n\\n // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.\\n // This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is\\n // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1\\n // is no longer required.\\n result = prod0 * inverse;\\n return result;\\n }\\n }\\n\\n /**\\n * @notice Calculates x * y / denominator with full precision, following the selected rounding direction.\\n */\\n function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {\\n uint256 result = mulDiv(x, y, denominator);\\n if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) {\\n result += 1;\\n }\\n return result;\\n }\\n\\n /**\\n * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded down.\\n *\\n * Inspired by Henry S. Warren, Jr.'s \\\"Hacker's Delight\\\" (Chapter 11).\\n */\\n function sqrt(uint256 a) internal pure returns (uint256) {\\n if (a == 0) {\\n return 0;\\n }\\n\\n // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.\\n //\\n // We know that the \\\"msb\\\" (most significant bit) of our target number `a` is a power of 2 such that we have\\n // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.\\n //\\n // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`\\n // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`\\n // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`\\n //\\n // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.\\n uint256 result = 1 << (log2(a) >> 1);\\n\\n // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,\\n // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at\\n // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision\\n // into the expected uint128 result.\\n unchecked {\\n result = (result + a / result) >> 1;\\n result = (result + a / result) >> 1;\\n result = (result + a / result) >> 1;\\n result = (result + a / result) >> 1;\\n result = (result + a / result) >> 1;\\n result = (result + a / result) >> 1;\\n result = (result + a / result) >> 1;\\n return min(result, a / result);\\n }\\n }\\n\\n /**\\n * @notice Calculates sqrt(a), following the selected rounding direction.\\n */\\n function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {\\n unchecked {\\n uint256 result = sqrt(a);\\n return result + (rounding == Rounding.Up && result * result < a ? 1 : 0);\\n }\\n }\\n\\n /**\\n * @dev Return the log in base 2, rounded down, of a positive value.\\n * Returns 0 if given 0.\\n */\\n function log2(uint256 value) internal pure returns (uint256) {\\n uint256 result = 0;\\n unchecked {\\n if (value >> 128 > 0) {\\n value >>= 128;\\n result += 128;\\n }\\n if (value >> 64 > 0) {\\n value >>= 64;\\n result += 64;\\n }\\n if (value >> 32 > 0) {\\n value >>= 32;\\n result += 32;\\n }\\n if (value >> 16 > 0) {\\n value >>= 16;\\n result += 16;\\n }\\n if (value >> 8 > 0) {\\n value >>= 8;\\n result += 8;\\n }\\n if (value >> 4 > 0) {\\n value >>= 4;\\n result += 4;\\n }\\n if (value >> 2 > 0) {\\n value >>= 2;\\n result += 2;\\n }\\n if (value >> 1 > 0) {\\n result += 1;\\n }\\n }\\n return result;\\n }\\n\\n /**\\n * @dev Return the log in base 2, following the selected rounding direction, of a positive value.\\n * Returns 0 if given 0.\\n */\\n function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {\\n unchecked {\\n uint256 result = log2(value);\\n return result + (rounding == Rounding.Up && 1 << result < value ? 1 : 0);\\n }\\n }\\n\\n /**\\n * @dev Return the log in base 10, rounded down, of a positive value.\\n * Returns 0 if given 0.\\n */\\n function log10(uint256 value) internal pure returns (uint256) {\\n uint256 result = 0;\\n unchecked {\\n if (value >= 10 ** 64) {\\n value /= 10 ** 64;\\n result += 64;\\n }\\n if (value >= 10 ** 32) {\\n value /= 10 ** 32;\\n result += 32;\\n }\\n if (value >= 10 ** 16) {\\n value /= 10 ** 16;\\n result += 16;\\n }\\n if (value >= 10 ** 8) {\\n value /= 10 ** 8;\\n result += 8;\\n }\\n if (value >= 10 ** 4) {\\n value /= 10 ** 4;\\n result += 4;\\n }\\n if (value >= 10 ** 2) {\\n value /= 10 ** 2;\\n result += 2;\\n }\\n if (value >= 10 ** 1) {\\n result += 1;\\n }\\n }\\n return result;\\n }\\n\\n /**\\n * @dev Return the log in base 10, following the selected rounding direction, of a positive value.\\n * Returns 0 if given 0.\\n */\\n function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {\\n unchecked {\\n uint256 result = log10(value);\\n return result + (rounding == Rounding.Up && 10 ** result < value ? 1 : 0);\\n }\\n }\\n\\n /**\\n * @dev Return the log in base 256, rounded down, of a positive value.\\n * Returns 0 if given 0.\\n *\\n * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.\\n */\\n function log256(uint256 value) internal pure returns (uint256) {\\n uint256 result = 0;\\n unchecked {\\n if (value >> 128 > 0) {\\n value >>= 128;\\n result += 16;\\n }\\n if (value >> 64 > 0) {\\n value >>= 64;\\n result += 8;\\n }\\n if (value >> 32 > 0) {\\n value >>= 32;\\n result += 4;\\n }\\n if (value >> 16 > 0) {\\n value >>= 16;\\n result += 2;\\n }\\n if (value >> 8 > 0) {\\n result += 1;\\n }\\n }\\n return result;\\n }\\n\\n /**\\n * @dev Return the log in base 256, following the selected rounding direction, of a positive value.\\n * Returns 0 if given 0.\\n */\\n function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {\\n unchecked {\\n uint256 result = log256(value);\\n return result + (rounding == Rounding.Up && 1 << (result << 3) < value ? 1 : 0);\\n }\\n }\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts/utils/math/SignedMath.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.8.0) (utils/math/SignedMath.sol)\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Standard signed math utilities missing in the Solidity language.\\n */\\nlibrary SignedMath {\\n /**\\n * @dev Returns the largest of two signed numbers.\\n */\\n function max(int256 a, int256 b) internal pure returns (int256) {\\n return a > b ? a : b;\\n }\\n\\n /**\\n * @dev Returns the smallest of two signed numbers.\\n */\\n function min(int256 a, int256 b) internal pure returns (int256) {\\n return a < b ? a : b;\\n }\\n\\n /**\\n * @dev Returns the average of two signed numbers without overflow.\\n * The result is rounded towards zero.\\n */\\n function average(int256 a, int256 b) internal pure returns (int256) {\\n // Formula from the book \\\"Hacker's Delight\\\"\\n int256 x = (a & b) + ((a ^ b) >> 1);\\n return x + (int256(uint256(x) >> 255) & (a ^ b));\\n }\\n\\n /**\\n * @dev Returns the absolute unsigned value of a signed value.\\n */\\n function abs(int256 n) internal pure returns (uint256) {\\n unchecked {\\n // must be unchecked in order to support `n = type(int256).min`\\n return uint256(n >= 0 ? n : -n);\\n }\\n }\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/Initializable.sol)\\n\\npragma solidity ^0.8.2;\\n\\nimport \\\"../../utils/AddressUpgradeable.sol\\\";\\n\\n/**\\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\\n *\\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\\n * reused. This mechanism prevents re-execution of each \\\"step\\\" but allows the creation of new initialization steps in\\n * case an upgrade adds a module that needs to be initialized.\\n *\\n * For example:\\n *\\n * [.hljs-theme-light.nopadding]\\n * ```solidity\\n * contract MyToken is ERC20Upgradeable {\\n * function initialize() initializer public {\\n * __ERC20_init(\\\"MyToken\\\", \\\"MTK\\\");\\n * }\\n * }\\n *\\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\\n * function initializeV2() reinitializer(2) public {\\n * __ERC20Permit_init(\\\"MyToken\\\");\\n * }\\n * }\\n * ```\\n *\\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\\n * possible by providing the encoded function call as the `_data` argument to {ERC1967Proxy-constructor}.\\n *\\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\\n *\\n * [CAUTION]\\n * ====\\n * Avoid leaving a contract uninitialized.\\n *\\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\\n *\\n * [.hljs-theme-light.nopadding]\\n * ```\\n * /// @custom:oz-upgrades-unsafe-allow constructor\\n * constructor() {\\n * _disableInitializers();\\n * }\\n * ```\\n * ====\\n */\\nabstract contract Initializable {\\n /**\\n * @dev Indicates that the contract has been initialized.\\n * @custom:oz-retyped-from bool\\n */\\n uint8 private _initialized;\\n\\n /**\\n * @dev Indicates that the contract is in the process of being initialized.\\n */\\n bool private _initializing;\\n\\n /**\\n * @dev Triggered when the contract has been initialized or reinitialized.\\n */\\n event Initialized(uint8 version);\\n\\n /**\\n * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\\n * `onlyInitializing` functions can be used to initialize parent contracts.\\n *\\n * Similar to `reinitializer(1)`, except that functions marked with `initializer` can be nested in the context of a\\n * constructor.\\n *\\n * Emits an {Initialized} event.\\n */\\n modifier initializer() {\\n bool isTopLevelCall = !_initializing;\\n require(\\n (isTopLevelCall && _initialized < 1) || (!AddressUpgradeable.isContract(address(this)) && _initialized == 1),\\n \\\"Initializable: contract is already initialized\\\"\\n );\\n _initialized = 1;\\n if (isTopLevelCall) {\\n _initializing = true;\\n }\\n _;\\n if (isTopLevelCall) {\\n _initializing = false;\\n emit Initialized(1);\\n }\\n }\\n\\n /**\\n * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\\n * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\\n * used to initialize parent contracts.\\n *\\n * A reinitializer may be used after the original initialization step. This is essential to configure modules that\\n * are added through upgrades and that require initialization.\\n *\\n * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\\n * cannot be nested. If one is invoked in the context of another, execution will revert.\\n *\\n * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\\n * a contract, executing them in the right order is up to the developer or operator.\\n *\\n * WARNING: setting the version to 255 will prevent any future reinitialization.\\n *\\n * Emits an {Initialized} event.\\n */\\n modifier reinitializer(uint8 version) {\\n require(!_initializing && _initialized < version, \\\"Initializable: contract is already initialized\\\");\\n _initialized = version;\\n _initializing = true;\\n _;\\n _initializing = false;\\n emit Initialized(version);\\n }\\n\\n /**\\n * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\\n * {initializer} and {reinitializer} modifiers, directly or indirectly.\\n */\\n modifier onlyInitializing() {\\n require(_initializing, \\\"Initializable: contract is not initializing\\\");\\n _;\\n }\\n\\n /**\\n * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\\n * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\\n * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\\n * through proxies.\\n *\\n * Emits an {Initialized} event the first time it is successfully executed.\\n */\\n function _disableInitializers() internal virtual {\\n require(!_initializing, \\\"Initializable: contract is initializing\\\");\\n if (_initialized != type(uint8).max) {\\n _initialized = type(uint8).max;\\n emit Initialized(type(uint8).max);\\n }\\n }\\n\\n /**\\n * @dev Returns the highest version that has been initialized. See {reinitializer}.\\n */\\n function _getInitializedVersion() internal view returns (uint8) {\\n return _initialized;\\n }\\n\\n /**\\n * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\\n */\\n function _isInitializing() internal view returns (bool) {\\n return _initializing;\\n }\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts-upgradeable/security/PausableUpgradeable.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.7.0) (security/Pausable.sol)\\n\\npragma solidity ^0.8.0;\\n\\nimport \\\"../utils/ContextUpgradeable.sol\\\";\\nimport \\\"../proxy/utils/Initializable.sol\\\";\\n\\n/**\\n * @dev Contract module which allows children to implement an emergency stop\\n * mechanism that can be triggered by an authorized account.\\n *\\n * This module is used through inheritance. It will make available the\\n * modifiers `whenNotPaused` and `whenPaused`, which can be applied to\\n * the functions of your contract. Note that they will not be pausable by\\n * simply including this module, only once the modifiers are put in place.\\n */\\nabstract contract PausableUpgradeable is Initializable, ContextUpgradeable {\\n /**\\n * @dev Emitted when the pause is triggered by `account`.\\n */\\n event Paused(address account);\\n\\n /**\\n * @dev Emitted when the pause is lifted by `account`.\\n */\\n event Unpaused(address account);\\n\\n bool private _paused;\\n\\n /**\\n * @dev Initializes the contract in unpaused state.\\n */\\n function __Pausable_init() internal onlyInitializing {\\n __Pausable_init_unchained();\\n }\\n\\n function __Pausable_init_unchained() internal onlyInitializing {\\n _paused = false;\\n }\\n\\n /**\\n * @dev Modifier to make a function callable only when the contract is not paused.\\n *\\n * Requirements:\\n *\\n * - The contract must not be paused.\\n */\\n modifier whenNotPaused() {\\n _requireNotPaused();\\n _;\\n }\\n\\n /**\\n * @dev Modifier to make a function callable only when the contract is paused.\\n *\\n * Requirements:\\n *\\n * - The contract must be paused.\\n */\\n modifier whenPaused() {\\n _requirePaused();\\n _;\\n }\\n\\n /**\\n * @dev Returns true if the contract is paused, and false otherwise.\\n */\\n function paused() public view virtual returns (bool) {\\n return _paused;\\n }\\n\\n /**\\n * @dev Throws if the contract is paused.\\n */\\n function _requireNotPaused() internal view virtual {\\n require(!paused(), \\\"Pausable: paused\\\");\\n }\\n\\n /**\\n * @dev Throws if the contract is not paused.\\n */\\n function _requirePaused() internal view virtual {\\n require(paused(), \\\"Pausable: not paused\\\");\\n }\\n\\n /**\\n * @dev Triggers stopped state.\\n *\\n * Requirements:\\n *\\n * - The contract must not be paused.\\n */\\n function _pause() internal virtual whenNotPaused {\\n _paused = true;\\n emit Paused(_msgSender());\\n }\\n\\n /**\\n * @dev Returns to normal state.\\n *\\n * Requirements:\\n *\\n * - The contract must be paused.\\n */\\n function _unpause() internal virtual whenPaused {\\n _paused = false;\\n emit Unpaused(_msgSender());\\n }\\n\\n /**\\n * @dev This empty reserved space is put in place to allow future versions to add new\\n * variables without shifting down storage in the inheritance chain.\\n * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\\n */\\n uint256[49] private __gap;\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts-upgradeable/utils/AddressUpgradeable.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/Address.sol)\\n\\npragma solidity ^0.8.1;\\n\\n/**\\n * @dev Collection of functions related to the address type\\n */\\nlibrary AddressUpgradeable {\\n /**\\n * @dev Returns true if `account` is a contract.\\n *\\n * [IMPORTANT]\\n * ====\\n * It is unsafe to assume that an address for which this function returns\\n * false is an externally-owned account (EOA) and not a contract.\\n *\\n * Among others, `isContract` will return false for the following\\n * types of addresses:\\n *\\n * - an externally-owned account\\n * - a contract in construction\\n * - an address where a contract will be created\\n * - an address where a contract lived, but was destroyed\\n *\\n * Furthermore, `isContract` will also return true if the target contract within\\n * the same transaction is already scheduled for destruction by `SELFDESTRUCT`,\\n * which only has an effect at the end of a transaction.\\n * ====\\n *\\n * [IMPORTANT]\\n * ====\\n * You shouldn't rely on `isContract` to protect against flash loan attacks!\\n *\\n * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets\\n * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract\\n * constructor.\\n * ====\\n */\\n function isContract(address account) internal view returns (bool) {\\n // This method relies on extcodesize/address.code.length, which returns 0\\n // for contracts in construction, since the code is only stored at the end\\n // of the constructor execution.\\n\\n return account.code.length > 0;\\n }\\n\\n /**\\n * @dev Replacement for Solidity's `transfer`: sends `amount` wei to\\n * `recipient`, forwarding all available gas and reverting on errors.\\n *\\n * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost\\n * of certain opcodes, possibly making contracts go over the 2300 gas limit\\n * imposed by `transfer`, making them unable to receive funds via\\n * `transfer`. {sendValue} removes this limitation.\\n *\\n * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].\\n *\\n * IMPORTANT: because control is transferred to `recipient`, care must be\\n * taken to not create reentrancy vulnerabilities. Consider using\\n * {ReentrancyGuard} or the\\n * https://solidity.readthedocs.io/en/v0.8.0/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].\\n */\\n function sendValue(address payable recipient, uint256 amount) internal {\\n require(address(this).balance >= amount, \\\"Address: insufficient balance\\\");\\n\\n (bool success, ) = recipient.call{value: amount}(\\\"\\\");\\n require(success, \\\"Address: unable to send value, recipient may have reverted\\\");\\n }\\n\\n /**\\n * @dev Performs a Solidity function call using a low level `call`. A\\n * plain `call` is an unsafe replacement for a function call: use this\\n * function instead.\\n *\\n * If `target` reverts with a revert reason, it is bubbled up by this\\n * function (like regular Solidity function calls).\\n *\\n * Returns the raw returned data. To convert to the expected return value,\\n * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].\\n *\\n * Requirements:\\n *\\n * - `target` must be a contract.\\n * - calling `target` with `data` must not revert.\\n *\\n * _Available since v3.1._\\n */\\n function functionCall(address target, bytes memory data) internal returns (bytes memory) {\\n return functionCallWithValue(target, data, 0, \\\"Address: low-level call failed\\\");\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with\\n * `errorMessage` as a fallback revert reason when `target` reverts.\\n *\\n * _Available since v3.1._\\n */\\n function functionCall(\\n address target,\\n bytes memory data,\\n string memory errorMessage\\n ) internal returns (bytes memory) {\\n return functionCallWithValue(target, data, 0, errorMessage);\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\\n * but also transferring `value` wei to `target`.\\n *\\n * Requirements:\\n *\\n * - the calling contract must have an ETH balance of at least `value`.\\n * - the called Solidity function must be `payable`.\\n *\\n * _Available since v3.1._\\n */\\n function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {\\n return functionCallWithValue(target, data, value, \\\"Address: low-level call with value failed\\\");\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but\\n * with `errorMessage` as a fallback revert reason when `target` reverts.\\n *\\n * _Available since v3.1._\\n */\\n function functionCallWithValue(\\n address target,\\n bytes memory data,\\n uint256 value,\\n string memory errorMessage\\n ) internal returns (bytes memory) {\\n require(address(this).balance >= value, \\\"Address: insufficient balance for call\\\");\\n (bool success, bytes memory returndata) = target.call{value: value}(data);\\n return verifyCallResultFromTarget(target, success, returndata, errorMessage);\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\\n * but performing a static call.\\n *\\n * _Available since v3.3._\\n */\\n function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {\\n return functionStaticCall(target, data, \\\"Address: low-level static call failed\\\");\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\\n * but performing a static call.\\n *\\n * _Available since v3.3._\\n */\\n function functionStaticCall(\\n address target,\\n bytes memory data,\\n string memory errorMessage\\n ) internal view returns (bytes memory) {\\n (bool success, bytes memory returndata) = target.staticcall(data);\\n return verifyCallResultFromTarget(target, success, returndata, errorMessage);\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\\n * but performing a delegate call.\\n *\\n * _Available since v3.4._\\n */\\n function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {\\n return functionDelegateCall(target, data, \\\"Address: low-level delegate call failed\\\");\\n }\\n\\n /**\\n * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\\n * but performing a delegate call.\\n *\\n * _Available since v3.4._\\n */\\n function functionDelegateCall(\\n address target,\\n bytes memory data,\\n string memory errorMessage\\n ) internal returns (bytes memory) {\\n (bool success, bytes memory returndata) = target.delegatecall(data);\\n return verifyCallResultFromTarget(target, success, returndata, errorMessage);\\n }\\n\\n /**\\n * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling\\n * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.\\n *\\n * _Available since v4.8._\\n */\\n function verifyCallResultFromTarget(\\n address target,\\n bool success,\\n bytes memory returndata,\\n string memory errorMessage\\n ) internal view returns (bytes memory) {\\n if (success) {\\n if (returndata.length == 0) {\\n // only check isContract if the call was successful and the return data is empty\\n // otherwise we already know that it was a contract\\n require(isContract(target), \\\"Address: call to non-contract\\\");\\n }\\n return returndata;\\n } else {\\n _revert(returndata, errorMessage);\\n }\\n }\\n\\n /**\\n * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the\\n * revert reason or using the provided one.\\n *\\n * _Available since v4.3._\\n */\\n function verifyCallResult(\\n bool success,\\n bytes memory returndata,\\n string memory errorMessage\\n ) internal pure returns (bytes memory) {\\n if (success) {\\n return returndata;\\n } else {\\n _revert(returndata, errorMessage);\\n }\\n }\\n\\n function _revert(bytes memory returndata, string memory errorMessage) private pure {\\n // Look for revert reason and bubble it up if present\\n if (returndata.length > 0) {\\n // The easiest way to bubble the revert reason is using memory via assembly\\n /// @solidity memory-safe-assembly\\n assembly {\\n let returndata_size := mload(returndata)\\n revert(add(32, returndata), returndata_size)\\n }\\n } else {\\n revert(errorMessage);\\n }\\n }\\n}\\n\"\r\n },\r\n \"node_modules/@openzeppelin/contracts-upgradeable/utils/ContextUpgradeable.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)\\n\\npragma solidity ^0.8.0;\\nimport \\\"../proxy/utils/Initializable.sol\\\";\\n\\n/**\\n * @dev Provides information about the current execution context, including the\\n * sender of the transaction and its data. While these are generally available\\n * via msg.sender and msg.data, they should not be accessed in such a direct\\n * manner, since when dealing with meta-transactions the account sending and\\n * paying for execution may not be the actual sender (as far as an application\\n * is concerned).\\n *\\n * This contract is only required for intermediate, library-like contracts.\\n */\\nabstract contract ContextUpgradeable is Initializable {\\n function __Context_init() internal onlyInitializing {\\n }\\n\\n function __Context_init_unchained() internal onlyInitializing {\\n }\\n function _msgSender() internal view virtual returns (address) {\\n return msg.sender;\\n }\\n\\n function _msgData() internal view virtual returns (bytes calldata) {\\n return msg.data;\\n }\\n\\n /**\\n * @dev This empty reserved space is put in place to allow future versions to add new\\n * variables without shifting down storage in the inheritance chain.\\n * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\\n */\\n uint256[50] private __gap;\\n}\\n\"\r\n },\r\n \"node_modules/@rari-capital/solmate/src/utils/FixedPointMathLib.sol\": {\r\n \"content\": \"// SPDX-License-Identifier: MIT\\r\\npragma solidity >=0.8.0;\\r\\n\\r\\n/// @notice Arithmetic library with operations for fixed-point numbers.\\r\\n/// @author Solmate (https://github.com/Rari-Capital/solmate/blob/main/src/utils/FixedPointMathLib.sol)\\r\\nlibrary FixedPointMathLib {\\r\\n /*//////////////////////////////////////////////////////////////\\r\\n SIMPLIFIED FIXED POINT OPERATIONS\\r\\n //////////////////////////////////////////////////////////////*/\\r\\n\\r\\n uint256 internal constant WAD = 1e18; // The scalar of ETH and most ERC20s.\\r\\n\\r\\n function mulWadDown(uint256 x, uint256 y) internal pure returns (uint256) {\\r\\n return mulDivDown(x, y, WAD); // Equivalent to (x * y) / WAD rounded down.\\r\\n }\\r\\n\\r\\n function mulWadUp(uint256 x, uint256 y) internal pure returns (uint256) {\\r\\n return mulDivUp(x, y, WAD); // Equivalent to (x * y) / WAD rounded up.\\r\\n }\\r\\n\\r\\n function divWadDown(uint256 x, uint256 y) internal pure returns (uint256) {\\r\\n return mulDivDown(x, WAD, y); // Equivalent to (x * WAD) / y rounded down.\\r\\n }\\r\\n\\r\\n function divWadUp(uint256 x, uint256 y) internal pure returns (uint256) {\\r\\n return mulDivUp(x, WAD, y); // Equivalent to (x * WAD) / y rounded up.\\r\\n }\\r\\n\\r\\n function powWad(int256 x, int256 y) internal pure returns (int256) {\\r\\n // Equivalent to x to the power of y because x ** y = (e ** ln(x)) ** y = e ** (ln(x) * y)\\r\\n return expWad((lnWad(x) * y) / int256(WAD)); // Using ln(x) means x must be greater than 0.\\r\\n }\\r\\n\\r\\n function expWad(int256 x) internal pure returns (int256 r) {\\r\\n unchecked {\\r\\n // When the result is < 0.5 we return zero. This happens when\\r\\n // x <= floor(log(0.5e18) * 1e18) ~ -42e18\\r\\n if (x <= -42139678854452767551) return 0;\\r\\n\\r\\n // When the result is > (2**255 - 1) / 1e18 we can not represent it as an\\r\\n // int. This happens when x >= floor(log((2**255 - 1) / 1e18) * 1e18) ~ 135.\\r\\n if (x >= 135305999368893231589) revert(\\\"EXP_OVERFLOW\\\");\\r\\n\\r\\n // x is now in the range (-42, 136) * 1e18. Convert to (-42, 136) * 2**96\\r\\n // for more intermediate precision and a binary basis. This base conversion\\r\\n // is a multiplication by 1e18 / 2**96 = 5**18 / 2**78.\\r\\n x = (x << 78) / 5**18;\\r\\n\\r\\n // Reduce range of x to (-½ ln 2, ½ ln 2) * 2**96 by factoring out powers\\r\\n // of two such that exp(x) = exp(x') * 2**k, where k is an integer.\\r\\n // Solving this gives k = round(x / log(2)) and x' = x - k * log(2).\\r\\n int256 k = ((x << 96) / 54916777467707473351141471128 + 2**95) >> 96;\\r\\n x = x - k * 54916777467707473351141471128;\\r\\n\\r\\n // k is in the range [-61, 195].\\r\\n\\r\\n // Evaluate using a (6, 7)-term rational approximation.\\r\\n // p is made monic, we'll multiply by a scale factor later.\\r\\n int256 y = x + 1346386616545796478920950773328;\\r\\n y = ((y * x) >> 96) + 57155421227552351082224309758442;\\r\\n int256 p = y + x - 94201549194550492254356042504812;\\r\\n p = ((p * y) >> 96) + 28719021644029726153956944680412240;\\r\\n p = p * x + (4385272521454847904659076985693276 << 96);\\r\\n\\r\\n // We leave p in 2**192 basis so we don't need to scale it back up for the division.\\r\\n int256 q = x - 2855989394907223263936484059900;\\r\\n q = ((q * x) >> 96) + 50020603652535783019961831881945;\\r\\n q = ((q * x) >> 96) - 533845033583426703283633433725380;\\r\\n q = ((q * x) >> 96) + 3604857256930695427073651918091429;\\r\\n q = ((q * x) >> 96) - 14423608567350463180887372962807573;\\r\\n q = ((q * x) >> 96) + 26449188498355588339934803723976023;\\r\\n\\r\\n assembly {\\r\\n // Div in assembly because solidity adds a zero check despite the unchecked.\\r\\n // The q polynomial won't have zeros in the domain as all its roots are complex.\\r\\n // No scaling is necessary because p is already 2**96 too large.\\r\\n r := sdiv(p, q)\\r\\n }\\r\\n\\r\\n // r should be in the range (0.09, 0.25) * 2**96.\\r\\n\\r\\n // We now need to multiply r by:\\r\\n // * the scale factor s = ~6.031367120.\\r\\n // * the 2**k factor from the range reduction.\\r\\n // * the 1e18 / 2**96 factor for base conversion.\\r\\n // We do this all at once, with an intermediate result in 2**213\\r\\n // basis, so the final right shift is always by a positive amount.\\r\\n r = int256((uint256(r) * 3822833074963236453042738258902158003155416615667) >> uint256(195 - k));\\r\\n }\\r\\n }\\r\\n\\r\\n function lnWad(int256 x) internal pure returns (int256 r) {\\r\\n unchecked {\\r\\n require(x > 0, \\\"UNDEFINED\\\");\\r\\n\\r\\n // We want to convert x from 10**18 fixed point to 2**96 fixed point.\\r\\n // We do this by multiplying by 2**96 / 10**18. But since\\r\\n // ln(x * C) = ln(x) + ln(C), we can simply do nothing here\\r\\n // and add ln(2**96 / 10**18) at the end.\\r\\n\\r\\n // Reduce range of x to (1, 2) * 2**96\\r\\n // ln(2^k * x) = k * ln(2) + ln(x)\\r\\n int256 k = int256(log2(uint256(x))) - 96;\\r\\n x <<= uint256(159 - k);\\r\\n x = int256(uint256(x) >> 159);\\r\\n\\r\\n // Evaluate using a (8, 8)-term rational approximation.\\r\\n // p is made monic, we will multiply by a scale factor later.\\r\\n int256 p = x + 3273285459638523848632254066296;\\r\\n p = ((p * x) >> 96) + 24828157081833163892658089445524;\\r\\n p = ((p * x) >> 96) + 43456485725739037958740375743393;\\r\\n p = ((p * x) >> 96) - 11111509109440967052023855526967;\\r\\n p = ((p * x) >> 96) - 45023709667254063763336534515857;\\r\\n p = ((p * x) >> 96) - 14706773417378608786704636184526;\\r\\n p = p * x - (795164235651350426258249787498 << 96);\\r\\n\\r\\n // We leave p in 2**192 basis so we don't need to scale it back up for the division.\\r\\n // q is monic by convention.\\r\\n int256 q = x + 5573035233440673466300451813936;\\r\\n q = ((q * x) >> 96) + 71694874799317883764090561454958;\\r\\n q = ((q * x) >> 96) + 283447036172924575727196451306956;\\r\\n q = ((q * x) >> 96) + 401686690394027663651624208769553;\\r\\n q = ((q * x) >> 96) + 204048457590392012362485061816622;\\r\\n q = ((q * x) >> 96) + 31853899698501571402653359427138;\\r\\n q = ((q * x) >> 96) + 909429971244387300277376558375;\\r\\n assembly {\\r\\n // Div in assembly because solidity adds a zero check despite the unchecked.\\r\\n // The q polynomial is known not to have zeros in the domain.\\r\\n // No scaling required because p is already 2**96 too large.\\r\\n r := sdiv(p, q)\\r\\n }\\r\\n\\r\\n // r is in the range (0, 0.125) * 2**96\\r\\n\\r\\n // Finalization, we need to:\\r\\n // * multiply by the scale factor s = 5.549…\\r\\n // * add ln(2**96 / 10**18)\\r\\n // * add k * ln(2)\\r\\n // * multiply by 10**18 / 2**96 = 5**18 >> 78\\r\\n\\r\\n // mul s * 5e18 * 2**96, base is now 5**18 * 2**192\\r\\n r *= 1677202110996718588342820967067443963516166;\\r\\n // add ln(2) * k * 5e18 * 2**192\\r\\n r += 16597577552685614221487285958193947469193820559219878177908093499208371 * k;\\r\\n // add ln(2**96 / 10**18) * 5e18 * 2**192\\r\\n r += 600920179829731861736702779321621459595472258049074101567377883020018308;\\r\\n // base conversion: mul 2**18 / 2**192\\r\\n r >>= 174;\\r\\n }\\r\\n }\\r\\n\\r\\n /*//////////////////////////////////////////////////////////////\\r\\n LOW LEVEL FIXED POINT OPERATIONS\\r\\n //////////////////////////////////////////////////////////////*/\\r\\n\\r\\n function mulDivDown(\\r\\n uint256 x,\\r\\n uint256 y,\\r\\n uint256 denominator\\r\\n ) internal pure returns (uint256 z) {\\r\\n assembly {\\r\\n // Store x * y in z for now.\\r\\n z := mul(x, y)\\r\\n\\r\\n // Equivalent to require(denominator != 0 && (x == 0 || (x * y) / x == y))\\r\\n if iszero(and(iszero(iszero(denominator)), or(iszero(x), eq(div(z, x), y)))) {\\r\\n revert(0, 0)\\r\\n }\\r\\n\\r\\n // Divide z by the denominator.\\r\\n z := div(z, denominator)\\r\\n }\\r\\n }\\r\\n\\r\\n function mulDivUp(\\r\\n uint256 x,\\r\\n uint256 y,\\r\\n uint256 denominator\\r\\n ) internal pure returns (uint256 z) {\\r\\n assembly {\\r\\n // Store x * y in z for now.\\r\\n z := mul(x, y)\\r\\n\\r\\n // Equivalent to require(denominator != 0 && (x == 0 || (x * y) / x == y))\\r\\n if iszero(and(iszero(iszero(denominator)), or(iszero(x), eq(div(z, x), y)))) {\\r\\n revert(0, 0)\\r\\n }\\r\\n\\r\\n // First, divide z - 1 by the denominator and add 1.\\r\\n // We allow z - 1 to underflow if z is 0, because we multiply the\\r\\n // end result by 0 if z is zero, ensuring we return 0 if z is zero.\\r\\n z := mul(iszero(iszero(z)), add(div(sub(z, 1), denominator), 1))\\r\\n }\\r\\n }\\r\\n\\r\\n function rpow(\\r\\n uint256 x,\\r\\n uint256 n,\\r\\n uint256 scalar\\r\\n ) internal pure returns (uint256 z) {\\r\\n assembly {\\r\\n switch x\\r\\n case 0 {\\r\\n switch n\\r\\n case 0 {\\r\\n // 0 ** 0 = 1\\r\\n z := scalar\\r\\n }\\r\\n default {\\r\\n // 0 ** n = 0\\r\\n z := 0\\r\\n }\\r\\n }\\r\\n default {\\r\\n switch mod(n, 2)\\r\\n case 0 {\\r\\n // If n is even, store scalar in z for now.\\r\\n z := scalar\\r\\n }\\r\\n default {\\r\\n // If n is odd, store x in z for now.\\r\\n z := x\\r\\n }\\r\\n\\r\\n // Shifting right by 1 is like dividing by 2.\\r\\n let half := shr(1, scalar)\\r\\n\\r\\n for {\\r\\n // Shift n right by 1 before looping to halve it.\\r\\n n := shr(1, n)\\r\\n } n {\\r\\n // Shift n right by 1 each iteration to halve it.\\r\\n n := shr(1, n)\\r\\n } {\\r\\n // Revert immediately if x ** 2 would overflow.\\r\\n // Equivalent to iszero(eq(div(xx, x), x)) here.\\r\\n if shr(128, x) {\\r\\n revert(0, 0)\\r\\n }\\r\\n\\r\\n // Store x squared.\\r\\n let xx := mul(x, x)\\r\\n\\r\\n // Round to the nearest number.\\r\\n let xxRound := add(xx, half)\\r\\n\\r\\n // Revert if xx + half overflowed.\\r\\n if lt(xxRound, xx) {\\r\\n revert(0, 0)\\r\\n }\\r\\n\\r\\n // Set x to scaled xxRound.\\r\\n x := div(xxRound, scalar)\\r\\n\\r\\n // If n is even:\\r\\n if mod(n, 2) {\\r\\n // Compute z * x.\\r\\n let zx := mul(z, x)\\r\\n\\r\\n // If z * x overflowed:\\r\\n if iszero(eq(div(zx, x), z)) {\\r\\n // Revert if x is non-zero.\\r\\n if iszero(iszero(x)) {\\r\\n revert(0, 0)\\r\\n }\\r\\n }\\r\\n\\r\\n // Round to the nearest number.\\r\\n let zxRound := add(zx, half)\\r\\n\\r\\n // Revert if zx + half overflowed.\\r\\n if lt(zxRound, zx) {\\r\\n revert(0, 0)\\r\\n }\\r\\n\\r\\n // Return properly scaled zxRound.\\r\\n z := div(zxRound, scalar)\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n /*//////////////////////////////////////////////////////////////\\r\\n GENERAL NUMBER UTILITIES\\r\\n //////////////////////////////////////////////////////////////*/\\r\\n\\r\\n function sqrt(uint256 x) internal pure returns (uint256 z) {\\r\\n assembly {\\r\\n let y := x // We start y at x, which will help us make our initial estimate.\\r\\n\\r\\n z := 181 // The \\\"correct\\\" value is 1, but this saves a multiplication later.\\r\\n\\r\\n // This segment is to get a reasonable initial estimate for the Babylonian method. With a bad\\r\\n // start, the correct # of bits increases ~linearly each iteration instead of ~quadratically.\\r\\n\\r\\n // We check y >= 2^(k + 8) but shift right by k bits\\r\\n // each branch to ensure that if x >= 256, then y >= 256.\\r\\n if iszero(lt(y, 0x10000000000000000000000000000000000)) {\\r\\n y := shr(128, y)\\r\\n z := shl(64, z)\\r\\n }\\r\\n if iszero(lt(y, 0x1000000000000000000)) {\\r\\n y := shr(64, y)\\r\\n z := shl(32, z)\\r\\n }\\r\\n if iszero(lt(y, 0x10000000000)) {\\r\\n y := shr(32, y)\\r\\n z := shl(16, z)\\r\\n }\\r\\n if iszero(lt(y, 0x1000000)) {\\r\\n y := shr(16, y)\\r\\n z := shl(8, z)\\r\\n }\\r\\n\\r\\n // Goal was to get z*z*y within a small factor of x. More iterations could\\r\\n // get y in a tighter range. Currently, we will have y in [256, 256*2^16).\\r\\n // We ensured y >= 256 so that the relative difference between y and y+1 is small.\\r\\n // That's not possible if x < 256 but we can just verify those cases exhaustively.\\r\\n\\r\\n // Now, z*z*y <= x < z*z*(y+1), and y <= 2^(16+8), and either y >= 256, or x < 256.\\r\\n // Correctness can be checked exhaustively for x < 256, so we assume y >= 256.\\r\\n // Then z*sqrt(y) is within sqrt(257)/sqrt(256) of sqrt(x), or about 20bps.\\r\\n\\r\\n // For s in the range [1/256, 256], the estimate f(s) = (181/1024) * (s+1) is in the range\\r\\n // (1/2.84 * sqrt(s), 2.84 * sqrt(s)), with largest error when s = 1 and when s = 256 or 1/256.\\r\\n\\r\\n // Since y is in [256, 256*2^16), let a = y/65536, so that a is in [1/256, 256). Then we can estimate\\r\\n // sqrt(y) using sqrt(65536) * 181/1024 * (a + 1) = 181/4 * (y + 65536)/65536 = 181 * (y + 65536)/2^18.\\r\\n\\r\\n // There is no overflow risk here since y < 2^136 after the first branch above.\\r\\n z := shr(18, mul(z, add(y, 65536))) // A mul() is saved from starting z at 181.\\r\\n\\r\\n // Given the worst case multiplicative error of 2.84 above, 7 iterations should be enough.\\r\\n z := shr(1, add(z, div(x, z)))\\r\\n z := shr(1, add(z, div(x, z)))\\r\\n z := shr(1, add(z, div(x, z)))\\r\\n z := shr(1, add(z, div(x, z)))\\r\\n z := shr(1, add(z, div(x, z)))\\r\\n z := shr(1, add(z, div(x, z)))\\r\\n z := shr(1, add(z, div(x, z)))\\r\\n\\r\\n // If x+1 is a perfect square, the Babylonian method cycles between\\r\\n // floor(sqrt(x)) and ceil(sqrt(x)). This statement ensures we return floor.\\r\\n // See: https://en.wikipedia.org/wiki/Integer_square_root#Using_only_integer_division\\r\\n // Since the ceil is rare, we save gas on the assignment and repeat division in the rare case.\\r\\n // If you don't care whether the floor or ceil square root is returned, you can remove this statement.\\r\\n z := sub(z, lt(div(x, z), z))\\r\\n }\\r\\n }\\r\\n\\r\\n function log2(uint256 x) internal pure returns (uint256 r) {\\r\\n require(x > 0, \\\"UNDEFINED\\\");\\r\\n\\r\\n assembly {\\r\\n r := shl(7, lt(0xffffffffffffffffffffffffffffffff, x))\\r\\n r := or(r, shl(6, lt(0xffffffffffffffff, shr(r, x))))\\r\\n r := or(r, shl(5, lt(0xffffffff, shr(r, x))))\\r\\n r := or(r, shl(4, lt(0xffff, shr(r, x))))\\r\\n r := or(r, shl(3, lt(0xff, shr(r, x))))\\r\\n r := or(r, shl(2, lt(0xf, shr(r, x))))\\r\\n r := or(r, shl(1, lt(0x3, shr(r, x))))\\r\\n r := or(r, lt(0x1, shr(r, x)))\\r\\n }\\r\\n }\\r\\n}\\r\\n\"\r\n }\r\n },\r\n \"settings\": {\r\n \"remappings\": [\r\n \"@ensdomains/=node_modules/@ensdomains/\",\r\n \"@openzeppelin/=node_modules/@openzeppelin/\",\r\n \"@openzeppelin/contracts-upgradeable/=node_modules/@openzeppelin/contracts-upgradeable/\",\r\n \"@openzeppelin/contracts/=node_modules/@openzeppelin/contracts/\",\r\n \"@rari-capital/=node_modules/@rari-capital/\",\r\n \"@rari-capital/solmate/=node_modules/@rari-capital/solmate/\",\r\n \"ds-test/=node_modules/ds-test/src/\",\r\n \"forge-std/=node_modules/forge-std/src/\",\r\n \"hardhat-deploy/=node_modules/hardhat-deploy/\",\r\n \"hardhat/=node_modules/hardhat/\"\r\n ],\r\n \"optimizer\": {\r\n \"enabled\": true,\r\n \"runs\": 10000\r\n },\r\n \"metadata\": {\r\n \"bytecodeHash\": \"none\"\r\n },\r\n \"outputSelection\": {\r\n \"*\": {\r\n \"*\": [\r\n \"evm.bytecode\",\r\n \"evm.deployedBytecode\",\r\n \"abi\"\r\n ]\r\n }\r\n },\r\n \"evmVersion\": \"london\",\r\n \"libraries\": {}\r\n }\r\n}}",
"ABI": "[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_validatorPool\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_rewardDivider\",\"type\":\"uint256\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"validator\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"l2BlockNumber\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"name\":\"Rewarded\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"value\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"address\",\"name\":\"to\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"address\",\"name\":\"from\",\"type\":\"address\"}],\"name\":\"Withdrawal\",\"type\":\"event\"},{\"inputs\":[],\"name\":\"MIN_WITHDRAWAL_AMOUNT\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"RECIPIENT\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"REWARD_DIVIDER\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"VALIDATOR_POOL\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_addr\",\"type\":\"address\"}],\"name\":\"balanceOf\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_validator\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_l2BlockNumber\",\"type\":\"uint256\"}],\"name\":\"reward\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"totalProcessed\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"totalReserved\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"version\",\"outputs\":[{\"internalType\":\"string\",\"name\":\"\",\"type\":\"string\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"withdraw\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}]",
"ContractName": "ValidatorRewardVault",
"CompilerVersion": "v0.8.15+commit.e14f2714",
"OptimizationUsed": "1",
"Runs": "10000",
"ConstructorArguments": "000000000000000000000000bc171c51d9e3e0b24aa4606824e45f93dde6e3520000000000000000000000000000000000000000000000000000000000000024",
"EVMVersion": "london",
"Library": "",
"LicenseType": "MIT",
"Proxy": "0",
"Implementation": "",
"SwarmSource": "none"
}
]
}Submits a contract source code to Xaiscan for verification.
Requires a valid Xaiscan API Key, it will be rejected otherwise
Only supports HTTP POST due to max transfer size limitations for HTTP GET
Supports up to 10 different library pairs
Contracts that use "imports" will need to have the code concatenated into one file as we do not support "imports" in separate files.
List of supported solc versions, only solc version v0.4.11 and above is supported e.g. v0.4.25+commit.59dbf8f1
Upon successful submission you will receive a GUID (50 characters) as a receipt
You may use this GUID to track the status of your submission
Verified Source Codes will be displayed at the Verified Contracts page.
//Submit Source Code for Verification
$.ajax({
type: "POST", //Only POST supported
url: "//api.xaiscan.io/api", //Set to the correct API url for Other Networks
data: {
apikey: $('#apikey').val(), //A valid API-Key is required
module: 'contract', //Do not change
action: 'verifysourcecode', //Do not change
contractaddress: $('#contractaddress').val(), //Contract Address starts with 0x...
sourceCode: $('#sourceCode').val(), //Contract Source Code (Flattened if necessary)
codeformat: $('#codeformat').val(), //solidity-single-file (default) or solidity-standard-json-input (for std-input-json-format support
contractname: $('#contractname').val(), //ContractName (if codeformat=solidity-standard-json-input, then enter contractname as ex: erc20.sol:erc20)
compilerversion: $('#compilerversion').val(), // see https://xaiscan.io/solcversions for list of support versions
optimizationUsed: $('#optimizationUsed').val(), //0 = No Optimization, 1 = Optimization used (applicable when codeformat=solidity-single-file)
runs: 200, //set to 200 as default unless otherwise (applicable when codeformat=solidity-single-file)
constructorArguements: $('#constructorArguements').val(), //if applicable
evmversion: $('#evmVersion').val(), //leave blank for compiler default, homestead, tangerineWhistle, spuriousDragon, byzantium, constantinople, petersburg, istanbul (applicable when codeformat=solidity-single-file)
licenseType: $('#licenseType').val(), //Valid codes 1-12 where 1=No License .. 12=Apache 2.0, see https://xaiscan.io/contract-license-types
libraryname1: $('#libraryname1').val(), //if applicable, a matching pair with libraryaddress1 required
libraryaddress1: $('#libraryaddress1').val(), //if applicable, a matching pair with libraryname1 required
libraryname2: $('#libraryname2').val(), //if applicable, matching pair required
libraryaddress2: $('#libraryaddress2').val(), //if applicable, matching pair required
libraryname3: $('#libraryname3').val(), //if applicable, matching pair required
libraryaddress3: $('#libraryaddress3').val(), //if applicable, matching pair required
libraryname4: $('#libraryname4').val(), //if applicable, matching pair required
libraryaddress4: $('#libraryaddress4').val(), //if applicable, matching pair required
libraryname5: $('#libraryname5').val(), //if applicable, matching pair required
libraryaddress5: $('#libraryaddress5').val(), //if applicable, matching pair required
libraryname6: $('#libraryname6').val(), //if applicable, matching pair required
libraryaddress6: $('#libraryaddress6').val(), //if applicable, matching pair required
libraryname7: $('#libraryname7').val(), //if applicable, matching pair required
libraryaddress7: $('#libraryaddress7').val(), //if applicable, matching pair required
libraryname8: $('#libraryname8').val(), //if applicable, matching pair required
libraryaddress8: $('#libraryaddress8').val(), //if applicable, matching pair required
libraryname9: $('#libraryname9').val(), //if applicable, matching pair required
libraryaddress9: $('#libraryaddress9').val(), //if applicable, matching pair required
libraryname10: $('#libraryname10').val(), //if applicable, matching pair required
libraryaddress10: $('#libraryaddress10').val() //if applicable, matching pair required
},
success: function (result) {
console.log(result);
if (result.status == "1") {
//1 = submission success, use the guid returned (result.result) to check the status of your submission.
// Average time of processing is 30-60 seconds
document.getElementById("postresult").innerHTML = result.status + ";" + result.message + ";" + result.result;
// result.result is the GUID receipt for the submission, you can use this guid for checking the verification status
} else {
//0 = error
document.getElementById("postresult").innerHTML = result.status + ";" + result.message + ";" + result.result;
}
console.log("status : " + result.status);
console.log("result : " + result.result);
},
error: function (result) {
console.log("error!");
document.getElementById("postresult").innerHTML = "Unexpected Error"
}
});//Check Source Code Verification Status
$.ajax({
type: "GET",
url: "//api.xaiscan.io/api",
data: {
apikey: $('#apikey').val(),
guid: 'ezq878u486pzijkvvmerl6a9mzwhv6sefgvqi5tkwceejc7tvn', //Replace with your Source Code GUID receipt above
module: "contract",
action: "checkverifystatus"
},
success: function (result) {
console.log("status : " + result.status); //0=Error, 1=Pass
console.log("message : " + result.message); //OK, NOTOK
console.log("result : " + result.result); //result explanation
$('#guidstatus').html(">> " + result.result);
},
error: function (result) {
alert('error');
}
});Submits a proxy contract source code to Xaiscan for verification.
Requires a valid Xaiscan API key, it will be rejected otherwise
Current daily limit of 100 submissions per day per user (subject to change)
Only supports HTTP post
Upon successful submission you will receive a GUID (50 characters) as a receipt
You may use this GUID to track the status of your submission
Verified proxy contracts will display the "Read/Write as Proxy" of the implementation contract under the contract address's contract tab
// example with only the mandatory contract address parameter
curl -d "address=0xcbdcd3815b5f975e1a2c944a9b2cd1c985a1cb7f" "https://api.xaiscan.io/api?module=contract&action=verifyproxycontract&apikey=YourApiKeyToken"
// example using the expectedimplementation optional parameter
// the expectedimplementation enforces a check to ensure the returned implementation contract address == address picked up by the verifier
curl -d "address=0xbc46363a7669f6e12353fa95bb067aead3675c29&expectedimplementation=0xe45a5176bc0f2c1198e2451c4e4501d4ed9b65a6" "https://api.xaiscan.io/api?module=contract&action=verifyproxycontract&apikey=YourApiKeyToken"// OK
{"status":"1","message":"OK","result":"gwgrrnfy56zf6vc1fljuejwg6pelnc5yns6fg6y2i6zfpgzquz"}
// NOTOK
{"status":"0","message":"NOTOK","result":"Invalid API Key"}curl "https://api.xaiscan.io/api?module=contract&action=checkproxyverification&guid=gwgrrnfy56zf6vc1fljuejwg6pelnc5yns6fg6y2i6zfpgzquz&apikey=YourApiKeyToken"// OK
{"status":"1","message":"OK","result":"The proxy's (0xbc46363a7669f6e12353fa95bb067aead3675c29) implementation contract is found at 0xe45a5176bc0f2c1198e2451c4e4501d4ed9b65a6 and is successfully updated."}
// NOTOK
{"status":"0","message":"NOTOK","result":"A corresponding implementation contract was unfortunately not detected for the proxy address."}Tip : You can also download a CSV list of verified contracts addresses of which the code publishers have provided a corresponding Open Source license for redistribution.
Try this endpoint in your browser
| Parameter | Description |
|---|---|
Note : This endpoint is limited to 100 verifications/day, regardless of API PRO tier.
Note: Upon successful submission, a GUID is returned, which can be used to check for submission status.
address
the contract address that has a verified source code
address
the contract address that has a verified source code