Contract 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 11

Txn Hash Method
Block
From
To
Value [Txn Fee]
0x04d61adc6a5d783d249657f22e23697492d2f4c209e5aa9820628ab07d93c978Bridge To242221492024-02-24 13:24:049 hrs ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.06 CELO0.00496327
0x653547c525bd3fd33ebcfd66497db08ed20c521286db34a629836102b0546c5aBridge To242220032024-02-24 13:11:549 hrs 12 mins ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.06 CELO0.00496327
0x063282511ad11ebcd7d708e652b952755a276192cd52b76c0742a7f50b5e24cbBridge To241932212024-02-22 21:13:052 days 1 hr ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.4 CELO0.00496327
0xe2853a8027a0b83d1849f8a9a927a57200ffd47c690c02706746c6ff8320450cBridge To With L...239298602024-02-07 15:22:4217 days 7 hrs ago0x6ae2549301bf56198a22d814e921ba3e2acd1d5c IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.057772963197254 CELO0.00972428
0x80d356c50e11cfd1b472610cb59cf2912486e45d9485fe57f207366f8ae61d0bBridge To238058512024-01-31 11:06:3124 days 11 hrs ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.4 CELO0.00496339
0x6917e9946ccba22a2690edb89b6802aefce70870b8017fc226ce3e23361a6312Bridge To237475802024-01-28 2:09:5427 days 20 hrs ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.4 CELO0.00496327
0x731c4977e2e884cbc463d5dda332216a140771e678a18d7c3bb8fe0f25396017Bridge To237000302024-01-25 8:06:5730 days 14 hrs ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.4 CELO0.00496238
0x78379dae77193b0d173cdde74d5ba79c40ddbd00371bd6abcdeb5d6b41565545Bridge To With L...235526292024-01-16 19:22:4639 days 3 hrs ago0x6ae2549301bf56198a22d814e921ba3e2acd1d5c IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.05204852548638 CELO0.00807602
0xa6d8fa7c328cc9a8d2a11597e34ba8c9adb88c95c04d3c0d258559ae5035e90dBridge To With L...234874702024-01-13 0:52:4242 days 21 hrs ago0x6ae2549301bf56198a22d814e921ba3e2acd1d5c IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.05207867960789 CELO0.00807602
0x162d2a5963451fb36c4b47c72cf5ae09f0626787c3b9f548406207f6cc64aef2Bridge To234862962024-01-12 23:14:5242 days 23 hrs ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.4 CELO0.00413914
0x6e677ba3f6593f4f6888d92aed337c33480816ca051dd2eeb3745f26ed029785Bridge To234861302024-01-12 23:01:0242 days 23 hrs ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.5 CELO0.00413914
0xc1bf2ac62d3480cc3d02a8d3c912968c828d1726fac501bb4d8a3b3399b6efaeBridge To234860032024-01-12 22:50:2742 days 23 hrs ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.5 CELO0.00413914
0x6c1b6ca4b24a327142419c0495f5cc5deb295baeee6797ff8744633bb67d7d97Bridge To With L...234561522024-01-11 5:22:4244 days 17 hrs ago0x6ae2549301bf56198a22d814e921ba3e2acd1d5c IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.057833044821403 CELO0.00807602
0x4d325509fed78917d5d0c0dc1b3f28f4369c64b9b36cff54600f90af4431c95fBridge To234254212024-01-09 10:39:3446 days 11 hrs ago0xd974caeea1c097647d6fc299bb5d66fdd06241d8 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.5 CELO0.00418714
0x1e3f88ae9e98233af9b4cf0afaa411dd8861d055fdd20f5de772aa188143454aBridge To234250332024-01-09 10:07:1446 days 12 hrs ago0xd974caeea1c097647d6fc299bb5d66fdd06241d8 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.5 CELO0.00413914
0x8a37652e201d19615bb0b4ae291aef890f6ce75cbbee88c999db4e77e5ddb804Bridge To234247532024-01-09 9:43:5446 days 12 hrs ago0xd974caeea1c097647d6fc299bb5d66fdd06241d8 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.5 CELO0.00413914
0xc9adb8632d5356bcafbbea70658b7f635edca16464f864b77de0e4e15586a6aeBridge To With L...233485412024-01-04 23:52:4450 days 22 hrs ago0x6ae2549301bf56198a22d814e921ba3e2acd1d5c IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.052056376153425 CELO0.00807602
0x1e699c5a186586f44f8309b6349b306bfff5f577c0eca6403d3abf7a168bf4bcBridge To233453302024-01-04 19:25:0851 days 2 hrs ago0x56e04d6469a063f0b16d0d5abcc7aa2c65f07f32 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.5 CELO0.00413914
0xf54b29c56c6ca537de8ca20c6a547182145bbb9ccf44321b7c51ced50a4220d7Bridge To233451412024-01-04 19:09:2351 days 3 hrs ago0x56e04d6469a063f0b16d0d5abcc7aa2c65f07f32 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.5 CELO0.00413914
0x1384d37d08f948d9cb579008525acaeb24683ff88a12b14c7cdc5dc7b2471116Bridge To233448962024-01-04 18:48:5851 days 3 hrs ago0x56e04d6469a063f0b16d0d5abcc7aa2c65f07f32 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.5 CELO0.00413914
0xd3bd161630cdb39472308ccf2aae3e02512e5fc973e6e934e7647fd6da2f61c2Bridge To232943752024-01-01 20:38:4654 days 1 hr ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.5 CELO0.00413926
0x6adf12a8eee684e576c0b5a6807828e374b9d7ae49ef899d3192c6f0924aae25Bridge To232420292023-12-29 19:56:2957 days 2 hrs ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a51 CELO0.00418702
0xa0282f5b94058cde4dde8f271adcef01dfec624f52dfcb61aff7e763e7e0827bBridge To232411362023-12-29 18:42:0457 days 3 hrs ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a51 CELO0.00418714
0x987cf96a2a0f474c52b44d9ba71ac97e55b420135fef454047de25848ee0ad95Bridge To232410042023-12-29 18:31:0457 days 3 hrs ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a51 CELO0.00418702
0x81ee6995679c978fbdb2c821254a45a9107933e8dd79697b3d31a0c2cb5f372bBridge To232409042023-12-29 18:22:4457 days 4 hrs ago0x0ddea61a8a29578f2b90915db57b1b50bfc472c0 IN 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50 CELO0.00200882
[ Download CSV Export 
Latest 25 internal transaction
Parent Txn Hash Block From To Value
0x04d61adc6a5d783d249657f22e23697492d2f4c209e5aa9820628ab07d93c978242221492024-02-24 13:24:049 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.06 CELO
0x653547c525bd3fd33ebcfd66497db08ed20c521286db34a629836102b0546c5a242220032024-02-24 13:11:549 hrs 12 mins ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.06 CELO
0x063282511ad11ebcd7d708e652b952755a276192cd52b76c0742a7f50b5e24cb241932212024-02-22 21:13:052 days 1 hr ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.4 CELO
0xd1c26da76ab70ef3fe03766aa0536fa11e001d2282d4f2da5563f58066751ac6240838212024-02-16 13:15:458 days 9 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.1 CELO
0xd1c26da76ab70ef3fe03766aa0536fa11e001d2282d4f2da5563f58066751ac6240838212024-02-16 13:15:458 days 9 hrs ago 0x4e31993d9f13f940828bf9ec2f643a7e55b21e8c0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a50.1 CELO
0xe2853a8027a0b83d1849f8a9a927a57200ffd47c690c02706746c6ff8320450c239298602024-02-07 15:22:4217 days 7 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.057772963197254964 CELO
0x80d356c50e11cfd1b472610cb59cf2912486e45d9485fe57f207366f8ae61d0b238058512024-01-31 11:06:3124 days 11 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.4 CELO
0x6917e9946ccba22a2690edb89b6802aefce70870b8017fc226ce3e23361a6312237475802024-01-28 2:09:5427 days 20 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.4 CELO
0x731c4977e2e884cbc463d5dda332216a140771e678a18d7c3bb8fe0f25396017237000302024-01-25 8:06:5730 days 14 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.4 CELO
0x78379dae77193b0d173cdde74d5ba79c40ddbd00371bd6abcdeb5d6b41565545235526292024-01-16 19:22:4639 days 3 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.052048525486380728 CELO
0xa6d8fa7c328cc9a8d2a11597e34ba8c9adb88c95c04d3c0d258559ae5035e90d234874702024-01-13 0:52:4242 days 21 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.052078679607890559 CELO
0x162d2a5963451fb36c4b47c72cf5ae09f0626787c3b9f548406207f6cc64aef2234862962024-01-12 23:14:5242 days 23 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.4 CELO
0x6e677ba3f6593f4f6888d92aed337c33480816ca051dd2eeb3745f26ed029785234861302024-01-12 23:01:0242 days 23 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.5 CELO
0xc1bf2ac62d3480cc3d02a8d3c912968c828d1726fac501bb4d8a3b3399b6efae234860032024-01-12 22:50:2742 days 23 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.5 CELO
0x6c1b6ca4b24a327142419c0495f5cc5deb295baeee6797ff8744633bb67d7d97234561522024-01-11 5:22:4244 days 17 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.057833044821403223 CELO
0x4d325509fed78917d5d0c0dc1b3f28f4369c64b9b36cff54600f90af4431c95f234254212024-01-09 10:39:3446 days 11 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.5 CELO
0x1e3f88ae9e98233af9b4cf0afaa411dd8861d055fdd20f5de772aa188143454a234250332024-01-09 10:07:1446 days 12 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.5 CELO
0x8a37652e201d19615bb0b4ae291aef890f6ce75cbbee88c999db4e77e5ddb804234247532024-01-09 9:43:5446 days 12 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.5 CELO
0xc9adb8632d5356bcafbbea70658b7f635edca16464f864b77de0e4e15586a6ae233485412024-01-04 23:52:4450 days 22 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.052056376153425358 CELO
0x1e699c5a186586f44f8309b6349b306bfff5f577c0eca6403d3abf7a168bf4bc233453302024-01-04 19:25:0851 days 2 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.5 CELO
0xf54b29c56c6ca537de8ca20c6a547182145bbb9ccf44321b7c51ced50a4220d7233451412024-01-04 19:09:2351 days 3 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.5 CELO
0x1384d37d08f948d9cb579008525acaeb24683ff88a12b14c7cdc5dc7b2471116233448962024-01-04 18:48:5851 days 3 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.5 CELO
0xd3bd161630cdb39472308ccf2aae3e02512e5fc973e6e934e7647fd6da2f61c2232943752024-01-01 20:38:4654 days 1 hr ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint0.5 CELO
0x6adf12a8eee684e576c0b5a6807828e374b9d7ae49ef899d3192c6f0924aae25232420292023-12-29 19:56:2957 days 2 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint1 CELO
0xa0282f5b94058cde4dde8f271adcef01dfec624f52dfcb61aff7e763e7e0827b232411362023-12-29 18:42:0457 days 3 hrs ago 0xa3247276dbcc76dd7705273f766eb3e8a5ecf4a5 LayerZero: Celo Endpoint1 CELO
[ Download CSV Export 
Index Block
Loading

Similar Match Source Code
This contract matches the deployed Bytecode of the Source Code for Contract 0xD77Ace8A2b38811Ec1f04e098390b583b9354Db7
The constructor portion of the code might be different and could alter the actual behaviour of the contract

Contract Name:
ERC1967Proxy

Compiler Version
v0.8.10+commit.fc410830

Optimization Enabled:
Yes with 0 runs

Other Settings:
default evmVersion, MIT license
File 1 of 10 : ProxyFactory1967.sol
// SPDX-License-Identifier: MIT

pragma solidity >=0.8;

import "@openzeppelin/contracts/proxy/Proxy.sol";
import "@openzeppelin/contracts/proxy/ERC1967/ERC1967Upgrade.sol";
import "@openzeppelin/contracts/utils/cryptography/ECDSA.sol";

contract ERC1967Proxy is Proxy, ERC1967Upgrade {
	/**
	 * @dev Initializes the upgradeable proxy with an initial implementation specified by `_logic`.
	 *
	 * If `_data` is nonempty, it's used as data in a delegate call to `_logic`. This will typically be an encoded
	 * function call, and allows initializating the storage of the proxy like a Solidity constructor.
	 */
	function initialize(address _logic, bytes calldata _data) external payable {
		require(_getImplementation() == address(0), "initialized");
		assert(
			_IMPLEMENTATION_SLOT ==
				bytes32(uint256(keccak256("eip1967.proxy.implementation")) - 1)
		);
		_upgradeToAndCall(_logic, _data, false);
	}

	/**
	 * @dev Returns the current implementation address.
	 */
	function _implementation()
		internal
		view
		virtual
		override
		returns (address impl)
	{
		return ERC1967Upgrade._getImplementation();
	}
}

contract ProxyFactory1967 {
	event ProxyCreated(address proxy);
	event ContractCreated(address addr);

	bytes32 private contractCodeHash;

	constructor() {
		contractCodeHash = keccak256(type(ERC1967Proxy).creationCode);
	}

	function deployMinimal(address _logic, bytes memory _data)
		public
		returns (address proxy)
	{
		// Adapted from https://github.com/optionality/clone-factory/blob/32782f82dfc5a00d103a7e61a17a5dedbd1e8e9d/contracts/CloneFactory.sol
		bytes20 targetBytes = bytes20(_logic);
		assembly {
			let clone := mload(0x40)
			mstore(
				clone,
				0x3d602d80600a3d3981f3363d3d373d3d3d363d73000000000000000000000000
			)
			mstore(add(clone, 0x14), targetBytes)
			mstore(
				add(clone, 0x28),
				0x5af43d82803e903d91602b57fd5bf30000000000000000000000000000000000
			)
			proxy := create(0, clone, 0x37)
		}

		emit ProxyCreated(address(proxy));

		if (_data.length > 0) {
			(bool success, ) = proxy.call(_data);
			require(success);
		}
	}

	function deployProxy(
		uint256 _salt,
		address _logic,
		bytes memory _data
	) public returns (address) {
		return _deployProxy(_salt, _logic, _data, msg.sender);
	}

	function deployCode(uint256 _salt, bytes calldata _bytecode)
		external
		returns (address)
	{
		address addr = _deployCode(_salt, msg.sender, _bytecode);
		emit ContractCreated(addr);
		return addr;
	}

	function getDeploymentAddress(uint256 _salt, address _sender)
		public
		view
		returns (address)
	{
		return getDeploymentAddress(_salt, _sender, contractCodeHash);
	}

	function getDeploymentAddress(
		uint256 _salt,
		address _sender,
		bytes32 _contractCodeHash
	) public view returns (address) {
		// Adapted from https://github.com/archanova/solidity/blob/08f8f6bedc6e71c24758d20219b7d0749d75919d/contracts/contractCreator/ContractCreator.sol
		bytes32 salt = _getSalt(_salt, _sender);
		bytes32 rawAddress = keccak256(
			abi.encodePacked(bytes1(0xff), address(this), salt, _contractCodeHash)
		);

		return address(bytes20(rawAddress << 96));
	}

	function _deployProxy(
		uint256 _salt,
		address _logic,
		bytes memory _data,
		address _sender
	) internal returns (address) {
		bytes memory code = type(ERC1967Proxy).creationCode;

		address payable addr = _deployCode(_salt, _sender, code);

		ERC1967Proxy proxy = ERC1967Proxy(addr);

		proxy.initialize(_logic, _data);
		emit ProxyCreated(address(proxy));
		return address(proxy);
	}

	function _deployCode(
		uint256 _salt,
		address _sender,
		bytes memory _code
	) internal returns (address payable) {
		address payable addr;
		bytes32 salt = _getSalt(_salt, _sender);
		assembly {
			addr := create2(0, add(_code, 0x20), mload(_code), salt)
			if iszero(extcodesize(addr)) {
				revert(0, 0)
			}
		}
		return addr;
	}

	function _getSalt(uint256 _salt, address _sender)
		internal
		pure
		returns (bytes32)
	{
		return keccak256(abi.encodePacked(_salt, _sender));
	}
}

File 2 of 10 : draft-IERC1822.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.5.0) (interfaces/draft-IERC1822.sol)

pragma solidity ^0.8.0;

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

File 3 of 10 : ERC1967Upgrade.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.5.0) (proxy/ERC1967/ERC1967Upgrade.sol)

