Abstract: A computer-implemented method for granting permission to a requestor to join a first network. 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. Each bridging node is also a respective node of a blockchain network. The method is performed by a registration authority and comprises generating a first blockchain transaction. The first blockchain transaction comprises an input comprising a signature linked to a first public key of the registration authority. The first blockchain transaction also comprises a first output comprising a first certificate, the first certificate comprising an identifier assigned to the requestor. The method further comprises transmitting the first blockchain transaction to the blockchain network for inclusion in the blockchain.

Abstract: In one aspect, the present disclosure proposes methods, devices, systems, and data structures for implementing an ordered, append-only data logging system. In particular a method comprises creating a transaction of a first type comprising an input associated with a transaction output from a latest transaction in the set of transactions. Then creating a transaction of a second type. Finally submitting both the transaction of the second type and the transaction of the first type to the blockchain.

Abstract: This disclosure relates to use of a blockchain in implementing, controlling and/or automating a task or process. An embodiment of the disclosure may comprise the steps of: providing a blockchain transaction comprising a redeem script for an output, wherein the redeem script comprises: i) a plurality of input parameters, wherein each input parameter is uniquely associated with a potential state of at least one data source, which value is determined by a sensor and supplied to an unlocking script of a further transaction arranged to spend the output; and wherein one of the plurality of input parameters which is a target output parameter; ii) logic arranged is based on a calculation performed on the plurality of the input parameters provided by an unlocking script to provide an interim result. And each transaction output attempt has a different parameter comparing a target output parameter against the interim result.

Abstract: Systems and computer-implemented methods for freezing or unfreezing digital assets on a blockchain. A freeze administration service may send a signed freeze request to mining nodes, which maintain two blacklists of digital asset identifiers: a pending blacklist and a consensus blacklist. The digital asset identifiers may be transaction outpoints in some cases. If accepted by the mining node, the transaction outpoints in the freeze request are added to the pending blacklist, which causes rejection of any transactions using those outpoints, but does not cause rejection of any new blocks that include transactions using those outpoints. If a consensus threshold of acceptances is reached based on hash power, the request becomes an order and the outpoints are added to the consensus blacklist, which causes rejection of any transaction or block containing a transaction using those outpoints.

Abstract: There is provided mechanisms for managing data in a blockchain network. In one embodiment, there is provided a computer implemented method performed at a headers client and comprising the following steps. Receiving a plurality of block headers from at least one external source, external to the headers client, the block headers each referring to a block in a blockchain. Storing the received plurality of block headers in a storage module. Analysing the plurality of block headers by validating the proof-of work for the plurality of received headers. Determining a best chain of block headers from the analysed plurality of block headers and storing the best chain at the storage module. The best chain can be a chain of blocks from genesis, which is a first block in the blockchain, to a current best block, which is a latest block in the blockchain. The best block may have the highest cumulative proof-of-work.

Abstract: A computer-implemented method of validating a blockchain transaction is disclosed. The method comprises requesting at least one UTXO referenced by at least one respective input of the transaction from a member node of at least one shard comprising at least one UTXO, obtaining validity data of at least one UTXO from at least one node, and performing a validation check on at least one input using the validity data.

Abstract: A computer implemented method and system is described which uses blockchain technology as a storage system for data acquired from a digital twin. The blockchain can be used to generate an immutable transaction history of data produced by the digital twin. In the case of an error, failure, incident, or accident, parties of interest can then access and analyse an immutable set of data. The blockchain network can also execute a digital smart contract based on the data received from a digital twin. The invention may be used in conjunction with the Bitcoin blockchain or another blockchain protocol.

Abstract: A computer-implemented method and system is provided which enables interaction between a device and an asset transfer platform. The interaction can only occur if a permit data structure allows it to happen.

Abstract: The invention provides a system for searching a blockchain (e.g. Bitcoin) for data/content stored in one or more blockchain transactions, and accessing that data/content. It may be used in conjunction with a protocol for searching the blockchain. An embodiment of the invention can be arranged to enable a user to search for, access, view, write and/or retrieve a portion of data provided in at least one blockchain transaction (Tx), and also arranged to identify the at least one transaction (Tx) based on a transaction index (TXindex) comprising a transaction ID and a public key associated with the transaction (Tx). The system may comprise a search facility which is either provided within the blockchain search system; or arranged to interface and/or communicate with the blockchain search system. It may also comprise at least one cryptocurrency wallet.

