Contract Source Code:
pragma solidity ^0.6.0;
import "../interfaces/IMuse.sol";
import "@openzeppelin/contracts/math/SafeMath.sol";
contract Vesting {
using SafeMath for uint256;
IMuse public token;
uint256 public duration = 730 days;
uint256 public timeStarted;
mapping(address => uint256) public paid;
mapping(address => uint256) public totalAmount;
address owner;
constructor(IMuse _token) public {
timeStarted = now;
token = IMuse(_token);
owner = msg.sender;
}
function claimTokens() external {
require(
totalAmount[msg.sender] >= paid[msg.sender],
"Finished vesting"
);
uint256 _amount = getAllocation();
paid[msg.sender] += _amount;
token.mint(msg.sender, _amount);
}
//@TODO check my math
function getAllocation() public view returns (uint256) {
uint256 perDay = totalAmount[msg.sender].div(duration);
uint256 daysPassed = (now.sub(timeStarted)).div(1 days);
uint256 amount = (daysPassed.mul(perDay)).sub(paid[msg.sender]);
return amount;
}
// as we don't have many players we could add manually how much everyone should get in 2 txs
function addAmts(address[] calldata _players, uint256[] calldata _amounts)
external
{
require(owner == msg.sender);
for (uint256 index = 0; index < _players.length; index++) {
totalAmount[_players[index]] = _amounts[index];
}
}
}
pragma solidity ^0.6.0;
// Interface for our erc20 token
interface IMuse {
function totalSupply() external view returns (uint256);
function balanceOf(address tokenOwner)
external
view
returns (uint256 balance);
function allowance(address tokenOwner, address spender)
external
view
returns (uint256 remaining);
function transfer(address to, uint256 tokens)
external
returns (bool success);
function approve(address spender, uint256 tokens)
external
returns (bool success);
function transferFrom(
address from,
address to,
uint256 tokens
) external returns (bool success);
function mintingFinished() external view returns (bool);
function mint(address to, uint256 amount) external;
function burn(uint256 amount) external;
function burnFrom(address account, uint256 amount) external;
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.6.0;
/**
* @dev Wrappers over Solidity's arithmetic operations with added overflow
* checks.
*
* Arithmetic operations in Solidity wrap on overflow. This can easily result
* in bugs, because programmers usually assume that an overflow raises an
* error, which is the standard behavior in high level programming languages.
* `SafeMath` restores this intuition by reverting the transaction when an
* operation overflows.
*
* Using this library instead of the unchecked operations eliminates an entire
* class of bugs, so it's recommended to use it always.
*/
library SafeMath {
/**
* @dev Returns the addition of two unsigned integers, reverting on
* overflow.
*
* Counterpart to Solidity's `+` operator.
*
* Requirements:
*
* - Addition cannot overflow.
*/
function add(uint256 a, uint256 b) internal pure returns (uint256) {
uint256 c = a + b;
require(c >= a, "SafeMath: addition overflow");
return c;
}
/**
* @dev Returns the subtraction of two unsigned integers, reverting on
* overflow (when the result is negative).
*
* Counterpart to Solidity's `-` operator.
*
* Requirements:
*
* - Subtraction cannot overflow.
*/
function sub(uint256 a, uint256 b) internal pure returns (uint256) {
return sub(a, b, "SafeMath: subtraction overflow");
}
/**
* @dev Returns the subtraction of two unsigned integers, reverting with custom message on
* overflow (when the result is negative).
*
* Counterpart to Solidity's `-` operator.
*
* Requirements:
*
* - Subtraction cannot overflow.
*/
function sub(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) {
require(b <= a, errorMessage);
uint256 c = a - b;
return c;
}
/**
* @dev Returns the multiplication of two unsigned integers, reverting on
* overflow.
*
* Counterpart to Solidity's `*` operator.
*
* Requirements:
*
* - Multiplication cannot overflow.
*/
function mul(uint256 a, uint256 b) internal pure returns (uint256) {
// Gas optimization: this is cheaper than requiring 'a' not being zero, but the
// benefit is lost if 'b' is also tested.
// See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
if (a == 0) {
return 0;
}
uint256 c = a * b;
require(c / a == b, "SafeMath: multiplication overflow");
return c;
}
/**
* @dev Returns the integer division of two unsigned integers. Reverts on
* division by zero. The result is rounded towards zero.
*
* Counterpart to Solidity's `/` operator. Note: this function uses a
* `revert` opcode (which leaves remaining gas untouched) while Solidity
* uses an invalid opcode to revert (consuming all remaining gas).
*
* Requirements:
*
* - The divisor cannot be zero.
*/
function div(uint256 a, uint256 b) internal pure returns (uint256) {
return div(a, b, "SafeMath: division by zero");
}
/**
* @dev Returns the integer division of two unsigned integers. Reverts with custom message on
* division by zero. The result is rounded towards zero.
*
* Counterpart to Solidity's `/` operator. Note: this function uses a
* `revert` opcode (which leaves remaining gas untouched) while Solidity
* uses an invalid opcode to revert (consuming all remaining gas).
*
* Requirements:
*
* - The divisor cannot be zero.
*/
function div(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) {
require(b > 0, errorMessage);
uint256 c = a / b;
// assert(a == b * c + a % b); // There is no case in which this doesn't hold
return c;
}
/**
* @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo),
* Reverts when dividing by zero.
*
* Counterpart to Solidity's `%` operator. This function uses a `revert`
* opcode (which leaves remaining gas untouched) while Solidity uses an
* invalid opcode to revert (consuming all remaining gas).
*
* Requirements:
*
* - The divisor cannot be zero.
*/
function mod(uint256 a, uint256 b) internal pure returns (uint256) {
return mod(a, b, "SafeMath: modulo by zero");
}
/**
* @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo),
* Reverts with custom message when dividing by zero.
*
* Counterpart to Solidity's `%` operator. This function uses a `revert`
* opcode (which leaves remaining gas untouched) while Solidity uses an
* invalid opcode to revert (consuming all remaining gas).
*
* Requirements:
*
* - The divisor cannot be zero.
*/
function mod(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) {
require(b != 0, errorMessage);
return a % b;
}
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.6.0;
import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/token/ERC20/SafeERC20.sol";
import "@openzeppelin/contracts/utils/EnumerableSet.sol";
import "@openzeppelin/contracts/math/SafeMath.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import "../interfaces/IMuse.sol";
contract MasterChef is Ownable {
using SafeMath for uint256;
using SafeERC20 for IERC20;
struct UserInfo {
uint256 amount;
uint256 rewardDebt;
}
struct PoolInfo {
IERC20 lpToken;
uint256 allocPoint;
uint256 lastRewardBlock;
uint256 accMusePerShare;
}
// The MUSE TOKEN!
IMuse public muse;
// Dev address.
address public devaddr;
// Block number when bonus MUSE period ends.
uint256 public bonusEndBlock;
// MUSE tokens created per block.
uint256 public musePerBlock;
// Bonus muliplier for early MUSE makers.
uint256 public constant BONUS_MULTIPLIER = 10;
// Info of each pool.
PoolInfo[] public poolInfo;
// Info of each user that stakes LP tokens.
mapping(uint256 => mapping(address => UserInfo)) public userInfo;
// Total allocation points. Must be the sum of all allocation points in all pools.
uint256 public totalAllocPoint = 0;
// The block number when MUSE mining starts.
uint256 public startBlock;
event Deposit(address indexed user, uint256 indexed pid, uint256 amount);
event Withdraw(address indexed user, uint256 indexed pid, uint256 amount);
event EmergencyWithdraw(
address indexed user,
uint256 indexed pid,
uint256 amount
);
constructor(
IMuse _muse,
address _devaddr,
uint256 _musePerBlock,
uint256 _startBlock,
uint256 _bonusEndBlock
) public {
muse = _muse;
devaddr = _devaddr;
musePerBlock = _musePerBlock;
bonusEndBlock = _bonusEndBlock;
startBlock = _startBlock;
}
function poolLength() external view returns (uint256) {
return poolInfo.length;
}
// Add a new lp to the pool. Can only be called by the owner.
// XXX DO NOT add the same LP token more than once. Rewards will be messed up if you do.
function add(
uint256 _allocPoint,
IERC20 _lpToken,
bool _withUpdate
) public onlyOwner {
if (_withUpdate) {
massUpdatePools();
}
uint256 lastRewardBlock =
block.number > startBlock ? block.number : startBlock;
totalAllocPoint = totalAllocPoint.add(_allocPoint);
poolInfo.push(
PoolInfo({
lpToken: _lpToken,
allocPoint: _allocPoint,
lastRewardBlock: lastRewardBlock,
accMusePerShare: 0
})
);
}
// Update the given pool's MUSE allocation point. Can only be called by the owner.
function set(
uint256 _pid,
uint256 _allocPoint,
bool _withUpdate
) public onlyOwner {
if (_withUpdate) {
massUpdatePools();
}
totalAllocPoint = totalAllocPoint.sub(poolInfo[_pid].allocPoint).add(
_allocPoint
);
poolInfo[_pid].allocPoint = _allocPoint;
}
// Return reward multiplier over the given _from to _to block.
function getMultiplier(uint256 _from, uint256 _to)
public
view
returns (uint256)
{
if (_to <= bonusEndBlock) {
return _to.sub(_from).mul(BONUS_MULTIPLIER);
} else if (_from >= bonusEndBlock) {
return _to.sub(_from);
} else {
return
bonusEndBlock.sub(_from).mul(BONUS_MULTIPLIER).add(
_to.sub(bonusEndBlock)
);
}
}
function pendingMuse(uint256 _pid, address _user)
external
view
returns (uint256)
{
PoolInfo storage pool = poolInfo[_pid];
UserInfo storage user = userInfo[_pid][_user];
uint256 accMusePerShare = pool.accMusePerShare;
uint256 lpSupply = pool.lpToken.balanceOf(address(this));
if (block.number > pool.lastRewardBlock && lpSupply != 0) {
uint256 multiplier =
getMultiplier(pool.lastRewardBlock, block.number);
uint256 museReward =
multiplier.mul(musePerBlock).mul(pool.allocPoint).div(
totalAllocPoint
);
accMusePerShare = accMusePerShare.add(
museReward.mul(1e12).div(lpSupply)
);
}
return user.amount.mul(accMusePerShare).div(1e12).sub(user.rewardDebt);
}
function massUpdatePools() public {
uint256 length = poolInfo.length;
for (uint256 pid = 0; pid < length; ++pid) {
updatePool(pid);
}
}
function updatePool(uint256 _pid) public {
PoolInfo storage pool = poolInfo[_pid];
if (block.number <= pool.lastRewardBlock) {
return;
}
uint256 lpSupply = pool.lpToken.balanceOf(address(this));
if (lpSupply == 0) {
pool.lastRewardBlock = block.number;
return;
}
uint256 multiplier = getMultiplier(pool.lastRewardBlock, block.number);
uint256 museReward =
multiplier.mul(musePerBlock).mul(pool.allocPoint).div(
totalAllocPoint
);
muse.mint(devaddr, museReward.div(10));
muse.mint(address(this), museReward);
pool.accMusePerShare = pool.accMusePerShare.add(
museReward.mul(1e12).div(lpSupply)
);
pool.lastRewardBlock = block.number;
}
// Deposit LP tokens to MasterChef for MUSE allocation.
function deposit(uint256 _pid, uint256 _amount) public {
PoolInfo storage pool = poolInfo[_pid];
UserInfo storage user = userInfo[_pid][msg.sender];
updatePool(_pid);
if (user.amount > 0) {
uint256 pending =
user.amount.mul(pool.accMusePerShare).div(1e12).sub(
user.rewardDebt
);
if (pending > 0) {
safeMuseTransfer(msg.sender, pending);
}
}
if (_amount > 0) {
pool.lpToken.safeTransferFrom(
address(msg.sender),
address(this),
_amount
);
user.amount = user.amount.add(_amount);
}
user.rewardDebt = user.amount.mul(pool.accMusePerShare).div(1e12);
emit Deposit(msg.sender, _pid, _amount);
}
// Withdraw LP tokens from MasterChef.
function withdraw(uint256 _pid, uint256 _amount) public {
PoolInfo storage pool = poolInfo[_pid];
UserInfo storage user = userInfo[_pid][msg.sender];
require(user.amount >= _amount, "withdraw: not good");
updatePool(_pid);
uint256 pending =
user.amount.mul(pool.accMusePerShare).div(1e12).sub(
user.rewardDebt
);
if (pending > 0) {
safeMuseTransfer(msg.sender, pending);
}
if (_amount > 0) {
user.amount = user.amount.sub(_amount);
pool.lpToken.safeTransfer(address(msg.sender), _amount);
}
user.rewardDebt = user.amount.mul(pool.accMusePerShare).div(1e12);
emit Withdraw(msg.sender, _pid, _amount);
}
// Withdraw without caring about rewards. EMERGENCY ONLY.
function emergencyWithdraw(uint256 _pid) public {
PoolInfo storage pool = poolInfo[_pid];
UserInfo storage user = userInfo[_pid][msg.sender];
uint256 amount = user.amount;
user.amount = 0;
user.rewardDebt = 0;
pool.lpToken.safeTransfer(address(msg.sender), amount);
emit EmergencyWithdraw(msg.sender, _pid, amount);
}
function safeMuseTransfer(address _to, uint256 _amount) internal {
uint256 museBal = muse.balanceOf(address(this));
if (_amount > museBal) {
muse.transfer(_to, museBal);
} else {
muse.transfer(_to, _amount);
}
}
// Update dev address by the previous dev.
function dev(address _devaddr) public {
require(msg.sender == devaddr, "dev: wut?");
devaddr = _devaddr;
}
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.6.0;
/**
* @dev Interface of the ERC20 standard as defined in the EIP.
*/
interface IERC20 {
/**
* @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 `recipient`.
*
* Returns a boolean value indicating whether the operation succeeded.
*
* Emits a {Transfer} event.
*/
function transfer(address recipient, 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 `sender` to `recipient` 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 sender, address recipient, uint256 amount) external returns (bool);
/**
* @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);
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.6.0;
import "./IERC20.sol";
import "../../math/SafeMath.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 SafeMath for uint256;
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'
// solhint-disable-next-line max-line-length
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).add(value);
_callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
}
function safeDecreaseAllowance(IERC20 token, address spender, uint256 value) internal {
uint256 newAllowance = token.allowance(address(this), spender).sub(value, "SafeERC20: decreased allowance below zero");
_callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
}
/**
* @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
// solhint-disable-next-line max-line-length
require(abi.decode(returndata, (bool)), "SafeERC20: ERC20 operation did not succeed");
}
}
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.6.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.0.0, only sets of type `address` (`AddressSet`) and `uint256`
* (`UintSet`) are supported.
*/
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;
// When the value to delete is the last one, the swap operation is unnecessary. However, since this occurs
// so rarely, we still do the swap anyway to avoid the gas cost of adding an 'if' statement.
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] = toDeleteIndex + 1; // All indexes are 1-based
// 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) {
require(set._values.length > index, "EnumerableSet: index out of bounds");
return set._values[index];
}
// 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(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(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(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(uint256(_at(set._inner, index)));
}
// 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 on 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));
}
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.6.0;
import "../GSN/Context.sol";
/**
* @dev Contract module which provides a basic access control mechanism, where
* there is an account (an owner) that can be granted exclusive access to
* specific functions.
*
* By default, the owner account will be the one that deploys the contract. This
* can later be changed with {transferOwnership}.
*
* This module is used through inheritance. It will make available the modifier
* `onlyOwner`, which can be applied to your functions to restrict their use to
* the owner.
*/
contract Ownable is Context {
address private _owner;
event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);
/**
* @dev Initializes the contract setting the deployer as the initial owner.
*/
constructor () internal {
address msgSender = _msgSender();
_owner = msgSender;
emit OwnershipTransferred(address(0), msgSender);
}
/**
* @dev Returns the address of the current owner.
*/
function owner() public view returns (address) {
return _owner;
}
/**
* @dev Throws if called by any account other than the owner.
*/
modifier onlyOwner() {
require(_owner == _msgSender(), "Ownable: caller is not the owner");
_;
}
/**
* @dev Leaves the contract without owner. It will not be possible to call
* `onlyOwner` functions anymore. Can only be called by the current owner.
*
* NOTE: Renouncing ownership will leave the contract without an owner,
* thereby removing any functionality that is only available to the owner.
*/
function renounceOwnership() public virtual onlyOwner {
emit OwnershipTransferred(_owner, address(0));
_owner = address(0);
}
/**
* @dev Transfers ownership of the contract to a new account (`newOwner`).
* Can only be called by the current owner.
*/
function transferOwnership(address newOwner) public virtual onlyOwner {
require(newOwner != address(0), "Ownable: new owner is the zero address");
emit OwnershipTransferred(_owner, newOwner);
_owner = newOwner;
}
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.6.2;
/**
* @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
* ====
*/
function isContract(address account) internal view returns (bool) {
// This method relies in extcodesize, which returns 0 for contracts in
// construction, since the code is only stored at the end of the
// constructor execution.
uint256 size;
// solhint-disable-next-line no-inline-assembly
assembly { size := extcodesize(account) }
return size > 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");
// solhint-disable-next-line avoid-low-level-calls, avoid-call-value
(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 functionCall(target, data, "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");
return _functionCallWithValue(target, data, value, errorMessage);
}
function _functionCallWithValue(address target, bytes memory data, uint256 weiValue, string memory errorMessage) private returns (bytes memory) {
require(isContract(target), "Address: call to non-contract");
// solhint-disable-next-line avoid-low-level-calls
(bool success, bytes memory returndata) = target.call{ value: weiValue }(data);
if (success) {
return returndata;
} else {
// 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
// solhint-disable-next-line no-inline-assembly
assembly {
let returndata_size := mload(returndata)
revert(add(32, returndata), returndata_size)
}
} else {
revert(errorMessage);
}
}
}
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.6.0;
/*
* @dev Provides information about the current execution context, including the
* sender of the transaction and its data. While these are generally available
* via msg.sender and msg.data, they should not be accessed in such a direct
* manner, since when dealing with GSN meta-transactions the account sending and
* paying for execution may not be the actual sender (as far as an application
* is concerned).
*
* This contract is only required for intermediate, library-like contracts.
*/
abstract contract Context {
function _msgSender() internal view virtual returns (address payable) {
return msg.sender;
}
function _msgData() internal view virtual returns (bytes memory) {
this; // silence state mutability warning without generating bytecode - see https://github.com/ethereum/solidity/issues/2691
return msg.data;
}
}
// pragma solidity ^0.6.0;
// import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
// import "@openzeppelin/contracts/token/ERC20/SafeERC20.sol";
// import "@openzeppelin/contracts/utils/EnumerableSet.sol";
// import "@openzeppelin/contracts/math/SafeMath.sol";
// import "@openzeppelin/contracts/access/Ownable.sol";
// import "../interfaces/IERC20MintBurn.sol";
// import "../interfaces/IMuse.sol";
// import "./NFT20.sol";
// import "hardhat/console.sol";
// interface IMigratorChef {
// // Perform LP token migration from legacy UniswapV2 to tokenSwap.
// // Take the current LP token address and return the new LP token address.
// // Migrator should have full access to the caller's LP token.
// // Return the new LP token address.
// //
// // XXX Migrator must have allowance access to UniswapV2 LP tokens.
// // tokenSwap must mint EXACTLY the same amount of tokenSwap LP tokens or
// // else something bad will happen. Traditional UniswapV2 does not
// // do that so be careful!
// function migrate(IERC20 token) external returns (IERC20);
// }
// // MasterChef is the master of token. He can make token and he is a fair guy.
// //
// // Note that it's ownable and the owner wields tremendous power. The ownership
// // will be transferred to a governance smart contract once token is sufficiently
// // distributed and the community can show to govern itself.
// //
// // Have fun reading it. Hopefully it's bug-free. God bless.
// contract DuckChef2 is Ownable {
// using SafeMath for uint256;
// using SafeERC20 for IERC20;
// // Info of each user.
// struct NftInfo {
// uint256 amount; // How many LP tokens the user has provided.
// uint256 rewardDebt; // Reward debt. See explanation below.
// //
// // We do some fancy math here. Basically, any point in time, the amount of tokens
// // entitled to a user but is pending to be distributed is:
// //
// // pending reward = (user.amount * pool.acctokenPerShare) - user.rewardDebt
// //
// // Whenever a user deposits or withdraws LP tokens to a pool. Here's what happens:
// // 1. The pool's `acctokenPerShare` (and `lastRewardBlock`) gets updated.
// // 2. User receives the pending reward sent to his/her address.
// // 3. User's `amount` gets updated.
// // 4. User's `rewardDebt` gets updated.
// }
// // Info of each pool.
// struct PoolInfo {
// IERC20 lpToken; // Address of LP token contract.
// uint256 allocPoint; // How many allocation points assigned to this pool. tokens to distribute per block.
// uint256 lastRewardBlock; // Last block number that tokens distribution occurs.
// uint256 accTokenPerShare; // Accumulated tokens per share, times 1e12. See below.
// }
// // The token TOKEN!
// IERC20MintBurn public token;
// // the NFT20 Contract
// IMuse public nft20;
// // Dev address.
// address public devaddr;
// // Block number when bonus token period ends.
// uint256 public bonusEndBlock;
// // token tokens created per block.
// uint256 public tokenPerBlock;
// // Bonus muliplier for early token makers.
// uint256 public constant BONUS_MULTIPLIER = 10;
// // The migrator contract. It has a lot of power. Can only be set through governance (owner).
// IMigratorChef public migrator;
// // Info of each pool.
// PoolInfo[] public poolInfo;
// // Info of each NFT that registered to get rewards.
// mapping(uint256 => NftInfo) public nftInfo;
// // Total allocation points. Must be the sum of all allocation points in all pools.
// uint256 public totalAllocPoint = 0;
// // The block number when token mining starts.
// uint256 public startBlock;
// event Deposit(address indexed user, uint256 indexed pid, uint256 amount);
// event Withdraw(address indexed user, uint256 indexed pid, uint256 amount);
// event EmergencyWithdraw(
// address indexed user,
// uint256 indexed pid,
// uint256 amount
// );
// constructor(
// IERC20MintBurn _token,
// IMuse _nft20,
// address _devaddr,
// uint256 _tokenPerBlock,
// uint256 _startBlock,
// uint256 _bonusEndBlock
// ) public {
// token = _token;
// nft20 = _nft20;
// devaddr = _devaddr;
// tokenPerBlock = _tokenPerBlock;
// bonusEndBlock = _bonusEndBlock;
// startBlock = _startBlock;
// }
// function poolLength() external view returns (uint256) {
// return poolInfo.length;
// }
// // Add a new lp to the pool. Can only be called by the owner.
// // XXX DO NOT add the same LP token more than once. Rewards will be messed up if you do.
// function add(
// uint256 _allocPoint,
// IERC20 _lpToken,
// bool _withUpdate
// ) public onlyOwner {
// if (_withUpdate) {
// massUpdatePools();
// }
// uint256 lastRewardBlock =
// block.number > startBlock ? block.number : startBlock;
// totalAllocPoint = totalAllocPoint.add(_allocPoint);
// poolInfo.push(
// PoolInfo({
// lpToken: _lpToken,
// allocPoint: _allocPoint,
// lastRewardBlock: lastRewardBlock,
// accTokenPerShare: 0
// })
// );
// }
// // Update the given pool's token allocation point. Can only be called by the owner.
// function set(
// uint256 _pid,
// uint256 _allocPoint,
// bool _withUpdate
// ) public onlyOwner {
// if (_withUpdate) {
// massUpdatePools();
// }
// totalAllocPoint = totalAllocPoint.sub(poolInfo[_pid].allocPoint).add(
// _allocPoint
// );
// poolInfo[_pid].allocPoint = _allocPoint;
// }
// // Set the migrator contract. Can only be called by the owner.
// function setMigrator(IMigratorChef _migrator) public onlyOwner {
// migrator = _migrator;
// }
// // Migrate lp token to another lp contract. Can be called by anyone. We trust that migrator contract is good.
// function migrate(uint256 _pid) public {
// require(address(migrator) != address(0), "migrate: no migrator");
// PoolInfo storage pool = poolInfo[_pid];
// IERC20 lpToken = pool.lpToken;
// uint256 bal = lpToken.balanceOf(address(this));
// lpToken.safeApprove(address(migrator), bal);
// IERC20 newLpToken = migrator.migrate(lpToken);
// require(bal == newLpToken.balanceOf(address(this)), "migrate: bad");
// pool.lpToken = newLpToken;
// }
// // Return reward multiplier over the given _from to _to block.
// function getMultiplier(uint256 _from, uint256 _to)
// public
// view
// returns (uint256)
// {
// if (_to <= bonusEndBlock) {
// return _to.sub(_from).mul(BONUS_MULTIPLIER);
// } else if (_from >= bonusEndBlock) {
// return _to.sub(_from);
// } else {
// return
// bonusEndBlock.sub(_from).mul(BONUS_MULTIPLIER).add(
// _to.sub(bonusEndBlock)
// );
// }
// }
// // View function to see pending tokens on frontend.
// function pendingToken(uint256 _pid, uint256 _nftId)
// external
// view
// returns (uint256)
// {
// PoolInfo storage pool = poolInfo[_pid];
// NftInfo storage nft = nftInfo[_nftId];
// console.log("amount", nft.amount);
// uint256 accTokenPerShare = pool.accTokenPerShare;
// console.log("accTokenPerShare", accTokenPerShare);
// uint256 lpSupply = nft20.totalStaked(address(pool.lpToken));
// console.log("lpSupply", lpSupply);
// // uint256 lpSupply = pool.lpToken.balanceOf(address(this));
// if (block.number > pool.lastRewardBlock && lpSupply != 0) {
// uint256 multiplier =
// getMultiplier(pool.lastRewardBlock, block.number);
// uint256 tokenReward =
// multiplier.mul(tokenPerBlock).mul(pool.allocPoint).div(
// totalAllocPoint
// );
// accTokenPerShare = accTokenPerShare.add(
// tokenReward.mul(1e12).div(lpSupply)
// );
// console.log("accTokenPerShare", accTokenPerShare);
// }
// console.log(
// "last",
// nft.amount.mul(accTokenPerShare).div(1e12).sub(nft.rewardDebt)
// );
// console.log("nft.rewardDebt", nft.rewardDebt);
// return nft.amount.mul(accTokenPerShare).div(1e12).sub(nft.rewardDebt);
// }
// // Update reward variables for all pools. Be careful of gas spending!
// function massUpdatePools() public {
// uint256 length = poolInfo.length;
// for (uint256 pid = 0; pid < length; ++pid) {
// updatePool(pid);
// }
// }
// // Update reward variables of the given pool to be up-to-date.
// function updatePool(uint256 _pid) public {
// PoolInfo storage pool = poolInfo[_pid];
// if (block.number <= pool.lastRewardBlock) {
// return;
// }
// uint256 lpSupply = nft20.totalStaked(address(pool.lpToken));
// // uint256 lpSupply = pool.lpToken.balanceOf(address(this));
// if (lpSupply == 0) {
// pool.lastRewardBlock = block.number;
// return;
// }
// uint256 multiplier = getMultiplier(pool.lastRewardBlock, block.number);
// uint256 tokenReward =
// multiplier.mul(tokenPerBlock).mul(pool.allocPoint).div(
// totalAllocPoint
// );
// token.mint(devaddr, tokenReward.div(10));
// token.mint(address(this), tokenReward);
// pool.accTokenPerShare = pool.accTokenPerShare.add(
// tokenReward.mul(1e12).div(lpSupply)
// );
// pool.lastRewardBlock = block.number;
// }
// // Register NFT20 token to DuckChef for $TOKEN allocation.
// function register(uint256 _pid, uint256 _nftId) public {
// PoolInfo storage pool = poolInfo[_pid];
// (address _erc20address, uint256 _amount, ) = nft20.getNFTInfo(_nftId);
// require(_erc20address == address(pool.lpToken), "NFT don't match pool");
// require(nft20.ownerOf(_nftId) == msg.sender, "!owner");
// NftInfo storage nft = nftInfo[_nftId];
// require(nft.amount == 0, "Can't register twice");
// updatePool(_pid);
// nft.amount = _amount;
// // @Maybe we can ake this out as it will be by single NFT each time and when withdraw
// // NFT info is deleted.
// // TODO! check this, without this was returning 0 all the time.
// // nft.rewardDebt = nft.amount.mul(pool.accTokenPerShare).div(1e12);
// emit Deposit(msg.sender, _pid, _nftId);
// }
// // Withdraw all earnings and unregister NFT.
// function withdraw(uint256 _pid, uint256 _nftId) public {
// PoolInfo storage pool = poolInfo[_pid];
// // does nft token match pool?
// (address _erc20address, , ) = nft20.getNFTInfo(_nftId);
// require(_erc20address == address(pool.lpToken), "NFT don't match pool");
// // make sure msg.sender is owner of nft
// require(nft20.ownerOf(_nftId) == msg.sender, "!owner");
// NftInfo storage nft = nftInfo[_nftId];
// updatePool(_pid);
// uint256 pending =
// nft.amount.mul(pool.accTokenPerShare).div(1e12).sub(nft.rewardDebt);
// if (pending > 0) {
// safeTokenTransfer(msg.sender, pending);
// }
// // delete this NFT as it is paying off all earnings up until this point.
// delete nftInfo[_nftId];
// emit Withdraw(msg.sender, _pid, _nftId);
// }
// //if staker owned many NFTs with same lp tokens use batch withdraw
// function withdrawBatch(uint256 _pid, uint256[] memory _nftIds) public {
// for (uint256 i = 0; i < _nftIds.length; i++) {
// withdraw(_pid, _nftIds[i]);
// }
// }
// // Safe token transfer function, just in case if rounding error causes pool to not have enough tokens.
// function safeTokenTransfer(address _to, uint256 _amount) internal {
// uint256 tokenBal = token.balanceOf(address(this));
// if (_amount > tokenBal) {
// token.transfer(_to, tokenBal);
// } else {
// token.transfer(_to, _amount);
// }
// }
// // Update dev address by the previous dev.
// function dev(address _devaddr) public {
// require(msg.sender == devaddr, "dev: wut?");
// devaddr = _devaddr;
// }
// }