pragma solidity ^0.8.2;

import "../beacon/IBeacon.sol";
import "../../interfaces/draft-IERC1822.sol";
import "../../utils/Address.sol";
import "../../utils/StorageSlot.sol";

/**
 * @dev This abstract contract provides getters and event emitting update functions for
 * https://eips.ethereum.org/EIPS/eip-1967[EIP1967] slots.
 *
 * _Available since v4.1._
 *
 * @custom:oz-upgrades-unsafe-allow delegatecall
 */
abstract contract ERC1967Upgrade {
    // This is the keccak-256 hash of "eip1967.proxy.rollback" subtracted by 1
    bytes32 private constant _ROLLBACK_SLOT = 0x4910fdfa16fed3260ed0e7147f7cc6da11a60208b5b9406d12a635614ffd9143;

    /**
     * @dev Storage slot with the address of the current implementation.
     * This is the keccak-256 hash of "eip1967.proxy.implementation" subtracted by 1, and is
     * validated in the constructor.
     */
    bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;

    /**
     * @dev Emitted when the implementation is upgraded.
     */
    event Upgraded(address indexed implementation);

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

    /**
     * @dev Stores a new address in the EIP1967 implementation slot.
     */
    function _setImplementation(address newImplementation) private {
        require(Address.isContract(newImplementation), "ERC1967: new implementation is not a contract");
        StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;
    }

    /**
     * @dev Perform implementation upgrade
     *
     * Emits an {Upgraded} event.
     */
    function _upgradeTo(address newImplementation) internal {
        _setImplementation(newImplementation);
        emit Upgraded(newImplementation);
    }

    /**
     * @dev Perform implementation upgrade with additional setup call.
     *
     * Emits an {Upgraded} event.
     */
    function _upgradeToAndCall(
        address newImplementation,
        bytes memory data,
        bool forceCall
    ) internal {
        _upgradeTo(newImplementation);
        if (data.length > 0 || forceCall) {
            Address.functionDelegateCall(newImplementation, data);
        }
    }

    /**
     * @dev Perform implementation upgrade with security checks for UUPS proxies, and additional setup call.
     *
     * Emits an {Upgraded} event.
     */
    function _upgradeToAndCallUUPS(
        address newImplementation,
        bytes memory data,
        bool forceCall
    ) internal {
        // Upgrades from old implementations will perform a rollback test. This test requires the new
        // implementation to upgrade back to the old, non-ERC1822 compliant, implementation. Removing
        // this special case will break upgrade paths from old UUPS implementation to new ones.
        if (StorageSlot.getBooleanSlot(_ROLLBACK_SLOT).value) {
            _setImplementation(newImplementation);
        } else {
            try IERC1822Proxiable(newImplementation).proxiableUUID() returns (bytes32 slot) {
                require(slot == _IMPLEMENTATION_SLOT, "ERC1967Upgrade: unsupported proxiableUUID");
            } catch {
                revert("ERC1967Upgrade: new implementation is not UUPS");
            }
            _upgradeToAndCall(newImplementation, data, forceCall);
        }
    }

    /**
     * @dev Storage slot with the admin of the contract.
     * This is the keccak-256 hash of "eip1967.proxy.admin" subtracted by 1, and is
     * validated in the constructor.
     */
    bytes32 internal constant _ADMIN_SLOT = 0xb53127684a568b3173ae13b9f8a6016e243e63b6e8ee1178d6a717850b5d6103;

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

    /**
     * @dev Returns the current admin.
     */
    function _getAdmin() internal view returns (address) {
        return StorageSlot.getAddressSlot(_ADMIN_SLOT).value;
    }

    /**
     * @dev Stores a new address in the EIP1967 admin slot.
     */
    function _setAdmin(address newAdmin) private {
        require(newAdmin != address(0), "ERC1967: new admin is the zero address");
        StorageSlot.getAddressSlot(_ADMIN_SLOT).value = newAdmin;
    }

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

    /**
     * @dev The storage slot of the UpgradeableBeacon contract which defines the implementation for this proxy.
     * This is bytes32(uint256(keccak256('eip1967.proxy.beacon')) - 1)) and is validated in the constructor.
     */
    bytes32 internal constant _BEACON_SLOT = 0xa3f0ad74e5423aebfd80d3ef4346578335a9a72aeaee59ff6cb3582b35133d50;

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

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

    /**
     * @dev Stores a new beacon in the EIP1967 beacon slot.
     */
    function _setBeacon(address newBeacon) private {
        require(Address.isContract(newBeacon), "ERC1967: new beacon is not a contract");
        require(
            Address.isContract(IBeacon(newBeacon).implementation()),
            "ERC1967: beacon implementation is not a contract"
        );
        StorageSlot.getAddressSlot(_BEACON_SLOT).value = newBeacon;
    }

    /**
     * @dev Perform beacon upgrade with additional setup call. Note: This upgrades the address of the beacon, it does
     * not upgrade the implementation contained in the beacon (see {UpgradeableBeacon-_setImplementation} for that).
     *
     * Emits a {BeaconUpgraded} event.
     */
    function _upgradeBeaconToAndCall(
        address newBeacon,
        bytes memory data,
        bool forceCall
    ) internal {
        _setBeacon(newBeacon);
        emit BeaconUpgraded(newBeacon);
        if (data.length > 0 || forceCall) {
            Address.functionDelegateCall(IBeacon(newBeacon).implementation(), data);
        }
    }
}

