IDEAS home Printed from https://ideas.repec.org/p/osf/osfxxx/rn4qc.html
   My bibliography  Save this paper

Minting Non-Fungible Tokens with Provably Fair Procedural Generation

Author

Listed:
  • Cotten, Timothy Michael II

Abstract

Implementing provable fairness in the minting process of non-fungible tokens (NFTs) enables the procedural generation of NFT metadata that can be verified in a decentralized manner, even when stored off-chain. Until now, smart contracts have required additional on-chain data, such as integrity digests, to support the verification of off-chain NFT metadata. Due to the high costs of on-chain data storage, most NFTs do not implement such validation methods, reducing trust in the NFT's off-chain metadata and increasing reliance on centralization. We propose a new method, inspired by the virtual ecology design of sandbox massively multiplayer online role-playing games (MMORPGs). This method utilizes a 256-bit unsigned integer representing a seed value, a Web3-compatible implementation of a pseudorandom number generator (W3PRNG), and an executable ruleset containing attribute definitions and their probability spaces to procedurally generate NFTs. This methodology provides users with a provably fair way of generating NFTs in an open-ended minting smart contract by imitating Proof-of-Work mining, including an arbitrary amount of work to be performed while initializing the PRNG. Due to the extremely large state space of 2^256 possible seeds, any implementation makes the NFT's economy inherently inflationary, offering more attractive features and higher utility in Web3 and Metaverse design than existing fixed supply NFT collections. Furthermore, such a system implicitly guarantees the veracity of off-chain metadata based on the on-chain seed value and the smart contract's immutable integrity configuration. (First published to the Future of Gaming Discord community in November, 2022)

Suggested Citation

  • Cotten, Timothy Michael II, 2022. "Minting Non-Fungible Tokens with Provably Fair Procedural Generation," OSF Preprints rn4qc, Center for Open Science.
  • Handle: RePEc:osf:osfxxx:rn4qc
    DOI: 10.31219/osf.io/rn4qc
    as

    Download full text from publisher

    File URL: https://osf.io/download/66a30d5e492319fd3fc9af0a/
    Download Restriction: no

    File URL: https://libkey.io/10.31219/osf.io/rn4qc?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:osf:osfxxx:rn4qc. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: OSF (email available below). General contact details of provider: https://osf.io/preprints/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.