Classifications

• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q20/00—Payment architectures, schemes or protocols
  • G06Q20/02—Payment architectures, schemes or protocols involving a neutral party, e.g. certification authority, notary or trusted third party [TTP]
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q20/00—Payment architectures, schemes or protocols
  • G06Q20/30—Payment architectures, schemes or protocols characterised by the use of specific devices or networks
  • G06Q20/36—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes
  • G06Q20/367—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes involving electronic purses or money safes
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q20/00—Payment architectures, schemes or protocols
  • G06Q20/38—Payment protocols; Details thereof
  • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
  • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
  • H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
  • H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
  • H04L9/3297—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving time stamps, e.g. generation of time stamps
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q2220/00—Business processing using cryptography

Definitions

• the present disclosure relates to methods and systems for implementing a platform of one or more services associated with a distributed ledger, i.e. a blockchain for multiple users and owners. More particularly, the present disclosure provides, but is not limited to, the provision of asset and event management of assets associated with a blockchain.
• a blockchain refers to a form of distributed data structure, wherein a duplicate copy of the blockchain is maintained at each of a plurality of nodes in a distributed peer-to-peer (P2P) network (referred to below as a “blockchain network”) and widely publicised.
• the blockchain comprises a chain of blocks of data, wherein each block comprises one or more transactions.
• Each transaction other than so-called “coinbase transactions”, points back to a preceding transaction in a sequence which may span one or more blocks up until one or more coinbase transactions.
• Coinbase transactions are discussed below. Transactions that are submitted to the blockchain network are included in new blocks.
• New blocks are created by a process often referred to as “mining”, which involves each of a plurality of the nodes competing to perform “proof-of-work”, i.e. solving a cryptographic puzzle based on a representation of a defined set of ordered and validated pending transactions waiting to be included in a new block of the blockchain.
• mining involves each of a plurality of the nodes competing to perform “proof-of-work”, i.e. solving a cryptographic puzzle based on a representation of a defined set of ordered and validated pending transactions waiting to be included in a new block of the blockchain.
• the blockchain may be pruned at a node, and the publication of blocks can be achieved through the publication of mere block headers.
• the transactions in the blockchain are used to perform one or more of the following: to convey a digital asset (i.e. a number of digital tokens), to order a set of journal entries in a virtualised ledger or registry, to receive and process timestamp entries, and/or to time-order index pointers.
• a blockchain can also be exploited in order to layer additional functionality on top of the blockchain.
• Blockchain protocols may allow for storage of additional user data or indexes to data in a transaction. There is no pre-specified limit to the maximum data capacity that can be stored within a single transaction, and therefore increasingly more complex data can be incorporated. For instance this may be used to store an electronic document in the blockchain, or audio or video data.
• Nodes of the blockchain network (which are often referred to as “miners”) perform a distributed transaction registration and verification process, which will be described in detail below.
• a node validates transactions and inserts them into a block template for which they attempt to identify a valid proof-of-work solution. Once a valid solution is found, a new block is propagated to other nodes of the network, thus enabling each node to record the new block on the blockchain.
• a user e.g. a blockchain client application
• Nodes which receive the transaction may race to find a proof-of-work solution incorporating the validated transaction into a new block.
• Each node is configured to enforce the same node protocol, which will include one or more conditions for a transaction to be valid. Invalid transactions will not be propagated nor incorporated into blocks. Assuming the transaction is validated and thereby accepted onto the blockchain, then the transaction (including any user data) will thus remain registered and indexed at each of the nodes in the blockchain network as an immutable public record.
• the node who successfully solved the proof-of-work puzzle to create the latest block is typically rewarded with a new transaction called the “coinbase transaction” which distributes an amount of the digital asset, i.e. a number of tokens.
• the detection and rejection of invalid transactions is enforced by the actions of competing nodes who act as agents of the network and are incentivised to report and block malfeasance.
• the widespread publication of information allows users to continuously audit the performance of nodes.
• the publication of the mere block headers allows participants to ensure the ongoing integrity of the blockchain.
• the data structure of a given transaction comprises one or more inputs and one or more outputs.
• Any spendable output comprises an element specifying an amount of the digital asset that is derivable from the proceeding sequence of transactions.
• the spendable output is sometimes referred to as a IITXO (“unspent transaction output”) or as an “output”.
• the output may further comprise a locking script specifying a condition for the future redemption of the output.
• a locking script is a predicate defining the conditions necessary to validate and transfer digital tokens or assets.
• Each input of a transaction (other than a coinbase transaction) comprises a pointer (i.e.
• a reference to such an output in a preceding transaction, and may further comprise an unlocking script for unlocking the locking script of the pointed-to output.
• the first transaction comprises at least one output specifying an amount of the digital asset, and comprising a locking script defining one or more conditions of unlocking the output.
• the second, target transaction comprises at least one input, comprising a pointer to the output of the first transaction, and an unlocking script for unlocking the output of the first transaction.
• one of the criteria for validity applied at each node will be that the unlocking script meets all of the one or more conditions defined in the locking script of the first transaction. Another will be that the output of the first transaction has not already been redeemed by another, earlier valid transaction. Any node that finds the target transaction invalid according to any of these conditions will not propagate it (as a valid transaction, but possibly to register an invalid transaction) nor include it in a new block to be recorded in the blockchain.
• An alternative type of transaction model is an account-based model.
• each transaction does not define the amount to be transferred by referring back to the IITXO of a preceding transaction in a sequence of past transactions, but rather by reference to an absolute account balance.
• the current state of all accounts is stored by the nodes separate to the blockchain and is updated constantly.
• a computer-implemented method for tracking ownership and usage of an asset on a blockchain comprising the steps receiving a creation request to associate an asset with a first owner on the blockchain, receiving at least one usage message comprising data indicative of a user using the asset, and upon reception of each usage message: submitting a usage transaction to the blockchain, the usage transaction comprising data indicative of the asset used and a user using the asset; receiving an ownership update request comprising information indicative of a second owner, and upon reception of the ownership update request: submitting an update transaction to the blockchain, the update transaction comprising information indicative of the asset, the first owner, and the second owner.
• the present disclosure provides a device configured to perform the method of the first aspect and a system, the system comprising the server configured to perform the method of the first aspect, and a first ownership device and a second ownership device configured to coordinate transmission of an update message to the server.
• the present disclosure provides a computer- implemented method for tracking, on a blockchain, at least two clients interacting with an asset, wherein the blockchain comprises a set of transactions associated with the asset, and a set of transactions associated with each client, the method comprising the steps receiving an asset interaction event request comprising data indicative of at least two clients associated with the asset interaction event and data indicative of the asset, generating an event transaction comprising the reference to the set of transactions associated with the asset and the references to the sets of transactions associated with the at least two clients, and submitting the event transaction to the blockchain.
• the present disclosure provides a device configured to perform the method of the third aspect and a system, the system comprising the server configured to perform the method of the third aspect, a first client device and a second client device configured to coordinate transmission of the asset interaction event request to the server.
• the present disclosure provides a computer-implemented method for tracking events of an asset on a blockchain, comprising the steps receiving a creation request to create a set of transactions associated with the asset, generating and submitting to the blockchain a first ownership transaction associated with a set of transactions associated with the asset and associated with a set of transactions that is associated with a first owner, receiving an ownership update request comprising information indicative of a second owner, and upon reception of the ownership update request: generating and submitting an update transaction to the blockchain, the update transaction comprising information indicative of the asset, the first owner, and the second owner.
• the present disclosure provides a device configured to perform the method of the fifth aspect and a system, the system comprising the server configured to perform the method of the fifth aspect, a first owner device and a second client device configured to coordinate transmission of the ownership update request to the server.
• Figure 1 depicts an example system for implementing a blockchain.
• Figure 2 illustrates an example transaction protocol
• Figures 3A and 3B illustrate an example implementation of the client application and its user interface.
• Figure 4 illustrates an example of the node software that is run on each blockchain node of the network.
• Figure 5 is a schematic diagram illustrating interactions between a platform processor, blockchain network, and clients.
• Figures 6A-6C illustrate example methods for recording events and interactions with an asset.
• Figure 7 illustrates a schematic diagram showing example sets of transactions and the transactions that are comprised in them.
• Figure 8 illustrates an example transaction format.
• Figure 9 illustrates an example transaction format for a transaction that is associated with multiple sets of transactions.
• Figure 10 is a schematic diagram, depicting an overview of a platform for a plurality of services associated with a blockchain, according to an aspect.
• Figure 11 is a schematic diagram, depicting the components of the platform of a plurality of services that are associated with a blockchain, according to an aspect.
• Figure 12 is a schematic diagram, illustrating a computing environment in which various aspects and embodiments of the present disclosure can be implemented.
• the present disclosure addresses the above technical concerns by proposing one or more techniques whereby real-world events and interactions with an asset across multiple users and clients may be simply, securely, inorder, and/or instantaneously recorded, or obtained from the blockchain by said clients that have stake or interest in said asset.
• Methods, devices, and systems which provide an application programming interface (API) for one or more services associated with a blockchain, without such clients needing to implement any processing or functionality for using the blockchain, nor any processing or functionality for user management, while still being able to avail all advantages associated with the blockchain.
• API application programming interface
• the present disclosure provides a computer-implemented method for tracking ownership and usage of an asset on a blockchain, comprising the steps receiving a creation request to associate an asset with a first owner on the blockchain, receiving at least one usage message comprising data indicative of a user using the asset, and upon reception of each usage message: submitting a usage transaction to the blockchain, the usage transaction comprising data indicative of the asset used and a user using the asset; receiving an ownership update request comprising information indicative of a second owner, and upon reception of the ownership update request: submitting an update transaction to the blockchain, the update transaction comprising information indicative of the asset, the first owner, and the second owner.
• the use of the blockchain and blockchain transactions provides immutability, security, and auditability to the present and any associated aspects. This is of particular importance as it provides technical features that enable users of the present aspect to establish and/or maintain/update a tamper-proof record or log, or a certificate confirming the sequential occurrence of events where an event in the present aspect is the use and/or transfer of ownership of an asset.
• the blockchain comprises any one or more of the following: a set of transaction associated with the asset, a set of transactions associated with the user, a set of transactions associated with the first owner, and a set of transactions associated with the second owner.
• the sets of transactions provide blockchain based data representations of each of the asset, owners, and users.
• any parties associated with the present aspect i.e. auditors, owners, users, or others
• sorting of events is maintained as a result of the technical features of the blockchain, in particular through the use of the chain of dust spending relationship.
• any append actions are automatically recorded in-order on the blockchain.
• the set of transactions associated with the asset is associated with a smart contract associated with the asset
• the set of transactions associated with the first owner is associated with a smart contract associated with the first owner
• the set of transactions associated with the second user is associated with a smart contract associated with the second user
• the set of transactions associated with the user is associated with a smart contract associated with the user.
• the set of transactions associated with the asset pertains to an event stream associated with the asset
• the set of transactions associated with the user pertains to an event stream associated with the user
• the set of transactions associated with the first owner pertains to an event stream associated with the first owner
• the set of transactions associated with the second owner pertains to an event stream associated with the second owner.
• each event stream represents a smart contract such that the event stream tracks a sequence of events associated with a smart contract.
• the present aspect enables establishing and/or maintaining/updating a tamper-proof record or log, or a certificate confirming the sequential occurrence of events associated with an event stream, where the events are based on received client inputs for a given smart contract, for the execution of the smart contract.
• the present embodiment proposes methods, devices, and systems for enabling processing, i.e. creating, updating and/or terminating event stream ES, that is implemented using the blockchain and automatically creates a tamper-proof log or record of events associated with the smart contract SC that is pertaining to the event stream ES.
• the usage transaction comprises a first reference to a transaction from the set of transactions associated with the asset and a second reference to a transaction from the set of transactions associated with the user.
• the first reference is an input of the usage transaction that spends an output of the transaction from the set of transactions associated with the asset
• the second reference is a further input of the usage transaction that spends an output of the transaction from the set of transactions associated with the user.
• the set of transactions associated with the asset comprises or indicates ownership history of the asset.
• the update transaction comprises a third reference to a transaction from the set of transactions associated with the asset, a fourth reference to a transaction from the set of transactions associated with the first owner, and a fifth reference to a transaction from the set of transactions associated with the second owner.
• ownership of the asset is considered transferred from the first owner to the second owner.
• the third reference is an input of the ownership transaction that spends an output of the transaction from the set of transactions associated with the asset
• the fourth reference is a further input of the ownership transaction that spends an output of the transaction from the set of transactions associated with the first owner
• the fifth reference is yet another input of the ownership transaction that spends an output of the transaction from the set of transaction associated with the second owner.
• each set of transactions is defined by a spending relationship between a subset of the transactions in the set of transactions.
• the spending relationship is such that each transaction in the subset of transactions spends an output of a previous transaction in the subset of transactions.
• adjacent means two transactions that represent events that have occurred one after the other, or have been recorded on the blockchain one after the other.
• each set of transactions is defined by a spending relationship.
• the above-mentioned subset of transactions is a subset containing all of the transactions in the set of transactions.
• the spending relationship is such that each transaction in the set of transactions, except for a first transaction in the set, spends an output of a previous transaction.
• the above-mentioned features relating to inputs, outputs, and spending ensure the transactions are in-order and thus the set of transactions accurately represent the order the events occur in.
• the update transaction and usage transaction further enable these events to be tracked synchronously and atomically across assets, owners, and users which may also have other events occurring not related to the present interactions.
• the present aspect further comprises the steps of receiving a history request from a requestor comprising a reference to the asset, and in response to reception the history request: providing a history of uses of the asset to the requestor, wherein the history of the uses of the asset comprises information from the set of transactions associated with the asset.
• the usage message comprises data indicative of usage of the asset by a user and the usage transaction comprises data indicative of usage of the asset.
• this provides technical features to enable a person to audit and confirm their usage.
• the asset is a pay-per-use non-fungible good, product, or service.
• the asset is a song, and the data indicative of usage comprises the number of times and/or length of time a user has listened to said song.
• the present disclosure provides a device configured to perform the method of the first aspect and a system, the system comprising the server configured to perform the method of the first aspect, and a first ownership device and a second ownership device configured to coordinate transmission of an update message to the server.
• the present disclosure provides a computer- implemented method for tracking, on a blockchain, at least two clients interacting with an asset, wherein the blockchain comprises a set of transactions associated with the asset, and a set of transactions associated with each client, the method comprising the steps receiving an asset interaction event request comprising data indicative of at least two clients associated with the asset interaction event and data indicative of the asset, generating an event transaction comprising the reference to the set of transactions associated with the asset and the references to the sets of transactions associated with the at least two clients, and submitting the event transaction to the blockchain.
• the reference to the set of transactions associated with the asset comprises or is an asset transaction outpoint associated with the set of transactions associated with the asset.
• the asset transaction outpoint points towards a latest transaction in the set of transactions associated with the asset.
• each of the references to the sets of transactions associated with the at least two clients comprises a transaction outpoint associated with each of the set of transactions associated with the at least two clients.
• each transaction outpoint points towards a latest transaction in each respective set of transactions associated with the clients.
• the references to the sets of transactions are or comprise transaction inputs spending the transaction outpoints.
• the event transaction is considered part of the set of transactions associated with the asset and each of the sets of transactions associated with the at least two clients.
• the set of transactions associated with the asset pertains to an event stream associated with the asset and each set of transactions associated with a given client among the at least two clients pertains to an event stream associated with said given client. That is to say, the set of transactions associated with the first client of the at least two clients pertains to an event stream associated with the first client and the set of transactions associated with the second client of the at least two clients pertains to an event stream associated with the second client.
• each event stream represents a respective smart contract such that the event stream tracks a sequence of events associated with the smart contract.
• each set of transactions represents a respective smart contract.
• each set of transactions is defined by a spending relationship between a subset of the transactions in the set of transactions.
• Each set of transactions here preferably relates to all of: the set of transactions associated with the asset, the set of transactions associated with the first client, and the set of transactions associated with the second client.
• the spending relationship is such that each transaction in the subset of transactions spends an output of a previous transaction.
• adjacent means two transactions that represent events that have occurred one after the other, or have been recorded on the blockchain one after the other.
• each set of transactions is defined by a spending relationship.
• the above-mentioned subset of transactions is a subset containing all of the transactions in the set of transactions.
• the spending relationship is such that each transaction in the set of transactions, except for a first transaction in the set, spends an output of a previous transaction.
• the event transaction comprises data indicative of the asset interaction event.
• the data indicative of the asset interaction event is stored on an unspendable output of the event transaction. More preferably, the unspendable output comprises an OP_RETURN opcode.
• the asset is a pay-per-use non-fungible good, product, or service.
• the asset is a song and/or the asset interaction event is to exchange ownership of the asset between the at least two clients.
• the method further comprises the steps of: receiving a creation request to create a set of transactions associated with the asset, and generating and submitting to the blockchain a first ownership transaction associated with the set of transactions associated with the asset and associated with a set of transactions that is associated with a first client of the at least two clients.
• the first ownership transaction comprises a digital fingerprint uniquely identifying the asset.
• the asset interaction event is an ownership update request that comprises information indicating transfer of ownership of the asset from the first of the at least two clients to the second of the at least two clients.
• the event transaction comprises data indicative of the first client transferring ownership to the second client.
• the present disclosure provides a device configured to perform the method of the third aspect and a system, the system comprising the server configured to perform the method of the third aspect, a first client device and a second client device configured to coordinate transmission of the asset interaction event request to the server.
• the present disclosure provides a computer-implemented method for tracking events of an asset on a blockchain, comprising the steps receiving a creation request to create a set of transactions associated with the asset, generating and submitting to the blockchain a first ownership transaction associated with a set of transactions associated with the asset and associated with a set of transactions that is associated with a first owner, receiving an ownership update request comprising information indicative of a second owner, and upon reception of the ownership update request: generating and submitting an update transaction to the blockchain, the update transaction comprising information indicative of the asset, the first owner, and the second owner.
• each of the owners here can be considered analogous to each of the clients in the preceding aspects.
• the information indicative of the asset is a reference to the set of transactions associated with the asset
• the information indicative of the first owner is a reference to the set of transactions associated with the first owner
• the information indicative of the second owner is a reference to the set of transactions associated with the second owner.
• each reference to the sets of transactions comprises or is an outpoint referring to a transaction in the set of transactions.
• the outpoint refers to the latest transaction in each set of transactions. That is to say, preferably, the reference to the set of transactions associated with the asset comprises or is an outpoint of a transaction in the set of transactions associated with the asset, the reference to the set of transactions associated with the first owner comprises or is an outpoint of a transaction in the set of transactions associated with the first owner, and the reference to the set of transactions associated with the second owner comprises or is an outpoint of a transaction in the set of transactions associated with the second owner.
• each set of transactions is defined by a spending relationship between a subset of the transactions in the set of transactions.
• the spending relationship is such that at least a subset of the transactions in the set of transactions spend an output of a previous transaction.
• adjacent means two transactions that represent events that have occurred one after the other, or have been recorded on the blockchain one after the other.
• each set of transactions is defined by a spending relationship.
• the above-mentioned subset of transactions is a subset containing all of the transactions.
• the spending relationship is such that each transaction in the set of transactions, except for a first transaction in the set, spends an output of a previous transaction.
• the set of transactions associated with the asset pertains to an event stream associated with the asset
• the set of transactions associated with the first owner pertains to an event stream associated with the first owner
• the set of transactions associated with the second owner pertains to an event stream associated with the second owner.
• each event stream represents a respective smart contract such that the event stream tracks a sequence of events associated with said respective smart contract.
• the initial transaction comprises a digital fingerprint uniquely identifying the asset.
• the update transaction comprises data indicative of the first owner transferring ownership to the second owner.
• the data indicative of the ownership transfer is stored on an unspendable output of the update transaction.
• the unspendable output comprises an OP_RETURN opcode.
• the asset is a pay-per-use non-fungible good, product, or service.
• the asset is a song.
• the present disclosure provides a device configured to perform the method of the fifth aspect and a system, the system comprising the server configured to perform the method of the fifth aspect, a first owner device and a second client device configured to coordinate transmission of the ownership update request to the server.
• a device configured to perform the methods of any of the preceding aspects.
• a first owner is able to track events associated with the asset they own.
• the tracking is secure, immutable, and known to be inorder with respect to other events occurring.
• events can relate to real world usage of the asset. Tracking events relating to interactions with and/or condition of the asset are of particular interest to the owner/owner’s device as it may trigger further necessary repair and, because the sequence of the events (including the last user to use the asset), appropriately associate any required repairs with the user that may have caused such changes in condition.
• the present aspects provide advantages to track usage, ownership, or any other kind of interaction of the asset as well as any other effects associated with interactions such as deterioration of the asset and/or depreciation of the asset.
• the technical features of the embodiments to track these real-world interactions enable a more streamlined, instant, and secure tracking system.
• the use of sets of transactions can provide privacy preserving read access to the event data that has been stored on the blockchain.
• a potential owner or other auditor wishing to inspect the event history of an asset being tracked on the blockchain has the ability to view only the set of transaction associated with the asset over its lifetime.
• a user of an asset can audit their own usage of different assets by traversing only their set of transactions.
• privacy features can come from encrypting the event data before submission to the blockchain, and/or storing a proof of existence on the blockchain, while keeping the event data itself off-chain and not publicly readable.
• the data can be provided for an auditor to confirm that the proof of existence stored on the blockchain is in coordination with the actual data.
• a device (operated by for example a potential purchaser of an asset) can transmit an asset history request.
• data about the usage of the asset is provided to the requestor.
• the data about the usage is obtained by traversing the set of transactions associated with the asset. More preferably, this traversal is conducted by following the spending relationships between each transaction of the set of transactions.
• FIG. 1 shows an example system 100 for implementing a blockchain 150.
• the system 100 may comprise of a packet-switched network 101, typically a wide-area internetwork such as the Internet.
• the packet-switched network 101 comprises a plurality of blockchain nodes 104 that may be arranged to form a peer-to-peer (P2P) network 106 within the packet-switched network 101.
• P2P peer-to-peer
• the blockchain nodes 104 may be arranged as a nearcomplete graph. Each blockchain node 104 is therefore highly connected to other blockchain nodes 104.
• Each blockchain node 104 comprises computer equipment of a peer, with different ones of the nodes 104 belonging to different peers.
• Each blockchain node 104 comprises processing apparatus comprising one or more processors, e.g. one or more central processing units (CPUs), accelerator processors, application specific processors and/or field programmable gate arrays (FPGAs), and other equipment such as Application Specific Integrated Circuits (ASICs).
• Each node also comprises memory, i.e. computer-readable storage in the form of a non-transitory computer-readable medium or media.
• the memory may comprise one or more memory units employing one or more memory media, e.g. a magnetic medium such as a hard disk; an electronic medium such as a solid-state drive (SSD), flash memory or EEPROM; and/or an optical medium such as an optical disk drive.
• the blockchain 150 comprises a chain of blocks of data 151, wherein a respective copy of the blockchain 150 is maintained at each of a plurality of blockchain nodes 104 in the distributed or blockchain network 160.
• maintaining a copy of the blockchain 150 does not necessarily mean storing the blockchain 150 in full. Instead, the blockchain 150 may be pruned of data so long as each blockchain node 150 stores the blockheader (discussed below) of each block 151.
• Each block 151 in the chain comprises one or more transactions 152, wherein a transaction in this context refers to a kind of data structure. The nature of the data structure will depend on the type of transaction protocol used as part of a transaction model or scheme. A given blockchain will use one particular transaction protocol throughout.
• each transaction 152 comprises at least one input and at least one output.
• Each output specifies an amount representing a quantity of a digital asset as property, an example of which is a user 103 to whom the output is cryptographically locked (requiring a signature or other solution of that user in order to be unlocked and thereby redeemed or spent).
• Each input points back to the output of a preceding transaction 152, thereby linking the transactions.
• the inputs refer to transaction outpoints, where an outpoint is the transaction id and the index of the output being referenced.
• Each block 151 also comprises a block pointer 155 pointing back to the previously created block 151 in the chain so as to define a sequential order to the blocks 151.
• Each transaction 152 (other than a coinbase transaction) comprises a pointer back to a previous transaction so as to define an order to sequences of transactions (N.B. sequences of transactions 152 are allowed to branch).
• the chain of blocks 151 goes all the way back to a genesis block (Gb) 153 which was the first block in the chain.
• Gb genesis block
• Each of the blockchain nodes 104 is configured to forward transactions 152 to other blockchain nodes 104, and thereby cause transactions 152 to be propagated throughout the network 106.
• Each blockchain node 104 is configured to create blocks 151 and to store a respective copy of the same blockchain 150 in their respective memory.
• Each blockchain node 104 also maintains an ordered set 154 of transactions 152 waiting to be incorporated into blocks 151.
• the ordered set 154 is often referred to as a “mempool”. This term herein is not intended to limit to any particular blockchain, protocol or model. It refers to the ordered set of transactions which a node 104 has accepted as valid and for which the node 104 is obliged not to accept any other transactions attempting to spend the same output.
• the (or each) input comprises a pointer referencing the output of a preceding transaction 152i in the sequence of transactions, specifying that this output is to be redeemed or “spent” in the present transaction 152j.
• the preceding transaction could be any transaction in the ordered set 154 or any block 151.
• the preceding transaction 152i need not necessarily exist at the time the present transaction 152j is created or even sent to the network 106, though the preceding transaction 152i will need to exist and be validated in order for the present transaction to be valid.
• preceding refers to a predecessor in a logical sequence linked by pointers, not necessarily the time of creation or sending in a temporal sequence, and hence it does not necessarily exclude that the transactions 152i, 152j be created or sent out-of-order (see discussion below on orphan transactions).
• the preceding transaction 152i could equally be called the antecedent or predecessor transaction.
• the input of the present transaction 152j also comprises the input authorisation, for example the signature of the user 103a to whom the output of the preceding transaction 152i is locked.
• the output of the present transaction 152j can be cryptographically locked to a new user or entity 103b.
• the present transaction 152j can thus transfer the amount defined in the input of the preceding transaction 152i to the new user or entity 103b as defined in the output of the present transaction 152j .
• a transaction 152 may have multiple outputs to split the input amount between multiple users or entities (one of whom could be the original user or entity 103a in order to give change).
• a transaction can also have multiple inputs to gather together the amounts from multiple outputs of one or more preceding transactions and redistribute to one or more outputs of the current transaction.
• an output-based transaction protocol such as bitcoin
• an entity such as a user or machine, 103 wishes to enact a new transaction 152j
• the entity sends the new transaction from its computer terminal 102 to a recipient.
• the entity or the recipient will eventually send this transaction to one or more of the blockchain nodes 104 of the network 106 (which nowadays are typically servers or data centres but could in principle be other user terminals).
• the entity 103 enacting the new transaction 152j could send the transaction to one or more of the blockchain nodes 104 and, in some examples, not to the recipient.
• a blockchain node 104 that receives a transaction checks whether the transaction is valid according to a blockchain node protocol which is applied at each of the blockchain nodes 104.
• the blockchain node protocol typically requires the blockchain node 104 to check that a cryptographic signature in the new transaction 152j matches the expected signature, which depends on the previous transaction 152i in an ordered sequence of transactions 152.
• this may comprise checking that the cryptographic signature or other authorisation of the entity 103 included in the input of the new transaction 152j matches a condition defined in the output of the preceding transaction 152i which the new transaction assigns, wherein this condition typically comprises at least checking that the cryptographic signature or other authorisation in the input of the new transaction 152j unlocks the output of the previous transaction 152i to which the input of the new transaction is linked to.
• the condition may be at least partially defined by a script included in the output of the preceding transaction 152i.
• the blockchain node 104 forwards it to one or more other blockchain nodes 104 in the blockchain network 106. These other blockchain nodes 104 apply the same test according to the same blockchain node protocol, and so forward the new transaction 152j on to one or more further nodes 104, and so forth. In this way the new transaction is propagated throughout the network of blockchain nodes 104.
• the definition of whether a given output is assigned is whether it has yet been validly redeemed by the input of another, onward transaction 152j according to the blockchain node protocol.
• Another condition for a transaction to be valid is that the output of the preceding transaction 152i which it attempts to assign or redeem has not already been assigned/redeemed by another transaction. Again if not valid, the transaction 152j will not be propagated (unless flagged as invalid and propagated for alerting) or recorded in the blockchain 150. This guards against double-spending whereby the transactor tries to assign the output of the same transaction more than once.
• An account-based model on the other hand guards against double-spending by maintaining an account balance. Because again there is a defined order of transactions, the account balance has a single defined state at any one time.
• blockchain nodes 104 In addition to validating transactions, blockchain nodes 104 also race to be the first to create blocks of transactions in a process commonly referred to as mining, which is supported by “proof- of- work”. At a blockchain node 104, new transactions are added to an ordered set 154 of valid transactions that have not yet appeared in a block 151 recorded on the blockchain 150. The blockchain nodes then race to assemble a new valid block 151 of transactions 152 from the ordered set of transactions 154 by attempting to solve a cryptographic puzzle. Typically this comprises searching for a “nonce” value such that when the nonce is concatenated with a representation of the ordered set of transactions 154 and hashed, then the output of the hash meets a predetermined condition. E.g.
• the predetermined condition may be that the output of the hash has a certain predefined number of leading zeros. Note that this is just one particular type of proof-of-work puzzle, and other types are not excluded. A property of a hash function is that it has an unpredictable output with respect to its input. Therefore this search can only be performed by brute force, thus consuming a substantive amount of processing resource at each blockchain node 104 that is trying to solve the puzzle.
• the first blockchain node 104 to solve the puzzle announces this to the network 106, providing the solution as proof which can then be easily checked by the other blockchain nodes 104 in the network (once given the solution to a hash it is straightforward to check that it causes the output of the hash to meet the condition).
• the first blockchain node 104 propagates a block to a threshold consensus of other nodes that accept the block and thus enforce the protocol rules.
• the ordered set of transactions 154 then becomes recorded as a new block 151 in the blockchain 150 by each of the blockchain nodes 104.
• a block pointer 155 is also assigned to the new block 151 n pointing back to the previously created block 151 n-1 in the chain.
• a significant amount of effort, for example in the form of hash, required to create a proof-of-work solution signals the intent of the first node 104 to follow the rules of the blockchain protocol.
• Such rules include not accepting a transaction as valid if it assigns the same output as a previously validated transaction, otherwise known as double-spending.
• the block 151 cannot be modified since it is recognized and maintained at each of the blockchain nodes 104 in the blockchain network 106.
• the block pointer 155 also imposes a sequential order to the blocks 151. Since the transactions 152 are recorded in the ordered blocks at each blockchain node 104 in a network 106, this therefore provides an immutable public ledger of the transactions.
• a protocol also exists for resolving any “fork” that may arise, which is where two blockchain nodes104 solve their puzzle within a very short time of one another such that a conflicting view of the blockchain gets propagated between nodes 104. In short, whichever prong of the fork grows the longest becomes the definitive blockchain 150. Note this should not affect the users or agents of the network as the same transactions will appear in both forks.
• a node that successfully constructs a new block 104 is granted the ability to assign an accepted amount of the digital asset in a new special kind of transaction which distributes a defined quantity of the digital asset (as opposed to an inter-agent, or inter-user transaction which transfers an amount of the digital asset from one agent or user to another).
• This special type of transaction is usually referred to as a “coinbase transaction”, but may also be termed an “initiation transaction”. It typically forms the first transaction of the new block 151 n.
• the proof-of-work signals the intent of the node that constructs the new block to follow the protocol rules allowing this special transaction to be redeemed later.
• the blockchain protocol rules may require a maturity period, for example 100 blocks, before this special transaction may be redeemed.
• a regular (non-generation) transaction 152 will also specify an additional transaction fee in one of its outputs, to further reward the blockchain node 104 that created the block 151n in which that transaction was published. This fee is normally referred to as the “transaction fee”, and is discussed blow.
• each of the blockchain nodes 104 takes the form of a server comprising one or more physical server units, or even whole a data centre.
• any given blockchain node 104 could take the form of a user terminal or a group of user terminals networked together.
• each blockchain node 104 stores software configured to run on the processing apparatus of the blockchain node 104 in order to perform its respective role or roles and handle transactions 152 in accordance with the blockchain node protocol. It will be understood that any action attributed herein to a blockchain node 104 may be performed by the software run on the processing apparatus of the respective computer equipment.
• the node software may be implemented in one or more applications at the application layer, or a lower layer such as the operating system layer or a protocol layer, or any combination of these.
• Also connected to the network 101 is the computer equipment 102 of each of a plurality of parties 103 in the role of consuming users. These users may interact with the blockchain network but do not participate in validating, constructing or propagating transactions and blocks.
• Some of these users or agents 103 may act as senders and recipients in transactions. Other users may interact with the blockchain 150 without necessarily acting as senders or recipients. For instance, some parties may act as storage entities that store a copy of the blockchain 150 (e.g. having obtained a copy of the blockchain from a blockchain node 104).
• Some or all of the parties 103 may be connected as part of a different network, e.g. a network overlaid on top of the blockchain network 106.
• Users of the blockchain network (often referred to as “clients”) may be said to be part of a system that includes the blockchain network; however, these users are not blockchain nodes 104 as they do not perform the roles required of the blockchain nodes. Instead, each party 103 may interact with the blockchain network 106 and thereby utilize the blockchain 150 by connecting to (i.e. communicating with) a blockchain node 106.
• Two parties 103 and their respective equipment 102 are shown for illustrative purposes: a first party 103a and his/her respective computer equipment 102a, and a second party 103b and his/her respective computer equipment 102b. It will be understood that many more such parties 103 and their respective computer equipment 102 may be present and participating in the system 100, but for convenience they are not illustrated.
• Each party 103 may be an individual or an organization. Purely by way of illustration the first party 103a is referred to herein as Alice and the second party 103b is referred to as Bob, but it will be appreciated that this is not limiting and any reference herein to Alice or Bob may be replaced with “first party” and “second “party” respectively.
• the computer equipment 102 of each party 103 comprises respective processing apparatus comprising one or more processors, e.g. one or more CPUs, GPUs, other accelerator processors, application specific processors, and/or FPGAs.
• the computer equipment 102 of each party 103 further comprises memory, i.e. computer-readable storage in the form of a non-transitory computer-readable medium or media.
• This memory may comprise one or more memory units employing one or more memory media, e.g. a magnetic medium such as hard disk; an electronic medium such as an SSD, flash memory or EEPROM; and/or an optical medium such as an optical disc drive.
• the memory on the computer equipment 102 of each party 103 stores software comprising a respective instance of at least one client application 105 arranged to run on the processing apparatus.
• any action attributed herein to a given party 103 may be performed using the software run on the processing apparatus of the respective computer equipment 102.
• the computer equipment 102 of each party 103 comprises at least one user terminal, e.g. a desktop or laptop computer, a tablet, a smartphone, or a wearable device such as a smartwatch.
• the computer equipment 102 of a given party 103 may also comprise one or more other networked resources, such as cloud computing resources accessed via the user terminal.
• the client application 105 may be initially provided to the computer equipment 102 of any given party 103 on suitable computer-readable storage medium or media, e.g. downloaded from a server, or provided on a removable storage device such as a removable SSD, flash memory key, removable EEPROM, removable magnetic disk drive, magnetic floppy disk or tape, optical disk such as a CD or DVD ROM, or a removable optical drive, etc.
• suitable computer-readable storage medium or media e.g. downloaded from a server, or provided on a removable storage device such as a removable SSD, flash memory key, removable EEPROM, removable magnetic disk drive, magnetic floppy disk or tape, optical disk such as a CD or DVD ROM, or a removable optical drive, etc.
• the client application 105 comprises at least a “wallet” function.
• This has two main functionalities. One of these is to enable the respective party 103 to create, authorise (for example sign) and send transactions 152 to one or more bitcoin nodes 104 to then be propagated throughout the network of blockchain nodes 104 and thereby included in the blockchain 150. The other is to report back to the respective party the amount of the digital asset that he or she currently owns.
• this second functionality comprises collating the amounts defined in the outputs of the various 152 transactions scattered throughout the blockchain 150 that belong to the party in question.
• client functionality may be described as being integrated into a given client application 105, this is not necessarily limiting and instead any client functionality described herein may instead be implemented in a suite of two or more distinct applications, e.g. interfacing via an API, or one being a plug-in to the other. More generally the client functionality could be implemented at the application layer or a lower layer such as the operating system, or any combination of these. The following will be described in terms of a client application 105 but it will be appreciated that this is not limiting.
• the instance of the client application or software 105 on each computer equipment 102 is operatively coupled to at least one of the blockchain nodes 104 of the network 106. This enables the wallet function of the client 105 to send transactions 152 to the network 106.
• the client 105 is also able to contact blockchain nodes 104 in order to query the blockchain 150 for any transactions of which the respective party 103 is the recipient (or indeed inspect other parties’ transactions in the blockchain 150, since in embodiments the blockchain 150 is a public facility which provides trust in transactions in part through its public visibility).
• the wallet function on each computer equipment 102 is configured to formulate and send transactions 152 according to a transaction protocol.
• each blockchain node 104 runs software configured to validate transactions 152 according to the blockchain node protocol, and to forward transactions 152 in order to propagate them throughout the blockchain network 106.
• the transaction protocol and the node protocol correspond to one another, and a given transaction protocol goes with a given node protocol, together implementing a given transaction model.
• the same transaction protocol is used for all transactions 152 in the blockchain 150.
• the same node protocol is used by all the nodes 104 in the network 106.
• a given party 103 say Alice, wishes to send a new transaction 152j to be included in the blockchain 150, then she formulates the new transaction in accordance with the relevant transaction protocol (using the wallet function in her client application 105). She then sends the transaction 152 from the client application 105 to one or more blockchain nodes 104 to which she is connected. E.g. this could be the blockchain node 104 that is best connected to Alice’s computer 102.
• any given blockchain node 104 receives a new transaction 152j, it handles it in accordance with the blockchain node protocol and its respective role. This comprises first checking whether the newly received transaction 152j meets a certain condition for being “valid”, examples of which will be discussed in more detail shortly.
• condition for validation may be configurable on a pertransaction basis by scripts included in the transactions 152.
• condition could simply be a built-in feature of the node protocol, or be defined by a combination of the script and the node protocol.
• any blockchain node 104 that receives the transaction 152j will add the new validated transaction 152 to the ordered set of transactions 154 maintained at that blockchain node 104. Further, any blockchain node 104 that receives the transaction 152j will propagate the validated transaction 152 onward to one or more other blockchain nodes 104 in the network 106. Since each blockchain node 104 applies the same protocol, then assuming the transaction 152j is valid, this means it will soon be propagated throughout the whole network 106.
• Different blockchain nodes 104 may receive different instances of a given transaction first and therefore have conflicting views of which instance is ‘valid’ before one instance is published in a new block 151 , at which point all blockchain nodes 104 agree that the published instance is the only valid instance. If a blockchain node 104 accepts one instance as valid, and then discovers that a second instance has been recorded in the blockchain 150 then that blockchain node 104 must accept this and will discard (i.e. treat as invalid) the instance which it had initially accepted (i.e. the one that has not been published in a block 151).
• An alternative type of transaction protocol operated by some blockchain networks may be referred to as an “account-based” protocol, as part of an account-based transaction model.
• each transaction does not define the amount to be transferred by referring back to the IITXO of a preceding transaction in a sequence of past transactions, but rather by reference to an absolute account balance.
• the current state of all accounts is stored, by the nodes of that network, separate to the blockchain and is updated constantly.
• transactions are ordered using a running transaction tally of the account (also called the “position”).
• This value is signed by the sender as part of their cryptographic signature and is hashed as part of the transaction reference calculation.
• an optional data field may also be signed the transaction. This data field may point back to a previous transaction, for example if the previous transaction ID is included in the data field.
• FIG. 2 illustrates an example transaction protocol.
• a transaction 152 (abbreviated “Tx”) is the fundamental data structure of the blockchain 150 (each block 151 comprising one or more transactions 152). The following will be described by reference to an output-based or “UTXO” based protocol. However, this is not limiting to all possible embodiments. Note that while the example UTXO-based protocol is described with reference to bitcoin, it may equally be implemented on other example blockchain networks.
• each transaction (“Tx”) 152 comprises a data structure comprising one or more inputs 202, and one or more outputs 203.
• Each output 203 may comprise an unspent transaction output (IITXO), which can be used as the source for the input 202 of another new transaction (if the IITXO has not already been redeemed).
• the IITXO includes a value specifying an amount of a digital asset. This represents a set number of tokens on the distributed ledger.
• the IITXO may also contain the transaction ID of the transaction from which it came, amongst other information.
• the transaction data structure may also comprise a header 201 , which may comprise an indicator of the size of the input field(s) 202 and output field(s) 203.
• the header 201 may also include an ID of the transaction. In embodiments the transaction ID is the hash of the transaction data (excluding the transaction ID itself) and stored in the header 201 of the raw transaction 152 submitted to the nodes 104.
• Txi new transaction 152j
• the preceding transaction 152i is labelled “Txo in Figure 2.
• Tx 0 and Tx 2 are just arbitrary labels. They do not necessarily mean that Tx 0 is the first transaction in the blockchain 151, nor that Tx 2 is the immediate next transaction in the pool 154. Tx 2 could point back to any preceding (i.e. antecedent) transaction that still has an unspent output 203 locked to Alice.
• the preceding transaction Tx 0 may already have been validated and included in a block 151 of the blockchain 150 at the time when Alice creates her new transaction Txi, or at least by the time she sends it to the network 106. It may already have been included in one of the blocks 151 at that time, or it may be still waiting in the ordered set 154 in which case it will soon be included in a new block 151. Alternatively Tx 0 and Txi could be created and sent to the network 106 together, or Tx 0 could even be sent after Txi if the node protocol allows for buffering “orphan” transactions.
• preceding and “subsequent” as used herein in the context of the sequence of transactions refer to the order of the transactions in the sequence as defined by the transaction pointers specified in the transactions (which transaction points back to which other transaction, and so forth). They could equally be replaced with “predecessor” and “successor”, or “antecedent” and “descendant”, “parent” and “child”, or such like. It does not necessarily imply an order in which they are created, sent to the network 106, or arrive at any given blockchain node 104. Nevertheless, a subsequent transaction (the descendent transaction or “child”) which points to a preceding transaction (the antecedent transaction or “parent”) will not be validated until and unless the parent transaction is validated. A child that arrives at a blockchain node 104 before its parent is considered an orphan. It may be discarded or buffered for a certain time to wait for the parent, depending on the node protocol and/or node behaviour.
• One of the one or more outputs 203 of the preceding transaction Tx 0 comprises a particular IITXO, labelled here UTXOo.
• Each IITXO comprises a value specifying an amount of the digital asset represented by the IITXO, and a locking script which defines a condition which must be met by an unlocking script in the input 202 of a subsequent transaction in order for the subsequent transaction to be validated, and therefore for the IITXO to be successfully redeemed.
• the locking script locks the amount to a particular party (the beneficiary of the transaction in which it is included).
• the locking script defines an unlocking condition, typically comprising a condition that the unlocking script in the input of the subsequent transaction comprises the cryptographic signature of the party to whom the preceding transaction is locked.
• the locking script (aka scriptPubKey) is a piece of code written in the domain specific language recognized by the node protocol. A particular example of such a language is called “Script” (capital S) which is used by the blockchain network.
• the locking script specifies what information is required to spend a transaction output 203, for example the requirement of Alice’s signature. Unlocking scripts appear in the outputs of transactions.
• the unlocking script (aka scriptSig) is a piece of code written the domain specific language that provides the information required to satisfy the locking script criteria. For example, it may contain Bob’s signature. Unlocking scripts appear in the input 202 of transactions.
• UTXOo in the output 203 of Tx 0 comprises a locking script [Checksig PT which requires a signature Sig P A of Alice in order for UTXOo to be redeemed (strictly, in order for a subsequent transaction attempting to redeem UTXOo to be valid).
• [Checksig PT contains a representation (i.e. a hash) of the public key P A from a publicprivate key pair of Alice.
• the input 202 of Tx 2 comprises a pointer pointing back to Tx 2 (e.g. by means of its transaction ID, TxID 0 , which in embodiments is the hash of the whole transaction Tx 0 ).
• the input 202 of Tx 2 comprises an index identifying UTXOo within Tx 0 , to identify it amongst any other possible outputs of Tx 0 .
• the input 202 of Tx 2 further comprises an unlocking script ⁇ Sig P A > which comprises a cryptographic signature of Alice, created by Alice applying her private key from the key pair to a predefined portion of data (sometimes called the “message” in cryptography).
• the data (or “message”) that needs to be signed by Alice to provide a valid signature may be defined by the locking script, or by the node protocol, or by a combination of these.
• the node applies the node protocol. This comprises running the locking script and unlocking script together to check whether the unlocking script meets the condition defined in the locking script (where this condition may comprise one or more criteria). In embodiments this involves concatenating the two scripts:
• the blockchain node 104 deems Txi valid. This means that the blockchain node 104 will add Txi to the ordered set of transactions 154. The blockchain node 104 will also forward the transaction Txi to one or more other blockchain nodes 104 in the network 106, so that it will be propagated throughout the network 106. Once Txi has been validated and included in the blockchain 150, this defines //7A7%from Tx o as spent. Note that Txi can only be valid if it spends an unspent transaction output 203.
• Txi will be invalid even if all the other conditions are met.
• the blockchain node 104 also needs to check whether the referenced IITXO in the preceding transaction Tx 0 is already spent (i.e. whether it has already formed a valid input to another valid transaction). This is one reason why it is important for the blockchain 150 to impose a defined order on the transactions 152.
• a given blockchain node 104 may maintain a separate database marking which UTXOs 203 in which transactions 152 have been spent, but ultimately what defines whether a IITXO has been spent is whether it has already formed a valid input to another valid transaction in the blockchain 150.
• a given IITXO needs to be spent as a whole. It cannot “leave behind” a fraction of the amount defined in the IITXO as spent while another fraction is spent.
• the amount from the IITXO can be split between multiple outputs of the next transaction.
• the amount defined in UTXOo in Tx 0 can be split between multiple UTXOs in Tx 2 .
• Alice does not want to give Bob all of the amount defined in UTXOo, she can use the remainder to give herself change in a second output of Tx 2 , or pay another party.
• the transaction fee does not require its own separate output 203 (i.e. does not need a separate UTXO). Instead any difference between the total amount pointed to by the input(s) 202 and the total amount of specified in the output(s) 203 of a given transaction 152 is automatically given to the blockchain node 104 publishing the transaction.
• a pointer to UTXOo is the only input to Tx 2 , and Tx 2 has only one output UTXOi. If the amount of the digital asset specified in UTXOo is greater than the amount specified in UTXOi, then the difference may be assigned by the node 104 that publishes the block containing UTXOi. Alternatively or additionally however, it is not necessarily excluded that a transaction fee could be specified explicitly in its own one of the UTXOs 203 of the transaction 152. Alice and Bob’s digital assets consist of the UTXOs locked to them in any transactions 152 anywhere in the blockchain 150. Hence typically, the assets of a given party 103 are scattered throughout the UTXOs of various transactions 152 throughout the blockchain 150.
• script code is often represented schematically (i.e. not using the exact language).
• operation codes opcodes
• OP_...” refers to a particular opcode of the Script language.
• OP_RETURN is an opcode of the Script language that when preceded by OP_FALSE at the beginning of a locking script creates an unspendable output of a transaction that can store data within the transaction, and thereby record the data immutably in the blockchain 150.
• the data could comprise a document which it is desired to store in the blockchain.
• OP_RETURN in this manner is a specific example using a provably unspendable script for use on a Bitcoin based blockchain system.
• a person skilled in the art will appreciate that different blockchain systems will have different mechanisms and data formats for ensuring scripts are unspendable and/or storing data in a transaction.
• an input of a transaction contains a digital signature corresponding to a public key P A .
• this is based on the ECDSA using the elliptic curve secp256k1.
• a digital signature signs a particular piece of data.
• the signature will sign part of the transaction input, and some or all of the transaction outputs. The particular parts of the outputs it signs depends on the SIGHASH flag.
• the SIGHASH flag is usually a 4-byte code included at the end of a signature to select which outputs are signed (and thus fixed at the time of signing).
• the locking script is sometimes called “scriptPubKey” referring to the fact that it typically comprises the public key of the party to whom the respective transaction is locked.
• the unlocking script is sometimes called “scriptSig” referring to the fact that it typically supplies the corresponding signature.
• the scripting language could be used to define any one or more conditions. Hence the more general terms “locking script” and “unlocking script” may be preferred.
• the client application on each of Alice and Bob’s computer equipment 102a, 120b, respectively, may comprise additional communication functionality.
• This additional functionality enables Alice 103a to establish a separate side channel 301 with Bob 103b (at the instigation of either party or a third party).
• the side channel 301 enables exchange of data separately from the blockchain network.
• Such communication is sometimes referred to as “off-chain” communication.
• this may be used to exchange a transaction 152 between Alice and Bob without the transaction (yet) being registered onto the blockchain network 106 or making its way onto the chain 150, until one of the parties chooses to broadcast it to the network 106.
• Sharing a transaction in this way is sometimes referred to as sharing a “transaction template”.
• a transaction template may lack one or more inputs and/or outputs that are required in order to form a complete transaction.
• the side channel 301 may be used to exchange any other transaction related data, such as keys, negotiated amounts or terms, data content, etc.
• the side channel 301 may be established via the same packet-switched network 101 as the blockchain network 106. Alternatively or additionally, the side channel 301 may be established via a different network such as a mobile cellular network, or a local area network such as a local wireless network, or even a direct wired or wireless link between Alice and Bob’s devices 102a, 102b. Generally, the side channel 301 as referred to anywhere herein may comprise any one or more links via one or more networking technologies or communication media for exchanging data “off-chain”, i.e. separately from the blockchain network 106. Where more than one link is used, then the bundle or collection of off-chain links as a whole may be referred to as the side channel 301. Note therefore that if it is said that Alice and Bob exchange certain pieces of information or data, or such like, over the side channel 301 , then this does not necessarily imply all these pieces of data have to be send over exactly the same link or even the same type of network.
• FIG. 3A illustrates an example implementation of the client application 105 for implementing embodiments of the presently disclosed scheme.
• the client application 105 comprises a transaction engine 351 and a user interface (III) layer 352.
• the transaction engine 351 is configured to implement the underlying transaction-related functionality of the client 105, such as to formulate transactions 152, receive and/or send transactions and/or other data over the side channel 301 , and/or send transactions to one or more nodes 104 to be propagated through the blockchain network 106, in accordance with the schemes discussed above and as discussed in further detail shortly.
• the transaction engine 351 of each client 105 comprises a function 353 ...
• the III layer 352 is configured to render a user interface via a user input/output (I/O) means of the respective user’s computer equipment 102, including outputting information to the respective user 103 via a user output means of the equipment 102, and receiving inputs back from the respective user 103 via a user input means of the equipment 102.
• the user output means could comprise one or more display screens (touch or nontouch screen) for providing a visual output, one or more speakers for providing an audio output, and/or one or more haptic output devices for providing a tactile output, etc.
• the user input means could comprise for example the input array of one or more touch screens (the same or different as that/those used for the output means); one or more cursor-based devices such as mouse, trackpad or trackball; one or more microphones and speech or voice recognition algorithms for receiving a speech or vocal input; one or more gesturebased input devices for receiving the input in the form of manual or bodily gestures; or one or more mechanical buttons, switches or joysticks, etc.
• the various functionality herein may be described as being integrated into the same client application 105, this is not necessarily limiting and instead they could be implemented in a suite of two or more distinct applications, e.g. one being a plug-in to the other or interfacing via an API (application programming interface).
• the functionality of the transaction engine 351 may be implemented in a separate application than the III layer 352, or the functionality of a given module such as the transaction engine 351 could be split between more than one application.
• some or all of the described functionality could be implemented at, say, the operating system layer.
• Figure 3B gives a mock-up of an example of the user interface (III) 360 which may be rendered by the III layer 352 of the client application 105a on Alice’s equipment 102a. It will be appreciated that a similar III may be rendered by the client 105b on Bob’s equipment 102b, or that of any other party. By way of illustration Figure 3B shows the III 360 from Alice’s perspective.
• the III 360 may comprise one or more III elements 362, 362, 363 rendered as distinct III elements via the user output means.
• the III elements may comprise one or more user-selectable elements 362 which may be, such as different on-screen buttons, or different options in a menu, or such like.
• the user input means is arranged to enable the user 103 (in this case Alice 103a) to select or otherwise operate one of the options, such as by clicking or touching the III element on-screen, or speaking a name of the desired option (N.B. the term “manual” as used herein is meant only to contrast against automatic, and does not necessarily limit to the use of the hand or hands).
• the III elements may comprise one or more data entry fields 362, through which the user can ...
• These data entry fields are rendered via the user output means, e.g. on-screen, and the data can be entered into the fields through the user input means, e.g. a keyboard or touchscreen.
• the data could be received orally for example based on speech recognition.
• the III elements may comprise one or more information elements 363 output to output information to the user. E.g. this/these could be rendered on screen or audibly.
• III 360 shown in Figure 3 is only a schematized mock-up and in practice it may comprise one or more further III elements, which for conciseness are not illustrated.
• Figure 4 illustrates an example of the node software 450 that is run on each blockchain node 104 of the network 106, in the example of a UTXO- or output-based model. Note that another entity may run node software 450 without being classed as a node 104 on the network 106, i.e. without performing the actions required of a node 104.
• the node software 450 may contain, but is not limited to, a protocol engine 451 , a script engine 452, a stack 453, an application-level decision engine 454, and a set of one or more blockchain-related functional modules 455.
• Each node 104 may run node software that contains, but is not limited to, all three of: a consensus module 455C (for example, proof-of-work), a propagation module 455P and a storage module 455S (for example, a database).
• the protocol engine 351 is typically configured to recognize the different fields of a transaction 152 and process them in accordance with the node protocol.
• a transaction 152j (Tx 7 ) is received having an input pointing to an output (e.g. IITXO) of another, preceding transaction 152i then the protocol engine 451 identifies the unlocking script in Txj and passes it to the script engine 452.
• the protocol engine 451 also identifies and retrieves Txt based on the pointer in the input of Txj.
• Tx L may be published on the blockchain 150, in which case the protocol engine may retrieve Txt from a copy of a block 151 of the blockchain 150 stored at the node 104. Alternatively, Tx L may yet to have been published on the blockchain 150. In that case, the protocol engine 451 may retrieve Tx L from the ordered set 154 of unpublished transactions maintained by the node104. Either way, the script engine 451 identifies the locking script in the referenced output of Txt and passes this to the script engine 452.
• the script engine 452 thus has the locking script of Tx L and the unlocking script from the corresponding input of Txj.
• transactions labelled Tx 0 and Tx are illustrated in Figure 2, but the same could apply for any pair of transactions.
• the script engine 452 runs the two scripts together as discussed previously, which will include placing data onto and retrieving data from the stack 453 in accordance with the stack-based scripting language being used (e.g. Script).
• the script engine 452 determines whether or not the unlocking script meets the one or more criteria defined in the locking script - i.e. does it “unlock” the output in which the locking script is included? The script engine 452 returns a result of this determination to the protocol engine 451. If the script engine 452 determines that the unlocking script does meet the one or more criteria specified in the corresponding locking script, then it returns the result “true”. Otherwise it returns the result “false”.
• the result “true” from the script engine 452 is one of the conditions for validity of the transaction.
• protocol-level conditions evaluated by the protocol engine 451 that must be met as well; such as that the total amount of digital asset specified in the output(s) of Txj does not exceed the total amount pointed to by its inputs, and that the pointed-to output of Tx L has not already been spent by another valid transaction.
• the protocol engine 451 evaluates the result from the script engine 452 together with the one or more protocol-level conditions, and only if they are all true does it validate the transaction Txj.
• the protocol engine 451 outputs an indication of whether the transaction is valid to the application-level decision engine 454.
• the decision engine 454 may select to control both of the consensus module 455C and the propagation module 455P to perform their respective blockchain-related function in respect of Txj. This comprises the consensus module 455C adding Txj to the node’s respective ordered set of transactions 154 for incorporating in a block 151 , and the propagation module 455P forwarding Txj to another blockchain node 104 in the network 106.
• the application-level decision engine 454 may apply one or more additional conditions before triggering either or both of these functions. E.g. the decision engine may only select to publish the transaction on condition that the transaction is both valid and leaves enough of a transaction fee.
• true and “false” herein do not necessarily limit to returning a result represented in the form of only a single binary digit (bit), though that is certainly one possible implementation. More generally, “true” can refer to any state indicative of a successful or affirmative outcome, and “false” can refer to any state indicative of an unsuccessful or nonaffirmative outcome. For instance in an account-based model, a result of “true” could be indicated by a combination of an implicit, protocol-level validation of a signature and an additional affirmative output of a smart contract (the overall result being deemed to signal true if both individual outcomes are true).
• bitcoin network 106 For instance, some embodiments above have been described in terms of a bitcoin network 106, bitcoin blockchain 150 and bitcoin nodes 104.
• the bitcoin blockchain is one particular example of a blockchain 150 and the above description may apply generally to any blockchain. That is, the present invention is in by no way limited to the bitcoin blockchain. More generally, any reference above to bitcoin network 106, bitcoin blockchain 150 and bitcoin nodes 104 may be replaced with reference to a blockchain network 106, blockchain 150 and blockchain node 104 respectively.
• the blockchain, blockchain network and/or blockchain nodes may share some or all of the described properties of the bitcoin blockchain 150, bitcoin network 106 and bitcoin nodes 104 as described above.
• the blockchain network 106 is the bitcoin network and bitcoin nodes 104 perform at least all of the described functions of creating, publishing, propagating and storing blocks 151 of the blockchain 150. It is not excluded that there may be other network entities (or network elements) that only perform one or some but not all of these functions. That is, a network entity may perform the function of propagating and/or storing blocks without creating and publishing blocks (recall that these entities are not considered nodes of the preferred Bitcoin network 106).
• the blockchain network 106 may not be the bitcoin network.
• a node may perform at least one or some but not all of the functions of creating, publishing, propagating and storing blocks 151 of the blockchain 150.
• a “node” may be used to refer to a network entity that is configured to create and publish blocks 151 but not store and/or propagate those blocks 151 to other nodes.
• any reference to the term “bitcoin node” 104 above may be replaced with the term “network entity” or “network element”, wherein such an entity/element is configured to perform some or all of the roles of creating, publishing, propagating and storing blocks.
• the functions of such a network entity/element may be implemented in hardware in the same way described above with reference to a blockchain node 104.
• Figure 5 relates to a system 500 according to a first aspect of the present disclosure for the provision of a blockchain based, synchronised, in-order, immutable, log of events associated with an asset 516, preferably as a part of a platform processor 504 that provides a plurality of services that are associated with a blockchain 101.
• an event refers to interactions with the asset including usage of the asset.
• the platform processor 504 is optionally the platform as described in greater detail below with respect to Figures 10 and 11.
• the platform processor 504 is configured to communicate and/or otherwise interact with the blockchain 101, an asset owner 502, an asset user 506 and/or the asset 516.
• the platform processor 504 is described herein as a monolithic server for ease of illustrative purposes.
• a platform processor 504 may be implemented as a single server, a mainframe, a collection of servers, a microservice, a collection of microservices, cloud service, any combination of the preceding and/or other computing platform or platforms.
• the platform service 504 can be configured to track multiple assets with the same or different and/or multiple owners of the asset(s). Preferably there is at least one user 506 of the asset 516.
• the system 500 of this example comprises a first owner 502, and a second owner (not shown in Figure 5).
• the owner(s) own the asset and/or have an interest and/or stake in the usage and/or interactions made with the asset 516.
• the asset 516 has multiple owners associated with it at any one time.
• each of the owner(s) 502, user(s) 506, and asset(s) 516 are configured to transmit event data to the platform processor 504 such that the platform processor can process and record the events.
• the event data is transmitted via API requests as described below with reference to Figures 10 and 11.
• the events, or at least a subsection of the events, are recorded on the blockchain 101.
• the event data is preferably stored on the blockchain as a part of a transaction.
• Event data or a portion of the event data is held in an un-spendable OP_RETURN output of the transaction.
• This is a Script opcode which can be used to write arbitrary data on blockchain and also to mark a transaction output as invalid.
• OP_RETURN is an opcode of the Script language for creating an un- spendable output of a transaction that can store data such as metadata within the transaction, and thereby record the metadata immutably on the blockchain 101.
• the blockchain 101 comprises a set of transactions associated with each of the owner(s) 502, user(s) 506, and asset(s) 516.
• Each set of transactions represents or is associated with a synchronised, in-order, immutable, log of events associated with the appropriate owner, user, or asset.
• the set of transactions is associated with an event stream as described below under the heading “Event Streams”.
• the event stream is associated with a smart contract associated with the owner, user, or asset it is representing.
• Each transaction in the set of transactions is preferably created and submitted to the blockchain by the platform processor 504.
• an event as used herein is understood to be broad rather than specific to the examples provided herein. Different owners 502, users 506, or assets 516 within the system 500 will have different types of events associated with them. For example, an event associated with the owner 502 could be any one or more of the following:
• an event associated with the asset 516 could be any one or more of the following:
• an event associated with the user 506 could be any one or more of the following:
• the event is stored on the blockchain 101
• the event is stored on the blockchain as data indicative of the event.
• This data indicative of the event could be text describing what the event was and include any relevant variables such as a temperature, time period of use, a voltage, a cryptographic key, and more.
• the type and format of data stored may depend on the event.
• a skilled person will appreciate that different events will require different data types to represent them.
• Alternative to storing the event itself on the blockchain is to store a proof of existence of said event. A proof of existence preferably would be a hash of the event data.
• each set of transactions associated with each owner, user, or asset needs to be updated with the transaction comprising the new event.
• each set of transactions is updated atomically (such that not only one set of transactions get a new transaction comprising the event - either all sets or no sets receive the event) and/or synchronously (such that events that have occurred previous to this current event involving multiple owner(s), user(s), or asset(s) do not get added to the set of transactions out of order with respect to any sets of transactions).
• the sets of transactions are updated both atomically and synchronously with respect to other events.
• each set of transactions relevant to the event are updated atomically through use of a single transaction that belongs to all of the sets of transactions associated with the owner(s), user(s), or asset(s) associated with the event.
• a single transaction will belong to all of: (i) the set of transaction associated with the asset, (ii) the set of transactions associated with the first owner, (iii) and the set of transactions associated with the second owner. Further description below with reference to Figure 9 provides example embodiments of how such a transaction can be associated with two or more sets of transactions.
• the system 500 preferably further provides the ability for the owner(s) 502 and/or the user(s) 506 to read any event data stored by the platform processor 504. This reading of event data is preferably conducted by submitting a request to the platform processor 504. Alternatively or additionally, the data may be obtained directly from the blockchain 101.
• Figures 6A-6C illustrate example methods 600, 610, 620 where different types of events are submitted for recordal on the blockchain in a transaction.
• Each transaction is associated with a set of transactions associated with each of the owner(s), user(s), and/or asset(s) relevant to the event.
• Figure 7 illustrates the status of the sets of transactions after a number of events have occurred.
• a number of transactions 702-722 are shown being associated to different sets of transactions 740-748.
• Each set of transactions 740-748 is depicted as a vertical line down the figure where every transaction 702-722 that comprises a block on the vertical line is a transaction that is a part of the set of transactions associated with said line.
• sets of transactions 740-748 have already been established prior to this.
• the set of transactions associated with the asset 740 is created in the create transaction 702.
• this create transaction 702 comprises information to uniquely identify the asset such as a serial number or digital certificate.
• the create transaction 702 comprises a digital fingerprint to uniquely identify the song.
• each other set of transactions comprise a create transaction (not shown). These would also comprise identifying information such as a user’s public key and/or digital signature.
• the methods 600, 610 of Figures 6A and 6B describe two specific types of events being recorded.
• the platform processor 504 is configured to undertake both methods 600, 610.
• the ownership transfer method 600 provides an example where three sets of transactions are updated and the asset user event method 610 provides an example where two sets of transactions are updated.
• asset-related events for submission to a blockchain and that other examples of event transactions are possible where different sets of transactions need to be synchronised.
• a method 600 is shown where a transfer of ownership of an asset is recorded.
• the method is preferably conducted by the platform processor 504.
• a creation request was preferably received to associate the asset with the first owner.
• a set of transactions associated with the asset and a set of transactions associated with first owner are also created at the same time if they are not already created.
• a transaction is submitted to the blockchain that is associated with both the asset and first owner sets of transactions. An example of such a transaction can be seen in Figure 7 as the first transaction 702.
• a request to update the ownership of an asset is received 602.
• the request is preferably generated by either the first owner of the asset, or the second owner.
• the request comprises data to identify the asset and information such that both the first and second owners have consented to the ownership transfer.
• an ownership update transaction is generated which comprises information indicative of the asset, the first owner, and the second owner.
• the ownership update transaction belongs to a set of transactions associated with the asset 740, a set of transactions associated with the first owner 742, and a set of transactions associated with the second owner 748.
• the data indicative of the asset is used to associate the ownership update transaction with set of transactions associated with the asset 740. This applies similarly to the data relating to the first and second owners and their respective sets of transactions 742, 748.
• the ownership update transaction is submitted 606 to the blockchain.
• example first and second ownership update transactions 702, 712 are shown.
• the asset is first recorded as owned by the first owner (as shown by the first ownership update transactions 702 being in both the asset set 740 and first owner set 742) and then transferred (as shown by the second ownership update transaction being all of the asset 740, first owner 742, and second owner’s 748 set of transactions).
• the first ownership update transaction 702 represents the asset (or the set of transactions associated with the asset) being created on the blockchain. It can be seen that said transaction 702 is present in both the sets of transactions associated with the asset 740 and the first owner 742. Thus both of the sets of transactions are updated together in one atomic transaction.
• both the set of transactions associated with the asset and the set of transactions associated first owner are created upon submission of the first ownership update transaction 702.
• second update ownership transaction 712 represents the ownership of the asset being transferred from the first owner to the second owner.
• This transaction 712 comprises data to indicate which owner is losing ownership and which owner is gaining ownership (optionally, this can also be done in percentages if for example the first owner wanted to transfer 50% of the ownership to the second owner).
• the transactions 702, 712 are atomic such that all of the sets of transactions representing each asset and owner 740, 742, 748 are updated at the same time.
• an indication that it has been successfully mined into a block is received. This indicates, as mentioned above, the transaction is now immutably included into the set of transactions associated with the asset and any other users, owners, or clients involved with the event. With this indication, an off-chain representation of this event is updated to confirm that the event has been successfully recorded onto the blockchain and that the event is immutably associated with the appropriate sets of transactions.
• the on-chain representation cannot be tampered with without it not correlating to the on-chain representation (which will be immutable).
• Figure 6B shows a method 610 where an event occurs between a user and an asset. This interaction could be the user using the asset.
• a request to record an event associated with the asset and the user is received 612.
• the asset event request 612 comprises data to identify the associated asset and the associated user.
• the asset user event request preferably further comprises data relating to the event. For example, if the event is the user using the asset for 30 minutes, then the asset event request further comprises data to indicate that the asset was used for 30 minutes.
• an asset user event transaction is generated 614 that comprises data indicative of the asset and of the user.
• the asset event transaction is generated 614 based on the received asset event request.
• the asset user event transaction belongs to the set of transactions associated with the asset 740 and the set of transactions associated with the user 744.
• the data indicative of the asset is preferably used to associate the transaction with set of transactions associated with the asset 740. This applies similarly to the data relating to the first user and the set of transactions associated with the first user 744.
• the asset user event transaction is submitted 616 to the blockchain.
• asset user event transactions 704, 706, 708, 710, 714, 716, 718, 720, 722 are shown.
• the asset is being used by the first and second users as evidenced by these asset user event transactions belonging to either both the set of transactions associated with the asset 740 and the set of transactions associated with the first user 744 or the set of transactions associated with the asset 740 and the set of transactions associated with the second user 746.
• these asset user event transactions further comprise information about the event.
• a method 620 is shown relating to processing an event interaction request. This method 620 may be seen as an abstracted version of the methods 600, 610 described in Figures 6A and 6B.
• an event interaction request is received 622.
• the event interaction request comprises information to identify the asset being interacted with, which owners or users are interacting with the asset, and the type of interaction (which could be, as discussed above in the examples provided in Figures 6A and 6B, using the asset or transferring ownership of the asset).
• data indicative of the owners or users (herein, optionally described as “clients”) associated with the event is obtained 628.
• the clients associated with the event are identified based on the received event interaction request and the set of transactions associated with each client is identified. Additionally or alternatively, the clients associated with the event are identified based on where the request has been sent from.
• the data indicative of the client associated with the event is or comprises a reference to a set of transactions associated with the clients.
• the reference is a reference to a transaction and/or transaction outpoint (where a transaction outpoint is a transaction id and an output index) of the appropriate set of transactions.
• the reference to the set of transactions associated with the client is a transaction outpoint of a latest transaction in the set of transactions associated with the appropriate client.
• the data indicative of the clients associated with the event is already present in the event interaction request. Additionally or alternatively, where the request comprises one or more event stream identifiers, the clients associated with the event are determined based on the one or more event stream identifier.
• a “latest transaction” or “latest transaction in a set of transactions” preferably refers to the transaction immediately preceding the transaction currently being generated and/or submitted.
• latest transaction refers to the transaction representing the event preceding the current event being represented on-chain.
• a reference to the set of transactions associated with the asset is similarly obtained as with the clients.
• the event interaction transaction comprises data indicative of which clients are involved with the event and data indicative of the event.
• the event interaction transaction comprises data indicative of which clients are involved with the event such that the event interaction transaction belongs to, or is associated with, each set of transactions associated with the clients which are involved with the event.
• the event interaction transaction is submitted 626 to the blockchain.
• the set of transactions are defined such that there is a spending relationship between at least a subset of the transactions in each set. More preferably, as each of the events have an associated order/time in which they occurred, the spending relationship between the transactions associated with each event is constructed such that a transaction 800a representing an earlier (in time) event comprises an output 804a that a transaction 800b representing the next event spends on one of its inputs 802b.
• a set of transactions can be seen as a chain of transactions, each representing an event.
• these inputs 802a, b and outputs 804a, b that define the spending relationship in the set of transactions are spending “dust”.
• a dust output is associated with a (digital asset) value that is below a defined limit for a transaction or having a defined minimum value.
• this chain of inputs/outputs in the transactions is advantageous and key for maintaining an immutable sequential record of all transactions as they occur for an ordered, append-only event log (and in particular for an Event Stream as described below). This is because, although by posting transactions to the blockchain all blockchain transactions would be time-stamped and remain in a particular order once they are confirmed on or added to the blockchain, this does not guarantee preservation of their sequential order. This is because transactions might be mined into blocks at different times and/or the transactions are in a different order even within the same block.
• the use of dust outputs that are spent by the first input of the next transaction in the sequence advantageously ensures that the order of the transaction is chronologically tracked and a tamper-proof record of both the events themselves and the sequential ordering of the events is created. This is because once mined into a block, the payment of dust from a previous transaction to a next one in the sequence ensures that, in alignment with Bitcoin protocol rules, the sequence of embedded data carrier elements, called payloads and discussed below, cannot be reordered, and no insertions or deletions may occur, which could change it without it being immediately obvious that the event stream has been compromised.
• a double spend prevention mechanism inherent to the Bitcoin protocol ensures that the movement of cryptocurrency (e.g.
• the set of transactions is also additionally or alternatively defined by a second reference type.
• This second reference type may be stored on an output of one of the transactions and it may refer to a preceding transaction in the set of transactions.
• a reference that doesn’t involve spending any outputs avoids reaching the ancestor limit of the blockchain.
• this second, non-spending reference is used between subsets of transactions that do have a spending relationship between them.
• the further reference is either a transaction id of a transaction in a previous chain of dust that also relates to the same set of transactions (i.e. the client, user, asset, or owner set of transactions) or the further reference is the set of outpoints that one of the transactions in a previous chain of dust (of the same set of transactions) spent. Further details on such references are discussed in UK Patent Application No. 2102314.8 (filed in the name of nChain Holdings Limited on 18 February 2021). These references are described as Changeout and Change-in references/transactions in said UK Patent Application.
• the set of transactions is additionally or alternatively defined by a third reference type.
• This reference type preferably refers to the event and/or transaction immediately preceding it.
• This reference comprises or is a hash of a part of the preceding event and/or transaction.
• the reference is a hash of the event data or data section of the preceding transaction. This hash provides tamper resistance to the event stream and/or set of transactions.
• this third reference type is a hash of the event data stored on the previous transaction, any modification of previous event data would also modify the hash and thus any attempt to modify data in the past would be detected by a different hash in any future different transactions. Further details on such references are discussed in the same abovementioned UK Patent Application No. 2102314.8 (filed in the name of nChain Holdings Limited on 18 February 2021). These references are described as the third backward reference with reference to Figure 6A in said UK Patent Application.
• the first transaction which as discussed above, optionally comprises information to identify what the set of transactions is associated with, does not spend a transaction from a previous event, as there will be no previous events. Similarly, the final transaction in the set of transactions is not spent by any other transactions as there are no further events to spend it.
• Each event transaction preferably comprises a payload 806a, b.
• the payload as described above, comprises the OP_RETURN code to make it unspendable and allow the transaction to store data.
• the event transactions 800a, b further comprise funding inputs 808a, b and change outputs 810a, b.
• the total value of the funding input(s) is selected to cover the transaction fee (sometimes called the miner’s fee) to help ensure miners will pick up the transaction and include it in a block.
• a funding service may provide one or more input(s) to ensure the total value is the input(s) is sufficient.
• the transaction fee is dynamic and will depend on the load of the network.
• the transaction fee can be measured in satoshis (or whatever coin/token the blockchain system uses) per byte (where a satoshi is one hundred millionth of a single Bitcoin). Therefore, if the payload is large, the fee will also need to be large and the funding input(s) will be adjusted accordingly.
• the total fee(s) paid are controlled by the values of both the IITXO referenced in the input and the IITXO on the output.
• the change left over from covering the transaction fee is optionally sent back to the same computing device managing, creating, and submitting these transactions to the blockchain.
• the funding inputs and change resulting from said funding inputs operates as a float and managed by said funding service.
• the chain of dust construction provides backward references between transactions such that a party with access to the blockchain can traverse these any sets of transactions forwards or backwards.
• this traversal can occur without any information other than what is present on the blockchain.
• Traversal forwards from a given transaction is conducted by determining which output index will be spent by the next transaction (the zero-th output for example in Figures 8 and 9).
• the systems and method consistently use the same output index for all sets of transactions, or at least that the output index can be determined prior to traversal.
• the outpoint to be spent is constructed by taking the given transaction’s id and the index.
• the blockchain is searched to locate the transactions that spends this outpoint in one of its inputs. The process is repeated until a final transaction is located, the outpoint cannot be located and therefore the traversal has located the latest event transaction, and/or the traverser has reached the transaction they were looking for.
• An outpoint is obtained from a determined input (the zero-th input for example in Figures 8 and 9).
• the previous transaction to traverse to will have the transaction id of the outpoint.
• the blockchain is then searched for a transaction with that id. The process is then repeated until the start of the set of transactions is reached and/or the traverser has reached the transaction they were looking for.
• the relevant outpoint in the chain of dust for adding new transactions/events to the set of transactions is usually an outpoint of the latest transaction in the set of transactions.
• the device generating the transaction for the new event will be the same device that generated the previous event transaction and so will have the outpoint already stored from this.
• the chain of dust is traversed to the latest transaction, then the transaction id and the index of the dust output are used to generate the relevant outpoint.
• FIG. 9 an embodiment is shown of how transactions are constructed and/or defined such that they belong or are associated with multiple sets of transactions.
• three sets of transactions L, M, and N are shown with one multi-set transaction 902 that is comprised in (or associated with) all three sets of transactions L, M, N.
• Three sets are provided by way of example only. A person skilled in the art will appreciate that different numbers of sets of transactions could be used also with only minor modification of the data structure presented.
• Three chains of dust are shown labelled A, B, and C and where, except for the multi-set transaction 902, the zeroth input (labelled 0) is the dust input and the zeroth output (labelled 0) is the dust output as described with reference to Figure 8.
• the first output (labelled 1) of the transactions (except for the multi-set transaction 902) comprises the payload.
• Funding inputs and outputs can also be seen labelled with “float” in and “change” out. A skilled person will appreciate that the order of these inputs and outputs are by way of example only, other orders may be used.
• the multi-set transaction 902 is shown as being a part of all of the three chains of dust A, B, C and as such said transaction 902 is considered part of (or associated with) each set of transactions L, M, N.
• the multi-set transaction 902 can also be described as an “atomic transaction” or a “rendezvous transaction”.
• the first set of transactions L is associated with the asset
• the second set of transactions M is associated with the first owner
• the third set of transactions N is associated with the second owner.
• the multi-set transaction 902 here in this example is the same as the ownership update transaction 712 as described above.
• the asset ownership transaction then can be seen to comprise data indicative of the asset, data indicative of the first owner, and data indicative of the second owner. This data may be comprised in the payload, or alternatively this data is comprised in the spending relationships of the ownership update transaction i.e. given the ownership update transaction is spending an output from the set of transactions associated with each of the asset, first owner, and second owner.
• the atomic or rendezvous blockchain transactions are transactions across a plurality of M sets of transactions, where each set of transactions is associated with an owner, user, asset, or other.
• the atomic transaction involves constructing multiple dust chains, each respective to a given set of transactions among the plurality M as the first inputs.
• the atomic transaction comprises:
• n M inputs, each input associated with a respective set of transactions among the plurality, each nth input spending a dust output associated with the previous transaction TXn-1 of the respective set of transactions,
• a respective unspent transaction output (UTXOn_dust) being an nth dust output for the atomic transaction TXn associated with the respective set of transactions
• the dust inputs and outputs are used to prevent reordering of entries in the log, prevent after-the-fact of insertion/deletion, forks, i.e. alternative timelines, etc. leveraging the blockchain network’s security, immutability, and double-spend prevention.
• This chain of dust formed by the nth input/output pair on a series of data carrier transactions collectively secure a respective single set of transactions (or preferably, respective single event stream ESn).
• the transactions generated 604, 614, 624 and submitted 606, 616, 626 in the embodiments as described with reference to Figures 6A-6C are of the above described “rendezvous transaction” form as described with reference to Figure 9.
• the blockchain is not a IITXO based system (could be an account-based system such as what is used with Ethereum), alternative ways to associate transactions atomically/synchronously may also be used.
• a smart contract on the Ethereum blockchain with permission to spend from a wallet associated with an asset and any other clients may be established such that, when a client or clients interact(s) with the asset, a transaction is created such that it spends from a first address associated with the asset to a second address associated with the asset and similarly for any client(s) interacting with the asset.
• a single transaction is generated that spends asset of the asset and client(s) spending in a single transaction or another atomic mechanism may also be used.
• wallet addresses are optionally deterministically determined.
• the wallets are generated according to Bl P-32 or Bl P-44 or other appropriate hierarchical deterministic method.
• the set of transactions associated with, for example, the asset can be determined by determining a list of possible wallet addresses, and then scanning the blockchain for any transactions that send to or from any of the determined possible wallet addresses.
• This hierarchical deterministic wallet arrangement could also be used with the IITXO model.
• this arrangement could introduce further privacy to a client’s associated set of transactions as it would be harder to determine that it is the same entity sending as is receiving since the public keys and signatures are different for different keys.
• Event Streams ES preferably being specific to a smart contract SC, and representing the states of the smart contract SC (thus, each of the asset, owner(s), and user(s) are all tracked with a smart contract).
• An example mechanism for implementing an event stream in a blockchain is set out in UK patent application number 2002285.1 filed on 19th February 2020 by nChain Holdings Limited.
• An event stream provides a log of the exact sequence of events executed in order and is implemented on the blockchain.
• the event stream ES that pertains to the smart contract SC may be obtained directly from the blockchain, or this may be obtained from an off-chain log or database that replicates the event stream on the blockchain.
• a platform processor or other device
• each client among a plurality may be associated with an account or identifier which may be used to identify a particular smart contract SC that is associated with the respective client.
• one smart contract updates multiple different event streams where each event stream still represents a different asset, user, owner, or client.
• the event stream relates to a state machine, and represents a machine-readable contract or smart contract that is implemented as a finite state machine in the blockchain.
• a Finite state Machine (FSM) is a well-known mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in response to some external inputs - the change from one state to another is called a transition.
• An FSM may be defined by a list of its states, its initial state, and the conditions for each transition.
• the IITXO set can be thought of as a state machine, with a given output's spent state being a function of previous inputs to the transaction (the machine).
• the request can be considered as a request to alter a current state of a smart contract, implemented as an event stream ES in the blockchain.
• the event stream may represent sequential inputs that are applied to a smart contract that is implemented using an FSM, DFA etc.
• an event stream and its set of transactions associated with the blockchain offers guarantees relating to immutability of events and immutability of event sequencing. Once written, any attempt to tamper with the event stream in any of the following ways is either prevented or made evident:
• An example usage of the methods and systems described herein are to track ownership and usage of a pay-per-use non-fungible good, product, or service.
• the asset is a music track or song in the context of a pay-per-listen music streaming model.
• the music track of this example is equivalent to the asset of the aspects described herein.
• an asset interaction request is provided to the platform processor.
• the platform processor then undertakes the method 610 as described in Figure 6B and submits a transaction to the blockchain that represents this listening event.
• the transaction optionally comprises the number of times the song was listened to.
• the transaction belongs to the set of transactions associated with the music track and to the set of transactions associated with the listener. An effect of this transaction is to represent that this specific listener has listened to this specific song - and this information is present in both the sets of transactions associated with the song and the user.
• the ownership of the music track can be changed using the method 600 as described with reference to Figure 6A.
• a transaction that is associated with the set of transactions associated with the asset, first owner, and second owner are generated and submitted to the blockchain.
• the set of transactions associated with the music track comprises a transaction comprising data which is able to identify the song uniquely.
• the data to identify the song is a digital fingerprint.
• the methods and systems described herein being used in this example enable a prospective purchaser of the rights to the music track can see the revenue history from since the song has been tracked using the blockchain. This enables the potential purchaser to fairly assess the value of the music track.
• the listener/user has full listen records so that they can verify their billing history.
• a song owner can be sure of the revenue generated by the song.
• any one or more of the preceding aspects related asset interaction tracking and/or sets of transactions may be used with a platform processor as described here.
• the platform processor is configured to receive asset interaction information and to provide data services 1502, compute services 1504, and/or commerce services 1506 access through which is provided by the API 1508.
• the data service 1502 aspects are provided for storage of event data.
• the present aspect may be Platform as a Service (PaaS) and Software as a Service (SaaS) offering that advantageously enables rapid delivery of useful real-world business and technical applications, such as management of software controlled technical systems or smart contracts, using a blockchain network such as the BSV blockchain.
• the platform service has a platform processor 1500 that provides an API 1508, via which the services may be accessed by one or more clients.
• Platform Services 1500 as shown in this Figure 10 are made up of three families of services and is aimed at allowing users and organisations to easily and securely make use of the advantages offered by the unique properties of a blockchain, without actually implementing any blockchain based software, knowledge, or libraries at the client end. These services are: • Data Services 1502 that aim to simplify the usage of the chain as a commodity data ledger. The Data Services preferably use the data structures and methods provided herein for implementing data writing to and reading from the blockchain.
• Compute Services 1504 that aim to provide a generalised compute framework backed by a digital asset such as Bitcoin SV.
• Requests may be received via or using the HTTPS protocol from a client at the API, as the API is implemented as a web service.
• the requested services are then implemented by the one or more service modules or processing resources 1502 - 1506 using underlying software 1510, such underlying software 1510 being associated with the blockchain, i.e. to implement resources, libraries and/or key-management wallet implementations for creating, processing and submitting transactions associated with the blockchain.
• underlying software 1510 such as resources, libraries and/or key-management wallet implementations for creating, processing and submitting transactions associated with the blockchain.
• transactions can be submitted to the blockchain network 1512 (instead of the client implementing any such functionality or transaction libraries).
• the client may or can implement a digital wallet or the like associated with cryptocurrency or some other digital asset, but this is not essential as the platform service 1500 may also be able to provide and manage the digital asset for the client.
• Figure 11 provides a more granular schematic view of the plurality of services associated with a blockchain, and which can be implemented by the platform 1600 that is associated with an API via which any one or more of the offered services can be accessed.
• the data services 1602 may include a data writer 1602a and a data reader service 1602b.
• the data writer service 1602a enables clients to write data into the blockchain in a simple, secure and optimised manner.
• the data reader service 1602b enables the clients to send queries, which returns data that is stored in the blockchain. This may be using filtered streams in which the client may pre-define the type of data that they wish to read from the blockchain on an ad hoc or periodic basis, i.e. within a certain timeframe, or those associated with a set of related or unrelated events or documents that are processed in the blockchain 1610.
• the data archive feature allows access to logs of previous transaction for a specified event or contract.
• the compute services 1606 of the platform 1600 includes an application 1606a and framework 1606b associated with smart contracts, which in some embodiments may be represented as a state machine in the blockchain 1610.
• the compute services 1606 interacts with the data services 1602 as data will need to be input and results provided to a client for any such computation.
• Commerce services 1604 are responsible for provision of enterprise-class capabilities via enterprise wallets 1604a for transacting over the blockchain 1610, based on best-in-class security practices and technologies.
• enterprise wallets may implement functionality to enable blockchain transaction processing when more than one person, user, or account may need to sign off on a transaction meeting a defined criterion, i.e. associated with cryptocurrency of a large value above a certain predefined limit.
• An enterprise wallet may also include functionality to implement a threshold number and/or type of signatures to move large amounts of digital assets such as cryptocurrency or tokens representing another resource. The movement of these assets can then be represented on the blockchain following processing based on the criteria applied by such enterprise wallet implementation.
• the SPV services 1608 are applications that require information from the blockchain but do not include direct links to it, as they do not run a miner node. Such SPV service 1608 allows a lightweight client to verify that a transaction is included in a blockchain, without downloading the entire blockchain 1610.
• the computing device 2600 may be used to implement any of the systems or methods illustrated and described above.
• the computing device 2600 may be configured to be used as one or more components in the previously described system 500 of Figures 5.
• the computing device 2600 may be configured to be a client entity that is associated with a given user; the client entity making database requests and/or submissions to the platform processor.
• the computing device 2600 may be configured to be a delegated user. The delegated user, upon reception of their delegated authorisation token may make data requests and/or submissions to the platform processor.
• computing device 2600 may be a portable computing device, a personal computer, or any electronic computing device.
• the computing device 2600 may include one or more processors with one or more levels of cache memory and a memory controller (collectively labelled 2602) that can be configured to communicate with a storage subsystem 2606 that includes main memory 2608 and persistent storage 2610.
• the main memory 2608 can include dynamic random-access memory (DRAM) 2618 and read-only memory (ROM) 2620 as shown.
• DRAM dynamic random-access memory
• ROM read-only memory
• the storage subsystem 2606 and the cache memory 2602 and may be used for storage of information, such as details associated with transactions and blocks as described in the present disclosure.
• the processor(s) 2602 may be utilized to provide the steps or functionality of any embodiment as described in the present disclosure.
• the processor(s) 2602 can also communicate with one or more user interface input devices 2612, one or more user interface output devices 2614, and a network interface subsystem 2616.
• a bus subsystem 2604 may provide a mechanism for enabling the various components and subsystems of computing device 2600 to communicate with each other as intended. Although the bus subsystem 2604 is shown schematically as a single bus, alternative embodiments of the bus subsystem may utilise multiple buses.
• the network interface subsystem 2616 may provide an interface to other computing devices and networks.
• the network interface subsystem 2616 may serve as an interface for receiving data from, and transmitting data to, other systems from the computing device 2600.
• the network interface subsystem 2616 may enable a data technician to connect the device to a network such that the data technician may be able to transmit data to the device and receive data from the device while in a remote location, such as a data centre.
• the user interface input devices 2612 may include one or more user input devices such as a keyboard; pointing devices such as an integrated mouse, trackball, touchpad, or graphics tablet; a scanner; a barcode scanner; a touch screen incorporated into the display; audio input devices such as voice recognition systems, microphones; and other types of input devices.
• user input devices such as a keyboard; pointing devices such as an integrated mouse, trackball, touchpad, or graphics tablet; a scanner; a barcode scanner; a touch screen incorporated into the display; audio input devices such as voice recognition systems, microphones; and other types of input devices.
• input device is intended to include all possible types of devices and mechanisms for inputting information to the computing device 2600.
• the one or more user interface output devices 2614 may include a display subsystem, a printer, or non-visual displays such as audio output devices, etc.
• the display subsystem may be a cathode ray tube (CRT), a flat-panel device such as a liquid crystal display (LCD), light emitting diode (LED) display, or a projection or other display device.
• CTR cathode ray tube
• LCD liquid crystal display
• LED light emitting diode
• output device is intended to include all possible types of devices and mechanisms for outputting information from the computing device 2600.
• the one or more user interface output devices 2614 may be used, for example, to present user interfaces to facilitate user interaction with applications performing processes described and variations therein, when such interaction may be appropriate.
• the storage subsystem 2606 may provide a computer-readable storage medium for storing the basic programming and data constructs that may provide the functionality of at least one embodiment of the present disclosure.
• the applications programs, code modules, instructions
• the storage subsystem 2606 may additionally provide a repository for storing data used in accordance with the present disclosure.
• the main memory 2608 and cache memory 2602 can provide volatile storage for program and data.
• the persistent storage 2610 can provide persistent (non-volatile) storage for program and data and may include flash memory, one or more solid state drives, one or more magnetic hard disk drives, one or more floppy disk drives with associated removable media, one or more optical drives (e.g. CD-ROM or DVD or Blue-Ray) drive with associated removable media, and other like storage media.
• Such program and data can include programs for carrying out the steps of one or more embodiments as described in the present disclosure as well as data associated with transactions and blocks as described in the present disclosure.
• the computing device 2600 may be of various types, including a portable computer device, tablet computer, a workstation, or any other device described below. Additionally, the computing device 2600 may include another device that may be connected to the computing device 2600 through one or more ports (e.g., USB, a headphone jack, Lightning connector, etc.). The device that may be connected to the computing device 2600 may include a plurality of ports configured to accept fibre-optic connectors. Accordingly, this device may be configured to convert optical signals to electrical signals that may be transmitted through the port connecting the device to the computing device 2600 for processing. Due to the everchanging nature of computers and networks, the description of the computing device 2600 depicted in Figure 13 is intended only as a specific example for purposes of illustrating the preferred embodiment of the device. Many other configurations having more or fewer components than the system depicted in Figure 12 are possible.
• the various methods described above may be implemented by a computer program.
• the computer program may include computer code arranged to instruct a computer to perform the functions of one or more of the various methods described above.
• the computer program and/or the code for performing such methods may be provided to an apparatus, such as a computer, on one or more computer readable media or, more generally, a computer program product.
• the computer readable media may be transitory or non- transitory.
• the one or more computer readable media could be, for example, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, or a propagation medium for data transmission, for example for downloading the code over the Internet.
• the one or more computer readable media could take the form of one or more physical computer readable media such as semiconductor or solid-state memory, magnetic tape, a removable computer diskette, a random-access memory (RAM), a read-only memory (ROM), a rigid magnetic disc, and an optical disk, such as a CD-ROM, CD-R/W or DVD.
• physical computer readable media such as semiconductor or solid-state memory, magnetic tape, a removable computer diskette, a random-access memory (RAM), a read-only memory (ROM), a rigid magnetic disc, and an optical disk, such as a CD-ROM, CD-R/W or DVD.
• modules, components and other features described herein can be implemented as discrete components or integrated in the functionality of hardware components such as ASICS, FPGAs, DSPs or similar devices.
• a “hardware component” or “hardware module” is a tangible (e.g., non-transitory) physical component (e.g., a set of one or more processors) capable of performing certain operations and may be configured or arranged in a certain physical manner.
• a hardware component may include dedicated circuitry or logic that is permanently configured to perform certain operations.
• a hardware component may be or include a special-purpose processor, such as a field programmable gate array (FPGA) or an ASIC.
• FPGA field programmable gate array
• a hardware component may also include programmable logic or circuitry that is temporarily configured by software to perform certain operations.
• hardware component or “hardware module” should be understood to encompass a tangible entity that may be physically constructed, permanently configured (e.g., hardwired), or temporarily configured (e.g., programmed) to operate in a certain manner or to perform certain operations described herein.
• modules and components can be implemented as firmware or functional circuitry within hardware devices. Further, the modules and components can be implemented in any combination of hardware devices and software components, or only in software (e.g., code stored or otherwise embodied in a machine-readable medium or in a transmission medium).

Landscapes

• Engineering & Computer Science (AREA)
• Computer Security & Cryptography (AREA)
• Business, Economics & Management (AREA)
• Accounting & Taxation (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• General Business, Economics & Management (AREA)
• General Physics & Mathematics (AREA)
• Theoretical Computer Science (AREA)
• Finance (AREA)
• Physics & Mathematics (AREA)
• Strategic Management (AREA)
• Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Applications Claiming Priority (2)

Publications (1)

Family

ID=72841422

Family Applications (1)

Country Status (2)

• 2020
  • 2020-09-04 GB GBGB2013929.1A patent/GB202013929D0/en not_active Ceased
• 2021
  • 2021-09-02 EP EP21772775.9A patent/EP4208833A1/de active Pending

Also Published As

Similar Documents

Legal Events