File 4 of 10 : Proxy.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.6.0) (proxy/Proxy.sol)

pragma solidity ^0.8.0;

/**
 * @dev This abstract contract provides a fallback function that delegates all calls to another contract using the EVM
 * instruction `delegatecall`. We refer to the second contract as the _implementation_ behind the proxy, and it has to
 * be specified by overriding the virtual {_implementation} function.
 *
 * Additionally, delegation to the implementation can be triggered manually through the {_fallback} function, or to a
 * different contract through the {_delegate} function.
 *
 * The success and return data of the delegated call will be returned back to the caller of the proxy.
 */
abstract contract Proxy {
    /**
     * @dev Delegates the current call to `implementation`.
     *
     * This function does not return to its internal call site, it will return directly to the external caller.
     */
    function _delegate(address implementation) internal virtual {
        assembly {
            // Copy msg.data. We take full control of memory in this inline assembly
            // block because it will not return to Solidity code. We overwrite the
            // Solidity scratch pad at memory position 0.
            calldatacopy(0, 0, calldatasize())

            // Call the implementation.
            // out and outsize are 0 because we don't know the size yet.
            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)

            // Copy the returned data.
            returndatacopy(0, 0, returndatasize())

            switch result
            // delegatecall returns 0 on error.
            case 0 {
                revert(0, returndatasize())
            }
            default {
                return(0, returndatasize())
            }
        }
    }

    /**
     * @dev This is a virtual function that should be overridden so it returns the address to which the fallback function
     * and {_fallback} should delegate.
     */
    function _implementation() internal view virtual returns (address);

    /**
     * @dev Delegates the current call to the address returned by `_implementation()`.
     *
     * This function does not return to its internal call site, it will return directly to the external caller.
     */
    function _fallback() internal virtual {
        _beforeFallback();
        _delegate(_implementation());
    }

    /**
     * @dev Fallback function that delegates calls to the address returned by `_implementation()`. Will run if no other
     * function in the contract matches the call data.
     */
    fallback() external payable virtual {
        _fallback();
    }

    /**
     * @dev Fallback function that delegates calls to the address returned by `_implementation()`. Will run if call data
     * is empty.
     */
    receive() external payable virtual {
        _fallback();
    }

    /**
     * @dev Hook that is called before falling back to the implementation. Can happen as part of a manual `_fallback`
     * call, or as part of the Solidity `fallback` or `receive` functions.
     *
     * If overridden should call `super._beforeFallback()`.
     */
    function _beforeFallback() internal virtual {}
}

