Contract Name:
MonolithicVoter
Contract Source Code:
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (token/ERC20/extensions/draft-IERC20Permit.sol)
pragma solidity ^0.8.0;
/**
* @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in
* https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].
*
* Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by
* presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't
* need to send a transaction, and thus is not required to hold Ether at all.
*/
interface IERC20Permit {
/**
* @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
* given ``owner``'s signed approval.
*
* IMPORTANT: The same issues {IERC20-approve} has related to transaction
* ordering also apply here.
*
* Emits an {Approval} event.
*
* Requirements:
*
* - `spender` cannot be the zero address.
* - `deadline` must be a timestamp in the future.
* - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
* over the EIP712-formatted function arguments.
* - the signature must use ``owner``'s current nonce (see {nonces}).
*
* For more information on the signature format, see the
* https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
* section].
*/
function permit(
address owner,
address spender,
uint256 value,
uint256 deadline,
uint8 v,
bytes32 r,
bytes32 s
) external;
/**
* @dev Returns the current nonce for `owner`. This value must be
* included whenever a signature is generated for {permit}.
*
* Every successful call to {permit} increases ``owner``'s nonce by one. This
* prevents a signature from being used multiple times.
*/
function nonces(address owner) external view returns (uint256);
/**
* @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.
*/
// solhint-disable-next-line func-name-mixedcase
function DOMAIN_SEPARATOR() external view returns (bytes32);
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.6.0) (token/ERC20/IERC20.sol)
pragma solidity ^0.8.0;
/**
* @dev Interface of the ERC20 standard as defined in the EIP.
*/
interface IERC20 {
/**
* @dev Emitted when `value` tokens are moved from one account (`from`) to
* another (`to`).
*
* Note that `value` may be zero.
*/
event Transfer(address indexed from, address indexed to, uint256 value);
/**
* @dev Emitted when the allowance of a `spender` for an `owner` is set by
* a call to {approve}. `value` is the new allowance.
*/
event Approval(address indexed owner, address indexed spender, uint256 value);
/**
* @dev Returns the amount of tokens in existence.
*/
function totalSupply() external view returns (uint256);
/**
* @dev Returns the amount of tokens owned by `account`.
*/
function balanceOf(address account) external view returns (uint256);
/**
* @dev Moves `amount` tokens from the caller's account to `to`.
*
* Returns a boolean value indicating whether the operation succeeded.
*
* Emits a {Transfer} event.
*/
function transfer(address to, uint256 amount) external returns (bool);
/**
* @dev Returns the remaining number of tokens that `spender` will be
* allowed to spend on behalf of `owner` through {transferFrom}. This is
* zero by default.
*
* This value changes when {approve} or {transferFrom} are called.
*/
function allowance(address owner, address spender) external view returns (uint256);
/**
* @dev Sets `amount` as the allowance of `spender` over the caller's tokens.
*
* Returns a boolean value indicating whether the operation succeeded.
*
* IMPORTANT: Beware that changing an allowance with this method brings the risk
* that someone may use both the old and the new allowance by unfortunate
* transaction ordering. One possible solution to mitigate this race
* condition is to first reduce the spender's allowance to 0 and set the
* desired value afterwards:
* https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
*
* Emits an {Approval} event.
*/
function approve(address spender, uint256 amount) external returns (bool);
/**
* @dev Moves `amount` tokens from `from` to `to` using the
* allowance mechanism. `amount` is then deducted from the caller's
* allowance.
*
* Returns a boolean value indicating whether the operation succeeded.
*
* Emits a {Transfer} event.
*/
function transferFrom(
address from,
address to,
uint256 amount
) external returns (bool);
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (token/ERC20/utils/SafeERC20.sol)
pragma solidity ^0.8.0;
import "../IERC20.sol";
import "../extensions/draft-IERC20Permit.sol";
import "../../../utils/Address.sol";
/**
* @title SafeERC20
* @dev Wrappers around ERC20 operations that throw on failure (when the token
* contract returns false). Tokens that return no value (and instead revert or
* throw on failure) are also supported, non-reverting calls are assumed to be
* successful.
* To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,
* which allows you to call the safe operations as `token.safeTransfer(...)`, etc.
*/
library SafeERC20 {
using Address for address;
function safeTransfer(
IERC20 token,
address to,
uint256 value
) internal {
_callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value));
}
function safeTransferFrom(
IERC20 token,
address from,
address to,
uint256 value
) internal {
_callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value));
}
/**
* @dev Deprecated. This function has issues similar to the ones found in
* {IERC20-approve}, and its usage is discouraged.
*
* Whenever possible, use {safeIncreaseAllowance} and
* {safeDecreaseAllowance} instead.
*/
function safeApprove(
IERC20 token,
address spender,
uint256 value
) internal {
// safeApprove should only be called when setting an initial allowance,
// or when resetting it to zero. To increase and decrease it, use
// 'safeIncreaseAllowance' and 'safeDecreaseAllowance'
require(
(value == 0) || (token.allowance(address(this), spender) == 0),
"SafeERC20: approve from non-zero to non-zero allowance"
);
_callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value));
}
function safeIncreaseAllowance(
IERC20 token,
address spender,
uint256 value
) internal {
uint256 newAllowance = token.allowance(address(this), spender) + value;
_callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
}
function safeDecreaseAllowance(
IERC20 token,
address spender,
uint256 value
) internal {
unchecked {
uint256 oldAllowance = token.allowance(address(this), spender);
require(oldAllowance >= value, "SafeERC20: decreased allowance below zero");
uint256 newAllowance = oldAllowance - value;
_callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
}
}
function safePermit(
IERC20Permit token,
address owner,
address spender,
uint256 value,
uint256 deadline,
uint8 v,
bytes32 r,
bytes32 s
) internal {
uint256 nonceBefore = token.nonces(owner);
token.permit(owner, spender, value, deadline, v, r, s);
uint256 nonceAfter = token.nonces(owner);
require(nonceAfter == nonceBefore + 1, "SafeERC20: permit did not succeed");
}
/**
* @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
* on the return value: the return value is optional (but if data is returned, it must not be false).
* @param token The token targeted by the call.
* @param data The call data (encoded using abi.encode or one of its variants).
*/
function _callOptionalReturn(IERC20 token, bytes memory data) private {
// We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
// we're implementing it ourselves. We use {Address-functionCall} to perform this call, which verifies that
// the target address contains contract code and also asserts for success in the low-level call.
bytes memory returndata = address(token).functionCall(data, "SafeERC20: low-level call failed");
if (returndata.length > 0) {
// Return data is optional
require(abi.decode(returndata, (bool)), "SafeERC20: ERC20 operation did not succeed");
}
}
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.6.0) (token/ERC721/IERC721Receiver.sol)
pragma solidity ^0.8.0;
/**
* @title ERC721 token receiver interface
* @dev Interface for any contract that wants to support safeTransfers
* from ERC721 asset contracts.
*/
interface IERC721Receiver {
/**
* @dev Whenever an {IERC721} `tokenId` token is transferred to this contract via {IERC721-safeTransferFrom}
* by `operator` from `from`, this function is called.
*
* It must return its Solidity selector to confirm the token transfer.
* If any other value is returned or the interface is not implemented by the recipient, the transfer will be reverted.
*
* The selector can be obtained in Solidity with `IERC721Receiver.onERC721Received.selector`.
*/
function onERC721Received(
address operator,
address from,
uint256 tokenId,
bytes calldata data
) external returns (bytes4);
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (token/ERC721/utils/ERC721Holder.sol)
pragma solidity ^0.8.0;
import "../IERC721Receiver.sol";
/**
* @dev Implementation of the {IERC721Receiver} interface.
*
* Accepts all token transfers.
* Make sure the contract is able to use its token with {IERC721-safeTransferFrom}, {IERC721-approve} or {IERC721-setApprovalForAll}.
*/
contract ERC721Holder is IERC721Receiver {
/**
* @dev See {IERC721Receiver-onERC721Received}.
*
* Always returns `IERC721Receiver.onERC721Received.selector`.
*/
function onERC721Received(
address,
address,
uint256,
bytes memory
) public virtual override returns (bytes4) {
return this.onERC721Received.selector;
}
}
// 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);
}
}
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/structs/EnumerableSet.sol)
// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.
pragma solidity ^0.8.0;
/**
* @dev Library for managing
* https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive
* types.
*
* Sets have the following properties:
*
* - Elements are added, removed, and checked for existence in constant time
* (O(1)).
* - Elements are enumerated in O(n). No guarantees are made on the ordering.
*
* ```
* contract Example {
* // Add the library methods
* using EnumerableSet for EnumerableSet.AddressSet;
*
* // Declare a set state variable
* EnumerableSet.AddressSet private mySet;
* }
* ```
*
* As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`)
* and `uint256` (`UintSet`) are supported.
*
* [WARNING]
* ====
* Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
* unusable.
* See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
*
* In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an
* array of EnumerableSet.
* ====
*/
library EnumerableSet {
// To implement this library for multiple types with as little code
// repetition as possible, we write it in terms of a generic Set type with
// bytes32 values.
// The Set implementation uses private functions, and user-facing
// implementations (such as AddressSet) are just wrappers around the
// underlying Set.
// This means that we can only create new EnumerableSets for types that fit
// in bytes32.
struct Set {
// Storage of set values
bytes32[] _values;
// Position of the value in the `values` array, plus 1 because index 0
// means a value is not in the set.
mapping(bytes32 => uint256) _indexes;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function _add(Set storage set, bytes32 value) private returns (bool) {
if (!_contains(set, value)) {
set._values.push(value);
// The value is stored at length-1, but we add 1 to all indexes
// and use 0 as a sentinel value
set._indexes[value] = set._values.length;
return true;
} else {
return false;
}
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function _remove(Set storage set, bytes32 value) private returns (bool) {
// We read and store the value's index to prevent multiple reads from the same storage slot
uint256 valueIndex = set._indexes[value];
if (valueIndex != 0) {
// Equivalent to contains(set, value)
// To delete an element from the _values array in O(1), we swap the element to delete with the last one in
// the array, and then remove the last element (sometimes called as 'swap and pop').
// This modifies the order of the array, as noted in {at}.
uint256 toDeleteIndex = valueIndex - 1;
uint256 lastIndex = set._values.length - 1;
if (lastIndex != toDeleteIndex) {
bytes32 lastValue = set._values[lastIndex];
// Move the last value to the index where the value to delete is
set._values[toDeleteIndex] = lastValue;
// Update the index for the moved value
set._indexes[lastValue] = valueIndex; // Replace lastValue's index to valueIndex
}
// Delete the slot where the moved value was stored
set._values.pop();
// Delete the index for the deleted slot
delete set._indexes[value];
return true;
} else {
return false;
}
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function _contains(Set storage set, bytes32 value) private view returns (bool) {
return set._indexes[value] != 0;
}
/**
* @dev Returns the number of values on the set. O(1).
*/
function _length(Set storage set) private view returns (uint256) {
return set._values.length;
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function _at(Set storage set, uint256 index) private view returns (bytes32) {
return set._values[index];
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function _values(Set storage set) private view returns (bytes32[] memory) {
return set._values;
}
// Bytes32Set
struct Bytes32Set {
Set _inner;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {
return _add(set._inner, value);
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {
return _remove(set._inner, value);
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {
return _contains(set._inner, value);
}
/**
* @dev Returns the number of values in the set. O(1).
*/
function length(Bytes32Set storage set) internal view returns (uint256) {
return _length(set._inner);
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {
return _at(set._inner, index);
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {
bytes32[] memory store = _values(set._inner);
bytes32[] memory result;
/// @solidity memory-safe-assembly
assembly {
result := store
}
return result;
}
// AddressSet
struct AddressSet {
Set _inner;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function add(AddressSet storage set, address value) internal returns (bool) {
return _add(set._inner, bytes32(uint256(uint160(value))));
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function remove(AddressSet storage set, address value) internal returns (bool) {
return _remove(set._inner, bytes32(uint256(uint160(value))));
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function contains(AddressSet storage set, address value) internal view returns (bool) {
return _contains(set._inner, bytes32(uint256(uint160(value))));
}
/**
* @dev Returns the number of values in the set. O(1).
*/
function length(AddressSet storage set) internal view returns (uint256) {
return _length(set._inner);
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function at(AddressSet storage set, uint256 index) internal view returns (address) {
return address(uint160(uint256(_at(set._inner, index))));
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(AddressSet storage set) internal view returns (address[] memory) {
bytes32[] memory store = _values(set._inner);
address[] memory result;
/// @solidity memory-safe-assembly
assembly {
result := store
}
return result;
}
// UintSet
struct UintSet {
Set _inner;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function add(UintSet storage set, uint256 value) internal returns (bool) {
return _add(set._inner, bytes32(value));
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function remove(UintSet storage set, uint256 value) internal returns (bool) {
return _remove(set._inner, bytes32(value));
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function contains(UintSet storage set, uint256 value) internal view returns (bool) {
return _contains(set._inner, bytes32(value));
}
/**
* @dev Returns the number of values in the set. O(1).
*/
function length(UintSet storage set) internal view returns (uint256) {
return _length(set._inner);
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function at(UintSet storage set, uint256 index) internal view returns (uint256) {
return uint256(_at(set._inner, index));
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(UintSet storage set) internal view returns (uint256[] memory) {
bytes32[] memory store = _values(set._inner);
uint256[] memory result;
/// @solidity memory-safe-assembly
assembly {
result := store
}
return result;
}
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;
/*
Monolithic Voter contract which houses all partner voting power,
streamlining the process to ensure they do not obtain operational overhead.
Dev: DOG @RAMSES https://twitter.com/yesthatdog
*/
import "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";
import "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";
import "@openzeppelin/contracts/token/ERC721/utils/ERC721Holder.sol";
interface IVoter {
function vote(
uint256 _tokenId,
address[] calldata _poolVote,
uint256[] calldata _weights
) external;
function reset(uint256 tokenID) external;
function claimFees(
address[] calldata,
address[][] calldata,
uint256
) external;
function poke(uint256 _tokenId) external;
function poolVote(
uint256 _tokenId,
uint256 _index
) external view returns (address);
function poolVoteLength(uint256 tokenId) external view returns (uint256);
function votes(
uint256 _tokenId,
address _pool
) external view returns (uint256);
function _epochTimestamp() external view returns (uint256);
function lastVoted(uint256 tokenId) external view returns (uint256);
}
interface IVe {
function increase_unlock_time(uint _tokenId, uint _lock_duration) external;
function transferFrom(address from, address to, uint256 tokenID) external;
function safeTransferFrom(
address from,
address to,
uint256 tokenID
) external;
function ownerOf(uint256 tokenID) external view returns (address);
}
interface IVeDist {
function claim_many(uint[] memory _tokenIds) external returns (bool);
}
contract MonolithicVoter is ERC721Holder {
using SafeERC20 for IERC20;
using EnumerableSet for EnumerableSet.UintSet;
using EnumerableSet for EnumerableSet.AddressSet;
uint128 public constant MAX = 2 * 365 * 86400; // 2 years
address public operator;
address public multisig;
IVoter public voter;
IVe public ve;
IVeDist public veDist;
EnumerableSet.AddressSet private _allowedToVote;
mapping(uint256 => address) private __ownerOf;
mapping(uint256 => string) private __partner;
mapping(address => EnumerableSet.UintSet) private _tokensOwned;
mapping(uint256 => EnumerableSet.AddressSet) private _partnerAllowedToVote;
event TokenAssigned(uint256 tokenID, address designatee);
event PartnerNameSetted(uint256 tokenID, string name);
event OperatorSetted(address value);
event MultisigSetted(address value);
event PairsWhitelisted(address[] pairs);
event PairsRemoved(address[] pairs);
event PairsWhitelistedForPartner(uint256 tokenID, address[] pairs);
event PairsRemovedForPartner(uint256 tokenID, address[] pairs);
event TokenRevoked(uint256 tokenID);
event Voted(
uint256 tokenID,
address ownerOf,
address[] pools,
uint256[] weights
);
event RewardClaimed(
uint256 tokenID,
address ownerOf,
address receiver,
address[] pools,
address[][] tokens,
uint256[][] values
);
event Rebased(uint256[] tokenIDs);
event LockupIncreased(uint256[] tokenIDs);
modifier operatorGated() {
require(msg.sender == operator || msg.sender == multisig, "!auth");
_;
}
constructor(
address _multisig,
address _voter,
address _ve,
address _veDist
) {
operator = msg.sender;
multisig = _multisig;
voter = IVoter(_voter);
ve = IVe(_ve);
veDist = IVeDist(_veDist);
}
///@notice set the owner of a protocol nft
function assign(
uint256 _tokenID,
address _designatee
) external operatorGated {
require(ve.ownerOf(_tokenID) == address(this), "!custodied");
if (__ownerOf[_tokenID] != address(0))
_tokensOwned[__ownerOf[_tokenID]].remove(_tokenID);
__ownerOf[_tokenID] = _designatee;
_tokensOwned[_designatee].add(_tokenID);
emit TokenAssigned(_tokenID, _designatee);
}
///@notice set the name of the protocol associated with the tokenID
function setName(
uint256 _tokenID,
string calldata _partner
) external operatorGated {
__partner[_tokenID] = _partner;
emit PartnerNameSetted(_tokenID, _partner);
}
///@notice set operator address
function setOperator(address _operator) external operatorGated {
require(_operator != address(0));
operator = _operator;
emit OperatorSetted(_operator);
}
///@notice set multisig address
function setMultisig(address _multisig) external {
require(msg.sender == multisig, "!auth");
require(_multisig != address(0));
multisig = _multisig;
emit MultisigSetted(multisig);
}
///@notice allow protocols for voting for list of pools
function setWhitelisted(
address[] calldata _whitelistedPairs
) external operatorGated {
for (uint256 i; i < _whitelistedPairs.length; ++i) {
if (!_allowedToVote.contains(_whitelistedPairs[i]))
_allowedToVote.add(_whitelistedPairs[i]);
}
emit PairsWhitelisted(_whitelistedPairs);
}
///@notice remove pools from the protocol whitelist
function removeWhitelisted(
address[] calldata _whitelistedPairs
) external operatorGated {
for (uint256 i = 0; i < _whitelistedPairs.length; ++i) {
if (_allowedToVote.contains(_whitelistedPairs[i])) {
_allowedToVote.remove(_whitelistedPairs[i]);
}
}
emit PairsRemoved(_whitelistedPairs);
}
///@notice allow specific partner protocols for voting for current pools
function setWhitelistForPartner(
uint256 _tokenID,
address[] calldata _whitelistedPairs
) external operatorGated {
for (uint256 i = 0; i < _whitelistedPairs.length; ++i) {
if (
!_partnerAllowedToVote[_tokenID].contains(_whitelistedPairs[i])
) {
_partnerAllowedToVote[_tokenID].add(_whitelistedPairs[i]);
}
}
emit PairsWhitelistedForPartner(_tokenID, _whitelistedPairs);
}
///@notice disallow specific partner protocols for voting for current pools
function removeWhitelistForPartner(
uint256 _tokenID,
address[] calldata _whitelistedPairs
) external operatorGated {
for (uint256 i = 0; i < _whitelistedPairs.length; ++i) {
if (
_partnerAllowedToVote[_tokenID].contains(_whitelistedPairs[i])
) {
_partnerAllowedToVote[_tokenID].remove(_whitelistedPairs[i]);
}
}
emit PairsRemovedForPartner(_tokenID, _whitelistedPairs);
}
///@notice removes the veNFT from the protocol
function revoke(uint256 _tokenID) external operatorGated {
voter.reset(_tokenID);
ve.transferFrom(address(this), multisig, _tokenID);
_tokensOwned[__ownerOf[_tokenID]].remove(_tokenID);
delete __ownerOf[_tokenID];
delete __partner[_tokenID];
emit TokenRevoked(_tokenID);
}
///@notice allow the designated protocol to vote using their partner NFT
function voteForProtocolPools(
address[] calldata _pools,
uint256[] calldata _weights,
uint256 _tokenID
) external {
require(
msg.sender == __ownerOf[_tokenID] || msg.sender == address(this),
"!protocol"
);
require(_pools.length == _weights.length, "length mismatch");
//TODO: Add a check to ensure protocols cannot change their votes 1 hour before epoch flip
for (uint256 i = 0; i < _pools.length; ++i) {
require(
_allowedToVote.contains(_pools[i]) ||
_partnerAllowedToVote[_tokenID].contains(_pools[i]),
"not allowed"
);
}
voter.vote(_tokenID, _pools, _weights);
}
///@notice claim rewards for current partner
function claimVoterRewards(
address[] calldata _feedists,
address[][] calldata _tokens,
uint256 _tokenId
) external {
address _owner = __ownerOf[_tokenId];
voter.claimFees(_feedists, _tokens, _tokenId);
uint256[][] memory values = new uint256[][](_feedists.length);
for (uint256 i = 0; i < _feedists.length; ++i) {
values[i] = new uint256[](_tokens[i].length);
for (uint256 j = 0; j < _tokens[i].length; ++j) {
IERC20 temp = IERC20(_tokens[i][j]);
values[i][j] = temp.balanceOf(address(this));
if (values[i][j] > 0) {
temp.safeTransfer(_owner, values[i][j]);
}
}
}
emit RewardClaimed(
_tokenId,
_owner,
_owner,
_feedists,
_tokens,
values
);
}
///@notice elevated version
function elevatedClaimVoterRewards(
address[] calldata _feedists,
address[][] calldata _tokens,
uint256 _tokenId
) external operatorGated {
voter.claimFees(_feedists, _tokens, _tokenId);
uint256[][] memory values = new uint256[][](_feedists.length);
for (uint256 i = 0; i < _feedists.length; ++i) {
values[i] = new uint256[](_tokens[i].length);
for (uint256 j = 0; j < _tokens[i].length; ++j) {
IERC20 temp = IERC20(_tokens[i][j]);
values[i][j] = temp.balanceOf(address(this));
if (values[i][j] > 0) {
temp.safeTransfer(multisig, values[i][j]);
}
}
}
emit RewardClaimed(
_tokenId,
__ownerOf[_tokenId],
multisig,
_feedists,
_tokens,
values
);
}
///@dev permissionless
function poke(uint256[] calldata _tokenIDs) public {
address[] memory lastVotes;
uint256[] memory lastWeights;
address ownerOf;
for (uint256 i = 0; i < _tokenIDs.length; ++i) {
(ownerOf, , , , lastVotes, lastWeights) = getTokenInfo(
_tokenIDs[i]
);
if (
ownerOf != address(0) &&
voter.lastVoted(_tokenIDs[i]) < voter._epochTimestamp() + 1
) {
voter.poke(_tokenIDs[i]);
emit Voted(_tokenIDs[i], ownerOf, lastVotes, lastWeights);
}
}
}
///@dev permissionless
function claimRebases(uint256[] calldata _tokenIDs) public {
veDist.claim_many(_tokenIDs);
emit Rebased(_tokenIDs);
}
///@dev permissionless
function extend(uint256[] calldata _tokenIDs) public {
for (uint256 i = 0; i < _tokenIDs.length; ++i) {
ve.increase_unlock_time(_tokenIDs[i], MAX);
}
emit LockupIncreased(_tokenIDs);
}
///@dev permissionless maintenance to be called weekly
function maintenance(uint256[] calldata _tokenIDs) public {
claimRebases(_tokenIDs);
extend(_tokenIDs);
poke(_tokenIDs);
}
///@notice backstop
function execute(address _x, bytes calldata _data) external operatorGated {
(bool success, ) = _x.call(_data);
require(success);
}
// view methods
function getAddressInfo(
address account
)
external
view
returns (
uint256[] memory tokenIDs,
address[] memory allowedToVote,
string[] memory partnerNames,
address[][] memory personalAllowedToVote,
address[][] memory lastVotes,
uint256[][] memory lastWeights
)
{
tokenIDs = _tokensOwned[account].values();
allowedToVote = _allowedToVote.values();
partnerNames = new string[](tokenIDs.length);
personalAllowedToVote = new address[][](tokenIDs.length);
lastVotes = new address[][](tokenIDs.length);
lastWeights = new uint256[][](tokenIDs.length);
for (uint256 i; i < tokenIDs.length; ++i) {
(
,
partnerNames[i],
,
personalAllowedToVote[i],
lastVotes[i],
lastWeights[i]
) = getTokenInfo(tokenIDs[i]);
}
}
function getTokensInfo(
uint256[] calldata tokenIDs
)
external
view
returns (
address[] memory ownersOf,
address[] memory allowedToVote,
string[] memory partnerNames,
address[][] memory personalAllowedToVote,
address[][] memory lastVotes,
uint256[][] memory lastWeights
)
{
allowedToVote = _allowedToVote.values();
partnerNames = new string[](tokenIDs.length);
ownersOf = new address[](tokenIDs.length);
personalAllowedToVote = new address[][](tokenIDs.length);
lastVotes = new address[][](tokenIDs.length);
lastWeights = new uint256[][](tokenIDs.length);
for (uint256 i; i < tokenIDs.length; ++i) {
(
ownersOf[i],
partnerNames[i],
,
personalAllowedToVote[i],
lastVotes[i],
lastWeights[i]
) = getTokenInfo(tokenIDs[i]);
}
}
function getTokenInfo(
uint256 tokenID
)
public
view
returns (
address ownerOf,
string memory partnerName,
address[] memory allowedToVote,
address[] memory personalAllowedToVote,
address[] memory lastVotes,
uint256[] memory lastWeights
)
{
ownerOf = __ownerOf[tokenID];
partnerName = __partner[tokenID];
allowedToVote = _allowedToVote.values();
personalAllowedToVote = _partnerAllowedToVote[tokenID].values();
uint256 len = voter.poolVoteLength(tokenID);
lastVotes = new address[](len);
lastWeights = new uint256[](len);
for (uint256 i = 0; i < lastVotes.length; ++i) {
lastVotes[i] = voter.poolVote(tokenID, i);
lastWeights[i] = voter.votes(tokenID, lastVotes[i]);
}
}
}