Time-controlled registration of fungible token equivalent in a blockchain network
The introduction of a container system using fungible equivalents and placeholders enables efficient transfer and registration of non-fungible tokens across nodes, addressing inefficiencies in existing blockchain networks and enhancing transaction liquidity.
Patent Information
- Application Number
- PCT/EP2023/062907
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-05-15
- Publication Date
- 2024-11-21
AI Technical Summary
Current blockchain networks face inefficiencies in handling non-fungible tokens due to the need for separate handling between nodes, limiting their registration and transfer, which increases computational resource usage and reduces liquidity.
Introducing a container system that uses fungible equivalents and non-fungible placeholders to facilitate the transfer of non-fungible tokens across nodes, allowing for efficient registration and transfer without performance issues, with the ability to revert to the original state.
This approach enhances the efficiency and liquidity of non-fungible token transactions within blockchain networks, reducing computational resource usage and improving overall network performance.
Smart Images

Figure 000020 
Figure 000021 
Figure 000022
Abstract
Description
[0001] Time-controlled registration of fungible token equivalent in a blockchain network
[0002] The present invention relates to methods and devices for operating a blockchain network, as well as the blockchain network, which allows transfer of non-fungible tokens in the blockchain network to be improved.
[0003] Prior art
[0004] Blockchain technology can reduce or eliminate the risks in asset management. Blockchain technologies depend on the existence of various networks such as the Internet, and allow users to exchange assets such as digital currency using a decentralized verification system implemented and deployed over multiple computing nodes.
[0005] Various implementations of blockchain technology are known in the art, and they all comprise a so-called token. The token can be used in the physical world as proof of ownership of an asset, or in principle for any other purpose. Independently on the meaning of the token in the physical world, the token in a blockchain network can be understood as a unique identifier, which can be associated to one of the computing nodes of the blockchain network.
[0006] The association to a given node, and how this association can be changed from a first to a second node is dependent on the specific blockchain technology and how a given “smart contract”, namely a piece of code describing how the system operates, is configured.
[0007] In general, however, registration and / or transfer of a token with respect to a computing node involves a highly computational intensive process. Various existing blockchain networks, such as Bitcoin, are known to use significant amount of power and computational resources.
[0008] There is therefore a need in the art to make the operation of blockchain networks as efficient as possible, particularly in consideration of the continuous need to reduce global CO2 emission and thus global power consumptions.
[0009] Classic blockchains are implemented around the concept of fungible token. That is, a plurality of tokens can be available in the system, and each and those tokens are all identical to each other in terms of their characteristics, other of course than their unique identifiers. Bitcoins are an example of fungible tokens.
[0010] Recently, the concept of non-fungible tokens has been introduced. Non-fungible tokens differ from fungible tokens in that each non-fungible token is associated to a specific good or service which exist, has existed, or will exist, in the physical world. This makes non-fungible tokens different from each other in that, even though they might nominally relate to the same class of goods or services, the specific token will always be associated to a specific tangible or intangible good or service.
[0011] For instance, it is possible to have non fungible tokens for copies of the Mona Lisa. While each painting represents the same subject, namely a copy of the Mona Lisa, some might be considered to be better quality than others, and the respective non-fungible tokens might therefore be more valuable. This has caused a growing market for the trading of non-fungible tokens.
[0012] Current solutions, however, do not allow existing technical platforms to easily handle non-fungible tokens. Due to their nature, the currently existing exchange platforms require each non- fungible token to be handled separately between two nodes in the blockchain network. That is, a first node has the non-fungible token registered to it and a second node, which must be interested in that specific non-fungible token, can request the network to record a transition from the first to the second node upon agreeing on the details of the transition with the first node.
[0013] This severely limits the possibility for the network to allow the registration of those non-fungible tokens to be moved from one node to another one.
[0014] Summary of the invention
[0015] The present invention generally provides a technology in which fully or partially dedicated nodes are organised in an optimised way to store non-fungible token in centralised or decentralised setup to so that these tokens can be rendered more efficiently available on a specified network or subnetwork, by introducing a specific container used as reference for the two-parts replacement of the non-fungible token securely stored on any of these nodes being a fungible equivalent and a non-fungible placeholder that can be used for a large scale of operations without performance issues while still being available to be reverted to previous state at any time.
[0016] This is achieved in particular by embodiments according to the teaching of the independent claims. The dependent claims define further advantageous features of the invention. This replacement can be reversed at any stage to restore it back into original state.
[0017] Brief description of the figures
[0018] Figure 1A schematically illustrates a blockchain network 100, comprising a plurality of nodes 111-11n, Figure 1 B schematically illustrates a network node 110, suitable for use in blockchain network 100,
[0019] Figures 2-4 schematically illustrate methods 200 to 400, suitable for operating the blockchain network 100.
[0020] Detailed description of preferred embodiments
[0021] The approaches disclosed herein provide significant advantages of transparency and auditability. In the present disclosure, “the contract is the code,” which means that using blockchain technology and smart contracts, everything is transparent and secured by cryptography. Individuals cannot forge, erase, or add data inappropriately. The system provides complete transparency in view of who owns the assets and their providence over time. This new system provides a new infrastructure with greater cyber security and overall security, and eliminates the need to trust others and rely on third parties to be honest. One non-limiting example of a platform for developing and deploying smart contracts on the blockchain is the Ethereum Virtual Machine.
[0022] The computer code or code referenced herein represents the intent of parties to the smart contract. The smart contract as implemented herein reduces the amount of interpretation with respect to the contract by establishing that the code is a literal manifestation of the intent of the parties, thus avoiding ambiguity.
[0023] The problems outlined above, among others, are addressed by the concepts disclosed herein. For example, the approaches disclosed herein can implement a blockchain-based smart contract enabling the blockchain network 100 to exchange registration of non-fungible tokens across various nodes in an efficient manner.
[0024] A number of examples will be provided related to fungible tokens such as Bitcoins, Ethereum, and other digital currencies and assets. However, it is noted that the concepts herein apply to portfolios of any type of fungible tokens, digital currency or asset, and / or non-blockchain assets such as stock equities, bonds, commodities, real estate, contracts, currencies (e.g., dollars), etc.
[0025] Figure 1A schematically illustrates a blockchain network 100, comprising a plurality of nodes 111-11n. The nodes 111-11 n are connected to each other by any means of network, such as the internet. The combination of the plurality of nodes forms the blockchain network 100. Various types of such blockchain networks 100 are known in the art, based on various types of smart contracts. Figure 1 B schematically illustrates a network node 110, suitable for use in blockchain network 100. Network node 110 could implement any of the nodes 111-11 n of figure 1A. Network node 110 includes a processing unit (CPU or processor) 150 and a system bus 105 that couples various system components including the system memory 115 such as read only memory (ROM) 120 and random access memory (RAM) 125 to the processor 150. Network node 110 can include a cache 155 of high-speed memory connected directly with, in close proximity to, or integrated as part of the processor 150. Network node 110 copies data from the memory 115, 120, and / or 125 and / or the storage device 130 to the cache 155 for quick access by the processor 150. In this way, the cache provides a performance boost that avoids processor 150 delays while waiting for data. These and other modules can control or be configured to control the processor 150 to perform various operations or actions. Other system memory 115 may be available for use as well. The memory 115 can include multiple different types of memory with different performance characteristics. It can be appreciated that the disclosure may operate on a network node 110 with more than one processor 150 or on a group or cluster of computing devices networked together to provide greater processing capability. The processor 150 can include any general purpose processor and a hardware module or software module, stored in storage device 130, configured to control the processor 150 as well as a special-purpose processor where software instructions are incorporated into the processor. The processor 150 may be a self-contained computing system, containing multiple cores or processors, a bus, memory controller, cache, etc. A multi-core processor may be symmetric or asymmetric. The processor 150 can include multiple processors, such as a system having multiple, physically separate processors in different sockets, or a system having multiple processor cores on a single physical chip. Similarly, the processor 150 can include multiple distributed processors located in multiple separate computing devices, but working together such as via a communications network. Multiple processors or processor cores can share resources such as memory 115 or the cache 155, or can operate using independent resources. The processor 150 can include one or more of a state machine, an application specific integrated circuit (ASIC), or a programmable gate array (PGA) including a field PGA (FPGA).
[0026] The system bus 105 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. A basic input / output system (BIOS) stored in ROM 120 or the like, may provide the basic routine that helps to transfer information between elements within the network node 110, such as during start-up. The network node 110 further includes storage devices 130 or computer-read- able storage media such as a hard disk drive, a magnetic disk drive, an optical disk drive, tape drive, solid-state drive, RAM drive, removable storage devices, a redundant array of inexpensive disks (RAID), hybrid storage device, or the like. The storage device 130 is connected to the system bus 105 by a drive interface. The drives and the associated computer-readable storage devices provide non-volatile storage of computer-readable instructions, data structures, program modules and other data for the network node 110. In one aspect, a hardware module that performs a particular function includes the software component stored in a tangible computer-readable storage device in connection with the necessary hardware components, such as the processor 150, bus 105, an output device such as a display 135, and so forth, to carry out a particular function. In another aspect, the system can use a processor and computer-readable storage device to store instructions which, when executed by the processor, cause the processor to perform operations, a method or other specific actions. The basic components and appropriate variations can be modified depending on the type of device, such as whether the network node 110 is a small, handheld computing device, a desktop computer, or a computer server. When the processor 150 executes instructions to perform “operations”, the processor 150 can perform the operations directly and / or facilitate, direct, or cooperate with another device or component to perform the operations.
[0027] Although the exemplary embodiment(s) described herein employs a storage device such as a hard disk 130, other types of computer-readable storage devices which can store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, digital versatile disks (DVDs), cartridges, random access memories (RAMs) 125, read only memory (ROM) 120, a cable containing a bit stream and the like, may also be used in the exemplary operating environment. According to this disclosure, tangible computer-readable storage media, computer-readable storage devices, computer-readable storage media, and computer- readable memory devices, expressly exclude media such as transitory waves, energy, carrier signals, electromagnetic waves, and signals per se.
[0028] To enable user interaction with the network node 110, an input device 145 represents any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 135 can also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems enable a user to provide multiple types of input to communicate with the network node 110. The communications interface 140 generally governs and manages the user input and system output. There is no restriction on operating on any particular hardware arrangement and therefore the basic hardware depicted may easily be substituted for improved hardware or firmware arrangements as they are developed.
[0029] For clarity of explanation, the illustrative system embodiment is presented as including individual functional blocks including functional blocks labelled as a “processor” or processor 150. The functions these blocks represent may be provided through the use of either shared or dedicated hardware, including, but not limited to, hardware capable of executing software and hardware, such as a processor 150, that is purpose-built to operate as an equivalent to software executing on a general purpose processor. For example the functions of one or more processors presented in figure 1 B can be provided by a single shared processor or multiple processors. (Use of the term “processor” should not be construed to refer exclusively to hardware capable of executing software.) Illustrative embodiments may include microprocessor and / or digital signal processor (DSP) hardware, read-only memory (ROM) 120 for storing software performing the operations described below, and random access memory (RAM) 125 for storing results. Very large scale integration (VLSI) hardware embodiments, as well as custom VLSI circuitry in combination with a general purpose DSP circuit, may also be provided.
[0030] The logical operations of the various embodiments are implemented as: (1) a sequence of computer implemented steps, operations, or procedures running on a programmable circuit within a general use computer; (2) a sequence of computer implemented steps, operations, or procedures running on a specific-use programmable circuit; and / or (3) interconnected machine modules or program engines within the programmable circuits. The network node 110 shown in figure 1 B can practice all or part of the recited methods, can be a part of the recited systems, and / or can operate according to instructions in the recited tangible computer-readable storage devices. Such logical operations can be implemented as modules configured to control the processor 150 to perform particular functions according to the programming of the module.
[0031] One or more parts of the example network node 110, up to and including the entire network node 110, can be virtualized. For example, a virtual processor can be a software object that executes according to a particular instruction set, even when a physical processor of the same type as the virtual processor is unavailable. A virtualization layer or a virtual “host” can enable virtualized components of one or more different computing devices or device types by translating virtualized operations to actual operations. Ultimately however, virtualized hardware of every type is implemented or executed by some underlying physical hardware. Thus, a virtualization compute layer can operate on top of a physical compute layer. The virtualization compute layer can include one or more virtual machine, overlay network, hypervisor, virtual switching, and any other virtualization application.
[0032] The processor 150 can include all types of processors disclosed herein, including a virtual processor. However, when referring to a virtual processor, the processor 150 includes the software components associated with executing the virtual processor in a virtualization layer and underlying hardware necessary to execute the virtualization layer. The network node 110 can include a physical or virtual processor 150 that receive instructions stored in a computer-read- able storage device, which cause the processor 150 to perform certain operations. When referring to a virtual processor 150, the system also includes the underlying physical hardware executing the virtual processor 150.
[0033] Figure 2 schematically illustrates a method 200, suitable for operating the blockchain network 100.
[0034] In some embodiments, the method 200 can be implemented in one or more computing languages, such as Solidity, the Turing Complete language of Ethereum or any other blockchain- operable language that would result in the same or similar functionality as disclosed herein. In particular, in the context of blockchains, smart contracts can be understood as pre-written computer code, which is stored and replicated on a distributed storage platform, executed / run by a network of network nodes and can result in ledger updates, wherein the ledger is stored in a distributed manner across the plurality of network nodes.
[0035] In particular, as visible in figure 2, the method 200 described a set of steps for operating a blockchain network, such as blockchain network 100 of figure 1A. The various method steps are carried out by a plurality of computing nodes comprised in the blockchain network 100.
[0036] In general, the blockchain network is configured to track an association between tokens of various type and the plurality of computing nodes. The tokens comprise non-fungible tokens and fungible tokens, or equivalents. As it will be evident from the following description, the method 200 generally allows a non-fungible token to be transferred between two nodes. In other words, the method 200 allows the blockchain to be changed, so that the transfer of a non-fungible token between two nodes is recorded.
[0037] Those skilled in the art are aware that this can be achieved in known manners and, in particular, by recording the transfer of the non-fungible token in the blockchain directly.
[0038] This, however, requires a corresponding exchange of ownership to be operated at the level of the non-fungible token, which is often very limiting since non-fungible tokens are known to be highly illiquid, as the transfer requires the two nodes to be interested in transacting a unique, and this specific, non-fungible token.
[0039] This is often problematic as it limits the liquidity of the non-fungible token and it requires transactions and / or contacts to be carried outside of the blockchain, to overcome such lack of liquidity. This, in turn, results in more use of computational resources outside of the blockchain, which is not ideal, in addition to reducing safety of the transaction. In the invention, as will become clearer from the following description, a first non-fungible token, referred to as NFT1 , is initially associated to the first computing node 111. The method 200 allows this non-fungible token to be replaced by a fungible non fungible superset equivalents, or fungible equivalent, and non-fungible placeholders, acting together as reference for respective non-fungible tokens. Thanks to this replacement, the fungible non fungible superset equivalents, or fungible equivalent, and non-fungible placeholders can be transferred to, or associated with, different nodes on the network independently from each other, resulting in several advantages, as will become clearer from the following description.
[0040] Figure 2 illustrates one exemplar embodiment, in which the method 200 allows a first non- fungible token to be replaced by a respective first fungible equivalent and a respective first non-fungible placeholder. The first fungible equivalent can then be traded, or associated with other nodes in the network, independently of the first non-fungible placeholder. In the example of figure 2, the first fungible equivalent is associated to another node while the first non-fungible placeholder remains with node #1.
[0041] When a node in the network, node #1 in the illustrated example, is in control of the first non- fungible placeholder and any both fungible equivalent, those can be exchanged again with the first non-fungible token. It is in particular noted that the method 200 can be executed a plurality of times, so that, for instance a first non-fungible token, second non-fungible token and third non-fungible token result in corresponding first fungible equivalent, second fungible equivalent and third fungible equivalent, first non-fungible placeholder, second non-fungible placeholder and third non-fungible placeholder
[0042] Each of the non-fungible placeholders is specifically associated to the corresponding non-fungible token so that, for the network to transfer the non-fungible token to a given node, this node must be associated with, or in possession of, the corresponding non-fungible placeholder. In other words, a node wishing to obtain the first non-fungible token must be in possession of the first non-fungible placeholder, while a node wishing to obtain the second non-fungible token must be in possession of the second non-fungible placeholder, etc.
[0043] In addition, in order for a node to obtain a non-fungible token, this node must also be in possession of a fungible equivalent. In this case, however, it is not necessary for the fungible equivalent to be the same that was generated in exchange for the given non-fungible token. As an example, a node which is in possession of, or associated with, the first non-fungible placeholder and wishing to obtain the first non-fungible token can do so if in possession of the first non-fungible placeholder and any of the first fungible equivalent, second fungible equivalent or third fungible equivalent.
[0044] In the example of figure 2, the first non-fungible token is exchanged with a first fungible equivalent and the first non-fungible placeholder. The first non-fungible placeholder remains associated with the node #1 , while the first fungible equivalent is traded on the network. The node #1 can then obtain any fungible equivalent and use it in conjunction with the first non-fungible placeholder in exchange with the network to obtain back the first non-fungible token.
[0045] More in details, the method 200 can be used for operating a blockchain network 100. As visible in figure 1 , the blockchain network 100 comprises a plurality of computing nodes 111-11 n, and in particular a first computing node 111 , referred also as node #1 in figure 2, and a plurality of second computing nodes 112-11 n, referred also as nodes #2-N in figure 2.
[0046] The blockchain network is generally configured to track an association between tokens and the plurality of computing nodes 111-11 n. The association can be implemented in several manners as will be clear to those expert in the field of blockchain technology. In general, each node is provided with a unique network address and any of the non-fungible tokens, fungible equivalents and non-fungible placeholders is provided with a unique identifier. The association can be any manner of storing, on electronic means, information which allows to unambiguously determine which unique network address is associated to which unique identifier.
[0047] As described above, the token generally comprise non-fungible tokens, fungible equivalents - which can also be referred to as fungible non fungible superset equivalents - and non-fungible placeholders. As previously mentioned, and as it will become clearer from the following description, the fungible equivalents and non-fungible placeholders act together as reference for respective non-fungible tokens.
[0048] For instance, the first non-fungible placeholder and any fungible equivalent can act as a reference for the first non-fungible token. Similarly, the second non-fungible placeholder and any fungible equivalent can act as a reference for the second non-fungible token. Also, the third non-fungible placeholder and any fungible equivalent can act as a reference for the third non- fungible token. in the exemplary configuration of figure 2, a first non-fungible token, NFT1 , is initially associated to the first computing node 111 , or node #1 . In a step S21 a message is transmitted from the first computing node 111 to the plurality of computing nodes 111-11 n, indicating that the first non-fungible token NFT1 is to be registered with the blockchain network 100.
[0049] In other words, the first computing node 111 , or node #1 , informs the blockchain network 100, for instance via a broadcasting message, that the first non-fungible token, NFT1 associated with the first computing node 111 is to be transferred to the blockchain network 100.
[0050] In response to step S21 , the blockchain network 100 executes a step S22, in which a message is transmitted to the plurality of computing nodes 111- 11 n indicating that a first fungible equivalent, FE1 , is to be registered with the first computing node 111 , and a step S23, in which a message is transmitted to the plurality of computing nodes 111- 11 n indicating that a first non-fungible placeholder, NFTP1 , is to be registered with the first computing node 111.
[0051] In other words, a pair consisting of first fungible equivalent, FE1 and first non-fungible placeholder, NFTP1 is created by the blockchain network 100 in exchange for the first non-fungible token, NFT1. This pair is transferred, upon creation, to the node surrendering the first non- fungible token, NFT 1 , node #1 in the example of figure 2.
[0052] Thanks to this process, the first non-fungible token, NFT1 can be associated to the blockchain network 100 and made available to any node in possession of the first non-fungible placeholder, NFTP1 , and any fungible equivalent, for instance the first fungible equivalent, FE1.
[0053] This is particularly advantageous as it exchanges a token with a comparatively low liquidity, the first non-fungible token, NFT1 , due to it specificity, with a token with a comparatively low liquidity, the first fungible equivalent, FE1 , which is not specific because any fungible equivalent can be used to redeem any non-fungible token. At the same time, the owner of the first non-fungible token, NFT1 , does not have to lose ownership of the first non-fungible token, NFT1 , and can retain control of the possibility to redeem it, as long as in possession of the corresponding first non-fungible placeholder, NFTP1.
[0054] In this manner, operation of the blockchain in transferring non-fungible tokens is significantly improved.
[0055] Optionally, the method 200 can also comprise a step S24 of transmitting, from the first computing node 111 to the plurality of computing nodes 111-11 n, a message indicating that the first fungible equivalent FE1 is to be registered with one of the plurality of second computing nodes 112-11 n. In other words, the first fungible equivalent FE1 can be transferred from node #1 to any other node in the network, upon confirmation, or indication to do so, by the current owner, namely node #1.
[0056] Similarly, and further optionally, method 200 can also comprise a step S25 of transmitting, from the one of the plurality of second computing nodes 112-11n currently associated with the first fungible equivalent FE1 to the plurality of computing nodes 111-11 n, a message indicating that the first fungible equivalent FE1 is to be registered with another one of the plurality of second computing nodes 112-11 n. It will be clear that step S25 can be repeated any number of times.
[0057] As long as the first non-fungible placeholder NFTP1 is associated with the first computing node 111 , only the first computing node 111 can convert it back into the first non-fungible token NFT1 , independently on which node is currently associated with the first fungible equivalent FE1. This enables a high liquidity of the first fungible equivalent FE1. Moreover, for the first computing node 111 to convert the first non-fungible placeholder NFTP1 into the first non- fungible token NFT1 , any fungible equivalent, not only FE1 , can be used.
[0058] In the example of figure 2 this is exemplified by steps S26-S29 in which, generally speaking, a second fungible equivalent FE2 is associated to the first computing node 111 , which uses it, together with the first non-fungible placeholder NFTP1 into the first non-fungible token NFT1.
[0059] It will be clear to those skilled in the art that in the context of this application the fungible equivalents FE1 , FE2, are named differently in order to better describe the operation of the invention. However, in practical implementations, it is possible that there might be no way for the blockchain network 100 to distinguish one from the other, or to track a fungible equivalent back to a corresponding non-fungible token.
[0060] Thus, in a step S26, a message is transmitted from one of the plurality of second computing nodes 112-11 n to the plurality of computing nodes 111-11n, a message indicating that a second fungible equivalent FE2, associated to the transmitting node, is to be registered with the first computing node 111.
[0061] The first computing node 111 , node #1 , can then proceed to execute step S27 of transmitting, from the first computing node 111 to the plurality of computing nodes 111-11n, a message indicating that the second fungible equivalent FE2, or any fungible equivalent, is to be registered with the blockchain network 100, and step S28 of transmitting, from the first computing node 111 to the plurality of computing nodes 111-11n, a message indicating that the first non-fungible placeholder NFTP1 is to be registered with the blockchain network 100. Thanks to the execution of those two steps, the blockchain network 100 can proceed to exchange those two tokens with the non-fungible token associated to the first non-fungible placeholder NFTP1 , namely non-fungible token NFT1.
[0062] This, in the example of figure 2, is executed at a step S29, where a message is transmitted, from the blockchain network 100 to the plurality of computing nodes 111-11n, indicating that the first non-fungible token NFT 1 is to be registered with the first computing node 111 . In further non-illustrated steps, the blockchain network 100 can proceed to destroy the first non-fungible placeholder NFTP1 and the fungible equivalent, for instance FE2, which was used for redeeming the first non-fungible token NFT1.
[0063] It has thus been exemplified how any fungible equivalent can be used, by a node associated with a given non-fungible placeholder to redeem a non-fungible token corresponding to the non-fungible placeholder.
[0064] Figure 3 illustrates an exemplary variation of figure 2. In particular, method 300 differs from method 200 by the presence of steps S34-S39 instead of, or in addition to, steps S24-S29.
[0065] In general, the method 300 differs from method 200 in that the node #1 trades the first non- fungible placeholder NFTP1 , not the first fungible equivalent FE1. Subsequently, a second non-fungible placeholder NFTP2 is traded back to the node #1 , not necessarily in exchange for the first non-fungible placeholder NFTP1. Node #1 can then proceed to redeem the non- fungible token associated with the second non-fungible placeholder NFTP2, namely NFT2.
[0066] More in details, in addition to steps S21-S23 already described, method 300 further comprises a step S34 of transmitting, from the first computing node 111 to the plurality of computing nodes 111-11n, a message indicating that the first non-fungible placeholder NFTP1 is to be registered with one of the plurality of second computing nodes 112-11 n.
[0067] At a step S35 a message is transmitted, from the one of the plurality of second computing nodes 112-1 In to the plurality of computing nodes 111-11n, indicating that the first non-fungible placeholder NFTP1 is to be registered with another one of the plurality of second computing nodes 112-11 n. At a step S36 a message is transmitted, from one of the plurality of second computing nodes 112-11n to the plurality of computing nodes 111-11n, a message indicating that a second non-fungible placeholder NFTP2 is to be registered with the first computing node 111.
[0068] Steps S34-S36 are therefore analogous to steps S24-S26 except that the tokens NFTP1 and NFTP2 are exchanged, instead of FE1 and FE2. This results in the node #1 being associated with FE1 and NFTP2 after step S36, so that node #1 can proceed to redeem NFT2, with steps S37-S39, in a manner analogous to steps S27-S29.
[0069] In particular, the method 300 further comprises a step S37 of transmitting, from the first computing node 111 to the plurality of computing nodes 111-11 n, a message indicating that the first fungible equivalent FE1 is to be registered with the blockchain network 100, and a step S38 of transmitting, from the first computing node 111 to the plurality of computing nodes 111- 11 n, a message indicating that the second non-fungible placeholder NFTP2 is to be registered with the blockchain network 100. In this manner the blockchain network 100 is enabled to execute a step S39 of transmitting, to the plurality of computing nodes 111-11 n, a message indicating that a second non-fungible token NFT2 is to be registered with the first computing node 111.
[0070] Figure 4 illustrates an exemplary variation of figure 3. In particular, method 400 differs from method 300 by the presence of steps S47-S49 instead of, or in addition to, steps S37-S39.
[0071] In general, the method 400 differs from method 430 in that it describes what can be executed by the node to which the first non-fungible placeholder NFTP1 has been assigned. Generally, this node can then proceed to redeem the non-fungible token associated with the first non- fungible placeholder NFTP1 , namely NFT1.
[0072] More in details, in addition to steps S21-S35 already described, method 400 further comprises a step S47 of transmitting, from the one of the plurality of second computing nodes 112-11 n to the plurality of computing nodes 111-11n, a message indicating that a fungible equivalent FE is to be registered with the blockchain network 100, and a step S48 of transmitting, from the one of the plurality of second computing nodes 112-11 n to the plurality of computing nodes 111-11n, a message indicating that the first non-fungible placeholder NFTP1 is to be registered with the blockchain network 100.
[0073] As it will be clear to those skilled in the art, the steps S47 and S48 are similar in nature to steps S37 and S38, or S27 and S28, except that they are carried out by node #y, instead of node #1 , and in the nature of the tokens exchanged.
[0074] Steps S47 and S49 enable then network 100 to execute a step S49 of transmitting, from the blockchain network 100 to the plurality of computing nodes 111-11 n, a message indicating that the first non-fungible token NFT1 is to be registered with the one of the plurality of second computing nodes 112-11 n which executed steps S47 and S48 namely node #y.
[0075] While the embodiments above have been illustrated in terms of method steps, the invention is not limited thereto and can also be implemented in form of one or more device. In particular, an embodiment of the invention can relate to a blockchain network 100 comprising a plurality of computing nodes 111-11 n including a first computing node 111 and a plurality of second computing nodes 112-11 n. The blockchain network being configured to track an association between tokens and the plurality of computing nodes 111-11 n, the tokens com- prising non-fungible tokens, fungible equivalents and non-fungible placeholders, as previously described, in manners which will be clear to those skilled in the art.
[0076] In a preferred embodiment, each of the plurality of computing nodes 111-11 n comprises a processor 150 and a memory 115, the memory 115 comprising instructions configured to cause the processor 150 to execute the respective method steps described above. While several embodiments with various feature have been discussed and / or illustrated, it will be clear to those skilled in the art that the invention is not limited to those specific combinations of features. Instead, further embodiments can be obtained by combining features separately from one or more embodiments, within the scope of the claims.
Claims
Claims1. A method (200, 300, 400) for operating a blockchain network (100), the blockchain network comprising a plurality of computing nodes (111-11n) including a first computing node (111) and a plurality of second computing nodes (112-11 n), the blockchain network being configured to track an association between tokens and the plurality of computing nodes (111-11 n), the tokens comprising non-fungible tokens, fungible equivalents and non-fungible placeholders acting together as reference for respective non-fungible tokens, a first non-fungible token (NFT1) being initially associated to the first computing node (111), the method (200, 300, 400) comprising the steps of transmitting (S21), from the first computing node (111) to the plurality of computing nodes (111- 11 n), a message indicating that the first non-fungible token (NFT1) is to be registered with the blockchain network (100), transmitting (S22), from the blockchain network (100) to the plurality of computing nodes (111- 11 n), a message indicating that a first fungible equivalent (FE1) is to be registered with the first computing node (111), transmitting (S23), from the blockchain network (100) to the plurality of computing nodes (111- 11n), a message indicating that a first non-fungible placeholder (NFTP1) is to be registered with the first computing node (111).
2. The method (200) according to claim 1 further comprising the steps of, transmitting (S24), from the first computing node (111) to the plurality of computing nodes (111- 11n), a message indicating that the first fungible equivalent (FE1) is to be registered with one of the plurality of second computing nodes (112-11n), transmitting (S26), from one of the plurality of second computing nodes (112-11 n) to the plurality of computing nodes (111-11 n), a message indicating that a second fungible equivalent (FE2) is to be registered with the first computing node (111),the blockchain network (100), transmitting (S27), from the first computing node (111) to the plurality of computing nodes (111- 11 n), a message indicating that the second fungible equivalent (FE2) is to be registered with the blockchain network (100), transmitting (S28), from the first computing node (111) to the plurality of computing nodes (111- 11n), a message indicating that the first non-fungible placeholder (NFTP1) is to be registered with the blockchain network (100), transmitting (S29), from the blockchain network (100) to the plurality of computing nodes (111- 11 n), a message indicating that the first non-fungible token (NFT1) is to be registered with the first computing node (111).
3. The method (200) according to claim 2 further comprising the steps of, transmitting (S25), from the one of the plurality of second computing nodes (112-11n) to the plurality of computing nodes (111-11n), a message indicating that the first fungible equivalent (FE1) is to be registered with another one of the plurality of second computing nodes (112- 11n).
4. The method (300, 400) according to claim 1 further comprising the steps of, transmitting (S34), from the first computing node (111) to the plurality of computing nodes (111- 11n), a message indicating that the first non-fungible placeholder (NFTP1) is to be registered with one of the plurality of second computing nodes (112-11 n),5. The method (300, 400) according to claim 4 further comprising the steps of, transmitting (S35), from the one of the plurality of second computing nodes (112-11n) to the plurality of computing nodes (111-11 n), a message indicating that the first non-fungible placeholder (NFTP1) is to be registered with another one of the plurality of second computing nodes (112-11 n).
6. The method (300, 400) according to claim 4 or 5 further comprising the steps of, transmitting (S36), from one of the plurality of second computing nodes (112-11 n) to the plurality of computing nodes (111-11 n), a message indicating that a second non-fungible placeholder (NFTP2) is to be registered with the first computing node (111), transmitting (S37), from the first computing node (111) to the plurality of computing nodes (111- 11n), a message indicating that the first fungible equivalent (FE1) is to be registered with the blockchain network (100), transmitting (S38), from the first computing node (111) to the plurality of computing nodes (111- 11 n), a message indicating that the second non-fungible placeholder (NFTP2) is to be registered with the blockchain network (100), transmitting (S39), from the blockchain network (100) to the plurality of computing nodes (111- 11 n), a message indicating that a second non-fungible token (NFT2) is to be registered with the first computing node (111).
7. The method (400) according to claim 5 further comprising the steps of, transmitting (S35), from the one of the plurality of second computing nodes (112-11n) to the plurality of computing nodes (111-11 n), a message indicating that the first non-fungible placeholder (NFTP1) is to be registered with another one of the plurality of second computing nodes (112-11n). transmitting (S47), from the one of the plurality of second computing nodes (112-11 n) to the plurality of computing nodes (111-11 n), a message indicating that a fungible equivalent (FE) is to be registered with the blockchain network (100), transmitting (S48), from the one of the plurality of second computing nodes (112-11n) to the plurality of computing nodes (111-11 n), a message indicating that the first non-fungible placeholder (NFTP1) is to be registered with the blockchain network (100), transmitting (S49), from the blockchain network (100) to the plurality of computing nodes (1 I ll i n), a message indicating that the first non-fungible token (NFT1) is to be registered with the one of the plurality of second computing nodes (112-11 n).
8. A blockchain network (100) comprising a plurality of computing nodes (111-11n) including a first computing node (111) and a plurality of second computing nodes (112-11 n), the blockchain network being configured to track an association between tokens and the plurality of computing nodes (111-11n), the tokens comprising non-fungible tokens, fungible equivalents and non-fungible placeholders, wherein a first non-fungible token (NFT1) is initially associated to the first computing node (111), each of the plurality of computing nodes (111 -11 n) comprising a processor (150) and a memory(115), the memory (115) comprising instructions configured to cause the processor (150) to execute the method (200, 300, 400) of any of claims 2 to 7.
Citation Information
Patent Citations
Method for realizing detachability and interchangeability of NFT through locking and re-issuing
CN114024687A