File 5 of 10 : IBeacon.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (proxy/beacon/IBeacon.sol)

pragma solidity ^0.8.0;

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

File 6 of 10 : Address.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/Address.sol)

pragma solidity ^0.8.1;

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev Returns true if `account` is a contract.
     *
     * [IMPORTANT]
     * ====
     * It is unsafe to assume that an address for which this function returns
     * false is an externally-owned account (EOA) and not a contract.
     *
     * Among others, `isContract` will return false for the following
     * types of addresses:
     *
     *  - an externally-owned account
     *  - a contract in construction
     *  - an address where a contract will be created
     *  - an address where a contract lived, but was destroyed
     * ====
     *
     * [IMPORTANT]
     * ====
     * You shouldn't rely on `isContract` to protect against flash loan attacks!
     *
     * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets
     * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract
     * constructor.
     * ====
     */
    function isContract(address account) internal view returns (bool) {
        // This method relies on extcodesize/address.code.length, which returns 0
        // for contracts in construction, since the code is only stored at the end
        // of the constructor execution.

        return account.code.length > 0;
    }

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

        (bool success, ) = recipient.call{value: amount}("");
        require(success, "Address: unable to send value, recipient may have reverted");
    }

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

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with
     * `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but also transferring `value` wei to `target`.
     *
     * Requirements:
     *
     * - the calling contract must have an ETH balance of at least `value`.
     * - the called Solidity function must be `payable`.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, value, "Address: low-level call with value failed");
    }

    /**
     * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but
     * with `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value,
        string memory errorMessage
    ) internal returns (bytes memory) {
        require(address(this).balance >= value, "Address: insufficient balance for call");
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
        return functionStaticCall(target, data, "Address: low-level static call failed");
    }

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

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionDelegateCall(target, data, "Address: low-level delegate call failed");
    }

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

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling
     * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.
     *
     * _Available since v4.8._
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        if (success) {
            if (returndata.length == 0) {
                // only check isContract if the call was successful and the return data is empty
                // otherwise we already know that it was a contract
                require(isContract(target), "Address: call to non-contract");
            }
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the
     * revert reason or using the provided one.
     *
     * _Available since v4.3._
     */
    function verifyCallResult(
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal pure returns (bytes memory) {
        if (success) {
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

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

File 7 of 10 : StorageSlot.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.7.0) (utils/StorageSlot.sol)

pragma solidity ^0.8.0;

/**
 * @dev Library for reading and writing primitive types to specific storage slots.
 *
 * Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.
 * This library helps with reading and writing to such slots without the need for inline assembly.
 *
 * The functions in this library return Slot structs that contain a `value` member that can be used to read or write.
 *
 * Example usage to set ERC1967 implementation slot:
 * ```
 * contract ERC1967 {
 *     bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;
 *
 *     function _getImplementation() internal view returns (address) {
 *         return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;
 *     }
 *
 *     function _setImplementation(address newImplementation) internal {
 *         require(Address.isContract(newImplementation), "ERC1967: new implementation is not a contract");
 *         StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;
 *     }
 * }
 * ```
 *
 * _Available since v4.1 for `address`, `bool`, `bytes32`, and `uint256`._
 */
library StorageSlot {
    struct AddressSlot {
        address value;
    }

    struct BooleanSlot {
        bool value;
    }

    struct Bytes32Slot {
        bytes32 value;
    }

    struct Uint256Slot {
        uint256 value;
    }

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

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

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

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

File 8 of 10 : Strings.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/Strings.sol)

pragma solidity ^0.8.0;

import "./math/Math.sol";

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

    /**
     * @dev Converts a `uint256` to its ASCII `string` decimal representation.
     */
    function toString(uint256 value) internal pure returns (string memory) {
        unchecked {
            uint256 length = Math.log10(value) + 1;
            string memory buffer = new string(length);
            uint256 ptr;
            /// @solidity memory-safe-assembly
            assembly {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                /// @solidity memory-safe-assembly
                assembly {
                    mstore8(ptr, byte(mod(value, 10), _SYMBOLS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
     */
    function toHexString(uint256 value) internal pure returns (string memory) {
        unchecked {
            return toHexString(value, Math.log256(value) + 1);
        }
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
     */
    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
        bytes memory buffer = new bytes(2 * length + 2);
        buffer[0] = "0";
        buffer[1] = "x";
        for (uint256 i = 2 * length + 1; i > 1; --i) {
            buffer[i] = _SYMBOLS[value & 0xf];
            value >>= 4;
        }
        require(value == 0, "Strings: hex length insufficient");
        return string(buffer);
    }

    /**
     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation.
     */
    function toHexString(address addr) internal pure returns (string memory) {
        return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH);
    }
}

File 9 of 10 : ECDSA.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/cryptography/ECDSA.sol)

pragma solidity ^0.8.0;

import "../Strings.sol";

/**
 * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.
 *
 * These functions can be used to verify that a message was signed by the holder
 * of the private keys of a given address.
 */
library ECDSA {
    enum RecoverError {
        NoError,
        InvalidSignature,
        InvalidSignatureLength,
        InvalidSignatureS,
        InvalidSignatureV // Deprecated in v4.8
    }

    function _throwError(RecoverError error) private pure {
        if (error == RecoverError.NoError) {
            return; // no error: do nothing
        } else if (error == RecoverError.InvalidSignature) {
            revert("ECDSA: invalid signature");
        } else if (error == RecoverError.InvalidSignatureLength) {
            revert("ECDSA: invalid signature length");
        } else if (error == RecoverError.InvalidSignatureS) {
            revert("ECDSA: invalid signature 's' value");
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature` or error string. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {toEthSignedMessageHash} on it.
     *
     * Documentation for signature generation:
     * - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]
     * - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]
     *
     * _Available since v4.3._
     */
    function tryRecover(bytes32 hash, bytes memory signature) internal pure returns (address, RecoverError) {
        if (signature.length == 65) {
            bytes32 r;
            bytes32 s;
            uint8 v;
            // ecrecover takes the signature parameters, and the only way to get them
            // currently is to use assembly.
            /// @solidity memory-safe-assembly
            assembly {
                r := mload(add(signature, 0x20))
                s := mload(add(signature, 0x40))
                v := byte(0, mload(add(signature, 0x60)))
            }
            return tryRecover(hash, v, r, s);
        } else {
            return (address(0), RecoverError.InvalidSignatureLength);
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature`. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {toEthSignedMessageHash} on it.
     */
    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, signature);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
     *
     * See https://eips.ethereum.org/EIPS/eip-2098[EIP-2098 short signatures]
     *
     * _Available since v4.3._
     */
    function tryRecover(
        bytes32 hash,
        bytes32 r,
        bytes32 vs
    ) internal pure returns (address, RecoverError) {
        bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
        uint8 v = uint8((uint256(vs) >> 255) + 27);
        return tryRecover(hash, v, r, s);
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `r and `vs` short-signature fields separately.
     *
     * _Available since v4.2._
     */
    function recover(
        bytes32 hash,
        bytes32 r,
        bytes32 vs
    ) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, r, vs);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `v`,
     * `r` and `s` signature fields separately.
     *
     * _Available since v4.3._
     */
    function tryRecover(
        bytes32 hash,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal pure returns (address, RecoverError) {
        // EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature
        // unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines
        // the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most
        // signatures from current libraries generate a unique signature with an s-value in the lower half order.
        //
        // If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value
        // with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or
        // vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept
        // these malleable signatures as well.
        if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {
            return (address(0), RecoverError.InvalidSignatureS);
        }

        // If the signature is valid (and not malleable), return the signer address
        address signer = ecrecover(hash, v, r, s);
        if (signer == address(0)) {
            return (address(0), RecoverError.InvalidSignature);
        }

        return (signer, RecoverError.NoError);
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `v`,
     * `r` and `s` signature fields separately.
     */
    function recover(
        bytes32 hash,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, v, r, s);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Returns an Ethereum Signed Message, created from a `hash`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes32 hash) internal pure returns (bytes32) {
        // 32 is the length in bytes of hash,
        // enforced by the type signature above
        return keccak256(abi.encodePacked("\x19Ethereum Signed Message:\n32", hash));
    }

    /**
     * @dev Returns an Ethereum Signed Message, created from `s`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes memory s) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19Ethereum Signed Message:\n", Strings.toString(s.length), s));
    }

    /**
     * @dev Returns an Ethereum Signed Typed Data, created from a
     * `domainSeparator` and a `structHash`. This produces hash corresponding
     * to the one signed with the
     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`]
     * JSON-RPC method as part of EIP-712.
     *
     * See {recover}.
     */
    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19\x01", domainSeparator, structHash));
    }
}

File 10 of 10 : Math.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/math/Math.sol)

pragma solidity ^0.8.0;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Down, // Toward negative infinity
        Up, // Toward infinity
        Zero // Toward zero
    }

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

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return a < b ? a : b;
    }

    /**
     * @dev Returns the average of two numbers. The result is rounded towards
     * zero.
     */
    function average(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b) / 2 can overflow.
        return (a & b) + (a ^ b) / 2;
    }

    /**
     * @dev Returns the ceiling of the division of two numbers.
     *
     * This differs from standard division with `/` in that it rounds up instead
     * of rounding down.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b - 1) / b can overflow on addition, so we distribute.
        return a == 0 ? 0 : (a - 1) / b + 1;
    }

    /**
     * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0
     * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv)
     * with further edits by Uniswap Labs also under MIT license.
     */
    function mulDiv(
        uint256 x,
        uint256 y,
        uint256 denominator
    ) internal pure returns (uint256 result) {
        unchecked {
            // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use
            // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2^256 + prod0.
            uint256 prod0; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod0 := mul(x, y)
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                return prod0 / denominator;
            }

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            require(denominator > prod1);

            ///////////////////////////////////////////////
            // 512 by 256 division.
            ///////////////////////////////////////////////

            // Make division exact by subtracting the remainder from [prod1 prod0].
            uint256 remainder;
            assembly {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

                // Subtract 256 bit number from 512 bit number.
                prod1 := sub(prod1, gt(remainder, prod0))
                prod0 := sub(prod0, remainder)
            }

            // Factor powers of two out of denominator and compute largest power of two divisor of denominator. Always >= 1.
            // See https://cs.stackexchange.com/q/138556/92363.

            // Does not overflow because the denominator cannot be zero at this stage in the function.
            uint256 twos = denominator & (~denominator + 1);
            assembly {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

                // Divide [prod1 prod0] by twos.
                prod0 := div(prod0, twos)

                // Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one.
                twos := add(div(sub(0, twos), twos), 1)
            }

            // Shift in bits from prod1 into prod0.
            prod0 |= prod1 * twos;

            // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such
            // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv = 1 mod 2^4.
            uint256 inverse = (3 * denominator) ^ 2;

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works
            // in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2^8
            inverse *= 2 - denominator * inverse; // inverse mod 2^16
            inverse *= 2 - denominator * inverse; // inverse mod 2^32
            inverse *= 2 - denominator * inverse; // inverse mod 2^64
            inverse *= 2 - denominator * inverse; // inverse mod 2^128
            inverse *= 2 - denominator * inverse; // inverse mod 2^256

            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
            // This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is
            // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1
            // is no longer required.
            result = prod0 * inverse;
            return result;
        }
    }

    /**
     * @notice Calculates x * y / denominator with full precision, following the selected rounding direction.
     */
    function mulDiv(
        uint256 x,
        uint256 y,
        uint256 denominator,
        Rounding rounding
    ) internal pure returns (uint256) {
        uint256 result = mulDiv(x, y, denominator);
        if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) {
            result += 1;
        }
        return result;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded down.
     *
     * Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11).
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        if (a == 0) {
            return 0;
        }

        // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.
        //
        // We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have
        // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.
        //
        // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`
        // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`
        // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`
        //
        // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.
        uint256 result = 1 << (log2(a) >> 1);

        // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,
        // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at
        // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision
        // into the expected uint128 result.
        unchecked {
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            return min(result, a / result);
        }
    }

    /**
     * @notice Calculates sqrt(a), following the selected rounding direction.
     */
    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = sqrt(a);
            return result + (rounding == Rounding.Up && result * result < a ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 2, rounded down, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 128;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 64;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 32;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 16;
            }
            if (value >> 8 > 0) {
                value >>= 8;
                result += 8;
            }
            if (value >> 4 > 0) {
                value >>= 4;
                result += 4;
            }
            if (value >> 2 > 0) {
                value >>= 2;
                result += 2;
            }
            if (value >> 1 > 0) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log2(value);
            return result + (rounding == Rounding.Up && 1 << result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 10, rounded down, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >= 10**64) {
                value /= 10**64;
                result += 64;
            }
            if (value >= 10**32) {
                value /= 10**32;
                result += 32;
            }
            if (value >= 10**16) {
                value /= 10**16;
                result += 16;
            }
            if (value >= 10**8) {
                value /= 10**8;
                result += 8;
            }
            if (value >= 10**4) {
                value /= 10**4;
                result += 4;
            }
            if (value >= 10**2) {
                value /= 10**2;
                result += 2;
            }
            if (value >= 10**1) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log10(value);
            return result + (rounding == Rounding.Up && 10**result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 256, rounded down, of a positive value.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 16;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 8;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 4;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 2;
            }
            if (value >> 8 > 0) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log256(value);
            return result + (rounding == Rounding.Up && 1 << (result * 8) < value ? 1 : 0);
        }
    }
}

