Contract 0xfaab63d33C98f9c0D9D57a0833E56E4184283385

 

Contract Overview

Balance:
0 MATIC

MATIC Value:
$0.00

Token:
 
Txn Hash Method
Block
From
To
Value [Txn Fee]
0xc3a94156540fc3ce1aab319a78f4c34df110758d7d13699e00df818c611c2e9dLike253969332022-02-27 20:19:09123 days 14 mins ago0x035ddd682c9668c6a3a350a569fa5b629a749faf IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.033261342773 68.614466163
0x60c2fdf5d58954202191acc1dfb65616307df42490e85adc75ff2779e74a050fLike229131992021-12-24 16:55:09188 days 3 hrs ago0x3615f40695f79baa90c99ab92fde1571663c220c IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004847451
0xf1ec01da47e42b02e7ce4ad1f3cef399d94f458ea7583b798c2ef4fbe232fd7dLike202649972021-10-16 3:10:51257 days 17 hrs ago0x041d8e6eedab44a6a26ce5fed9fc0c169006d298 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676451
0x04598bf25e05f1ce18724139fcf09f35c1e256e211c034576fe5cd94a3049b16Like186366522021-09-01 20:16:46302 days 16 mins ago0xd97dac3d4348a99d52bc1de369fc45e6f1f38954 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676451
0xdd3af42d7a59d2e367a94825a119d8e558bdabbd0e8de5485a121d9b03b8ea0eLike186119082021-09-01 4:11:58302 days 16 hrs ago0xd97dac3d4348a99d52bc1de369fc45e6f1f38954 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0009353142
0xafd90fee12c9c313c0d9173a14022a0da1f9f627003b3f27cba7ef285c3fdd01Like182159152021-08-21 2:34:23313 days 17 hrs ago0xd2670345586f92a1d93933d1a3c5770c42fd5ab8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.00098207972.1
0xc13d799fc160b62c2f3a380ea86c1e57ebb7ac8833e35afd841a33828bd207a1Like178426482021-08-10 20:21:44324 days 11 mins ago0x2a22dcb3190b91e625fcf432dea20105f6f6077c IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004847571
0x81cbaaff3b97c89ee283959ad3129492913901950e4d3e6128412409b1649a5eLike175178192021-08-02 1:36:15332 days 18 hrs ago0xd2670345586f92a1d93933d1a3c5770c42fd5ab8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0x5ffa9ce0d99f107e80ef071105c609ddf227488292a6d179cc63bde99e4ad025Like174057202021-07-29 22:19:02335 days 22 hrs ago0xd2670345586f92a1d93933d1a3c5770c42fd5ab8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0xce7941f3b977d1b8836c97f8a53c81529b1dd68b9f73f5b29838c6ddbe2552afLike173259072021-07-27 14:27:02338 days 6 hrs ago0xd2670345586f92a1d93933d1a3c5770c42fd5ab8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0xde680676b9730a9324c7a353bcb29cb7ecb58d85ebf4b94f0fe3018903b32320Like172925952021-07-26 14:50:53339 days 5 hrs ago0xd2670345586f92a1d93933d1a3c5770c42fd5ab8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0x493b8daf84f6a7d9ff81c4c87031ce2accc2b7f77a443b2743db788ce63500a4Like172307282021-07-24 21:12:29340 days 23 hrs ago0xd2670345586f92a1d93933d1a3c5770c42fd5ab8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0xc8d724f8f3f14c9999588ba87b62005a9619ba8a4a986162251d9e569e0f5b1bLike172300022021-07-24 20:38:03340 days 23 hrs ago0xd2670345586f92a1d93933d1a3c5770c42fd5ab8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0xd15ed84a8d3fe305f9645497e66621af222fde01649413dd0508c57779c825d1Like172224402021-07-24 15:28:43341 days 5 hrs ago0xd2670345586f92a1d93933d1a3c5770c42fd5ab8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0x22a3a0839648de4c64562adae72c494f76e422da7a24a1eb281deebb32941f6cLike171530572021-07-22 18:26:32343 days 2 hrs ago0xd2670345586f92a1d93933d1a3c5770c42fd5ab8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0000383291
0x57c3e9b0b60fd453cb6e82683f57b48c097bad0f6ca06938f40c4ae676bf8a84Like171530572021-07-22 18:26:32343 days 2 hrs ago0xd2670345586f92a1d93933d1a3c5770c42fd5ab8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0x018e12a60db46e6617307d1302c6367754441f9645ffb1842e9b4bd19da6d663Like170837392021-07-20 20:32:52345 days ago0xd2670345586f92a1d93933d1a3c5770c42fd5ab8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004847571
0xad6384ea6b8328bf0dc28aee4d54a2cabaf5edaf536896ebc469e11a01866ebdLike170134912021-07-18 23:18:48346 days 21 hrs ago0xfb9a326e1d8a80dca9653edd57f8f2defcdc01c8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0xcca6d21d98e6421b7d8c8185b3e6827eb59bfccd8c02f55194949b27b5ef6128Like170127312021-07-18 22:50:32346 days 21 hrs ago0xfb9a326e1d8a80dca9653edd57f8f2defcdc01c8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0xe2d459645b805a1e6db5279cd17637e0823a625ee107a3f4a6724aa37e58f839Like170127312021-07-18 22:50:32346 days 21 hrs ago0xfb9a326e1d8a80dca9653edd57f8f2defcdc01c8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0x0423b1c38d3a9245bf9378d77795652c32ba67e19e865d13f8a2be8843c343b2Like168192752021-07-13 14:23:25352 days 6 hrs ago0xfb9a326e1d8a80dca9653edd57f8f2defcdc01c8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676571
0xc2846bd8529b2e42c8a8827ba967a32081f3021672cf7008e4559efc4596c45cLike165528982021-07-06 6:53:00359 days 13 hrs ago0xbc43fe879fbce871594850f01f8c1ccf05e7679e IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004847571
0x3fdfe0cd99e094c21451d8e9ec66df6d4ae5bc5c74ba57d22f852bb67fc644eaLike164544972021-07-03 19:07:31362 days 1 hr ago0x183227035c98ef8da1714bb97b15fc9c9ac5941d IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676451
0xd8c1efb9dfe05f2ae30e743b30429ecfb19bb1f7d3ab3f7f9d78f5194eeb6fbfLike164544652021-07-03 19:06:27362 days 1 hr ago0x5323a5cf1d7610f4aba47348846043f0624b3a6e IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676451
0x766a1229ef5f39a9b9bc0eecc113c39cfdc20c0cb3b164b085040c0cf34f3c66Like163736892021-07-01 18:12:15364 days 2 hrs ago0xfb9a326e1d8a80dca9653edd57f8f2defcdc01c8 IN  0xfaab63d33c98f9c0d9d57a0833e56e41842833850 MATIC0.0004676451
[ Download CSV Export 
Parent Txn Hash Block From To Value
Loading

Contract Source Code Verified (Exact Match)

Contract Name:
Liker

Compiler Version
v0.6.6+commit.6c089d02

Optimization Enabled:
Yes with 200 runs

Other Settings:
default evmVersion, None license

Contract Source Code (Solidity)

/**
 *Submitted for verification at polygonscan.com on 2021-06-30
*/

// Sources flattened with hardhat v2.1.2 https://hardhat.org

// File @openzeppelin/contracts/math/[email protected]

pragma solidity >=0.6.0 <0.8.0;

/**
 * @dev Wrappers over Solidity's arithmetic operations with added overflow
 * checks.
 *
 * Arithmetic operations in Solidity wrap on overflow. This can easily result
 * in bugs, because programmers usually assume that an overflow raises an
 * error, which is the standard behavior in high level programming languages.
 * `SafeMath` restores this intuition by reverting the transaction when an
 * operation overflows.
 *
 * Using this library instead of the unchecked operations eliminates an entire
 * class of bugs, so it's recommended to use it always.
 */
library SafeMath {
    /**
     * @dev Returns the addition of two unsigned integers, with an overflow flag.
     *
     * _Available since v3.4._
     */
    function tryAdd(uint256 a, uint256 b)
        internal
        pure
        returns (bool, uint256)
    {
        uint256 c = a + b;
        if (c < a) return (false, 0);
        return (true, c);
    }

    /**
     * @dev Returns the substraction of two unsigned integers, with an overflow flag.
     *
     * _Available since v3.4._
     */
    function trySub(uint256 a, uint256 b)
        internal
        pure
        returns (bool, uint256)
    {
        if (b > a) return (false, 0);
        return (true, a - b);
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with an overflow flag.
     *
     * _Available since v3.4._
     */
    function tryMul(uint256 a, uint256 b)
        internal
        pure
        returns (bool, uint256)
    {
        // Gas optimization: this is cheaper than requiring 'a' not being zero, but the
        // benefit is lost if 'b' is also tested.
        // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
        if (a == 0) return (true, 0);
        uint256 c = a * b;
        if (c / a != b) return (false, 0);
        return (true, c);
    }

    /**
     * @dev Returns the division of two unsigned integers, with a division by zero flag.
     *
     * _Available since v3.4._
     */
    function tryDiv(uint256 a, uint256 b)
        internal
        pure
        returns (bool, uint256)
    {
        if (b == 0) return (false, 0);
        return (true, a / b);
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a division by zero flag.
     *
     * _Available since v3.4._
     */
    function tryMod(uint256 a, uint256 b)
        internal
        pure
        returns (bool, uint256)
    {
        if (b == 0) return (false, 0);
        return (true, a % b);
    }

    /**
     * @dev Returns the addition of two unsigned integers, reverting on
     * overflow.
     *
     * Counterpart to Solidity's `+` operator.
     *
     * Requirements:
     *
     * - Addition cannot overflow.
     */
    function add(uint256 a, uint256 b) internal pure returns (uint256) {
        uint256 c = a + b;
        require(c >= a, "SafeMath: addition overflow");
        return c;
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, reverting on
     * overflow (when the result is negative).
     *
     * Counterpart to Solidity's `-` operator.
     *
     * Requirements:
     *
     * - Subtraction cannot overflow.
     */
    function sub(uint256 a, uint256 b) internal pure returns (uint256) {
        require(b <= a, "SafeMath: subtraction overflow");
        return a - b;
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, reverting on
     * overflow.
     *
     * Counterpart to Solidity's `*` operator.
     *
     * Requirements:
     *
     * - Multiplication cannot overflow.
     */
    function mul(uint256 a, uint256 b) internal pure returns (uint256) {
        if (a == 0) return 0;
        uint256 c = a * b;
        require(c / a == b, "SafeMath: multiplication overflow");
        return c;
    }

    /**
     * @dev Returns the integer division of two unsigned integers, reverting on
     * division by zero. The result is rounded towards zero.
     *
     * Counterpart to Solidity's `/` operator. Note: this function uses a
     * `revert` opcode (which leaves remaining gas untouched) while Solidity
     * uses an invalid opcode to revert (consuming all remaining gas).
     *
     * Requirements:
     *
     * - The divisor cannot be zero.
     */
    function div(uint256 a, uint256 b) internal pure returns (uint256) {
        require(b > 0, "SafeMath: division by zero");
        return a / b;
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo),
     * reverting when dividing by zero.
     *
     * Counterpart to Solidity's `%` operator. This function uses a `revert`
     * opcode (which leaves remaining gas untouched) while Solidity uses an
     * invalid opcode to revert (consuming all remaining gas).
     *
     * Requirements:
     *
     * - The divisor cannot be zero.
     */
    function mod(uint256 a, uint256 b) internal pure returns (uint256) {
        require(b > 0, "SafeMath: modulo by zero");
        return a % b;
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, reverting with custom message on
     * overflow (when the result is negative).
     *
     * CAUTION: This function is deprecated because it requires allocating memory for the error
     * message unnecessarily. For custom revert reasons use {trySub}.
     *
     * Counterpart to Solidity's `-` operator.
     *
     * Requirements:
     *
     * - Subtraction cannot overflow.
     */
    function sub(
        uint256 a,
        uint256 b,
        string memory errorMessage
    ) internal pure returns (uint256) {
        require(b <= a, errorMessage);
        return a - b;
    }

    /**
     * @dev Returns the integer division of two unsigned integers, reverting with custom message on
     * division by zero. The result is rounded towards zero.
     *
     * CAUTION: This function is deprecated because it requires allocating memory for the error
     * message unnecessarily. For custom revert reasons use {tryDiv}.
     *
     * Counterpart to Solidity's `/` operator. Note: this function uses a
     * `revert` opcode (which leaves remaining gas untouched) while Solidity
     * uses an invalid opcode to revert (consuming all remaining gas).
     *
     * Requirements:
     *
     * - The divisor cannot be zero.
     */
    function div(
        uint256 a,
        uint256 b,
        string memory errorMessage
    ) internal pure returns (uint256) {
        require(b > 0, errorMessage);
        return a / b;
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo),
     * reverting with custom message when dividing by zero.
     *
     * CAUTION: This function is deprecated because it requires allocating memory for the error
     * message unnecessarily. For custom revert reasons use {tryMod}.
     *
     * Counterpart to Solidity's `%` operator. This function uses a `revert`
     * opcode (which leaves remaining gas untouched) while Solidity uses an
     * invalid opcode to revert (consuming all remaining gas).
     *
     * Requirements:
     *
     * - The divisor cannot be zero.
     */
    function mod(
        uint256 a,
        uint256 b,
        string memory errorMessage
    ) internal pure returns (uint256) {
        require(b > 0, errorMessage);
        return a % b;
    }
}

// File @openzeppelin/contracts/utils/[email protected]

pragma solidity >=0.6.0 <0.8.0;

/**
 * @title Counters
 * @author Matt Condon (@shrugs)
 * @dev Provides counters that can only be incremented or decremented by one. This can be used e.g. to track the number
 * of elements in a mapping, issuing ERC721 ids, or counting request ids.
 *
 * Include with `using Counters for Counters.Counter;`
 * Since it is not possible to overflow a 256 bit integer with increments of one, `increment` can skip the {SafeMath}
 * overflow check, thereby saving gas. This does assume however correct usage, in that the underlying `_value` is never
 * directly accessed.
 */
library Counters {
    using SafeMath for uint256;

    struct Counter {
        // This variable should never be directly accessed by users of the library: interactions must be restricted to
        // the library's function. As of Solidity v0.5.2, this cannot be enforced, though there is a proposal to add
        // this feature: see https://github.com/ethereum/solidity/issues/4637
        uint256 _value; // default: 0
    }

    function current(Counter storage counter) internal view returns (uint256) {
        return counter._value;
    }

    function increment(Counter storage counter) internal {
        // The {SafeMath} overflow check can be skipped here, see the comment at the top
        counter._value += 1;
    }

    function decrement(Counter storage counter) internal {
        counter._value = counter._value.sub(1);
    }
}

// File @openzeppelin/contracts/utils/[email protected]

pragma solidity >=0.6.0 <0.8.0;

/*
 * @dev Provides information about the current execution context, including the
 * sender of the transaction and its data. While these are generally available
 * via msg.sender and msg.data, they should not be accessed in such a direct
 * manner, since when dealing with GSN meta-transactions the account sending and
 * paying for execution may not be the actual sender (as far as an application
 * is concerned).
 *
 * This contract is only required for intermediate, library-like contracts.
 */
abstract contract Context {
    function _msgSender() internal view virtual returns (address payable) {
        return msg.sender;
    }

    function _msgData() internal view virtual returns (bytes memory) {
        this; // silence state mutability warning without generating bytecode - see https://github.com/ethereum/solidity/issues/2691
        return msg.data;
    }
}

// File @openzeppelin/contracts/access/[email protected]

pragma solidity >=0.6.0 <0.8.0;

/**
 * @dev Contract module which provides a basic access control mechanism, where
 * there is an account (an owner) that can be granted exclusive access to
 * specific functions.
 *
 * By default, the owner account will be the one that deploys the contract. This
 * can later be changed with {transferOwnership}.
 *
 * This module is used through inheritance. It will make available the modifier
 * `onlyOwner`, which can be applied to your functions to restrict their use to
 * the owner.
 */
abstract contract Ownable is Context {
    address private _owner;

    event OwnershipTransferred(
        address indexed previousOwner,
        address indexed newOwner
    );

    /**
     * @dev Initializes the contract setting the deployer as the initial owner.
     */
    constructor() internal {
        address msgSender = _msgSender();
        _owner = msgSender;
        emit OwnershipTransferred(address(0), msgSender);
    }

    /**
     * @dev Returns the address of the current owner.
     */
    function owner() public view virtual returns (address) {
        return _owner;
    }

    /**
     * @dev Throws if called by any account other than the owner.
     */
    modifier onlyOwner() {
        require(owner() == _msgSender(), "Ownable: caller is not the owner");
        _;
    }

    /**
     * @dev Leaves the contract without owner. It will not be possible to call
     * `onlyOwner` functions anymore. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby removing any functionality that is only available to the owner.
     */
    function renounceOwnership() public virtual onlyOwner {
        emit OwnershipTransferred(_owner, address(0));
        _owner = address(0);
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        require(
            newOwner != address(0),
            "Ownable: new owner is the zero address"
        );
        emit OwnershipTransferred(_owner, newOwner);
        _owner = newOwner;
    }
}

// File @opengsn/gsn/contracts/0x/errors/[email protected]

/*

  Copyright 2020 ZeroEx Intl.

  Licensed under the Apache License, Version 2.0 (the "License");
  you may not use this file except in compliance with the License.
  You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

  Unless required by applicable law or agreed to in writing, software
  distributed under the License is distributed on an "AS IS" BASIS,
  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  See the License for the specific language governing permissions and
  limitations under the License.

*/

pragma solidity ^0.6.2;

library LibBytesRichErrorsV06 {
    enum InvalidByteOperationErrorCodes {
        FromLessThanOrEqualsToRequired,
        ToLessThanOrEqualsLengthRequired,
        LengthGreaterThanZeroRequired,
        LengthGreaterThanOrEqualsFourRequired,
        LengthGreaterThanOrEqualsTwentyRequired,
        LengthGreaterThanOrEqualsThirtyTwoRequired,
        LengthGreaterThanOrEqualsNestedBytesLengthRequired,
        DestinationLengthGreaterThanOrEqualSourceLengthRequired
    }

    // bytes4(keccak256("InvalidByteOperationError(uint8,uint256,uint256)"))
    bytes4 internal constant INVALID_BYTE_OPERATION_ERROR_SELECTOR = 0x28006595;

    // solhint-disable func-name-mixedcase
    function InvalidByteOperationError(
        InvalidByteOperationErrorCodes errorCode,
        uint256 offset,
        uint256 required
    ) internal pure returns (bytes memory) {
        return
            abi.encodeWithSelector(
                INVALID_BYTE_OPERATION_ERROR_SELECTOR,
                errorCode,
                offset,
                required
            );
    }
}

// File @opengsn/gsn/contracts/0x/errors/[email protected]

/*

  Copyright 2020 ZeroEx Intl.

  Licensed under the Apache License, Version 2.0 (the "License");
  you may not use this file except in compliance with the License.
  You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

  Unless required by applicable law or agreed to in writing, software
  distributed under the License is distributed on an "AS IS" BASIS,
  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  See the License for the specific language governing permissions and
  limitations under the License.

*/

pragma solidity ^0.6.2;

library LibRichErrorsV06 {
    // bytes4(keccak256("Error(string)"))
    bytes4 internal constant STANDARD_ERROR_SELECTOR = 0x08c379a0;

    // solhint-disable func-name-mixedcase
    /// @dev ABI encode a standard, string revert error payload.
    ///      This is the same payload that would be included by a `revert(string)`
    ///      solidity statement. It has the function signature `Error(string)`.
    /// @param message The error string.
    /// @return The ABI encoded error.
    function StandardError(string memory message)
        internal
        pure
        returns (bytes memory)
    {
        return abi.encodeWithSelector(STANDARD_ERROR_SELECTOR, bytes(message));
    }

    // solhint-enable func-name-mixedcase

    /// @dev Reverts an encoded rich revert reason `errorData`.
    /// @param errorData ABI encoded error data.
    function rrevert(bytes memory errorData) internal pure {
        assembly {
            revert(add(errorData, 0x20), mload(errorData))
        }
    }
}

// File @opengsn/gsn/contracts/0x/[email protected]

/*

  Copyright 2020 ZeroEx Intl.

  Licensed under the Apache License, Version 2.0 (the "License");
  you may not use this file except in compliance with the License.
  You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

  Unless required by applicable law or agreed to in writing, software
  distributed under the License is distributed on an "AS IS" BASIS,
  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  See the License for the specific language governing permissions and
  limitations under the License.

*/

pragma solidity ^0.6.2;

library LibBytesV06 {
    using LibBytesV06 for bytes;

    /// @dev Gets the memory address for a byte array.
    /// @param input Byte array to lookup.
    /// @return memoryAddress Memory address of byte array. This
    ///         points to the header of the byte array which contains
    ///         the length.
    function rawAddress(bytes memory input)
        internal
        pure
        returns (uint256 memoryAddress)
    {
        assembly {
            memoryAddress := input
        }
        return memoryAddress;
    }

    /// @dev Gets the memory address for the contents of a byte array.
    /// @param input Byte array to lookup.
    /// @return memoryAddress Memory address of the contents of the byte array.
    function contentAddress(bytes memory input)
        internal
        pure
        returns (uint256 memoryAddress)
    {
        assembly {
            memoryAddress := add(input, 32)
        }
        return memoryAddress;
    }

    /// @dev Copies `length` bytes from memory location `source` to `dest`.
    /// @param dest memory address to copy bytes to.
    /// @param source memory address to copy bytes from.
    /// @param length number of bytes to copy.
    function memCopy(
        uint256 dest,
        uint256 source,
        uint256 length
    ) internal pure {
        if (length < 32) {
            // Handle a partial word by reading destination and masking
            // off the bits we are interested in.
            // This correctly handles overlap, zero lengths and source == dest
            assembly {
                let mask := sub(exp(256, sub(32, length)), 1)
                let s := and(mload(source), not(mask))
                let d := and(mload(dest), mask)
                mstore(dest, or(s, d))
            }
        } else {
            // Skip the O(length) loop when source == dest.
            if (source == dest) {
                return;
            }

            // For large copies we copy whole words at a time. The final
            // word is aligned to the end of the range (instead of after the
            // previous) to handle partial words. So a copy will look like this:
            //
            //  ####
            //      ####
            //          ####
            //            ####
            //
            // We handle overlap in the source and destination range by
            // changing the copying direction. This prevents us from
            // overwriting parts of source that we still need to copy.
            //
            // This correctly handles source == dest
            //
            if (source > dest) {
                assembly {
                    // We subtract 32 from `sEnd` and `dEnd` because it
                    // is easier to compare with in the loop, and these
                    // are also the addresses we need for copying the
                    // last bytes.
                    length := sub(length, 32)
                    let sEnd := add(source, length)
                    let dEnd := add(dest, length)

                    // Remember the last 32 bytes of source
                    // This needs to be done here and not after the loop
                    // because we may have overwritten the last bytes in
                    // source already due to overlap.
                    let last := mload(sEnd)

                    // Copy whole words front to back
                    // Note: the first check is always true,
                    // this could have been a do-while loop.
                    // solhint-disable-next-line no-empty-blocks
                    for {

                    } lt(source, sEnd) {

                    } {
                        mstore(dest, mload(source))
                        source := add(source, 32)
                        dest := add(dest, 32)
                    }

                    // Write the last 32 bytes
                    mstore(dEnd, last)
                }
            } else {
                assembly {
                    // We subtract 32 from `sEnd` and `dEnd` because those
                    // are the starting points when copying a word at the end.
                    length := sub(length, 32)
                    let sEnd := add(source, length)
                    let dEnd := add(dest, length)

                    // Remember the first 32 bytes of source
                    // This needs to be done here and not after the loop
                    // because we may have overwritten the first bytes in
                    // source already due to overlap.
                    let first := mload(source)

                    // Copy whole words back to front
                    // We use a signed comparisson here to allow dEnd to become
                    // negative (happens when source and dest < 32). Valid
                    // addresses in local memory will never be larger than
                    // 2**255, so they can be safely re-interpreted as signed.
                    // Note: the first check is always true,
                    // this could have been a do-while loop.
                    // solhint-disable-next-line no-empty-blocks
                    for {

                    } slt(dest, dEnd) {

                    } {
                        mstore(dEnd, mload(sEnd))
                        sEnd := sub(sEnd, 32)
                        dEnd := sub(dEnd, 32)
                    }

                    // Write the first 32 bytes
                    mstore(dest, first)
                }
            }
        }
    }

    /// @dev Returns a slices from a byte array.
    /// @param b The byte array to take a slice from.
    /// @param from The starting index for the slice (inclusive).
    /// @param to The final index for the slice (exclusive).
    /// @return result The slice containing bytes at indices [from, to)
    function slice(
        bytes memory b,
        uint256 from,
        uint256 to
    ) internal pure returns (bytes memory result) {
        // Ensure that the from and to positions are valid positions for a slice within
        // the byte array that is being used.
        if (from > to) {
            LibRichErrorsV06.rrevert(
                LibBytesRichErrorsV06.InvalidByteOperationError(
                    LibBytesRichErrorsV06
                        .InvalidByteOperationErrorCodes
                        .FromLessThanOrEqualsToRequired,
                    from,
                    to
                )
            );
        }
        if (to > b.length) {
            LibRichErrorsV06.rrevert(
                LibBytesRichErrorsV06.InvalidByteOperationError(
                    LibBytesRichErrorsV06
                        .InvalidByteOperationErrorCodes
                        .ToLessThanOrEqualsLengthRequired,
                    to,
                    b.length
                )
            );
        }

        // Create a new bytes structure and copy contents
        result = new bytes(to - from);
        memCopy(
            result.contentAddress(),
            b.contentAddress() + from,
            result.length
        );
        return result;
    }

    /// @dev Returns a slice from a byte array without preserving the input.
    ///      When `from == 0`, the original array will match the slice.
    ///      In other cases its state will be corrupted.
    /// @param b The byte array to take a slice from. Will be destroyed in the process.
    /// @param from The starting index for the slice (inclusive).
    /// @param to The final index for the slice (exclusive).
    /// @return result The slice containing bytes at indices [from, to)
    function sliceDestructive(
        bytes memory b,
        uint256 from,
        uint256 to
    ) internal pure returns (bytes memory result) {
        // Ensure that the from and to positions are valid positions for a slice within
        // the byte array that is being used.
        if (from > to) {
            LibRichErrorsV06.rrevert(
                LibBytesRichErrorsV06.InvalidByteOperationError(
                    LibBytesRichErrorsV06
                        .InvalidByteOperationErrorCodes
                        .FromLessThanOrEqualsToRequired,
                    from,
                    to
                )
            );
        }
        if (to > b.length) {
            LibRichErrorsV06.rrevert(
                LibBytesRichErrorsV06.InvalidByteOperationError(
                    LibBytesRichErrorsV06
                        .InvalidByteOperationErrorCodes
                        .ToLessThanOrEqualsLengthRequired,
                    to,
                    b.length
                )
            );
        }

        // Create a new bytes structure around [from, to) in-place.
        assembly {
            result := add(b, from)
            mstore(result, sub(to, from))
        }
        return result;
    }

    /// @dev Pops the last byte off of a byte array by modifying its length.
    /// @param b Byte array that will be modified.
    /// @return result The byte that was popped off.
    function popLastByte(bytes memory b) internal pure returns (bytes1 result) {
        if (b.length == 0) {
            LibRichErrorsV06.rrevert(
                LibBytesRichErrorsV06.InvalidByteOperationError(
                    LibBytesRichErrorsV06
                        .InvalidByteOperationErrorCodes
                        .LengthGreaterThanZeroRequired,
                    b.length,
                    0
                )
            );
        }

        // Store last byte.
        result = b[b.length - 1];

        assembly {
            // Decrement length of byte array.
            let newLen := sub(mload(b), 1)
            mstore(b, newLen)
        }
        return result;
    }

    /// @dev Tests equality of two byte arrays.
    /// @param lhs First byte array to compare.
    /// @param rhs Second byte array to compare.
    /// @return equal True if arrays are the same. False otherwise.
    function equals(bytes memory lhs, bytes memory rhs)
        internal
        pure
        returns (bool equal)
    {
        // Keccak gas cost is 30 + numWords * 6. This is a cheap way to compare.
        // We early exit on unequal lengths, but keccak would also correctly
        // handle this.
        return lhs.length == rhs.length && keccak256(lhs) == keccak256(rhs);
    }

    /// @dev Reads an address from a position in a byte array.
    /// @param b Byte array containing an address.
    /// @param index Index in byte array of address.
    /// @return result address from byte array.
    function readAddress(bytes memory b, uint256 index)
        internal
        pure
        returns (address result)
    {
        if (b.length < index + 20) {
            LibRichErrorsV06.rrevert(
                LibBytesRichErrorsV06.InvalidByteOperationError(
                    LibBytesRichErrorsV06
                        .InvalidByteOperationErrorCodes
                        .LengthGreaterThanOrEqualsTwentyRequired,
                    b.length,
                    index + 20 // 20 is length of address
                )
            );
        }

        // Add offset to index:
        // 1. Arrays are prefixed by 32-byte length parameter (add 32 to index)
        // 2. Account for size difference between address length and 32-byte storage word (subtract 12 from index)
        index += 20;

        // Read address from array memory
        assembly {
            // 1. Add index to address of bytes array
            // 2. Load 32-byte word from memory
            // 3. Apply 20-byte mask to obtain address
            result := and(
                mload(add(b, index)),
                0xffffffffffffffffffffffffffffffffffffffff
            )
        }
        return result;
    }

    /// @dev Writes an address into a specific position in a byte array.
    /// @param b Byte array to insert address into.
    /// @param index Index in byte array of address.
    /// @param input Address to put into byte array.
    function writeAddress(
        bytes memory b,
        uint256 index,
        address input
    ) internal pure {
        if (b.length < index + 20) {
            LibRichErrorsV06.rrevert(
                LibBytesRichErrorsV06.InvalidByteOperationError(
                    LibBytesRichErrorsV06
                        .InvalidByteOperationErrorCodes
                        .LengthGreaterThanOrEqualsTwentyRequired,
                    b.length,
                    index + 20 // 20 is length of address
                )
            );
        }

        // Add offset to index:
        // 1. Arrays are prefixed by 32-byte length parameter (add 32 to index)
        // 2. Account for size difference between address length and 32-byte storage word (subtract 12 from index)
        index += 20;

        // Store address into array memory
        assembly {
            // The address occupies 20 bytes and mstore stores 32 bytes.
            // First fetch the 32-byte word where we'll be storing the address, then
            // apply a mask so we have only the bytes in the word that the address will not occupy.
            // Then combine these bytes with the address and store the 32 bytes back to memory with mstore.

            // 1. Add index to address of bytes array
            // 2. Load 32-byte word from memory
            // 3. Apply 12-byte mask to obtain extra bytes occupying word of memory where we'll store the address
            let neighbors := and(
                mload(add(b, index)),
                0xffffffffffffffffffffffff0000000000000000000000000000000000000000
            )

            // Make sure input address is clean.
            // (Solidity does not guarantee this)
            input := and(input, 0xffffffffffffffffffffffffffffffffffffffff)

            // Store the neighbors and address into memory
            mstore(add(b, index), xor(input, neighbors))
        }
    }

    /// @dev Reads a bytes32 value from a position in a byte array.
    /// @param b Byte array containing a bytes32 value.
    /// @param index Index in byte array of bytes32 value.
    /// @return result bytes32 value from byte array.
    function readBytes32(bytes memory b, uint256 index)
        internal
        pure
        returns (bytes32 result)
    {
        if (b.length < index + 32) {
            LibRichErrorsV06.rrevert(
                LibBytesRichErrorsV06.InvalidByteOperationError(
                    LibBytesRichErrorsV06
                        .InvalidByteOperationErrorCodes
                        .LengthGreaterThanOrEqualsThirtyTwoRequired,
                    b.length,
                    index + 32
                )
            );
        }

        // Arrays are prefixed by a 256 bit length parameter
        index += 32;

        // Read the bytes32 from array memory
        assembly {
            result := mload(add(b, index))
        }
        return result;
    }

    /// @dev Writes a bytes32 into a specific position in a byte array.
    /// @param b Byte array to insert <input> into.
    /// @param index Index in byte array of <input>.
    /// @param input bytes32 to put into byte array.
    function writeBytes32(
        bytes memory b,
        uint256 index,
        bytes32 input
    ) internal pure {
        if (b.length < index + 32) {
            LibRichErrorsV06.rrevert(
                LibBytesRichErrorsV06.InvalidByteOperationError(
                    LibBytesRichErrorsV06
                        .InvalidByteOperationErrorCodes
                        .LengthGreaterThanOrEqualsThirtyTwoRequired,
                    b.length,
                    index + 32
                )
            );
        }

        // Arrays are prefixed by a 256 bit length parameter
        index += 32;

        // Read the bytes32 from array memory
        assembly {
            mstore(add(b, index), input)
        }
    }

    /// @dev Reads a uint256 value from a position in a byte array.
    /// @param b Byte array containing a uint256 value.
    /// @param index Index in byte array of uint256 value.
    /// @return result uint256 value from byte array.
    function readUint256(bytes memory b, uint256 index)
        internal
        pure
        returns (uint256 result)
    {
        result = uint256(readBytes32(b, index));
        return result;
    }

    /// @dev Writes a uint256 into a specific position in a byte array.
    /// @param b Byte array to insert <input> into.
    /// @param index Index in byte array of <input>.
    /// @param input uint256 to put into byte array.
    function writeUint256(
        bytes memory b,
        uint256 index,
        uint256 input
    ) internal pure {
        writeBytes32(b, index, bytes32(input));
    }

    /// @dev Reads an unpadded bytes4 value from a position in a byte array.
    /// @param b Byte array containing a bytes4 value.
    /// @param index Index in byte array of bytes4 value.
    /// @return result bytes4 value from byte array.
    function readBytes4(bytes memory b, uint256 index)
        internal
        pure
        returns (bytes4 result)
    {
        if (b.length < index + 4) {
            LibRichErrorsV06.rrevert(
                LibBytesRichErrorsV06.InvalidByteOperationError(
                    LibBytesRichErrorsV06
                        .InvalidByteOperationErrorCodes
                        .LengthGreaterThanOrEqualsFourRequired,
                    b.length,
                    index + 4
                )
            );
        }

        // Arrays are prefixed by a 32 byte length field
        index += 32;

        // Read the bytes4 from array memory
        assembly {
            result := mload(add(b, index))
            // Solidity does not require us to clean the trailing bytes.
            // We do it anyway
            result := and(
                result,
                0xFFFFFFFF00000000000000000000000000000000000000000000000000000000
            )
        }
        return result;
    }

    /// @dev Writes a new length to a byte array.
    ///      Decreasing length will lead to removing the corresponding lower order bytes from the byte array.
    ///      Increasing length may lead to appending adjacent in-memory bytes to the end of the byte array.
    /// @param b Bytes array to write new length to.
    /// @param length New length of byte array.
    function writeLength(bytes memory b, uint256 length) internal pure {
        assembly {
            mstore(b, length)
        }
    }
}

// File @opengsn/gsn/contracts/interfaces/[email protected]

pragma solidity ^0.6.2;

/**
 * a contract must implement this interface in order to support relayed transaction.
 * It is better to inherit the BaseRelayRecipient as its implementation.
 */
abstract contract IRelayRecipient {
    /**
     * return if the forwarder is trusted to forward relayed transactions to us.
     * the forwarder is required to verify the sender's signature, and verify
     * the call is not a replay.
     */
    function isTrustedForwarder(address forwarder)
        public
        view
        virtual
        returns (bool);

    /**
     * return the sender of this call.
     * if the call came through our trusted forwarder, then the real sender is appended as the last 20 bytes
     * of the msg.data.
     * otherwise, return `msg.sender`
     * should be used in the contract anywhere instead of msg.sender
     */
    function _msgSender() internal view virtual returns (address payable);

    function versionRecipient() external view virtual returns (string memory);
}

// File @opengsn/gsn/contracts/[email protected]

pragma solidity ^0.6.2;

/**
 * A base contract to be inherited by any contract that want to receive relayed transactions
 * A subclass must use "_msgSender()" instead of "msg.sender"
 */
abstract contract BaseRelayRecipient is IRelayRecipient {
    /// the TrustedForwarder singleton we accept calls from.
    // we trust it to verify the caller's signature, and pass the caller's address as last 20 bytes
    address internal trustedForwarder;

    /*
     * require a function to be called through GSN only
     */
    modifier trustedForwarderOnly() {
        require(
            msg.sender == address(trustedForwarder),
            "Function can only be called through trustedForwarder"
        );
        _;
    }

    function isTrustedForwarder(address forwarder)
        public
        view
        override
        returns (bool)
    {
        return forwarder == trustedForwarder;
    }

    /**
     * return the sender of this call.
     * if the call came through our trusted forwarder, return the original sender.
     * otherwise, return `msg.sender`.
     * should be used in the contract anywhere instead of msg.sender
     */
    function _msgSender()
        internal
        view
        virtual
        override
        returns (address payable)
    {
        if (msg.data.length >= 24 && isTrustedForwarder(msg.sender)) {
            // At this point we know that the sender is a trusted forwarder,
            // so we trust that the last bytes of msg.data are the verified sender address.
            // extract sender address from the end of msg.data
            return
                address(
                    uint160(
                        LibBytesV06.readAddress(msg.data, msg.data.length - 20)
                    )
                );
        }
        return msg.sender;
    }
}

// File @openzeppelin/contracts/utils/[email protected]

pragma solidity >=0.6.0 <0.8.0;

/**
 * @dev Library for managing
 * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive
 * types.
 *
 * Sets have the following properties:
 *
 * - Elements are added, removed, and checked for existence in constant time
 * (O(1)).
 * - Elements are enumerated in O(n). No guarantees are made on the ordering.
 *
 * ```
 * contract Example {
 *     // Add the library methods
 *     using EnumerableSet for EnumerableSet.AddressSet;
 *
 *     // Declare a set state variable
 *     EnumerableSet.AddressSet private mySet;
 * }
 * ```
 *
 * As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`)
 * and `uint256` (`UintSet`) are supported.
 */
library EnumerableSet {
    // To implement this library for multiple types with as little code
    // repetition as possible, we write it in terms of a generic Set type with
    // bytes32 values.
    // The Set implementation uses private functions, and user-facing
    // implementations (such as AddressSet) are just wrappers around the
    // underlying Set.
    // This means that we can only create new EnumerableSets for types that fit
    // in bytes32.

    struct Set {
        // Storage of set values
        bytes32[] _values;
        // Position of the value in the `values` array, plus 1 because index 0
        // means a value is not in the set.
        mapping(bytes32 => uint256) _indexes;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function _add(Set storage set, bytes32 value) private returns (bool) {
        if (!_contains(set, value)) {
            set._values.push(value);
            // The value is stored at length-1, but we add 1 to all indexes
            // and use 0 as a sentinel value
            set._indexes[value] = set._values.length;
            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function _remove(Set storage set, bytes32 value) private returns (bool) {
        // We read and store the value's index to prevent multiple reads from the same storage slot
        uint256 valueIndex = set._indexes[value];

        if (valueIndex != 0) {
            // Equivalent to contains(set, value)
            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in
            // the array, and then remove the last element (sometimes called as 'swap and pop').
            // This modifies the order of the array, as noted in {at}.

            uint256 toDeleteIndex = valueIndex - 1;
            uint256 lastIndex = set._values.length - 1;

            // When the value to delete is the last one, the swap operation is unnecessary. However, since this occurs
            // so rarely, we still do the swap anyway to avoid the gas cost of adding an 'if' statement.

            bytes32 lastvalue = set._values[lastIndex];

            // Move the last value to the index where the value to delete is
            set._values[toDeleteIndex] = lastvalue;
            // Update the index for the moved value
            set._indexes[lastvalue] = toDeleteIndex + 1; // All indexes are 1-based

            // Delete the slot where the moved value was stored
            set._values.pop();

            // Delete the index for the deleted slot
            delete set._indexes[value];

            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function _contains(Set storage set, bytes32 value)
        private
        view
        returns (bool)
    {
        return set._indexes[value] != 0;
    }

    /**
     * @dev Returns the number of values on the set. O(1).
     */
    function _length(Set storage set) private view returns (uint256) {
        return set._values.length;
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function _at(Set storage set, uint256 index)
        private
        view
        returns (bytes32)
    {
        require(
            set._values.length > index,
            "EnumerableSet: index out of bounds"
        );
        return set._values[index];
    }

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(Bytes32Set storage set, bytes32 value)
        internal
        returns (bool)
    {
        return _add(set._inner, value);
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(Bytes32Set storage set, bytes32 value)
        internal
        returns (bool)
    {
        return _remove(set._inner, value);
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(Bytes32Set storage set, bytes32 value)
        internal
        view
        returns (bool)
    {
        return _contains(set._inner, value);
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(Bytes32Set storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32Set storage set, uint256 index)
        internal
        view
        returns (bytes32)
    {
        return _at(set._inner, index);
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(AddressSet storage set, address value)
        internal
        returns (bool)
    {
        return _add(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(AddressSet storage set, address value)
        internal
        returns (bool)
    {
        return _remove(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(AddressSet storage set, address value)
        internal
        view
        returns (bool)
    {
        return _contains(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(AddressSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressSet storage set, uint256 index)
        internal
        view
        returns (address)
    {
        return address(uint160(uint256(_at(set._inner, index))));
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(UintSet storage set, uint256 value) internal returns (bool) {
        return _add(set._inner, bytes32(value));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(UintSet storage set, uint256 value)
        internal
        returns (bool)
    {
        return _remove(set._inner, bytes32(value));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(UintSet storage set, uint256 value)
        internal
        view
        returns (bool)
    {
        return _contains(set._inner, bytes32(value));
    }

    /**
     * @dev Returns the number of values on the set. O(1).
     */
    function length(UintSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintSet storage set, uint256 index)
        internal
        view
        returns (uint256)
    {
        return uint256(_at(set._inner, index));
    }
}

// File @openzeppelin/contracts/cryptography/[email protected]

pragma solidity >=0.6.0 <0.8.0;

/**
 * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.
 *
 * These functions can be used to verify that a message was signed by the holder
 * of the private keys of a given address.
 */
library ECDSA {
    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature`. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {toEthSignedMessageHash} on it.
     */
    function recover(bytes32 hash, bytes memory signature)
        internal
        pure
        returns (address)
    {
        // Check the signature length
        if (signature.length != 65) {
            revert("ECDSA: invalid signature length");
        }

        // Divide the signature in r, s and v variables
        bytes32 r;
        bytes32 s;
        uint8 v;

        // ecrecover takes the signature parameters, and the only way to get them
        // currently is to use assembly.
        // solhint-disable-next-line no-inline-assembly
        assembly {
            r := mload(add(signature, 0x20))
            s := mload(add(signature, 0x40))
            v := byte(0, mload(add(signature, 0x60)))
        }

        return recover(hash, v, r, s);
    }

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

        // If the signature is valid (and not malleable), return the signer address
        address signer = ecrecover(hash, v, r, s);
        require(signer != address(0), "ECDSA: invalid signature");

        return signer;
    }

    /**
     * @dev Returns an Ethereum Signed Message, created from a `hash`. This
     * replicates the behavior of the
     * https://github.com/ethereum/wiki/wiki/JSON-RPC#eth_sign[`eth_sign`]
     * JSON-RPC method.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes32 hash)
        internal
        pure
        returns (bytes32)
    {
        // 32 is the length in bytes of hash,
        // enforced by the type signature above
        return
            keccak256(
                abi.encodePacked("\x19Ethereum Signed Message:\n32", hash)
            );
    }
}

// File @openzeppelin/contracts/token/ERC20/[email protected]

pragma solidity >=0.6.0 <0.8.0;

/**
 * @dev Interface of the ERC20 standard as defined in the EIP.
 */
interface IERC20 {
    /**
     * @dev Returns the amount of tokens in existence.
     */
    function totalSupply() external view returns (uint256);

    /**
     * @dev Returns the amount of tokens owned by `account`.
     */
    function balanceOf(address account) external view returns (uint256);

    /**
     * @dev Moves `amount` tokens from the caller's account to `recipient`.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transfer(address recipient, uint256 amount)
        external
        returns (bool);

    /**
     * @dev Returns the remaining number of tokens that `spender` will be
     * allowed to spend on behalf of `owner` through {transferFrom}. This is
     * zero by default.
     *
     * This value changes when {approve} or {transferFrom} are called.
     */
    function allowance(address owner, address spender)
        external
        view
        returns (uint256);

    /**
     * @dev Sets `amount` as the allowance of `spender` over the caller's tokens.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * IMPORTANT: Beware that changing an allowance with this method brings the risk
     * that someone may use both the old and the new allowance by unfortunate
     * transaction ordering. One possible solution to mitigate this race
     * condition is to first reduce the spender's allowance to 0 and set the
     * desired value afterwards:
     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
     *
     * Emits an {Approval} event.
     */
    function approve(address spender, uint256 amount) external returns (bool);

    /**
     * @dev Moves `amount` tokens from `sender` to `recipient` using the
     * allowance mechanism. `amount` is then deducted from the caller's
     * allowance.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(
        address sender,
        address recipient,
        uint256 amount
    ) external returns (bool);

    /**
     * @dev Emitted when `value` tokens are moved from one account (`from`) to
     * another (`to`).
     *
     * Note that `value` may be zero.
     */
    event Transfer(address indexed from, address indexed to, uint256 value);

    /**
     * @dev Emitted when the allowance of a `spender` for an `owner` is set by
     * a call to {approve}. `value` is the new allowance.
     */
    event Approval(
        address indexed owner,
        address indexed spender,
        uint256 value
    );
}

// File @openzeppelin/contracts/utils/[email protected]

pragma solidity >=0.6.2 <0.8.0;

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev Returns true if `account` is a contract.
     *
     * [IMPORTANT]
     * ====
     * It is unsafe to assume that an address for which this function returns
     * false is an externally-owned account (EOA) and not a contract.
     *
     * Among others, `isContract` will return false for the following
     * types of addresses:
     *
     *  - an externally-owned account
     *  - a contract in construction
     *  - an address where a contract will be created
     *  - an address where a contract lived, but was destroyed
     * ====
     */
    function isContract(address account) internal view returns (bool) {
        // This method relies on extcodesize, which returns 0 for contracts in
        // construction, since the code is only stored at the end of the
        // constructor execution.

        uint256 size;
        // solhint-disable-next-line no-inline-assembly
        assembly {
            size := extcodesize(account)
        }
        return size > 0;
    }

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

        // solhint-disable-next-line avoid-low-level-calls, avoid-call-value
        (bool success, ) = recipient.call{value: amount}("");
        require(
            success,
            "Address: unable to send value, recipient may have reverted"
        );
    }

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

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

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

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

        // solhint-disable-next-line avoid-low-level-calls
        (bool success, bytes memory returndata) =
            target.call{value: value}(data);
        return _verifyCallResult(success, returndata, errorMessage);
    }

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

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        require(isContract(target), "Address: static call to non-contract");

        // solhint-disable-next-line avoid-low-level-calls
        (bool success, bytes memory returndata) = target.staticcall(data);
        return _verifyCallResult(success, returndata, errorMessage);
    }

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

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        require(isContract(target), "Address: delegate call to non-contract");

        // solhint-disable-next-line avoid-low-level-calls
        (bool success, bytes memory returndata) = target.delegatecall(data);
        return _verifyCallResult(success, returndata, errorMessage);
    }

    function _verifyCallResult(
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) private pure returns (bytes memory) {
        if (success) {
            return returndata;
        } else {
            // Look for revert reason and bubble it up if present
            if (returndata.length > 0) {
                // The easiest way to bubble the revert reason is using memory via assembly

                // solhint-disable-next-line no-inline-assembly
                assembly {
                    let returndata_size := mload(returndata)
                    revert(add(32, returndata), returndata_size)
                }
            } else {
                revert(errorMessage);
            }
        }
    }
}

// File @openzeppelin/contracts/token/ERC20/[email protected]

pragma solidity >=0.6.0 <0.8.0;

/**
 * @title SafeERC20
 * @dev Wrappers around ERC20 operations that throw on failure (when the token
 * contract returns false). Tokens that return no value (and instead revert or
 * throw on failure) are also supported, non-reverting calls are assumed to be
 * successful.
 * To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,
 * which allows you to call the safe operations as `token.safeTransfer(...)`, etc.
 */
library SafeERC20 {
    using SafeMath for uint256;
    using Address for address;

    function safeTransfer(
        IERC20 token,
        address to,
        uint256 value
    ) internal {
        _callOptionalReturn(
            token,
            abi.encodeWithSelector(token.transfer.selector, to, value)
        );
    }

    function safeTransferFrom(
        IERC20 token,
        address from,
        address to,
        uint256 value
    ) internal {
        _callOptionalReturn(
            token,
            abi.encodeWithSelector(token.transferFrom.selector, from, to, value)
        );
    }

    /**
     * @dev Deprecated. This function has issues similar to the ones found in
     * {IERC20-approve}, and its usage is discouraged.
     *
     * Whenever possible, use {safeIncreaseAllowance} and
     * {safeDecreaseAllowance} instead.
     */
    function safeApprove(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        // safeApprove should only be called when setting an initial allowance,
        // or when resetting it to zero. To increase and decrease it, use
        // 'safeIncreaseAllowance' and 'safeDecreaseAllowance'
        // solhint-disable-next-line max-line-length
        require(
            (value == 0) || (token.allowance(address(this), spender) == 0),
            "SafeERC20: approve from non-zero to non-zero allowance"
        );
        _callOptionalReturn(
            token,
            abi.encodeWithSelector(token.approve.selector, spender, value)
        );
    }

    function safeIncreaseAllowance(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        uint256 newAllowance =
            token.allowance(address(this), spender).add(value);
        _callOptionalReturn(
            token,
            abi.encodeWithSelector(
                token.approve.selector,
                spender,
                newAllowance
            )
        );
    }

    function safeDecreaseAllowance(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        uint256 newAllowance =
            token.allowance(address(this), spender).sub(
                value,
                "SafeERC20: decreased allowance below zero"
            );
        _callOptionalReturn(
            token,
            abi.encodeWithSelector(
                token.approve.selector,
                spender,
                newAllowance
            )
        );
    }

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     */
    function _callOptionalReturn(IERC20 token, bytes memory data) private {
        // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
        // we're implementing it ourselves. We use {Address.functionCall} to perform this call, which verifies that
        // the target address contains contract code and also asserts for success in the low-level call.

        bytes memory returndata =
            address(token).functionCall(
                data,
                "SafeERC20: low-level call failed"
            );
        if (returndata.length > 0) {
            // Return data is optional
            // solhint-disable-next-line max-line-length
            require(
                abi.decode(returndata, (bool)),
                "SafeERC20: ERC20 operation did not succeed"
            );
        }
    }
}

// File contracts/IERC1271.sol

pragma solidity >=0.5.0 <0.7.0;

/**
 * @notice ERC-1271: Standard Signature Validation Method for Contracts
 */
interface IERC1271 {
    //    bytes4 internal constant _ERC1271MAGICVALUE = 0x1626ba7e;
    //    bytes4 internal constant _ERC1271FAILVALUE = 0xffffffff;

    /**
     * @dev Should return whether the signature provided is valid for the provided data
     * @param _hash hash of the data signed//Arbitrary length data signed on the behalf of address(this)
     * @param _signature Signature byte array associated with _data
     *
     * @return magicValue either 0x1626ba7e on success or 0xffffffff failure
     */
    function isValidSignature(
        bytes32 _hash, //bytes memory _data,
        bytes calldata _signature
    ) external view returns (bytes4 magicValue);
}

// File contracts/SignatureChecker.sol

pragma solidity >=0.6.0 <0.7.0;

contract SignatureChecker is Ownable {
    using ECDSA for bytes32;
    using Address for address;
    bool public checkSignatureFlag;

    bytes4 internal constant _INTERFACE_ID_ERC1271 = 0x1626ba7e;
    bytes4 internal constant _ERC1271FAILVALUE = 0xffffffff;

    function setCheckSignatureFlag(bool newFlag) public onlyOwner {
        checkSignatureFlag = newFlag;
    }

    function getSigner(bytes32 signedHash, bytes memory signature)
        public
        pure
        returns (address)
    {
        return signedHash.toEthSignedMessageHash().recover(signature);
    }

    function checkSignature(
        bytes32 signedHash,
        bytes memory signature,
        address checkAddress
    ) public view returns (bool) {
        if (checkAddress.isContract()) {
            return
                IERC1271(checkAddress).isValidSignature(
                    signedHash,
                    signature
                ) == _INTERFACE_ID_ERC1271;
        } else {
            return getSigner(signedHash, signature) == checkAddress;
        }
    }
}

// File contracts/Liker.sol

pragma solidity >=0.6.0 <0.7.0;

contract Liker is Ownable, BaseRelayRecipient, SignatureChecker {
    using ECDSA for bytes32;
    using Counters for Counters.Counter;
    using EnumerableSet for EnumerableSet.UintSet;
    using SafeMath for uint256;
    using SafeERC20 for IERC20;

    Counters.Counter public totalLikes;

    IERC20 public weighterc20;

    event liked(
        uint256 LikeId,
        address targetContract,
        uint256 target,
        uint256 targetId,
        address liker,
        uint256 weight,
        string fileUrl
    );

    event likedWeightBalance(uint256 targetId, uint256 weight);

    event contractAdded(address targetContract, address contractOwner);
    event contractRemoved(address targetContract, address contractOwner);

    struct Like {
        uint256 id;
        address liker;
        uint256 weight;
        string fileUrl;
        uint256 targetId;
        address contractAddress;
        uint256 target;
        bool exists;
    }

    EnumerableSet.UintSet private likeIds;
    mapping(address => bool) public registeredContracts;
    mapping(address => address) public contractOwner;
    mapping(uint256 => Like) private likeById;
    mapping(address => EnumerableSet.UintSet) private addressLikes;
    mapping(uint256 => EnumerableSet.UintSet) private targetLikes;
    mapping(address => EnumerableSet.UintSet) private contractLikes;
    mapping(uint256 => uint256) public targetWeightLikes;

    constructor() public {
        weighterc20 = IERC20(0x6e34F6FB7Fffe10390422Ee0dDE04A03e446843e);
    }

    function setWeightToken(IERC20 _weighterc20) public onlyOwner {
        weighterc20 = _weighterc20;
    }

    function getTargetId(address contractAddress, uint256 target)
        public
        view
        returns (uint256)
    {
        return
            uint256(
                keccak256(
                    abi.encodePacked(
                        bytes1(0x19),
                        bytes1(0),
                        address(this),
                        contractAddress,
                        target
                    )
                )
            );
    }

    function _newLike(
        address contractAddress,
        uint256 target,
        address liker,
        uint256 weight,
        string memory _fileUrl
    ) internal returns (uint256) {
        require(
            registeredContracts[contractAddress],
            "this contract is not registered"
        );
        uint256 targetId = getTargetId(contractAddress, target);
        uint256 likeId =
            uint256(
                keccak256(
                    abi.encodePacked(
                        bytes1(0x19),
                        bytes1(0),
                        address(this),
                        contractAddress,
                        target,
                        liker
                    )
                )
            );
        require(!likeById[likeId].exists, "this like has already been liked");

        totalLikes.increment();

        Like memory _like =
            Like({
                id: likeId,
                liker: liker,
                weight: weight,
                fileUrl: _fileUrl,
                targetId: targetId,
                contractAddress: contractAddress,
                target: target,
                exists: true
            });

        likeIds.add(likeId);
        likeById[likeId] = _like;
        addressLikes[liker].add(likeId);
        targetLikes[targetId].add(likeId);
        contractLikes[contractAddress].add(likeId);
        addLikedWeighByTarget(weight, target);

        emit liked(
            likeId,
            contractAddress,
            target,
            targetId,
            liker,
            weight,
            _fileUrl
        );
    }

    function like(
        address contractAddress,
        uint256 target,
        string memory _fileUrl
    ) public returns (uint256) {
        uint256 weight = weighterc20.balanceOf(msg.sender);
        return
            _newLike(contractAddress, target, _msgSender(), weight, _fileUrl);
    }

    function likeWithSignature(
        address contractAddress,
        uint256 target,
        address liker,
        string memory _fileUrl,
        bytes memory signature
    ) public returns (uint256) {
        bytes32 messageHash =
            keccak256(
                abi.encodePacked(
                    bytes1(0x19),
                    bytes1(0),
                    address(this),
                    contractAddress,
                    target,
                    liker
                )
            );
        bool isCreatorSignature = checkSignature(messageHash, signature, liker);
        require(
            isCreatorSignature || !checkSignatureFlag,
            "Unable to verify the creator signature"
        );
        uint256 weight = weighterc20.balanceOf(msg.sender);
        return _newLike(contractAddress, target, liker, weight, _fileUrl);
    }

    function checkLike(
        address contractAddress,
        uint256 target,
        address liker
    ) public view returns (bool) {
        require(
            registeredContracts[contractAddress],
            "this contract is not registered"
        );
        uint256 likeId =
            uint256(
                keccak256(
                    abi.encodePacked(
                        bytes1(0x19),
                        bytes1(0),
                        address(this),
                        contractAddress,
                        target,
                        liker
                    )
                )
            );
        return likeById[likeId].exists;
    }

    function getLikeIdByIndex(uint256 index) public view returns (uint256) {
        return likeIds.at(index);
    }

    function addLikedWeighByTarget(uint256 weight, uint256 target) internal {
        targetWeightLikes[target] = targetWeightLikes[target] + weight;
        emit likedWeightBalance(target, targetWeightLikes[target]);
    }

    function getLikeInfoById(uint256 likeId)
        public
        view
        returns (
            uint256,
            address,
            uint256,
            address,
            uint256
        )
    {
        require(likeById[likeId].exists, "like does not exist");
        Like storage _like = likeById[likeId];
        return (
            likeId,
            _like.liker,
            _like.targetId,
            _like.contractAddress,
            _like.target
        );
    }

    function getLikesByTargetId(uint256 targetId)
        public
        view
        returns (uint256)
    {
        return targetLikes[targetId].length();
    }

    function getLikesByTarget(address contractAddress, uint256 target)
        public
        view
        returns (uint256)
    {
        uint256 targetId = getTargetId(contractAddress, target);
        return targetLikes[targetId].length();
    }

    function getLikesByContract(address contractAddress)
        public
        view
        returns (uint256)
    {
        require(
            registeredContracts[contractAddress],
            "this contract is not registered"
        );
        return contractLikes[contractAddress].length();
    }

    function getLikesByLiker(address liker) public view returns (uint256) {
        return addressLikes[liker].length();
    }

    function addContract(address contractAddress) public returns (bool) {
        require(
            !registeredContracts[contractAddress],
            "this contract is already registered"
        );
        registeredContracts[contractAddress] = true;
        address _contractOwner = _msgSender();
        contractOwner[contractAddress] = _contractOwner;
        emit contractAdded(contractAddress, _contractOwner);
        return true;
    }

    function removeContract(address contractAddress) public returns (bool) {
        require(
            registeredContracts[contractAddress],
            "this contract is not registered"
        );
        address _contractOwner = _msgSender();
        require(
            contractOwner[contractAddress] == _contractOwner,
            "only the contract owner can remove"
        );
        registeredContracts[contractAddress] = false;
        emit contractRemoved(contractAddress, _contractOwner);
        return false;
    }

    function versionRecipient()
        external
        view
        virtual
        override
        returns (string memory)
    {
        return "1.0";
    }

    function setTrustedForwarder(address _trustedForwarder) public onlyOwner {
        trustedForwarder = _trustedForwarder;
    }

    function getTrustedForwarder() public view returns (address) {
        return trustedForwarder;
    }

    function _msgSender()
        internal
        view
        override(BaseRelayRecipient, Context)
        returns (address payable)
    {
        return BaseRelayRecipient._msgSender();
    }
}

Contract Security Audit

Contract ABI

[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"targetContract","type":"address"},{"indexed":false,"internalType":"address","name":"contractOwner","type":"address"}],"name":"contractAdded","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"targetContract","type":"address"},{"indexed":false,"internalType":"address","name":"contractOwner","type":"address"}],"name":"contractRemoved","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"LikeId","type":"uint256"},{"indexed":false,"internalType":"address","name":"targetContract","type":"address"},{"indexed":false,"internalType":"uint256","name":"target","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"targetId","type":"uint256"},{"indexed":false,"internalType":"address","name":"liker","type":"address"},{"indexed":false,"internalType":"uint256","name":"weight","type":"uint256"},{"indexed":false,"internalType":"string","name":"fileUrl","type":"string"}],"name":"liked","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"targetId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"weight","type":"uint256"}],"name":"likedWeightBalance","type":"event"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"addContract","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"},{"internalType":"uint256","name":"target","type":"uint256"},{"internalType":"address","name":"liker","type":"address"}],"name":"checkLike","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"signedHash","type":"bytes32"},{"internalType":"bytes","name":"signature","type":"bytes"},{"internalType":"address","name":"checkAddress","type":"address"}],"name":"checkSignature","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"checkSignatureFlag","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"contractOwner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"index","type":"uint256"}],"name":"getLikeIdByIndex","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"likeId","type":"uint256"}],"name":"getLikeInfoById","outputs":[{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"address","name":"","type":"address"},{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"address","name":"","type":"address"},{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"getLikesByContract","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"liker","type":"address"}],"name":"getLikesByLiker","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"},{"internalType":"uint256","name":"target","type":"uint256"}],"name":"getLikesByTarget","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"targetId","type":"uint256"}],"name":"getLikesByTargetId","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"signedHash","type":"bytes32"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"getSigner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"pure","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"},{"internalType":"uint256","name":"target","type":"uint256"}],"name":"getTargetId","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getTrustedForwarder","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"forwarder","type":"address"}],"name":"isTrustedForwarder","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"},{"internalType":"uint256","name":"target","type":"uint256"},{"internalType":"string","name":"_fileUrl","type":"string"}],"name":"like","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"},{"internalType":"uint256","name":"target","type":"uint256"},{"internalType":"address","name":"liker","type":"address"},{"internalType":"string","name":"_fileUrl","type":"string"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"likeWithSignature","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"registeredContracts","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"removeContract","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"newFlag","type":"bool"}],"name":"setCheckSignatureFlag","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_trustedForwarder","type":"address"}],"name":"setTrustedForwarder","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"contract IERC20","name":"_weighterc20","type":"address"}],"name":"setWeightToken","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"targetWeightLikes","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalLikes","outputs":[{"internalType":"uint256","name":"_value","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"versionRecipient","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"weighterc20","outputs":[{"internalType":"contract IERC20","name":"","type":"address"}],"stateMutability":"view","type":"function"}]

60806040523480156200001157600080fd5b506000620000276001600160e01b036200009d16565b600080546001600160a01b0319166001600160a01b0383169081178255604051929350917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0908290a350600380546001600160a01b031916736e34f6fb7fffe10390422ee0dde04a03e446843e17905562000228565b6000620000b4620000ba60201b62001a2e1760201c565b90505b90565b600060183610801590620000dd5750620000dd336001600160e01b036200014316565b156200013e57620001366000368080601f01602080910402602001604051908101604052809392919081815260200183838082843760009201919091525050366013190191505062000157602090811b62001c7a17901c565b9050620000b7565b503390565b6001546001600160a01b0390811691161490565b60008160140183511015620001985762000198620001876004855185601401620001aa60201b62001cfc1760201c565b6200022060201b62001d711760201c565b5001601401516001600160a01b031690565b6060632800659560e01b84848460405160240180846007811115620001cb57fe5b60ff1681526020018381526020018281526020019350505050604051602081830303815290604052906001600160e01b0319166020820180516001600160e01b03838183161783525050505090509392505050565b805160208201fd5b611fef80620002386000396000f3fe608060405234801561001057600080fd5b50600436106101cf5760003560e01c80635f539d69116101045780639eba90a8116100a2578063ce1b815f11610071578063ce1b815f146107fd578063da74222814610805578063f2fde38b1461082b578063f7b2ec0d14610851576101cf565b80639eba90a814610614578063a06617cd1461075c578063b2e09fae14610782578063c375c2ef146107d7576101cf565b8063715018a6116100de578063715018a6146105b25780638ad7b664146105ba5780638da5cb5b146105e057806392bdef77146105e8576101cf565b80635f539d69146105395780636648f7011461055f578063677408201461057c576101cf565b8063420a5dee116101715780635152b14c1161014b5780635152b14c146104a1578063572b6c05146104c757806357d5e1ad146104ed5780635b18aa0b14610513576101cf565b8063420a5dee146103f8578063486ff0cd1461041c5780634e42b63014610499576101cf565b8063286cdf58116101ad578063286cdf581461022c578063288e6b0e146102f65780633bf196e9146103135780633ebf0569146103cc576101cf565b80630d554d64146101d45780630f90d90014610203578063165691761461020b575b600080fd5b6101f1600480360360208110156101ea57600080fd5b50356108fc565b60408051918252519081900360200190f35b6101f1610915565b61022a6004803603602081101561022157600080fd5b5035151561091b565b005b6102e26004803603606081101561024257600080fd5b81359190810190604081016020820135600160201b81111561026357600080fd5b82018360208201111561027557600080fd5b803590602001918460018302840111600160201b8311171561029657600080fd5b91908080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250929550505090356001600160a01b0316915061099b9050565b604080519115158252519081900360200190f35b6101f16004803603602081101561030c57600080fd5b5035610acf565b6101f16004803603606081101561032957600080fd5b6001600160a01b0382351691602081013591810190606081016040820135600160201b81111561035857600080fd5b82018360208201111561036a57600080fd5b803590602001918460018302840111600160201b8311171561038b57600080fd5b91908080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250929550610ae6945050505050565b6101f1600480360360408110156103e257600080fd5b506001600160a01b038135169060200135610b81565b610400610bd8565b604080516001600160a01b039092168252519081900360200190f35b610424610be7565b6040805160208082528351818301528351919283929083019185019080838360005b8381101561045e578181015183820152602001610446565b50505050905090810190601f16801561048b5780820380516001836020036101000a031916815260200191505b509250505060405180910390f35b6102e2610c05565b610400600480360360208110156104b757600080fd5b50356001600160a01b0316610c15565b6102e2600480360360208110156104dd57600080fd5b50356001600160a01b0316610c30565b61022a6004803603602081101561050357600080fd5b50356001600160a01b0316610c44565b6101f16004803603602081101561052957600080fd5b50356001600160a01b0316610cc8565b6102e26004803603602081101561054f57600080fd5b50356001600160a01b0316610d44565b6101f16004803603602081101561057557600080fd5b5035610e3c565b6102e26004803603606081101561059257600080fd5b506001600160a01b03813581169160208101359160409091013516610e4e565b61022a610f23565b6101f1600480360360208110156105d057600080fd5b50356001600160a01b0316610fcf565b610400610ff0565b6101f1600480360360408110156105fe57600080fd5b506001600160a01b038135169060200135610fff565b6101f1600480360360a081101561062a57600080fd5b6001600160a01b038235811692602081013592604082013590921691810190608081016060820135600160201b81111561066357600080fd5b82018360208201111561067557600080fd5b803590602001918460018302840111600160201b8311171561069657600080fd5b91908080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152509295949360208101935035915050600160201b8111156106e857600080fd5b8201836020820111156106fa57600080fd5b803590602001918460018302840111600160201b8311171561071b57600080fd5b91908080601f01602080910402602001604051908101604052809392919081815260200183838082843760009201919091525092955061102e945050505050565b6102e26004803603602081101561077257600080fd5b50356001600160a01b0316611181565b61079f6004803603602081101561079857600080fd5b5035611196565b604080519586526001600160a01b03948516602087015285810193909352921660608401526080830191909152519081900360a00190f35b6102e2600480360360208110156107ed57600080fd5b50356001600160a01b0316611239565b610400611366565b61022a6004803603602081101561081b57600080fd5b50356001600160a01b0316611375565b61022a6004803603602081101561084157600080fd5b50356001600160a01b03166113f9565b6104006004803603604081101561086757600080fd5b81359190810190604081016020820135600160201b81111561088857600080fd5b82018360208201111561089a57600080fd5b803590602001918460018302840111600160201b831117156108bb57600080fd5b91908080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152509295506114fb945050505050565b600061090f60048363ffffffff61151616565b92915050565b60025481565b610923611522565b6001600160a01b0316610934610ff0565b6001600160a01b03161461097d576040805162461bcd60e51b81526020600482018190526024820152600080516020611f77833981519152604482015290519081900360640190fd5b60018054911515600160a01b0260ff60a01b19909216919091179055565b60006109af826001600160a01b0316611531565b15610aa75760408051630b135d3f60e11b808252600482018781526024830193845286516044840152865191936001600160a01b03871693631626ba7e938a938a9390929091606490910190602085019080838360005b83811015610a1e578181015183820152602001610a06565b50505050905090810190601f168015610a4b5780820380516001836020036101000a031916815260200191505b50935050505060206040518083038186803b158015610a6957600080fd5b505afa158015610a7d573d6000803e3d6000fd5b505050506040513d6020811015610a9357600080fd5b50516001600160e01b031916149050610ac8565b816001600160a01b0316610abb85856114fb565b6001600160a01b03161490505b9392505050565b6000818152600a6020526040812061090f90611537565b600354604080516370a0823160e01b8152336004820152905160009283926001600160a01b03909116916370a0823191602480820192602092909190829003018186803b158015610b3657600080fd5b505afa158015610b4a573d6000803e3d6000fd5b505050506040513d6020811015610b6057600080fd5b50519050610b788585610b71611522565b8487611542565b95945050505050565b60408051601960f81b6020808301919091526000602183015230606090811b60228401529490941b6001600160601b0319166036820152604a8082019390935281518082039093018352606a019052805191012090565b6003546001600160a01b031681565b6040805180820190915260038152620312e360ec1b60208201525b90565b600154600160a01b900460ff1681565b6007602052600090815260409020546001600160a01b031681565b6001546001600160a01b0390811691161490565b610c4c611522565b6001600160a01b0316610c5d610ff0565b6001600160a01b031614610ca6576040805162461bcd60e51b81526020600482018190526024820152600080516020611f77833981519152604482015290519081900360640190fd5b600380546001600160a01b0319166001600160a01b0392909216919091179055565b6001600160a01b03811660009081526006602052604081205460ff16610d23576040805162461bcd60e51b815260206004820152601f6024820152600080516020611eed833981519152604482015290519081900360640190fd5b6001600160a01b0382166000908152600b6020526040902061090f90611537565b6001600160a01b03811660009081526006602052604081205460ff1615610d9c5760405162461bcd60e51b8152600401808060200182810382526023815260200180611f976023913960400191505060405180910390fd5b6001600160a01b0382166000908152600660205260408120805460ff19166001179055610dc7611522565b6001600160a01b0384811660008181526007602090815260409182902080546001600160a01b0319169486169485179055815192835282019290925281519293507f394d3f4dee51f45805b6aa07aa40e45cff26e1fce66f235fa23e2cd031394b4b929081900390910190a150600192915050565b600c6020526000908152604090205481565b6001600160a01b03831660009081526006602052604081205460ff16610ea9576040805162461bcd60e51b815260206004820152601f6024820152600080516020611eed833981519152604482015290519081900360640190fd5b5060408051601960f81b60208083019190915260006021830181905230606090811b60228501526001600160601b031988821b81166036860152604a85018890529086901b16606a8401528351605e818503018152607e9093018452825192820192909220825260089052206007015460ff169392505050565b610f2b611522565b6001600160a01b0316610f3c610ff0565b6001600160a01b031614610f85576040805162461bcd60e51b81526020600482018190526024820152600080516020611f77833981519152604482015290519081900360640190fd5b600080546040516001600160a01b03909116907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0908390a3600080546001600160a01b0319169055565b6001600160a01b038116600090815260096020526040812061090f90611537565b6000546001600160a01b031690565b60008061100c8484610b81565b6000818152600a6020526040902090915061102690611537565b949350505050565b60408051601960f81b60208083019190915260006021830181905230606090811b60228501526001600160601b03198a821b81166036860152604a85018a90529088901b16606a8401528351605e818503018152607e90930190935281519101208161109b82858861099b565b905080806110b35750600154600160a01b900460ff16155b6110ee5760405162461bcd60e51b8152600401808060200182810382526026815260200180611f516026913960400191505060405180910390fd5b600354604080516370a0823160e01b815233600482015290516000926001600160a01b0316916370a08231916024808301926020929190829003018186803b15801561113957600080fd5b505afa15801561114d573d6000803e3d6000fd5b505050506040513d602081101561116357600080fd5b50519050611174898989848a611542565b9998505050505050505050565b60066020526000908152604090205460ff1681565b600081815260086020526040812060070154819081908190819060ff166111fa576040805162461bcd60e51b81526020600482015260136024820152721b1a5ad948191bd95cc81b9bdd08195e1a5cdd606a1b604482015290519081900360640190fd5b505050600083815260086020526040902060018101546004820154600583015460069093015495966001600160a01b0392831696919550919092169250565b6001600160a01b03811660009081526006602052604081205460ff16611294576040805162461bcd60e51b815260206004820152601f6024820152600080516020611eed833981519152604482015290519081900360640190fd5b600061129e611522565b6001600160a01b038481166000908152600760205260409020549192508281169116146112fc5760405162461bcd60e51b8152600401808060200182810382526022815260200180611ecb6022913960400191505060405180910390fd5b6001600160a01b03808416600081815260066020908152604091829020805460ff1916905581519283529284169282019290925281517f2d623ae66feffd525356ccbdd46099521c135852248aa181b65ec3e5eb767924929181900390910190a150600092915050565b6001546001600160a01b031690565b61137d611522565b6001600160a01b031661138e610ff0565b6001600160a01b0316146113d7576040805162461bcd60e51b81526020600482018190526024820152600080516020611f77833981519152604482015290519081900360640190fd5b600180546001600160a01b0319166001600160a01b0392909216919091179055565b611401611522565b6001600160a01b0316611412610ff0565b6001600160a01b03161461145b576040805162461bcd60e51b81526020600482018190526024820152600080516020611f77833981519152604482015290519081900360640190fd5b6001600160a01b0381166114a05760405162461bcd60e51b8152600401808060200182810382526026815260200180611ea56026913960400191505060405180910390fd5b600080546040516001600160a01b03808516939216917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e091a3600080546001600160a01b0319166001600160a01b0392909216919091179055565b6000610ac88261150a856118f9565b9063ffffffff61194a16565b6000610ac883836119ca565b600061152c611a2e565b905090565b3b151590565b600061090f82611a9c565b6001600160a01b03851660009081526006602052604081205460ff1661159d576040805162461bcd60e51b815260206004820152601f6024820152600080516020611eed833981519152604482015290519081900360640190fd5b60006115a98787610b81565b60408051601960f81b60208083019190915260006021830181905230606090811b60228501526001600160601b03198d821b81166036860152604a85018d9052908b901b16606a8401528351605e818503018152607e90930184528251928201929092208083526008909152919020600701549192509060ff1615611675576040805162461bcd60e51b815260206004820181905260248201527f74686973206c696b652068617320616c7265616479206265656e206c696b6564604482015290519081900360640190fd5b61167f6002611aa0565b611687611d91565b5060408051610100810182528281526001600160a01b038089166020830152918101879052606081018690526080810184905290891660a082015260c08101889052600160e08201526116e160048363ffffffff611aa916565b5060008281526008602090815260409182902083518155838201516001820180546001600160a01b0319166001600160a01b0390921691909117905591830151600283015560608301518051849392611741926003850192910190611dea565b506080820151600482015560a08201516005820180546001600160a01b0319166001600160a01b0392831617905560c0830151600683015560e0909201516007909101805460ff1916911515919091179055871660009081526009602052604090206117ad9083611aa9565b506000838152600a602052604090206117cc908363ffffffff611aa916565b506001600160a01b0389166000908152600b602052604090206117f5908363ffffffff611aa916565b506118008689611ab5565b7f3e1ae2aafcbadd70894a15b9348fbfceee8bab28a88060bb4be0765805d6b75d828a8a868b8b8b60405180888152602001876001600160a01b03166001600160a01b03168152602001868152602001858152602001846001600160a01b03166001600160a01b0316815260200183815260200180602001828103825283818151815260200191508051906020019080838360005b838110156118ad578181015183820152602001611895565b50505050905090810190601f1680156118da5780820380516001836020036101000a031916815260200191505b509850505050505050505060405180910390a150505095945050505050565b604080517f19457468657265756d205369676e6564204d6573736167653a0a333200000000602080830191909152603c8083019490945282518083039094018452605c909101909152815191012090565b600081516041146119a2576040805162461bcd60e51b815260206004820152601f60248201527f45434453413a20696e76616c6964207369676e6174757265206c656e67746800604482015290519081900360640190fd5b60208201516040830151606084015160001a6119c086828585611b09565b9695505050505050565b81546000908210611a0c5760405162461bcd60e51b8152600401808060200182810382526022815260200180611e836022913960400191505060405180910390fd5b826000018281548110611a1b57fe5b9060005260206000200154905092915050565b600060183610801590611a455750611a4533610c30565b15611a9757611a906000368080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152505060131936019150611c7a9050565b9050610c02565b503390565b5490565b80546001019055565b6000610ac88383611cb2565b6000818152600c6020908152604091829020805485019081905582518481529182015281517f33645b9083a07eef5d00cbb16c0c8ea07a0e9d8411f10d9fcf4855e006df583a929181900390910190a15050565b60007f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a0821115611b6a5760405162461bcd60e51b8152600401808060200182810382526022815260200180611f0d6022913960400191505060405180910390fd5b8360ff16601b1480611b7f57508360ff16601c145b611bba5760405162461bcd60e51b8152600401808060200182810382526022815260200180611f2f6022913960400191505060405180910390fd5b604080516000808252602080830180855289905260ff88168385015260608301879052608083018690529251909260019260a080820193601f1981019281900390910190855afa158015611c12573d6000803e3d6000fd5b5050604051601f1901519150506001600160a01b038116610b78576040805162461bcd60e51b815260206004820152601860248201527f45434453413a20696e76616c6964207369676e61747572650000000000000000604482015290519081900360640190fd5b60008160140183511015611ca057611ca0611c9b6004855185601401611cfc565b611d71565b5001601401516001600160a01b031690565b6000611cbe8383611d79565b611cf45750815460018181018455600084815260208082209093018490558454848252828601909352604090209190915561090f565b50600061090f565b6060632800659560e01b84848460405160240180846007811115611d1c57fe5b60ff1681526020018381526020018281526020019350505050604051602081830303815290604052906001600160e01b0319166020820180516001600160e01b03838183161783525050505090509392505050565b805160208201fd5b60009081526001919091016020526040902054151590565b6040518061010001604052806000815260200160006001600160a01b0316815260200160008152602001606081526020016000815260200160006001600160a01b03168152602001600081526020016000151581525090565b828054600181600116156101000203166002900490600052602060002090601f016020900481019282601f10611e2b57805160ff1916838001178555611e58565b82800160010185558215611e58579182015b82811115611e58578251825591602001919060010190611e3d565b50611e64929150611e68565b5090565b610c0291905b80821115611e645760008155600101611e6e56fe456e756d657261626c655365743a20696e646578206f7574206f6620626f756e64734f776e61626c653a206e6577206f776e657220697320746865207a65726f20616464726573736f6e6c792074686520636f6e7472616374206f776e65722063616e2072656d6f76657468697320636f6e7472616374206973206e6f7420726567697374657265640045434453413a20696e76616c6964207369676e6174757265202773272076616c756545434453413a20696e76616c6964207369676e6174757265202776272076616c7565556e61626c6520746f20766572696679207468652063726561746f72207369676e61747572654f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65727468697320636f6e747261637420697320616c72656164792072656769737465726564a2646970667358221220b9328db2c51dd815e146e17244ac59b386a6918c05e85e02709d2cb757a7630064736f6c63430006060033

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