Abstract: A method comprising, by a client device: identifying one or more target transactions, recorded on a blockchain, that contain operating system software stored in a payload of the one or more target transactions, the operating system software comprising at least part of an operating system, at least including some executable code of the operating system; accessing the operating system software from the payload of the one or more target transactions as stored on the blockchain; and running, on the client device, the operating system software as accessed from the one or more target transactions, the running comprising executing the executable code of the operating system.

Abstract: The present disclosure proposes methods, devices and systems for validating a permit. The method of the first aspect comprises the steps of receiving a request comprising a first permit identifier, wherein the first permit identifier identifies a first permit, and obtaining a first permit data based on the first permit identifier wherein the first permit data comprises data indicative of at least one permission and wherein the at least one permission provides an indication of one or more actions a holder of the first permit can take and/or what the holder of the first permit is allowed to do, wherein the request is a request to validate an expression associated with at least one permission of the first permit and the request comprises data indicative of the expression.

Abstract: This invention relates to a computer-implemented method for enabling zero-knowledge proof or verification of a statement (S) in which a prover proves to a verifier that a statement is true while keeping a witness (W) to the statement a secret. The method includes sending to the verifier a statement (S) represented by an arithmetic circuit configured to implement a function circuit and determine whether a function circuit output (h) and an elliptic curve point (P), the function circuit input (s) to a wire of the function circuit is equal to the corresponding elliptic curve point multiplier (s); individual wire commitments and a batched commitment for wires of the circuit; a function circuit output (h); proving key (PrK) to enable the verifier to determine that the circuit is satisfied and calculate the elliptic curve point (P) to validate the statement, determin that the prover holds the witness (w) to the statement.

Abstract: The invention relates to distributed ledger technologies such as consensus-based blockchains. Computer-implemented methods for a self-replicating smart contract with termination condition are described. The invention is implemented using a blockchain network. A first transaction including a first script is validated by a node in the blockchain network including a third script, and a second set of field values of a second transaction, wherein the second set of field values includes a copy of the second script causing to obtain the second transaction. The second transaction includes a second script, validated by a node upon determining that a termination condition is unfulfilled, at least obtaining the third script from the first set of field values, and determining that the copy of the second script matches the third script. The first transaction is validated as a result of execution of the first script and the second script.

Abstract: The present disclosure relates to a computer implemented method for verifying a blockchain stored representation of a dataset. The method comprises the steps of obtaining a dataset reference to an on-chain dataset, the on-chain dataset being stored on the blockchain and comprising data carrying transactions, wherein each data carrying transaction comprises data indicative of an event stored in an off-chain dataset. The method includes traversing the on-chain dataset and for each data carrying transaction in the on-chain dataset: determining that the data indicative of an event in the off-chain data set is associated with an event in the off-chain dataset, and verifying that the on-chain dataset and the off-chain dataset correspond to each other.

Abstract: There is provided a computer implemented method. The method provides a generation of a proof of existence data structures. The method comprising: (i) receiving a request comprising a data reveal path, the data reveal path referencing a node of interest within an input hierarchical data structure (ii) obtaining the input hierarchical data structure comprising an input root node and a plurality of input nodes, wherein each of the input nodes within the input hierarchical data structure have an associated value, and (iii) generating an output hierarchical data structure based on the data reveal path and the input hierarchical data structure, wherein the output hierarchical data structure comprises a plurality of output nodes. There is also provided a method for verification of the proof of existence.

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: A method of proving that a secret committed in a commitment is a discrete logarithm of a public element of a finite group of data elements, comprising: obtaining a first vector used to generate the commitment, the first vector comprising n components, wherein one of the n components of the first vector is at a position which corresponds to the secret; generating a second vector comprising n components, wherein a component of the second vector, at a predetermined position corresponding to the position in the first vector, is set to zero; generating a further commitment to the second vector; transmitting the further commitment to a verifying device; receiving a random challenge from the verifying device; generating a response using the first vector, the second vector and the random challenge; and transmitting the response to the verifying device to prove that the secret is the discrete logarithm of the public element.

Abstract: A method is provided by which payments for assets are recorded using blockchain transactions, and verified based on immutable logs associated with the transactions.

Abstract: The present disclosure proposes methods, devices and systems for synchronising a plurality of event streams using an atomic blockchain transaction, the transaction having multiple inputs, each spending a dust output of a previous transaction for a respective event stream among the plurality, each input having an unspent dust output and a data payload.

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.