Settings
{
  "evmVersion": "london",
  "libraries": {},
  "metadata": {
    "bytecodeHash": "ipfs",
    "useLiteralContent": true
  },
  "optimizer": {
    "enabled": true,
    "runs": 0
  },
  "remappings": [],
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  }
}

Contract ABI

[{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"previousAdmin","type":"address"},{"indexed":false,"internalType":"address","name":"newAdmin","type":"address"}],"name":"AdminChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"beacon","type":"address"}],"name":"BeaconUpgraded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"implementation","type":"address"}],"name":"Upgraded","type":"event"},{"stateMutability":"payable","type":"fallback"},{"inputs":[{"internalType":"address","name":"_logic","type":"address"},{"internalType":"bytes","name":"_data","type":"bytes"}],"name":"initialize","outputs":[],"stateMutability":"payable","type":"function"},{"stateMutability":"payable","type":"receive"}]

Deployed Bytecode

0x6080604052600436106100225760003560e01c8063d1f578941461003957610031565b366100315761002f61004c565b005b61002f61004c565b61002f6100473660046103ea565b61005e565b61005c61005761013d565b61014c565b565b6000610068610170565b6001600160a01b0316146100b15760405162461bcd60e51b815260206004820152600b60248201526a1a5b9a5d1a585b1a5e995960aa1b60448201526064015b60405180910390fd5b6100dc60017f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbd61047a565b600080516020610531833981519152146100f8576100f861049f565b6101388383838080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920182905250925061018c915050565b505050565b6000610147610170565b905090565b3660008037600080366000845af43d6000803e80801561016b573d6000f35b3d6000fd5b600080516020610531833981519152546001600160a01b031690565b610195836101b7565b6000825111806101a25750805b15610138576101b183836101f7565b50505050565b6101c081610223565b6040516001600160a01b038216907fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b90600090a250565b606061021c8383604051806060016040528060278152602001610551602791396102bd565b9392505050565b61022c81610335565b61028e5760405162461bcd60e51b815260206004820152602d60248201527f455243313936373a206e657720696d706c656d656e746174696f6e206973206e60448201526c1bdd08184818dbdb9d1c9858dd609a1b60648201526084016100a8565b60008051602061053183398151915280546001600160a01b0319166001600160a01b0392909216919091179055565b6060600080856001600160a01b0316856040516102da91906104e1565b600060405180830381855af49150503d8060008114610315576040519150601f19603f3d011682016040523d82523d6000602084013e61031a565b606091505b509150915061032b86838387610344565b9695505050505050565b6001600160a01b03163b151590565b606083156103ae5782516103a75761035b85610335565b6103a75760405162461bcd60e51b815260206004820152601d60248201527f416464726573733a2063616c6c20746f206e6f6e2d636f6e747261637400000060448201526064016100a8565b50816103b8565b6103b883836103c0565b949350505050565b8151156103d05781518083602001fd5b8060405162461bcd60e51b81526004016100a891906104fd565b6000806000604084860312156103ff57600080fd5b83356001600160a01b038116811461041657600080fd5b925060208401356001600160401b038082111561043257600080fd5b818601915086601f83011261044657600080fd5b81358181111561045557600080fd5b87602082850101111561046757600080fd5b6020830194508093505050509250925092565b60008282101561049a57634e487b7160e01b600052601160045260246000fd5b500390565b634e487b7160e01b600052600160045260246000fd5b60005b838110156104d05781810151838201526020016104b8565b838111156101b15750506000910152565b600082516104f38184602087016104b5565b9190910192915050565b602081526000825180602084015261051c8160408501602087016104b5565b601f01601f1916919091016040019291505056fe360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc416464726573733a206c6f772d6c6576656c2064656c65676174652063616c6c206661696c6564a2646970667358221220aee5838a8252d1636189241c7c2619efbaf1b1fe00b0f1d436017a2d9459123764736f6c634300080a0033

Block Transaction Gas Used Reward
Age Block Fee Address BC Fee Address Voting Power Jailed Incoming
Block Uncle Number Difficulty Gas Used Reward
Loading
Make sure to use the "Vote Down" button for any spammy posts, and the "Vote Up" for interesting conversations.