| { | |
| "language": "Solidity", | |
| "sources": { | |
| "contracts/AirdropDistributor.sol": { | |
| "content": "// SPDX-License-Identifier: UNLICENSED\npragma solidity ^0.8.10;\n\nimport \"@openzeppelin/contracts/access/Ownable.sol\";\nimport \"@openzeppelin/contracts/token/ERC20/IERC20.sol\";\nimport \"@openzeppelin/contracts/utils/cryptography/MerkleProof.sol\";\nimport {IAddressProvider} from \"@gearbox-protocol/core-v2/contracts/interfaces/IAddressProvider.sol\";\nimport {IAirdropDistributor, DistributionData, ClaimedData} from \"./IAirdropDistributor.sol\";\n\ncontract AirdropDistributor is Ownable, IAirdropDistributor {\n /// @dev Emits each time when call not by treasury\n error TreasuryOnlyException();\n\n /// @dev Emits if already claimed is forbidden\n error AlreadyClaimedFinishedException();\n\n /// @dev Returns the token distributed by the contract\n IERC20 public immutable override token;\n\n /// @dev DAO Treasury address\n address public immutable treasury;\n\n /// @dev The current merkle root of total claimable balances\n bytes32 public override merkleRoot;\n\n /// @dev The mapping that stores amounts already claimed by users\n mapping(address => uint256) public claimed;\n\n modifier treasuryOnly() {\n if (msg.sender != treasury) revert TreasuryOnlyException();\n _;\n }\n\n constructor(\n address addressProvider,\n bytes32 merkleRoot_,\n ClaimedData[] memory alreadyClaimed\n ) {\n token = IERC20(IAddressProvider(addressProvider).getGearToken());\n treasury = IAddressProvider(addressProvider).getTreasuryContract();\n merkleRoot = merkleRoot_;\n _updateHistoricClaims(alreadyClaimed);\n }\n\n function updateMerkleRoot(bytes32 newRoot) external treasuryOnly {\n bytes32 oldRoot = merkleRoot;\n merkleRoot = newRoot;\n emit RootUpdated(oldRoot, newRoot);\n }\n\n function emitDistributionEvents(DistributionData[] calldata data)\n external\n onlyOwner\n {\n uint256 len = data.length;\n unchecked {\n for (uint256 i = 0; i < len; ++i) {\n emit TokenAllocated(\n data[i].account,\n data[i].campaignId,\n data[i].amount\n );\n }\n }\n }\n\n function updateHistoricClaims(ClaimedData[] memory alreadyClaimed)\n external\n onlyOwner\n {\n _updateHistoricClaims(alreadyClaimed);\n }\n\n function _updateHistoricClaims(ClaimedData[] memory alreadyClaimed)\n internal\n {\n uint256 len = alreadyClaimed.length;\n unchecked {\n for (uint256 i = 0; i < len; ++i) {\n emit Claimed(\n alreadyClaimed[i].account,\n alreadyClaimed[i].amount,\n true\n );\n }\n }\n }\n\n function claim(\n uint256 index,\n address account,\n uint256 totalAmount,\n bytes32[] calldata merkleProof\n ) external override {\n require(\n claimed[account] < totalAmount,\n \"MerkleDistributor: Nothing to claim\"\n );\n\n bytes32 node = keccak256(abi.encodePacked(index, account, totalAmount));\n require(\n MerkleProof.verify(merkleProof, merkleRoot, node),\n \"MerkleDistributor: Invalid proof.\"\n );\n\n uint256 claimedAmount = totalAmount - claimed[account];\n claimed[account] += claimedAmount;\n token.transfer(account, claimedAmount);\n\n emit Claimed(account, claimedAmount, false);\n }\n}\n" | |
| }, | |
| "contracts/IAirdropDistributor.sol": { | |
| "content": "// SPDX-License-Identifier: UNLICENSED\npragma solidity >=0.5.0;\n\nimport \"@openzeppelin/contracts/token/ERC20/IERC20.sol\";\n\nstruct DistributionData {\n address account;\n uint8 campaignId;\n uint256 amount;\n}\n\nstruct ClaimedData {\n address account;\n uint256 amount;\n}\n\ninterface IAirdropDistributorEvents {\n /// @dev Emits when a user claims tokens\n event Claimed(\n address indexed account,\n uint256 amount,\n bool indexed historic\n );\n\n /// @dev Emits when the owner replaces the merkle root\n event RootUpdated(bytes32 oldRoot, bytes32 indexed newRoot);\n\n /// @dev Emitted from a special function after updating the root to index allocations\n event TokenAllocated(\n address indexed account,\n uint8 indexed campaignId,\n uint256 amount\n );\n}\n\ninterface IAirdropDistributor is IAirdropDistributorEvents {\n /// @dev Returns the token distributed by this contract.\n function token() external view returns (IERC20);\n\n /// @dev Returns the current merkle root containing total claimable balances\n function merkleRoot() external view returns (bytes32);\n\n /// @dev Returns the total amount of token claimed by the user\n function claimed(address user) external view returns (uint256);\n\n // Claim the given amount of the token to the given address. Reverts if the inputs are invalid.\n /// @dev Claims the given amount of the token for the account. Reverts if the inputs are not a leaf in the tree\n /// or the total claimed amount for the account is more than the leaf amount.\n function claim(\n uint256 index,\n address account,\n uint256 totalAmount,\n bytes32[] calldata merkleProof\n ) external;\n}\n" | |
| }, | |
| "@openzeppelin/contracts/access/Ownable.sol": { | |
| "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.7.0) (access/Ownable.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../utils/Context.sol\";\n\n/**\n * @dev Contract module which provides a basic access control mechanism, where\n * there is an account (an owner) that can be granted exclusive access to\n * specific functions.\n *\n * By default, the owner account will be the one that deploys the contract. This\n * can later be changed with {transferOwnership}.\n *\n * This module is used through inheritance. It will make available the modifier\n * `onlyOwner`, which can be applied to your functions to restrict their use to\n * the owner.\n */\nabstract contract Ownable is Context {\n address private _owner;\n\n event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);\n\n /**\n * @dev Initializes the contract setting the deployer as the initial owner.\n */\n constructor() {\n _transferOwnership(_msgSender());\n }\n\n /**\n * @dev Throws if called by any account other than the owner.\n */\n modifier onlyOwner() {\n _checkOwner();\n _;\n }\n\n /**\n * @dev Returns the address of the current owner.\n */\n function owner() public view virtual returns (address) {\n return _owner;\n }\n\n /**\n * @dev Throws if the sender is not the owner.\n */\n function _checkOwner() internal view virtual {\n require(owner() == _msgSender(), \"Ownable: caller is not the owner\");\n }\n\n /**\n * @dev Leaves the contract without owner. It will not be possible to call\n * `onlyOwner` functions anymore. Can only be called by the current owner.\n *\n * NOTE: Renouncing ownership will leave the contract without an owner,\n * thereby removing any functionality that is only available to the owner.\n */\n function renounceOwnership() public virtual onlyOwner {\n _transferOwnership(address(0));\n }\n\n /**\n * @dev Transfers ownership of the contract to a new account (`newOwner`).\n * Can only be called by the current owner.\n */\n function transferOwnership(address newOwner) public virtual onlyOwner {\n require(newOwner != address(0), \"Ownable: new owner is the zero address\");\n _transferOwnership(newOwner);\n }\n\n /**\n * @dev Transfers ownership of the contract to a new account (`newOwner`).\n * Internal function without access restriction.\n */\n function _transferOwnership(address newOwner) internal virtual {\n address oldOwner = _owner;\n _owner = newOwner;\n emit OwnershipTransferred(oldOwner, newOwner);\n }\n}\n" | |
| }, | |
| "@openzeppelin/contracts/token/ERC20/IERC20.sol": { | |
| "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.6.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(\n address from,\n address to,\n uint256 amount\n ) external returns (bool);\n}\n" | |
| }, | |
| "@gearbox-protocol/core-v2/contracts/interfaces/IAddressProvider.sol": { | |
| "content": "// SPDX-License-Identifier: GPL-2.0-or-later\n// Gearbox Protocol. Generalized leverage for DeFi protocols\n// (c) Gearbox Holdings, 2021\npragma solidity ^0.8.10;\nimport { IVersion } from \"./IVersion.sol\";\n\ninterface IAddressProviderEvents {\n /// @dev Emits when an address is set for a contract role\n event AddressSet(bytes32 indexed service, address indexed newAddress);\n}\n\n/// @title Optimised for front-end Address Provider interface\ninterface IAddressProvider is IAddressProviderEvents, IVersion {\n /// @return Address of ACL contract\n function getACL() external view returns (address);\n\n /// @return Address of ContractsRegister\n function getContractsRegister() external view returns (address);\n\n /// @return Address of AccountFactory\n function getAccountFactory() external view returns (address);\n\n /// @return Address of DataCompressor\n function getDataCompressor() external view returns (address);\n\n /// @return Address of GEAR token\n function getGearToken() external view returns (address);\n\n /// @return Address of WETH token\n function getWethToken() external view returns (address);\n\n /// @return Address of WETH Gateway\n function getWETHGateway() external view returns (address);\n\n /// @return Address of PriceOracle\n function getPriceOracle() external view returns (address);\n\n /// @return Address of DAO Treasury Multisig\n function getTreasuryContract() external view returns (address);\n\n /// @return Address of PathFinder\n function getLeveragedActions() external view returns (address);\n}\n" | |
| }, | |
| "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol": { | |
| "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.7.0) (utils/cryptography/MerkleProof.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev These functions deal with verification of Merkle Tree proofs.\n *\n * The proofs can be generated using the JavaScript library\n * https://github.com/miguelmota/merkletreejs[merkletreejs].\n * Note: the hashing algorithm should be keccak256 and pair sorting should be enabled.\n *\n * See `test/utils/cryptography/MerkleProof.test.js` for some examples.\n *\n * WARNING: You should avoid using leaf values that are 64 bytes long prior to\n * hashing, or use a hash function other than keccak256 for hashing leaves.\n * This is because the concatenation of a sorted pair of internal nodes in\n * the merkle tree could be reinterpreted as a leaf value.\n */\nlibrary MerkleProof {\n /**\n * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree\n * defined by `root`. For this, a `proof` must be provided, containing\n * sibling hashes on the branch from the leaf to the root of the tree. Each\n * pair of leaves and each pair of pre-images are assumed to be sorted.\n */\n function verify(\n bytes32[] memory proof,\n bytes32 root,\n bytes32 leaf\n ) internal pure returns (bool) {\n return processProof(proof, leaf) == root;\n }\n\n /**\n * @dev Calldata version of {verify}\n *\n * _Available since v4.7._\n */\n function verifyCalldata(\n bytes32[] calldata proof,\n bytes32 root,\n bytes32 leaf\n ) internal pure returns (bool) {\n return processProofCalldata(proof, leaf) == root;\n }\n\n /**\n * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up\n * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt\n * hash matches the root of the tree. When processing the proof, the pairs\n * of leafs & pre-images are assumed to be sorted.\n *\n * _Available since v4.4._\n */\n function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {\n bytes32 computedHash = leaf;\n for (uint256 i = 0; i < proof.length; i++) {\n computedHash = _hashPair(computedHash, proof[i]);\n }\n return computedHash;\n }\n\n /**\n * @dev Calldata version of {processProof}\n *\n * _Available since v4.7._\n */\n function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {\n bytes32 computedHash = leaf;\n for (uint256 i = 0; i < proof.length; i++) {\n computedHash = _hashPair(computedHash, proof[i]);\n }\n return computedHash;\n }\n\n /**\n * @dev Returns true if the `leaves` can be proved to be a part of a Merkle tree defined by\n * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.\n *\n * _Available since v4.7._\n */\n function multiProofVerify(\n bytes32[] memory proof,\n bool[] memory proofFlags,\n bytes32 root,\n bytes32[] memory leaves\n ) internal pure returns (bool) {\n return processMultiProof(proof, proofFlags, leaves) == root;\n }\n\n /**\n * @dev Calldata version of {multiProofVerify}\n *\n * _Available since v4.7._\n */\n function multiProofVerifyCalldata(\n bytes32[] calldata proof,\n bool[] calldata proofFlags,\n bytes32 root,\n bytes32[] memory leaves\n ) internal pure returns (bool) {\n return processMultiProofCalldata(proof, proofFlags, leaves) == root;\n }\n\n /**\n * @dev Returns the root of a tree reconstructed from `leaves` and the sibling nodes in `proof`,\n * consuming from one or the other at each step according to the instructions given by\n * `proofFlags`.\n *\n * _Available since v4.7._\n */\n function processMultiProof(\n bytes32[] memory proof,\n bool[] memory proofFlags,\n bytes32[] memory leaves\n ) internal pure returns (bytes32 merkleRoot) {\n // This function rebuild the root hash by traversing the tree up from the leaves. The root is rebuilt by\n // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the\n // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of\n // the merkle tree.\n uint256 leavesLen = leaves.length;\n uint256 totalHashes = proofFlags.length;\n\n // Check proof validity.\n require(leavesLen + proof.length - 1 == totalHashes, \"MerkleProof: invalid multiproof\");\n\n // The xxxPos values are \"pointers\" to the next value to consume in each array. All accesses are done using\n // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's \"pop\".\n bytes32[] memory hashes = new bytes32[](totalHashes);\n uint256 leafPos = 0;\n uint256 hashPos = 0;\n uint256 proofPos = 0;\n // At each step, we compute the next hash using two values:\n // - a value from the \"main queue\". If not all leaves have been consumed, we get the next leaf, otherwise we\n // get the next hash.\n // - depending on the flag, either another value for the \"main queue\" (merging branches) or an element from the\n // `proof` array.\n for (uint256 i = 0; i < totalHashes; i++) {\n bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];\n bytes32 b = proofFlags[i] ? leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++] : proof[proofPos++];\n hashes[i] = _hashPair(a, b);\n }\n\n if (totalHashes > 0) {\n return hashes[totalHashes - 1];\n } else if (leavesLen > 0) {\n return leaves[0];\n } else {\n return proof[0];\n }\n }\n\n /**\n * @dev Calldata version of {processMultiProof}\n *\n * _Available since v4.7._\n */\n function processMultiProofCalldata(\n bytes32[] calldata proof,\n bool[] calldata proofFlags,\n bytes32[] memory leaves\n ) internal pure returns (bytes32 merkleRoot) {\n // This function rebuild the root hash by traversing the tree up from the leaves. The root is rebuilt by\n // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the\n // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of\n // the merkle tree.\n uint256 leavesLen = leaves.length;\n uint256 totalHashes = proofFlags.length;\n\n // Check proof validity.\n require(leavesLen + proof.length - 1 == totalHashes, \"MerkleProof: invalid multiproof\");\n\n // The xxxPos values are \"pointers\" to the next value to consume in each array. All accesses are done using\n // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's \"pop\".\n bytes32[] memory hashes = new bytes32[](totalHashes);\n uint256 leafPos = 0;\n uint256 hashPos = 0;\n uint256 proofPos = 0;\n // At each step, we compute the next hash using two values:\n // - a value from the \"main queue\". If not all leaves have been consumed, we get the next leaf, otherwise we\n // get the next hash.\n // - depending on the flag, either another value for the \"main queue\" (merging branches) or an element from the\n // `proof` array.\n for (uint256 i = 0; i < totalHashes; i++) {\n bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];\n bytes32 b = proofFlags[i] ? leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++] : proof[proofPos++];\n hashes[i] = _hashPair(a, b);\n }\n\n if (totalHashes > 0) {\n return hashes[totalHashes - 1];\n } else if (leavesLen > 0) {\n return leaves[0];\n } else {\n return proof[0];\n }\n }\n\n function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {\n return a < b ? _efficientHash(a, b) : _efficientHash(b, a);\n }\n\n function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {\n /// @solidity memory-safe-assembly\n assembly {\n mstore(0x00, a)\n mstore(0x20, b)\n value := keccak256(0x00, 0x40)\n }\n }\n}\n" | |
| }, | |
| "@openzeppelin/contracts/utils/Context.sol": { | |
| "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" | |
| }, | |
| "@gearbox-protocol/core-v2/contracts/interfaces/IVersion.sol": { | |
| "content": "// SPDX-License-Identifier: GPL-2.0-or-later\n// Gearbox Protocol. Generalized leverage for DeFi protocols\n// (c) Gearbox Holdings, 2021\npragma solidity ^0.8.10;\n\n/// @title IVersion\n/// @dev Declares a version function which returns the contract's version\ninterface IVersion {\n /// @dev Returns contract version\n function version() external view returns (uint256);\n}\n" | |
| } | |
| }, | |
| "settings": { | |
| "optimizer": { | |
| "enabled": true, | |
| "runs": 1000000 | |
| }, | |
| "outputSelection": { | |
| "*": { | |
| "*": [ | |
| "evm.bytecode", | |
| "evm.deployedBytecode", | |
| "devdoc", | |
| "userdoc", | |
| "metadata", | |
| "abi" | |
| ] | |
| } | |
| }, | |
| "libraries": {} | |
| } | |
| } |