Source Code (Proxy)
More Info
Private Name Tags
ContractCreator
TokenTracker
Latest 25 from a total of 1,732 transactions
| Transaction Hash |
|
Block
|
From
|
To
|
|||||
|---|---|---|---|---|---|---|---|---|---|
| Withdraw Surplus | 44782827 | 36 hrs ago | IN | 0 ETH | 0.00000157 | ||||
| Transfer From | 44782813 | 36 hrs ago | IN | 0 ETH | 0.00000096 | ||||
| Claim | 44739677 | 2 days ago | IN | 0 ETH | 0.000001 | ||||
| Claim | 44739657 | 2 days ago | IN | 0 ETH | 0.00000102 | ||||
| Claim | 44739618 | 2 days ago | IN | 0 ETH | 0.00000105 | ||||
| Claim | 44663360 | 4 days ago | IN | 0 ETH | 0.00000183 | ||||
| Claim | 44663331 | 4 days ago | IN | 0 ETH | 0.00000197 | ||||
| Claim | 44651659 | 4 days ago | IN | 0 ETH | 0.00000248 | ||||
| Withdraw Surplus | 44601441 | 5 days ago | IN | 0 ETH | 0.00000114 | ||||
| Withdraw Surplus | 44476082 | 8 days ago | IN | 0 ETH | 0.00000188 | ||||
| Transfer From | 44476062 | 8 days ago | IN | 0 ETH | 0.00000138 | ||||
| Stake | 44476054 | 8 days ago | IN | 0 ETH | 0.00000207 | ||||
| Withdraw Surplus | 44475859 | 8 days ago | IN | 0 ETH | 0.0000018 | ||||
| Withdraw Surplus | 44410234 | 10 days ago | IN | 0 ETH | 0.00000169 | ||||
| Withdraw Surplus | 44410219 | 10 days ago | IN | 0 ETH | 0.00000127 | ||||
| Withdraw Surplus | 44410202 | 10 days ago | IN | 0 ETH | 0.00000132 | ||||
| Withdraw Surplus | 44410186 | 10 days ago | IN | 0 ETH | 0.00000127 | ||||
| Withdraw Surplus | 44410166 | 10 days ago | IN | 0 ETH | 0.00000132 | ||||
| Withdraw Surplus | 44410152 | 10 days ago | IN | 0 ETH | 0.00000169 | ||||
| Claim | 44372829 | 10 days ago | IN | 0 ETH | 0.0000015 | ||||
| Claim | 44354494 | 11 days ago | IN | 0 ETH | 0.00000134 | ||||
| Withdraw Surplus | 44340873 | 11 days ago | IN | 0 ETH | 0.00000186 | ||||
| Transfer From | 44340721 | 11 days ago | IN | 0 ETH | 0.00000086 | ||||
| Claim | 44318938 | 12 days ago | IN | 0 ETH | 0.00000166 | ||||
| Claim | 44318927 | 12 days ago | IN | 0 ETH | 0.00000148 |
Latest 1 internal transaction
| Parent Transaction Hash | Block | From | To | |||
|---|---|---|---|---|---|---|
| 31783811 | 302 days ago | 0.00003067 ETH |
Cross-Chain Transactions
Loading...
Loading
Contract Name:
ONFTDiamond
Compiler Version
v0.8.29+commit.ab55807c
Optimization Enabled:
Yes with 20 runs
Other Settings:
shanghai EvmVersion
Contract Source Code (Solidity Standard Json-Input format)
// SPDX-License-Identifier: SEE LICENSE IN LICENSE
pragma solidity ^0.8.29;
import "@solidstate/contracts/proxy/diamond/SolidStateDiamond.sol";
contract ONFTDiamond is SolidStateDiamond {
// The ONFTDiamond contract inherits from SolidStateDiamond, which provides the necessary
// functionality for a diamond proxy pattern implementation.
// Additional functionality specific to the ONFT (On-Chain Non-Fungible Token) can be added here.
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { ILayerZeroEndpointV2 } from "@layerzerolabs/lz-evm-protocol-v2/contracts/interfaces/ILayerZeroEndpointV2.sol";
/**
* @title IOAppCore
*/
interface IOAppCore {
// Custom error messages
error OnlyPeer(uint32 eid, bytes32 sender);
error NoPeer(uint32 eid);
error InvalidEndpointCall();
error InvalidDelegate();
// Event emitted when a peer (OApp) is set for a corresponding endpoint
event PeerSet(uint32 eid, bytes32 peer);
/**
* @notice Retrieves the OApp version information.
* @return senderVersion The version of the OAppSender.sol contract.
* @return receiverVersion The version of the OAppReceiver.sol contract.
*/
function oAppVersion() external view returns (uint64 senderVersion, uint64 receiverVersion);
/**
* @notice Retrieves the LayerZero endpoint associated with the OApp.
* @return iEndpoint The LayerZero endpoint as an interface.
*/
function endpoint() external view returns (ILayerZeroEndpointV2 iEndpoint);
/**
* @notice Retrieves the peer (OApp) associated with a corresponding endpoint.
* @param _eid The endpoint ID.
* @return peer The peer address (OApp instance) associated with the corresponding endpoint.
*/
function peers(uint32 _eid) external view returns (bytes32 peer);
/**
* @notice Sets the peer address (OApp instance) for a corresponding endpoint.
* @param _eid The endpoint ID.
* @param _peer The address of the peer to be associated with the corresponding endpoint.
*/
function setPeer(uint32 _eid, bytes32 _peer) external;
/**
* @notice Sets the delegate address for the OApp Core.
* @param _delegate The address of the delegate to be set.
*/
function setDelegate(address _delegate) external;
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { Ownable } from "@openzeppelin/contracts/access/Ownable.sol";
import { IOAppCore, ILayerZeroEndpointV2 } from "./interfaces/IOAppCore.sol";
/**
* @title OAppCore
* @dev Abstract contract implementing the IOAppCore interface with basic OApp configurations.
*/
abstract contract OAppCore is IOAppCore, Ownable {
// The LayerZero endpoint associated with the given OApp
ILayerZeroEndpointV2 public immutable endpoint;
// Mapping to store peers associated with corresponding endpoints
mapping(uint32 eid => bytes32 peer) public peers;
/**
* @dev Constructor to initialize the OAppCore with the provided endpoint and delegate.
* @param _endpoint The address of the LOCAL Layer Zero endpoint.
* @param _delegate The delegate capable of making OApp configurations inside of the endpoint.
*
* @dev The delegate typically should be set as the owner of the contract.
*/
constructor(address _endpoint, address _delegate) {
endpoint = ILayerZeroEndpointV2(_endpoint);
if (_delegate == address(0)) revert InvalidDelegate();
endpoint.setDelegate(_delegate);
}
/**
* @notice Sets the peer address (OApp instance) for a corresponding endpoint.
* @param _eid The endpoint ID.
* @param _peer The address of the peer to be associated with the corresponding endpoint.
*
* @dev Only the owner/admin of the OApp can call this function.
* @dev Indicates that the peer is trusted to send LayerZero messages to this OApp.
* @dev Set this to bytes32(0) to remove the peer address.
* @dev Peer is a bytes32 to accommodate non-evm chains.
*/
function setPeer(uint32 _eid, bytes32 _peer) public virtual onlyOwner {
_setPeer(_eid, _peer);
}
/**
* @notice Sets the peer address (OApp instance) for a corresponding endpoint.
* @param _eid The endpoint ID.
* @param _peer The address of the peer to be associated with the corresponding endpoint.
*
* @dev Indicates that the peer is trusted to send LayerZero messages to this OApp.
* @dev Set this to bytes32(0) to remove the peer address.
* @dev Peer is a bytes32 to accommodate non-evm chains.
*/
function _setPeer(uint32 _eid, bytes32 _peer) internal virtual {
peers[_eid] = _peer;
emit PeerSet(_eid, _peer);
}
/**
* @notice Internal function to get the peer address associated with a specific endpoint; reverts if NOT set.
* ie. the peer is set to bytes32(0).
* @param _eid The endpoint ID.
* @return peer The address of the peer associated with the specified endpoint.
*/
function _getPeerOrRevert(uint32 _eid) internal view virtual returns (bytes32) {
bytes32 peer = peers[_eid];
if (peer == bytes32(0)) revert NoPeer(_eid);
return peer;
}
/**
* @notice Sets the delegate address for the OApp.
* @param _delegate The address of the delegate to be set.
*
* @dev Only the owner/admin of the OApp can call this function.
* @dev Provides the ability for a delegate to set configs, on behalf of the OApp, directly on the Endpoint contract.
*/
function setDelegate(address _delegate) public onlyOwner {
endpoint.setDelegate(_delegate);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { SafeERC20, IERC20 } from "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";
import { MessagingParams, MessagingFee, MessagingReceipt } from "@layerzerolabs/lz-evm-protocol-v2/contracts/interfaces/ILayerZeroEndpointV2.sol";
import { OAppCore } from "./OAppCore.sol";
/**
* @title OAppSender
* @dev Abstract contract implementing the OAppSender functionality for sending messages to a LayerZero endpoint.
*/
abstract contract OAppSender is OAppCore {
using SafeERC20 for IERC20;
// Custom error messages
error NotEnoughNative(uint256 msgValue);
error LzTokenUnavailable();
// @dev The version of the OAppSender implementation.
// @dev Version is bumped when changes are made to this contract.
uint64 internal constant SENDER_VERSION = 1;
/**
* @notice Retrieves the OApp version information.
* @return senderVersion The version of the OAppSender.sol contract.
* @return receiverVersion The version of the OAppReceiver.sol contract.
*
* @dev Providing 0 as the default for OAppReceiver version. Indicates that the OAppReceiver is not implemented.
* ie. this is a SEND only OApp.
* @dev If the OApp uses both OAppSender and OAppReceiver, then this needs to be override returning the correct versions
*/
function oAppVersion() public view virtual returns (uint64 senderVersion, uint64 receiverVersion) {
return (SENDER_VERSION, 0);
}
/**
* @dev Internal function to interact with the LayerZero EndpointV2.quote() for fee calculation.
* @param _dstEid The destination endpoint ID.
* @param _message The message payload.
* @param _options Additional options for the message.
* @param _payInLzToken Flag indicating whether to pay the fee in LZ tokens.
* @return fee The calculated MessagingFee for the message.
* - nativeFee: The native fee for the message.
* - lzTokenFee: The LZ token fee for the message.
*/
function _quote(
uint32 _dstEid,
bytes memory _message,
bytes memory _options,
bool _payInLzToken
) internal view virtual returns (MessagingFee memory fee) {
return
endpoint.quote(
MessagingParams(_dstEid, _getPeerOrRevert(_dstEid), _message, _options, _payInLzToken),
address(this)
);
}
/**
* @dev Internal function to interact with the LayerZero EndpointV2.send() for sending a message.
* @param _dstEid The destination endpoint ID.
* @param _message The message payload.
* @param _options Additional options for the message.
* @param _fee The calculated LayerZero fee for the message.
* - nativeFee: The native fee.
* - lzTokenFee: The lzToken fee.
* @param _refundAddress The address to receive any excess fee values sent to the endpoint.
* @return receipt The receipt for the sent message.
* - guid: The unique identifier for the sent message.
* - nonce: The nonce of the sent message.
* - fee: The LayerZero fee incurred for the message.
*/
function _lzSend(
uint32 _dstEid,
bytes memory _message,
bytes memory _options,
MessagingFee memory _fee,
address _refundAddress
) internal virtual returns (MessagingReceipt memory receipt) {
// @dev Push corresponding fees to the endpoint, any excess is sent back to the _refundAddress from the endpoint.
uint256 messageValue = _payNative(_fee.nativeFee);
if (_fee.lzTokenFee > 0) _payLzToken(_fee.lzTokenFee);
return
// solhint-disable-next-line check-send-result
endpoint.send{ value: messageValue }(
MessagingParams(_dstEid, _getPeerOrRevert(_dstEid), _message, _options, _fee.lzTokenFee > 0),
_refundAddress
);
}
/**
* @dev Internal function to pay the native fee associated with the message.
* @param _nativeFee The native fee to be paid.
* @return nativeFee The amount of native currency paid.
*
* @dev If the OApp needs to initiate MULTIPLE LayerZero messages in a single transaction,
* this will need to be overridden because msg.value would contain multiple lzFees.
* @dev Should be overridden in the event the LayerZero endpoint requires a different native currency.
* @dev Some EVMs use an ERC20 as a method for paying transactions/gasFees.
* @dev The endpoint is EITHER/OR, ie. it will NOT support both types of native payment at a time.
*/
function _payNative(uint256 _nativeFee) internal virtual returns (uint256 nativeFee) {
if (msg.value != _nativeFee) revert NotEnoughNative(msg.value);
return _nativeFee;
}
/**
* @dev Internal function to pay the LZ token fee associated with the message.
* @param _lzTokenFee The LZ token fee to be paid.
*
* @dev If the caller is trying to pay in the specified lzToken, then the lzTokenFee is passed to the endpoint.
* @dev Any excess sent, is passed back to the specified _refundAddress in the _lzSend().
*/
function _payLzToken(uint256 _lzTokenFee) internal virtual {
// @dev Cannot cache the token because it is not immutable in the endpoint.
address lzToken = endpoint.lzToken();
if (lzToken == address(0)) revert LzTokenUnavailable();
// Pay LZ token fee by sending tokens to the endpoint.
IERC20(lzToken).safeTransferFrom(msg.sender, address(endpoint), _lzTokenFee);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { MessagingReceipt, MessagingFee } from "../../oapp/OAppSender.sol";
/**
* @dev Struct representing token parameters for the OFT send() operation.
*/
struct SendParam {
uint32 dstEid; // Destination endpoint ID.
bytes32 to; // Recipient address.
uint256 amountLD; // Amount to send in local decimals.
uint256 minAmountLD; // Minimum amount to send in local decimals.
bytes extraOptions; // Additional options supplied by the caller to be used in the LayerZero message.
bytes composeMsg; // The composed message for the send() operation.
bytes oftCmd; // The OFT command to be executed, unused in default OFT implementations.
}
/**
* @dev Struct representing OFT limit information.
* @dev These amounts can change dynamically and are up the the specific oft implementation.
*/
struct OFTLimit {
uint256 minAmountLD; // Minimum amount in local decimals that can be sent to the recipient.
uint256 maxAmountLD; // Maximum amount in local decimals that can be sent to the recipient.
}
/**
* @dev Struct representing OFT receipt information.
*/
struct OFTReceipt {
uint256 amountSentLD; // Amount of tokens ACTUALLY debited from the sender in local decimals.
// @dev In non-default implementations, the amountReceivedLD COULD differ from this value.
uint256 amountReceivedLD; // Amount of tokens to be received on the remote side.
}
/**
* @dev Struct representing OFT fee details.
* @dev Future proof mechanism to provide a standardized way to communicate fees to things like a UI.
*/
struct OFTFeeDetail {
int256 feeAmountLD; // Amount of the fee in local decimals.
string description; // Description of the fee.
}
/**
* @title IOFT
* @dev Interface for the OftChain (OFT) token.
* @dev Does not inherit ERC20 to accommodate usage by OFTAdapter as well.
* @dev This specific interface ID is '0x02e49c2c'.
*/
interface IOFT {
// Custom error messages
error InvalidLocalDecimals();
error SlippageExceeded(uint256 amountLD, uint256 minAmountLD);
// Events
event OFTSent(
bytes32 indexed guid, // GUID of the OFT message.
uint32 dstEid, // Destination Endpoint ID.
address indexed fromAddress, // Address of the sender on the src chain.
uint256 amountSentLD, // Amount of tokens sent in local decimals.
uint256 amountReceivedLD // Amount of tokens received in local decimals.
);
event OFTReceived(
bytes32 indexed guid, // GUID of the OFT message.
uint32 srcEid, // Source Endpoint ID.
address indexed toAddress, // Address of the recipient on the dst chain.
uint256 amountReceivedLD // Amount of tokens received in local decimals.
);
/**
* @notice Retrieves interfaceID and the version of the OFT.
* @return interfaceId The interface ID.
* @return version The version.
*
* @dev interfaceId: This specific interface ID is '0x02e49c2c'.
* @dev version: Indicates a cross-chain compatible msg encoding with other OFTs.
* @dev If a new feature is added to the OFT cross-chain msg encoding, the version will be incremented.
* ie. localOFT version(x,1) CAN send messages to remoteOFT version(x,1)
*/
function oftVersion() external view returns (bytes4 interfaceId, uint64 version);
/**
* @notice Retrieves the address of the token associated with the OFT.
* @return token The address of the ERC20 token implementation.
*/
function token() external view returns (address);
/**
* @notice Indicates whether the OFT contract requires approval of the 'token()' to send.
* @return requiresApproval Needs approval of the underlying token implementation.
*
* @dev Allows things like wallet implementers to determine integration requirements,
* without understanding the underlying token implementation.
*/
function approvalRequired() external view returns (bool);
/**
* @notice Retrieves the shared decimals of the OFT.
* @return sharedDecimals The shared decimals of the OFT.
*/
function sharedDecimals() external view returns (uint8);
/**
* @notice Provides a quote for OFT-related operations.
* @param _sendParam The parameters for the send operation.
* @return limit The OFT limit information.
* @return oftFeeDetails The details of OFT fees.
* @return receipt The OFT receipt information.
*/
function quoteOFT(
SendParam calldata _sendParam
) external view returns (OFTLimit memory, OFTFeeDetail[] memory oftFeeDetails, OFTReceipt memory);
/**
* @notice Provides a quote for the send() operation.
* @param _sendParam The parameters for the send() operation.
* @param _payInLzToken Flag indicating whether the caller is paying in the LZ token.
* @return fee The calculated LayerZero messaging fee from the send() operation.
*
* @dev MessagingFee: LayerZero msg fee
* - nativeFee: The native fee.
* - lzTokenFee: The lzToken fee.
*/
function quoteSend(SendParam calldata _sendParam, bool _payInLzToken) external view returns (MessagingFee memory);
/**
* @notice Executes the send() operation.
* @param _sendParam The parameters for the send operation.
* @param _fee The fee information supplied by the caller.
* - nativeFee: The native fee.
* - lzTokenFee: The lzToken fee.
* @param _refundAddress The address to receive any excess funds from fees etc. on the src.
* @return receipt The LayerZero messaging receipt from the send() operation.
* @return oftReceipt The OFT receipt information.
*
* @dev MessagingReceipt: LayerZero msg receipt
* - guid: The unique identifier for the sent message.
* - nonce: The nonce of the sent message.
* - fee: The LayerZero fee incurred for the message.
*/
function send(
SendParam calldata _sendParam,
MessagingFee calldata _fee,
address _refundAddress
) external payable returns (MessagingReceipt memory, OFTReceipt memory);
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
import { IMessageLibManager } from "./IMessageLibManager.sol";
import { IMessagingComposer } from "./IMessagingComposer.sol";
import { IMessagingChannel } from "./IMessagingChannel.sol";
import { IMessagingContext } from "./IMessagingContext.sol";
struct MessagingParams {
uint32 dstEid;
bytes32 receiver;
bytes message;
bytes options;
bool payInLzToken;
}
struct MessagingReceipt {
bytes32 guid;
uint64 nonce;
MessagingFee fee;
}
struct MessagingFee {
uint256 nativeFee;
uint256 lzTokenFee;
}
struct Origin {
uint32 srcEid;
bytes32 sender;
uint64 nonce;
}
interface ILayerZeroEndpointV2 is IMessageLibManager, IMessagingComposer, IMessagingChannel, IMessagingContext {
event PacketSent(bytes encodedPayload, bytes options, address sendLibrary);
event PacketVerified(Origin origin, address receiver, bytes32 payloadHash);
event PacketDelivered(Origin origin, address receiver);
event LzReceiveAlert(
address indexed receiver,
address indexed executor,
Origin origin,
bytes32 guid,
uint256 gas,
uint256 value,
bytes message,
bytes extraData,
bytes reason
);
event LzTokenSet(address token);
event DelegateSet(address sender, address delegate);
function quote(MessagingParams calldata _params, address _sender) external view returns (MessagingFee memory);
function send(
MessagingParams calldata _params,
address _refundAddress
) external payable returns (MessagingReceipt memory);
function verify(Origin calldata _origin, address _receiver, bytes32 _payloadHash) external;
function verifiable(Origin calldata _origin, address _receiver) external view returns (bool);
function initializable(Origin calldata _origin, address _receiver) external view returns (bool);
function lzReceive(
Origin calldata _origin,
address _receiver,
bytes32 _guid,
bytes calldata _message,
bytes calldata _extraData
) external payable;
// oapp can burn messages partially by calling this function with its own business logic if messages are verified in order
function clear(address _oapp, Origin calldata _origin, bytes32 _guid, bytes calldata _message) external;
function setLzToken(address _lzToken) external;
function lzToken() external view returns (address);
function nativeToken() external view returns (address);
function setDelegate(address _delegate) external;
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
struct SetConfigParam {
uint32 eid;
uint32 configType;
bytes config;
}
interface IMessageLibManager {
struct Timeout {
address lib;
uint256 expiry;
}
event LibraryRegistered(address newLib);
event DefaultSendLibrarySet(uint32 eid, address newLib);
event DefaultReceiveLibrarySet(uint32 eid, address newLib);
event DefaultReceiveLibraryTimeoutSet(uint32 eid, address oldLib, uint256 expiry);
event SendLibrarySet(address sender, uint32 eid, address newLib);
event ReceiveLibrarySet(address receiver, uint32 eid, address newLib);
event ReceiveLibraryTimeoutSet(address receiver, uint32 eid, address oldLib, uint256 timeout);
function registerLibrary(address _lib) external;
function isRegisteredLibrary(address _lib) external view returns (bool);
function getRegisteredLibraries() external view returns (address[] memory);
function setDefaultSendLibrary(uint32 _eid, address _newLib) external;
function defaultSendLibrary(uint32 _eid) external view returns (address);
function setDefaultReceiveLibrary(uint32 _eid, address _newLib, uint256 _gracePeriod) external;
function defaultReceiveLibrary(uint32 _eid) external view returns (address);
function setDefaultReceiveLibraryTimeout(uint32 _eid, address _lib, uint256 _expiry) external;
function defaultReceiveLibraryTimeout(uint32 _eid) external view returns (address lib, uint256 expiry);
function isSupportedEid(uint32 _eid) external view returns (bool);
function isValidReceiveLibrary(address _receiver, uint32 _eid, address _lib) external view returns (bool);
/// ------------------- OApp interfaces -------------------
function setSendLibrary(address _oapp, uint32 _eid, address _newLib) external;
function getSendLibrary(address _sender, uint32 _eid) external view returns (address lib);
function isDefaultSendLibrary(address _sender, uint32 _eid) external view returns (bool);
function setReceiveLibrary(address _oapp, uint32 _eid, address _newLib, uint256 _gracePeriod) external;
function getReceiveLibrary(address _receiver, uint32 _eid) external view returns (address lib, bool isDefault);
function setReceiveLibraryTimeout(address _oapp, uint32 _eid, address _lib, uint256 _expiry) external;
function receiveLibraryTimeout(address _receiver, uint32 _eid) external view returns (address lib, uint256 expiry);
function setConfig(address _oapp, address _lib, SetConfigParam[] calldata _params) external;
function getConfig(
address _oapp,
address _lib,
uint32 _eid,
uint32 _configType
) external view returns (bytes memory config);
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
interface IMessagingChannel {
event InboundNonceSkipped(uint32 srcEid, bytes32 sender, address receiver, uint64 nonce);
event PacketNilified(uint32 srcEid, bytes32 sender, address receiver, uint64 nonce, bytes32 payloadHash);
event PacketBurnt(uint32 srcEid, bytes32 sender, address receiver, uint64 nonce, bytes32 payloadHash);
function eid() external view returns (uint32);
// this is an emergency function if a message cannot be verified for some reasons
// required to provide _nextNonce to avoid race condition
function skip(address _oapp, uint32 _srcEid, bytes32 _sender, uint64 _nonce) external;
function nilify(address _oapp, uint32 _srcEid, bytes32 _sender, uint64 _nonce, bytes32 _payloadHash) external;
function burn(address _oapp, uint32 _srcEid, bytes32 _sender, uint64 _nonce, bytes32 _payloadHash) external;
function nextGuid(address _sender, uint32 _dstEid, bytes32 _receiver) external view returns (bytes32);
function inboundNonce(address _receiver, uint32 _srcEid, bytes32 _sender) external view returns (uint64);
function outboundNonce(address _sender, uint32 _dstEid, bytes32 _receiver) external view returns (uint64);
function inboundPayloadHash(
address _receiver,
uint32 _srcEid,
bytes32 _sender,
uint64 _nonce
) external view returns (bytes32);
function lazyInboundNonce(address _receiver, uint32 _srcEid, bytes32 _sender) external view returns (uint64);
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
interface IMessagingComposer {
event ComposeSent(address from, address to, bytes32 guid, uint16 index, bytes message);
event ComposeDelivered(address from, address to, bytes32 guid, uint16 index);
event LzComposeAlert(
address indexed from,
address indexed to,
address indexed executor,
bytes32 guid,
uint16 index,
uint256 gas,
uint256 value,
bytes message,
bytes extraData,
bytes reason
);
function composeQueue(
address _from,
address _to,
bytes32 _guid,
uint16 _index
) external view returns (bytes32 messageHash);
function sendCompose(address _to, bytes32 _guid, uint16 _index, bytes calldata _message) external;
function lzCompose(
address _from,
address _to,
bytes32 _guid,
uint16 _index,
bytes calldata _message,
bytes calldata _extraData
) external payable;
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
interface IMessagingContext {
function isSendingMessage() external view returns (bool);
function getSendContext() external view returns (uint32 dstEid, address sender);
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)
pragma solidity ^0.8.20;
import {Context} from "../utils/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.
*
* The initial owner is set to the address provided by the deployer. 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.
*/
abstract contract Ownable is Context {
address private _owner;
/**
* @dev The caller account is not authorized to perform an operation.
*/
error OwnableUnauthorizedAccount(address account);
/**
* @dev The owner is not a valid owner account. (eg. `address(0)`)
*/
error OwnableInvalidOwner(address owner);
event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);
/**
* @dev Initializes the contract setting the address provided by the deployer as the initial owner.
*/
constructor(address initialOwner) {
if (initialOwner == address(0)) {
revert OwnableInvalidOwner(address(0));
}
_transferOwnership(initialOwner);
}
/**
* @dev Throws if called by any account other than the owner.
*/
modifier onlyOwner() {
_checkOwner();
_;
}
/**
* @dev Returns the address of the current owner.
*/
function owner() public view virtual returns (address) {
return _owner;
}
/**
* @dev Throws if the sender is not the owner.
*/
function _checkOwner() internal view virtual {
if (owner() != _msgSender()) {
revert OwnableUnauthorizedAccount(_msgSender());
}
}
/**
* @dev Leaves the contract without owner. It will not be possible to call
* `onlyOwner` functions. Can only be called by the current owner.
*
* NOTE: Renouncing ownership will leave the contract without an owner,
* thereby disabling any functionality that is only available to the owner.
*/
function renounceOwnership() public virtual onlyOwner {
_transferOwnership(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 {
if (newOwner == address(0)) {
revert OwnableInvalidOwner(address(0));
}
_transferOwnership(newOwner);
}
/**
* @dev Transfers ownership of the contract to a new account (`newOwner`).
* Internal function without access restriction.
*/
function _transferOwnership(address newOwner) internal virtual {
address oldOwner = _owner;
_owner = newOwner;
emit OwnershipTransferred(oldOwner, newOwner);
}
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/IERC1363.sol)
pragma solidity ^0.8.20;
import {IERC20} from "./IERC20.sol";
import {IERC165} from "./IERC165.sol";
/**
* @title IERC1363
* @dev Interface of the ERC-1363 standard as defined in the https://eips.ethereum.org/EIPS/eip-1363[ERC-1363].
*
* Defines an extension interface for ERC-20 tokens that supports executing code on a recipient contract
* after `transfer` or `transferFrom`, or code on a spender contract after `approve`, in a single transaction.
*/
interface IERC1363 is IERC20, IERC165 {
/*
* Note: the ERC-165 identifier for this interface is 0xb0202a11.
* 0xb0202a11 ===
* bytes4(keccak256('transferAndCall(address,uint256)')) ^
* bytes4(keccak256('transferAndCall(address,uint256,bytes)')) ^
* bytes4(keccak256('transferFromAndCall(address,address,uint256)')) ^
* bytes4(keccak256('transferFromAndCall(address,address,uint256,bytes)')) ^
* bytes4(keccak256('approveAndCall(address,uint256)')) ^
* bytes4(keccak256('approveAndCall(address,uint256,bytes)'))
*/
/**
* @dev Moves a `value` amount of tokens from the caller's account to `to`
* and then calls {IERC1363Receiver-onTransferReceived} on `to`.
* @param to The address which you want to transfer to.
* @param value The amount of tokens to be transferred.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function transferAndCall(address to, uint256 value) external returns (bool);
/**
* @dev Moves a `value` amount of tokens from the caller's account to `to`
* and then calls {IERC1363Receiver-onTransferReceived} on `to`.
* @param to The address which you want to transfer to.
* @param value The amount of tokens to be transferred.
* @param data Additional data with no specified format, sent in call to `to`.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function transferAndCall(address to, uint256 value, bytes calldata data) external returns (bool);
/**
* @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism
* and then calls {IERC1363Receiver-onTransferReceived} on `to`.
* @param from The address which you want to send tokens from.
* @param to The address which you want to transfer to.
* @param value The amount of tokens to be transferred.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function transferFromAndCall(address from, address to, uint256 value) external returns (bool);
/**
* @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism
* and then calls {IERC1363Receiver-onTransferReceived} on `to`.
* @param from The address which you want to send tokens from.
* @param to The address which you want to transfer to.
* @param value The amount of tokens to be transferred.
* @param data Additional data with no specified format, sent in call to `to`.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function transferFromAndCall(address from, address to, uint256 value, bytes calldata data) external returns (bool);
/**
* @dev Sets a `value` amount of tokens as the allowance of `spender` over the
* caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.
* @param spender The address which will spend the funds.
* @param value The amount of tokens to be spent.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function approveAndCall(address spender, uint256 value) external returns (bool);
/**
* @dev Sets a `value` amount of tokens as the allowance of `spender` over the
* caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.
* @param spender The address which will spend the funds.
* @param value The amount of tokens to be spent.
* @param data Additional data with no specified format, sent in call to `spender`.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function approveAndCall(address spender, uint256 value, bytes calldata data) external returns (bool);
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (interfaces/IERC165.sol)
pragma solidity ^0.8.20;
import {IERC165} from "../utils/introspection/IERC165.sol";// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (interfaces/IERC20.sol)
pragma solidity ^0.8.20;
import {IERC20} from "../token/ERC20/IERC20.sol";// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)
pragma solidity ^0.8.20;
/**
* @dev Interface of the ERC-20 standard as defined in the ERC.
*/
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 value of tokens in existence.
*/
function totalSupply() external view returns (uint256);
/**
* @dev Returns the value of tokens owned by `account`.
*/
function balanceOf(address account) external view returns (uint256);
/**
* @dev Moves a `value` amount of 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 value) 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 a `value` amount of tokens 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 value) external returns (bool);
/**
* @dev Moves a `value` amount of tokens from `from` to `to` using the
* allowance mechanism. `value` 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 value) external returns (bool);
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.3.0) (token/ERC20/utils/SafeERC20.sol)
pragma solidity ^0.8.20;
import {IERC20} from "../IERC20.sol";
import {IERC1363} from "../../../interfaces/IERC1363.sol";
/**
* @title SafeERC20
* @dev Wrappers around ERC-20 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 {
/**
* @dev An operation with an ERC-20 token failed.
*/
error SafeERC20FailedOperation(address token);
/**
* @dev Indicates a failed `decreaseAllowance` request.
*/
error SafeERC20FailedDecreaseAllowance(address spender, uint256 currentAllowance, uint256 requestedDecrease);
/**
* @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,
* non-reverting calls are assumed to be successful.
*/
function safeTransfer(IERC20 token, address to, uint256 value) internal {
_callOptionalReturn(token, abi.encodeCall(token.transfer, (to, value)));
}
/**
* @dev Transfer `value` amount of `token` from `from` to `to`, spending the approval given by `from` to the
* calling contract. If `token` returns no value, non-reverting calls are assumed to be successful.
*/
function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal {
_callOptionalReturn(token, abi.encodeCall(token.transferFrom, (from, to, value)));
}
/**
* @dev Variant of {safeTransfer} that returns a bool instead of reverting if the operation is not successful.
*/
function trySafeTransfer(IERC20 token, address to, uint256 value) internal returns (bool) {
return _callOptionalReturnBool(token, abi.encodeCall(token.transfer, (to, value)));
}
/**
* @dev Variant of {safeTransferFrom} that returns a bool instead of reverting if the operation is not successful.
*/
function trySafeTransferFrom(IERC20 token, address from, address to, uint256 value) internal returns (bool) {
return _callOptionalReturnBool(token, abi.encodeCall(token.transferFrom, (from, to, value)));
}
/**
* @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,
* non-reverting calls are assumed to be successful.
*
* IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the "client"
* smart contract uses ERC-7674 to set temporary allowances, then the "client" smart contract should avoid using
* this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract
* that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.
*/
function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {
uint256 oldAllowance = token.allowance(address(this), spender);
forceApprove(token, spender, oldAllowance + value);
}
/**
* @dev Decrease the calling contract's allowance toward `spender` by `requestedDecrease`. If `token` returns no
* value, non-reverting calls are assumed to be successful.
*
* IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the "client"
* smart contract uses ERC-7674 to set temporary allowances, then the "client" smart contract should avoid using
* this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract
* that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.
*/
function safeDecreaseAllowance(IERC20 token, address spender, uint256 requestedDecrease) internal {
unchecked {
uint256 currentAllowance = token.allowance(address(this), spender);
if (currentAllowance < requestedDecrease) {
revert SafeERC20FailedDecreaseAllowance(spender, currentAllowance, requestedDecrease);
}
forceApprove(token, spender, currentAllowance - requestedDecrease);
}
}
/**
* @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,
* non-reverting calls are assumed to be successful. Meant to be used with tokens that require the approval
* to be set to zero before setting it to a non-zero value, such as USDT.
*
* NOTE: If the token implements ERC-7674, this function will not modify any temporary allowance. This function
* only sets the "standard" allowance. Any temporary allowance will remain active, in addition to the value being
* set here.
*/
function forceApprove(IERC20 token, address spender, uint256 value) internal {
bytes memory approvalCall = abi.encodeCall(token.approve, (spender, value));
if (!_callOptionalReturnBool(token, approvalCall)) {
_callOptionalReturn(token, abi.encodeCall(token.approve, (spender, 0)));
_callOptionalReturn(token, approvalCall);
}
}
/**
* @dev Performs an {ERC1363} transferAndCall, with a fallback to the simple {ERC20} transfer if the target has no
* code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
* targeting contracts.
*
* Reverts if the returned value is other than `true`.
*/
function transferAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {
if (to.code.length == 0) {
safeTransfer(token, to, value);
} else if (!token.transferAndCall(to, value, data)) {
revert SafeERC20FailedOperation(address(token));
}
}
/**
* @dev Performs an {ERC1363} transferFromAndCall, with a fallback to the simple {ERC20} transferFrom if the target
* has no code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
* targeting contracts.
*
* Reverts if the returned value is other than `true`.
*/
function transferFromAndCallRelaxed(
IERC1363 token,
address from,
address to,
uint256 value,
bytes memory data
) internal {
if (to.code.length == 0) {
safeTransferFrom(token, from, to, value);
} else if (!token.transferFromAndCall(from, to, value, data)) {
revert SafeERC20FailedOperation(address(token));
}
}
/**
* @dev Performs an {ERC1363} approveAndCall, with a fallback to the simple {ERC20} approve if the target has no
* code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
* targeting contracts.
*
* NOTE: When the recipient address (`to`) has no code (i.e. is an EOA), this function behaves as {forceApprove}.
* Opposedly, when the recipient address (`to`) has code, this function only attempts to call {ERC1363-approveAndCall}
* once without retrying, and relies on the returned value to be true.
*
* Reverts if the returned value is other than `true`.
*/
function approveAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {
if (to.code.length == 0) {
forceApprove(token, to, value);
} else if (!token.approveAndCall(to, value, data)) {
revert SafeERC20FailedOperation(address(token));
}
}
/**
* @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).
*
* This is a variant of {_callOptionalReturnBool} that reverts if call fails to meet the requirements.
*/
function _callOptionalReturn(IERC20 token, bytes memory data) private {
uint256 returnSize;
uint256 returnValue;
assembly ("memory-safe") {
let success := call(gas(), token, 0, add(data, 0x20), mload(data), 0, 0x20)
// bubble errors
if iszero(success) {
let ptr := mload(0x40)
returndatacopy(ptr, 0, returndatasize())
revert(ptr, returndatasize())
}
returnSize := returndatasize()
returnValue := mload(0)
}
if (returnSize == 0 ? address(token).code.length == 0 : returnValue != 1) {
revert SafeERC20FailedOperation(address(token));
}
}
/**
* @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).
*
* This is a variant of {_callOptionalReturn} that silently catches all reverts and returns a bool instead.
*/
function _callOptionalReturnBool(IERC20 token, bytes memory data) private returns (bool) {
bool success;
uint256 returnSize;
uint256 returnValue;
assembly ("memory-safe") {
success := call(gas(), token, 0, add(data, 0x20), mload(data), 0, 0x20)
returnSize := returndatasize()
returnValue := mload(0)
}
return success && (returnSize == 0 ? address(token).code.length > 0 : returnValue == 1);
}
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)
pragma solidity ^0.8.20;
/**
* @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 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) {
return msg.sender;
}
function _msgData() internal view virtual returns (bytes calldata) {
return msg.data;
}
function _contextSuffixLength() internal view virtual returns (uint256) {
return 0;
}
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/IERC165.sol)
pragma solidity ^0.8.20;
/**
* @dev Interface of the ERC-165 standard, as defined in the
* https://eips.ethereum.org/EIPS/eip-165[ERC].
*
* Implementers can declare support of contract interfaces, which can then be
* queried by others ({ERC165Checker}).
*
* For an implementation, see {ERC165}.
*/
interface IERC165 {
/**
* @dev Returns true if this contract implements the interface defined by
* `interfaceId`. See the corresponding
* https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section]
* to learn more about how these ids are created.
*
* This function call must use less than 30 000 gas.
*/
function supportsInterface(bytes4 interfaceId) external view returns (bool);
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.3.0) (utils/math/Math.sol)
pragma solidity ^0.8.20;
import {Panic} from "../Panic.sol";
import {SafeCast} from "./SafeCast.sol";
/**
* @dev Standard math utilities missing in the Solidity language.
*/
library Math {
enum Rounding {
Floor, // Toward negative infinity
Ceil, // Toward positive infinity
Trunc, // Toward zero
Expand // Away from zero
}
/**
* @dev Return the 512-bit addition of two uint256.
*
* The result is stored in two 256 variables such that sum = high * 2²⁵⁶ + low.
*/
function add512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
assembly ("memory-safe") {
low := add(a, b)
high := lt(low, a)
}
}
/**
* @dev Return the 512-bit multiplication of two uint256.
*
* The result is stored in two 256 variables such that product = high * 2²⁵⁶ + low.
*/
function mul512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
// 512-bit multiply [high low] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
// the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
// variables such that product = high * 2²⁵⁶ + low.
assembly ("memory-safe") {
let mm := mulmod(a, b, not(0))
low := mul(a, b)
high := sub(sub(mm, low), lt(mm, low))
}
}
/**
* @dev Returns the addition of two unsigned integers, with a success flag (no overflow).
*/
function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a + b;
success = c >= a;
result = c * SafeCast.toUint(success);
}
}
/**
* @dev Returns the subtraction of two unsigned integers, with a success flag (no overflow).
*/
function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a - b;
success = c <= a;
result = c * SafeCast.toUint(success);
}
}
/**
* @dev Returns the multiplication of two unsigned integers, with a success flag (no overflow).
*/
function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a * b;
assembly ("memory-safe") {
// Only true when the multiplication doesn't overflow
// (c / a == b) || (a == 0)
success := or(eq(div(c, a), b), iszero(a))
}
// equivalent to: success ? c : 0
result = c * SafeCast.toUint(success);
}
}
/**
* @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
*/
function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
success = b > 0;
assembly ("memory-safe") {
// The `DIV` opcode returns zero when the denominator is 0.
result := div(a, b)
}
}
}
/**
* @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
*/
function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
success = b > 0;
assembly ("memory-safe") {
// The `MOD` opcode returns zero when the denominator is 0.
result := mod(a, b)
}
}
}
/**
* @dev Unsigned saturating addition, bounds to `2²⁵⁶ - 1` instead of overflowing.
*/
function saturatingAdd(uint256 a, uint256 b) internal pure returns (uint256) {
(bool success, uint256 result) = tryAdd(a, b);
return ternary(success, result, type(uint256).max);
}
/**
* @dev Unsigned saturating subtraction, bounds to zero instead of overflowing.
*/
function saturatingSub(uint256 a, uint256 b) internal pure returns (uint256) {
(, uint256 result) = trySub(a, b);
return result;
}
/**
* @dev Unsigned saturating multiplication, bounds to `2²⁵⁶ - 1` instead of overflowing.
*/
function saturatingMul(uint256 a, uint256 b) internal pure returns (uint256) {
(bool success, uint256 result) = tryMul(a, b);
return ternary(success, result, type(uint256).max);
}
/**
* @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
*
* IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
* However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
* one branch when needed, making this function more expensive.
*/
function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
unchecked {
// branchless ternary works because:
// b ^ (a ^ b) == a
// b ^ 0 == b
return b ^ ((a ^ b) * SafeCast.toUint(condition));
}
}
/**
* @dev Returns the largest of two numbers.
*/
function max(uint256 a, uint256 b) internal pure returns (uint256) {
return ternary(a > b, a, b);
}
/**
* @dev Returns the smallest of two numbers.
*/
function min(uint256 a, uint256 b) internal pure returns (uint256) {
return ternary(a < b, a, b);
}
/**
* @dev Returns the average of two numbers. The result is rounded towards
* zero.
*/
function average(uint256 a, uint256 b) internal pure returns (uint256) {
// (a + b) / 2 can overflow.
return (a & b) + (a ^ b) / 2;
}
/**
* @dev Returns the ceiling of the division of two numbers.
*
* This differs from standard division with `/` in that it rounds towards infinity instead
* of rounding towards zero.
*/
function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
if (b == 0) {
// Guarantee the same behavior as in a regular Solidity division.
Panic.panic(Panic.DIVISION_BY_ZERO);
}
// The following calculation ensures accurate ceiling division without overflow.
// Since a is non-zero, (a - 1) / b will not overflow.
// The largest possible result occurs when (a - 1) / b is type(uint256).max,
// but the largest value we can obtain is type(uint256).max - 1, which happens
// when a = type(uint256).max and b = 1.
unchecked {
return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);
}
}
/**
* @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
* denominator == 0.
*
* Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
* Uniswap Labs also under MIT license.
*/
function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
unchecked {
(uint256 high, uint256 low) = mul512(x, y);
// Handle non-overflow cases, 256 by 256 division.
if (high == 0) {
// Solidity will revert if denominator == 0, unlike the div opcode on its own.
// The surrounding unchecked block does not change this fact.
// See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
return low / denominator;
}
// Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.
if (denominator <= high) {
Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));
}
///////////////////////////////////////////////
// 512 by 256 division.
///////////////////////////////////////////////
// Make division exact by subtracting the remainder from [high low].
uint256 remainder;
assembly ("memory-safe") {
// Compute remainder using mulmod.
remainder := mulmod(x, y, denominator)
// Subtract 256 bit number from 512 bit number.
high := sub(high, gt(remainder, low))
low := sub(low, remainder)
}
// Factor powers of two out of denominator and compute largest power of two divisor of denominator.
// Always >= 1. See https://cs.stackexchange.com/q/138556/92363.
uint256 twos = denominator & (0 - denominator);
assembly ("memory-safe") {
// Divide denominator by twos.
denominator := div(denominator, twos)
// Divide [high low] by twos.
low := div(low, twos)
// Flip twos such that it is 2²⁵⁶ / twos. If twos is zero, then it becomes one.
twos := add(div(sub(0, twos), twos), 1)
}
// Shift in bits from high into low.
low |= high * twos;
// Invert denominator mod 2²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such
// that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for
// four bits. That is, denominator * inv ≡ 1 mod 2⁴.
uint256 inverse = (3 * denominator) ^ 2;
// Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also
// works in modular arithmetic, doubling the correct bits in each step.
inverse *= 2 - denominator * inverse; // inverse mod 2⁸
inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶
inverse *= 2 - denominator * inverse; // inverse mod 2³²
inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴
inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸
inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶
// Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
// This will give us the correct result modulo 2²⁵⁶. Since the preconditions guarantee that the outcome is
// less than 2²⁵⁶, this is the final result. We don't need to compute the high bits of the result and high
// is no longer required.
result = low * inverse;
return result;
}
}
/**
* @dev Calculates x * y / denominator with full precision, following the selected rounding direction.
*/
function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);
}
/**
* @dev Calculates floor(x * y >> n) with full precision. Throws if result overflows a uint256.
*/
function mulShr(uint256 x, uint256 y, uint8 n) internal pure returns (uint256 result) {
unchecked {
(uint256 high, uint256 low) = mul512(x, y);
if (high >= 1 << n) {
Panic.panic(Panic.UNDER_OVERFLOW);
}
return (high << (256 - n)) | (low >> n);
}
}
/**
* @dev Calculates x * y >> n with full precision, following the selected rounding direction.
*/
function mulShr(uint256 x, uint256 y, uint8 n, Rounding rounding) internal pure returns (uint256) {
return mulShr(x, y, n) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, 1 << n) > 0);
}
/**
* @dev Calculate the modular multiplicative inverse of a number in Z/nZ.
*
* If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.
* If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.
*
* If the input value is not inversible, 0 is returned.
*
* NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the
* inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.
*/
function invMod(uint256 a, uint256 n) internal pure returns (uint256) {
unchecked {
if (n == 0) return 0;
// The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)
// Used to compute integers x and y such that: ax + ny = gcd(a, n).
// When the gcd is 1, then the inverse of a modulo n exists and it's x.
// ax + ny = 1
// ax = 1 + (-y)n
// ax ≡ 1 (mod n) # x is the inverse of a modulo n
// If the remainder is 0 the gcd is n right away.
uint256 remainder = a % n;
uint256 gcd = n;
// Therefore the initial coefficients are:
// ax + ny = gcd(a, n) = n
// 0a + 1n = n
int256 x = 0;
int256 y = 1;
while (remainder != 0) {
uint256 quotient = gcd / remainder;
(gcd, remainder) = (
// The old remainder is the next gcd to try.
remainder,
// Compute the next remainder.
// Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd
// where gcd is at most n (capped to type(uint256).max)
gcd - remainder * quotient
);
(x, y) = (
// Increment the coefficient of a.
y,
// Decrement the coefficient of n.
// Can overflow, but the result is casted to uint256 so that the
// next value of y is "wrapped around" to a value between 0 and n - 1.
x - y * int256(quotient)
);
}
if (gcd != 1) return 0; // No inverse exists.
return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.
}
}
/**
* @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.
*
* From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is
* prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that
* `a**(p-2)` is the modular multiplicative inverse of a in Fp.
*
* NOTE: this function does NOT check that `p` is a prime greater than `2`.
*/
function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {
unchecked {
return Math.modExp(a, p - 2, p);
}
}
/**
* @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)
*
* Requirements:
* - modulus can't be zero
* - underlying staticcall to precompile must succeed
*
* IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make
* sure the chain you're using it on supports the precompiled contract for modular exponentiation
* at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,
* the underlying function will succeed given the lack of a revert, but the result may be incorrectly
* interpreted as 0.
*/
function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {
(bool success, uint256 result) = tryModExp(b, e, m);
if (!success) {
Panic.panic(Panic.DIVISION_BY_ZERO);
}
return result;
}
/**
* @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).
* It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying
* to operate modulo 0 or if the underlying precompile reverted.
*
* IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain
* you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in
* https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack
* of a revert, but the result may be incorrectly interpreted as 0.
*/
function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {
if (m == 0) return (false, 0);
assembly ("memory-safe") {
let ptr := mload(0x40)
// | Offset | Content | Content (Hex) |
// |-----------|------------|--------------------------------------------------------------------|
// | 0x00:0x1f | size of b | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x20:0x3f | size of e | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x40:0x5f | size of m | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x60:0x7f | value of b | 0x<.............................................................b> |
// | 0x80:0x9f | value of e | 0x<.............................................................e> |
// | 0xa0:0xbf | value of m | 0x<.............................................................m> |
mstore(ptr, 0x20)
mstore(add(ptr, 0x20), 0x20)
mstore(add(ptr, 0x40), 0x20)
mstore(add(ptr, 0x60), b)
mstore(add(ptr, 0x80), e)
mstore(add(ptr, 0xa0), m)
// Given the result < m, it's guaranteed to fit in 32 bytes,
// so we can use the memory scratch space located at offset 0.
success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)
result := mload(0x00)
}
}
/**
* @dev Variant of {modExp} that supports inputs of arbitrary length.
*/
function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {
(bool success, bytes memory result) = tryModExp(b, e, m);
if (!success) {
Panic.panic(Panic.DIVISION_BY_ZERO);
}
return result;
}
/**
* @dev Variant of {tryModExp} that supports inputs of arbitrary length.
*/
function tryModExp(
bytes memory b,
bytes memory e,
bytes memory m
) internal view returns (bool success, bytes memory result) {
if (_zeroBytes(m)) return (false, new bytes(0));
uint256 mLen = m.length;
// Encode call args in result and move the free memory pointer
result = abi.encodePacked(b.length, e.length, mLen, b, e, m);
assembly ("memory-safe") {
let dataPtr := add(result, 0x20)
// Write result on top of args to avoid allocating extra memory.
success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)
// Overwrite the length.
// result.length > returndatasize() is guaranteed because returndatasize() == m.length
mstore(result, mLen)
// Set the memory pointer after the returned data.
mstore(0x40, add(dataPtr, mLen))
}
}
/**
* @dev Returns whether the provided byte array is zero.
*/
function _zeroBytes(bytes memory byteArray) private pure returns (bool) {
for (uint256 i = 0; i < byteArray.length; ++i) {
if (byteArray[i] != 0) {
return false;
}
}
return true;
}
/**
* @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
* towards zero.
*
* This method is based on Newton's method for computing square roots; the algorithm is restricted to only
* using integer operations.
*/
function sqrt(uint256 a) internal pure returns (uint256) {
unchecked {
// Take care of easy edge cases when a == 0 or a == 1
if (a <= 1) {
return a;
}
// In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a
// sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between
// the current value as `ε_n = | x_n - sqrt(a) |`.
//
// For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root
// of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is
// bigger than any uint256.
//
// By noticing that
// `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`
// we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar
// to the msb function.
uint256 aa = a;
uint256 xn = 1;
if (aa >= (1 << 128)) {
aa >>= 128;
xn <<= 64;
}
if (aa >= (1 << 64)) {
aa >>= 64;
xn <<= 32;
}
if (aa >= (1 << 32)) {
aa >>= 32;
xn <<= 16;
}
if (aa >= (1 << 16)) {
aa >>= 16;
xn <<= 8;
}
if (aa >= (1 << 8)) {
aa >>= 8;
xn <<= 4;
}
if (aa >= (1 << 4)) {
aa >>= 4;
xn <<= 2;
}
if (aa >= (1 << 2)) {
xn <<= 1;
}
// We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).
//
// We can refine our estimation by noticing that the middle of that interval minimizes the error.
// If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).
// This is going to be our x_0 (and ε_0)
xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)
// From here, Newton's method give us:
// x_{n+1} = (x_n + a / x_n) / 2
//
// One should note that:
// x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a
// = ((x_n² + a) / (2 * x_n))² - a
// = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a
// = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)
// = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)
// = (x_n² - a)² / (2 * x_n)²
// = ((x_n² - a) / (2 * x_n))²
// ≥ 0
// Which proves that for all n ≥ 1, sqrt(a) ≤ x_n
//
// This gives us the proof of quadratic convergence of the sequence:
// ε_{n+1} = | x_{n+1} - sqrt(a) |
// = | (x_n + a / x_n) / 2 - sqrt(a) |
// = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |
// = | (x_n - sqrt(a))² / (2 * x_n) |
// = | ε_n² / (2 * x_n) |
// = ε_n² / | (2 * x_n) |
//
// For the first iteration, we have a special case where x_0 is known:
// ε_1 = ε_0² / | (2 * x_0) |
// ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))
// ≤ 2**(2*e-4) / (3 * 2**(e-1))
// ≤ 2**(e-3) / 3
// ≤ 2**(e-3-log2(3))
// ≤ 2**(e-4.5)
//
// For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:
// ε_{n+1} = ε_n² / | (2 * x_n) |
// ≤ (2**(e-k))² / (2 * 2**(e-1))
// ≤ 2**(2*e-2*k) / 2**e
// ≤ 2**(e-2*k)
xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5) -- special case, see above
xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9) -- general case with k = 4.5
xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18) -- general case with k = 9
xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36) -- general case with k = 18
xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72) -- general case with k = 36
xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144) -- general case with k = 72
// Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision
// ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either
// sqrt(a) or sqrt(a) + 1.
return xn - SafeCast.toUint(xn > a / xn);
}
}
/**
* @dev Calculates sqrt(a), following the selected rounding direction.
*/
function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = sqrt(a);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);
}
}
/**
* @dev Return the log in base 2 of a positive value rounded towards zero.
* Returns 0 if given 0.
*/
function log2(uint256 x) internal pure returns (uint256 r) {
// If value has upper 128 bits set, log2 result is at least 128
r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
// If upper 64 bits of 128-bit half set, add 64 to result
r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
// If upper 32 bits of 64-bit half set, add 32 to result
r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
// If upper 16 bits of 32-bit half set, add 16 to result
r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
// If upper 8 bits of 16-bit half set, add 8 to result
r |= SafeCast.toUint((x >> r) > 0xff) << 3;
// If upper 4 bits of 8-bit half set, add 4 to result
r |= SafeCast.toUint((x >> r) > 0xf) << 2;
// Shifts value right by the current result and use it as an index into this lookup table:
//
// | x (4 bits) | index | table[index] = MSB position |
// |------------|---------|-----------------------------|
// | 0000 | 0 | table[0] = 0 |
// | 0001 | 1 | table[1] = 0 |
// | 0010 | 2 | table[2] = 1 |
// | 0011 | 3 | table[3] = 1 |
// | 0100 | 4 | table[4] = 2 |
// | 0101 | 5 | table[5] = 2 |
// | 0110 | 6 | table[6] = 2 |
// | 0111 | 7 | table[7] = 2 |
// | 1000 | 8 | table[8] = 3 |
// | 1001 | 9 | table[9] = 3 |
// | 1010 | 10 | table[10] = 3 |
// | 1011 | 11 | table[11] = 3 |
// | 1100 | 12 | table[12] = 3 |
// | 1101 | 13 | table[13] = 3 |
// | 1110 | 14 | table[14] = 3 |
// | 1111 | 15 | table[15] = 3 |
//
// The lookup table is represented as a 32-byte value with the MSB positions for 0-15 in the last 16 bytes.
assembly ("memory-safe") {
r := or(r, byte(shr(r, x), 0x0000010102020202030303030303030300000000000000000000000000000000))
}
}
/**
* @dev Return the log in base 2, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log2(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);
}
}
/**
* @dev Return the log in base 10 of a positive value rounded towards zero.
* Returns 0 if given 0.
*/
function log10(uint256 value) internal pure returns (uint256) {
uint256 result = 0;
unchecked {
if (value >= 10 ** 64) {
value /= 10 ** 64;
result += 64;
}
if (value >= 10 ** 32) {
value /= 10 ** 32;
result += 32;
}
if (value >= 10 ** 16) {
value /= 10 ** 16;
result += 16;
}
if (value >= 10 ** 8) {
value /= 10 ** 8;
result += 8;
}
if (value >= 10 ** 4) {
value /= 10 ** 4;
result += 4;
}
if (value >= 10 ** 2) {
value /= 10 ** 2;
result += 2;
}
if (value >= 10 ** 1) {
result += 1;
}
}
return result;
}
/**
* @dev Return the log in base 10, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log10(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);
}
}
/**
* @dev Return the log in base 256 of a positive value rounded towards zero.
* Returns 0 if given 0.
*
* Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
*/
function log256(uint256 x) internal pure returns (uint256 r) {
// If value has upper 128 bits set, log2 result is at least 128
r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
// If upper 64 bits of 128-bit half set, add 64 to result
r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
// If upper 32 bits of 64-bit half set, add 32 to result
r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
// If upper 16 bits of 32-bit half set, add 16 to result
r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
// Add 1 if upper 8 bits of 16-bit half set, and divide accumulated result by 8
return (r >> 3) | SafeCast.toUint((x >> r) > 0xff);
}
/**
* @dev Return the log in base 256, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log256(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);
}
}
/**
* @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
*/
function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
return uint8(rounding) % 2 == 1;
}
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SafeCast.sol)
// This file was procedurally generated from scripts/generate/templates/SafeCast.js.
pragma solidity ^0.8.20;
/**
* @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow
* checks.
*
* Downcasting from uint256/int256 in Solidity does not revert on overflow. This can
* easily result in undesired exploitation or bugs, since developers usually
* assume that overflows raise errors. `SafeCast` restores this intuition by
* reverting the transaction when such 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 SafeCast {
/**
* @dev Value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);
/**
* @dev An int value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedIntToUint(int256 value);
/**
* @dev Value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);
/**
* @dev An uint value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedUintToInt(uint256 value);
/**
* @dev Returns the downcasted uint248 from uint256, reverting on
* overflow (when the input is greater than largest uint248).
*
* Counterpart to Solidity's `uint248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toUint248(uint256 value) internal pure returns (uint248) {
if (value > type(uint248).max) {
revert SafeCastOverflowedUintDowncast(248, value);
}
return uint248(value);
}
/**
* @dev Returns the downcasted uint240 from uint256, reverting on
* overflow (when the input is greater than largest uint240).
*
* Counterpart to Solidity's `uint240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toUint240(uint256 value) internal pure returns (uint240) {
if (value > type(uint240).max) {
revert SafeCastOverflowedUintDowncast(240, value);
}
return uint240(value);
}
/**
* @dev Returns the downcasted uint232 from uint256, reverting on
* overflow (when the input is greater than largest uint232).
*
* Counterpart to Solidity's `uint232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toUint232(uint256 value) internal pure returns (uint232) {
if (value > type(uint232).max) {
revert SafeCastOverflowedUintDowncast(232, value);
}
return uint232(value);
}
/**
* @dev Returns the downcasted uint224 from uint256, reverting on
* overflow (when the input is greater than largest uint224).
*
* Counterpart to Solidity's `uint224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toUint224(uint256 value) internal pure returns (uint224) {
if (value > type(uint224).max) {
revert SafeCastOverflowedUintDowncast(224, value);
}
return uint224(value);
}
/**
* @dev Returns the downcasted uint216 from uint256, reverting on
* overflow (when the input is greater than largest uint216).
*
* Counterpart to Solidity's `uint216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toUint216(uint256 value) internal pure returns (uint216) {
if (value > type(uint216).max) {
revert SafeCastOverflowedUintDowncast(216, value);
}
return uint216(value);
}
/**
* @dev Returns the downcasted uint208 from uint256, reverting on
* overflow (when the input is greater than largest uint208).
*
* Counterpart to Solidity's `uint208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toUint208(uint256 value) internal pure returns (uint208) {
if (value > type(uint208).max) {
revert SafeCastOverflowedUintDowncast(208, value);
}
return uint208(value);
}
/**
* @dev Returns the downcasted uint200 from uint256, reverting on
* overflow (when the input is greater than largest uint200).
*
* Counterpart to Solidity's `uint200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toUint200(uint256 value) internal pure returns (uint200) {
if (value > type(uint200).max) {
revert SafeCastOverflowedUintDowncast(200, value);
}
return uint200(value);
}
/**
* @dev Returns the downcasted uint192 from uint256, reverting on
* overflow (when the input is greater than largest uint192).
*
* Counterpart to Solidity's `uint192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toUint192(uint256 value) internal pure returns (uint192) {
if (value > type(uint192).max) {
revert SafeCastOverflowedUintDowncast(192, value);
}
return uint192(value);
}
/**
* @dev Returns the downcasted uint184 from uint256, reverting on
* overflow (when the input is greater than largest uint184).
*
* Counterpart to Solidity's `uint184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toUint184(uint256 value) internal pure returns (uint184) {
if (value > type(uint184).max) {
revert SafeCastOverflowedUintDowncast(184, value);
}
return uint184(value);
}
/**
* @dev Returns the downcasted uint176 from uint256, reverting on
* overflow (when the input is greater than largest uint176).
*
* Counterpart to Solidity's `uint176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toUint176(uint256 value) internal pure returns (uint176) {
if (value > type(uint176).max) {
revert SafeCastOverflowedUintDowncast(176, value);
}
return uint176(value);
}
/**
* @dev Returns the downcasted uint168 from uint256, reverting on
* overflow (when the input is greater than largest uint168).
*
* Counterpart to Solidity's `uint168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toUint168(uint256 value) internal pure returns (uint168) {
if (value > type(uint168).max) {
revert SafeCastOverflowedUintDowncast(168, value);
}
return uint168(value);
}
/**
* @dev Returns the downcasted uint160 from uint256, reverting on
* overflow (when the input is greater than largest uint160).
*
* Counterpart to Solidity's `uint160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toUint160(uint256 value) internal pure returns (uint160) {
if (value > type(uint160).max) {
revert SafeCastOverflowedUintDowncast(160, value);
}
return uint160(value);
}
/**
* @dev Returns the downcasted uint152 from uint256, reverting on
* overflow (when the input is greater than largest uint152).
*
* Counterpart to Solidity's `uint152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toUint152(uint256 value) internal pure returns (uint152) {
if (value > type(uint152).max) {
revert SafeCastOverflowedUintDowncast(152, value);
}
return uint152(value);
}
/**
* @dev Returns the downcasted uint144 from uint256, reverting on
* overflow (when the input is greater than largest uint144).
*
* Counterpart to Solidity's `uint144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toUint144(uint256 value) internal pure returns (uint144) {
if (value > type(uint144).max) {
revert SafeCastOverflowedUintDowncast(144, value);
}
return uint144(value);
}
/**
* @dev Returns the downcasted uint136 from uint256, reverting on
* overflow (when the input is greater than largest uint136).
*
* Counterpart to Solidity's `uint136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toUint136(uint256 value) internal pure returns (uint136) {
if (value > type(uint136).max) {
revert SafeCastOverflowedUintDowncast(136, value);
}
return uint136(value);
}
/**
* @dev Returns the downcasted uint128 from uint256, reverting on
* overflow (when the input is greater than largest uint128).
*
* Counterpart to Solidity's `uint128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toUint128(uint256 value) internal pure returns (uint128) {
if (value > type(uint128).max) {
revert SafeCastOverflowedUintDowncast(128, value);
}
return uint128(value);
}
/**
* @dev Returns the downcasted uint120 from uint256, reverting on
* overflow (when the input is greater than largest uint120).
*
* Counterpart to Solidity's `uint120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toUint120(uint256 value) internal pure returns (uint120) {
if (value > type(uint120).max) {
revert SafeCastOverflowedUintDowncast(120, value);
}
return uint120(value);
}
/**
* @dev Returns the downcasted uint112 from uint256, reverting on
* overflow (when the input is greater than largest uint112).
*
* Counterpart to Solidity's `uint112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toUint112(uint256 value) internal pure returns (uint112) {
if (value > type(uint112).max) {
revert SafeCastOverflowedUintDowncast(112, value);
}
return uint112(value);
}
/**
* @dev Returns the downcasted uint104 from uint256, reverting on
* overflow (when the input is greater than largest uint104).
*
* Counterpart to Solidity's `uint104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toUint104(uint256 value) internal pure returns (uint104) {
if (value > type(uint104).max) {
revert SafeCastOverflowedUintDowncast(104, value);
}
return uint104(value);
}
/**
* @dev Returns the downcasted uint96 from uint256, reverting on
* overflow (when the input is greater than largest uint96).
*
* Counterpart to Solidity's `uint96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toUint96(uint256 value) internal pure returns (uint96) {
if (value > type(uint96).max) {
revert SafeCastOverflowedUintDowncast(96, value);
}
return uint96(value);
}
/**
* @dev Returns the downcasted uint88 from uint256, reverting on
* overflow (when the input is greater than largest uint88).
*
* Counterpart to Solidity's `uint88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toUint88(uint256 value) internal pure returns (uint88) {
if (value > type(uint88).max) {
revert SafeCastOverflowedUintDowncast(88, value);
}
return uint88(value);
}
/**
* @dev Returns the downcasted uint80 from uint256, reverting on
* overflow (when the input is greater than largest uint80).
*
* Counterpart to Solidity's `uint80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toUint80(uint256 value) internal pure returns (uint80) {
if (value > type(uint80).max) {
revert SafeCastOverflowedUintDowncast(80, value);
}
return uint80(value);
}
/**
* @dev Returns the downcasted uint72 from uint256, reverting on
* overflow (when the input is greater than largest uint72).
*
* Counterpart to Solidity's `uint72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toUint72(uint256 value) internal pure returns (uint72) {
if (value > type(uint72).max) {
revert SafeCastOverflowedUintDowncast(72, value);
}
return uint72(value);
}
/**
* @dev Returns the downcasted uint64 from uint256, reverting on
* overflow (when the input is greater than largest uint64).
*
* Counterpart to Solidity's `uint64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toUint64(uint256 value) internal pure returns (uint64) {
if (value > type(uint64).max) {
revert SafeCastOverflowedUintDowncast(64, value);
}
return uint64(value);
}
/**
* @dev Returns the downcasted uint56 from uint256, reverting on
* overflow (when the input is greater than largest uint56).
*
* Counterpart to Solidity's `uint56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toUint56(uint256 value) internal pure returns (uint56) {
if (value > type(uint56).max) {
revert SafeCastOverflowedUintDowncast(56, value);
}
return uint56(value);
}
/**
* @dev Returns the downcasted uint48 from uint256, reverting on
* overflow (when the input is greater than largest uint48).
*
* Counterpart to Solidity's `uint48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toUint48(uint256 value) internal pure returns (uint48) {
if (value > type(uint48).max) {
revert SafeCastOverflowedUintDowncast(48, value);
}
return uint48(value);
}
/**
* @dev Returns the downcasted uint40 from uint256, reverting on
* overflow (when the input is greater than largest uint40).
*
* Counterpart to Solidity's `uint40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toUint40(uint256 value) internal pure returns (uint40) {
if (value > type(uint40).max) {
revert SafeCastOverflowedUintDowncast(40, value);
}
return uint40(value);
}
/**
* @dev Returns the downcasted uint32 from uint256, reverting on
* overflow (when the input is greater than largest uint32).
*
* Counterpart to Solidity's `uint32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toUint32(uint256 value) internal pure returns (uint32) {
if (value > type(uint32).max) {
revert SafeCastOverflowedUintDowncast(32, value);
}
return uint32(value);
}
/**
* @dev Returns the downcasted uint24 from uint256, reverting on
* overflow (when the input is greater than largest uint24).
*
* Counterpart to Solidity's `uint24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toUint24(uint256 value) internal pure returns (uint24) {
if (value > type(uint24).max) {
revert SafeCastOverflowedUintDowncast(24, value);
}
return uint24(value);
}
/**
* @dev Returns the downcasted uint16 from uint256, reverting on
* overflow (when the input is greater than largest uint16).
*
* Counterpart to Solidity's `uint16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toUint16(uint256 value) internal pure returns (uint16) {
if (value > type(uint16).max) {
revert SafeCastOverflowedUintDowncast(16, value);
}
return uint16(value);
}
/**
* @dev Returns the downcasted uint8 from uint256, reverting on
* overflow (when the input is greater than largest uint8).
*
* Counterpart to Solidity's `uint8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toUint8(uint256 value) internal pure returns (uint8) {
if (value > type(uint8).max) {
revert SafeCastOverflowedUintDowncast(8, value);
}
return uint8(value);
}
/**
* @dev Converts a signed int256 into an unsigned uint256.
*
* Requirements:
*
* - input must be greater than or equal to 0.
*/
function toUint256(int256 value) internal pure returns (uint256) {
if (value < 0) {
revert SafeCastOverflowedIntToUint(value);
}
return uint256(value);
}
/**
* @dev Returns the downcasted int248 from int256, reverting on
* overflow (when the input is less than smallest int248 or
* greater than largest int248).
*
* Counterpart to Solidity's `int248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toInt248(int256 value) internal pure returns (int248 downcasted) {
downcasted = int248(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(248, value);
}
}
/**
* @dev Returns the downcasted int240 from int256, reverting on
* overflow (when the input is less than smallest int240 or
* greater than largest int240).
*
* Counterpart to Solidity's `int240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toInt240(int256 value) internal pure returns (int240 downcasted) {
downcasted = int240(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(240, value);
}
}
/**
* @dev Returns the downcasted int232 from int256, reverting on
* overflow (when the input is less than smallest int232 or
* greater than largest int232).
*
* Counterpart to Solidity's `int232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toInt232(int256 value) internal pure returns (int232 downcasted) {
downcasted = int232(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(232, value);
}
}
/**
* @dev Returns the downcasted int224 from int256, reverting on
* overflow (when the input is less than smallest int224 or
* greater than largest int224).
*
* Counterpart to Solidity's `int224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toInt224(int256 value) internal pure returns (int224 downcasted) {
downcasted = int224(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(224, value);
}
}
/**
* @dev Returns the downcasted int216 from int256, reverting on
* overflow (when the input is less than smallest int216 or
* greater than largest int216).
*
* Counterpart to Solidity's `int216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toInt216(int256 value) internal pure returns (int216 downcasted) {
downcasted = int216(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(216, value);
}
}
/**
* @dev Returns the downcasted int208 from int256, reverting on
* overflow (when the input is less than smallest int208 or
* greater than largest int208).
*
* Counterpart to Solidity's `int208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toInt208(int256 value) internal pure returns (int208 downcasted) {
downcasted = int208(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(208, value);
}
}
/**
* @dev Returns the downcasted int200 from int256, reverting on
* overflow (when the input is less than smallest int200 or
* greater than largest int200).
*
* Counterpart to Solidity's `int200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toInt200(int256 value) internal pure returns (int200 downcasted) {
downcasted = int200(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(200, value);
}
}
/**
* @dev Returns the downcasted int192 from int256, reverting on
* overflow (when the input is less than smallest int192 or
* greater than largest int192).
*
* Counterpart to Solidity's `int192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toInt192(int256 value) internal pure returns (int192 downcasted) {
downcasted = int192(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(192, value);
}
}
/**
* @dev Returns the downcasted int184 from int256, reverting on
* overflow (when the input is less than smallest int184 or
* greater than largest int184).
*
* Counterpart to Solidity's `int184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toInt184(int256 value) internal pure returns (int184 downcasted) {
downcasted = int184(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(184, value);
}
}
/**
* @dev Returns the downcasted int176 from int256, reverting on
* overflow (when the input is less than smallest int176 or
* greater than largest int176).
*
* Counterpart to Solidity's `int176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toInt176(int256 value) internal pure returns (int176 downcasted) {
downcasted = int176(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(176, value);
}
}
/**
* @dev Returns the downcasted int168 from int256, reverting on
* overflow (when the input is less than smallest int168 or
* greater than largest int168).
*
* Counterpart to Solidity's `int168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toInt168(int256 value) internal pure returns (int168 downcasted) {
downcasted = int168(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(168, value);
}
}
/**
* @dev Returns the downcasted int160 from int256, reverting on
* overflow (when the input is less than smallest int160 or
* greater than largest int160).
*
* Counterpart to Solidity's `int160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toInt160(int256 value) internal pure returns (int160 downcasted) {
downcasted = int160(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(160, value);
}
}
/**
* @dev Returns the downcasted int152 from int256, reverting on
* overflow (when the input is less than smallest int152 or
* greater than largest int152).
*
* Counterpart to Solidity's `int152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toInt152(int256 value) internal pure returns (int152 downcasted) {
downcasted = int152(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(152, value);
}
}
/**
* @dev Returns the downcasted int144 from int256, reverting on
* overflow (when the input is less than smallest int144 or
* greater than largest int144).
*
* Counterpart to Solidity's `int144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toInt144(int256 value) internal pure returns (int144 downcasted) {
downcasted = int144(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(144, value);
}
}
/**
* @dev Returns the downcasted int136 from int256, reverting on
* overflow (when the input is less than smallest int136 or
* greater than largest int136).
*
* Counterpart to Solidity's `int136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toInt136(int256 value) internal pure returns (int136 downcasted) {
downcasted = int136(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(136, value);
}
}
/**
* @dev Returns the downcasted int128 from int256, reverting on
* overflow (when the input is less than smallest int128 or
* greater than largest int128).
*
* Counterpart to Solidity's `int128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toInt128(int256 value) internal pure returns (int128 downcasted) {
downcasted = int128(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(128, value);
}
}
/**
* @dev Returns the downcasted int120 from int256, reverting on
* overflow (when the input is less than smallest int120 or
* greater than largest int120).
*
* Counterpart to Solidity's `int120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toInt120(int256 value) internal pure returns (int120 downcasted) {
downcasted = int120(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(120, value);
}
}
/**
* @dev Returns the downcasted int112 from int256, reverting on
* overflow (when the input is less than smallest int112 or
* greater than largest int112).
*
* Counterpart to Solidity's `int112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toInt112(int256 value) internal pure returns (int112 downcasted) {
downcasted = int112(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(112, value);
}
}
/**
* @dev Returns the downcasted int104 from int256, reverting on
* overflow (when the input is less than smallest int104 or
* greater than largest int104).
*
* Counterpart to Solidity's `int104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toInt104(int256 value) internal pure returns (int104 downcasted) {
downcasted = int104(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(104, value);
}
}
/**
* @dev Returns the downcasted int96 from int256, reverting on
* overflow (when the input is less than smallest int96 or
* greater than largest int96).
*
* Counterpart to Solidity's `int96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toInt96(int256 value) internal pure returns (int96 downcasted) {
downcasted = int96(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(96, value);
}
}
/**
* @dev Returns the downcasted int88 from int256, reverting on
* overflow (when the input is less than smallest int88 or
* greater than largest int88).
*
* Counterpart to Solidity's `int88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toInt88(int256 value) internal pure returns (int88 downcasted) {
downcasted = int88(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(88, value);
}
}
/**
* @dev Returns the downcasted int80 from int256, reverting on
* overflow (when the input is less than smallest int80 or
* greater than largest int80).
*
* Counterpart to Solidity's `int80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toInt80(int256 value) internal pure returns (int80 downcasted) {
downcasted = int80(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(80, value);
}
}
/**
* @dev Returns the downcasted int72 from int256, reverting on
* overflow (when the input is less than smallest int72 or
* greater than largest int72).
*
* Counterpart to Solidity's `int72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toInt72(int256 value) internal pure returns (int72 downcasted) {
downcasted = int72(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(72, value);
}
}
/**
* @dev Returns the downcasted int64 from int256, reverting on
* overflow (when the input is less than smallest int64 or
* greater than largest int64).
*
* Counterpart to Solidity's `int64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toInt64(int256 value) internal pure returns (int64 downcasted) {
downcasted = int64(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(64, value);
}
}
/**
* @dev Returns the downcasted int56 from int256, reverting on
* overflow (when the input is less than smallest int56 or
* greater than largest int56).
*
* Counterpart to Solidity's `int56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toInt56(int256 value) internal pure returns (int56 downcasted) {
downcasted = int56(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(56, value);
}
}
/**
* @dev Returns the downcasted int48 from int256, reverting on
* overflow (when the input is less than smallest int48 or
* greater than largest int48).
*
* Counterpart to Solidity's `int48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toInt48(int256 value) internal pure returns (int48 downcasted) {
downcasted = int48(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(48, value);
}
}
/**
* @dev Returns the downcasted int40 from int256, reverting on
* overflow (when the input is less than smallest int40 or
* greater than largest int40).
*
* Counterpart to Solidity's `int40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toInt40(int256 value) internal pure returns (int40 downcasted) {
downcasted = int40(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(40, value);
}
}
/**
* @dev Returns the downcasted int32 from int256, reverting on
* overflow (when the input is less than smallest int32 or
* greater than largest int32).
*
* Counterpart to Solidity's `int32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toInt32(int256 value) internal pure returns (int32 downcasted) {
downcasted = int32(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(32, value);
}
}
/**
* @dev Returns the downcasted int24 from int256, reverting on
* overflow (when the input is less than smallest int24 or
* greater than largest int24).
*
* Counterpart to Solidity's `int24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toInt24(int256 value) internal pure returns (int24 downcasted) {
downcasted = int24(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(24, value);
}
}
/**
* @dev Returns the downcasted int16 from int256, reverting on
* overflow (when the input is less than smallest int16 or
* greater than largest int16).
*
* Counterpart to Solidity's `int16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toInt16(int256 value) internal pure returns (int16 downcasted) {
downcasted = int16(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(16, value);
}
}
/**
* @dev Returns the downcasted int8 from int256, reverting on
* overflow (when the input is less than smallest int8 or
* greater than largest int8).
*
* Counterpart to Solidity's `int8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toInt8(int256 value) internal pure returns (int8 downcasted) {
downcasted = int8(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(8, value);
}
}
/**
* @dev Converts an unsigned uint256 into a signed int256.
*
* Requirements:
*
* - input must be less than or equal to maxInt256.
*/
function toInt256(uint256 value) internal pure returns (int256) {
// Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive
if (value > uint256(type(int256).max)) {
revert SafeCastOverflowedUintToInt(value);
}
return int256(value);
}
/**
* @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.
*/
function toUint(bool b) internal pure returns (uint256 u) {
assembly ("memory-safe") {
u := iszero(iszero(b))
}
}
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SignedMath.sol)
pragma solidity ^0.8.20;
import {SafeCast} from "./SafeCast.sol";
/**
* @dev Standard signed math utilities missing in the Solidity language.
*/
library SignedMath {
/**
* @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
*
* IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
* However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
* one branch when needed, making this function more expensive.
*/
function ternary(bool condition, int256 a, int256 b) internal pure returns (int256) {
unchecked {
// branchless ternary works because:
// b ^ (a ^ b) == a
// b ^ 0 == b
return b ^ ((a ^ b) * int256(SafeCast.toUint(condition)));
}
}
/**
* @dev Returns the largest of two signed numbers.
*/
function max(int256 a, int256 b) internal pure returns (int256) {
return ternary(a > b, a, b);
}
/**
* @dev Returns the smallest of two signed numbers.
*/
function min(int256 a, int256 b) internal pure returns (int256) {
return ternary(a < b, a, b);
}
/**
* @dev Returns the average of two signed numbers without overflow.
* The result is rounded towards zero.
*/
function average(int256 a, int256 b) internal pure returns (int256) {
// Formula from the book "Hacker's Delight"
int256 x = (a & b) + ((a ^ b) >> 1);
return x + (int256(uint256(x) >> 255) & (a ^ b));
}
/**
* @dev Returns the absolute unsigned value of a signed value.
*/
function abs(int256 n) internal pure returns (uint256) {
unchecked {
// Formula from the "Bit Twiddling Hacks" by Sean Eron Anderson.
// Since `n` is a signed integer, the generated bytecode will use the SAR opcode to perform the right shift,
// taking advantage of the most significant (or "sign" bit) in two's complement representation.
// This opcode adds new most significant bits set to the value of the previous most significant bit. As a result,
// the mask will either be `bytes32(0)` (if n is positive) or `~bytes32(0)` (if n is negative).
int256 mask = n >> 255;
// A `bytes32(0)` mask leaves the input unchanged, while a `~bytes32(0)` mask complements it.
return uint256((n + mask) ^ mask);
}
}
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)
pragma solidity ^0.8.20;
/**
* @dev Helper library for emitting standardized panic codes.
*
* ```solidity
* contract Example {
* using Panic for uint256;
*
* // Use any of the declared internal constants
* function foo() { Panic.GENERIC.panic(); }
*
* // Alternatively
* function foo() { Panic.panic(Panic.GENERIC); }
* }
* ```
*
* Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].
*
* _Available since v5.1._
*/
// slither-disable-next-line unused-state
library Panic {
/// @dev generic / unspecified error
uint256 internal constant GENERIC = 0x00;
/// @dev used by the assert() builtin
uint256 internal constant ASSERT = 0x01;
/// @dev arithmetic underflow or overflow
uint256 internal constant UNDER_OVERFLOW = 0x11;
/// @dev division or modulo by zero
uint256 internal constant DIVISION_BY_ZERO = 0x12;
/// @dev enum conversion error
uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;
/// @dev invalid encoding in storage
uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;
/// @dev empty array pop
uint256 internal constant EMPTY_ARRAY_POP = 0x31;
/// @dev array out of bounds access
uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;
/// @dev resource error (too large allocation or too large array)
uint256 internal constant RESOURCE_ERROR = 0x41;
/// @dev calling invalid internal function
uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;
/// @dev Reverts with a panic code. Recommended to use with
/// the internal constants with predefined codes.
function panic(uint256 code) internal pure {
assembly ("memory-safe") {
mstore(0x00, 0x4e487b71)
mstore(0x20, code)
revert(0x1c, 0x24)
}
}
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.3.0) (utils/Strings.sol)
pragma solidity ^0.8.20;
import {Math} from "./math/Math.sol";
import {SafeCast} from "./math/SafeCast.sol";
import {SignedMath} from "./math/SignedMath.sol";
/**
* @dev String operations.
*/
library Strings {
using SafeCast for *;
bytes16 private constant HEX_DIGITS = "0123456789abcdef";
uint8 private constant ADDRESS_LENGTH = 20;
uint256 private constant SPECIAL_CHARS_LOOKUP =
(1 << 0x08) | // backspace
(1 << 0x09) | // tab
(1 << 0x0a) | // newline
(1 << 0x0c) | // form feed
(1 << 0x0d) | // carriage return
(1 << 0x22) | // double quote
(1 << 0x5c); // backslash
/**
* @dev The `value` string doesn't fit in the specified `length`.
*/
error StringsInsufficientHexLength(uint256 value, uint256 length);
/**
* @dev The string being parsed contains characters that are not in scope of the given base.
*/
error StringsInvalidChar();
/**
* @dev The string being parsed is not a properly formatted address.
*/
error StringsInvalidAddressFormat();
/**
* @dev Converts a `uint256` to its ASCII `string` decimal representation.
*/
function toString(uint256 value) internal pure returns (string memory) {
unchecked {
uint256 length = Math.log10(value) + 1;
string memory buffer = new string(length);
uint256 ptr;
assembly ("memory-safe") {
ptr := add(buffer, add(32, length))
}
while (true) {
ptr--;
assembly ("memory-safe") {
mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))
}
value /= 10;
if (value == 0) break;
}
return buffer;
}
}
/**
* @dev Converts a `int256` to its ASCII `string` decimal representation.
*/
function toStringSigned(int256 value) internal pure returns (string memory) {
return string.concat(value < 0 ? "-" : "", toString(SignedMath.abs(value)));
}
/**
* @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
*/
function toHexString(uint256 value) internal pure returns (string memory) {
unchecked {
return toHexString(value, Math.log256(value) + 1);
}
}
/**
* @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
*/
function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
uint256 localValue = value;
bytes memory buffer = new bytes(2 * length + 2);
buffer[0] = "0";
buffer[1] = "x";
for (uint256 i = 2 * length + 1; i > 1; --i) {
buffer[i] = HEX_DIGITS[localValue & 0xf];
localValue >>= 4;
}
if (localValue != 0) {
revert StringsInsufficientHexLength(value, length);
}
return string(buffer);
}
/**
* @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal
* representation.
*/
function toHexString(address addr) internal pure returns (string memory) {
return toHexString(uint256(uint160(addr)), ADDRESS_LENGTH);
}
/**
* @dev Converts an `address` with fixed length of 20 bytes to its checksummed ASCII `string` hexadecimal
* representation, according to EIP-55.
*/
function toChecksumHexString(address addr) internal pure returns (string memory) {
bytes memory buffer = bytes(toHexString(addr));
// hash the hex part of buffer (skip length + 2 bytes, length 40)
uint256 hashValue;
assembly ("memory-safe") {
hashValue := shr(96, keccak256(add(buffer, 0x22), 40))
}
for (uint256 i = 41; i > 1; --i) {
// possible values for buffer[i] are 48 (0) to 57 (9) and 97 (a) to 102 (f)
if (hashValue & 0xf > 7 && uint8(buffer[i]) > 96) {
// case shift by xoring with 0x20
buffer[i] ^= 0x20;
}
hashValue >>= 4;
}
return string(buffer);
}
/**
* @dev Returns true if the two strings are equal.
*/
function equal(string memory a, string memory b) internal pure returns (bool) {
return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
}
/**
* @dev Parse a decimal string and returns the value as a `uint256`.
*
* Requirements:
* - The string must be formatted as `[0-9]*`
* - The result must fit into an `uint256` type
*/
function parseUint(string memory input) internal pure returns (uint256) {
return parseUint(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseUint-string} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `[0-9]*`
* - The result must fit into an `uint256` type
*/
function parseUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
(bool success, uint256 value) = tryParseUint(input, begin, end);
if (!success) revert StringsInvalidChar();
return value;
}
/**
* @dev Variant of {parseUint-string} that returns false if the parsing fails because of an invalid character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseUint(string memory input) internal pure returns (bool success, uint256 value) {
return _tryParseUintUncheckedBounds(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseUint-string-uint256-uint256} that returns false if the parsing fails because of an invalid
* character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseUint(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, uint256 value) {
if (end > bytes(input).length || begin > end) return (false, 0);
return _tryParseUintUncheckedBounds(input, begin, end);
}
/**
* @dev Implementation of {tryParseUint-string-uint256-uint256} that does not check bounds. Caller should make sure that
* `begin <= end <= input.length`. Other inputs would result in undefined behavior.
*/
function _tryParseUintUncheckedBounds(
string memory input,
uint256 begin,
uint256 end
) private pure returns (bool success, uint256 value) {
bytes memory buffer = bytes(input);
uint256 result = 0;
for (uint256 i = begin; i < end; ++i) {
uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
if (chr > 9) return (false, 0);
result *= 10;
result += chr;
}
return (true, result);
}
/**
* @dev Parse a decimal string and returns the value as a `int256`.
*
* Requirements:
* - The string must be formatted as `[-+]?[0-9]*`
* - The result must fit in an `int256` type.
*/
function parseInt(string memory input) internal pure returns (int256) {
return parseInt(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseInt-string} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `[-+]?[0-9]*`
* - The result must fit in an `int256` type.
*/
function parseInt(string memory input, uint256 begin, uint256 end) internal pure returns (int256) {
(bool success, int256 value) = tryParseInt(input, begin, end);
if (!success) revert StringsInvalidChar();
return value;
}
/**
* @dev Variant of {parseInt-string} that returns false if the parsing fails because of an invalid character or if
* the result does not fit in a `int256`.
*
* NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
*/
function tryParseInt(string memory input) internal pure returns (bool success, int256 value) {
return _tryParseIntUncheckedBounds(input, 0, bytes(input).length);
}
uint256 private constant ABS_MIN_INT256 = 2 ** 255;
/**
* @dev Variant of {parseInt-string-uint256-uint256} that returns false if the parsing fails because of an invalid
* character or if the result does not fit in a `int256`.
*
* NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
*/
function tryParseInt(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, int256 value) {
if (end > bytes(input).length || begin > end) return (false, 0);
return _tryParseIntUncheckedBounds(input, begin, end);
}
/**
* @dev Implementation of {tryParseInt-string-uint256-uint256} that does not check bounds. Caller should make sure that
* `begin <= end <= input.length`. Other inputs would result in undefined behavior.
*/
function _tryParseIntUncheckedBounds(
string memory input,
uint256 begin,
uint256 end
) private pure returns (bool success, int256 value) {
bytes memory buffer = bytes(input);
// Check presence of a negative sign.
bytes1 sign = begin == end ? bytes1(0) : bytes1(_unsafeReadBytesOffset(buffer, begin)); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
bool positiveSign = sign == bytes1("+");
bool negativeSign = sign == bytes1("-");
uint256 offset = (positiveSign || negativeSign).toUint();
(bool absSuccess, uint256 absValue) = tryParseUint(input, begin + offset, end);
if (absSuccess && absValue < ABS_MIN_INT256) {
return (true, negativeSign ? -int256(absValue) : int256(absValue));
} else if (absSuccess && negativeSign && absValue == ABS_MIN_INT256) {
return (true, type(int256).min);
} else return (false, 0);
}
/**
* @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as a `uint256`.
*
* Requirements:
* - The string must be formatted as `(0x)?[0-9a-fA-F]*`
* - The result must fit in an `uint256` type.
*/
function parseHexUint(string memory input) internal pure returns (uint256) {
return parseHexUint(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseHexUint-string} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `(0x)?[0-9a-fA-F]*`
* - The result must fit in an `uint256` type.
*/
function parseHexUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
(bool success, uint256 value) = tryParseHexUint(input, begin, end);
if (!success) revert StringsInvalidChar();
return value;
}
/**
* @dev Variant of {parseHexUint-string} that returns false if the parsing fails because of an invalid character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseHexUint(string memory input) internal pure returns (bool success, uint256 value) {
return _tryParseHexUintUncheckedBounds(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseHexUint-string-uint256-uint256} that returns false if the parsing fails because of an
* invalid character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseHexUint(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, uint256 value) {
if (end > bytes(input).length || begin > end) return (false, 0);
return _tryParseHexUintUncheckedBounds(input, begin, end);
}
/**
* @dev Implementation of {tryParseHexUint-string-uint256-uint256} that does not check bounds. Caller should make sure that
* `begin <= end <= input.length`. Other inputs would result in undefined behavior.
*/
function _tryParseHexUintUncheckedBounds(
string memory input,
uint256 begin,
uint256 end
) private pure returns (bool success, uint256 value) {
bytes memory buffer = bytes(input);
// skip 0x prefix if present
bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(buffer, begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
uint256 offset = hasPrefix.toUint() * 2;
uint256 result = 0;
for (uint256 i = begin + offset; i < end; ++i) {
uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
if (chr > 15) return (false, 0);
result *= 16;
unchecked {
// Multiplying by 16 is equivalent to a shift of 4 bits (with additional overflow check).
// This guarantees that adding a value < 16 will not cause an overflow, hence the unchecked.
result += chr;
}
}
return (true, result);
}
/**
* @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as an `address`.
*
* Requirements:
* - The string must be formatted as `(0x)?[0-9a-fA-F]{40}`
*/
function parseAddress(string memory input) internal pure returns (address) {
return parseAddress(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseAddress-string} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `(0x)?[0-9a-fA-F]{40}`
*/
function parseAddress(string memory input, uint256 begin, uint256 end) internal pure returns (address) {
(bool success, address value) = tryParseAddress(input, begin, end);
if (!success) revert StringsInvalidAddressFormat();
return value;
}
/**
* @dev Variant of {parseAddress-string} that returns false if the parsing fails because the input is not a properly
* formatted address. See {parseAddress-string} requirements.
*/
function tryParseAddress(string memory input) internal pure returns (bool success, address value) {
return tryParseAddress(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseAddress-string-uint256-uint256} that returns false if the parsing fails because input is not a properly
* formatted address. See {parseAddress-string-uint256-uint256} requirements.
*/
function tryParseAddress(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, address value) {
if (end > bytes(input).length || begin > end) return (false, address(0));
bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(bytes(input), begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
uint256 expectedLength = 40 + hasPrefix.toUint() * 2;
// check that input is the correct length
if (end - begin == expectedLength) {
// length guarantees that this does not overflow, and value is at most type(uint160).max
(bool s, uint256 v) = _tryParseHexUintUncheckedBounds(input, begin, end);
return (s, address(uint160(v)));
} else {
return (false, address(0));
}
}
function _tryParseChr(bytes1 chr) private pure returns (uint8) {
uint8 value = uint8(chr);
// Try to parse `chr`:
// - Case 1: [0-9]
// - Case 2: [a-f]
// - Case 3: [A-F]
// - otherwise not supported
unchecked {
if (value > 47 && value < 58) value -= 48;
else if (value > 96 && value < 103) value -= 87;
else if (value > 64 && value < 71) value -= 55;
else return type(uint8).max;
}
return value;
}
/**
* @dev Escape special characters in JSON strings. This can be useful to prevent JSON injection in NFT metadata.
*
* WARNING: This function should only be used in double quoted JSON strings. Single quotes are not escaped.
*
* NOTE: This function escapes all unicode characters, and not just the ones in ranges defined in section 2.5 of
* RFC-4627 (U+0000 to U+001F, U+0022 and U+005C). ECMAScript's `JSON.parse` does recover escaped unicode
* characters that are not in this range, but other tooling may provide different results.
*/
function escapeJSON(string memory input) internal pure returns (string memory) {
bytes memory buffer = bytes(input);
bytes memory output = new bytes(2 * buffer.length); // worst case scenario
uint256 outputLength = 0;
for (uint256 i; i < buffer.length; ++i) {
bytes1 char = bytes1(_unsafeReadBytesOffset(buffer, i));
if (((SPECIAL_CHARS_LOOKUP & (1 << uint8(char))) != 0)) {
output[outputLength++] = "\\";
if (char == 0x08) output[outputLength++] = "b";
else if (char == 0x09) output[outputLength++] = "t";
else if (char == 0x0a) output[outputLength++] = "n";
else if (char == 0x0c) output[outputLength++] = "f";
else if (char == 0x0d) output[outputLength++] = "r";
else if (char == 0x5c) output[outputLength++] = "\\";
else if (char == 0x22) {
// solhint-disable-next-line quotes
output[outputLength++] = '"';
}
} else {
output[outputLength++] = char;
}
}
// write the actual length and deallocate unused memory
assembly ("memory-safe") {
mstore(output, outputLength)
mstore(0x40, add(output, shl(5, shr(5, add(outputLength, 63)))))
}
return string(output);
}
/**
* @dev Reads a bytes32 from a bytes array without bounds checking.
*
* NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the
* assembly block as such would prevent some optimizations.
*/
function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {
// This is not memory safe in the general case, but all calls to this private function are within bounds.
assembly ("memory-safe") {
value := mload(add(buffer, add(0x20, offset)))
}
}
}// SPDX-License-Identifier: LZBL-1.2
pragma solidity ^0.8.20;
import { BytesLib } from "solidity-bytes-utils/contracts/BytesLib.sol";
import { BitMap256 } from "../../../protocol/messagelib/libs/BitMaps.sol";
import { CalldataBytesLib } from "../../../protocol/libs/CalldataBytesLib.sol";
library DVNOptions {
using CalldataBytesLib for bytes;
using BytesLib for bytes;
uint8 internal constant WORKER_ID = 2;
uint8 internal constant OPTION_TYPE_PRECRIME = 1;
error DVN_InvalidDVNIdx();
error DVN_InvalidDVNOptions(uint256 cursor);
/// @dev group dvn options by its idx
/// @param _options [dvn_id][dvn_option][dvn_id][dvn_option]...
/// dvn_option = [option_size][dvn_idx][option_type][option]
/// option_size = len(dvn_idx) + len(option_type) + len(option)
/// dvn_id: uint8, dvn_idx: uint8, option_size: uint16, option_type: uint8, option: bytes
/// @return dvnOptions the grouped options, still share the same format of _options
/// @return dvnIndices the dvn indices
function groupDVNOptionsByIdx(
bytes memory _options
) internal pure returns (bytes[] memory dvnOptions, uint8[] memory dvnIndices) {
if (_options.length == 0) return (dvnOptions, dvnIndices);
uint8 numDVNs = getNumDVNs(_options);
// if there is only 1 dvn, we can just return the whole options
if (numDVNs == 1) {
dvnOptions = new bytes[](1);
dvnOptions[0] = _options;
dvnIndices = new uint8[](1);
dvnIndices[0] = _options.toUint8(3); // dvn idx
return (dvnOptions, dvnIndices);
}
// otherwise, we need to group the options by dvn_idx
dvnIndices = new uint8[](numDVNs);
dvnOptions = new bytes[](numDVNs);
unchecked {
uint256 cursor = 0;
uint256 start = 0;
uint8 lastDVNIdx = 255; // 255 is an invalid dvn_idx
while (cursor < _options.length) {
++cursor; // skip worker_id
// optionLength asserted in getNumDVNs (skip check)
uint16 optionLength = _options.toUint16(cursor);
cursor += 2;
// dvnIdx asserted in getNumDVNs (skip check)
uint8 dvnIdx = _options.toUint8(cursor);
// dvnIdx must equal to the lastDVNIdx for the first option
// so it is always skipped in the first option
// this operation slices out options whenever the scan finds a different lastDVNIdx
if (lastDVNIdx == 255) {
lastDVNIdx = dvnIdx;
} else if (dvnIdx != lastDVNIdx) {
uint256 len = cursor - start - 3; // 3 is for worker_id and option_length
bytes memory opt = _options.slice(start, len);
_insertDVNOptions(dvnOptions, dvnIndices, lastDVNIdx, opt);
// reset the start and lastDVNIdx
start += len;
lastDVNIdx = dvnIdx;
}
cursor += optionLength;
}
// skip check the cursor here because the cursor is asserted in getNumDVNs
// if we have reached the end of the options, we need to process the last dvn
uint256 size = cursor - start;
bytes memory op = _options.slice(start, size);
_insertDVNOptions(dvnOptions, dvnIndices, lastDVNIdx, op);
// revert dvnIndices to start from 0
for (uint8 i = 0; i < numDVNs; ++i) {
--dvnIndices[i];
}
}
}
function _insertDVNOptions(
bytes[] memory _dvnOptions,
uint8[] memory _dvnIndices,
uint8 _dvnIdx,
bytes memory _newOptions
) internal pure {
// dvnIdx starts from 0 but default value of dvnIndices is 0,
// so we tell if the slot is empty by adding 1 to dvnIdx
if (_dvnIdx == 255) revert DVN_InvalidDVNIdx();
uint8 dvnIdxAdj = _dvnIdx + 1;
for (uint256 j = 0; j < _dvnIndices.length; ++j) {
uint8 index = _dvnIndices[j];
if (dvnIdxAdj == index) {
_dvnOptions[j] = abi.encodePacked(_dvnOptions[j], _newOptions);
break;
} else if (index == 0) {
// empty slot, that means it is the first time we see this dvn
_dvnIndices[j] = dvnIdxAdj;
_dvnOptions[j] = _newOptions;
break;
}
}
}
/// @dev get the number of unique dvns
/// @param _options the format is the same as groupDVNOptionsByIdx
function getNumDVNs(bytes memory _options) internal pure returns (uint8 numDVNs) {
uint256 cursor = 0;
BitMap256 bitmap;
// find number of unique dvn_idx
unchecked {
while (cursor < _options.length) {
++cursor; // skip worker_id
uint16 optionLength = _options.toUint16(cursor);
cursor += 2;
if (optionLength < 2) revert DVN_InvalidDVNOptions(cursor); // at least 1 byte for dvn_idx and 1 byte for option_type
uint8 dvnIdx = _options.toUint8(cursor);
// if dvnIdx is not set, increment numDVNs
// max num of dvns is 255, 255 is an invalid dvn_idx
// The order of the dvnIdx is not required to be sequential, as enforcing the order may weaken
// the composability of the options. e.g. if we refrain from enforcing the order, an OApp that has
// already enforced certain options can append additional options to the end of the enforced
// ones without restrictions.
if (dvnIdx == 255) revert DVN_InvalidDVNIdx();
if (!bitmap.get(dvnIdx)) {
++numDVNs;
bitmap = bitmap.set(dvnIdx);
}
cursor += optionLength;
}
}
if (cursor != _options.length) revert DVN_InvalidDVNOptions(cursor);
}
/// @dev decode the next dvn option from _options starting from the specified cursor
/// @param _options the format is the same as groupDVNOptionsByIdx
/// @param _cursor the cursor to start decoding
/// @return optionType the type of the option
/// @return option the option
/// @return cursor the cursor to start decoding the next option
function nextDVNOption(
bytes calldata _options,
uint256 _cursor
) internal pure returns (uint8 optionType, bytes calldata option, uint256 cursor) {
unchecked {
// skip worker id
cursor = _cursor + 1;
// read option size
uint16 size = _options.toU16(cursor);
cursor += 2;
// read option type
optionType = _options.toU8(cursor + 1); // skip dvn_idx
// startCursor and endCursor are used to slice the option from _options
uint256 startCursor = cursor + 2; // skip option type and dvn_idx
uint256 endCursor = cursor + size;
option = _options[startCursor:endCursor];
cursor += size;
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.22;
/**
* @title ONFT Composed Message Codec
* @notice Library for encoding and decoding ONFT composed messages.
*/
library ONFTComposeMsgCodec {
// Offset constants for decoding composed messages
uint8 private constant NONCE_OFFSET = 8;
uint8 private constant SRC_EID_OFFSET = 12;
uint8 private constant COMPOSE_FROM_OFFSET = 44;
/**
* @dev Encodes a ONFT721 composed message.
* @param _nonce The nonce value.
* @param _srcEid The source LayerZero endpoint ID.
* @param _composeMsg The composed message.
* @return The encoded payload, including the composed message.
*/
function encode(
uint64 _nonce,
uint32 _srcEid,
bytes memory _composeMsg // 0x[composeFrom][composeMsg]
) internal pure returns (bytes memory) {
return abi.encodePacked(_nonce, _srcEid, _composeMsg);
}
/**
* @dev Retrieves the nonce for the composed message.
* @param _msg The message.
* @return The nonce value.
*/
function nonce(bytes calldata _msg) internal pure returns (uint64) {
return uint64(bytes8(_msg[:NONCE_OFFSET]));
}
/**
* @dev Retrieves the source LayerZero endpoint ID for the composed message.
* @param _msg The message.
* @return The source LayerZero endpoint ID.
*/
function srcEid(bytes calldata _msg) internal pure returns (uint32) {
return uint32(bytes4(_msg[NONCE_OFFSET:SRC_EID_OFFSET]));
}
/**
* @dev Retrieves the composeFrom value from the composed message.
* @param _msg The message.
* @return The composeFrom value as bytes32.
*/
function composeFrom(bytes calldata _msg) internal pure returns (bytes32) {
return bytes32(_msg[SRC_EID_OFFSET:COMPOSE_FROM_OFFSET]);
}
/**
* @dev Retrieves the composed message.
* @param _msg The message.
* @return The composed message.
*/
function composeMsg(bytes calldata _msg) internal pure returns (bytes memory) {
return _msg[COMPOSE_FROM_OFFSET:];
}
/**
* @dev Converts an address to bytes32.
* @param _addr The address to convert.
* @return The bytes32 representation of the address.
*/
function addressToBytes32(address _addr) internal pure returns (bytes32) {
return bytes32(uint256(uint160(_addr)));
}
/**
* @dev Converts bytes32 to an address.
* @param _b The bytes32 value to convert.
* @return The address representation of bytes32.
*/
function bytes32ToAddress(bytes32 _b) internal pure returns (address) {
return address(uint160(uint256(_b)));
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { ILayerZeroEndpointV2 } from "../../../protocol/interfaces/ILayerZeroEndpointV2.sol";
/**
* @title IOAppCore
*/
interface IOAppCore {
// Custom error messages
error OnlyPeer(uint32 eid, bytes32 sender);
error NoPeer(uint32 eid);
error InvalidEndpointCall();
error InvalidDelegate();
// Event emitted when a peer (OApp) is set for a corresponding endpoint
event PeerSet(uint32 eid, bytes32 peer);
/**
* @notice Retrieves the OApp version information.
* @return senderVersion The version of the OAppSender.sol contract.
* @return receiverVersion The version of the OAppReceiver.sol contract.
*/
function oAppVersion() external view returns (uint64 senderVersion, uint64 receiverVersion);
/**
* @notice Retrieves the LayerZero endpoint associated with the OApp.
* @return iEndpoint The LayerZero endpoint as an interface.
*/
function endpoint() external view returns (ILayerZeroEndpointV2 iEndpoint);
/**
* @notice Retrieves the peer (OApp) associated with a corresponding endpoint.
* @param _eid The endpoint ID.
* @return peer The peer address (OApp instance) associated with the corresponding endpoint.
*/
function peers(uint32 _eid) external view returns (bytes32 peer);
/**
* @notice Sets the peer address (OApp instance) for a corresponding endpoint.
* @param _eid The endpoint ID.
* @param _peer The address of the peer to be associated with the corresponding endpoint.
*/
function setPeer(uint32 _eid, bytes32 _peer) external;
/**
* @notice Sets the delegate address for the OApp Core.
* @param _delegate The address of the delegate to be set.
*/
function setDelegate(address _delegate) external;
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
/**
* @title IOAppMsgInspector
* @dev Interface for the OApp Message Inspector, allowing examination of message and options contents.
*/
interface IOAppMsgInspector {
// Custom error message for inspection failure
error InspectionFailed(bytes message, bytes options);
/**
* @notice Allows the inspector to examine LayerZero message contents and optionally throw a revert if invalid.
* @param _message The message payload to be inspected.
* @param _options Additional options or parameters for inspection.
* @return valid A boolean indicating whether the inspection passed (true) or failed (false).
*
* @dev Optionally done as a revert, OR use the boolean provided to handle the failure.
*/
function inspect(bytes calldata _message, bytes calldata _options) external view returns (bool valid);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
/**
* @dev Struct representing enforced option parameters.
*/
struct EnforcedOptionParam {
uint32 eid; // Endpoint ID
uint16 msgType; // Message Type
bytes options; // Additional options
}
/**
* @title IOAppOptionsType3
* @dev Interface for the OApp with Type 3 Options, allowing the setting and combining of enforced options.
*/
interface IOAppOptionsType3 {
// Custom error message for invalid options
error InvalidOptions(bytes options);
// Event emitted when enforced options are set
event EnforcedOptionSet(EnforcedOptionParam[] _enforcedOptions);
/**
* @notice Sets enforced options for specific endpoint and message type combinations.
* @param _enforcedOptions An array of EnforcedOptionParam structures specifying enforced options.
*/
function setEnforcedOptions(EnforcedOptionParam[] calldata _enforcedOptions) external;
/**
* @notice Combines options for a given endpoint and message type.
* @param _eid The endpoint ID.
* @param _msgType The OApp message type.
* @param _extraOptions Additional options passed by the caller.
* @return options The combination of caller specified options AND enforced options.
*/
function combineOptions(
uint32 _eid,
uint16 _msgType,
bytes calldata _extraOptions
) external view returns (bytes memory options);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { ILayerZeroReceiver, Origin } from "../../../protocol/interfaces/ILayerZeroReceiver.sol";
interface IOAppReceiver is ILayerZeroReceiver {
/**
* @notice Indicates whether an address is an approved composeMsg sender to the Endpoint.
* @param _origin The origin information containing the source endpoint and sender address.
* - srcEid: The source chain endpoint ID.
* - sender: The sender address on the src chain.
* - nonce: The nonce of the message.
* @param _message The lzReceive payload.
* @param _sender The sender address.
* @return isSender Is a valid sender.
*
* @dev Applications can optionally choose to implement a separate composeMsg sender that is NOT the bridging layer.
* @dev The default sender IS the OAppReceiver implementer.
*/
function isComposeMsgSender(
Origin calldata _origin,
bytes calldata _message,
address _sender
) external view returns (bool isSender);
}// SPDX-License-Identifier: SEE LICENSE IN LICENSE
pragma solidity ^0.8.22;
import { ILayerZeroEndpointV2 } from "../interfaces/IOAppCore.sol";
library OAppCoreStorage {
struct Layout {
// The address of the LayerZero endpoint.
ILayerZeroEndpointV2 endpoint;
// Mapping to store peers associated with corresponding endpoints.
mapping(uint32 eid => bytes32 peer) peers;
}
// keccak256(abi.encode(uint256(keccak256("primefi.layerzero.storage.oappcore")) - 1)) & ~bytes32(uint256(0xff))
bytes32 private constant STORAGE_SLOT = 0x402bd74f7d455ec1741bc37d35d77af9bd887a72bbef52ccbcd544c85ab49200;
function layout() internal pure returns (Layout storage l) {
assembly {
l.slot := STORAGE_SLOT
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { SafeOwnable } from "@solidstate/contracts/access/ownable/SafeOwnable.sol";
import { IOAppOptionsType3, EnforcedOptionParam } from "../interfaces/IOAppOptionsType3.sol";
import { OAppOptionsType3Storage } from "./OAppOptionsType3Storage.sol";
/**
* @title OAppOptionsType3
* @dev Abstract contract implementing the IOAppOptionsType3 interface with type 3 options.
*/
abstract contract OAppOptionsType3 is IOAppOptionsType3, SafeOwnable {
using OAppOptionsType3Storage for OAppOptionsType3Storage.Layout;
uint16 internal constant OPTION_TYPE_3 = 3;
/**
* @dev Sets the enforced options for specific endpoint and message type combinations.
* @param _enforcedOptions An array of EnforcedOptionParam structures specifying enforced options.
*
* @dev Only the owner/admin of the OApp can call this function.
* @dev Provides a way for the OApp to enforce things like paying for PreCrime, AND/OR minimum dst lzReceive gas amounts etc.
* @dev These enforced options can vary as the potential options/execution on the remote may differ as per the msgType.
* eg. Amount of lzReceive() gas necessary to deliver a lzCompose() message adds overhead you dont want to pay
* if you are only making a standard LayerZero message ie. lzReceive() WITHOUT sendCompose().
*/
function setEnforcedOptions(EnforcedOptionParam[] calldata _enforcedOptions) public virtual onlyOwner {
_setEnforcedOptions(_enforcedOptions);
}
/**
* @dev Sets the enforced options for specific endpoint and message type combinations.
* @param _enforcedOptions An array of EnforcedOptionParam structures specifying enforced options.
*
* @dev Provides a way for the OApp to enforce things like paying for PreCrime, AND/OR minimum dst lzReceive gas amounts etc.
* @dev These enforced options can vary as the potential options/execution on the remote may differ as per the msgType.
* eg. Amount of lzReceive() gas necessary to deliver a lzCompose() message adds overhead you dont want to pay
* if you are only making a standard LayerZero message ie. lzReceive() WITHOUT sendCompose().
*/
function _setEnforcedOptions(EnforcedOptionParam[] memory _enforcedOptions) internal virtual {
OAppOptionsType3Storage.Layout storage $ = OAppOptionsType3Storage.layout();
mapping(uint32 eid => mapping(uint16 msgType => bytes enforcedOption)) storage enforcedOptions = $.enforcedOptions;
for (uint256 i = 0; i < _enforcedOptions.length; i++) {
// @dev Enforced options are only available for optionType 3, as type 1 and 2 dont support combining.
_assertOptionsType3(_enforcedOptions[i].options);
enforcedOptions[_enforcedOptions[i].eid][_enforcedOptions[i].msgType] = _enforcedOptions[i].options;
}
emit EnforcedOptionSet(_enforcedOptions);
}
/**
* @notice Combines options for a given endpoint and message type.
* @param _eid The endpoint ID.
* @param _msgType The OAPP message type.
* @param _extraOptions Additional options passed by the caller.
* @return options The combination of caller specified options AND enforced options.
*
* @dev If there is an enforced lzReceive option:
* - {gasLimit: 200k, msg.value: 1 ether} AND a caller supplies a lzReceive option: {gasLimit: 100k, msg.value: 0.5 ether}
* - The resulting options will be {gasLimit: 300k, msg.value: 1.5 ether} when the message is executed on the remote lzReceive() function.
* @dev This presence of duplicated options is handled off-chain in the verifier/executor.
*/
function combineOptions(
uint32 _eid,
uint16 _msgType,
bytes calldata _extraOptions
) public view virtual returns (bytes memory) {
OAppOptionsType3Storage.Layout storage $ = OAppOptionsType3Storage.layout();
mapping(uint32 eid => mapping(uint16 msgType => bytes enforcedOption)) storage enforcedOptions = $.enforcedOptions;
bytes memory enforced = enforcedOptions[_eid][_msgType];
// No enforced options, pass whatever the caller supplied, even if it's empty or legacy type 1/2 options.
if (enforced.length == 0) return _extraOptions;
// No caller options, return enforced
if (_extraOptions.length == 0) return enforced;
// @dev If caller provided _extraOptions, must be type 3 as its the ONLY type that can be combined.
if (_extraOptions.length >= 2) {
_assertOptionsType3(_extraOptions);
// @dev Remove the first 2 bytes containing the type from the _extraOptions and combine with enforced.
return bytes.concat(enforced, _extraOptions[2:]);
}
// No valid set of options was found.
revert InvalidOptions(_extraOptions);
}
/**
* @dev Internal function to assert that options are of type 3.
* @param _options The options to be checked.
*/
function _assertOptionsType3(bytes memory _options) internal pure virtual {
uint16 optionsType;
assembly {
optionsType := mload(add(_options, 2))
}
if (optionsType != OPTION_TYPE_3) revert InvalidOptions(_options);
}
}// SPDX-License-Identifier: SEE LICENSE IN LICENSE
pragma solidity ^0.8.20;
library OAppOptionsType3Storage {
struct Layout {
// @dev The "msgType" should be defined in the child contract.
mapping(uint32 eid => mapping(uint16 msgType => bytes enforcedOption)) enforcedOptions;
}
bytes32 internal constant STORAGE_SLOT = keccak256("primefi.layerzero.storage.oappoptionstype3");
function layout() internal pure returns (Layout storage l) {
bytes32 slot = STORAGE_SLOT;
assembly {
l.slot := slot
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { BytesLib } from "solidity-bytes-utils/contracts/BytesLib.sol";
import { SafeCast } from "@openzeppelin/contracts/utils/math/SafeCast.sol";
import { ExecutorOptions } from "../../../protocol/messagelib/libs/ExecutorOptions.sol";
import { DVNOptions } from "../../../messagelib/uln/libs/DVNOptions.sol";
/**
* @title OptionsBuilder
* @dev Library for building and encoding various message options.
*/
library OptionsBuilder {
using SafeCast for uint256;
using BytesLib for bytes;
// Constants for options types
uint16 internal constant TYPE_1 = 1; // legacy options type 1
uint16 internal constant TYPE_2 = 2; // legacy options type 2
uint16 internal constant TYPE_3 = 3;
// Custom error message
error InvalidSize(uint256 max, uint256 actual);
error InvalidOptionType(uint16 optionType);
// Modifier to ensure only options of type 3 are used
modifier onlyType3(bytes memory _options) {
if (_options.toUint16(0) != TYPE_3) revert InvalidOptionType(_options.toUint16(0));
_;
}
/**
* @dev Creates a new options container with type 3.
* @return options The newly created options container.
*/
function newOptions() internal pure returns (bytes memory) {
return abi.encodePacked(TYPE_3);
}
/**
* @dev Adds an executor LZ receive option to the existing options.
* @param _options The existing options container.
* @param _gas The gasLimit used on the lzReceive() function in the OApp.
* @param _value The msg.value passed to the lzReceive() function in the OApp.
* @return options The updated options container.
*
* @dev When multiples of this option are added, they are summed by the executor
* eg. if (_gas: 200k, and _value: 1 ether) AND (_gas: 100k, _value: 0.5 ether) are sent in an option to the LayerZeroEndpoint,
* that becomes (300k, 1.5 ether) when the message is executed on the remote lzReceive() function.
*/
function addExecutorLzReceiveOption(
bytes memory _options,
uint128 _gas,
uint128 _value
) internal pure onlyType3(_options) returns (bytes memory) {
bytes memory option = ExecutorOptions.encodeLzReceiveOption(_gas, _value);
return addExecutorOption(_options, ExecutorOptions.OPTION_TYPE_LZRECEIVE, option);
}
/**
* @dev Adds an executor native drop option to the existing options.
* @param _options The existing options container.
* @param _amount The amount for the native value that is airdropped to the 'receiver'.
* @param _receiver The receiver address for the native drop option.
* @return options The updated options container.
*
* @dev When multiples of this option are added, they are summed by the executor on the remote chain.
*/
function addExecutorNativeDropOption(
bytes memory _options,
uint128 _amount,
bytes32 _receiver
) internal pure onlyType3(_options) returns (bytes memory) {
bytes memory option = ExecutorOptions.encodeNativeDropOption(_amount, _receiver);
return addExecutorOption(_options, ExecutorOptions.OPTION_TYPE_NATIVE_DROP, option);
}
/**
* @dev Adds an executor LZ compose option to the existing options.
* @param _options The existing options container.
* @param _index The index for the lzCompose() function call.
* @param _gas The gasLimit for the lzCompose() function call.
* @param _value The msg.value for the lzCompose() function call.
* @return options The updated options container.
*
* @dev When multiples of this option are added, they are summed PER index by the executor on the remote chain.
* @dev If the OApp sends N lzCompose calls on the remote, you must provide N incremented indexes starting with 0.
* ie. When your remote OApp composes (N = 3) messages, you must set this option for index 0,1,2
*/
function addExecutorLzComposeOption(
bytes memory _options,
uint16 _index,
uint128 _gas,
uint128 _value
) internal pure onlyType3(_options) returns (bytes memory) {
bytes memory option = ExecutorOptions.encodeLzComposeOption(_index, _gas, _value);
return addExecutorOption(_options, ExecutorOptions.OPTION_TYPE_LZCOMPOSE, option);
}
/**
* @dev Adds an executor ordered execution option to the existing options.
* @param _options The existing options container.
* @return options The updated options container.
*/
function addExecutorOrderedExecutionOption(
bytes memory _options
) internal pure onlyType3(_options) returns (bytes memory) {
return addExecutorOption(_options, ExecutorOptions.OPTION_TYPE_ORDERED_EXECUTION, bytes(""));
}
/**
* @dev Adds a DVN pre-crime option to the existing options.
* @param _options The existing options container.
* @param _dvnIdx The DVN index for the pre-crime option.
* @return options The updated options container.
*/
function addDVNPreCrimeOption(
bytes memory _options,
uint8 _dvnIdx
) internal pure onlyType3(_options) returns (bytes memory) {
return addDVNOption(_options, _dvnIdx, DVNOptions.OPTION_TYPE_PRECRIME, bytes(""));
}
/**
* @dev Adds an executor option to the existing options.
* @param _options The existing options container.
* @param _optionType The type of the executor option.
* @param _option The encoded data for the executor option.
* @return options The updated options container.
*/
function addExecutorOption(
bytes memory _options,
uint8 _optionType,
bytes memory _option
) internal pure onlyType3(_options) returns (bytes memory) {
return
abi.encodePacked(
_options,
ExecutorOptions.WORKER_ID,
_option.length.toUint16() + 1, // +1 for optionType
_optionType,
_option
);
}
/**
* @dev Adds a DVN option to the existing options.
* @param _options The existing options container.
* @param _dvnIdx The DVN index for the DVN option.
* @param _optionType The type of the DVN option.
* @param _option The encoded data for the DVN option.
* @return options The updated options container.
*/
function addDVNOption(
bytes memory _options,
uint8 _dvnIdx,
uint8 _optionType,
bytes memory _option
) internal pure onlyType3(_options) returns (bytes memory) {
return
abi.encodePacked(
_options,
DVNOptions.WORKER_ID,
_option.length.toUint16() + 2, // +2 for optionType and dvnIdx
_dvnIdx,
_optionType,
_option
);
}
/**
* @dev Encodes legacy options of type 1.
* @param _executionGas The gasLimit value passed to lzReceive().
* @return legacyOptions The encoded legacy options.
*/
function encodeLegacyOptionsType1(uint256 _executionGas) internal pure returns (bytes memory) {
if (_executionGas > type(uint128).max) revert InvalidSize(type(uint128).max, _executionGas);
return abi.encodePacked(TYPE_1, _executionGas);
}
/**
* @dev Encodes legacy options of type 2.
* @param _executionGas The gasLimit value passed to lzReceive().
* @param _nativeForDst The amount of native air dropped to the receiver.
* @param _receiver The _nativeForDst receiver address.
* @return legacyOptions The encoded legacy options of type 2.
*/
function encodeLegacyOptionsType2(
uint256 _executionGas,
uint256 _nativeForDst,
bytes memory _receiver // @dev Use bytes instead of bytes32 in legacy type 2 for _receiver.
) internal pure returns (bytes memory) {
if (_executionGas > type(uint128).max) revert InvalidSize(type(uint128).max, _executionGas);
if (_nativeForDst > type(uint128).max) revert InvalidSize(type(uint128).max, _nativeForDst);
if (_receiver.length > 32) revert InvalidSize(32, _receiver.length);
return abi.encodePacked(TYPE_2, _executionGas, _nativeForDst, _receiver);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
// @dev Import the 'MessagingFee' and 'MessagingReceipt' so it's exposed to OApp implementers
// solhint-disable-next-line no-unused-import
import { OAppSender, MessagingFee, MessagingReceipt } from "./OAppSender.sol";
// @dev Import the 'Origin' so it's exposed to OApp implementers
// solhint-disable-next-line no-unused-import
import { OAppReceiver, Origin } from "./OAppReceiver.sol";
import { OAppCore } from "./OAppCore.sol";
/**
* @title OApp
* @dev Abstract contract serving as the base for OApp implementation, combining OAppSender and OAppReceiver functionality.
*/
abstract contract OApp is OAppSender, OAppReceiver {
/**
* @dev Constructor to initialize the OApp with the provided endpoint and owner.
* @param _endpoint The address of the LOCAL LayerZero endpoint.
* @param _delegate The delegate capable of making OApp configurations inside of the endpoint.
*/
function __OApp_init(address _endpoint, address _delegate) internal {
__OAppCore_init(_endpoint, _delegate);
}
/**
* @notice Retrieves the OApp version information.
* @return senderVersion The version of the OAppSender.sol implementation.
* @return receiverVersion The version of the OAppReceiver.sol implementation.
*/
function oAppVersion()
public
pure
virtual
override(OAppSender, OAppReceiver)
returns (uint64 senderVersion, uint64 receiverVersion)
{
return (SENDER_VERSION, RECEIVER_VERSION);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { SafeOwnable } from "@solidstate/contracts/access/ownable/SafeOwnable.sol";
import { OAppCoreStorage } from "./libs/OAppCoreStorage.sol";
import { IOAppCore, ILayerZeroEndpointV2 } from "./interfaces/IOAppCore.sol";
/**
* @title OAppCore
* @dev Abstract contract implementing the IOAppCore interface with basic OApp configurations.
*/
abstract contract OAppCore is IOAppCore, SafeOwnable {
using OAppCoreStorage for OAppCoreStorage.Layout;
/**
* @dev initialize the OAppCore with the provided endpoint and delegate.
* @param _endpoint The address of the LOCAL Layer Zero endpoint.
* @param _delegate The delegate capable of making OApp configurations inside of the endpoint.
*
* @dev The delegate typically should be set as the owner of the contract.
*/
function __OAppCore_init(address _endpoint, address _delegate) internal {
_setOwner(msg.sender);
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
$.endpoint = ILayerZeroEndpointV2(_endpoint);
if (_delegate == address(0)) revert InvalidDelegate();
$.endpoint.setDelegate(_delegate);
}
function peers(uint32 _eid) external view returns (bytes32) {
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
return $.peers[_eid];
}
function endpoint() external view returns (ILayerZeroEndpointV2) {
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
return $.endpoint;
}
/**
* @notice Sets the peer address (OApp instance) for a corresponding endpoint.
* @param _eid The endpoint ID.
* @param _peer The address of the peer to be associated with the corresponding endpoint.
*
* @dev Only the owner/admin of the OApp can call this function.
* @dev Indicates that the peer is trusted to send LayerZero messages to this OApp.
* @dev Set this to bytes32(0) to remove the peer address.
* @dev Peer is a bytes32 to accommodate non-evm chains.
*/
function setPeer(uint32 _eid, bytes32 _peer) public virtual onlyOwner {
_setPeer(_eid, _peer);
}
/**
* @notice Sets the peer address (OApp instance) for a corresponding endpoint.
* @param _eid The endpoint ID.
* @param _peer The address of the peer to be associated with the corresponding endpoint.
*
* @dev Indicates that the peer is trusted to send LayerZero messages to this OApp.
* @dev Set this to bytes32(0) to remove the peer address.
* @dev Peer is a bytes32 to accommodate non-evm chains.
*/
function _setPeer(uint32 _eid, bytes32 _peer) internal virtual {
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
$.peers[_eid] = _peer;
emit PeerSet(_eid, _peer);
}
/**
* @notice Internal function to get the peer address associated with a specific endpoint; reverts if NOT set.
* ie. the peer is set to bytes32(0).
* @param _eid The endpoint ID.
* @return peer The address of the peer associated with the specified endpoint.
*/
function _getPeerOrRevert(uint32 _eid) internal view virtual returns (bytes32) {
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
bytes32 peer = $.peers[_eid];
if (peer == bytes32(0)) revert NoPeer(_eid);
return peer;
}
/**
* @notice Sets the delegate address for the OApp.
* @param _delegate The address of the delegate to be set.
*
* @dev Only the owner/admin of the OApp can call this function.
* @dev Provides the ability for a delegate to set configs, on behalf of the OApp, directly on the Endpoint contract.
*/
function setDelegate(address _delegate) public onlyOwner {
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
$.endpoint.setDelegate(_delegate);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IOAppReceiver, Origin } from "./interfaces/IOAppReceiver.sol";
import { OAppCore } from "./OAppCore.sol";
import { OAppCoreStorage } from "./libs/OAppCoreStorage.sol";
/**
* @title OAppReceiver
* @dev Abstract contract implementing the ILayerZeroReceiver interface and extending OAppCore for OApp receivers.
*/
abstract contract OAppReceiver is IOAppReceiver, OAppCore {
using OAppCoreStorage for OAppCoreStorage.Layout;
// Custom error message for when the caller is not the registered endpoint/
error OnlyEndpoint(address addr);
// @dev The version of the OAppReceiver implementation.
// @dev Version is bumped when changes are made to this contract.
uint64 internal constant RECEIVER_VERSION = 2;
/**
* @notice Retrieves the OApp version information.
* @return senderVersion The version of the OAppSender.sol contract.
* @return receiverVersion The version of the OAppReceiver.sol contract.
*
* @dev Providing 0 as the default for OAppSender version. Indicates that the OAppSender is not implemented.
* ie. this is a RECEIVE only OApp.
* @dev If the OApp uses both OAppSender and OAppReceiver, then this needs to be override returning the correct versions.
*/
function oAppVersion() public view virtual returns (uint64 senderVersion, uint64 receiverVersion) {
return (0, RECEIVER_VERSION);
}
/**
* @notice Indicates whether an address is an approved composeMsg sender to the Endpoint.
* @dev _origin The origin information containing the source endpoint and sender address.
* - srcEid: The source chain endpoint ID.
* - sender: The sender address on the src chain.
* - nonce: The nonce of the message.
* @dev _message The lzReceive payload.
* @param _sender The sender address.
* @return isSender Is a valid sender.
*
* @dev Applications can optionally choose to implement separate composeMsg senders that are NOT the bridging layer.
* @dev The default sender IS the OAppReceiver implementer.
*/
function isComposeMsgSender(
Origin calldata /*_origin*/,
bytes calldata /*_message*/,
address _sender
) public view virtual returns (bool) {
return _sender == address(this);
}
/**
* @notice Checks if the path initialization is allowed based on the provided origin.
* @param origin The origin information containing the source endpoint and sender address.
* @return Whether the path has been initialized.
*
* @dev This indicates to the endpoint that the OApp has enabled msgs for this particular path to be received.
* @dev This defaults to assuming if a peer has been set, its initialized.
* Can be overridden by the OApp if there is other logic to determine this.
*/
function allowInitializePath(Origin calldata origin) public view virtual returns (bool) {
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
return $.peers[origin.srcEid] == origin.sender;
}
/**
* @notice Retrieves the next nonce for a given source endpoint and sender address.
* @dev _srcEid The source endpoint ID.
* @dev _sender The sender address.
* @return nonce The next nonce.
*
* @dev The path nonce starts from 1. If 0 is returned it means that there is NO nonce ordered enforcement.
* @dev Is required by the off-chain executor to determine the OApp expects msg execution is ordered.
* @dev This is also enforced by the OApp.
* @dev By default this is NOT enabled. ie. nextNonce is hardcoded to return 0.
*/
function nextNonce(uint32 /*_srcEid*/, bytes32 /*_sender*/) public view virtual returns (uint64 nonce) {
return 0;
}
/**
* @dev Entry point for receiving messages or packets from the endpoint.
* @param _origin The origin information containing the source endpoint and sender address.
* - srcEid: The source chain endpoint ID.
* - sender: The sender address on the src chain.
* - nonce: The nonce of the message.
* @param _guid The unique identifier for the received LayerZero message.
* @param _message The payload of the received message.
* @param _executor The address of the executor for the received message.
* @param _extraData Additional arbitrary data provided by the corresponding executor.
*
* @dev Entry point for receiving msg/packet from the LayerZero endpoint.
*/
function lzReceive(
Origin calldata _origin,
bytes32 _guid,
bytes calldata _message,
address _executor,
bytes calldata _extraData
) public payable virtual {
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
// Ensures that only the endpoint can attempt to lzReceive() messages to this OApp.
if (address($.endpoint) != msg.sender) revert OnlyEndpoint(msg.sender);
// Ensure that the sender matches the expected peer for the source endpoint.
if (_getPeerOrRevert(_origin.srcEid) != _origin.sender) revert OnlyPeer(_origin.srcEid, _origin.sender);
// Call the internal OApp implementation of lzReceive.
_lzReceive(_origin, _guid, _message, _executor, _extraData);
}
/**
* @dev Internal function to implement lzReceive logic without needing to copy the basic parameter validation.
*/
function _lzReceive(
Origin calldata _origin,
bytes32 _guid,
bytes calldata _message,
address _executor,
bytes calldata _extraData
) internal virtual;
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { SafeERC20, IERC20 } from "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";
import { MessagingParams, MessagingFee, MessagingReceipt } from "../../protocol/interfaces/ILayerZeroEndpointV2.sol";
import { OAppCore } from "./OAppCore.sol";
import { OAppCoreStorage } from "./libs/OAppCoreStorage.sol";
/**
* @title OAppSender
* @dev Abstract contract implementing the OAppSender functionality for sending messages to a LayerZero endpoint.
*/
abstract contract OAppSender is OAppCore {
using OAppCoreStorage for OAppCoreStorage.Layout;
using SafeERC20 for IERC20;
// Custom error messages
error NotEnoughNative(uint256 msgValue);
error LzTokenUnavailable();
// @dev The version of the OAppSender implementation.
// @dev Version is bumped when changes are made to this contract.
uint64 internal constant SENDER_VERSION = 1;
/**
* @notice Retrieves the OApp version information.
* @return senderVersion The version of the OAppSender.sol contract.
* @return receiverVersion The version of the OAppReceiver.sol contract.
*
* @dev Providing 0 as the default for OAppReceiver version. Indicates that the OAppReceiver is not implemented.
* ie. this is a SEND only OApp.
* @dev If the OApp uses both OAppSender and OAppReceiver, then this needs to be override returning the correct versions
*/
function oAppVersion() public view virtual returns (uint64 senderVersion, uint64 receiverVersion) {
return (SENDER_VERSION, 0);
}
/**
* @dev Internal function to interact with the LayerZero EndpointV2.quote() for fee calculation.
* @param _dstEid The destination endpoint ID.
* @param _message The message payload.
* @param _options Additional options for the message.
* @param _payInLzToken Flag indicating whether to pay the fee in LZ tokens.
* @return fee The calculated MessagingFee for the message.
* - nativeFee: The native fee for the message.
* - lzTokenFee: The LZ token fee for the message.
*/
function _quote(
uint32 _dstEid,
bytes memory _message,
bytes memory _options,
bool _payInLzToken
) internal view virtual returns (MessagingFee memory fee) {
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
return
$.endpoint.quote(
MessagingParams(_dstEid, _getPeerOrRevert(_dstEid), _message, _options, _payInLzToken),
address(this)
);
}
/**
* @dev Internal function to interact with the LayerZero EndpointV2.send() for sending a message.
* @param _dstEid The destination endpoint ID.
* @param _message The message payload.
* @param _options Additional options for the message.
* @param _fee The calculated LayerZero fee for the message.
* - nativeFee: The native fee.
* - lzTokenFee: The lzToken fee.
* @param _refundAddress The address to receive any excess fee values sent to the endpoint.
* @return receipt The receipt for the sent message.
* - guid: The unique identifier for the sent message.
* - nonce: The nonce of the sent message.
* - fee: The LayerZero fee incurred for the message.
*/
function _lzSend(
uint32 _dstEid,
bytes memory _message,
bytes memory _options,
MessagingFee memory _fee,
address _refundAddress
) internal virtual returns (MessagingReceipt memory receipt) {
// @dev Push corresponding fees to the endpoint, any excess is sent back to the _refundAddress from the endpoint.
uint256 messageValue = _payNative(_fee.nativeFee);
if (_fee.lzTokenFee > 0) _payLzToken(_fee.lzTokenFee);
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
return
// solhint-disable-next-line check-send-result
$.endpoint.send{ value: messageValue }(
MessagingParams(_dstEid, _getPeerOrRevert(_dstEid), _message, _options, _fee.lzTokenFee > 0),
_refundAddress
);
}
/**
* @dev Internal function to pay the native fee associated with the message.
* @param _nativeFee The native fee to be paid.
* @return nativeFee The amount of native currency paid.
*
* @dev If the OApp needs to initiate MULTIPLE LayerZero messages in a single transaction,
* this will need to be overridden because msg.value would contain multiple lzFees.
* @dev Should be overridden in the event the LayerZero endpoint requires a different native currency.
* @dev Some EVMs use an ERC20 as a method for paying transactions/gasFees.
* @dev The endpoint is EITHER/OR, ie. it will NOT support both types of native payment at a time.
*/
function _payNative(uint256 _nativeFee) internal virtual returns (uint256 nativeFee) {
if (msg.value != _nativeFee) revert NotEnoughNative(msg.value);
return _nativeFee;
}
/**
* @dev Internal function to pay the LZ token fee associated with the message.
* @param _lzTokenFee The LZ token fee to be paid.
*
* @dev If the caller is trying to pay in the specified lzToken, then the lzTokenFee is passed to the endpoint.
* @dev Any excess sent, is passed back to the specified _refundAddress in the _lzSend().
*/
function _payLzToken(uint256 _lzTokenFee) internal virtual {
// @dev Cannot cache the token because it is not immutable in the endpoint.
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
address lzToken = $.endpoint.lzToken();
if (lzToken == address(0)) revert LzTokenUnavailable();
// Pay LZ token fee by sending tokens to the endpoint.
IERC20(lzToken).safeTransferFrom(msg.sender, address($.endpoint), _lzTokenFee);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.22;
import { MessagingFee, MessagingReceipt } from "../../oapp/OAppSender.sol";
/**
* @dev Struct representing token parameters for the ONFT send() operation.
*/
struct SendParam {
uint32 dstEid; // Destination LayerZero EndpointV2 ID.
bytes32 to; // Recipient address.
uint256 tokenId;
bytes extraOptions; // Additional options supplied by the caller to be used in the LayerZero message.
bytes composeMsg; // The composed message for the send() operation.
bytes onftCmd; // The ONFT command to be executed, unused in default ONFT implementations.
}
/**
* @title IONFT
* @dev Interface for the ONFT721 token.
* @dev Does not inherit ERC721 to accommodate usage by OFT721Adapter.
*/
interface IONFT721 {
// Custom error messages
error InvalidReceiver();
error OnlyNFTOwner(address caller, address owner);
// Events
event ONFTSent(
bytes32 indexed guid, // GUID of the ONFT message.
uint32 dstEid, // Destination Endpoint ID.
address indexed fromAddress, // Address of the sender on the src chain.
uint256 tokenId // ONFT ID sent.
);
event ONFTReceived(
bytes32 indexed guid, // GUID of the ONFT message.
uint32 srcEid, // Source Endpoint ID.
address indexed toAddress, // Address of the recipient on the dst chain.
uint256 tokenId // ONFT ID received.
);
/**
* @notice Retrieves interfaceID and the version of the ONFT.
* @return interfaceId The interface ID.
* @return version The version.
* @dev interfaceId: This specific interface ID is '0x94642228'.
* @dev version: Indicates a cross-chain compatible msg encoding with other ONFTs.
* @dev If a new feature is added to the ONFT cross-chain msg encoding, the version will be incremented.
* ie. localONFT version(x,1) CAN send messages to remoteONFT version(x,1)
*/
function onftVersion() external view returns (bytes4 interfaceId, uint64 version);
/**
* @notice Retrieves the address of the token associated with the ONFT.
* @return token The address of the ERC721 token implementation.
*/
function token() external view returns (address);
/**
* @notice Indicates whether the ONFT contract requires approval of the 'token()' to send.
* @return requiresApproval Needs approval of the underlying token implementation.
* @dev Allows things like wallet implementers to determine integration requirements,
* without understanding the underlying token implementation.
*/
function approvalRequired() external view returns (bool);
/**
* @notice Provides a quote for the send() operation.
* @param _sendParam The parameters for the send() operation.
* @param _payInLzToken Flag indicating whether the caller is paying in the LZ token.
* @return fee The calculated LayerZero messaging fee from the send() operation.
* @dev MessagingFee: LayerZero msg fee
* - nativeFee: The native fee.
* - lzTokenFee: The lzToken fee.
*/
function quoteSend(SendParam calldata _sendParam, bool _payInLzToken) external view returns (MessagingFee memory);
/**
* @notice Executes the send() operation.
* @param _sendParam The parameters for the send operation.
* @param _fee The fee information supplied by the caller.
* - nativeFee: The native fee.
* - lzTokenFee: The lzToken fee.
* @param _refundAddress The address to receive any excess funds from fees etc. on the src.
* @return receipt The LayerZero messaging receipt from the send() operation.
* @dev MessagingReceipt: LayerZero msg receipt
* - guid: The unique identifier for the sent message.
* - nonce: The nonce of the sent message.
* - fee: The LayerZero fee incurred for the message.
*/
function send(
SendParam calldata _sendParam,
MessagingFee calldata _fee,
address _refundAddress
) external payable returns (MessagingReceipt memory);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.22;
library ONFT721CoreStorage {
struct Layout {
address msgInspector; // Address of the optional message inspector contract
}
// keccak256(abi.encode(uint256(keccak256("primefi.layerzero.storage.onft721core")) - 1)) & ~bytes32(uint256(0xff))
bytes32 private constant STORAGE_SLOT = 0x831bef63b5afbb472ffb0039f0027e0f8cb92dca0f265bddf9c795a7b4be6400;
function layout() internal pure returns (Layout storage l) {
assembly {
l.slot := STORAGE_SLOT
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.22;
/**
* @title ONFT721MsgCodec
* @notice Library for encoding and decoding ONFT721 LayerZero messages.
*/
library ONFT721MsgCodec {
uint8 private constant SEND_TO_OFFSET = 32;
uint8 private constant TOKEN_ID_OFFSET = 64;
/**
* @dev Encodes an ONFT721 LayerZero message payload.
* @param _sendTo The recipient address.
* @param _tokenId The ID of the token to transfer.
* @param _composeMsg The composed payload.
* @return payload The encoded message payload.
* @return hasCompose A boolean indicating whether the message payload contains a composed payload.
*/
function encode(
bytes32 _sendTo,
uint256 _tokenId,
bytes memory _composeMsg
) internal view returns (bytes memory payload, bool hasCompose) {
hasCompose = _composeMsg.length > 0;
payload = hasCompose
? abi.encodePacked(_sendTo, _tokenId, addressToBytes32(msg.sender), _composeMsg)
: abi.encodePacked(_sendTo, _tokenId);
}
/**
* @dev Decodes sendTo from the ONFT LayerZero message.
* @param _msg The message.
* @return The recipient address in bytes32 format.
*/
function sendTo(bytes calldata _msg) internal pure returns (bytes32) {
return bytes32(_msg[:SEND_TO_OFFSET]);
}
/**
* @dev Decodes tokenId from the ONFT LayerZero message.
* @param _msg The message.
* @return The ID of the tokens to transfer.
*/
function tokenId(bytes calldata _msg) internal pure returns (uint256) {
return uint256(bytes32(_msg[SEND_TO_OFFSET:TOKEN_ID_OFFSET]));
}
/**
* @dev Decodes whether there is a composed payload.
* @param _msg The message.
* @return A boolean indicating whether the message has a composed payload.
*/
function isComposed(bytes calldata _msg) internal pure returns (bool) {
return _msg.length > TOKEN_ID_OFFSET;
}
/**
* @dev Decodes the composed message.
* @param _msg The message.
* @return The composed message.
*/
function composeMsg(bytes calldata _msg) internal pure returns (bytes memory) {
return _msg[TOKEN_ID_OFFSET:];
}
/**
* @dev Converts an address to bytes32.
* @param _addr The address to convert.
* @return The bytes32 representation of the address.
*/
function addressToBytes32(address _addr) internal pure returns (bytes32) {
return bytes32(uint256(uint160(_addr)));
}
/**
* @dev Converts bytes32 to an address.
* @param _b The bytes32 value to convert.
* @return The address representation of bytes32.
*/
function bytes32ToAddress(bytes32 _b) internal pure returns (address) {
return address(uint160(uint256(_b)));
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.22;
import {Ownable} from "@openzeppelin/contracts/access/Ownable.sol";
import { OApp, Origin } from "../oapp/OApp.sol";
import { OAppOptionsType3 } from "../oapp/libs/OAppOptionsType3.sol";
import { IOAppMsgInspector } from "../oapp/interfaces/IOAppMsgInspector.sol";
import { OAppPreCrimeSimulator } from "../precrime/OAppPreCrimeSimulator.sol";
import { ONFT721CoreStorage } from "./libs/ONFT721CoreStorage.sol";
import { IONFT721, MessagingFee, MessagingReceipt, SendParam } from "./interfaces/IONFT721.sol";
import { ONFT721MsgCodec } from "./libs/ONFT721MsgCodec.sol";
import { ONFTComposeMsgCodec } from "../libs/ONFTComposeMsgCodec.sol";
import { OAppCoreStorage } from "../oapp/libs/OAppCoreStorage.sol";
/**
* @title ONFT721Core
* @dev Abstract contract for an ONFT721 token.
*/
abstract contract ONFT721Core is IONFT721, OApp, OAppPreCrimeSimulator, OAppOptionsType3 {
using ONFT721MsgCodec for bytes;
using ONFT721MsgCodec for bytes32;
using ONFT721CoreStorage for ONFT721CoreStorage.Layout;
using OAppCoreStorage for OAppCoreStorage.Layout;
// @notice Msg types that are used to identify the various OFT operations.
// @dev This can be extended in child contracts for non-default oft operations
// @dev These values are used in things like combineOptions() in OAppOptionsType3.sol.
uint16 public constant SEND = 1;
uint16 public constant SEND_AND_COMPOSE = 2;
event MsgInspectorSet(address inspector);
/**
* @dev Constructor.
* @param _lzEndpoint The address of the LayerZero endpoint.
* @param _delegate The delegate capable of making OApp configurations inside of the endpoint.
*/
function __ONFT721Core_init(
address _lzEndpoint,
address _delegate
) internal {
_setOwner(msg.sender);
__OApp_init(_lzEndpoint, _delegate);
}
/**
* @notice Retrieves interfaceID and the version of the ONFT.
* @return interfaceId The interface ID (0x23e18da6).
* @return version The version.
* @dev version: Indicates a cross-chain compatible msg encoding with other ONFTs.
* @dev If a new feature is added to the ONFT cross-chain msg encoding, the version will be incremented.
* @dev ie. localONFT version(x,1) CAN send messages to remoteONFT version(x,1)
*/
function onftVersion() external pure virtual returns (bytes4 interfaceId, uint64 version) {
return (type(IONFT721).interfaceId, 1);
}
/**
* @notice Sets the message inspector address for the OFT.
* @param _msgInspector The address of the message inspector.
* @dev This is an optional contract that can be used to inspect both 'message' and 'options'.
* @dev Set it to address(0) to disable it, or set it to a contract address to enable it.
*/
function setMsgInspector(address _msgInspector) public virtual onlyOwner {
ONFT721CoreStorage.Layout storage $ = ONFT721CoreStorage.layout();
$.msgInspector = _msgInspector;
emit MsgInspectorSet(_msgInspector);
}
function quoteSend(
SendParam calldata _sendParam,
bool _payInLzToken
) external view virtual returns (MessagingFee memory msgFee) {
(bytes memory message, bytes memory options) = _buildMsgAndOptions(_sendParam);
return _quote(_sendParam.dstEid, message, options, _payInLzToken);
}
function send(
SendParam calldata _sendParam,
MessagingFee calldata _fee,
address _refundAddress
) external payable virtual returns (MessagingReceipt memory msgReceipt) {
_debit(msg.sender, _sendParam.tokenId, _sendParam.dstEid);
(bytes memory message, bytes memory options) = _buildMsgAndOptions(_sendParam);
// @dev Sends the message to the LayerZero Endpoint, returning the MessagingReceipt.
msgReceipt = _lzSend(_sendParam.dstEid, message, options, _fee, _refundAddress);
emit ONFTSent(msgReceipt.guid, _sendParam.dstEid, msg.sender, _sendParam.tokenId);
}
/**
* @dev Internal function to build the message and options.
* @param _sendParam The parameters for the send() operation.
* @return message The encoded message.
* @return options The encoded options.
*/
function _buildMsgAndOptions(
SendParam calldata _sendParam
) internal view virtual returns (bytes memory message, bytes memory options) {
if (_sendParam.to == bytes32(0)) revert InvalidReceiver();
bool hasCompose;
(message, hasCompose) = ONFT721MsgCodec.encode(_sendParam.to, _sendParam.tokenId, _sendParam.composeMsg);
uint16 msgType = hasCompose ? SEND_AND_COMPOSE : SEND;
options = combineOptions(_sendParam.dstEid, msgType, _sendParam.extraOptions);
// @dev Optionally inspect the message and options depending if the OApp owner has set a msg inspector.
// @dev If it fails inspection, needs to revert in the implementation. ie. does not rely on return boolean
ONFT721CoreStorage.Layout storage $ = ONFT721CoreStorage.layout();
address inspector = $.msgInspector; // caches the msgInspector to avoid potential double storage read
if (inspector != address(0)) IOAppMsgInspector(inspector).inspect(message, options);
}
/**
* @dev Internal function to handle the receive on the LayerZero endpoint.
* @param _origin The origin information.
* - srcEid: The source chain endpoint ID.
* - sender: The sender address from the src chain.
* - nonce: The nonce of the LayerZero message.
* @param _guid The unique identifier for the received LayerZero message.
* @param _message The encoded message.
* @dev _executor The address of the executor.
* @dev _extraData Additional data.
*/
function _lzReceive(
Origin calldata _origin,
bytes32 _guid,
bytes calldata _message,
address /*_executor*/, // @dev unused in the default implementation.
bytes calldata /*_extraData*/ // @dev unused in the default implementation.
) internal virtual override {
address toAddress = _message.sendTo().bytes32ToAddress();
uint256 tokenId = _message.tokenId();
_credit(toAddress, tokenId, _origin.srcEid);
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
if (_message.isComposed()) {
bytes memory composeMsg = ONFTComposeMsgCodec.encode(_origin.nonce, _origin.srcEid, _message.composeMsg());
// @dev As batching is not implemented, the compose index is always 0.
// @dev If batching is added, the index will need to be tracked.
$.endpoint.sendCompose(toAddress, _guid, 0 /* the index of composed message*/, composeMsg);
}
emit ONFTReceived(_guid, _origin.srcEid, toAddress, tokenId);
}
/**
* @dev Internal function to handle the OAppPreCrimeSimulator simulated receive.
* @param _origin The origin information.
* - srcEid: The source chain endpoint ID.
* - sender: The sender address from the src chain.
* - nonce: The nonce of the LayerZero message.
* @param _guid The unique identifier for the received LayerZero message.
* @param _message The LayerZero message.
* @param _executor The address of the off-chain executor.
* @param _extraData Arbitrary data passed by the msg executor.
* @dev Enables the preCrime simulator to mock sending lzReceive() messages,
* routes the msg down from the OAppPreCrimeSimulator, and back up to the OAppReceiver.
*/
function _lzReceiveSimulate(
Origin calldata _origin,
bytes32 _guid,
bytes calldata _message,
address _executor,
bytes calldata _extraData
) internal virtual override {
_lzReceive(_origin, _guid, _message, _executor, _extraData);
}
/**
* @dev Check if the peer is considered 'trusted' by the OApp.
* @param _eid The endpoint ID to check.
* @param _peer The peer to check.
* @return Whether the peer passed is considered 'trusted' by the OApp.
* @dev Enables OAppPreCrimeSimulator to check whether a potential Inbound Packet is from a trusted source.
*/
function isPeer(uint32 _eid, bytes32 _peer) public view virtual override returns (bool) {
OAppCoreStorage.Layout storage $ = OAppCoreStorage.layout();
return $.peers[_eid] == _peer;
}
function _debit(address /*_from*/, uint256 /*_tokenId*/, uint32 /*_dstEid*/) internal virtual;
function _credit(address /*_to*/, uint256 /*_tokenId*/, uint32 /*_srcEid*/) internal virtual;
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.22;
import { SolidStateERC721 } from "@solidstate/contracts/token/ERC721/SolidStateERC721.sol";
import { ERC721MetadataStorage } from "@solidstate/contracts/token/ERC721/metadata/ERC721MetadataStorage.sol";
import { ONFT721Core } from "./ONFT721Core.sol";
/**
* @title ONFT721Enumerable Contract
* @dev ONFT721 is an ERC-721 token that extends the functionality of the ONFT721Core contract.
*/
abstract contract ONFT721Enumerable is ONFT721Core, SolidStateERC721 {
using ERC721MetadataStorage for ERC721MetadataStorage.Layout;
event BaseURISet(string baseURI);
/**
* @dev Constructor for the ONFT721 contract.
* @param _name The name of the ONFT.
* @param _symbol The symbol of the ONFT.
* @param _lzEndpoint The LayerZero endpoint address.
* @param _delegate The delegate capable of making OApp configurations inside of the endpoint.
*/
function __ONFT721Enumerable_init(
string memory _name,
string memory _symbol,
address _lzEndpoint,
address _delegate
) internal {
ERC721MetadataStorage.Layout storage $ = ERC721MetadataStorage.layout();
$.name = _name;
$.symbol = _symbol;
__ONFT721Core_init(_lzEndpoint, _delegate);
}
/**
* @notice Retrieves the address of the underlying ERC721 implementation (ie. this contract).
*/
function token() external view returns (address) {
return address(this);
}
function setBaseURI(string calldata _baseTokenURI) external onlyOwner {
ERC721MetadataStorage.Layout storage $ = ERC721MetadataStorage.layout();
$.baseURI = _baseTokenURI;
emit BaseURISet($.baseURI);
}
function _baseURI() internal view returns (string memory) {
ERC721MetadataStorage.Layout storage $ = ERC721MetadataStorage.layout();
return $.baseURI;
}
/**
* @notice Indicates whether the ONFT721 contract requires approval of the 'token()' to send.
* @dev In the case of ONFT where the contract IS the token, approval is NOT required.
* @return requiresApproval Needs approval of the underlying token implementation.
*/
function approvalRequired() external pure virtual returns (bool) {
return false;
}
function _debit(address _from, uint256 _tokenId, uint32 /*_dstEid*/) internal virtual override {
if (_from != _ownerOf(_tokenId)) revert OnlyNFTOwner(_from, _ownerOf(_tokenId));
_burn(_tokenId);
}
function _credit(address _to, uint256 _tokenId, uint32 /*_srcEid*/) internal virtual override {
_mint(_to, _tokenId);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
// @dev Import the Origin so it's exposed to OAppPreCrimeSimulator implementers.
// solhint-disable-next-line no-unused-import
import { InboundPacket, Origin } from "../libs/Packet.sol";
/**
* @title IOAppPreCrimeSimulator Interface
* @dev Interface for the preCrime simulation functionality in an OApp.
*/
interface IOAppPreCrimeSimulator {
// @dev simulation result used in PreCrime implementation
error SimulationResult(bytes result);
error OnlySelf();
/**
* @dev Emitted when the preCrime contract address is set.
* @param preCrimeAddress The address of the preCrime contract.
*/
event PreCrimeSet(address preCrimeAddress);
/**
* @dev Retrieves the address of the preCrime contract implementation.
* @return The address of the preCrime contract.
*/
function preCrime() external view returns (address);
/**
* @dev Retrieves the address of the OApp contract.
* @return The address of the OApp contract.
*/
function oApp() external view returns (address);
/**
* @dev Sets the preCrime contract address.
* @param _preCrime The address of the preCrime contract.
*/
function setPreCrime(address _preCrime) external;
/**
* @dev Mocks receiving a packet, then reverts with a series of data to infer the state/result.
* @param _packets An array of LayerZero InboundPacket objects representing received packets.
*/
function lzReceiveAndRevert(InboundPacket[] calldata _packets) external payable;
/**
* @dev checks if the specified peer is considered 'trusted' by the OApp.
* @param _eid The endpoint Id to check.
* @param _peer The peer to check.
* @return Whether the peer passed is considered 'trusted' by the OApp.
*/
function isPeer(uint32 _eid, bytes32 _peer) external view returns (bool);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
struct PreCrimePeer {
uint32 eid;
bytes32 preCrime;
bytes32 oApp;
}
// TODO not done yet
interface IPreCrime {
error OnlyOffChain();
// for simulate()
error PacketOversize(uint256 max, uint256 actual);
error PacketUnsorted();
error SimulationFailed(bytes reason);
// for preCrime()
error SimulationResultNotFound(uint32 eid);
error InvalidSimulationResult(uint32 eid, bytes reason);
error CrimeFound(bytes crime);
function getConfig(bytes[] calldata _packets, uint256[] calldata _packetMsgValues) external returns (bytes memory);
function simulate(
bytes[] calldata _packets,
uint256[] calldata _packetMsgValues
) external payable returns (bytes memory);
function buildSimulationResult() external view returns (bytes memory);
function preCrime(
bytes[] calldata _packets,
uint256[] calldata _packetMsgValues,
bytes[] calldata _simulations
) external;
function version() external view returns (uint64 major, uint8 minor);
}// SPDX-License-Identifier: SEE LICENSE IN LICENSE
pragma solidity ^0.8.22;
library OAppPreCrimeSimulatorStorage {
struct Layout {
// The address of the preCrime implementation.
address preCrime;
}
// keccak256(abi.encode(uint256(keccak256("primefi.layerzero.storage.oappprecrimesimulator")) - 1)) & ~bytes32(uint256(0xff))
bytes32 private constant STORAGE_SLOT =
0x41cc82cee84fffdd1f933aa25ee29b9ef8f6f02e6e1fee0f86ecd08b727a8c00;
function layout() internal pure returns (Layout storage l) {
assembly {
l.slot := STORAGE_SLOT
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { Origin } from "../../../protocol/interfaces/ILayerZeroEndpointV2.sol";
import { PacketV1Codec } from "../../../protocol/messagelib/libs/PacketV1Codec.sol";
/**
* @title InboundPacket
* @dev Structure representing an inbound packet received by the contract.
*/
struct InboundPacket {
Origin origin; // Origin information of the packet.
uint32 dstEid; // Destination endpointId of the packet.
address receiver; // Receiver address for the packet.
bytes32 guid; // Unique identifier of the packet.
uint256 value; // msg.value of the packet.
address executor; // Executor address for the packet.
bytes message; // Message payload of the packet.
bytes extraData; // Additional arbitrary data for the packet.
}
/**
* @title PacketDecoder
* @dev Library for decoding LayerZero packets.
*/
library PacketDecoder {
using PacketV1Codec for bytes;
/**
* @dev Decode an inbound packet from the given packet data.
* @param _packet The packet data to decode.
* @return packet An InboundPacket struct representing the decoded packet.
*/
function decode(bytes calldata _packet) internal pure returns (InboundPacket memory packet) {
packet.origin = Origin(_packet.srcEid(), _packet.sender(), _packet.nonce());
packet.dstEid = _packet.dstEid();
packet.receiver = _packet.receiverB20();
packet.guid = _packet.guid();
packet.message = _packet.message();
}
/**
* @dev Decode multiple inbound packets from the given packet data and associated message values.
* @param _packets An array of packet data to decode.
* @param _packetMsgValues An array of associated message values for each packet.
* @return packets An array of InboundPacket structs representing the decoded packets.
*/
function decode(
bytes[] calldata _packets,
uint256[] memory _packetMsgValues
) internal pure returns (InboundPacket[] memory packets) {
packets = new InboundPacket[](_packets.length);
for (uint256 i = 0; i < _packets.length; i++) {
bytes calldata packet = _packets[i];
packets[i] = PacketDecoder.decode(packet);
// @dev Allows the verifier to specify the msg.value that gets passed in lzReceive.
packets[i].value = _packetMsgValues[i];
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { SafeOwnable } from "@solidstate/contracts/access/ownable/SafeOwnable.sol";
import "@solidstate/contracts/security/initializable/Initializable.sol";
import { OAppPreCrimeSimulatorStorage } from "./libs/OAppPreCrimeSimulatorStorage.sol";
import { IPreCrime } from "./interfaces/IPreCrime.sol";
import { IOAppPreCrimeSimulator, InboundPacket, Origin } from "./interfaces/IOAppPreCrimeSimulator.sol";
/**
* @title OAppPreCrimeSimulator
* @dev Abstract contract serving as the base for preCrime simulation functionality in an OApp.
*/
abstract contract OAppPreCrimeSimulator is IOAppPreCrimeSimulator, SafeOwnable, Initializable {
using OAppPreCrimeSimulatorStorage for OAppPreCrimeSimulatorStorage.Layout;
/**
* @dev Ownable is not initialized here on purpose. It should be initialized in the child contract to
* accommodate the different version of Ownable.
*/
function __OAppPreCrimeSimulator_init() internal {}
function __OAppPreCrimeSimulator_init_unchained() internal {}
function preCrime() external view override returns (address) {
OAppPreCrimeSimulatorStorage.Layout storage $ = OAppPreCrimeSimulatorStorage.layout();
return $.preCrime;
}
/**
* @dev Retrieves the address of the OApp contract.
* @return The address of the OApp contract.
*
* @dev The simulator contract is the base contract for the OApp by default.
* @dev If the simulator is a separate contract, override this function.
*/
function oApp() external view virtual returns (address) {
return address(this);
}
/**
* @dev Sets the preCrime contract address.
* @param _preCrime The address of the preCrime contract.
*/
function setPreCrime(address _preCrime) public virtual onlyOwner {
OAppPreCrimeSimulatorStorage.Layout storage $ = OAppPreCrimeSimulatorStorage.layout();
$.preCrime = _preCrime;
emit PreCrimeSet(_preCrime);
}
/**
* @dev Interface for pre-crime simulations. Always reverts at the end with the simulation results.
* @param _packets An array of InboundPacket objects representing received packets to be delivered.
*
* @dev WARNING: MUST revert at the end with the simulation results.
* @dev Gives the preCrime implementation the ability to mock sending packets to the lzReceive function,
* WITHOUT actually executing them.
*/
function lzReceiveAndRevert(InboundPacket[] calldata _packets) public payable virtual {
for (uint256 i = 0; i < _packets.length; i++) {
InboundPacket calldata packet = _packets[i];
// Ignore packets that are not from trusted peers.
if (!isPeer(packet.origin.srcEid, packet.origin.sender)) continue;
// @dev Because a verifier is calling this function, it doesnt have access to executor params:
// - address _executor
// - bytes calldata _extraData
// preCrime will NOT work for OApps that rely on these two parameters inside of their _lzReceive().
// They are instead stubbed to default values, address(0) and bytes("")
// @dev Calling this.lzReceiveSimulate removes ability for assembly return 0 callstack exit,
// which would cause the revert to be ignored.
this.lzReceiveSimulate{ value: packet.value }(
packet.origin,
packet.guid,
packet.message,
packet.executor,
packet.extraData
);
}
// @dev Revert with the simulation results. msg.sender must implement IPreCrime.buildSimulationResult().
revert SimulationResult(IPreCrime(msg.sender).buildSimulationResult());
}
/**
* @dev Is effectively an internal function because msg.sender must be address(this).
* Allows resetting the call stack for 'internal' calls.
* @param _origin The origin information containing the source endpoint and sender address.
* - srcEid: The source chain endpoint ID.
* - sender: The sender address on the src chain.
* - nonce: The nonce of the message.
* @param _guid The unique identifier of the packet.
* @param _message The message payload of the packet.
* @param _executor The executor address for the packet.
* @param _extraData Additional data for the packet.
*/
function lzReceiveSimulate(
Origin calldata _origin,
bytes32 _guid,
bytes calldata _message,
address _executor,
bytes calldata _extraData
) external payable virtual {
// @dev Ensure ONLY can be called 'internally'.
if (msg.sender != address(this)) revert OnlySelf();
_lzReceiveSimulate(_origin, _guid, _message, _executor, _extraData);
}
/**
* @dev Internal function to handle the OAppPreCrimeSimulator simulated receive.
* @param _origin The origin information.
* - srcEid: The source chain endpoint ID.
* - sender: The sender address from the src chain.
* - nonce: The nonce of the LayerZero message.
* @param _guid The GUID of the LayerZero message.
* @param _message The LayerZero message.
* @param _executor The address of the off-chain executor.
* @param _extraData Arbitrary data passed by the msg executor.
*
* @dev Enables the preCrime simulator to mock sending lzReceive() messages,
* routes the msg down from the OAppPreCrimeSimulator, and back up to the OAppReceiver.
*/
function _lzReceiveSimulate(
Origin calldata _origin,
bytes32 _guid,
bytes calldata _message,
address _executor,
bytes calldata _extraData
) internal virtual;
/**
* @dev checks if the specified peer is considered 'trusted' by the OApp.
* @param _eid The endpoint Id to check.
* @param _peer The peer to check.
* @return Whether the peer passed is considered 'trusted' by the OApp.
*/
function isPeer(uint32 _eid, bytes32 _peer) public view virtual returns (bool);
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
import { IMessageLibManager } from "./IMessageLibManager.sol";
import { IMessagingComposer } from "./IMessagingComposer.sol";
import { IMessagingChannel } from "./IMessagingChannel.sol";
import { IMessagingContext } from "./IMessagingContext.sol";
struct MessagingParams {
uint32 dstEid;
bytes32 receiver;
bytes message;
bytes options;
bool payInLzToken;
}
struct MessagingReceipt {
bytes32 guid;
uint64 nonce;
MessagingFee fee;
}
struct MessagingFee {
uint256 nativeFee;
uint256 lzTokenFee;
}
struct Origin {
uint32 srcEid;
bytes32 sender;
uint64 nonce;
}
interface ILayerZeroEndpointV2 is IMessageLibManager, IMessagingComposer, IMessagingChannel, IMessagingContext {
event PacketSent(bytes encodedPayload, bytes options, address sendLibrary);
event PacketVerified(Origin origin, address receiver, bytes32 payloadHash);
event PacketDelivered(Origin origin, address receiver);
event LzReceiveAlert(
address indexed receiver,
address indexed executor,
Origin origin,
bytes32 guid,
uint256 gas,
uint256 value,
bytes message,
bytes extraData,
bytes reason
);
event LzTokenSet(address token);
event DelegateSet(address sender, address delegate);
function quote(MessagingParams calldata _params, address _sender) external view returns (MessagingFee memory);
function send(
MessagingParams calldata _params,
address _refundAddress
) external payable returns (MessagingReceipt memory);
function verify(Origin calldata _origin, address _receiver, bytes32 _payloadHash) external;
function verifiable(Origin calldata _origin, address _receiver) external view returns (bool);
function initializable(Origin calldata _origin, address _receiver) external view returns (bool);
function lzReceive(
Origin calldata _origin,
address _receiver,
bytes32 _guid,
bytes calldata _message,
bytes calldata _extraData
) external payable;
// oapp can burn messages partially by calling this function with its own business logic if messages are verified in order
function clear(address _oapp, Origin calldata _origin, bytes32 _guid, bytes calldata _message) external;
function setLzToken(address _lzToken) external;
function lzToken() external view returns (address);
function nativeToken() external view returns (address);
function setDelegate(address _delegate) external;
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
import { Origin } from "./ILayerZeroEndpointV2.sol";
interface ILayerZeroReceiver {
function allowInitializePath(Origin calldata _origin) external view returns (bool);
function nextNonce(uint32 _eid, bytes32 _sender) external view returns (uint64);
function lzReceive(
Origin calldata _origin,
bytes32 _guid,
bytes calldata _message,
address _executor,
bytes calldata _extraData
) external payable;
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
import { IERC165 } from "@openzeppelin/contracts/utils/introspection/IERC165.sol";
import { SetConfigParam } from "./IMessageLibManager.sol";
enum MessageLibType {
Send,
Receive,
SendAndReceive
}
interface IMessageLib is IERC165 {
function setConfig(address _oapp, SetConfigParam[] calldata _config) external;
function getConfig(uint32 _eid, address _oapp, uint32 _configType) external view returns (bytes memory config);
function isSupportedEid(uint32 _eid) external view returns (bool);
// message libs of same major version are compatible
function version() external view returns (uint64 major, uint8 minor, uint8 endpointVersion);
function messageLibType() external view returns (MessageLibType);
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
struct SetConfigParam {
uint32 eid;
uint32 configType;
bytes config;
}
interface IMessageLibManager {
struct Timeout {
address lib;
uint256 expiry;
}
event LibraryRegistered(address newLib);
event DefaultSendLibrarySet(uint32 eid, address newLib);
event DefaultReceiveLibrarySet(uint32 eid, address newLib);
event DefaultReceiveLibraryTimeoutSet(uint32 eid, address oldLib, uint256 expiry);
event SendLibrarySet(address sender, uint32 eid, address newLib);
event ReceiveLibrarySet(address receiver, uint32 eid, address newLib);
event ReceiveLibraryTimeoutSet(address receiver, uint32 eid, address oldLib, uint256 timeout);
function registerLibrary(address _lib) external;
function isRegisteredLibrary(address _lib) external view returns (bool);
function getRegisteredLibraries() external view returns (address[] memory);
function setDefaultSendLibrary(uint32 _eid, address _newLib) external;
function defaultSendLibrary(uint32 _eid) external view returns (address);
function setDefaultReceiveLibrary(uint32 _eid, address _newLib, uint256 _timeout) external;
function defaultReceiveLibrary(uint32 _eid) external view returns (address);
function setDefaultReceiveLibraryTimeout(uint32 _eid, address _lib, uint256 _expiry) external;
function defaultReceiveLibraryTimeout(uint32 _eid) external view returns (address lib, uint256 expiry);
function isSupportedEid(uint32 _eid) external view returns (bool);
function isValidReceiveLibrary(address _receiver, uint32 _eid, address _lib) external view returns (bool);
/// ------------------- OApp interfaces -------------------
function setSendLibrary(address _oapp, uint32 _eid, address _newLib) external;
function getSendLibrary(address _sender, uint32 _eid) external view returns (address lib);
function isDefaultSendLibrary(address _sender, uint32 _eid) external view returns (bool);
function setReceiveLibrary(address _oapp, uint32 _eid, address _newLib, uint256 _gracePeriod) external;
function getReceiveLibrary(address _receiver, uint32 _eid) external view returns (address lib, bool isDefault);
function setReceiveLibraryTimeout(address _oapp, uint32 _eid, address _lib, uint256 _gracePeriod) external;
function receiveLibraryTimeout(address _receiver, uint32 _eid) external view returns (address lib, uint256 expiry);
function setConfig(address _oapp, address _lib, SetConfigParam[] calldata _params) external;
function getConfig(
address _oapp,
address _lib,
uint32 _eid,
uint32 _configType
) external view returns (bytes memory config);
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
interface IMessagingChannel {
event InboundNonceSkipped(uint32 srcEid, bytes32 sender, address receiver, uint64 nonce);
event PacketNilified(uint32 srcEid, bytes32 sender, address receiver, uint64 nonce, bytes32 payloadHash);
event PacketBurnt(uint32 srcEid, bytes32 sender, address receiver, uint64 nonce, bytes32 payloadHash);
function eid() external view returns (uint32);
// this is an emergency function if a message cannot be verified for some reasons
// required to provide _nextNonce to avoid race condition
function skip(address _oapp, uint32 _srcEid, bytes32 _sender, uint64 _nonce) external;
function nilify(address _oapp, uint32 _srcEid, bytes32 _sender, uint64 _nonce, bytes32 _payloadHash) external;
function burn(address _oapp, uint32 _srcEid, bytes32 _sender, uint64 _nonce, bytes32 _payloadHash) external;
function nextGuid(address _sender, uint32 _dstEid, bytes32 _receiver) external view returns (bytes32);
function inboundNonce(address _receiver, uint32 _srcEid, bytes32 _sender) external view returns (uint64);
function outboundNonce(address _sender, uint32 _dstEid, bytes32 _receiver) external view returns (uint64);
function inboundPayloadHash(
address _receiver,
uint32 _srcEid,
bytes32 _sender,
uint64 _nonce
) external view returns (bytes32);
function lazyInboundNonce(address _receiver, uint32 _srcEid, bytes32 _sender) external view returns (uint64);
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
interface IMessagingComposer {
event ComposeSent(address from, address to, bytes32 guid, uint16 index, bytes message);
event ComposeDelivered(address from, address to, bytes32 guid, uint16 index);
event LzComposeAlert(
address indexed from,
address indexed to,
address indexed executor,
bytes32 guid,
uint16 index,
uint256 gas,
uint256 value,
bytes message,
bytes extraData,
bytes reason
);
function composeQueue(
address _from,
address _to,
bytes32 _guid,
uint16 _index
) external view returns (bytes32 messageHash);
function sendCompose(address _to, bytes32 _guid, uint16 _index, bytes calldata _message) external;
function lzCompose(
address _from,
address _to,
bytes32 _guid,
uint16 _index,
bytes calldata _message,
bytes calldata _extraData
) external payable;
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
interface IMessagingContext {
function isSendingMessage() external view returns (bool);
function getSendContext() external view returns (uint32 dstEid, address sender);
}// SPDX-License-Identifier: MIT
pragma solidity >=0.8.0;
import { MessagingFee } from "./ILayerZeroEndpointV2.sol";
import { IMessageLib } from "./IMessageLib.sol";
struct Packet {
uint64 nonce;
uint32 srcEid;
address sender;
uint32 dstEid;
bytes32 receiver;
bytes32 guid;
bytes message;
}
interface ISendLib is IMessageLib {
function send(
Packet calldata _packet,
bytes calldata _options,
bool _payInLzToken
) external returns (MessagingFee memory, bytes memory encodedPacket);
function quote(
Packet calldata _packet,
bytes calldata _options,
bool _payInLzToken
) external view returns (MessagingFee memory);
function setTreasury(address _treasury) external;
function withdrawFee(address _to, uint256 _amount) external;
function withdrawLzTokenFee(address _lzToken, address _to, uint256 _amount) external;
}// SPDX-License-Identifier: LZBL-1.2
pragma solidity ^0.8.20;
library AddressCast {
error AddressCast_InvalidSizeForAddress();
error AddressCast_InvalidAddress();
function toBytes32(bytes calldata _addressBytes) internal pure returns (bytes32 result) {
if (_addressBytes.length > 32) revert AddressCast_InvalidAddress();
result = bytes32(_addressBytes);
unchecked {
uint256 offset = 32 - _addressBytes.length;
result = result >> (offset * 8);
}
}
function toBytes32(address _address) internal pure returns (bytes32 result) {
result = bytes32(uint256(uint160(_address)));
}
function toBytes(bytes32 _addressBytes32, uint256 _size) internal pure returns (bytes memory result) {
if (_size == 0 || _size > 32) revert AddressCast_InvalidSizeForAddress();
result = new bytes(_size);
unchecked {
uint256 offset = 256 - _size * 8;
assembly {
mstore(add(result, 32), shl(offset, _addressBytes32))
}
}
}
function toAddress(bytes32 _addressBytes32) internal pure returns (address result) {
result = address(uint160(uint256(_addressBytes32)));
}
function toAddress(bytes calldata _addressBytes) internal pure returns (address result) {
if (_addressBytes.length != 20) revert AddressCast_InvalidAddress();
result = address(bytes20(_addressBytes));
}
}// SPDX-License-Identifier: LZBL-1.2
pragma solidity ^0.8.20;
library CalldataBytesLib {
function toU8(bytes calldata _bytes, uint256 _start) internal pure returns (uint8) {
return uint8(_bytes[_start]);
}
function toU16(bytes calldata _bytes, uint256 _start) internal pure returns (uint16) {
unchecked {
uint256 end = _start + 2;
return uint16(bytes2(_bytes[_start:end]));
}
}
function toU32(bytes calldata _bytes, uint256 _start) internal pure returns (uint32) {
unchecked {
uint256 end = _start + 4;
return uint32(bytes4(_bytes[_start:end]));
}
}
function toU64(bytes calldata _bytes, uint256 _start) internal pure returns (uint64) {
unchecked {
uint256 end = _start + 8;
return uint64(bytes8(_bytes[_start:end]));
}
}
function toU128(bytes calldata _bytes, uint256 _start) internal pure returns (uint128) {
unchecked {
uint256 end = _start + 16;
return uint128(bytes16(_bytes[_start:end]));
}
}
function toU256(bytes calldata _bytes, uint256 _start) internal pure returns (uint256) {
unchecked {
uint256 end = _start + 32;
return uint256(bytes32(_bytes[_start:end]));
}
}
function toAddr(bytes calldata _bytes, uint256 _start) internal pure returns (address) {
unchecked {
uint256 end = _start + 20;
return address(bytes20(_bytes[_start:end]));
}
}
function toB32(bytes calldata _bytes, uint256 _start) internal pure returns (bytes32) {
unchecked {
uint256 end = _start + 32;
return bytes32(_bytes[_start:end]);
}
}
}// SPDX-License-Identifier: MIT
// modified from https://github.com/OpenZeppelin/openzeppelin-contracts/blob/master/contracts/utils/structs/BitMaps.sol
pragma solidity ^0.8.20;
type BitMap256 is uint256;
using BitMaps for BitMap256 global;
library BitMaps {
/**
* @dev Returns whether the bit at `index` is set.
*/
function get(BitMap256 bitmap, uint8 index) internal pure returns (bool) {
uint256 mask = 1 << index;
return BitMap256.unwrap(bitmap) & mask != 0;
}
/**
* @dev Sets the bit at `index`.
*/
function set(BitMap256 bitmap, uint8 index) internal pure returns (BitMap256) {
uint256 mask = 1 << index;
return BitMap256.wrap(BitMap256.unwrap(bitmap) | mask);
}
}// SPDX-License-Identifier: LZBL-1.2
pragma solidity ^0.8.20;
import { CalldataBytesLib } from "../../libs/CalldataBytesLib.sol";
library ExecutorOptions {
using CalldataBytesLib for bytes;
uint8 internal constant WORKER_ID = 1;
uint8 internal constant OPTION_TYPE_LZRECEIVE = 1;
uint8 internal constant OPTION_TYPE_NATIVE_DROP = 2;
uint8 internal constant OPTION_TYPE_LZCOMPOSE = 3;
uint8 internal constant OPTION_TYPE_ORDERED_EXECUTION = 4;
error Executor_InvalidLzReceiveOption();
error Executor_InvalidNativeDropOption();
error Executor_InvalidLzComposeOption();
/// @dev decode the next executor option from the options starting from the specified cursor
/// @param _options [executor_id][executor_option][executor_id][executor_option]...
/// executor_option = [option_size][option_type][option]
/// option_size = len(option_type) + len(option)
/// executor_id: uint8, option_size: uint16, option_type: uint8, option: bytes
/// @param _cursor the cursor to start decoding from
/// @return optionType the type of the option
/// @return option the option of the executor
/// @return cursor the cursor to start decoding the next executor option
function nextExecutorOption(
bytes calldata _options,
uint256 _cursor
) internal pure returns (uint8 optionType, bytes calldata option, uint256 cursor) {
unchecked {
// skip worker id
cursor = _cursor + 1;
// read option size
uint16 size = _options.toU16(cursor);
cursor += 2;
// read option type
optionType = _options.toU8(cursor);
// startCursor and endCursor are used to slice the option from _options
uint256 startCursor = cursor + 1; // skip option type
uint256 endCursor = cursor + size;
option = _options[startCursor:endCursor];
cursor += size;
}
}
function decodeLzReceiveOption(bytes calldata _option) internal pure returns (uint128 gas, uint128 value) {
if (_option.length != 16 && _option.length != 32) revert Executor_InvalidLzReceiveOption();
gas = _option.toU128(0);
value = _option.length == 32 ? _option.toU128(16) : 0;
}
function decodeNativeDropOption(bytes calldata _option) internal pure returns (uint128 amount, bytes32 receiver) {
if (_option.length != 48) revert Executor_InvalidNativeDropOption();
amount = _option.toU128(0);
receiver = _option.toB32(16);
}
function decodeLzComposeOption(
bytes calldata _option
) internal pure returns (uint16 index, uint128 gas, uint128 value) {
if (_option.length != 18 && _option.length != 34) revert Executor_InvalidLzComposeOption();
index = _option.toU16(0);
gas = _option.toU128(2);
value = _option.length == 34 ? _option.toU128(18) : 0;
}
function encodeLzReceiveOption(uint128 _gas, uint128 _value) internal pure returns (bytes memory) {
return _value == 0 ? abi.encodePacked(_gas) : abi.encodePacked(_gas, _value);
}
function encodeNativeDropOption(uint128 _amount, bytes32 _receiver) internal pure returns (bytes memory) {
return abi.encodePacked(_amount, _receiver);
}
function encodeLzComposeOption(uint16 _index, uint128 _gas, uint128 _value) internal pure returns (bytes memory) {
return _value == 0 ? abi.encodePacked(_index, _gas) : abi.encodePacked(_index, _gas, _value);
}
}// SPDX-License-Identifier: LZBL-1.2
pragma solidity ^0.8.20;
import { Packet } from "../../interfaces/ISendLib.sol";
import { AddressCast } from "../../libs/AddressCast.sol";
library PacketV1Codec {
using AddressCast for address;
using AddressCast for bytes32;
uint8 internal constant PACKET_VERSION = 1;
// header (version + nonce + path)
// version
uint256 private constant PACKET_VERSION_OFFSET = 0;
// nonce
uint256 private constant NONCE_OFFSET = 1;
// path
uint256 private constant SRC_EID_OFFSET = 9;
uint256 private constant SENDER_OFFSET = 13;
uint256 private constant DST_EID_OFFSET = 45;
uint256 private constant RECEIVER_OFFSET = 49;
// payload (guid + message)
uint256 private constant GUID_OFFSET = 81; // keccak256(nonce + path)
uint256 private constant MESSAGE_OFFSET = 113;
function encode(Packet memory _packet) internal pure returns (bytes memory encodedPacket) {
encodedPacket = abi.encodePacked(
PACKET_VERSION,
_packet.nonce,
_packet.srcEid,
_packet.sender.toBytes32(),
_packet.dstEid,
_packet.receiver,
_packet.guid,
_packet.message
);
}
function encodePacketHeader(Packet memory _packet) internal pure returns (bytes memory) {
return
abi.encodePacked(
PACKET_VERSION,
_packet.nonce,
_packet.srcEid,
_packet.sender.toBytes32(),
_packet.dstEid,
_packet.receiver
);
}
function encodePayload(Packet memory _packet) internal pure returns (bytes memory) {
return abi.encodePacked(_packet.guid, _packet.message);
}
function header(bytes calldata _packet) internal pure returns (bytes calldata) {
return _packet[0:GUID_OFFSET];
}
function version(bytes calldata _packet) internal pure returns (uint8) {
return uint8(bytes1(_packet[PACKET_VERSION_OFFSET:NONCE_OFFSET]));
}
function nonce(bytes calldata _packet) internal pure returns (uint64) {
return uint64(bytes8(_packet[NONCE_OFFSET:SRC_EID_OFFSET]));
}
function srcEid(bytes calldata _packet) internal pure returns (uint32) {
return uint32(bytes4(_packet[SRC_EID_OFFSET:SENDER_OFFSET]));
}
function sender(bytes calldata _packet) internal pure returns (bytes32) {
return bytes32(_packet[SENDER_OFFSET:DST_EID_OFFSET]);
}
function senderAddressB20(bytes calldata _packet) internal pure returns (address) {
return sender(_packet).toAddress();
}
function dstEid(bytes calldata _packet) internal pure returns (uint32) {
return uint32(bytes4(_packet[DST_EID_OFFSET:RECEIVER_OFFSET]));
}
function receiver(bytes calldata _packet) internal pure returns (bytes32) {
return bytes32(_packet[RECEIVER_OFFSET:GUID_OFFSET]);
}
function receiverB20(bytes calldata _packet) internal pure returns (address) {
return receiver(_packet).toAddress();
}
function guid(bytes calldata _packet) internal pure returns (bytes32) {
return bytes32(_packet[GUID_OFFSET:MESSAGE_OFFSET]);
}
function message(bytes calldata _packet) internal pure returns (bytes calldata) {
return bytes(_packet[MESSAGE_OFFSET:]);
}
function payload(bytes calldata _packet) internal pure returns (bytes calldata) {
return bytes(_packet[GUID_OFFSET:]);
}
function payloadHash(bytes calldata _packet) internal pure returns (bytes32) {
return keccak256(payload(_packet));
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC173 } from '../../interfaces/IERC173.sol';
import { IOwnableInternal } from './IOwnableInternal.sol';
interface IOwnable is IOwnableInternal, IERC173 {}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC173Internal } from '../../interfaces/IERC173Internal.sol';
interface IOwnableInternal is IERC173Internal {
error Ownable__NotOwner();
error Ownable__NotTransitiveOwner();
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IOwnable } from './IOwnable.sol';
import { ISafeOwnableInternal } from './ISafeOwnableInternal.sol';
interface ISafeOwnable is ISafeOwnableInternal, IOwnable {
/**
* @notice get the nominated owner who has permission to call acceptOwnership
*/
function nomineeOwner() external view returns (address);
/**
* @notice accept transfer of contract ownership
*/
function acceptOwnership() external;
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IOwnableInternal } from './IOwnableInternal.sol';
interface ISafeOwnableInternal is IOwnableInternal {
error SafeOwnable__NotNomineeOwner();
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC173 } from '../../interfaces/IERC173.sol';
import { IOwnable } from './IOwnable.sol';
import { OwnableInternal } from './OwnableInternal.sol';
/**
* @title Ownership access control based on ERC173
*/
abstract contract Ownable is IOwnable, OwnableInternal {
/**
* @inheritdoc IERC173
*/
function owner() public view virtual returns (address) {
return _owner();
}
/**
* @inheritdoc IERC173
*/
function transferOwnership(address account) public virtual onlyOwner {
_transferOwnership(account);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC173 } from '../../interfaces/IERC173.sol';
import { AddressUtils } from '../../utils/AddressUtils.sol';
import { IOwnableInternal } from './IOwnableInternal.sol';
import { OwnableStorage } from './OwnableStorage.sol';
abstract contract OwnableInternal is IOwnableInternal {
using AddressUtils for address;
modifier onlyOwner() {
if (msg.sender != _owner()) revert Ownable__NotOwner();
_;
}
modifier onlyTransitiveOwner() {
if (msg.sender != _transitiveOwner())
revert Ownable__NotTransitiveOwner();
_;
}
function _owner() internal view virtual returns (address) {
return OwnableStorage.layout().owner;
}
function _transitiveOwner() internal view virtual returns (address owner) {
owner = _owner();
while (owner.isContract()) {
try IERC173(owner).owner() returns (address transitiveOwner) {
owner = transitiveOwner;
} catch {
break;
}
}
}
function _transferOwnership(address account) internal virtual {
_setOwner(account);
}
function _setOwner(address account) internal virtual {
OwnableStorage.Layout storage l = OwnableStorage.layout();
emit OwnershipTransferred(l.owner, account);
l.owner = account;
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
library OwnableStorage {
struct Layout {
address owner;
}
bytes32 internal constant STORAGE_SLOT =
keccak256('solidstate.contracts.storage.Ownable');
function layout() internal pure returns (Layout storage l) {
bytes32 slot = STORAGE_SLOT;
assembly {
l.slot := slot
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { Ownable } from './Ownable.sol';
import { ISafeOwnable } from './ISafeOwnable.sol';
import { OwnableInternal } from './OwnableInternal.sol';
import { SafeOwnableInternal } from './SafeOwnableInternal.sol';
/**
* @title Ownership access control based on ERC173 with ownership transfer safety check
*/
abstract contract SafeOwnable is ISafeOwnable, Ownable, SafeOwnableInternal {
/**
* @inheritdoc ISafeOwnable
*/
function nomineeOwner() public view virtual returns (address) {
return _nomineeOwner();
}
/**
* @inheritdoc ISafeOwnable
*/
function acceptOwnership() public virtual onlyNomineeOwner {
_acceptOwnership();
}
function _transferOwnership(
address account
) internal virtual override(OwnableInternal, SafeOwnableInternal) {
super._transferOwnership(account);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { ISafeOwnableInternal } from './ISafeOwnableInternal.sol';
import { OwnableInternal } from './OwnableInternal.sol';
import { SafeOwnableStorage } from './SafeOwnableStorage.sol';
abstract contract SafeOwnableInternal is ISafeOwnableInternal, OwnableInternal {
modifier onlyNomineeOwner() {
if (msg.sender != _nomineeOwner())
revert SafeOwnable__NotNomineeOwner();
_;
}
/**
* @notice get the nominated owner who has permission to call acceptOwnership
*/
function _nomineeOwner() internal view virtual returns (address) {
return SafeOwnableStorage.layout().nomineeOwner;
}
/**
* @notice accept transfer of contract ownership
*/
function _acceptOwnership() internal virtual {
_setOwner(msg.sender);
delete SafeOwnableStorage.layout().nomineeOwner;
}
/**
* @notice grant permission to given address to claim contract ownership
*/
function _transferOwnership(address account) internal virtual override {
_setNomineeOwner(account);
}
/**
* @notice set nominee owner
*/
function _setNomineeOwner(address account) internal virtual {
SafeOwnableStorage.layout().nomineeOwner = account;
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
library SafeOwnableStorage {
struct Layout {
address nomineeOwner;
}
bytes32 internal constant STORAGE_SLOT =
keccak256('solidstate.contracts.storage.SafeOwnable');
function layout() internal pure returns (Layout storage l) {
bytes32 slot = STORAGE_SLOT;
assembly {
l.slot := slot
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
/**
* @title Map implementation with enumeration functions
* @dev derived from https://github.com/OpenZeppelin/openzeppelin-contracts (MIT license)
*/
library EnumerableMap {
error EnumerableMap__IndexOutOfBounds();
error EnumerableMap__NonExistentKey();
struct MapEntry {
bytes32 _key;
bytes32 _value;
}
struct Map {
MapEntry[] _entries;
// 1-indexed to allow 0 to signify nonexistence
mapping(bytes32 => uint256) _indexes;
}
struct AddressToAddressMap {
Map _inner;
}
struct UintToAddressMap {
Map _inner;
}
function at(
AddressToAddressMap storage map,
uint256 index
) internal view returns (address, address) {
(bytes32 key, bytes32 value) = _at(map._inner, index);
return (
address(uint160(uint256(key))),
address(uint160(uint256(value)))
);
}
function at(
UintToAddressMap storage map,
uint256 index
) internal view returns (uint256, address) {
(bytes32 key, bytes32 value) = _at(map._inner, index);
return (uint256(key), address(uint160(uint256(value))));
}
function contains(
AddressToAddressMap storage map,
address key
) internal view returns (bool) {
return _contains(map._inner, bytes32(uint256(uint160(key))));
}
function contains(
UintToAddressMap storage map,
uint256 key
) internal view returns (bool) {
return _contains(map._inner, bytes32(key));
}
function length(
AddressToAddressMap storage map
) internal view returns (uint256) {
return _length(map._inner);
}
function length(
UintToAddressMap storage map
) internal view returns (uint256) {
return _length(map._inner);
}
function get(
AddressToAddressMap storage map,
address key
) internal view returns (address) {
return
address(
uint160(
uint256(_get(map._inner, bytes32(uint256(uint160(key)))))
)
);
}
function get(
UintToAddressMap storage map,
uint256 key
) internal view returns (address) {
return address(uint160(uint256(_get(map._inner, bytes32(key)))));
}
function set(
AddressToAddressMap storage map,
address key,
address value
) internal returns (bool) {
return
_set(
map._inner,
bytes32(uint256(uint160(key))),
bytes32(uint256(uint160(value)))
);
}
function set(
UintToAddressMap storage map,
uint256 key,
address value
) internal returns (bool) {
return _set(map._inner, bytes32(key), bytes32(uint256(uint160(value))));
}
function remove(
AddressToAddressMap storage map,
address key
) internal returns (bool) {
return _remove(map._inner, bytes32(uint256(uint160(key))));
}
function remove(
UintToAddressMap storage map,
uint256 key
) internal returns (bool) {
return _remove(map._inner, bytes32(key));
}
function toArray(
AddressToAddressMap storage map
)
internal
view
returns (address[] memory keysOut, address[] memory valuesOut)
{
uint256 len = map._inner._entries.length;
keysOut = new address[](len);
valuesOut = new address[](len);
unchecked {
for (uint256 i; i < len; ++i) {
keysOut[i] = address(
uint160(uint256(map._inner._entries[i]._key))
);
valuesOut[i] = address(
uint160(uint256(map._inner._entries[i]._value))
);
}
}
}
function toArray(
UintToAddressMap storage map
)
internal
view
returns (uint256[] memory keysOut, address[] memory valuesOut)
{
uint256 len = map._inner._entries.length;
keysOut = new uint256[](len);
valuesOut = new address[](len);
unchecked {
for (uint256 i; i < len; ++i) {
keysOut[i] = uint256(map._inner._entries[i]._key);
valuesOut[i] = address(
uint160(uint256(map._inner._entries[i]._value))
);
}
}
}
function keys(
AddressToAddressMap storage map
) internal view returns (address[] memory keysOut) {
uint256 len = map._inner._entries.length;
keysOut = new address[](len);
unchecked {
for (uint256 i; i < len; ++i) {
keysOut[i] = address(
uint160(uint256(map._inner._entries[i]._key))
);
}
}
}
function keys(
UintToAddressMap storage map
) internal view returns (uint256[] memory keysOut) {
uint256 len = map._inner._entries.length;
keysOut = new uint256[](len);
unchecked {
for (uint256 i; i < len; ++i) {
keysOut[i] = uint256(map._inner._entries[i]._key);
}
}
}
function values(
AddressToAddressMap storage map
) internal view returns (address[] memory valuesOut) {
uint256 len = map._inner._entries.length;
valuesOut = new address[](len);
unchecked {
for (uint256 i; i < len; ++i) {
valuesOut[i] = address(
uint160(uint256(map._inner._entries[i]._value))
);
}
}
}
function values(
UintToAddressMap storage map
) internal view returns (address[] memory valuesOut) {
uint256 len = map._inner._entries.length;
valuesOut = new address[](len);
unchecked {
for (uint256 i; i < len; ++i) {
valuesOut[i] = address(
uint160(uint256(map._inner._entries[i]._value))
);
}
}
}
function _at(
Map storage map,
uint256 index
) private view returns (bytes32, bytes32) {
if (index >= map._entries.length)
revert EnumerableMap__IndexOutOfBounds();
MapEntry storage entry = map._entries[index];
return (entry._key, entry._value);
}
function _contains(
Map storage map,
bytes32 key
) private view returns (bool) {
return map._indexes[key] != 0;
}
function _length(Map storage map) private view returns (uint256) {
return map._entries.length;
}
function _get(Map storage map, bytes32 key) private view returns (bytes32) {
uint256 keyIndex = map._indexes[key];
if (keyIndex == 0) revert EnumerableMap__NonExistentKey();
unchecked {
return map._entries[keyIndex - 1]._value;
}
}
function _set(
Map storage map,
bytes32 key,
bytes32 value
) private returns (bool) {
uint256 keyIndex = map._indexes[key];
if (keyIndex == 0) {
map._entries.push(MapEntry({ _key: key, _value: value }));
map._indexes[key] = map._entries.length;
return true;
} else {
unchecked {
map._entries[keyIndex - 1]._value = value;
}
return false;
}
}
function _remove(Map storage map, bytes32 key) private returns (bool) {
uint256 keyIndex = map._indexes[key];
if (keyIndex != 0) {
unchecked {
MapEntry storage last = map._entries[map._entries.length - 1];
// move last entry to now-vacant index
map._entries[keyIndex - 1] = last;
map._indexes[last._key] = keyIndex;
}
// clear last index
map._entries.pop();
delete map._indexes[key];
return true;
} else {
return false;
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
/**
* @title Set implementation with enumeration functions
* @dev derived from https://github.com/OpenZeppelin/openzeppelin-contracts (MIT license)
*/
library EnumerableSet {
error EnumerableSet__IndexOutOfBounds();
struct Set {
bytes32[] _values;
// 1-indexed to allow 0 to signify nonexistence
mapping(bytes32 => uint256) _indexes;
}
struct Bytes32Set {
Set _inner;
}
struct AddressSet {
Set _inner;
}
struct UintSet {
Set _inner;
}
function at(
Bytes32Set storage set,
uint256 index
) internal view returns (bytes32) {
return _at(set._inner, index);
}
function at(
AddressSet storage set,
uint256 index
) internal view returns (address) {
return address(uint160(uint256(_at(set._inner, index))));
}
function at(
UintSet storage set,
uint256 index
) internal view returns (uint256) {
return uint256(_at(set._inner, index));
}
function contains(
Bytes32Set storage set,
bytes32 value
) internal view returns (bool) {
return _contains(set._inner, value);
}
function contains(
AddressSet storage set,
address value
) internal view returns (bool) {
return _contains(set._inner, bytes32(uint256(uint160(value))));
}
function contains(
UintSet storage set,
uint256 value
) internal view returns (bool) {
return _contains(set._inner, bytes32(value));
}
function indexOf(
Bytes32Set storage set,
bytes32 value
) internal view returns (uint256) {
return _indexOf(set._inner, value);
}
function indexOf(
AddressSet storage set,
address value
) internal view returns (uint256) {
return _indexOf(set._inner, bytes32(uint256(uint160(value))));
}
function indexOf(
UintSet storage set,
uint256 value
) internal view returns (uint256) {
return _indexOf(set._inner, bytes32(value));
}
function length(Bytes32Set storage set) internal view returns (uint256) {
return _length(set._inner);
}
function length(AddressSet storage set) internal view returns (uint256) {
return _length(set._inner);
}
function length(UintSet storage set) internal view returns (uint256) {
return _length(set._inner);
}
function add(
Bytes32Set storage set,
bytes32 value
) internal returns (bool) {
return _add(set._inner, value);
}
function add(
AddressSet storage set,
address value
) internal returns (bool) {
return _add(set._inner, bytes32(uint256(uint160(value))));
}
function add(UintSet storage set, uint256 value) internal returns (bool) {
return _add(set._inner, bytes32(value));
}
function remove(
Bytes32Set storage set,
bytes32 value
) internal returns (bool) {
return _remove(set._inner, value);
}
function remove(
AddressSet storage set,
address value
) internal returns (bool) {
return _remove(set._inner, bytes32(uint256(uint160(value))));
}
function remove(
UintSet storage set,
uint256 value
) internal returns (bool) {
return _remove(set._inner, bytes32(value));
}
function toArray(
Bytes32Set storage set
) internal view returns (bytes32[] memory) {
return set._inner._values;
}
function toArray(
AddressSet storage set
) internal view returns (address[] memory) {
bytes32[] storage values = set._inner._values;
address[] storage array;
assembly {
array.slot := values.slot
}
return array;
}
function toArray(
UintSet storage set
) internal view returns (uint256[] memory) {
bytes32[] storage values = set._inner._values;
uint256[] storage array;
assembly {
array.slot := values.slot
}
return array;
}
function _at(
Set storage set,
uint256 index
) private view returns (bytes32) {
if (index >= set._values.length)
revert EnumerableSet__IndexOutOfBounds();
return set._values[index];
}
function _contains(
Set storage set,
bytes32 value
) private view returns (bool) {
return set._indexes[value] != 0;
}
function _indexOf(
Set storage set,
bytes32 value
) private view returns (uint256) {
unchecked {
return set._indexes[value] - 1;
}
}
function _length(Set storage set) private view returns (uint256) {
return set._values.length;
}
function _add(
Set storage set,
bytes32 value
) private returns (bool status) {
if (!_contains(set, value)) {
set._values.push(value);
set._indexes[value] = set._values.length;
status = true;
}
}
function _remove(
Set storage set,
bytes32 value
) private returns (bool status) {
uint256 valueIndex = set._indexes[value];
if (valueIndex != 0) {
unchecked {
bytes32 last = set._values[set._values.length - 1];
// move last value to now-vacant index
set._values[valueIndex - 1] = last;
set._indexes[last] = valueIndex;
}
// clear last index
set._values.pop();
delete set._indexes[value];
status = true;
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC165Internal } from './IERC165Internal.sol';
/**
* @title ERC165 interface registration interface
* @dev see https://eips.ethereum.org/EIPS/eip-165
*/
interface IERC165 is IERC165Internal {
/**
* @notice query whether contract has registered support for given interface
* @param interfaceId interface id
* @return bool whether interface is supported
*/
function supportsInterface(bytes4 interfaceId) external view returns (bool);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
/**
* @title ERC165 interface registration interface
*/
interface IERC165Internal {}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC173Internal } from './IERC173Internal.sol';
/**
* @title Contract ownership standard interface
* @dev see https://eips.ethereum.org/EIPS/eip-173
*/
interface IERC173 is IERC173Internal {
/**
* @notice get the ERC173 contract owner
* @return contract owner
*/
function owner() external view returns (address);
/**
* @notice transfer contract ownership to new account
* @param account address of new owner
*/
function transferOwnership(address account) external;
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
/**
* @title Partial ERC173 interface needed by internal functions
*/
interface IERC173Internal {
event OwnershipTransferred(
address indexed previousOwner,
address indexed newOwner
);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC2535DiamondCutInternal } from './IERC2535DiamondCutInternal.sol';
/**
* @title ERC2535 write interface
* @dev see https://eips.ethereum.org/EIPS/eip-2535
*/
interface IERC2535DiamondCut is IERC2535DiamondCutInternal {
/**
* @notice update diamond facets and optionally execute arbitrary initialization function
* @param facetCuts array of structured Diamond facet update data
* @param target optional target of initialization delegatecall
* @param data optional initialization function call data
*/
function diamondCut(
FacetCut[] calldata facetCuts,
address target,
bytes calldata data
) external;
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
/**
* @title ERC2535 write interface for internal functions
* @dev see https://eips.ethereum.org/EIPS/eip-2535
*/
interface IERC2535DiamondCutInternal {
enum FacetCutAction {
ADD,
REPLACE,
REMOVE
}
struct FacetCut {
address target;
FacetCutAction action;
bytes4[] selectors;
}
event DiamondCut(FacetCut[] facetCuts, address target, bytes data);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC2535DiamondLoupeInternal } from './IERC2535DiamondLoupeInternal.sol';
/**
* @title ERC2535 read interface
* @dev see https://eips.ethereum.org/EIPS/eip-2535
*/
interface IERC2535DiamondLoupe is IERC2535DiamondLoupeInternal {
/**
* @notice get all facets and their selectors
* @return diamondFacets array of structured facet data
*/
function facets() external view returns (Facet[] memory diamondFacets);
/**
* @notice get all selectors for given facet address
* @param facet address of facet to query
* @return selectors array of function selectors
*/
function facetFunctionSelectors(
address facet
) external view returns (bytes4[] memory selectors);
/**
* @notice get addresses of all facets used by diamond
* @return addresses array of facet addresses
*/
function facetAddresses()
external
view
returns (address[] memory addresses);
/**
* @notice get the address of the facet associated with given selector
* @param selector function selector to query
* @return facet facet address (zero address if not found)
*/
function facetAddress(
bytes4 selector
) external view returns (address facet);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
/**
* @title ERC2535 read interface for internal functions
* @dev see https://eips.ethereum.org/EIPS/eip-2535
*/
interface IERC2535DiamondLoupeInternal {
struct Facet {
address target;
bytes4[] selectors;
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC165 } from './IERC165.sol';
import { IERC721Internal } from './IERC721Internal.sol';
/**
* @title ERC721 interface
* @dev see https://eips.ethereum.org/EIPS/eip-721
*/
interface IERC721 is IERC721Internal, IERC165 {
/**
* @notice query the balance of given address
* @return balance quantity of tokens held
*/
function balanceOf(address account) external view returns (uint256 balance);
/**
* @notice query the owner of given token
* @param tokenId token to query
* @return owner token owner
*/
function ownerOf(uint256 tokenId) external view returns (address owner);
/**
* @notice transfer token between given addresses, checking for ERC721Receiver implementation if applicable
* @param from sender of token
* @param to receiver of token
* @param tokenId token id
*/
function safeTransferFrom(
address from,
address to,
uint256 tokenId
) external payable;
/**
* @notice transfer token between given addresses, checking for ERC721Receiver implementation if applicable
* @param from sender of token
* @param to receiver of token
* @param tokenId token id
* @param data data payload
*/
function safeTransferFrom(
address from,
address to,
uint256 tokenId,
bytes calldata data
) external payable;
/**
* @notice transfer token between given addresses, without checking for ERC721Receiver implementation if applicable
* @param from sender of token
* @param to receiver of token
* @param tokenId token id
*/
function transferFrom(
address from,
address to,
uint256 tokenId
) external payable;
/**
* @notice grant approval to given account to spend token
* @param operator address to be approved
* @param tokenId token to approve
*/
function approve(address operator, uint256 tokenId) external payable;
/**
* @notice get approval status for given token
* @param tokenId token to query
* @return operator address approved to spend token
*/
function getApproved(
uint256 tokenId
) external view returns (address operator);
/**
* @notice grant approval to or revoke approval from given account to spend all tokens held by sender
* @param operator address to be approved
* @param status approval status
*/
function setApprovalForAll(address operator, bool status) external;
/**
* @notice query approval status of given operator with respect to given address
* @param account address to query for approval granted
* @param operator address to query for approval received
* @return status whether operator is approved to spend tokens held by account
*/
function isApprovedForAll(
address account,
address operator
) external view returns (bool status);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
/**
* @title Partial ERC721 interface needed by internal functions
*/
interface IERC721Internal {
event Transfer(
address indexed from,
address indexed to,
uint256 indexed tokenId
);
event Approval(
address indexed owner,
address indexed operator,
uint256 indexed tokenId
);
event ApprovalForAll(
address indexed owner,
address indexed operator,
bool approved
);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
interface IERC721Receiver {
function onERC721Received(
address operator,
address from,
uint256 tokenId,
bytes calldata data
) external returns (bytes4);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC165 } from '../../../interfaces/IERC165.sol';
import { IERC165Base } from './IERC165Base.sol';
import { ERC165BaseInternal } from './ERC165BaseInternal.sol';
import { ERC165BaseStorage } from './ERC165BaseStorage.sol';
/**
* @title ERC165 implementation
*/
abstract contract ERC165Base is IERC165Base, ERC165BaseInternal {
/**
* @inheritdoc IERC165
*/
function supportsInterface(bytes4 interfaceId) public view returns (bool) {
return _supportsInterface(interfaceId);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC165BaseInternal } from './IERC165BaseInternal.sol';
import { ERC165BaseStorage } from './ERC165BaseStorage.sol';
/**
* @title ERC165 implementation
*/
abstract contract ERC165BaseInternal is IERC165BaseInternal {
/**
* @notice indicates whether an interface is already supported based on the interfaceId
* @param interfaceId id of interface to check
* @return bool indicating whether interface is supported
*/
function _supportsInterface(
bytes4 interfaceId
) internal view virtual returns (bool) {
return ERC165BaseStorage.layout().supportedInterfaces[interfaceId];
}
/**
* @notice sets status of interface support
* @param interfaceId id of interface to set status for
* @param status boolean indicating whether interface will be set as supported
*/
function _setSupportsInterface(
bytes4 interfaceId,
bool status
) internal virtual {
if (interfaceId == 0xffffffff) revert ERC165Base__InvalidInterfaceId();
ERC165BaseStorage.layout().supportedInterfaces[interfaceId] = status;
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
library ERC165BaseStorage {
struct Layout {
mapping(bytes4 => bool) supportedInterfaces;
}
bytes32 internal constant STORAGE_SLOT =
keccak256('solidstate.contracts.storage.ERC165Base');
function layout() internal pure returns (Layout storage l) {
bytes32 slot = STORAGE_SLOT;
assembly {
l.slot := slot
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC165 } from '../../../interfaces/IERC165.sol';
import { IERC165BaseInternal } from './IERC165BaseInternal.sol';
interface IERC165Base is IERC165, IERC165BaseInternal {}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC165Internal } from '../../../interfaces/IERC165Internal.sol';
interface IERC165BaseInternal is IERC165Internal {
error ERC165Base__InvalidInterfaceId();
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { Proxy } from '../../Proxy.sol';
import { IDiamondBase } from './IDiamondBase.sol';
import { DiamondBaseStorage } from './DiamondBaseStorage.sol';
/**
* @title EIP-2535 "Diamond" proxy base contract
* @dev see https://eips.ethereum.org/EIPS/eip-2535
* @dev note that for EIP-2535 compliance this base contract must also include the DiamondReadable functions (either within the same deployment or by proxy)
*/
abstract contract DiamondBase is IDiamondBase, Proxy {
/**
* @inheritdoc Proxy
*/
function _getImplementation()
internal
view
virtual
override
returns (address implementation)
{
// inline storage layout retrieval uses less gas
DiamondBaseStorage.Layout storage l;
bytes32 slot = DiamondBaseStorage.STORAGE_SLOT;
assembly {
l.slot := slot
}
implementation = address(bytes20(l.selectorInfo[msg.sig]));
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
/**
* @dev derived from https://github.com/mudgen/diamond-2 (MIT license)
*/
library DiamondBaseStorage {
struct Layout {
// function selector => (facet address, selector slug position)
mapping(bytes4 => bytes32) selectorInfo;
// total number of selectors registered
uint16 selectorCount;
// array of 32-byte slugs with 8 selectors each
mapping(uint256 => bytes32) selectorSlugs;
address fallbackAddress;
}
bytes32 internal constant STORAGE_SLOT =
keccak256('solidstate.contracts.storage.DiamondBase');
function layout() internal pure returns (Layout storage l) {
bytes32 slot = STORAGE_SLOT;
assembly {
l.slot := slot
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IProxy } from '../../IProxy.sol';
interface IDiamondBase is IProxy {}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { OwnableInternal } from '../../../access/ownable/OwnableInternal.sol';
import { DiamondBase } from '../base/DiamondBase.sol';
import { DiamondBaseStorage } from '../base/DiamondBaseStorage.sol';
import { IDiamondFallback } from './IDiamondFallback.sol';
/**
* @title Fallback feature for EIP-2535 "Diamond" proxy
*/
abstract contract DiamondFallback is
IDiamondFallback,
OwnableInternal,
DiamondBase
{
/**
* @inheritdoc IDiamondFallback
*/
function getFallbackAddress()
external
view
returns (address fallbackAddress)
{
fallbackAddress = _getFallbackAddress();
}
/**
* @inheritdoc IDiamondFallback
*/
function setFallbackAddress(address fallbackAddress) external onlyOwner {
_setFallbackAddress(fallbackAddress);
}
/**
* @inheritdoc DiamondBase
* @notice query custom fallback address is no implementation is found
*/
function _getImplementation()
internal
view
virtual
override
returns (address implementation)
{
implementation = super._getImplementation();
if (implementation == address(0)) {
implementation = _getFallbackAddress();
}
}
/**
* @notice query the address of the fallback implementation
* @return fallbackAddress address of fallback implementation
*/
function _getFallbackAddress()
internal
view
virtual
returns (address fallbackAddress)
{
fallbackAddress = DiamondBaseStorage.layout().fallbackAddress;
}
/**
* @notice set the address of the fallback implementation
* @param fallbackAddress address of fallback implementation
*/
function _setFallbackAddress(address fallbackAddress) internal virtual {
DiamondBaseStorage.layout().fallbackAddress = fallbackAddress;
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IDiamondBase } from '../base/IDiamondBase.sol';
interface IDiamondFallback is IDiamondBase {
/**
* @notice query the address of the fallback implementation
* @return fallbackAddress address of fallback implementation
*/
function getFallbackAddress()
external
view
returns (address fallbackAddress);
/**
* @notice set the address of the fallback implementation
* @param fallbackAddress address of fallback implementation
*/
function setFallbackAddress(address fallbackAddress) external;
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { ISafeOwnable } from '../../access/ownable/ISafeOwnable.sol';
import { IERC165 } from '../../interfaces/IERC165.sol';
import { IDiamondBase } from './base/IDiamondBase.sol';
import { IDiamondFallback } from './fallback/IDiamondFallback.sol';
import { IDiamondReadable } from './readable/IDiamondReadable.sol';
import { IDiamondWritable } from './writable/IDiamondWritable.sol';
interface ISolidStateDiamond is
IDiamondBase,
IDiamondFallback,
IDiamondReadable,
IDiamondWritable,
ISafeOwnable,
IERC165
{
receive() external payable;
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC2535DiamondLoupe } from '../../../interfaces/IERC2535DiamondLoupe.sol';
import { DiamondBaseStorage } from '../base/DiamondBaseStorage.sol';
import { IDiamondReadable } from './IDiamondReadable.sol';
import { DiamondReadableInternal } from './DiamondReadableInternal.sol';
/**
* @title EIP-2535 "Diamond" proxy introspection contract
* @dev derived from https://github.com/mudgen/diamond-2 (MIT license)
*/
abstract contract DiamondReadable is IDiamondReadable, DiamondReadableInternal {
/**
* @inheritdoc IERC2535DiamondLoupe
*/
function facets() external view returns (Facet[] memory diamondFacets) {
diamondFacets = _facets();
}
/**
* @inheritdoc IERC2535DiamondLoupe
*/
function facetFunctionSelectors(
address facet
) external view returns (bytes4[] memory selectors) {
selectors = _facetFunctionSelectors(facet);
}
/**
* @inheritdoc IERC2535DiamondLoupe
*/
function facetAddresses()
external
view
returns (address[] memory addresses)
{
addresses = _facetAddresses();
}
/**
* @inheritdoc IERC2535DiamondLoupe
*/
function facetAddress(
bytes4 selector
) external view returns (address facet) {
facet = _facetAddress(selector);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { DiamondBaseStorage } from '../base/DiamondBaseStorage.sol';
import { IDiamondReadableInternal } from './IDiamondReadableInternal.sol';
/**
* @title EIP-2535 "Diamond" proxy introspection contract internal functions
* @dev derived from https://github.com/mudgen/diamond-2 (MIT license)
*/
abstract contract DiamondReadableInternal is IDiamondReadableInternal {
/**
* @notice get all facets and their selectors
* @return diamondFacets array of structured facet data
*/
function _facets() internal view returns (Facet[] memory diamondFacets) {
DiamondBaseStorage.Layout storage l = DiamondBaseStorage.layout();
diamondFacets = new Facet[](l.selectorCount);
uint8[] memory numFacetSelectors = new uint8[](l.selectorCount);
uint256 numFacets;
uint256 selectorIndex;
// loop through function selectors
for (uint256 slugIndex; selectorIndex < l.selectorCount; slugIndex++) {
bytes32 slug = l.selectorSlugs[slugIndex];
for (
uint256 slugSelectorIndex;
slugSelectorIndex < 8;
slugSelectorIndex++
) {
selectorIndex++;
if (selectorIndex > l.selectorCount) {
break;
}
bytes4 selector = bytes4(slug << (slugSelectorIndex << 5));
address facet = address(bytes20(l.selectorInfo[selector]));
bool continueLoop;
for (uint256 facetIndex; facetIndex < numFacets; facetIndex++) {
if (diamondFacets[facetIndex].target == facet) {
diamondFacets[facetIndex].selectors[
numFacetSelectors[facetIndex]
] = selector;
// probably will never have more than 256 functions from one facet contract
require(numFacetSelectors[facetIndex] < 255);
numFacetSelectors[facetIndex]++;
continueLoop = true;
break;
}
}
if (continueLoop) {
continue;
}
diamondFacets[numFacets].target = facet;
diamondFacets[numFacets].selectors = new bytes4[](
l.selectorCount
);
diamondFacets[numFacets].selectors[0] = selector;
numFacetSelectors[numFacets] = 1;
numFacets++;
}
}
for (uint256 facetIndex; facetIndex < numFacets; facetIndex++) {
uint256 numSelectors = numFacetSelectors[facetIndex];
bytes4[] memory selectors = diamondFacets[facetIndex].selectors;
// setting the number of selectors
assembly {
mstore(selectors, numSelectors)
}
}
// setting the number of facets
assembly {
mstore(diamondFacets, numFacets)
}
}
/**
* @notice get all selectors for given facet address
* @param facet address of facet to query
* @return selectors array of function selectors
*/
function _facetFunctionSelectors(
address facet
) internal view returns (bytes4[] memory selectors) {
DiamondBaseStorage.Layout storage l = DiamondBaseStorage.layout();
// initialize array with maximum possible required length
// it will be truncated to correct length via assembly later
selectors = new bytes4[](l.selectorCount);
uint256 numSelectors;
uint256 selectorIndex;
// loop through function selectors
for (uint256 slugIndex; selectorIndex < l.selectorCount; slugIndex++) {
bytes32 slug = l.selectorSlugs[slugIndex];
for (
uint256 slugSelectorIndex;
slugSelectorIndex < 8;
slugSelectorIndex++
) {
selectorIndex++;
if (selectorIndex > l.selectorCount) {
break;
}
bytes4 selector = bytes4(slug << (slugSelectorIndex << 5));
if (facet == address(bytes20(l.selectorInfo[selector]))) {
selectors[numSelectors] = selector;
numSelectors++;
}
}
}
// set the number of selectors in the array
assembly {
mstore(selectors, numSelectors)
}
}
/**
* @notice get addresses of all facets used by diamond
* @return addresses array of facet addresses
*/
function _facetAddresses()
internal
view
returns (address[] memory addresses)
{
DiamondBaseStorage.Layout storage l = DiamondBaseStorage.layout();
addresses = new address[](l.selectorCount);
uint256 numFacets;
uint256 selectorIndex;
for (uint256 slugIndex; selectorIndex < l.selectorCount; slugIndex++) {
bytes32 slug = l.selectorSlugs[slugIndex];
for (
uint256 slugSelectorIndex;
slugSelectorIndex < 8;
slugSelectorIndex++
) {
selectorIndex++;
if (selectorIndex > l.selectorCount) {
break;
}
bytes4 selector = bytes4(slug << (slugSelectorIndex << 5));
address facet = address(bytes20(l.selectorInfo[selector]));
bool continueLoop;
for (uint256 facetIndex; facetIndex < numFacets; facetIndex++) {
if (facet == addresses[facetIndex]) {
continueLoop = true;
break;
}
}
if (continueLoop) {
continue;
}
addresses[numFacets] = facet;
numFacets++;
}
}
// set the number of facet addresses in the array
assembly {
mstore(addresses, numFacets)
}
}
/**
* @notice get the address of the facet associated with given selector
* @param selector function selector to query
* @return facet facet address (zero address if not found)
*/
function _facetAddress(
bytes4 selector
) internal view returns (address facet) {
facet = address(
bytes20(DiamondBaseStorage.layout().selectorInfo[selector])
);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC2535DiamondLoupe } from '../../../interfaces/IERC2535DiamondLoupe.sol';
import { IDiamondReadableInternal } from './IDiamondReadableInternal.sol';
/**
* @title Diamond proxy introspection interface
* @dev see https://eips.ethereum.org/EIPS/eip-2535
*/
interface IDiamondReadable is IERC2535DiamondLoupe, IDiamondReadableInternal {}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC2535DiamondLoupeInternal } from '../../../interfaces/IERC2535DiamondLoupeInternal.sol';
/**
* @title Diamond proxy introspection interface needed for internal functions
* @dev see https://eips.ethereum.org/EIPS/eip-2535
*/
interface IDiamondReadableInternal is IERC2535DiamondLoupeInternal {}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IOwnable, Ownable, OwnableInternal } from '../../access/ownable/Ownable.sol';
import { ISafeOwnable, SafeOwnable } from '../../access/ownable/SafeOwnable.sol';
import { IERC165 } from '../../interfaces/IERC165.sol';
import { IERC173 } from '../../interfaces/IERC173.sol';
import { IERC2535DiamondCut } from '../../interfaces/IERC2535DiamondCut.sol';
import { IERC2535DiamondLoupe } from '../../interfaces/IERC2535DiamondLoupe.sol';
import { ERC165Base, ERC165BaseStorage } from '../../introspection/ERC165/base/ERC165Base.sol';
import { DiamondBase } from './base/DiamondBase.sol';
import { DiamondFallback, IDiamondFallback } from './fallback/DiamondFallback.sol';
import { DiamondReadable } from './readable/DiamondReadable.sol';
import { DiamondWritable } from './writable/DiamondWritable.sol';
import { ISolidStateDiamond } from './ISolidStateDiamond.sol';
/**
* @title SolidState "Diamond" proxy reference implementation
*/
abstract contract SolidStateDiamond is
ISolidStateDiamond,
DiamondBase,
DiamondFallback,
DiamondReadable,
DiamondWritable,
SafeOwnable,
ERC165Base
{
constructor() {
bytes4[] memory selectors = new bytes4[](12);
uint256 selectorIndex;
// register DiamondFallback
selectors[selectorIndex++] = IDiamondFallback
.getFallbackAddress
.selector;
selectors[selectorIndex++] = IDiamondFallback
.setFallbackAddress
.selector;
_setSupportsInterface(type(IDiamondFallback).interfaceId, true);
// register DiamondWritable
selectors[selectorIndex++] = IERC2535DiamondCut.diamondCut.selector;
_setSupportsInterface(type(IERC2535DiamondCut).interfaceId, true);
// register DiamondReadable
selectors[selectorIndex++] = IERC2535DiamondLoupe.facets.selector;
selectors[selectorIndex++] = IERC2535DiamondLoupe
.facetFunctionSelectors
.selector;
selectors[selectorIndex++] = IERC2535DiamondLoupe
.facetAddresses
.selector;
selectors[selectorIndex++] = IERC2535DiamondLoupe.facetAddress.selector;
_setSupportsInterface(type(IERC2535DiamondLoupe).interfaceId, true);
// register ERC165
selectors[selectorIndex++] = IERC165.supportsInterface.selector;
_setSupportsInterface(type(IERC165).interfaceId, true);
// register SafeOwnable
selectors[selectorIndex++] = Ownable.owner.selector;
selectors[selectorIndex++] = SafeOwnable.nomineeOwner.selector;
selectors[selectorIndex++] = Ownable.transferOwnership.selector;
selectors[selectorIndex++] = SafeOwnable.acceptOwnership.selector;
_setSupportsInterface(type(IERC173).interfaceId, true);
// diamond cut
FacetCut[] memory facetCuts = new FacetCut[](1);
facetCuts[0] = FacetCut({
target: address(this),
action: FacetCutAction.ADD,
selectors: selectors
});
_diamondCut(facetCuts, address(0), '');
// set owner
_setOwner(msg.sender);
}
receive() external payable {}
function _transferOwnership(
address account
) internal virtual override(OwnableInternal, SafeOwnable) {
super._transferOwnership(account);
}
/**
* @inheritdoc DiamondFallback
*/
function _getImplementation()
internal
view
override(DiamondBase, DiamondFallback)
returns (address implementation)
{
implementation = super._getImplementation();
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC2535DiamondCut } from '../../../interfaces/IERC2535DiamondCut.sol';
import { OwnableInternal } from '../../../access/ownable/OwnableInternal.sol';
import { IDiamondWritable } from './IDiamondWritable.sol';
import { DiamondWritableInternal } from './DiamondWritableInternal.sol';
/**
* @title EIP-2535 "Diamond" proxy update contract
*/
abstract contract DiamondWritable is
IDiamondWritable,
DiamondWritableInternal,
OwnableInternal
{
/**
* @inheritdoc IERC2535DiamondCut
*/
function diamondCut(
FacetCut[] calldata facetCuts,
address target,
bytes calldata data
) external onlyOwner {
_diamondCut(facetCuts, target, data);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { AddressUtils } from '../../../utils/AddressUtils.sol';
import { DiamondBaseStorage } from '../base/DiamondBaseStorage.sol';
import { IDiamondWritableInternal } from './IDiamondWritableInternal.sol';
abstract contract DiamondWritableInternal is IDiamondWritableInternal {
using AddressUtils for address;
bytes32 private constant CLEAR_ADDRESS_MASK =
bytes32(uint256(0xffffffffffffffffffffffff));
bytes32 private constant CLEAR_SELECTOR_MASK =
bytes32(uint256(0xffffffff << 224));
/**
* @notice update functions callable on Diamond proxy
* @param facetCuts array of structured Diamond facet update data
* @param target optional recipient of initialization delegatecall
* @param data optional initialization call data
*/
function _diamondCut(
FacetCut[] memory facetCuts,
address target,
bytes memory data
) internal virtual {
DiamondBaseStorage.Layout storage l = DiamondBaseStorage.layout();
unchecked {
// record selector count at start of operation for later comparison
uint256 originalSelectorCount = l.selectorCount;
// maintain an up-to-date selector count in the stack
uint256 selectorCount = originalSelectorCount;
// declare a 32-byte sequence of up to 8 function selectors
bytes32 slug;
// if selector count is not a multiple of 8, load the last slug because it is not full
// else leave the default zero-bytes value as is, and use it as a new slug
if (selectorCount & 7 != 0) {
slug = l.selectorSlugs[selectorCount >> 3];
}
// process each facet cut struct according to its action
// selector count and slug are passed in and read back out to avoid redundant storage access
for (uint256 i; i < facetCuts.length; i++) {
FacetCut memory facetCut = facetCuts[i];
FacetCutAction action = facetCut.action;
if (facetCut.selectors.length == 0)
revert DiamondWritable__SelectorNotSpecified();
if (action == FacetCutAction.ADD) {
(selectorCount, slug) = _addFacetSelectors(
l,
facetCut,
selectorCount,
slug
);
} else if (action == FacetCutAction.REPLACE) {
_replaceFacetSelectors(l, facetCut);
} else if (action == FacetCutAction.REMOVE) {
(selectorCount, slug) = _removeFacetSelectors(
l,
facetCut,
selectorCount,
slug
);
}
}
// if selector count has changed, update it in storage
if (selectorCount != originalSelectorCount) {
l.selectorCount = uint16(selectorCount);
}
// if final selector count is not a multiple of 8, write the slug to storage
// else it was already written to storage by the add/remove loops
if (selectorCount & 7 != 0) {
l.selectorSlugs[selectorCount >> 3] = slug;
}
// event must be emitted before initializer is called, in case initializer triggers further diamond cuts
emit DiamondCut(facetCuts, target, data);
_initialize(target, data);
}
}
/**
* @notice add to the diamond a set of selectors associated with a particular facet
* @dev selectors are added one-by-one to lastSlug, which is written to storage and updated to represent the subsequent slug when full
* @dev lastSlug may be initialized with "dirty" higher-index bits, but these are ignored because they are out of range
* @dev selectorCount and lastSlug are modified in place and returned to avoid reundant storage access
* @param l storage pointer to the DiamondBaseStorage Layout struct
* @param facetCut structured data representing facet address and selectors to add
* @param selectorCount total number of selectors registered on the diamond proxy
* @param lastSlug the last entry in the selectorSlugs mapping, cached in stack and updated in place
* @return selectorCount after selectors have been added
* @return lastSlug after selectors have been added
*/
function _addFacetSelectors(
DiamondBaseStorage.Layout storage l,
FacetCut memory facetCut,
uint256 selectorCount,
bytes32 lastSlug
) internal returns (uint256, bytes32) {
unchecked {
if (facetCut.target.isContract()) {
if (facetCut.target == address(this)) {
revert DiamondWritable__SelectorIsImmutable();
}
} else if (facetCut.target != address(this)) {
revert DiamondWritable__TargetHasNoCode();
}
for (uint256 i; i < facetCut.selectors.length; i++) {
bytes4 selector = facetCut.selectors[i];
if (l.selectorInfo[selector] != bytes32(0))
revert DiamondWritable__SelectorAlreadyAdded();
// for current selector, write facet address and global index to storage
l.selectorInfo[selector] =
bytes32(selectorCount) |
bytes20(facetCut.target);
// calculate bit position of current selector within 256-bit slug
uint256 selectorBitIndexInSlug = (selectorCount & 7) << 5;
// clear a space in the slug and insert the current selector
lastSlug = _insertSelectorIntoSlug(
lastSlug,
selector,
selectorBitIndexInSlug
);
if (selectorBitIndexInSlug == 224) {
// slug is now full, so write it to storage
l.selectorSlugs[selectorCount >> 3] = lastSlug;
}
selectorCount++;
}
return (selectorCount, lastSlug);
}
}
/**
* @notice remove from the diamond a set of selectors associated with a particular facet
* @dev selectors are removed one-by-one from lastSlug, which is updated to represent the preceeding slug when empty
* @dev lastSlug is not updated in storage when modified or removed, leaving "dirty" higher-index bits, but these are ignored because they are out of range
* @dev selectorCount and lastSlug are modified in place and returned to avoid reundant storage access
* @param l storage pointer to the DiamondBaseStorage Layout struct
* @param facetCut structured data representing facet address and selectors to remove
* @param selectorCount total number of selectors registered on the diamond proxy
* @param lastSlug the last entry in the selectorSlugs mapping, cached in stack and updated in place
* @return selectorCount after selectors have been removed
* @return lastSlug after selectors have been removed
*/
function _removeFacetSelectors(
DiamondBaseStorage.Layout storage l,
FacetCut memory facetCut,
uint256 selectorCount,
bytes32 lastSlug
) internal returns (uint256, bytes32) {
unchecked {
if (facetCut.target != address(0))
revert DiamondWritable__RemoveTargetNotZeroAddress();
for (uint256 i; i < facetCut.selectors.length; i++) {
// selectorCount is used to derive the index of the last selector, so decrement it before each loop
selectorCount--;
bytes4 selector = facetCut.selectors[i];
// lookup the selector's facet route and lookup index, then delete it from storage
bytes32 selectorInfo = l.selectorInfo[selector];
delete l.selectorInfo[selector];
if (address(bytes20(selectorInfo)) == address(0))
revert DiamondWritable__SelectorNotFound();
if (address(bytes20(selectorInfo)) == address(this))
revert DiamondWritable__SelectorIsImmutable();
if (selectorCount & 7 == 7) {
// the last selector is located at the end of the last slug, which has not been loaded yet
lastSlug = l.selectorSlugs[selectorCount >> 3];
}
// extract the last selector from the last slug
// it will be used to overwrite the selector being removed
bytes4 lastSelector = bytes4(
lastSlug << ((selectorCount & 7) << 5)
);
if (lastSelector != selector) {
// update last selector's index to match removed selector's index, where last selector is being moved
l.selectorInfo[lastSelector] =
(selectorInfo & CLEAR_ADDRESS_MASK) |
bytes20(l.selectorInfo[lastSelector]);
}
// derive the index of the slug where the selector is stored
uint256 slugIndex = uint16(uint256(selectorInfo)) >> 3;
// derive the position of the selector within its slug
uint256 selectorBitIndexInSlug = (uint16(
uint256(selectorInfo)
) & 7) << 5;
// overwrite the selector being deleted with the last selector in the array
if (slugIndex == selectorCount >> 3) {
// selector being removed is from the last slug, which has already been loaded to the stack
// slug needs not be written to storage yet because it is being tracked on the stack and will be written later
lastSlug = _insertSelectorIntoSlug(
lastSlug,
lastSelector,
selectorBitIndexInSlug
);
} else {
// selector being removed is from a slug that hasn't been loaded to the stack
// slug must be updated in storage now because it isn't being tracked on the stack
l.selectorSlugs[slugIndex] = _insertSelectorIntoSlug(
l.selectorSlugs[slugIndex],
lastSelector,
selectorBitIndexInSlug
);
}
}
return (selectorCount, lastSlug);
}
}
/**
* @notice replace in the diamond a set of selectors associated with a particular facet
* @param l storage pointer to the DiamondBaseStorage Layout struct
* @param facetCut structured data representing facet address and selectors to replace
*/
function _replaceFacetSelectors(
DiamondBaseStorage.Layout storage l,
FacetCut memory facetCut
) internal {
unchecked {
if (!facetCut.target.isContract())
revert DiamondWritable__TargetHasNoCode();
for (uint256 i; i < facetCut.selectors.length; i++) {
bytes4 selector = facetCut.selectors[i];
bytes32 selectorInfo = l.selectorInfo[selector];
address oldFacetAddress = address(bytes20(selectorInfo));
if (oldFacetAddress == address(0))
revert DiamondWritable__SelectorNotFound();
if (oldFacetAddress == address(this))
revert DiamondWritable__SelectorIsImmutable();
if (oldFacetAddress == facetCut.target)
revert DiamondWritable__ReplaceTargetIsIdentical();
// replace old facet address
l.selectorInfo[selector] =
(selectorInfo & CLEAR_ADDRESS_MASK) |
bytes20(facetCut.target);
}
}
}
/**
* @notice run an optional post-diamond-cut initialization transation via delegatecall
* @dev the target and data parameters must both be zero, or both be non-zero
* @param target contract address to which call shall be delegated
* @param data encoded delegatecall transaction data
*/
function _initialize(address target, bytes memory data) private {
if ((target == address(0)) != (data.length == 0))
revert DiamondWritable__InvalidInitializationParameters();
if (target != address(0)) {
if (target != address(this)) {
if (!target.isContract())
revert DiamondWritable__TargetHasNoCode();
}
(bool success, ) = target.delegatecall(data);
if (!success) {
assembly {
returndatacopy(0, 0, returndatasize())
revert(0, returndatasize())
}
}
}
}
/**
* @notice insert 4-byte function selector into 32-byte selector slug at given bit position
* @param slug 32-byte sequence of up to 8 function selectors
* @param selector function selector to insert
* @param bitIndex bit position of selector within slug (must be multiple of 32)
*/
function _insertSelectorIntoSlug(
bytes32 slug,
bytes4 selector,
uint256 bitIndex
) private pure returns (bytes32) {
return
(slug & ~(CLEAR_SELECTOR_MASK >> bitIndex)) |
(bytes32(selector) >> bitIndex);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC2535DiamondCut } from '../../../interfaces/IERC2535DiamondCut.sol';
import { IDiamondWritableInternal } from './IDiamondWritableInternal.sol';
/**
* @title Diamond proxy upgrade interface
* @dev see https://eips.ethereum.org/EIPS/eip-2535
*/
interface IDiamondWritable is IERC2535DiamondCut, IDiamondWritableInternal {}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC2535DiamondCutInternal } from '../../../interfaces/IERC2535DiamondCutInternal.sol';
interface IDiamondWritableInternal is IERC2535DiamondCutInternal {
error DiamondWritable__InvalidInitializationParameters();
error DiamondWritable__RemoveTargetNotZeroAddress();
error DiamondWritable__ReplaceTargetIsIdentical();
error DiamondWritable__SelectorAlreadyAdded();
error DiamondWritable__SelectorIsImmutable();
error DiamondWritable__SelectorNotFound();
error DiamondWritable__SelectorNotSpecified();
error DiamondWritable__TargetHasNoCode();
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
interface IProxy {
error Proxy__ImplementationIsNotContract();
fallback() external payable;
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { AddressUtils } from '../utils/AddressUtils.sol';
import { IProxy } from './IProxy.sol';
/**
* @title Base proxy contract
*/
abstract contract Proxy is IProxy {
using AddressUtils for address;
/**
* @notice delegate all calls to implementation contract
* @dev reverts if implementation address contains no code, for compatibility with metamorphic contracts
* @dev memory location in use by assembly may be unsafe in other contexts
*/
fallback() external payable virtual {
address implementation = _getImplementation();
if (!implementation.isContract())
revert Proxy__ImplementationIsNotContract();
assembly {
calldatacopy(0, 0, calldatasize())
let result := delegatecall(
gas(),
implementation,
0,
calldatasize(),
0,
0
)
returndatacopy(0, 0, returndatasize())
switch result
case 0 {
revert(0, returndatasize())
}
default {
return(0, returndatasize())
}
}
}
/**
* @notice get logic implementation address
* @return implementation address
*/
function _getImplementation() internal virtual returns (address);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IInitializableInternal } from './IInitializableInternal.sol';
interface IInitializable is IInitializableInternal {}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
interface IInitializableInternal {
error Initializable__AlreadyInitialized();
event Initialized(uint8 version);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IInitializable } from './IInitializable.sol';
import { InitializableInternal } from './InitializableInternal.sol';
abstract contract Initializable is IInitializable, InitializableInternal {}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { AddressUtils } from '../../utils/AddressUtils.sol';
import { IInitializableInternal } from './IInitializableInternal.sol';
import { InitializableStorage } from './InitializableStorage.sol';
abstract contract InitializableInternal is IInitializableInternal {
using AddressUtils for address;
using InitializableStorage for InitializableStorage.Layout;
modifier initializer() {
_setInitializedVersion(1);
_;
}
modifier reinitializer(uint8 version) {
_setInitializedVersion(version);
_;
}
function _setInitializedVersion(uint8 version) internal virtual {
InitializableStorage.Layout storage l = InitializableStorage.layout();
if (l.initialized >= version)
revert Initializable__AlreadyInitialized();
l.initialized = version;
emit Initialized(version);
}
function _getInitializedVersion()
internal
view
virtual
returns (uint8 version)
{
version = InitializableStorage.layout().initialized;
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
library InitializableStorage {
struct Layout {
uint8 initialized;
}
bytes32 internal constant STORAGE_SLOT =
keccak256('solidstate.contracts.storage.Initializable');
function layout() internal pure returns (Layout storage l) {
bytes32 slot = STORAGE_SLOT;
assembly {
l.slot := slot
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IPausableInternal } from './IPausableInternal.sol';
interface IPausable is IPausableInternal {
/**
* @notice query whether contract is paused
* @return status whether contract is paused
*/
function paused() external view returns (bool status);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
interface IPausableInternal {
error Pausable__Paused();
error Pausable__NotPaused();
event Paused(address account);
event Unpaused(address account);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IPausable } from './IPausable.sol';
import { PausableInternal } from './PausableInternal.sol';
/**
* @title Pausable security control module.
*/
abstract contract Pausable is IPausable, PausableInternal {
/**
* @inheritdoc IPausable
*/
function paused() external view virtual returns (bool status) {
status = _paused();
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IPausableInternal } from './IPausableInternal.sol';
import { PausableStorage } from './PausableStorage.sol';
/**
* @title Internal functions for Pausable security control module.
*/
abstract contract PausableInternal is IPausableInternal {
modifier whenNotPaused() {
if (_paused()) revert Pausable__Paused();
_;
}
modifier whenPaused() {
if (!_paused()) revert Pausable__NotPaused();
_;
}
/**
* @notice query whether contract is paused
* @return status whether contract is paused
*/
function _paused() internal view virtual returns (bool status) {
status = PausableStorage.layout().paused;
}
/**
* @notice Triggers paused state, when contract is unpaused.
*/
function _pause() internal virtual whenNotPaused {
PausableStorage.layout().paused = true;
emit Paused(msg.sender);
}
/**
* @notice Triggers unpaused state, when contract is paused.
*/
function _unpause() internal virtual whenPaused {
delete PausableStorage.layout().paused;
emit Unpaused(msg.sender);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
library PausableStorage {
struct Layout {
bool paused;
}
bytes32 internal constant STORAGE_SLOT =
keccak256('solidstate.contracts.storage.Pausable');
function layout() internal pure returns (Layout storage l) {
bytes32 slot = STORAGE_SLOT;
assembly {
l.slot := slot
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
interface IReentrancyGuard {
error ReentrancyGuard__ReentrantCall();
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IReentrancyGuard } from './IReentrancyGuard.sol';
import { ReentrancyGuardStorage } from './ReentrancyGuardStorage.sol';
/**
* @title Utility contract for preventing reentrancy attacks
*/
abstract contract ReentrancyGuard is IReentrancyGuard {
uint256 internal constant REENTRANCY_STATUS_LOCKED = 2;
uint256 internal constant REENTRANCY_STATUS_UNLOCKED = 1;
modifier nonReentrant() virtual {
if (_isReentrancyGuardLocked()) revert ReentrancyGuard__ReentrantCall();
_lockReentrancyGuard();
_;
_unlockReentrancyGuard();
}
/**
* @notice returns true if the reentrancy guard is locked, false otherwise
*/
function _isReentrancyGuardLocked() internal view virtual returns (bool) {
return
ReentrancyGuardStorage.layout().status == REENTRANCY_STATUS_LOCKED;
}
/**
* @notice lock functions that use the nonReentrant modifier
*/
function _lockReentrancyGuard() internal virtual {
ReentrancyGuardStorage.layout().status = REENTRANCY_STATUS_LOCKED;
}
/**
* @notice unlock functions that use the nonReentrant modifier
*/
function _unlockReentrancyGuard() internal virtual {
ReentrancyGuardStorage.layout().status = REENTRANCY_STATUS_UNLOCKED;
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
library ReentrancyGuardStorage {
struct Layout {
uint256 status;
}
bytes32 internal constant STORAGE_SLOT =
keccak256('solidstate.contracts.storage.ReentrancyGuard');
function layout() internal pure returns (Layout storage l) {
bytes32 slot = STORAGE_SLOT;
assembly {
l.slot := slot
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC721 } from '../../../interfaces/IERC721.sol';
import { IERC721Base } from './IERC721Base.sol';
import { ERC721BaseInternal } from './ERC721BaseInternal.sol';
/**
* @title Base ERC721 implementation, excluding optional extensions
* @dev inheritor must either implement ERC165 supportsInterface or inherit ERC165Base
*/
abstract contract ERC721Base is IERC721Base, ERC721BaseInternal {
/**
* @inheritdoc IERC721
*/
function balanceOf(address account) external view returns (uint256) {
return _balanceOf(account);
}
/**
* @inheritdoc IERC721
*/
function ownerOf(uint256 tokenId) external view returns (address) {
return _ownerOf(tokenId);
}
/**
* @inheritdoc IERC721
*/
function getApproved(uint256 tokenId) external view returns (address) {
return _getApproved(tokenId);
}
/**
* @inheritdoc IERC721
*/
function isApprovedForAll(
address account,
address operator
) external view returns (bool) {
return _isApprovedForAll(account, operator);
}
/**
* @inheritdoc IERC721
*/
function transferFrom(
address from,
address to,
uint256 tokenId
) external payable {
_transferFrom(from, to, tokenId);
}
/**
* @inheritdoc IERC721
*/
function safeTransferFrom(
address from,
address to,
uint256 tokenId
) external payable {
_safeTransferFrom(from, to, tokenId);
}
/**
* @inheritdoc IERC721
*/
function safeTransferFrom(
address from,
address to,
uint256 tokenId,
bytes memory data
) external payable {
_safeTransferFrom(from, to, tokenId, data);
}
/**
* @inheritdoc IERC721
*/
function approve(address operator, uint256 tokenId) external payable {
_approve(operator, tokenId);
}
/**
* @inheritdoc IERC721
*/
function setApprovalForAll(address operator, bool status) external {
_setApprovalForAll(operator, status);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC721Receiver } from '../../../interfaces/IERC721Receiver.sol';
import { EnumerableMap } from '../../../data/EnumerableMap.sol';
import { EnumerableSet } from '../../../data/EnumerableSet.sol';
import { AddressUtils } from '../../../utils/AddressUtils.sol';
import { IERC721BaseInternal } from './IERC721BaseInternal.sol';
import { ERC721BaseStorage } from './ERC721BaseStorage.sol';
/**
* @title Base ERC721 internal functions
*/
abstract contract ERC721BaseInternal is IERC721BaseInternal {
using AddressUtils for address;
using EnumerableMap for EnumerableMap.UintToAddressMap;
using EnumerableSet for EnumerableSet.UintSet;
function _balanceOf(
address account
) internal view virtual returns (uint256) {
if (account == address(0)) revert ERC721Base__BalanceQueryZeroAddress();
return ERC721BaseStorage.layout().holderTokens[account].length();
}
function _ownerOf(uint256 tokenId) internal view virtual returns (address) {
address owner = ERC721BaseStorage.layout().tokenOwners.get(tokenId);
if (owner == address(0)) revert ERC721Base__InvalidOwner();
return owner;
}
function _exists(uint256 tokenId) internal view virtual returns (bool) {
return ERC721BaseStorage.layout().tokenOwners.contains(tokenId);
}
function _getApproved(
uint256 tokenId
) internal view virtual returns (address) {
if (!_exists(tokenId)) revert ERC721Base__NonExistentToken();
return ERC721BaseStorage.layout().tokenApprovals[tokenId];
}
function _isApprovedForAll(
address account,
address operator
) internal view virtual returns (bool) {
return ERC721BaseStorage.layout().operatorApprovals[account][operator];
}
function _isApprovedOrOwner(
address spender,
uint256 tokenId
) internal view virtual returns (bool) {
if (!_exists(tokenId)) revert ERC721Base__NonExistentToken();
address owner = _ownerOf(tokenId);
return (spender == owner ||
_getApproved(tokenId) == spender ||
_isApprovedForAll(owner, spender));
}
function _mint(address to, uint256 tokenId) internal virtual {
if (to == address(0)) revert ERC721Base__MintToZeroAddress();
if (_exists(tokenId)) revert ERC721Base__TokenAlreadyMinted();
_beforeTokenTransfer(address(0), to, tokenId);
ERC721BaseStorage.Layout storage l = ERC721BaseStorage.layout();
l.holderTokens[to].add(tokenId);
l.tokenOwners.set(tokenId, to);
emit Transfer(address(0), to, tokenId);
}
function _safeMint(address to, uint256 tokenId) internal virtual {
_safeMint(to, tokenId, '');
}
function _safeMint(
address to,
uint256 tokenId,
bytes memory data
) internal virtual {
_mint(to, tokenId);
if (!_checkOnERC721Received(address(0), to, tokenId, data))
revert ERC721Base__ERC721ReceiverNotImplemented();
}
function _burn(uint256 tokenId) internal virtual {
address owner = _ownerOf(tokenId);
_beforeTokenTransfer(owner, address(0), tokenId);
ERC721BaseStorage.Layout storage l = ERC721BaseStorage.layout();
l.holderTokens[owner].remove(tokenId);
l.tokenOwners.remove(tokenId);
l.tokenApprovals[tokenId] = address(0);
emit Approval(owner, address(0), tokenId);
emit Transfer(owner, address(0), tokenId);
}
function _transfer(
address from,
address to,
uint256 tokenId
) internal virtual {
address owner = _ownerOf(tokenId);
if (owner != from) revert ERC721Base__NotTokenOwner();
if (to == address(0)) revert ERC721Base__TransferToZeroAddress();
_beforeTokenTransfer(from, to, tokenId);
ERC721BaseStorage.Layout storage l = ERC721BaseStorage.layout();
l.holderTokens[from].remove(tokenId);
l.holderTokens[to].add(tokenId);
l.tokenOwners.set(tokenId, to);
l.tokenApprovals[tokenId] = address(0);
emit Approval(owner, address(0), tokenId);
emit Transfer(from, to, tokenId);
}
function _transferFrom(
address from,
address to,
uint256 tokenId
) internal virtual {
_handleTransferMessageValue(from, to, tokenId, msg.value);
if (!_isApprovedOrOwner(msg.sender, tokenId))
revert ERC721Base__NotOwnerOrApproved();
_transfer(from, to, tokenId);
}
function _safeTransfer(
address from,
address to,
uint256 tokenId,
bytes memory data
) internal virtual {
_transfer(from, to, tokenId);
if (!_checkOnERC721Received(from, to, tokenId, data))
revert ERC721Base__ERC721ReceiverNotImplemented();
}
function _safeTransferFrom(
address from,
address to,
uint256 tokenId
) internal virtual {
_safeTransferFrom(from, to, tokenId, '');
}
function _safeTransferFrom(
address from,
address to,
uint256 tokenId,
bytes memory data
) internal virtual {
_handleTransferMessageValue(from, to, tokenId, msg.value);
if (!_isApprovedOrOwner(msg.sender, tokenId))
revert ERC721Base__NotOwnerOrApproved();
_safeTransfer(from, to, tokenId, data);
}
function _approve(address operator, uint256 tokenId) internal virtual {
_handleApproveMessageValue(operator, tokenId, msg.value);
address owner = _ownerOf(tokenId);
if (operator == owner) revert ERC721Base__SelfApproval();
if (msg.sender != owner && !_isApprovedForAll(owner, msg.sender))
revert ERC721Base__NotOwnerOrApproved();
ERC721BaseStorage.layout().tokenApprovals[tokenId] = operator;
emit Approval(owner, operator, tokenId);
}
function _setApprovalForAll(
address operator,
bool status
) internal virtual {
if (operator == msg.sender) revert ERC721Base__SelfApproval();
ERC721BaseStorage.layout().operatorApprovals[msg.sender][
operator
] = status;
emit ApprovalForAll(msg.sender, operator, status);
}
function _checkOnERC721Received(
address from,
address to,
uint256 tokenId,
bytes memory data
) internal virtual returns (bool) {
if (!to.isContract()) {
return true;
}
bytes memory returnData = to.functionCall(
abi.encodeWithSelector(
IERC721Receiver(to).onERC721Received.selector,
msg.sender,
from,
tokenId,
data
),
'ERC721: transfer to non ERC721Receiver implementer'
);
bytes4 returnValue = abi.decode(returnData, (bytes4));
return returnValue == type(IERC721Receiver).interfaceId;
}
/**
* @notice ERC721 hook, called before externally called approvals for processing of included message value
* @param operator beneficiary of approval
* @param tokenId id of transferred token
* @param value message value
*/
function _handleApproveMessageValue(
address operator,
uint256 tokenId,
uint256 value
) internal virtual {}
/**
* @notice ERC721 hook, called before externally called transfers for processing of included message value
* @param from sender of token
* @param to receiver of token
* @param tokenId id of transferred token
* @param value message value
*/
function _handleTransferMessageValue(
address from,
address to,
uint256 tokenId,
uint256 value
) internal virtual {}
/**
* @notice ERC721 hook, called before all transfers including mint and burn
* @dev function should be overridden and new implementation must call super
* @param from sender of token
* @param to receiver of token
* @param tokenId id of transferred token
*/
function _beforeTokenTransfer(
address from,
address to,
uint256 tokenId
) internal virtual {}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { EnumerableMap } from '../../../data/EnumerableMap.sol';
import { EnumerableSet } from '../../../data/EnumerableSet.sol';
library ERC721BaseStorage {
using EnumerableSet for EnumerableSet.UintSet;
using EnumerableMap for EnumerableMap.UintToAddressMap;
bytes32 internal constant STORAGE_SLOT =
keccak256('solidstate.contracts.storage.ERC721Base');
struct Layout {
EnumerableMap.UintToAddressMap tokenOwners;
mapping(address => EnumerableSet.UintSet) holderTokens;
mapping(uint256 => address) tokenApprovals;
mapping(address => mapping(address => bool)) operatorApprovals;
}
function layout() internal pure returns (Layout storage l) {
bytes32 slot = STORAGE_SLOT;
assembly {
l.slot := slot
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC721 } from '../../../interfaces/IERC721.sol';
import { IERC721BaseInternal } from './IERC721BaseInternal.sol';
/**
* @title ERC721 base interface
*/
interface IERC721Base is IERC721BaseInternal, IERC721 {}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC721Internal } from '../../../interfaces/IERC721Internal.sol';
/**
* @title ERC721 base interface
*/
interface IERC721BaseInternal is IERC721Internal {
error ERC721Base__NotOwnerOrApproved();
error ERC721Base__SelfApproval();
error ERC721Base__BalanceQueryZeroAddress();
error ERC721Base__ERC721ReceiverNotImplemented();
error ERC721Base__InvalidOwner();
error ERC721Base__MintToZeroAddress();
error ERC721Base__NonExistentToken();
error ERC721Base__NotTokenOwner();
error ERC721Base__TokenAlreadyMinted();
error ERC721Base__TransferToZeroAddress();
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { EnumerableMap } from '../../../data/EnumerableMap.sol';
import { EnumerableSet } from '../../../data/EnumerableSet.sol';
import { ERC721BaseStorage } from '../base/ERC721BaseStorage.sol';
import { IERC721Enumerable } from './IERC721Enumerable.sol';
import { ERC721EnumerableInternal } from './ERC721EnumerableInternal.sol';
abstract contract ERC721Enumerable is
IERC721Enumerable,
ERC721EnumerableInternal
{
using EnumerableMap for EnumerableMap.UintToAddressMap;
using EnumerableSet for EnumerableSet.UintSet;
/**
* @inheritdoc IERC721Enumerable
*/
function totalSupply() public view returns (uint256) {
return _totalSupply();
}
/**
* @inheritdoc IERC721Enumerable
*/
function tokenOfOwnerByIndex(
address owner,
uint256 index
) public view returns (uint256) {
return _tokenOfOwnerByIndex(owner, index);
}
/**
* @inheritdoc IERC721Enumerable
*/
function tokenByIndex(uint256 index) public view returns (uint256) {
return _tokenByIndex(index);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { EnumerableMap } from '../../../data/EnumerableMap.sol';
import { EnumerableSet } from '../../../data/EnumerableSet.sol';
import { ERC721BaseStorage } from '../base/ERC721BaseStorage.sol';
abstract contract ERC721EnumerableInternal {
using EnumerableMap for EnumerableMap.UintToAddressMap;
using EnumerableSet for EnumerableSet.UintSet;
/**
* @notice TODO
*/
function _totalSupply() internal view returns (uint256) {
return ERC721BaseStorage.layout().tokenOwners.length();
}
/**
* @notice TODO
*/
function _tokenOfOwnerByIndex(
address owner,
uint256 index
) internal view returns (uint256) {
return ERC721BaseStorage.layout().holderTokens[owner].at(index);
}
/**
* @notice TODO
*/
function _tokenByIndex(
uint256 index
) internal view returns (uint256 tokenId) {
(tokenId, ) = ERC721BaseStorage.layout().tokenOwners.at(index);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
interface IERC721Enumerable {
/**
* @notice get total token supply
* @return total supply
*/
function totalSupply() external view returns (uint256);
/**
* @notice get token of given owner at given internal storage index
* @param owner token holder to query
* @param index position in owner's token list to query
* @return tokenId id of retrieved token
*/
function tokenOfOwnerByIndex(
address owner,
uint256 index
) external view returns (uint256 tokenId);
/**
* @notice get token at given internal storage index
* @param index position in global token list to query
* @return tokenId id of retrieved token
*/
function tokenByIndex(
uint256 index
) external view returns (uint256 tokenId);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC721Base } from './base/IERC721Base.sol';
import { IERC721Enumerable } from './enumerable/IERC721Enumerable.sol';
import { IERC721Metadata } from './metadata/IERC721Metadata.sol';
interface ISolidStateERC721 is IERC721Base, IERC721Enumerable, IERC721Metadata {
error SolidStateERC721__PayableApproveNotSupported();
error SolidStateERC721__PayableTransferNotSupported();
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { ERC721MetadataInternal } from './ERC721MetadataInternal.sol';
import { IERC721Metadata } from './IERC721Metadata.sol';
/**
* @title ERC721 metadata extensions
*/
abstract contract ERC721Metadata is IERC721Metadata, ERC721MetadataInternal {
/**
* @notice inheritdoc IERC721Metadata
*/
function name() external view virtual returns (string memory) {
return _name();
}
/**
* @notice inheritdoc IERC721Metadata
*/
function symbol() external view virtual returns (string memory) {
return _symbol();
}
/**
* @notice inheritdoc IERC721Metadata
*/
function tokenURI(
uint256 tokenId
) external view virtual returns (string memory) {
return _tokenURI(tokenId);
}
/**
* @inheritdoc ERC721MetadataInternal
*/
function _beforeTokenTransfer(
address from,
address to,
uint256 tokenId
) internal virtual override {
super._beforeTokenTransfer(from, to, tokenId);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { UintUtils } from '../../../utils/UintUtils.sol';
import { ERC721BaseStorage } from '../base/ERC721BaseStorage.sol';
import { ERC721BaseInternal } from '../base/ERC721Base.sol';
import { IERC721MetadataInternal } from './IERC721MetadataInternal.sol';
import { ERC721MetadataStorage } from './ERC721MetadataStorage.sol';
/**
* @title ERC721Metadata internal functions
*/
abstract contract ERC721MetadataInternal is
IERC721MetadataInternal,
ERC721BaseInternal
{
using UintUtils for uint256;
/**
* @notice get token name
* @return token name
*/
function _name() internal view virtual returns (string memory) {
return ERC721MetadataStorage.layout().name;
}
/**
* @notice get token symbol
* @return token symbol
*/
function _symbol() internal view virtual returns (string memory) {
return ERC721MetadataStorage.layout().symbol;
}
/**
* @notice get generated URI for given token
* @return token URI
*/
function _tokenURI(
uint256 tokenId
) internal view virtual returns (string memory) {
if (!_exists(tokenId)) revert ERC721Metadata__NonExistentToken();
ERC721MetadataStorage.Layout storage l = ERC721MetadataStorage.layout();
string memory tokenIdURI = l.tokenURIs[tokenId];
string memory baseURI = l.baseURI;
if (bytes(baseURI).length == 0) {
return tokenIdURI;
} else if (bytes(tokenIdURI).length > 0) {
return string(abi.encodePacked(baseURI, tokenIdURI));
} else {
return string(abi.encodePacked(baseURI, tokenId.toDecString()));
}
}
/**
* @notice ERC721 hook: clear per-token URI data on burn
* @inheritdoc ERC721BaseInternal
*/
function _beforeTokenTransfer(
address from,
address to,
uint256 tokenId
) internal virtual override {
super._beforeTokenTransfer(from, to, tokenId);
if (to == address(0)) {
delete ERC721MetadataStorage.layout().tokenURIs[tokenId];
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
library ERC721MetadataStorage {
bytes32 internal constant STORAGE_SLOT =
keccak256('solidstate.contracts.storage.ERC721Metadata');
struct Layout {
string name;
string symbol;
string baseURI;
mapping(uint256 => string) tokenURIs;
}
function layout() internal pure returns (Layout storage l) {
bytes32 slot = STORAGE_SLOT;
assembly {
l.slot := slot
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC721MetadataInternal } from './IERC721MetadataInternal.sol';
/**
* @title ERC721Metadata interface
*/
interface IERC721Metadata is IERC721MetadataInternal {
/**
* @notice get token name
* @return token name
*/
function name() external view returns (string memory);
/**
* @notice get token symbol
* @return token symbol
*/
function symbol() external view returns (string memory);
/**
* @notice get generated URI for given token
* @return token URI
*/
function tokenURI(uint256 tokenId) external view returns (string memory);
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { IERC721BaseInternal } from '../base/IERC721BaseInternal.sol';
/**
* @title ERC721Metadata internal interface
*/
interface IERC721MetadataInternal is IERC721BaseInternal {
error ERC721Metadata__NonExistentToken();
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { ERC165Base } from '../../introspection/ERC165/base/ERC165Base.sol';
import { ERC721Base, ERC721BaseInternal } from './base/ERC721Base.sol';
import { ERC721Enumerable } from './enumerable/ERC721Enumerable.sol';
import { ERC721Metadata } from './metadata/ERC721Metadata.sol';
import { ISolidStateERC721 } from './ISolidStateERC721.sol';
/**
* @title SolidState ERC721 implementation, including recommended extensions
*/
abstract contract SolidStateERC721 is
ISolidStateERC721,
ERC721Base,
ERC721Enumerable,
ERC721Metadata,
ERC165Base
{
/**
* @notice ERC721 hook: revert if value is included in external approve function call
* @inheritdoc ERC721BaseInternal
*/
function _handleApproveMessageValue(
address operator,
uint256 tokenId,
uint256 value
) internal virtual override {
if (value > 0) revert SolidStateERC721__PayableApproveNotSupported();
super._handleApproveMessageValue(operator, tokenId, value);
}
/**
* @notice ERC721 hook: revert if value is included in external transfer function call
* @inheritdoc ERC721BaseInternal
*/
function _handleTransferMessageValue(
address from,
address to,
uint256 tokenId,
uint256 value
) internal virtual override {
if (value > 0) revert SolidStateERC721__PayableTransferNotSupported();
super._handleTransferMessageValue(from, to, tokenId, value);
}
/**
* @inheritdoc ERC721BaseInternal
*/
function _beforeTokenTransfer(
address from,
address to,
uint256 tokenId
) internal virtual override(ERC721BaseInternal, ERC721Metadata) {
super._beforeTokenTransfer(from, to, tokenId);
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
import { UintUtils } from './UintUtils.sol';
library AddressUtils {
using UintUtils for uint256;
error AddressUtils__InsufficientBalance();
error AddressUtils__NotContract();
error AddressUtils__SendValueFailed();
function toString(address account) internal pure returns (string memory) {
return uint256(uint160(account)).toHexString(20);
}
function isContract(address account) internal view returns (bool) {
uint256 size;
assembly {
size := extcodesize(account)
}
return size > 0;
}
function sendValue(address payable account, uint256 amount) internal {
(bool success, ) = account.call{ value: amount }('');
if (!success) revert AddressUtils__SendValueFailed();
}
function functionCall(
address target,
bytes memory data
) internal returns (bytes memory) {
return
functionCall(target, data, 'AddressUtils: failed low-level call');
}
function functionCall(
address target,
bytes memory data,
string memory error
) internal returns (bytes memory) {
return _functionCallWithValue(target, data, 0, error);
}
function functionCallWithValue(
address target,
bytes memory data,
uint256 value
) internal returns (bytes memory) {
return
functionCallWithValue(
target,
data,
value,
'AddressUtils: failed low-level call with value'
);
}
function functionCallWithValue(
address target,
bytes memory data,
uint256 value,
string memory error
) internal returns (bytes memory) {
if (value > address(this).balance)
revert AddressUtils__InsufficientBalance();
return _functionCallWithValue(target, data, value, error);
}
/**
* @notice execute arbitrary external call with limited gas usage and amount of copied return data
* @dev derived from https://github.com/nomad-xyz/ExcessivelySafeCall (MIT License)
* @param target recipient of call
* @param gasAmount gas allowance for call
* @param value native token value to include in call
* @param maxCopy maximum number of bytes to copy from return data
* @param data encoded call data
* @return success whether call is successful
* @return returnData copied return data
*/
function excessivelySafeCall(
address target,
uint256 gasAmount,
uint256 value,
uint16 maxCopy,
bytes memory data
) internal returns (bool success, bytes memory returnData) {
returnData = new bytes(maxCopy);
assembly {
// execute external call via assembly to avoid automatic copying of return data
success := call(
gasAmount,
target,
value,
add(data, 0x20),
mload(data),
0,
0
)
// determine whether to limit amount of data to copy
let toCopy := returndatasize()
if gt(toCopy, maxCopy) {
toCopy := maxCopy
}
// store the length of the copied bytes
mstore(returnData, toCopy)
// copy the bytes from returndata[0:toCopy]
returndatacopy(add(returnData, 0x20), 0, toCopy)
}
}
function _functionCallWithValue(
address target,
bytes memory data,
uint256 value,
string memory error
) private returns (bytes memory) {
if (!isContract(target)) revert AddressUtils__NotContract();
(bool success, bytes memory returnData) = target.call{ value: value }(
data
);
if (success) {
return returnData;
} else if (returnData.length > 0) {
assembly {
let returnData_size := mload(returnData)
revert(add(32, returnData), returnData_size)
}
} else {
revert(error);
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;
/**
* @title utility functions for uint256 operations
* @dev derived from https://github.com/OpenZeppelin/openzeppelin-contracts/ (MIT license)
*/
library UintUtils {
error UintUtils__InsufficientPadding();
error UintUtils__InvalidBase();
bytes16 private constant HEX_SYMBOLS = '0123456789abcdef';
function add(uint256 a, int256 b) internal pure returns (uint256) {
return b < 0 ? sub(a, -b) : a + uint256(b);
}
function sub(uint256 a, int256 b) internal pure returns (uint256) {
return b < 0 ? add(a, -b) : a - uint256(b);
}
/**
* @notice output the string representation of a number in a given radix
* @dev radix must be between 2 and 36 (inclusive)
* @param value number to format as string
* @param radix numerical base to use
* @return output formatted string
*/
function toString(
uint256 value,
uint256 radix
) internal pure returns (string memory output) {
// this check is repeated in the internal call to #toString(uint256,uint256,uint256)
// but is still needed here to avoid zero division (radix = 0) or infinite loop (radix = 1)
if (radix < 2) {
revert UintUtils__InvalidBase();
}
uint256 length;
uint256 temp = value;
do {
unchecked {
length++;
}
temp /= radix;
} while (temp != 0);
output = toString(value, radix, length);
}
/**
* @notice output the string representation of a number in a given radix and padded to given length
* @dev radix must be between 2 and 36 (inclusive)
* @param value number to format as string
* @param radix numerical base to use
* @param length size to which output should be zero padded
* @return output formatted string
*/
function toString(
uint256 value,
uint256 radix,
uint256 length
) internal pure returns (string memory output) {
if (radix < 2 || radix > 36) {
revert UintUtils__InvalidBase();
}
bytes memory buffer = new bytes(length);
while (length != 0) {
unchecked {
length--;
}
uint256 char = value % radix;
if (char < 10) {
// for numeral characters, shift 48 places through ASCII character set
// 48 can be added using bitwise-or because its binary is 00110000
char |= 48;
} else {
// for alphabetical characters, shift 87 places through ASCII character set
unchecked {
char += 87;
}
}
buffer[length] = bytes1(uint8(char));
value /= radix;
}
if (value != 0) revert UintUtils__InsufficientPadding();
output = string(buffer);
}
/**
* @notice output the 0b-prefixed binary string representation of a number
* @param value number to format as string
* @return output formatted string
*/
function toBinString(
uint256 value
) internal pure returns (string memory output) {
uint256 length;
uint256 temp = value;
do {
unchecked {
length++;
}
temp >>= 1;
} while (temp != 0);
output = toBinString(value, length);
}
/**
* @notice output the 0b-prefixed binary string representation of a number padded to given length
* @param value number to format as string
* @param length size to which output should be zero padded (not including prefix)
* @return output formatted string
*/
function toBinString(
uint256 value,
uint256 length
) internal pure returns (string memory output) {
// add two to length for the leading "0b"
length += 2;
bytes memory buffer = new bytes(length);
buffer[0] = '0';
buffer[1] = 'b';
while (length > 2) {
unchecked {
length--;
}
buffer[length] = HEX_SYMBOLS[value & 1];
value >>= 1;
}
if (value != 0) revert UintUtils__InsufficientPadding();
output = string(buffer);
}
/**
* @notice output the 0o-prefixed octal string representation of a number
* @param value number to format as string
* @return output formatted string
*/
function toOctString(
uint256 value
) internal pure returns (string memory output) {
uint256 length;
uint256 temp = value;
do {
unchecked {
length++;
}
temp >>= 3;
} while (temp != 0);
output = toOctString(value, length);
}
/**
* @notice output the 0o-prefixed octal string representation of a number padded to given length
* @param value number to format as string
* @param length size to which output should be zero padded (not including prefix)
* @return output formatted string
*/
function toOctString(
uint256 value,
uint256 length
) internal pure returns (string memory output) {
// add two to length for the leading "0o"
length += 2;
bytes memory buffer = new bytes(length);
buffer[0] = '0';
buffer[1] = 'o';
while (length > 2) {
unchecked {
length--;
}
buffer[length] = HEX_SYMBOLS[value & 7];
value >>= 3;
}
if (value != 0) revert UintUtils__InsufficientPadding();
output = string(buffer);
}
/**
* @notice output the decimal string representation of a number
* @param value number to format as string
* @return output formatted string
*/
function toDecString(
uint256 value
) internal pure returns (string memory output) {
output = toString(value, 10);
}
/**
* @notice output the decimal string representation of a number padded to given length
* @param value number to format as string
* @param length size to which output should be zero padded
* @return output formatted string
*/
function toDecString(
uint256 value,
uint256 length
) internal pure returns (string memory output) {
output = toString(value, 10, length);
}
/**
* @notice output the 0x-prefixed hexadecimal string representation of a number
* @dev calculated string length will always be even to prevent splitting of bytes
* @param value number to format as string
* @return output formatted string
*/
function toHexString(
uint256 value
) internal pure returns (string memory output) {
uint256 length;
uint256 temp = value;
do {
unchecked {
length++;
}
temp >>= 8;
} while (temp != 0);
output = toHexString(value, length);
}
/**
* @notice output the 0x-prefixed hexadecimal string representation of a number padded to given length
* @dev calculated string length will always be even to prevent splitting of bytes
* @param value number to format as string
* @param length size (in bytes) to which output should be zero padded (not including prefix)
* @return output formatted string
*/
function toHexString(
uint256 value,
uint256 length
) internal pure returns (string memory output) {
// convert byte length to character length and add two to length for the leading "0x"
unchecked {
length = (length << 1) + 2;
}
bytes memory buffer = new bytes(length);
buffer[0] = '0';
buffer[1] = 'x';
while (length > 2) {
unchecked {
length--;
}
buffer[length] = HEX_SYMBOLS[value & 15];
value >>= 4;
}
if (value != 0) revert UintUtils__InsufficientPadding();
output = string(buffer);
}
}// SPDX-License-Identifier: SEE LICENSE IN LICENSE
pragma solidity ^0.8.29;
import {ISolidStateERC721} from "@solidstate/contracts/token/ERC721/ISolidStateERC721.sol";
interface IERC721MintBurn is ISolidStateERC721 {
/**
* @notice Mints a new token to the specified address.
* @param to The address to mint the token to.
* @param tokenId The ID of the token to mint.
*/
function mint(address to, uint256 tokenId) external;
/**
* @notice Burns the specified token.
* @param tokenId The ID of the token to burn.
*/
function burn(uint256 tokenId) external;
}// SPDX-License-Identifier: SEE LICENSE IN LICENSE
pragma solidity ^0.8.29;
interface IStaker {
function airdrop(uint256 rewardAmount) external payable;
function burnAndRedeem(uint256 tokenId) external returns (uint256 nftStaked);
function merge(uint256 tokenId1, uint256 tokenId2) external returns (uint256 newTokenId);
function stake(uint256 tokenId, uint256 amount) external;
function lockNFT(uint256 tokenId) external;
function unlockNFT(uint256 tokenId) external;
function withdraw(uint256 tokenId, uint256 amount) external returns (uint256 amountToWithdraw);
function claim(uint256 tokenId) external returns (uint256 claimedRewards);
function checkLevel(uint256 staked) external view returns (uint256);
function calcWeight(uint256 nftStaked, uint256 tokenMultipliers) external pure returns (uint256);
}// SPDX-License-Identifier: BSD-4-Clause /* * ABDK Math Quad Smart Contract Library. Copyright © 2019 by ABDK Consulting. * Author: Mikhail Vladimirov <[email protected]> */ pragma solidity ^0.8.29; /** * Smart contract library of mathematical functions operating with IEEE 754 * quadruple-precision binary floating-point numbers (quadruple precision * numbers). As long as quadruple precision numbers are 16-bytes long, they are * represented by bytes16 type. */ library ABDKMathQuad { /** * Convert unsigned 256-bit integer number into quadruple precision number. * * @param x unsigned 256-bit integer number * @return quadruple precision number */ function fromUInt(uint256 x) internal pure returns (bytes16) { unchecked { if (x == 0) return bytes16(0); else { uint256 result = x; uint256 msb = mostSignificantBit(result); if (msb < 112) result <<= 112 - msb; else if (msb > 112) result >>= msb - 112; result = (result & 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF) | ((16383 + msb) << 112); return bytes16(uint128(result)); } } } /** * Convert quadruple precision number into unsigned 256-bit integer number * rounding towards zero. Revert on underflow. Note, that negative floating * point numbers in range (-1.0 .. 0.0) may be converted to unsigned integer * without error, because they are rounded to zero. * * @param x quadruple precision number * @return unsigned 256-bit integer number */ function toUInt(bytes16 x) internal pure returns (uint256) { unchecked { uint256 exponent = (uint128(x) >> 112) & 0x7FFF; if (exponent < 16383) return 0; // Underflow require(uint128(x) < 0x80000000000000000000000000000000); // Negative require(exponent <= 16638); // Overflow uint256 result = (uint256(uint128(x)) & 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF) | 0x10000000000000000000000000000; if (exponent < 16495) result >>= 16495 - exponent; else if (exponent > 16495) result <<= exponent - 16495; return result; } } /** * Calculate x * y. Special values behave in the following way: * * NaN * x = NaN for any x. * Infinity * x = Infinity for any finite positive x. * Infinity * x = -Infinity for any finite negative x. * -Infinity * x = -Infinity for any finite positive x. * -Infinity * x = Infinity for any finite negative x. * Infinity * 0 = NaN. * -Infinity * 0 = NaN. * Infinity * Infinity = Infinity. * Infinity * -Infinity = -Infinity. * -Infinity * Infinity = -Infinity. * -Infinity * -Infinity = Infinity. * * @param x quadruple precision number * @param y quadruple precision number * @return quadruple precision number */ function mul(bytes16 x, bytes16 y) internal pure returns (bytes16) { unchecked { bytes16 POSITIVE_ZERO = 0x00000000000000000000000000000000; bytes16 NEGATIVE_ZERO = 0x80000000000000000000000000000000; bytes16 NaN = 0x7FFF8000000000000000000000000000; uint256 xExponent = (uint128(x) >> 112) & 0x7FFF; uint256 yExponent = (uint128(y) >> 112) & 0x7FFF; if (xExponent == 0x7FFF) { if (yExponent == 0x7FFF) { if (x == y) return x ^ (y & 0x80000000000000000000000000000000); else if (x ^ y == 0x80000000000000000000000000000000) return x | y; else return NaN; } else { if (y & 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF == 0) return NaN; else return x ^ (y & 0x80000000000000000000000000000000); } } else if (yExponent == 0x7FFF) { if (x & 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF == 0) return NaN; else return y ^ (x & 0x80000000000000000000000000000000); } else { uint256 xSignifier = uint128(x) & 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF; if (xExponent == 0) xExponent = 1; else xSignifier |= 0x10000000000000000000000000000; uint256 ySignifier = uint128(y) & 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF; if (yExponent == 0) yExponent = 1; else ySignifier |= 0x10000000000000000000000000000; xSignifier *= ySignifier; if (xSignifier == 0) return (x ^ y) & 0x80000000000000000000000000000000 > 0 ? NEGATIVE_ZERO : POSITIVE_ZERO; xExponent += yExponent; uint256 msb = xSignifier >= 0x200000000000000000000000000000000000000000000000000000000 ? 225 : xSignifier >= 0x100000000000000000000000000000000000000000000000000000000 ? 224 : mostSignificantBit(xSignifier); if (xExponent + msb < 16496) { // Underflow xExponent = 0; xSignifier = 0; } else if (xExponent + msb < 16608) { // Subnormal if (xExponent < 16496) xSignifier >>= 16496 - xExponent; else if (xExponent > 16496) xSignifier <<= xExponent - 16496; xExponent = 0; } else if (xExponent + msb > 49373) { xExponent = 0x7FFF; xSignifier = 0; } else { if (msb > 112) xSignifier >>= msb - 112; else if (msb < 112) xSignifier <<= 112 - msb; xSignifier &= 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF; xExponent = xExponent + msb - 16607; } return bytes16(uint128(uint128((x ^ y) & 0x80000000000000000000000000000000) | (xExponent << 112) | xSignifier)); } } } /** * Calculate x / y. Special values behave in the following way: * * NaN / x = NaN for any x. * x / NaN = NaN for any x. * Infinity / x = Infinity for any finite non-negative x. * Infinity / x = -Infinity for any finite negative x including -0. * -Infinity / x = -Infinity for any finite non-negative x. * -Infinity / x = Infinity for any finite negative x including -0. * x / Infinity = 0 for any finite non-negative x. * x / -Infinity = -0 for any finite non-negative x. * x / Infinity = -0 for any finite non-negative x including -0. * x / -Infinity = 0 for any finite non-negative x including -0. * * Infinity / Infinity = NaN. * Infinity / -Infinity = -NaN. * -Infinity / Infinity = -NaN. * -Infinity / -Infinity = NaN. * * Division by zero behaves in the following way: * * x / 0 = Infinity for any finite positive x. * x / -0 = -Infinity for any finite positive x. * x / 0 = -Infinity for any finite negative x. * x / -0 = Infinity for any finite negative x. * 0 / 0 = NaN. * 0 / -0 = NaN. * -0 / 0 = NaN. * -0 / -0 = NaN. * * @param x quadruple precision number * @param y quadruple precision number * @return quadruple precision number */ function div(bytes16 x, bytes16 y) internal pure returns (bytes16) { unchecked { uint256 xExponent = (uint128(x) >> 112) & 0x7FFF; uint256 yExponent = (uint128(y) >> 112) & 0x7FFF; bytes16 POSITIVE_ZERO = 0x00000000000000000000000000000000; bytes16 NEGATIVE_ZERO = 0x80000000000000000000000000000000; bytes16 POSITIVE_INFINITY = 0x7FFF0000000000000000000000000000; bytes16 NaN = 0x7FFF8000000000000000000000000000; if (xExponent == 0x7FFF) { if (yExponent == 0x7FFF) return NaN; else return x ^ (y & 0x80000000000000000000000000000000); } else if (yExponent == 0x7FFF) { if (y & 0x0000FFFFFFFFFFFFFFFFFFFFFFFFFFFF != 0) return NaN; else return POSITIVE_ZERO | ((x ^ y) & 0x80000000000000000000000000000000); } else if (y & 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF == 0) { if (x & 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF == 0) return NaN; else return POSITIVE_INFINITY | ((x ^ y) & 0x80000000000000000000000000000000); } else { uint256 ySignifier = uint128(y) & 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF; if (yExponent == 0) yExponent = 1; else ySignifier |= 0x10000000000000000000000000000; uint256 xSignifier = uint128(x) & 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF; if (xExponent == 0) { if (xSignifier != 0) { uint shift = 226 - mostSignificantBit(xSignifier); xSignifier <<= shift; xExponent = 1; yExponent += shift - 114; } } else { xSignifier = (xSignifier | 0x10000000000000000000000000000) << 114; } xSignifier = xSignifier / ySignifier; if (xSignifier == 0) return (x ^ y) & 0x80000000000000000000000000000000 > 0 ? NEGATIVE_ZERO : POSITIVE_ZERO; assert(xSignifier >= 0x1000000000000000000000000000); uint256 msb = xSignifier >= 0x80000000000000000000000000000 ? mostSignificantBit(xSignifier) : xSignifier >= 0x40000000000000000000000000000 ? 114 : xSignifier >= 0x20000000000000000000000000000 ? 113 : 112; if (xExponent + msb > yExponent + 16497) { // Overflow xExponent = 0x7FFF; xSignifier = 0; } else if (xExponent + msb + 16380 < yExponent) { // Underflow xExponent = 0; xSignifier = 0; } else if (xExponent + msb + 16268 < yExponent) { // Subnormal if (xExponent + 16380 > yExponent) xSignifier <<= xExponent + 16380 - yExponent; else if (xExponent + 16380 < yExponent) xSignifier >>= yExponent - xExponent - 16380; xExponent = 0; } else { // Normal if (msb > 112) xSignifier >>= msb - 112; xSignifier &= 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF; xExponent = xExponent + msb + 16269 - yExponent; } return bytes16(uint128(uint128((x ^ y) & 0x80000000000000000000000000000000) | (xExponent << 112) | xSignifier)); } } } /** * Get index of the most significant non-zero bit in binary representation of * x. Reverts if x is zero. * * @return index of the most significant non-zero bit in binary representation * of x */ function mostSignificantBit(uint256 x) private pure returns (uint256) { unchecked { require(x > 0); uint256 result = 0; if (x >= 0x100000000000000000000000000000000) { x >>= 128; result += 128; } if (x >= 0x10000000000000000) { x >>= 64; result += 64; } if (x >= 0x100000000) { x >>= 32; result += 32; } if (x >= 0x10000) { x >>= 16; result += 16; } if (x >= 0x100) { x >>= 8; result += 8; } if (x >= 0x10) { x >>= 4; result += 4; } if (x >= 0x4) { x >>= 2; result += 2; } if (x >= 0x2) result += 1; // No need to shift x anymore return result; } } }
// SPDX-License-Identifier: MIT
// Source: // https://gist.github.com/AlmostEfficient/669ac250214f30347097a1aeedcdfa12
pragma solidity ^0.8.29;
library LibString {
/**
* @dev Returns the length of a given string
*
* @param s The string to measure the length of
* @return The length of the input string
*/
function len(string memory s) internal pure returns (uint) {
uint length;
uint i = 0;
uint bytelength = bytes(s).length;
for (length = 0; i < bytelength; length++) {
bytes1 b = bytes(s)[i];
if (b < 0x80) {
i += 1;
} else if (b < 0xE0) {
i += 2;
} else if (b < 0xF0) {
i += 3;
} else if (b < 0xF8) {
i += 4;
} else if (b < 0xFC) {
i += 5;
} else {
i += 6;
}
}
return length;
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.29;
import {IERC20} from "@openzeppelin/contracts/token/ERC20/IERC20.sol";
enum Rarity {
OG,
Plentiful,
Common,
Uncommon,
Rare,
Epic,
Legendary,
Mythic,
Godly,
Handmade
}
enum ActionType {
Transfer,
Stake,
Claim,
Withdraw,
BurnAndRedeem,
ConfirmAction,
RevertAction
}
enum ActionStatus {
Pending,
Success,
Failure
}
struct StakerStorage {
IERC20 stakeToken;
uint256 totalWeight;
uint256 totalMultipliers;
uint256 totalLevels;
uint256 minLockedTime;
uint256 minLockedAmount;
uint256 maxStakeAmount;
uint256 startMergeTokenId;
RewardsData rewardsData;
mapping(uint256 level => uint256 stakedNeeded) levelStakedNeeded;
mapping(uint256 tokenId => NftData nftData) nftData;
mapping(Rarity nftRarity => string uri) nftURI;
mapping(Rarity nftRarity => uint256 multiplier) rarityMultiplier;
mapping(uint256 nftMultiplier => Rarity) nftRarity;
}
struct AirdropData {
uint256 airdropAmount;
uint256 totalWeight;
uint256 totalMultipliers;
uint256 totalLevels;
mapping(uint256 tokenId => uint256) tokenWeight;
mapping(uint256 tokenId => uint256) tokenMultipliers;
}
struct NftData {
uint256 staked;
uint256 nftMultiplier;
LockedData lockedData;
}
struct RewardsData {
uint256 rewardsAmount;
mapping(uint256 tokenId => uint256 claimedAmount) lastClaimedAmount;
}
struct StakerConfig {
uint256[] stakedNeededForLevels;
uint256[] rarityMultipliers;
uint256 minLockedTime;
uint256 minLockedAmount;
uint256 maxStakeAmount;
uint256 startMergeTokenId;
uint256 withdrawFee;
address stakeToken;
ERC721TokenConfig nftConfig;
}
struct ERC721TokenConfig {
string name;
string symbol;
string baseURI;
}
struct LockedData {
uint256 lockedAmount;
uint256 unlockTimestamp;
bool isCurrentLocked;
}
struct ONFTReceipt {
uint256 tokenId;
uint256 amount;
address user;
ActionType actionType;
ActionStatus status;
}
library ONFTSidechainStorage {
struct Layout {
StakerStorage stakerData;
mapping(uint256 airdropId => AirdropData) airdropById;
mapping(address user => bool) isAuthorized;
mapping(bytes32 guid => ONFTReceipt) receipts;
uint256 airdropId;
uint256[] lockedTokens;
uint256 withdrawFee;
uint32 mainChainEid;
}
// keccak256(abi.encode(uint256(keccak256("primefi.storage.onftstakerUpgradrable")) - 1)) & ~bytes32(uint256(0xff))
bytes32 constant STORAGE_SLOT = 0xf2aa4d769a4fdf5e9d792f5551a58444d1a6aaafc110864e9eaa9186e77a8000;
function layout() internal pure returns (Layout storage l) {
assembly {
l.slot := STORAGE_SLOT
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.29;
import {IERC20} from "@openzeppelin/contracts/token/ERC20/IERC20.sol";
enum Rarity {
OG,
Plentiful,
Common,
Uncommon,
Rare,
Epic,
Legendary,
Mythic,
Godly,
Handmade
}
enum ActionType {
Transfer,
Stake,
Claim,
Withdraw,
BurnAndRedeem,
ConfirmAction,
RevertAction
}
enum ActionStatus {
Pending,
Success,
Failure
}
struct StakerStorage {
uint256 totalWeight;
uint256 totalMultipliers;
uint256 totalLevels;
uint256 minLockedTime;
uint256 minLockedAmount;
uint256 maxStakeAmount;
uint256 startMergeTokenId;
uint256 withdrawFee;
IERC20 stakeToken;
RewardsData rewardsData;
mapping(uint256 level => uint256 stakedNeeded) levelStakedNeeded;
mapping(uint256 tokenId => NftData nftData) nftData;
mapping(Rarity nftRarity => uint256 multiplier) rarityMultiplier;
mapping(uint256 nftMultiplier => Rarity) nftRarity;
}
struct AirdropData {
uint256 airdropAmount;
uint256 totalWeight;
uint256 totalMultipliers;
uint256 totalLevels;
mapping(uint256 tokenId => uint256) tokenWeight;
mapping(uint256 tokenId => uint256) tokenMultipliers;
}
struct NftData {
uint256 staked;
uint256 nftMultiplier;
LockedData lockedData;
}
struct RewardsData {
uint256 rewardsAmount;
mapping(uint256 tokenId => uint256 claimedAmount) lastClaimedAmount;
}
struct StakerConfig {
uint256[] stakedNeededForLevels;
uint256[] rarityMultipliers;
uint256 minLockedTime;
uint256 minLockedAmount;
uint256 maxStakeAmount;
uint256 startMergeTokenId;
uint256 withdrawFee;
address stakeToken;
ERC721TokenConfig nftConfig;
}
struct ERC721TokenConfig {
string name;
string symbol;
string baseURI;
}
struct LockedData {
uint256 initialVestingAmount;
uint256 initialUnlockTimestamp;
uint256 lockedAmount;
uint256 unlockTimestamp;
bool isCurrentLocked;
}
struct ONFTReceipt {
uint256 tokenId;
uint256 amount;
address user;
ActionType actionType;
ActionStatus status;
}
library ONFTStakerStorage {
struct Layout {
StakerStorage stakerData;
mapping(uint256 airdropId => AirdropData) airdropById;
mapping(address user => bool) isAuthorized;
mapping(bytes32 guid => ONFTReceipt) receipts;
uint256[] lockedTokens;
uint256 airdropId;
uint256 mainChainEid;
}
// keccak256(abi.encode(uint256(keccak256("primefi.storage.onftstakerUpgradrable")) - 1)) & ~bytes32(uint256(0xff))
bytes32 constant STORAGE_SLOT = 0xf2aa4d769a4fdf5e9d792f5551a58444d1a6aaafc110864e9eaa9186e77a8000;
function layout() internal pure returns (Layout storage l) {
assembly {
l.slot := STORAGE_SLOT
}
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.29;
import {
ONFT721Enumerable,
ERC721MetadataStorage
} from "@primenumberslabs/layerzero-v2-upgradeable/contracts/oapp/onft721/ONFT721Enumerable.sol";
import {Pausable} from "@solidstate/contracts/security/pausable/Pausable.sol";
import {SendParam, MessagingFee} from "@primenumberslabs/layerzero-v2-upgradeable/contracts/oapp/onft721/interfaces/IONFT721.sol";
import {OptionsBuilder} from "@primenumberslabs/layerzero-v2-upgradeable/contracts/oapp/oapp/libs/OptionsBuilder.sol";
import {Origin, MessagingReceipt} from "@primenumberslabs/layerzero-v2-upgradeable/contracts/protocol/interfaces/ILayerZeroEndpointV2.sol";
import {IOFT} from "@layerzerolabs/lz-evm-oapp-v2/contracts/oft/interfaces/IOFT.sol";
import {ERC721Metadata, IERC721Metadata} from "@solidstate/contracts/token/ERC721/metadata/ERC721Metadata.sol";
import {ReentrancyGuard} from "@solidstate/contracts/security/reentrancy_guard/ReentrancyGuard.sol";
import {Context} from "@openzeppelin/contracts/utils/Context.sol";
import {SafeERC20} from "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";
import {IERC20} from "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import {LibString} from "./libs/LibString.sol";
import {ABDKMathQuad} from "./libs/ABDKMathQuad.sol";
import {ONFTComposeMsgCodec} from "@primenumberslabs/layerzero-v2-upgradeable/contracts/oapp/libs/ONFTComposeMsgCodec.sol";
import {Strings} from "@openzeppelin/contracts/utils/Strings.sol";
import "./interfaces/IStaker.sol";
import "./libs/ONFTStakerStorage.sol";
/**
* @title ONFTStaker Contract
* @author PrimeFinance - @rodaemonic
*/
contract ONFTMainchain is ONFT721Enumerable, ReentrancyGuard, Pausable, Context {
using ONFTStakerStorage for ONFTStakerStorage.Layout;
using ERC721MetadataStorage for ERC721MetadataStorage.Layout;
using LibString for string;
using Strings for uint256;
using ABDKMathQuad for bytes16;
using SafeERC20 for IERC20;
using OptionsBuilder for bytes;
event StakeInNFT(uint256 tokenId, uint256 stakeAmount);
error Unauthorized();
error InvalidTokenId();
error AlreadyInitialized();
error InvalidRarity();
error MaxStakeAmountReached();
error InsufficientValueForFee();
uint256 constant WHOLE = 1e18;
uint128 constant MAX_GAS_LIMIT = 1000000;
modifier onlyAuthorized() {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
require($.isAuthorized[_msgSender()], Unauthorized());
_;
}
function initialize(
StakerConfig memory config,
address _lzEndpoint,
address _delegate,
address[] memory authorizedAddresses
) external initializer {
__ONFT721Enumerable_init(config.nftConfig.name, config.nftConfig.symbol, _lzEndpoint, _delegate);
_init_staker(config, authorizedAddresses);
}
function mint(address to, uint256 tokenId, uint256 staked, uint256 nftMultiplier) external onlyAuthorized whenNotPaused {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage s = $.stakerData;
require(s.nftData[tokenId].staked == 0, InvalidTokenId());
require(s.nftData[tokenId].nftMultiplier == 0, InvalidRarity());
require(staked <= s.maxStakeAmount, MaxStakeAmountReached());
_mint(to, tokenId);
NftData storage nftData = s.nftData[tokenId];
nftData.nftMultiplier = nftMultiplier;
if (staked > 0) {
LockedData storage lockedData = nftData.lockedData;
IStaker staker = IStaker(address(this));
nftData.staked = staked;
lockedData.initialVestingAmount = staked;
lockedData.initialUnlockTimestamp = block.timestamp + (1 days * 365); // 1 year lock
uint256 level = staker.checkLevel(staked);
uint256 weight = staker.calcWeight(staked, nftMultiplier + level);
s.totalWeight += weight;
s.totalMultipliers += nftMultiplier;
s.totalLevels += level;
emit StakeInNFT(tokenId, staked);
}
}
function burn(uint256 tokenId) external whenNotPaused {
require(_msgSender() == address(this), Unauthorized());
_burn(tokenId);
}
function mint(address to, uint256 tokenId) external whenNotPaused {
require(_msgSender() == address(this), Unauthorized());
_mint(to, tokenId);
}
function send(
SendParam calldata _sendParam,
MessagingFee calldata _fee,
address _refundAddress
) external payable override returns (MessagingReceipt memory msgReceipt) {
_debit(msg.sender, _sendParam.tokenId, _sendParam.dstEid);
bytes memory options = OptionsBuilder.newOptions().addExecutorLzReceiveOption(MAX_GAS_LIMIT, 0);
bytes memory transferPayload = abi.encode(_sendParam.to, _sendParam.tokenId);
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage stakerData = $.stakerData;
NftData storage nftData = stakerData.nftData[_sendParam.tokenId];
bytes memory nftDataEncoded = abi.encode(nftData.staked, nftData.nftMultiplier, nftData.lockedData);
bytes memory actionData = abi.encode(transferPayload, nftDataEncoded);
bytes memory message = abi.encode(ActionType.Transfer, actionData);
// @dev Sends the message to the LayerZero Endpoint, returning the MessagingReceipt.
msgReceipt = _lzSend(_sendParam.dstEid, message, options, _fee, _refundAddress);
emit ONFTSent(msgReceipt.guid, _sendParam.dstEid, msg.sender, _sendParam.tokenId);
}
/**
* @dev Internal function to handle the receive on the LayerZero endpoint.
* @param _origin The origin information.
* - srcEid: The source chain endpoint ID.
* - sender: The sender address from the src chain.
* - nonce: The nonce of the LayerZero message.
* @param _guid The unique identifier for the received LayerZero message.
* @param _message The encoded message.
* @dev _executor The address of the executor.
* @dev _extraData Additional data.
*/
function _lzReceive(
Origin calldata _origin,
bytes32 _guid,
bytes calldata _message,
address /*_executor*/, // @dev unused in the default implementation.
bytes calldata /*_extraData*/ // @dev unused in the default implementation.
) internal virtual override {
(ActionType actionType, bytes memory actionData) = abi.decode(_message, (ActionType, bytes));
if (actionType == ActionType.Transfer) {
_makeTransfer(_origin, _guid, actionData);
} else if (actionType == ActionType.Stake) {
(uint256 tokenId, uint256 amount) = abi.decode(actionData, (uint256, uint256));
try IStaker(address(this)).stake(tokenId, amount) {
_sendResponseToSideChain(
_guid,
_origin.srcEid,
tokenId,
ActionStatus.Success,
ActionType.ConfirmAction,
abi.encode(tokenId)
);
} catch {
_sendResponseToSideChain(_guid, _origin.srcEid, tokenId, ActionStatus.Failure, ActionType.RevertAction, "0x");
}
} else if (actionType == ActionType.Claim) {
(uint256 tokenId) = abi.decode(actionData, (uint256));
try IStaker(address(this)).claim(tokenId) returns (uint256 claimedRewards) {
_sendResponseToSideChain(
_guid,
_origin.srcEid,
tokenId,
ActionStatus.Success,
ActionType.ConfirmAction,
abi.encode(claimedRewards)
);
} catch {
_sendResponseToSideChain(_guid, _origin.srcEid, tokenId, ActionStatus.Failure, ActionType.RevertAction, "0x");
}
} else if (actionType == ActionType.Withdraw) {
(uint256 tokenId, uint256 amount) = abi.decode(actionData, (uint256, uint256));
try IStaker(address(this)).withdraw(tokenId, amount) returns (uint256 amountToWithdraw) {
_sendResponseToSideChain(
_guid,
_origin.srcEid,
tokenId,
ActionStatus.Success,
ActionType.ConfirmAction,
abi.encode(amountToWithdraw)
);
} catch {
_sendResponseToSideChain(_guid, _origin.srcEid, tokenId, ActionStatus.Failure, ActionType.RevertAction, "0x");
}
} else if (actionType == ActionType.BurnAndRedeem) {
(uint256 tokenId) = abi.decode(actionData, (uint256));
try IStaker(address(this)).burnAndRedeem(tokenId) {
uint256 nftStaked = ONFTStakerStorage.layout().stakerData.nftData[tokenId].staked;
_sendResponseToSideChain(
_guid,
_origin.srcEid,
tokenId,
ActionStatus.Success,
ActionType.ConfirmAction,
abi.encode(nftStaked)
);
} catch {
_sendResponseToSideChain(_guid, _origin.srcEid, tokenId, ActionStatus.Failure, ActionType.RevertAction, "0x");
}
}
}
function _makeTransfer(Origin calldata _origin, bytes32 _guid, bytes memory _message) internal {
(bytes memory transferMessage, ) = abi.decode(_message, (bytes, NftData));
(bytes32 to, uint256 tokenId) = abi.decode(transferMessage, (bytes32, uint256));
address toAddress = address(uint160(uint256(to)));
_credit(toAddress, tokenId, _origin.srcEid);
emit ONFTReceived(_guid, _origin.srcEid, toAddress, tokenId);
}
function _sendResponseToSideChain(
bytes32 guid,
uint32 dstEid,
uint256 tokenId,
ActionStatus status,
ActionType actionType,
bytes memory message
) internal returns (bytes32) {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
bytes memory options = OptionsBuilder.newOptions().addExecutorLzReceiveOption(MAX_GAS_LIMIT, 0);
bytes memory payload = abi.encode(guid, message);
bytes memory sendMessage = abi.encode(actionType, payload);
MessagingFee memory fee = _quote(dstEid, sendMessage, options, false);
require(msg.value >= fee.nativeFee, InsufficientValueForFee());
MessagingReceipt memory msgReceipt = _lzSend(dstEid, sendMessage, options, fee, address(this));
ONFTReceipt storage receipt = $.receipts[guid];
receipt.tokenId = tokenId;
receipt.actionType = actionType;
receipt.status = status;
receipt.user = _msgSender();
return msgReceipt.guid;
}
function _init_staker(StakerConfig memory config, address[] memory authorizedAddresses) internal {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage stakerData = $.stakerData;
require(stakerData.stakeToken == IERC20(address(0)), AlreadyInitialized());
stakerData.minLockedTime = config.minLockedTime;
stakerData.minLockedAmount = config.minLockedAmount;
stakerData.maxStakeAmount = config.maxStakeAmount;
stakerData.startMergeTokenId = config.startMergeTokenId;
stakerData.withdrawFee = config.withdrawFee;
ERC721MetadataStorage.layout().baseURI = config.nftConfig.baseURI;
for (uint256 i; i < config.stakedNeededForLevels.length; i++) {
stakerData.levelStakedNeeded[i] = config.stakedNeededForLevels[i];
}
for (uint256 i; i < config.rarityMultipliers.length; i++) {
stakerData.rarityMultiplier[Rarity(i)] = config.rarityMultipliers[i];
stakerData.nftRarity[i] = Rarity(i);
}
stakerData.stakeToken = IERC20(config.stakeToken);
mapping(address => bool) storage isAuthorized = $.isAuthorized;
for (uint256 i; i < authorizedAddresses.length; i++) {
isAuthorized[authorizedAddresses[i]] = true;
}
}
function tokenURI(uint256 tokenId) public view override(ERC721Metadata, IERC721Metadata) returns (string memory) {
_exists(tokenId);
StakerStorage storage s = ONFTStakerStorage.layout().stakerData;
NftData storage nftData = s.nftData[tokenId];
uint256 nftRarity = uint256(s.nftRarity[nftData.nftMultiplier]);
string memory baseUri = _baseURI();
if (tokenId <= 4111) {
return string(abi.encodePacked(baseUri, tokenId.toString(), ".json"));
} else if (tokenId > 4111 && tokenId <= 9999) {
return string(abi.encodePacked(baseUri, nftData.nftMultiplier.toString(), "og.json"));
}
return string(abi.encodePacked(baseUri, nftRarity.toString(), ".json"));
}
}// SPDX-License-Identifier: MIT
pragma solidity ^0.8.29;
import {ERC721MetadataStorage} from "@primenumberslabs/layerzero-v2-upgradeable/contracts/oapp/onft721/ONFT721Enumerable.sol";
import {Context} from "@openzeppelin/contracts/utils/Context.sol";
import {SafeERC20} from "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";
import {IERC20} from "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import {Strings} from "@openzeppelin/contracts/utils/Strings.sol";
import {ONFTComposeMsgCodec} from "@primenumberslabs/layerzero-v2-upgradeable/contracts/oapp/libs/ONFTComposeMsgCodec.sol";
import {ONFT721Enumerable} from "@primenumberslabs/layerzero-v2-upgradeable/contracts/oapp/onft721/ONFT721Enumerable.sol";
import {OptionsBuilder} from "@primenumberslabs/layerzero-v2-upgradeable/contracts/oapp/oapp/libs/OptionsBuilder.sol";
import {Origin, MessagingReceipt} from "@primenumberslabs/layerzero-v2-upgradeable/contracts/protocol/interfaces/ILayerZeroEndpointV2.sol";
import {Pausable} from "@solidstate/contracts/security/pausable/Pausable.sol";
import {ReentrancyGuard} from "@solidstate/contracts/security/reentrancy_guard/ReentrancyGuard.sol";
import {ERC721Metadata, IERC721Metadata} from "@solidstate/contracts/token/ERC721/metadata/ERC721Metadata.sol";
import {SendParam, MessagingFee} from "@primenumberslabs/layerzero-v2-upgradeable/contracts/oapp/onft721/interfaces/IONFT721.sol";
import {LibString} from "./libs/LibString.sol";
import {ABDKMathQuad} from "./libs/ABDKMathQuad.sol";
import "./libs/ONFTSidechainStorage.sol";
/**
* @title ONFTSidechain Contract
* @author PrimeFinance - @rodaemonic
*/
contract ONFTSidechain is ONFT721Enumerable, ReentrancyGuard, Pausable, Context {
using LibString for string;
using ABDKMathQuad for bytes16;
using Strings for uint256;
using SafeERC20 for IERC20;
using OptionsBuilder for bytes;
using ERC721MetadataStorage for ERC721MetadataStorage.Layout;
using ONFTSidechainStorage for ONFTSidechainStorage.Layout;
event StakedRequest(address indexed user, bytes32 indexed guid, uint256 indexed tokenId, uint256 stakeAmount);
event ClaimRequest(address indexed user, bytes32 indexed guid, uint256 indexed tokenId);
event WithdrawRequest(address indexed user, bytes32 indexed guid, uint256 indexed tokenId, uint256 withdrawAmount);
event BurnAndRedeemRequest(address indexed user, bytes32 indexed guid, uint256 indexed tokenId);
event ConfirmAction(bytes32 indexed guid, ActionType indexed actionType);
event RevertAction(bytes32 indexed guid, ActionType indexed actionType);
error AlreadyInitialized();
error Unauthorized();
error InsufficientValueForFee();
error InvalidOwner();
error ActionAlreadyConfirmedOrReverted();
uint256 constant WHOLE = 1e18;
uint128 public constant MAX_GAS_LIMIT = 1_000_000;
modifier onlyAuthorized() {
ONFTSidechainStorage.Layout storage s = ONFTSidechainStorage.layout();
require(s.isAuthorized[_msgSender()], Unauthorized());
_;
}
function initialize(
StakerConfig memory config,
address _lzEndpoint,
address _delegate,
address[] memory authorizedAddresses
) external initializer {
__ONFT721Enumerable_init(config.nftConfig.name, config.nftConfig.symbol, _lzEndpoint, _delegate);
_init_staker(config, authorizedAddresses);
}
function _init_staker(StakerConfig memory config, address[] memory authorizedAddresses) internal {
ONFTSidechainStorage.Layout storage $ = ONFTSidechainStorage.layout();
StakerStorage storage stakerData = $.stakerData;
require(stakerData.stakeToken == IERC20(address(0)), AlreadyInitialized());
stakerData.minLockedTime = config.minLockedTime;
stakerData.minLockedAmount = config.minLockedAmount;
stakerData.maxStakeAmount = config.maxStakeAmount;
ERC721MetadataStorage.layout().baseURI = config.nftConfig.baseURI;
for (uint256 i; i < config.stakedNeededForLevels.length; i++) {
stakerData.levelStakedNeeded[i] = config.stakedNeededForLevels[i];
}
for (uint256 i; i < config.rarityMultipliers.length; i++) {
stakerData.rarityMultiplier[Rarity(i)] = config.rarityMultipliers[i];
stakerData.nftRarity[i] = Rarity(i);
}
stakerData.stakeToken = IERC20(config.stakeToken);
mapping(address => bool) storage isAuthorized = $.isAuthorized;
for (uint256 i; i < authorizedAddresses.length; i++) {
isAuthorized[authorizedAddresses[i]] = true;
}
}
function sendStake(uint256 tokenId, uint256 stakeAmount) external payable nonReentrant whenNotPaused {
ONFTSidechainStorage.Layout storage $ = ONFTSidechainStorage.layout();
StakerStorage storage stakerData = $.stakerData;
require(_ownerOf(tokenId) == _msgSender(), InvalidOwner());
stakerData.stakeToken.safeTransferFrom(_msgSender(), address(this), stakeAmount);
bytes memory actionData = abi.encode(tokenId, stakeAmount);
bytes memory payload = abi.encode(ActionType.Stake, actionData);
bytes32 guid = _sendToMainChain($.mainChainEid, tokenId, payload);
$.receipts[guid].amount = stakeAmount;
emit StakedRequest(_msgSender(), guid, tokenId, stakeAmount);
}
function requestClaimRewards(uint256 tokenId) external payable nonReentrant whenNotPaused {
ONFTSidechainStorage.Layout storage $ = ONFTSidechainStorage.layout();
require(_ownerOf(tokenId) == _msgSender(), InvalidOwner());
bytes memory actionData = abi.encode(tokenId);
bytes memory payload = abi.encode(ActionType.Claim, actionData);
bytes32 guid = _sendToMainChain($.mainChainEid, tokenId, payload);
emit ClaimRequest(_msgSender(), guid, tokenId);
}
function requestWithdrawStaked(uint256 tokenId, uint256 withdrawAmount) external payable nonReentrant whenNotPaused {
ONFTSidechainStorage.Layout storage $ = ONFTSidechainStorage.layout();
require(_ownerOf(tokenId) == _msgSender(), InvalidOwner());
bytes memory actionData = abi.encode(tokenId, withdrawAmount);
bytes memory payload = abi.encode(ActionType.Withdraw, actionData);
bytes32 guid = _sendToMainChain($.mainChainEid, tokenId, payload);
$.receipts[guid].amount = withdrawAmount;
emit WithdrawRequest(_msgSender(), guid, tokenId, withdrawAmount);
}
function requestBurnAndRedeem(uint256 tokenId) external payable nonReentrant whenNotPaused {
ONFTSidechainStorage.Layout storage $ = ONFTSidechainStorage.layout();
require(_ownerOf(tokenId) == _msgSender(), InvalidOwner());
_safeTransferFrom(_msgSender(), address(this), tokenId);
bytes memory actionData = abi.encode(tokenId);
bytes memory payload = abi.encode(ActionType.BurnAndRedeem, actionData);
bytes32 guid = _sendToMainChain($.mainChainEid, tokenId, payload);
emit BurnAndRedeemRequest(_msgSender(), guid, tokenId);
}
function send(
SendParam calldata _sendParam,
MessagingFee calldata _fee,
address _refundAddress
) external payable override returns (MessagingReceipt memory msgReceipt) {
_debit(msg.sender, _sendParam.tokenId, _sendParam.dstEid);
bytes memory options = OptionsBuilder.newOptions().addExecutorLzReceiveOption(MAX_GAS_LIMIT, 0);
bytes memory transferPayload = abi.encode(_sendParam.to, _sendParam.tokenId);
ONFTSidechainStorage.Layout storage $ = ONFTSidechainStorage.layout();
StakerStorage storage stakerData = $.stakerData;
NftData storage nftData = stakerData.nftData[_sendParam.tokenId];
bytes memory nftDataEncoded = abi.encode(nftData.staked, nftData.nftMultiplier, nftData.lockedData);
bytes memory actionData = abi.encode(transferPayload, nftDataEncoded);
bytes memory message = abi.encode(ActionType.Transfer, actionData);
// @dev Sends the message to the LayerZero Endpoint, returning the MessagingReceipt.
msgReceipt = _lzSend(_sendParam.dstEid, message, options, _fee, _refundAddress);
emit ONFTSent(msgReceipt.guid, _sendParam.dstEid, msg.sender, _sendParam.tokenId);
}
/**
* @dev Internal function to handle the receive on the LayerZero endpoint.
* @param _origin The origin information.
* - srcEid: The source chain endpoint ID.
* - sender: The sender address from the src chain.
* - nonce: The nonce of the LayerZero message.
* @param _guid The unique identifier for the received LayerZero message.
* @param _message The encoded message.
* @dev _executor The address of the executor.
* @dev _extraData Additional data.
*/
function _lzReceive(
Origin calldata _origin,
bytes32 _guid,
bytes calldata _message,
address /*_executor*/, // @dev unused in the default implementation.
bytes calldata /*_extraData*/ // @dev unused in the default implementation.
) internal virtual override {
(ActionType actionType, bytes memory actionData) = abi.decode(_message, (ActionType, bytes));
if (actionType == ActionType.Transfer) {
_makeTransfer(_origin, _guid, actionData);
} else if (actionType == ActionType.ConfirmAction) {
(bytes32 guidToConfirm, bytes memory confirmationData) = abi.decode(actionData, (bytes32, bytes));
_confirmAction(guidToConfirm, confirmationData);
} else if (actionType == ActionType.RevertAction) {
(bytes32 guidToRevert, ) = abi.decode(actionData, (bytes32, bytes));
_revertAction(guidToRevert);
}
}
function _makeTransfer(Origin memory _origin, bytes32 _guid, bytes memory _message) internal {
(bytes memory transferMessage, NftData memory receivedNftData) = abi.decode(_message, (bytes, NftData));
(bytes32 to, uint256 tokenId) = abi.decode(transferMessage, (bytes32, uint256));
address toAddress = address(uint160(uint256(to)));
_credit(toAddress, tokenId, _origin.srcEid);
ONFTSidechainStorage.Layout storage $ = ONFTSidechainStorage.layout();
StakerStorage storage stakerData = $.stakerData;
NftData storage nftData = stakerData.nftData[tokenId];
nftData.staked = receivedNftData.staked;
nftData.nftMultiplier = receivedNftData.nftMultiplier;
nftData.lockedData = receivedNftData.lockedData;
emit ONFTReceived(_guid, _origin.srcEid, toAddress, tokenId);
}
function _sendToMainChain(uint32 dstEid, uint256 tokenId, bytes memory payload) internal returns (bytes32) {
ONFTSidechainStorage.Layout storage $ = ONFTSidechainStorage.layout();
bytes memory options = OptionsBuilder.newOptions().addExecutorLzReceiveOption(MAX_GAS_LIMIT, 0);
MessagingFee memory fee = _quote(dstEid, payload, options, false);
require(msg.value >= fee.nativeFee, InsufficientValueForFee());
MessagingReceipt memory msgReceipt = _lzSend(dstEid, payload, options, fee, address(this));
ONFTReceipt storage receipt = $.receipts[msgReceipt.guid];
receipt.tokenId = tokenId;
receipt.actionType = ActionType.Claim;
receipt.status = ActionStatus.Pending;
receipt.user = _msgSender();
return msgReceipt.guid;
}
function _confirmAction(bytes32 guidToConfirm, bytes memory confirmationData) internal {
ONFTSidechainStorage.Layout storage $ = ONFTSidechainStorage.layout();
StakerStorage storage stakerData = $.stakerData;
IERC20 stakeToken = stakerData.stakeToken;
ONFTReceipt storage receipt = $.receipts[guidToConfirm];
uint256 tokenId = receipt.tokenId;
NftData storage nftData = stakerData.nftData[tokenId];
require(receipt.status == ActionStatus.Pending, ActionAlreadyConfirmedOrReverted());
receipt.status = ActionStatus.Success;
if (receipt.actionType == ActionType.Withdraw) {
(uint256 amountToWithdraw) = abi.decode(confirmationData, (uint256));
stakeToken.safeTransfer(receipt.user, amountToWithdraw);
nftData.staked -= receipt.amount;
} else if (receipt.actionType == ActionType.Claim) {
(uint256 amountToTransfer) = abi.decode(confirmationData, (uint256));
stakeToken.safeTransfer(receipt.user, amountToTransfer);
} else if (receipt.actionType == ActionType.BurnAndRedeem) {
(uint256 amountToTransfer) = abi.decode(confirmationData, (uint256));
_burn(tokenId);
nftData.staked = 0;
nftData.nftMultiplier = 0;
nftData.lockedData = LockedData({lockedAmount: 0, unlockTimestamp: 0, isCurrentLocked: false});
stakeToken.safeTransfer(receipt.user, amountToTransfer);
}
emit ConfirmAction(guidToConfirm, receipt.actionType);
}
function _revertAction(bytes32 guidToRevert) internal {
ONFTSidechainStorage.Layout storage $ = ONFTSidechainStorage.layout();
ONFTReceipt storage receipt = $.receipts[guidToRevert];
receipt.status = ActionStatus.Failure;
if (receipt.actionType == ActionType.Stake) {
StakerStorage storage stakerData = $.stakerData;
stakerData.stakeToken.safeTransfer(receipt.user, receipt.amount);
}
emit RevertAction(guidToRevert, receipt.actionType);
}
function tokenURI(uint256 tokenId) public view override(ERC721Metadata, IERC721Metadata) returns (string memory) {
_exists(tokenId);
StakerStorage storage s = ONFTSidechainStorage.layout().stakerData;
NftData storage nftData = s.nftData[tokenId];
uint256 nftRarity = uint256(s.nftRarity[nftData.nftMultiplier]);
string memory baseUri = _baseURI();
if (tokenId <= 4111) {
return string(abi.encodePacked(baseUri, tokenId.toString(), ".json"));
} else if (tokenId > 4111 && tokenId <= 9999) {
return string(abi.encodePacked(baseUri, nftData.nftMultiplier.toString(), "og.json"));
}
return string(abi.encodePacked(baseUri, nftRarity.toString(), ".json"));
}
}// SPDX-License-Identifier: SEE LICENSE IN LICENSE
pragma solidity ^0.8.29;
import {ReentrancyGuard} from "@solidstate/contracts/security/reentrancy_guard/ReentrancyGuard.sol";
import {Pausable} from "@solidstate/contracts/security/pausable/Pausable.sol";
import {Context} from "@openzeppelin/contracts/utils/Context.sol";
import {ABDKMathQuad} from "./libs/ABDKMathQuad.sol";
import {IERC721MintBurn} from "./interfaces/IERC721MintBurn.sol";
import {SafeERC20} from "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";
import "./libs/ONFTStakerStorage.sol";
// The Staker contract will implement the staking functionality for the ONFT (On-Chain Non-Fungible Token).
// It will handle staking, claiming rewards, and managing the state of staked tokens.
// State variables and mappings will be defined here to manage the staking logic.
// Functions for staking, claiming rewards, and other actions will be implemented here.
// Events will be emitted to notify about important actions like staking, claiming, etc.
contract Staker is ReentrancyGuard, Pausable, Context {
using ONFTStakerStorage for ONFTStakerStorage.Layout;
using SafeERC20 for IERC20;
event NFTsMerged(uint256 tokenId1, uint256 tokenId2, uint256 newTokenId);
event Airdrop(uint256 airdropAmount);
event RewardsClaimed(uint256 tokenId, uint256 claimedAmount);
event NFTLocked(uint256 tokenId, uint256 lockTimestamp);
event NFTUnlocked(uint256 tokenId, uint256 unlockTimestamp);
event StakeInNFT(uint256 tokenId, uint256 stakeAmount);
event BurnAndRedeem(uint256 tokenId);
event BurnedV2Token(address stakerV2, uint256 tokenId);
event WithdrawStaked(uint256 tokenId, uint256 withdrawAmount, uint256 feeAmount);
event LockedTokenRewardClaimed(uint256 tokenId, uint256 claimedAmount);
error Unauthorized();
error InvalidTokenId();
error InvalidTokenOwner();
error InvalidStakeAmount();
error TokenLocked();
error NotEnoughStaked();
error NothingToClaim();
error AlreadyInitialized();
error InvalidRarity();
error TokenHasPendingClaim();
error MaximumRarityReached();
error TokenCannotBeMerged();
error InsufficientBalance();
error MaxStakeAmountReached();
error InsufficientValueForFee();
uint256 constant WHOLE = 1e18;
function airdrop(uint256 rewardAmount) external payable nonReentrant {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage s = $.stakerData;
IERC20 stakeToken = s.stakeToken;
address from = _msgSender();
IERC20(stakeToken).safeTransferFrom(from, address(this), rewardAmount);
$.airdropId++;
uint256 airdropId = $.airdropId;
s.rewardsData.rewardsAmount += rewardAmount;
AirdropData storage airdropData = $.airdropById[airdropId];
airdropData.airdropAmount = s.rewardsData.rewardsAmount;
airdropData.totalWeight = s.totalWeight;
airdropData.totalMultipliers = s.totalMultipliers;
airdropData.totalLevels = s.totalLevels;
emit Airdrop(rewardAmount);
}
function burnAndRedeem(uint256 tokenId) public nonReentrant whenNotPaused returns (uint256 nftStaked) {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage s = $.stakerData;
NftData storage nftData = s.nftData[tokenId];
address sender = _msgSender();
IERC20 stakeToken = s.stakeToken;
IERC721MintBurn erc721 = IERC721MintBurn(address(this));
require(erc721.ownerOf(tokenId) == sender || sender == address(this), InvalidTokenOwner());
require(!nftData.lockedData.isCurrentLocked, TokenLocked());
nftStaked = nftData.staked;
uint256 nftLevel = checkLevel(nftStaked);
uint256 nftWeight = calcWeight(nftStaked, nftData.nftMultiplier + nftLevel);
s.totalWeight -= nftWeight;
s.totalMultipliers -= nftData.nftMultiplier;
s.totalLevels -= nftLevel;
delete s.nftData[tokenId];
if (sender != address(this)) {
erc721.burn(tokenId);
stakeToken.safeTransfer(sender, nftStaked);
}
emit BurnAndRedeem(tokenId);
}
function merge(uint256 tokenId1, uint256 tokenId2) external nonReentrant whenNotPaused returns (uint256 newTokenId) {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage s = $.stakerData;
address sender = _msgSender();
IERC721MintBurn erc721 = IERC721MintBurn(address(this));
require(erc721.ownerOf(tokenId1) == sender && erc721.ownerOf(tokenId2) == sender, InvalidTokenOwner());
require(tokenId1 != tokenId2, InvalidTokenId());
NftData storage nftData1 = s.nftData[tokenId1];
NftData storage nftData2 = s.nftData[tokenId2];
require(nftData1.nftMultiplier == nftData2.nftMultiplier, InvalidRarity());
mapping(uint256 => uint256) storage lastClaimedAmount = s.rewardsData.lastClaimedAmount;
require(
lastClaimedAmount[tokenId1] == lastClaimedAmount[tokenId2] && lastClaimedAmount[tokenId1] == s.rewardsData.rewardsAmount,
TokenHasPendingClaim()
);
require(nftData1.nftMultiplier != s.rarityMultiplier[Rarity(Rarity.Godly)], MaximumRarityReached());
require(nftData1.staked + nftData2.staked <= s.maxStakeAmount, MaxStakeAmountReached());
erc721.burn(tokenId1);
erc721.burn(tokenId2);
uint256 tokensWeight = calcWeight(
nftData1.staked + nftData2.staked,
nftData1.nftMultiplier + checkLevel(nftData1.staked) + nftData2.nftMultiplier + checkLevel(nftData2.staked)
);
uint256 tokenLevels = checkLevel(nftData1.staked) + checkLevel(nftData2.staked);
s.totalWeight -= tokensWeight;
s.totalMultipliers -= nftData1.nftMultiplier + nftData2.nftMultiplier;
s.totalLevels -= tokenLevels;
newTokenId = s.startMergeTokenId++;
erc721.mint(sender, newTokenId);
NftData storage newNftData = s.nftData[newTokenId];
newNftData.staked = nftData1.staked + nftData2.staked;
newNftData.nftMultiplier = s.rarityMultiplier[Rarity(uint8(s.nftRarity[nftData1.nftMultiplier]) + 1)];
s.rewardsData.lastClaimedAmount[newTokenId] = s.rewardsData.rewardsAmount;
uint256 mergeWeight = calcWeight(newNftData.staked, newNftData.nftMultiplier + checkLevel(newNftData.staked));
uint256 mergeLevels = checkLevel(newNftData.staked);
s.totalWeight += mergeWeight;
s.totalMultipliers += newNftData.nftMultiplier;
s.totalLevels += mergeLevels;
_setTokenForAirdrop(newTokenId);
delete s.nftData[tokenId1];
delete s.nftData[tokenId2];
emit NFTsMerged(tokenId1, tokenId2, newTokenId);
}
function stake(uint256 tokenId, uint256 amount) public whenNotPaused {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage s = $.stakerData;
IERC721MintBurn erc721 = IERC721MintBurn(address(this));
require(erc721.ownerOf(tokenId) != address(0), InvalidTokenId());
NftData storage nftData = s.nftData[tokenId];
LockedData storage lockedData = nftData.lockedData;
address from = _msgSender();
if (from != address(this)) {
IERC20 stakeToken = s.stakeToken;
stakeToken.safeTransferFrom(from, address(this), amount);
}
require(!lockedData.isCurrentLocked, TokenLocked());
require(nftData.staked + amount <= s.maxStakeAmount, MaxStakeAmountReached());
_setTokenForAirdrop(tokenId);
if (nftData.staked == 0) {
s.rewardsData.lastClaimedAmount[tokenId] = s.rewardsData.rewardsAmount;
s.totalMultipliers += nftData.nftMultiplier;
}
uint256 levelBefore = checkLevel(nftData.staked);
uint256 weightBefore = calcWeight(nftData.staked, nftData.nftMultiplier + levelBefore);
nftData.staked += amount;
uint256 levelAfter = checkLevel(nftData.staked);
uint256 weightAfter = calcWeight(nftData.staked, nftData.nftMultiplier + levelAfter);
s.totalWeight += weightAfter - weightBefore;
s.totalLevels += levelAfter - levelBefore;
emit StakeInNFT(tokenId, amount);
}
function lockNFT(uint256 tokenId) external whenNotPaused {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage s = $.stakerData;
address sender = _msgSender();
IERC721MintBurn erc721 = IERC721MintBurn(address(this));
require(erc721.ownerOf(tokenId) == sender, InvalidTokenOwner());
NftData storage nftData = s.nftData[tokenId];
LockedData storage lockedData = nftData.lockedData;
require(nftData.staked > s.minLockedAmount, NotEnoughStaked());
require(!lockedData.isCurrentLocked, TokenLocked());
uint256 unlockTimestamp = block.timestamp + s.minLockedTime;
lockedData.unlockTimestamp = unlockTimestamp;
lockedData.isCurrentLocked = true;
$.lockedTokens.push(tokenId);
emit NFTLocked(tokenId, unlockTimestamp);
}
function unlockNFT(uint256 tokenId) external whenNotPaused {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage s = $.stakerData;
address sender = _msgSender();
IERC721MintBurn erc721 = IERC721MintBurn(address(this));
require(erc721.ownerOf(tokenId) == sender, InvalidTokenOwner());
NftData storage nftData = s.nftData[tokenId];
LockedData storage lockedData = nftData.lockedData;
require(lockedData.isCurrentLocked, TokenLocked());
require(lockedData.unlockTimestamp <= block.timestamp, TokenLocked());
lockedData.isCurrentLocked = false;
emit NFTUnlocked(tokenId, block.timestamp);
}
function withdraw(uint256 tokenId, uint256 amount) public nonReentrant whenNotPaused returns (uint256 amountToWithdraw) {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage s = $.stakerData;
NftData storage nftData = s.nftData[tokenId];
LockedData storage lockedData = nftData.lockedData;
address sender = _msgSender();
IERC721MintBurn erc721 = IERC721MintBurn(address(this));
require(erc721.ownerOf(tokenId) == sender || sender == address(this), InvalidTokenOwner());
require(!lockedData.isCurrentLocked, TokenLocked());
require(nftData.staked != 0 && nftData.staked > amount, NotEnoughStaked());
_setTokenForAirdrop(tokenId);
if (lockedData.initialUnlockTimestamp > block.timestamp) {
require(lockedData.initialVestingAmount - nftData.staked > amount, NotEnoughStaked());
}
uint256 levelBefore = checkLevel(nftData.staked);
uint256 weightBefore = calcWeight(nftData.staked, nftData.nftMultiplier + levelBefore);
nftData.staked -= amount;
uint256 levelAfter = checkLevel(nftData.staked);
uint256 weightAfter = calcWeight(nftData.staked, nftData.nftMultiplier + levelAfter);
s.totalWeight -= weightBefore - weightAfter;
s.totalLevels -= levelBefore - levelAfter;
uint256 feeAmount = (amount * s.withdrawFee) / WHOLE;
amountToWithdraw = amount - feeAmount;
if (sender != address(this)) {
IERC20 stakeToken = s.stakeToken;
stakeToken.safeTransfer(sender, amountToWithdraw);
}
emit WithdrawStaked(tokenId, amountToWithdraw, feeAmount);
}
function claim(uint256 tokenId) public whenNotPaused returns (uint256 claimedRewards) {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage s = $.stakerData;
NftData storage nftData = s.nftData[tokenId];
require(nftData.staked != 0, NothingToClaim());
address sender = _msgSender();
IERC721MintBurn erc721 = IERC721MintBurn(address(this));
require(erc721.ownerOf(tokenId) == sender || sender == address(this), InvalidTokenOwner());
_setTokenForAirdrop(tokenId);
claimedRewards = _claimRewards(tokenId);
s.rewardsData.lastClaimedAmount[tokenId] = s.rewardsData.rewardsAmount;
require(claimedRewards != 0, NothingToClaim());
if (sender != address(this)) {
IERC20 stakeToken = s.stakeToken;
stakeToken.safeTransfer(sender, claimedRewards);
}
emit RewardsClaimed(tokenId, claimedRewards);
}
function _claimRewards(uint256 tokenId) private view returns (uint256 claimedRewards) {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage s = $.stakerData;
RewardsData storage rewardsData = s.rewardsData;
mapping(uint256 => uint256) storage lastClaimedAmount = rewardsData.lastClaimedAmount;
if (lastClaimedAmount[tokenId] == rewardsData.rewardsAmount) {
return 0;
}
uint256 airdropId = $.airdropId;
if (airdropId == 0) {
return 0;
}
mapping(uint256 => AirdropData) storage airdropById = $.airdropById;
for (uint256 airdropTarget; airdropTarget < airdropId; airdropTarget++) {
AirdropData storage airdropData = airdropById[airdropTarget];
mapping(uint256 => uint256) storage tokenWeight = airdropData.tokenWeight;
mapping(uint256 => uint256) storage tokenMultipliers = airdropData.tokenMultipliers;
if (lastClaimedAmount[tokenId] >= airdropData.airdropAmount) {
continue;
}
claimedRewards = ABDKMathQuad.toUInt(
ABDKMathQuad.mul(
ABDKMathQuad.div(
ABDKMathQuad.fromUInt((airdropData.airdropAmount - lastClaimedAmount[tokenId]) >> 1),
ABDKMathQuad.fromUInt(airdropData.totalMultipliers + airdropData.totalLevels)
),
ABDKMathQuad.fromUInt(tokenMultipliers[tokenId])
)
);
claimedRewards += ABDKMathQuad.toUInt(
ABDKMathQuad.mul(
ABDKMathQuad.div(ABDKMathQuad.fromUInt(tokenWeight[tokenId]), ABDKMathQuad.fromUInt(airdropData.totalWeight)),
ABDKMathQuad.fromUInt((airdropData.airdropAmount - lastClaimedAmount[tokenId]) >> 1)
)
);
}
}
function _setTokenForAirdrop(uint256 tokenId) private {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage s = $.stakerData;
NftData storage nftData = s.nftData[tokenId];
RewardsData storage rewardsData = s.rewardsData;
uint256 airdropId = $.airdropId;
if (airdropId == 0) {
return;
}
mapping(uint256 => AirdropData) storage airdropById = $.airdropById;
for (uint256 airdropTarget; airdropTarget < airdropId; airdropTarget++) {
AirdropData storage airdropData = airdropById[airdropTarget];
if (rewardsData.lastClaimedAmount[tokenId] < airdropData.airdropAmount) {
if (airdropData.tokenMultipliers[tokenId] == 0) {
uint256 staked = nftData.staked;
uint256 nftMultiplier = nftData.nftMultiplier;
uint256 level = checkLevel(staked);
uint256 tokenWeight = calcWeight(staked, nftMultiplier + level);
airdropData.tokenWeight[tokenId] = tokenWeight;
airdropData.tokenMultipliers[tokenId] = nftMultiplier + level;
}
}
}
}
function checkLevel(uint256 staked) public view returns (uint256) {
ONFTStakerStorage.Layout storage $ = ONFTStakerStorage.layout();
StakerStorage storage stakerData = $.stakerData;
mapping(uint256 => uint256) storage levelStakedNeeded = stakerData.levelStakedNeeded;
uint256 totalSum;
if (staked == totalSum) return 0;
for (uint256 i = 0; i <= 20; i++) {
if (staked >= levelStakedNeeded[i] + totalSum) {
totalSum += levelStakedNeeded[i];
} else {
return i;
}
}
return 20;
}
function calcWeight(uint256 nftStaked, uint256 tokenMultipliers) public pure returns (uint256) {
uint256 weight = ABDKMathQuad.toUInt(ABDKMathQuad.mul(ABDKMathQuad.fromUInt(nftStaked), ABDKMathQuad.fromUInt(tokenMultipliers)));
return weight;
}
}// SPDX-License-Identifier: Unlicense /* * @title Solidity Bytes Arrays Utils * @author Gonçalo Sá <[email protected]> * * @dev Bytes tightly packed arrays utility library for ethereum contracts written in Solidity. * The library lets you concatenate, slice and type cast bytes arrays both in memory and storage. */ pragma solidity >=0.8.0 <0.9.0; library BytesLib { function concat( bytes memory _preBytes, bytes memory _postBytes ) internal pure returns (bytes memory) { bytes memory tempBytes; assembly { // Get a location of some free memory and store it in tempBytes as // Solidity does for memory variables. tempBytes := mload(0x40) // Store the length of the first bytes array at the beginning of // the memory for tempBytes. let length := mload(_preBytes) mstore(tempBytes, length) // Maintain a memory counter for the current write location in the // temp bytes array by adding the 32 bytes for the array length to // the starting location. let mc := add(tempBytes, 0x20) // Stop copying when the memory counter reaches the length of the // first bytes array. let end := add(mc, length) for { // Initialize a copy counter to the start of the _preBytes data, // 32 bytes into its memory. let cc := add(_preBytes, 0x20) } lt(mc, end) { // Increase both counters by 32 bytes each iteration. mc := add(mc, 0x20) cc := add(cc, 0x20) } { // Write the _preBytes data into the tempBytes memory 32 bytes // at a time. mstore(mc, mload(cc)) } // Add the length of _postBytes to the current length of tempBytes // and store it as the new length in the first 32 bytes of the // tempBytes memory. length := mload(_postBytes) mstore(tempBytes, add(length, mload(tempBytes))) // Move the memory counter back from a multiple of 0x20 to the // actual end of the _preBytes data. mc := end // Stop copying when the memory counter reaches the new combined // length of the arrays. end := add(mc, length) for { let cc := add(_postBytes, 0x20) } lt(mc, end) { mc := add(mc, 0x20) cc := add(cc, 0x20) } { mstore(mc, mload(cc)) } // Update the free-memory pointer by padding our last write location // to 32 bytes: add 31 bytes to the end of tempBytes to move to the // next 32 byte block, then round down to the nearest multiple of // 32. If the sum of the length of the two arrays is zero then add // one before rounding down to leave a blank 32 bytes (the length block with 0). mstore(0x40, and( add(add(end, iszero(add(length, mload(_preBytes)))), 31), not(31) // Round down to the nearest 32 bytes. )) } return tempBytes; } function concatStorage(bytes storage _preBytes, bytes memory _postBytes) internal { assembly { // Read the first 32 bytes of _preBytes storage, which is the length // of the array. (We don't need to use the offset into the slot // because arrays use the entire slot.) let fslot := sload(_preBytes.slot) // Arrays of 31 bytes or less have an even value in their slot, // while longer arrays have an odd value. The actual length is // the slot divided by two for odd values, and the lowest order // byte divided by two for even values. // If the slot is even, bitwise and the slot with 255 and divide by // two to get the length. If the slot is odd, bitwise and the slot // with -1 and divide by two. let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2) let mlength := mload(_postBytes) let newlength := add(slength, mlength) // slength can contain both the length and contents of the array // if length < 32 bytes so let's prepare for that // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage switch add(lt(slength, 32), lt(newlength, 32)) case 2 { // Since the new array still fits in the slot, we just need to // update the contents of the slot. // uint256(bytes_storage) = uint256(bytes_storage) + uint256(bytes_memory) + new_length sstore( _preBytes.slot, // all the modifications to the slot are inside this // next block add( // we can just add to the slot contents because the // bytes we want to change are the LSBs fslot, add( mul( div( // load the bytes from memory mload(add(_postBytes, 0x20)), // zero all bytes to the right exp(0x100, sub(32, mlength)) ), // and now shift left the number of bytes to // leave space for the length in the slot exp(0x100, sub(32, newlength)) ), // increase length by the double of the memory // bytes length mul(mlength, 2) ) ) ) } case 1 { // The stored value fits in the slot, but the combined value // will exceed it. // get the keccak hash to get the contents of the array mstore(0x0, _preBytes.slot) let sc := add(keccak256(0x0, 0x20), div(slength, 32)) // save new length sstore(_preBytes.slot, add(mul(newlength, 2), 1)) // The contents of the _postBytes array start 32 bytes into // the structure. Our first read should obtain the `submod` // bytes that can fit into the unused space in the last word // of the stored array. To get this, we read 32 bytes starting // from `submod`, so the data we read overlaps with the array // contents by `submod` bytes. Masking the lowest-order // `submod` bytes allows us to add that value directly to the // stored value. let submod := sub(32, slength) let mc := add(_postBytes, submod) let end := add(_postBytes, mlength) let mask := sub(exp(0x100, submod), 1) sstore( sc, add( and( fslot, 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00 ), and(mload(mc), mask) ) ) for { mc := add(mc, 0x20) sc := add(sc, 1) } lt(mc, end) { sc := add(sc, 1) mc := add(mc, 0x20) } { sstore(sc, mload(mc)) } mask := exp(0x100, sub(mc, end)) sstore(sc, mul(div(mload(mc), mask), mask)) } default { // get the keccak hash to get the contents of the array mstore(0x0, _preBytes.slot) // Start copying to the last used word of the stored array. let sc := add(keccak256(0x0, 0x20), div(slength, 32)) // save new length sstore(_preBytes.slot, add(mul(newlength, 2), 1)) // Copy over the first `submod` bytes of the new data as in // case 1 above. let slengthmod := mod(slength, 32) let mlengthmod := mod(mlength, 32) let submod := sub(32, slengthmod) let mc := add(_postBytes, submod) let end := add(_postBytes, mlength) let mask := sub(exp(0x100, submod), 1) sstore(sc, add(sload(sc), and(mload(mc), mask))) for { sc := add(sc, 1) mc := add(mc, 0x20) } lt(mc, end) { sc := add(sc, 1) mc := add(mc, 0x20) } { sstore(sc, mload(mc)) } mask := exp(0x100, sub(mc, end)) sstore(sc, mul(div(mload(mc), mask), mask)) } } } function slice( bytes memory _bytes, uint256 _start, uint256 _length ) internal pure returns (bytes memory) { // We're using the unchecked block below because otherwise execution ends // with the native overflow error code. unchecked { require(_length + 31 >= _length, "slice_overflow"); } require(_bytes.length >= _start + _length, "slice_outOfBounds"); bytes memory tempBytes; assembly { switch iszero(_length) case 0 { // Get a location of some free memory and store it in tempBytes as // Solidity does for memory variables. tempBytes := mload(0x40) // The first word of the slice result is potentially a partial // word read from the original array. To read it, we calculate // the length of that partial word and start copying that many // bytes into the array. The first word we copy will start with // data we don't care about, but the last `lengthmod` bytes will // land at the beginning of the contents of the new array. When // we're done copying, we overwrite the full first word with // the actual length of the slice. let lengthmod := and(_length, 31) // The multiplication in the next line is necessary // because when slicing multiples of 32 bytes (lengthmod == 0) // the following copy loop was copying the origin's length // and then ending prematurely not copying everything it should. let mc := add(add(tempBytes, lengthmod), mul(0x20, iszero(lengthmod))) let end := add(mc, _length) for { // The multiplication in the next line has the same exact purpose // as the one above. let cc := add(add(add(_bytes, lengthmod), mul(0x20, iszero(lengthmod))), _start) } lt(mc, end) { mc := add(mc, 0x20) cc := add(cc, 0x20) } { mstore(mc, mload(cc)) } mstore(tempBytes, _length) //update free-memory pointer //allocating the array padded to 32 bytes like the compiler does now mstore(0x40, and(add(mc, 31), not(31))) } //if we want a zero-length slice let's just return a zero-length array default { tempBytes := mload(0x40) //zero out the 32 bytes slice we are about to return //we need to do it because Solidity does not garbage collect mstore(tempBytes, 0) mstore(0x40, add(tempBytes, 0x20)) } } return tempBytes; } function toAddress(bytes memory _bytes, uint256 _start) internal pure returns (address) { require(_bytes.length >= _start + 20, "toAddress_outOfBounds"); address tempAddress; assembly { tempAddress := div(mload(add(add(_bytes, 0x20), _start)), 0x1000000000000000000000000) } return tempAddress; } function toUint8(bytes memory _bytes, uint256 _start) internal pure returns (uint8) { require(_bytes.length >= _start + 1 , "toUint8_outOfBounds"); uint8 tempUint; assembly { tempUint := mload(add(add(_bytes, 0x1), _start)) } return tempUint; } function toUint16(bytes memory _bytes, uint256 _start) internal pure returns (uint16) { require(_bytes.length >= _start + 2, "toUint16_outOfBounds"); uint16 tempUint; assembly { tempUint := mload(add(add(_bytes, 0x2), _start)) } return tempUint; } function toUint32(bytes memory _bytes, uint256 _start) internal pure returns (uint32) { require(_bytes.length >= _start + 4, "toUint32_outOfBounds"); uint32 tempUint; assembly { tempUint := mload(add(add(_bytes, 0x4), _start)) } return tempUint; } function toUint64(bytes memory _bytes, uint256 _start) internal pure returns (uint64) { require(_bytes.length >= _start + 8, "toUint64_outOfBounds"); uint64 tempUint; assembly { tempUint := mload(add(add(_bytes, 0x8), _start)) } return tempUint; } function toUint96(bytes memory _bytes, uint256 _start) internal pure returns (uint96) { require(_bytes.length >= _start + 12, "toUint96_outOfBounds"); uint96 tempUint; assembly { tempUint := mload(add(add(_bytes, 0xc), _start)) } return tempUint; } function toUint128(bytes memory _bytes, uint256 _start) internal pure returns (uint128) { require(_bytes.length >= _start + 16, "toUint128_outOfBounds"); uint128 tempUint; assembly { tempUint := mload(add(add(_bytes, 0x10), _start)) } return tempUint; } function toUint256(bytes memory _bytes, uint256 _start) internal pure returns (uint256) { require(_bytes.length >= _start + 32, "toUint256_outOfBounds"); uint256 tempUint; assembly { tempUint := mload(add(add(_bytes, 0x20), _start)) } return tempUint; } function toBytes32(bytes memory _bytes, uint256 _start) internal pure returns (bytes32) { require(_bytes.length >= _start + 32, "toBytes32_outOfBounds"); bytes32 tempBytes32; assembly { tempBytes32 := mload(add(add(_bytes, 0x20), _start)) } return tempBytes32; } function equal(bytes memory _preBytes, bytes memory _postBytes) internal pure returns (bool) { bool success = true; assembly { let length := mload(_preBytes) // if lengths don't match the arrays are not equal switch eq(length, mload(_postBytes)) case 1 { // cb is a circuit breaker in the for loop since there's // no said feature for inline assembly loops // cb = 1 - don't breaker // cb = 0 - break let cb := 1 let mc := add(_preBytes, 0x20) let end := add(mc, length) for { let cc := add(_postBytes, 0x20) // the next line is the loop condition: // while(uint256(mc < end) + cb == 2) } eq(add(lt(mc, end), cb), 2) { mc := add(mc, 0x20) cc := add(cc, 0x20) } { // if any of these checks fails then arrays are not equal if iszero(eq(mload(mc), mload(cc))) { // unsuccess: success := 0 cb := 0 } } } default { // unsuccess: success := 0 } } return success; } function equalStorage( bytes storage _preBytes, bytes memory _postBytes ) internal view returns (bool) { bool success = true; assembly { // we know _preBytes_offset is 0 let fslot := sload(_preBytes.slot) // Decode the length of the stored array like in concatStorage(). let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2) let mlength := mload(_postBytes) // if lengths don't match the arrays are not equal switch eq(slength, mlength) case 1 { // slength can contain both the length and contents of the array // if length < 32 bytes so let's prepare for that // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage if iszero(iszero(slength)) { switch lt(slength, 32) case 1 { // blank the last byte which is the length fslot := mul(div(fslot, 0x100), 0x100) if iszero(eq(fslot, mload(add(_postBytes, 0x20)))) { // unsuccess: success := 0 } } default { // cb is a circuit breaker in the for loop since there's // no said feature for inline assembly loops // cb = 1 - don't breaker // cb = 0 - break let cb := 1 // get the keccak hash to get the contents of the array mstore(0x0, _preBytes.slot) let sc := keccak256(0x0, 0x20) let mc := add(_postBytes, 0x20) let end := add(mc, mlength) // the next line is the loop condition: // while(uint256(mc < end) + cb == 2) for {} eq(add(lt(mc, end), cb), 2) { sc := add(sc, 1) mc := add(mc, 0x20) } { if iszero(eq(sload(sc), mload(mc))) { // unsuccess: success := 0 cb := 0 } } } } } default { // unsuccess: success := 0 } } return success; } }
{
"evmVersion": "shanghai",
"viaIR": true,
"optimizer": {
"enabled": true,
"runs": 20
},
"outputSelection": {
"*": {
"*": [
"evm.bytecode",
"evm.deployedBytecode",
"devdoc",
"userdoc",
"metadata",
"abi"
]
}
},
"metadata": {
"useLiteralContent": true
}
}Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
Contract ABI
API[{"inputs":[],"name":"DiamondWritable__InvalidInitializationParameters","type":"error"},{"inputs":[],"name":"DiamondWritable__RemoveTargetNotZeroAddress","type":"error"},{"inputs":[],"name":"DiamondWritable__ReplaceTargetIsIdentical","type":"error"},{"inputs":[],"name":"DiamondWritable__SelectorAlreadyAdded","type":"error"},{"inputs":[],"name":"DiamondWritable__SelectorIsImmutable","type":"error"},{"inputs":[],"name":"DiamondWritable__SelectorNotFound","type":"error"},{"inputs":[],"name":"DiamondWritable__SelectorNotSpecified","type":"error"},{"inputs":[],"name":"DiamondWritable__TargetHasNoCode","type":"error"},{"inputs":[],"name":"ERC165Base__InvalidInterfaceId","type":"error"},{"inputs":[],"name":"Ownable__NotOwner","type":"error"},{"inputs":[],"name":"Ownable__NotTransitiveOwner","type":"error"},{"inputs":[],"name":"Proxy__ImplementationIsNotContract","type":"error"},{"inputs":[],"name":"SafeOwnable__NotNomineeOwner","type":"error"},{"anonymous":false,"inputs":[{"components":[{"internalType":"address","name":"target","type":"address"},{"internalType":"enum IERC2535DiamondCutInternal.FacetCutAction","name":"action","type":"uint8"},{"internalType":"bytes4[]","name":"selectors","type":"bytes4[]"}],"indexed":false,"internalType":"struct IERC2535DiamondCutInternal.FacetCut[]","name":"facetCuts","type":"tuple[]"},{"indexed":false,"internalType":"address","name":"target","type":"address"},{"indexed":false,"internalType":"bytes","name":"data","type":"bytes"}],"name":"DiamondCut","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"stateMutability":"payable","type":"fallback"},{"inputs":[],"name":"acceptOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"components":[{"internalType":"address","name":"target","type":"address"},{"internalType":"enum IERC2535DiamondCutInternal.FacetCutAction","name":"action","type":"uint8"},{"internalType":"bytes4[]","name":"selectors","type":"bytes4[]"}],"internalType":"struct IERC2535DiamondCutInternal.FacetCut[]","name":"facetCuts","type":"tuple[]"},{"internalType":"address","name":"target","type":"address"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"diamondCut","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"selector","type":"bytes4"}],"name":"facetAddress","outputs":[{"internalType":"address","name":"facet","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"facetAddresses","outputs":[{"internalType":"address[]","name":"addresses","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"facet","type":"address"}],"name":"facetFunctionSelectors","outputs":[{"internalType":"bytes4[]","name":"selectors","type":"bytes4[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"facets","outputs":[{"components":[{"internalType":"address","name":"target","type":"address"},{"internalType":"bytes4[]","name":"selectors","type":"bytes4[]"}],"internalType":"struct IERC2535DiamondLoupeInternal.Facet[]","name":"diamondFacets","type":"tuple[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getFallbackAddress","outputs":[{"internalType":"address","name":"fallbackAddress","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"nomineeOwner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"fallbackAddress","type":"address"}],"name":"setFallbackAddress","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]Contract Creation Code
6080604052346103295761031161001461038a565b61002c610020826103de565b632c40805960e01b9052565b61028861027c61003c60016103a8565b61005661004a6001866103f0565b639142376560e01b9052565b632f40adcf60e21b5f525f51602061243c5f395f51905f526020527fea929569903c3e19530358310fcaf1a971b387fd41008d81b0a7f1275e915a5c805460ff191660011790556100bf6100b36100ac836103a8565b92866103f0565b6307e4c70760e21b9052565b6307e4c70760e21b5f525f51602061243c5f395f51905f526020527ffd29538739e576e7ec1eb8c7e901cca011aae0deb8fb2c6280a4c2300add457d805460ff191660011790556101216101156100ac836103a8565b637a0ed62760e01b9052565b61013c6101306100ac836103a8565b6356fe50af60e11b9052565b61015761014b6100ac836103a8565b6314bbdacb60e21b9052565b6101726101666100ac836103a8565b6366ffd66360e11b9052565b6348e2b09360e01b5f525f51602061243c5f395f51905f526020527fb36cab0dec645683c2d905d6b41349479e1d7f665c3cff144fecc78944a31d5b805460ff191660011790556101d46101c86100ac836103a8565b6301ffc9a760e01b9052565b6301ffc9a760e01b5f525f51602061243c5f395f51905f526020527f3df35b507c5de77f483b4e9b5c258409299a2e6dc816fa76a389e598628b08a5805460ff1916600117905561023661022a6100ac836103a8565b638da5cb5b60e01b9052565b6102516102456100ac836103a8565b63455a8a8560e11b9052565b61026c6102606100ac836103a8565b63f2fde38b60e01b9052565b610275816103a8565b50836103f0565b6379ba509760e01b9052565b6307f5828d60e41b5f525f51602061243c5f395f51905f526020527fa9832637661075437d81882814f92cc614421ae9c04c71ce67957179f7086c18805460ff191660011790556102d7610404565b906102e0610341565b308152905f602083015260408201526102f8826103de565b52610302816103de565b5061030b610487565b906105c5565b61031a33610776565b6040516117099081610d338239f35b5f80fd5b634e487b7160e01b5f52604160045260245ffd5b60405190606082016001600160401b0381118382101761036057604052565b61032d565b6040519190601f01601f191682016001600160401b0381118382101761036057604052565b6101a09061039782610365565b600c815291601f1901366020840137565b5f1981146103b65760010190565b634e487b7160e01b5f52601160045260245ffd5b634e487b7160e01b5f52603260045260245ffd5b8051156103eb5760200190565b6103ca565b80518210156103eb5760209160051b010190565b60409061041082610365565b6001815291601f1901825f5b82811061042857505050565b602090610433610341565b5f81525f83820152606060408201528282850101520161041c565b6003111561045857565b634e487b7160e01b5f52602160045260245ffd5b6001600160401b03811161036057601f01601f191660200190565b6104916020610365565b905f8252565b91908251928382525f5b8481106104c1575050825f602080949584010152601f8019910116010190565b806020809284010151828286010152016104a1565b9392909193606081016060825283518091526080820190602060808260051b8501019501915f905b82821061052f575050506001600160a01b03909516602082015292935061052c926040818403910152610497565b90565b848703607f19018152835180516001600160a01b03168852602081015194979394929391926060830191600382101561045857604060809160209384870152015193606060408201528451809452019201905f905b8082106105a2575050506020806001929801920192019092916104fe565b82516001600160e01b031916845260209384019390920191600190910190610584565b91906105ea6105e35f51602061245c5f395f51905f525461ffff1690565b61ffff1690565b9283925f9260078616610760575b5f94935b83518610156106bb5761060f86856103f0565b51602081015161061e8161044e565b604082015151156106ac576106328161044e565b80610653575090600195969761064792610b4c565b9490965b0194936105fc565b610660819893979861044e565b6001810361067a575090610675600192610a4b565b61064b565b8061068660029261044e565b14610695575b5060019061064b565b946106a391976001966107d5565b9490969061068c565b63eb6c3aeb60e01b5f5260045ffd5b61071295505f92967f8faa70878671ccd212d20771b795c50af8fd3ff6cf27f4bde57e5d4de0aeb673949295810361073e575b60078116610714575b505061070984604051938493846104d6565b0390a15f610cc0565b565b6107369060031c5b5f525f5160206124bc5f395f51905f5260205260405f2090565b555f806106f7565b5f51602061245c5f395f51905f52805461ffff191661ffff83161790556106ee565b925061076f61071c8660031c90565b54926105f8565b5f51602061249c5f395f51905f52546001600160a01b0391821691829082167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a36001600160a01b031916175f51602061249c5f395f51905f5255565b8051929390929091906001600160a01b0316610a3c575f935b6040840151918251861015610a355761080e8661081c925f1901946103f0565b516001600160e01b03191690565b6001600160e01b031981165f9081525f51602061247c5f395f51905f5260205260408120805491905591606083901c8015610a26573014610a175760078416600781146109dc575b8161087261087f9260051b90565b1b63ffffffff60e01b1690565b916001600160e01b03199081169083160361095a575b6108b86105e360076108ac600387901c611fff1683565b951660051b61ffe01690565b926108c38560031c90565b81036108f057506040926001926001600160e01b031980831c199093169216901c17955b019490506107ee565b61095461093860409560019561091e855f5160206124bc5f395f51905f529d979d905f5260205260405f2090565b546001600160e01b031980841c19909116911690911c1790565b915f5160206124bc5f395f51905f52905f5260205260405f2090565b556108e7565b6109a3610996610988845f51602061247c5f395f51905f529063ffffffff60e01b165f5260205260405f2090565b546001600160601b03191690565b6001600160601b03191690565b6001600160e01b031983165f9081525f51602061247c5f395f51905f52602052604090206001600160601b038516919091179055610895565b610872915061087f90610a0d6109f28760031c90565b5f5160206124bc5f395f51905f52905f5260205260405f2090565b5492509050610864565b63e983573160e01b5f5260045ffd5b6337e25a9760e11b5f5260045ffd5b9450925050565b633ab3490960e21b5f5260045ffd5b80519091906001600160a01b03163b15610b3d575f5b60408301518051821015610b375761080e82610a7c926103f0565b90610aa5825f51602061247c5f395f51905f529063ffffffff60e01b165f5260205260405f2090565b54918260601c8015610a2657308114610a175785516001600160a01b031614610b28578451600193610b2191610af390610996906001600160a01b03165b60601b6001600160601b03191690565b90858060601b031617915f51602061247c5f395f51905f529063ffffffff60e01b165f5260205260405f2090565b5501610a61565b6330baabf360e11b5f5260045ffd5b50509050565b633ddc5cab60e21b5f5260045ffd5b80519293929091906001600160a01b0316803b15610c78575081516001600160a01b03166001600160a01b03163014610a17575b5f905b60408301518051831015610c705761080e83610b9e926103f0565b94610bc7865f51602061247c5f395f51905f529063ffffffff60e01b165f5260205260405f2090565b54610c615760019160e0610c3d8493610bec610996610ae38a5160018060a01b031690565b8417610c168b5f51602061247c5f395f51905f529063ffffffff60e01b165f5260205260405f2090565b55610c246007851660051b90565b996001600160e01b0319808c1c1990921691168a1c1790565b9714610c4d575b01910190610b83565b86610c5b6109f28360031c90565b55610c44565b634923a77160e11b5f5260045ffd5b509150509190565b6001600160a01b03163014610b8057633ddc5cab60e21b5f5260045ffd5b3d15610cbb573d90610caf610caa8361046c565b610365565b9182523d5f602084013e565b606090565b81516001600160a01b03821690811590158103610d235715610ce157505050565b3003610d0e575b815f929160208493519201905af4610cfe610c96565b5015610d0657565b3d5f803e3d5ffd5b803b610ce857633ddc5cab60e21b5f5260045ffd5b6326df4ccd60e01b5f5260045ffdfe60806040526004361015610015575b36610cc457005b5f3560e01c806301ffc9a7146100d45780631f931c1c146100cf5780632c408059146100ca57806352ef6b2c146100c557806379ba5097146100c05780637a0ed627146100bb5780638ab5150a146100b65780638da5cb5b146100b157806391423765146100ac578063adfca15e146100a7578063cdffacc6146100a25763f2fde38b0361000e57610a73565b610a49565b610942565b61088b565b610857565b610823565b6105ba565b610453565b6102d2565b61025c565b6101d2565b610109565b600435906001600160e01b0319821682036100f057565b5f80fd5b35906001600160e01b0319821682036100f057565b346100f05760203660031901126100f0576101226100d9565b63ffffffff60e01b165f527ffc606c433378e3a7e0a6a531deac289b66caa1b4aa8554fd4ab2c6f1570f92d8602052602060ff60405f2054166040519015158152f35b602435906001600160a01b03821682036100f057565b600435906001600160a01b03821682036100f057565b35906001600160a01b03821682036100f057565b9181601f840112156100f0578235916001600160401b0383116100f057602083818601950101116100f057565b346100f05760603660031901126100f0576004356001600160401b0381116100f057366023820112156100f0578060040135906001600160401b0382116100f0573660248360051b830101116100f05761022a610165565b90604435916001600160401b0383116100f05761025a9361025160249436906004016101a5565b94909301610ad8565b005b346100f0575f3660031901126100f0575f5160206116b45f395f51905f52546040516001600160a01b039091168152602090f35b60206040818301928281528451809452019201905f5b8181106102b35750505090565b82516001600160a01b03168452602093840193909201916001016102a6565b346100f0575f3660031901126100f0576103056102fe5f5160206116345f395f51905f525461ffff1690565b61ffff1690565b61030e8161107a565b5f5f5f5b84821061032e578284526040518061032a8682610290565b0390f35b61033781610d7d565b545f5b60088110610353575b505061034e906110b6565b610312565b919492610362909691966110b6565b93818511610447576103a76103a161039361038e8a6103818860051b90565b1b63ffffffff60e01b1690565b610d44565b546001600160601b03191690565b60601c90565b5f6001600160a01b038216815b848110610404575b50506103fa57816103e56103ea926103d660019589610dbd565b6001600160a01b039091169052565b6110b6565b925b01959095949193929461033a565b50916001906103ec565b61042d610421610414838b610dbd565b516001600160a01b031690565b6001600160a01b031690565b821461043b576001016103b4565b50505060015f806103bc565b93929491819650610343565b346100f0575f3660031901126100f0575f5160206116145f395f51905f52546001600160a01b031633036104f7575f5160206116745f395f51905f525433906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a35f5160206116745f395f51905f5280546001600160a01b031990811633179091555f5160206116145f395f51905f5280549091169055005b63efd1052d60e01b5f5260045ffd5b90602080835192838152019201905f5b8181106105235750505090565b82516001600160e01b031916845260209384019390920191600101610516565b602081016020825282518091526040820191602060408360051b8301019401925f915b83831061057557505050505090565b90919293946020806105ab600193603f198682030187526040838b51878060a01b03815116845201519181858201520190610506565b97019301930191939290610566565b346100f0575f3660031901126100f0576105e66102fe5f5160206116345f395f51905f525461ffff1690565b6105ef816110c9565b6105f88261107a565b915f905f5f5b828210610658575050505f5b818110610622578183526040518061032a8582610543565b8061064261063c61063560019488610dbd565b5160ff1690565b60ff1690565b602061064e8387610dbd565b510151520161060a565b61066181610d7d565b545f5b6008811061067d575b5050610678906110b6565b6105fe565b9261068e90979491979692966110b6565b94818611610815576106a4886103818660051b90565b6106b36103a161039383610d44565b5f6001600160a01b038216815b858110610765575b505061075a5791610735610748926106f66001956106e6858a610dbd565b516001600160a01b039091169052565b6106ff8661107a565b602061070b858a610dbd565b510152610725602061071d858a610dbd565b510151610dab565b6001600160e01b03199091169052565b6103e56107428289610dbd565b60019052565b935b0196909396959195949294610664565b50509260019061074a565b898589846107876104216107798785610dbd565b51516001600160a01b031690565b14610797575050506001016106c0565b61080c95508394506106358460ff946107d9869561072560206107c06107e59b6107de99610dbd565b5101516107d361063c6106358888610dbd565b90610dbd565b610dbd565b161061112c565b6108046107fd6107f8610635848d610dbd565b611133565b918a610dbd565b9060ff169052565b60015f806106c8565b94928194975095919561066d565b346100f0575f3660031901126100f0575f5160206116145f395f51905f52546040516001600160a01b039091168152602090f35b346100f0575f3660031901126100f0575f5160206116745f395f51905f52546040516001600160a01b039091168152602090f35b346100f05760203660031901126100f0576108a461017b565b5f5160206116745f395f51905f52546001600160a01b031633036108f0575f5160206116b45f395f51905f5280546001600160a01b0319166001600160a01b0392909216919091179055005b632f7a8ee160e01b5f5260045ffd5b60206040818301928281528451809452019201905f5b8181106109225750505090565b82516001600160e01b031916845260209384019390920191600101610915565b346100f05760203660031901126100f05761095b61017b565b6109776102fe5f5160206116345f395f51905f525461ffff1690565b906109818261107a565b905f906001600160a01b031681805b8582106109a8578385526040518061032a87826108ff565b6109b181610d7d565b545f5b600881106109cd575b50506109c8906110b6565b610990565b94926109de909791979692966110b6565b94818611610a3b576109f4886103818360051b90565b610a066104216103a161039384610d44565b8614610a1f575b506001019690969591959492946109b4565b846103e5610a34926107256001959888610dbd565b9390610a0d565b8197509591959492946109bd565b346100f05760203660031901126100f0576020610a6761038e6100d9565b5460601c604051908152f35b346100f05760203660031901126100f057610a8c61017b565b5f5160206116745f395f51905f52546001600160a01b031633036108f0575f5160206116145f395f51905f5280546001600160a01b0319166001600160a01b0392909216919091179055005b9294939060018060a01b035f5160206116745f395f51905f52541633036108f057610b0a610b0582610c67565b610c42565b93602085838152019160051b8101903682116100f05780925b828410610b465750505050610b449394610b3e913691610c99565b91610ee5565b565b83356001600160401b0381116100f05782016060813603126100f057610b6a610c1e565b90610b7481610191565b8252602081013560038110156100f05760208301526040810135906001600160401b0382116100f0570136601f820112156100f057803590610bb8610b0583610c67565b9160208084838152019160051b830101913683116100f057602001905b828210610bf2575050506040820152815260209384019301610b23565b60208091610bff846100f4565b815201910190610bd5565b634e487b7160e01b5f52604160045260245ffd5b60405190606082018281106001600160401b03821117610c3d57604052565b610c0a565b6040519190601f01601f191682016001600160401b03811183821017610c3d57604052565b6001600160401b038111610c3d5760051b60200190565b6001600160401b038111610c3d57601f01601f191660200190565b929192610ca8610b0583610c7e565b93828552828201116100f057815f926020928387013784010152565b5f80356001600160e01b03191681525f5160206116545f395f51905f52602052604090205460601c8015610d26575b803b15610d17575f8091368280378136915af43d5f803e15610d13573d5ff35b3d5ffd5b6321f27f0d60e21b5f5260045ffd5b505f5160206116b45f395f51905f52546001600160a01b0316610cf3565b63ffffffff60e01b165f525f5160206116545f395f51905f5260205260405f2090565b9063ffffffff60e01b165f5260205260405f2090565b5f525f5160206116945f395f51905f5260205260405f2090565b634e487b7160e01b5f52603260045260245ffd5b805115610db85760200190565b610d97565b8051821015610db85760209160051b010190565b60031115610ddb57565b634e487b7160e01b5f52602160045260245ffd5b91908251928382525f5b848110610e19575050825f602080949584010152601f8019910116010190565b80602080928401015182828601015201610df9565b93929091936060810160608252835180915260808201602060808360051b8501019501915f5b818110610e85575050506001600160a01b039095166020820152929350610e82926040818403910152610def565b90565b848703607f19018352835180516001600160a01b031688526020810151949793949293919291906003831015610ddb57610ed982606060406020959460019787809701520151918160408201520190610506565b98019401929101610e54565b610f016102fe5f5160206116345f395f51905f525461ffff1690565b9384935f9360078716611064575b5f95945b8451871015610fd257610f268786610dbd565b516020810151610f3581610dd1565b60408201515115610fc357610f4981610dd1565b80610f6a5750906001969798610f5e9261144c565b9590975b019594610f13565b610f778199939899610dd1565b60018103610f91575090610f8c600192611364565b610f62565b80610f9d600292610dd1565b14610fac575b50600190610f62565b95610fba9198600197611144565b95909790610fa3565b63eb6c3aeb60e01b5f5260045ffd5b610b4496507f8faa70878671ccd212d20771b795c50af8fd3ff6cf27f4bde57e5d4de0aeb673939782959293968103611042575b60078116611029575b50506110218560405193849384610e2e565b0390a1611588565b61103a9060031c610d7d565b610d7d565b555f8061100f565b5f5160206116345f395f51905f52805461ffff191661ffff8316179055611006565b93506110736110358760031c90565b5493610f0f565b90611087610b0583610c67565b8281528092611098601f1991610c67565b0190602036910137565b634e487b7160e01b5f52601160045260245ffd5b5f1981146110c45760010190565b6110a2565b906110d6610b0583610c67565b82815280926110e7601f1991610c67565b015f5b8181106110f657505050565b6040519060408201918083106001600160401b03841117610c3d576020926040525f8152606083820152828286010152016110ea565b156100f057565b60ff1660ff81146110c45760010190565b8051929390929091906001600160a01b0316611355575f935b604084015191825186101561134e5761117d8661118b925f190194610dbd565b516001600160e01b03191690565b6111a2815f5160206116545f395f51905f52610d67565b54915f6111bc835f5160206116545f395f51905f52610d67565b558260601c801561133f5730146113305760078416600781146112f5575b816103816111e89260051b90565b916001600160e01b0319908116908316036112a3575b6112216102fe6007611215600387901c611fff1683565b951660051b61ffe01690565b9261122c8560031c90565b810361124d5750604092600192611242926115fa565b955b0194905061115d565b61129d61128160409560019561127b855f5160206116945f395f51905f529d979d905f5260205260405f2090565b546115fa565b915f5160206116945f395f51905f52905f5260205260405f2090565b55611244565b6112cd6112c0610393845f5160206116545f395f51905f52610d67565b6001600160601b03191690565b6001600160601b038416176112ef835f5160206116545f395f51905f52610d67565b556111fe565b61038191506111e89061132661130b8760031c90565b5f5160206116945f395f51905f52905f5260205260405f2090565b54925090506111da565b63e983573160e01b5f5260045ffd5b6337e25a9760e11b5f5260045ffd5b9450925050565b633ab3490960e21b5f5260045ffd5b80519091906001600160a01b03163b1561143d575f5b604083015180518210156114375761117d8261139592610dbd565b906113ad825f5160206116545f395f51905f52610d67565b54918260601c801561133f573081146113305785516113d4906001600160a01b0316610421565b1461142857845160019361142191611404906112c0906001600160a01b03165b60601b6001600160601b03191690565b90858060601b031617915f5160206116545f395f51905f52610d67565b550161137a565b6330baabf360e11b5f5260045ffd5b50509050565b633ddc5cab60e21b5f5260045ffd5b80519293929091906001600160a01b0316803b15611545575081516001600160a01b03166001600160a01b03163014611330575b5f905b6040830151805183101561153d5761117d8361149e92610dbd565b946114b6865f5160206116545f395f51905f52610d67565b5461152e5760019160e061150a84936114db6112c06113f48a5160018060a01b031690565b84176114f48b5f5160206116545f395f51905f52610d67565b556115026007851660051b90565b998a916115fa565b971461151a575b01910190611483565b8661152861130b8360031c90565b55611511565b634923a77160e11b5f5260045ffd5b509150509190565b6001600160a01b0316301461148057633ddc5cab60e21b5f5260045ffd5b3d15611583573d90611577610b0583610c7e565b9182523d5f602084013e565b606090565b81516001600160a01b038216908115901581036115eb57156115a957505050565b30036115d6575b815f929160208493519201905af46115c6611563565b50156115ce57565b3d5f803e3d5ffd5b803b6115b057633ddc5cab60e21b5f5260045ffd5b6326df4ccd60e01b5f5260045ffd5b6001600160e01b031980841c19909116911690911c179056fe24aa1f7b31fd188a8d3ecfb06bc55c806040e59b03bd4396283442fce6617890177481ac65e4292921c69f62d1cc7f57541261e5d61c8175cf4e36a01c9bfc94177481ac65e4292921c69f62d1cc7f57541261e5d61c8175cf4e36a01c9bfc938a22373512790c48b83a1fe2efdd2888d4a917bcdc24d0adf63e60f671680460177481ac65e4292921c69f62d1cc7f57541261e5d61c8175cf4e36a01c9bfc95177481ac65e4292921c69f62d1cc7f57541261e5d61c8175cf4e36a01c9bfc96a2646970667358221220a2b01f952fc4903f49fb013868e4945d8d535f1dc42b752373407db7701c63b064736f6c634300081d0033fc606c433378e3a7e0a6a531deac289b66caa1b4aa8554fd4ab2c6f1570f92d8177481ac65e4292921c69f62d1cc7f57541261e5d61c8175cf4e36a01c9bfc94177481ac65e4292921c69f62d1cc7f57541261e5d61c8175cf4e36a01c9bfc938a22373512790c48b83a1fe2efdd2888d4a917bcdc24d0adf63e60f671680460177481ac65e4292921c69f62d1cc7f57541261e5d61c8175cf4e36a01c9bfc95
Deployed Bytecode
0x60806040526004361015610015575b36610cc457005b5f3560e01c806301ffc9a7146100d45780631f931c1c146100cf5780632c408059146100ca57806352ef6b2c146100c557806379ba5097146100c05780637a0ed627146100bb5780638ab5150a146100b65780638da5cb5b146100b157806391423765146100ac578063adfca15e146100a7578063cdffacc6146100a25763f2fde38b0361000e57610a73565b610a49565b610942565b61088b565b610857565b610823565b6105ba565b610453565b6102d2565b61025c565b6101d2565b610109565b600435906001600160e01b0319821682036100f057565b5f80fd5b35906001600160e01b0319821682036100f057565b346100f05760203660031901126100f0576101226100d9565b63ffffffff60e01b165f527ffc606c433378e3a7e0a6a531deac289b66caa1b4aa8554fd4ab2c6f1570f92d8602052602060ff60405f2054166040519015158152f35b602435906001600160a01b03821682036100f057565b600435906001600160a01b03821682036100f057565b35906001600160a01b03821682036100f057565b9181601f840112156100f0578235916001600160401b0383116100f057602083818601950101116100f057565b346100f05760603660031901126100f0576004356001600160401b0381116100f057366023820112156100f0578060040135906001600160401b0382116100f0573660248360051b830101116100f05761022a610165565b90604435916001600160401b0383116100f05761025a9361025160249436906004016101a5565b94909301610ad8565b005b346100f0575f3660031901126100f0575f5160206116b45f395f51905f52546040516001600160a01b039091168152602090f35b60206040818301928281528451809452019201905f5b8181106102b35750505090565b82516001600160a01b03168452602093840193909201916001016102a6565b346100f0575f3660031901126100f0576103056102fe5f5160206116345f395f51905f525461ffff1690565b61ffff1690565b61030e8161107a565b5f5f5f5b84821061032e578284526040518061032a8682610290565b0390f35b61033781610d7d565b545f5b60088110610353575b505061034e906110b6565b610312565b919492610362909691966110b6565b93818511610447576103a76103a161039361038e8a6103818860051b90565b1b63ffffffff60e01b1690565b610d44565b546001600160601b03191690565b60601c90565b5f6001600160a01b038216815b848110610404575b50506103fa57816103e56103ea926103d660019589610dbd565b6001600160a01b039091169052565b6110b6565b925b01959095949193929461033a565b50916001906103ec565b61042d610421610414838b610dbd565b516001600160a01b031690565b6001600160a01b031690565b821461043b576001016103b4565b50505060015f806103bc565b93929491819650610343565b346100f0575f3660031901126100f0575f5160206116145f395f51905f52546001600160a01b031633036104f7575f5160206116745f395f51905f525433906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a35f5160206116745f395f51905f5280546001600160a01b031990811633179091555f5160206116145f395f51905f5280549091169055005b63efd1052d60e01b5f5260045ffd5b90602080835192838152019201905f5b8181106105235750505090565b82516001600160e01b031916845260209384019390920191600101610516565b602081016020825282518091526040820191602060408360051b8301019401925f915b83831061057557505050505090565b90919293946020806105ab600193603f198682030187526040838b51878060a01b03815116845201519181858201520190610506565b97019301930191939290610566565b346100f0575f3660031901126100f0576105e66102fe5f5160206116345f395f51905f525461ffff1690565b6105ef816110c9565b6105f88261107a565b915f905f5f5b828210610658575050505f5b818110610622578183526040518061032a8582610543565b8061064261063c61063560019488610dbd565b5160ff1690565b60ff1690565b602061064e8387610dbd565b510151520161060a565b61066181610d7d565b545f5b6008811061067d575b5050610678906110b6565b6105fe565b9261068e90979491979692966110b6565b94818611610815576106a4886103818660051b90565b6106b36103a161039383610d44565b5f6001600160a01b038216815b858110610765575b505061075a5791610735610748926106f66001956106e6858a610dbd565b516001600160a01b039091169052565b6106ff8661107a565b602061070b858a610dbd565b510152610725602061071d858a610dbd565b510151610dab565b6001600160e01b03199091169052565b6103e56107428289610dbd565b60019052565b935b0196909396959195949294610664565b50509260019061074a565b898589846107876104216107798785610dbd565b51516001600160a01b031690565b14610797575050506001016106c0565b61080c95508394506106358460ff946107d9869561072560206107c06107e59b6107de99610dbd565b5101516107d361063c6106358888610dbd565b90610dbd565b610dbd565b161061112c565b6108046107fd6107f8610635848d610dbd565b611133565b918a610dbd565b9060ff169052565b60015f806106c8565b94928194975095919561066d565b346100f0575f3660031901126100f0575f5160206116145f395f51905f52546040516001600160a01b039091168152602090f35b346100f0575f3660031901126100f0575f5160206116745f395f51905f52546040516001600160a01b039091168152602090f35b346100f05760203660031901126100f0576108a461017b565b5f5160206116745f395f51905f52546001600160a01b031633036108f0575f5160206116b45f395f51905f5280546001600160a01b0319166001600160a01b0392909216919091179055005b632f7a8ee160e01b5f5260045ffd5b60206040818301928281528451809452019201905f5b8181106109225750505090565b82516001600160e01b031916845260209384019390920191600101610915565b346100f05760203660031901126100f05761095b61017b565b6109776102fe5f5160206116345f395f51905f525461ffff1690565b906109818261107a565b905f906001600160a01b031681805b8582106109a8578385526040518061032a87826108ff565b6109b181610d7d565b545f5b600881106109cd575b50506109c8906110b6565b610990565b94926109de909791979692966110b6565b94818611610a3b576109f4886103818360051b90565b610a066104216103a161039384610d44565b8614610a1f575b506001019690969591959492946109b4565b846103e5610a34926107256001959888610dbd565b9390610a0d565b8197509591959492946109bd565b346100f05760203660031901126100f0576020610a6761038e6100d9565b5460601c604051908152f35b346100f05760203660031901126100f057610a8c61017b565b5f5160206116745f395f51905f52546001600160a01b031633036108f0575f5160206116145f395f51905f5280546001600160a01b0319166001600160a01b0392909216919091179055005b9294939060018060a01b035f5160206116745f395f51905f52541633036108f057610b0a610b0582610c67565b610c42565b93602085838152019160051b8101903682116100f05780925b828410610b465750505050610b449394610b3e913691610c99565b91610ee5565b565b83356001600160401b0381116100f05782016060813603126100f057610b6a610c1e565b90610b7481610191565b8252602081013560038110156100f05760208301526040810135906001600160401b0382116100f0570136601f820112156100f057803590610bb8610b0583610c67565b9160208084838152019160051b830101913683116100f057602001905b828210610bf2575050506040820152815260209384019301610b23565b60208091610bff846100f4565b815201910190610bd5565b634e487b7160e01b5f52604160045260245ffd5b60405190606082018281106001600160401b03821117610c3d57604052565b610c0a565b6040519190601f01601f191682016001600160401b03811183821017610c3d57604052565b6001600160401b038111610c3d5760051b60200190565b6001600160401b038111610c3d57601f01601f191660200190565b929192610ca8610b0583610c7e565b93828552828201116100f057815f926020928387013784010152565b5f80356001600160e01b03191681525f5160206116545f395f51905f52602052604090205460601c8015610d26575b803b15610d17575f8091368280378136915af43d5f803e15610d13573d5ff35b3d5ffd5b6321f27f0d60e21b5f5260045ffd5b505f5160206116b45f395f51905f52546001600160a01b0316610cf3565b63ffffffff60e01b165f525f5160206116545f395f51905f5260205260405f2090565b9063ffffffff60e01b165f5260205260405f2090565b5f525f5160206116945f395f51905f5260205260405f2090565b634e487b7160e01b5f52603260045260245ffd5b805115610db85760200190565b610d97565b8051821015610db85760209160051b010190565b60031115610ddb57565b634e487b7160e01b5f52602160045260245ffd5b91908251928382525f5b848110610e19575050825f602080949584010152601f8019910116010190565b80602080928401015182828601015201610df9565b93929091936060810160608252835180915260808201602060808360051b8501019501915f5b818110610e85575050506001600160a01b039095166020820152929350610e82926040818403910152610def565b90565b848703607f19018352835180516001600160a01b031688526020810151949793949293919291906003831015610ddb57610ed982606060406020959460019787809701520151918160408201520190610506565b98019401929101610e54565b610f016102fe5f5160206116345f395f51905f525461ffff1690565b9384935f9360078716611064575b5f95945b8451871015610fd257610f268786610dbd565b516020810151610f3581610dd1565b60408201515115610fc357610f4981610dd1565b80610f6a5750906001969798610f5e9261144c565b9590975b019594610f13565b610f778199939899610dd1565b60018103610f91575090610f8c600192611364565b610f62565b80610f9d600292610dd1565b14610fac575b50600190610f62565b95610fba9198600197611144565b95909790610fa3565b63eb6c3aeb60e01b5f5260045ffd5b610b4496507f8faa70878671ccd212d20771b795c50af8fd3ff6cf27f4bde57e5d4de0aeb673939782959293968103611042575b60078116611029575b50506110218560405193849384610e2e565b0390a1611588565b61103a9060031c610d7d565b610d7d565b555f8061100f565b5f5160206116345f395f51905f52805461ffff191661ffff8316179055611006565b93506110736110358760031c90565b5493610f0f565b90611087610b0583610c67565b8281528092611098601f1991610c67565b0190602036910137565b634e487b7160e01b5f52601160045260245ffd5b5f1981146110c45760010190565b6110a2565b906110d6610b0583610c67565b82815280926110e7601f1991610c67565b015f5b8181106110f657505050565b6040519060408201918083106001600160401b03841117610c3d576020926040525f8152606083820152828286010152016110ea565b156100f057565b60ff1660ff81146110c45760010190565b8051929390929091906001600160a01b0316611355575f935b604084015191825186101561134e5761117d8661118b925f190194610dbd565b516001600160e01b03191690565b6111a2815f5160206116545f395f51905f52610d67565b54915f6111bc835f5160206116545f395f51905f52610d67565b558260601c801561133f5730146113305760078416600781146112f5575b816103816111e89260051b90565b916001600160e01b0319908116908316036112a3575b6112216102fe6007611215600387901c611fff1683565b951660051b61ffe01690565b9261122c8560031c90565b810361124d5750604092600192611242926115fa565b955b0194905061115d565b61129d61128160409560019561127b855f5160206116945f395f51905f529d979d905f5260205260405f2090565b546115fa565b915f5160206116945f395f51905f52905f5260205260405f2090565b55611244565b6112cd6112c0610393845f5160206116545f395f51905f52610d67565b6001600160601b03191690565b6001600160601b038416176112ef835f5160206116545f395f51905f52610d67565b556111fe565b61038191506111e89061132661130b8760031c90565b5f5160206116945f395f51905f52905f5260205260405f2090565b54925090506111da565b63e983573160e01b5f5260045ffd5b6337e25a9760e11b5f5260045ffd5b9450925050565b633ab3490960e21b5f5260045ffd5b80519091906001600160a01b03163b1561143d575f5b604083015180518210156114375761117d8261139592610dbd565b906113ad825f5160206116545f395f51905f52610d67565b54918260601c801561133f573081146113305785516113d4906001600160a01b0316610421565b1461142857845160019361142191611404906112c0906001600160a01b03165b60601b6001600160601b03191690565b90858060601b031617915f5160206116545f395f51905f52610d67565b550161137a565b6330baabf360e11b5f5260045ffd5b50509050565b633ddc5cab60e21b5f5260045ffd5b80519293929091906001600160a01b0316803b15611545575081516001600160a01b03166001600160a01b03163014611330575b5f905b6040830151805183101561153d5761117d8361149e92610dbd565b946114b6865f5160206116545f395f51905f52610d67565b5461152e5760019160e061150a84936114db6112c06113f48a5160018060a01b031690565b84176114f48b5f5160206116545f395f51905f52610d67565b556115026007851660051b90565b998a916115fa565b971461151a575b01910190611483565b8661152861130b8360031c90565b55611511565b634923a77160e11b5f5260045ffd5b509150509190565b6001600160a01b0316301461148057633ddc5cab60e21b5f5260045ffd5b3d15611583573d90611577610b0583610c7e565b9182523d5f602084013e565b606090565b81516001600160a01b038216908115901581036115eb57156115a957505050565b30036115d6575b815f929160208493519201905af46115c6611563565b50156115ce57565b3d5f803e3d5ffd5b803b6115b057633ddc5cab60e21b5f5260045ffd5b6326df4ccd60e01b5f5260045ffd5b6001600160e01b031980841c19909116911690911c179056fe24aa1f7b31fd188a8d3ecfb06bc55c806040e59b03bd4396283442fce6617890177481ac65e4292921c69f62d1cc7f57541261e5d61c8175cf4e36a01c9bfc94177481ac65e4292921c69f62d1cc7f57541261e5d61c8175cf4e36a01c9bfc938a22373512790c48b83a1fe2efdd2888d4a917bcdc24d0adf63e60f671680460177481ac65e4292921c69f62d1cc7f57541261e5d61c8175cf4e36a01c9bfc95177481ac65e4292921c69f62d1cc7f57541261e5d61c8175cf4e36a01c9bfc96a2646970667358221220a2b01f952fc4903f49fb013868e4945d8d535f1dc42b752373407db7701c63b064736f6c634300081d0033
Loading...
Loading
Loading...
Loading
Loading...
Loading
Net Worth in USD
$259,735.97
Net Worth in ETH
107.859707
Token Allocations
PRFI
100.00%
Multichain Portfolio | 32 Chains
| Chain | Token | Portfolio % | Price | Amount | Value |
|---|---|---|---|---|---|
| BASE | 100.00% | $0.023252 | 11,170,517.1556 | $259,735.97 |
Loading...
Loading
Loading...
Loading
Loading...
Loading
[ Download: CSV Export ]
[ Download: CSV Export ]
A contract address hosts a smart contract, which is a set of code stored on the blockchain that runs when predetermined conditions are met. Learn more about addresses in our Knowledge Base.