Abstract: Embodiments utilise Singular Value Decomposition (SVD) to provide improved techniques for generating, processing, controlling, transferring and/or implementing blockchain-based tokens and other assets. Such tokens may include, but are not limited to, non-fungible tokens (NFTs). In one possible embodiment, an SVD-based digital asset is created by applying SVD to one or more existing digital asset(s) e.g. image(s). In an alternative approach, the SVD-based digital asset can be created from an artificially constructed SVD rather than based on any existing digital asset(s). Embodiments are also provided for secure, encrypted transmission of digital assets and tokens between parties, and for improved storage and processing of such assets and tokens, in particular when storing/processing on a blockchain ledger.

Abstract: Embodiments provide a blockchain-implemented database overlay and indexing mechanism. In one embodiment, records in the database are associated via the overlay to respective unspent outputs in transaction(s) on the blockchain. Each output comprises a locking script that specifies which keys can be used to spend the output to a further transaction. When a user wishes to access a given record in the database, the further (spending) transaction is generated and sent to the blockchain network. The further transaction comprises an unlocking script that provides the required key(s) to meet the conditions of the locking script, otherwise the blockchain's consensus mechanism will not allow spending of the output and access to the record will be denied. If, however, the requirements are met then the output is spent and the access request is deemed authorized. In this way, the consensus mechanism provides an improved permission control and user authorization solution for a database.

Abstract: Embodiments of the disclosure provide technical solutions for securing, sharing validating and/or generating data resources such as, but not limited to, documents. In an example embodiment, the document is expressed or defined as a plurality of constituent segments, which are then hashed. A Merkle tree is generated that represents the document, with the segment hashes as its leaves. An authorised signatory signs the root of the tree. A redacted version of the document can then be shared, omitting one or more segments that the data controller wishes to keep secret. In order to verify the authenticity and/or integrity of the redacted document, a validator is provided with sufficient data to check the existence of the non-segment(s) in the tree and also the authorised signature that signed the root.

Abstract: A computer-implemented method of determining a state of a system using one or more blockchain transactions, wherein each blockchain transaction comprises one or more outputs, and wherein the method is performed by a first party and comprises: determining a respective status of one or more respective outputs of one or more blockchain transactions; and determining the state of the system based on the respective status of the one or more respective outputs.

Abstract: A computer-implemented of propagating blockchain messages, wherein at least one blockchain node is associated with one or more respective range of numbers and one or more respective sets of blockchain nodes, wherein each respective range of numbers is associated with a respective set of blockchain nodes, and wherein the method comprises: for at least one of a plurality of respective blockchain messages, determining a respective number based on the respective blockchain message, wherein the respective number of one or more respective blockchain messages falls within a respective one of the one or more respective ranges; and for each respective range in which the respective number of one or more respective blockchain transactions falls, making available some or all of the one or more respective blockchain messages to each blockchain node belonging to the respective set of blockchain nodes associated with the respective node.

Abstract: A computer-implemented method of generating a share of a shared private key, wherein each participant of a group of participants has a respective share of a master private key, and wherein the method is performed by a first participant of the group and comprises: generating a first share of a first shared secret, wherein each other participant of the group generates a respective share of the first shared secret; and generating a first share of a first shared private key based on a first share of the master private key and the first share of the first shared secret.

Abstract: Blockchain transactions are created to implement the functionality of a logic gate. Implementation may be on the Bitcoin platform or an alternative blockchain platform. The transaction includes a locking script which comprises instructions selected so as to implement the functionality of a logic gate such as the XOR gate. When the script is executed (because a second transaction is attempting to spend the output associated with the locking script) the inputs will be processed by the conditional instructions to provide an output of TRUE or FALSE. The second transaction is transmitted to the blockchain network for validation and, if determined to be valid, it will be written to the blockchain. Validation of the second transaction can be interpreted as a TRUE output. Thus, the locking script of the first transaction provides the functionality of the desired logic gate.

Abstract: A computer implemented data distribution method is disclosed. The method comprises sending a portion of data from a sending resource on a network to one or more groups of receiving resources, each of the one or more groups being associated with a respective multicast address. Preferably, the portion of data comprises blockchain-related data. Also disclosed is computer equipment comprising memory comprising one or more memory units and processing apparatus comprising one or more processing units, wherein the memory stores code arranged to run on the processing apparatus, the code being configured so as when on the processing apparatus to perform the method. Also disclosed is a computer program embodied on computer-readable storage and configured so as, when run on one or more processors, to perform the method.

Abstract: The invention resides in associating data with a blockchain transaction (Tx), wherein said data is represented in a tree structure, processing a path of the tree structure that includes the data; processing a digital signature of an author and/or approver of said data; and validating that at least one of: the data, the digital signature and the blockchain transaction (Tx) is a part of the tree structure. Similarly, the invention resides processing such data for recordal and subsequent validation. In one example, a web address is represented by a tree structure. The data associated with the data of at least a web page of the web address is represented in the tree structure, and at least one of the data, the processed data and/or the digital signature is associated with a blockchain transaction (Tx), which is represented in the tree structure. The data and the associated tree structure can be recorded and subsequently processed to validate the data.

Abstract: The invention resides in computer-implemented method of operating a sending and/or receive resource. The resource is configured for generating, storing, processing, accessing and/or maintaining a record of a packet of data e.g. comprising at least a portion of blockchain data e.g. a blockchain transaction, block, block header etc. From the record an allocated address is determined. The resource sends, at least in part, the record across an electronic network to the allocated address. The allocated address can be a multicast address associated with a group of receiving resources. Determination can include processing the record e.g. parsing and/or hashing the record. Processing can include parsing and/or hashing the record to determine a key, and selecting at least one address from a set of addresses using the key.

Abstract: The present disclosure provides methods and systems for distributed and/or parallel processing of data records, and in particular mining of blockchain transactions in a blockchain block, and further still for generation of a Proof-of-Work (PoW) for a blockchain block. Advantageously, embodiments allow for separation of the PoW calculation from other blockchain mining/validation tasks. Preferably, a PoW requester sends a specialist PoW provider one or more of: i) a Merkle root for a Merkle tree that represents a set of transactions ii) a control transaction (TX0) and iii) a Merkle proof which confirms that TX0 is included in the set of transactions. TX0 may provide or comprise control data that the PoW provider can use to determine whether or not performance of the PoW calculation is to be performed or completed.

Abstract: A computer-implemented method for revoking access to a first network, wherein the first network comprises a set of bridging nodes and a set of devices controllable by one or more of the set of bridging nodes, wherein each bridging node is also a respective node of a blockchain network, and wherein each bridging node and device is associated with a respective certificate granting access to the first network; the method being performed by a registration authority and comprising: obtaining an alert transaction, the alert transaction being a blockchain transaction and comprising a first output, the first output comprising an alert message identifying one or more bridging nodes and/or one or more devices; and revoking access to the first network by the identified one or more bridging nodes and/or one or more devices by revoking the respective certificate of the identified one or more bridging nodes and/or one or more devices.

Abstract: An event detecting, monitoring and/or counting mechanism is disclosed. The event may be, for example, a vote, decision or selection which is made by a given entity. A counting solution is provided in which a computing resource, running simultaneously and in parallel to a blockchain, manages a loop-based operation. The computing resource continuously monitors the state of the blockchain as well as any other off-blockchain input data or source. The execution of the loop is influenced by the state of the blockchain. Each iteration of the loop that is executed by the computing resource is recorded in a transaction that is written to the blockchain. It is stored as a hash within the transaction's metadata. If the computing resource finds a transaction which contains a hash relating to the loop it accesses the relevant portion of code.

Abstract: The invention provides a novel and advantageous method and corresponding system. The invention is implemented via a distributed electronic ledge (blockchain). This may or may not be the Bitcoin blockchain. The invention is suited for the exchange or transfer of an asset, e.g. a digital asset, such as tickets and the like (but not limited in this regard).

Abstract: A method performed in a layered network. The layered network comprises a core layer comprising one or more core nodes, one or more intermediate layers each comprising one or more intermediate layer nodes, and one or more outer layers each comprising one or more outer layer nodes. Each of the core nodes is a node of a blockchain network. One or more intermediate layer nodes are smart contracts nodes providing a smart contract service for maintaining the state of a smart contract. One or more outer layer nodes are client nodes of the smart contract service. The method included, by a smart contract node: recording a state of the smart contract in a record of the state maintained at the first smart contract node. In addition, at least a first transaction also recording the state is recorded on a blockchain of the blockchain network.

Abstract: A computer-implemented method of propagating blockchain messages, wherein a blockchain network comprises a plurality of blockchain nodes, wherein each blockchain node is associated with a respective set of blockchain nodes, wherein the method is performed by a first blockchain node and comprises: making a first blockchain message available to each blockchain node belonging to the respective set of blockchain nodes associated with the first blockchain node, wherein the respective set of blockchain nodes comprises some but not all of the plurality of blockchain nodes.

Abstract: The invention resides in a computer-implemented communication method. The method comprises a mechanism for service provisioning from a service provider to one or more devices in a plurality of devices controlled by, or associated with, a device controller. In an example embodiment, the service provider allocates a set of IPv6 addresses to the device controller. In turn, the device controller allocates or communicates one or more of the set of IPv6 addresses to at least one of the devices. The device then includes the one or more IPv6 address that it has received from the device controller in an access request to the service provider. Upon verification that the requesting device is authorised by the device controller, the service provider provides the service to the one or more addresses included in the access request.

Abstract: A computer-implemented method is disclosed. The method includes providing a blockchain transaction comprising a public key combination verification function. The blockchain transaction is configured to be redeemable to permit access to, or transfer control of, a resource by providing to the blockchain transaction an input comprising: a plurality of public keys; a gradient value (?) related to two of the plurality of public keys; and a group public key derived from a combination of the public keys and the gradient value (?). The blockchain transaction is configured to apply the public key verification function to the input to verify, upon successful redemption of the transaction, that the group public key is derived from the combination of the plurality of public keys.

Abstract: A computer-implemented method for connecting to a layered network. The layered network comprises a plurality of nodes arranged in an ordered set of layers. The ordered set of layers comprises, in order, a core layer comprising a set of core nodes, a second layer comprising a set of second nodes, and one or more outer layers each comprising a respective set of outer nodes. Each core node is connected to at least one other core node. The method is performed by a connecting node and comprises connecting to the network according to a connection protocol. The connection protocol requires that each node must connect to at least one node of a preceding layer, and each outer node must also connect to at least one core node.

Abstract: A computer-implemented method of representing a first set of data items, wherein the method is performed by a first tree generator and comprises: allocating the first set of data items into a plurality of respective subsets; for each respective subset of data items, generating a respective hash tree based on the respective subset of data items, wherein the respective hash tree comprises a respective root node; and generating a respective first hash set representing the first set of data items, wherein the first hash set comprises each of the respective root nodes.