Abstract: The invention presents a solution in which blockchain Transactions are created to implement the functionality of a logic gate. The invention may be implemented 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 OR, AND, XOR, NOT and so on. In some examples, the instructions may be provided in a hashed form. 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 method to validate a block at a node within a network of nodes implementing a blockchain conforming to a blockchain protocol. This may be the Bitcoin protocol or an alternative. The method includes determining, serially, that each unspent transaction output referenced as an input in each of the plurality of transactions is unique and, based on that determination allocating each transaction in the plurality of transactions to one of two or more parallel processors, and verifying, in parallel, by the two or more parallel processors, that the transactions in the plurality of transactions comply with transaction-level validation criteria. The node also determines that the block meets block-level validation criteria. If the transactions comply with transaction-level validation criteria and the block complies with block-level validation criteria, the block is deemed valid and the node forwards the block to one or more peer nodes in the network.

Abstract: A specialized network (“merchant”) node to facilitate fast distribution of blockchain transactions over a network of interconnected nodes, as subset of which are merchant nodes interconnected by an overlay network. The merchant node includes a memory storing an assigned portion of a distributed mempool structured as a distributed hash table, the distributed mempool containing pending transactions awaiting confirmation. The merchant node operates by receiving a transaction, including a transaction identifier; hashing the new transaction identifier to obtain a key; determining, using the key, whether the transaction is stored in the distributed mempool or not and, if not, then storing the transaction in the distributed mempool as a pending transaction; and sending the transaction to a set of nodes other than merchant nodes using peer-to-peer connections. The invention may be used in conjunction with the Bitcoin blockchain or an alternative.

Abstract: Techniques are presented relating to security of blockchain transactions that transfer digital assets or entities from one resource to another. Techniques provide a computer-implemented method for improving the security, anonymity and/or control of a value-mixing blockchain transaction having a plurality of participating nodes, each node having a respective output address to which the transaction is to allocate value. The method includes encrypting by a node its output address using that node's public key, adding the encrypted output address to a set of output addresses for the transaction, shuffling the order of the encrypted output addresses in the set. Each participating node identifies its encrypted output address in the set, and replaces its encrypted output address with its unencrypted output address. The result is a shuffled set of output addresses that cannot be linked to a particular input. with its unencrypted output address.

Abstract: Systems and methods are disclosed for establishing information on a state of a machine-executable contract in the context of unspent transactions (UTXOs), blockchain and deterministic finite automaton implementation of contracts, and determination of states within those. Stages of a method include determining information of interest and codes or tags identifying that information, constructing metadata associated with those codes or tags, and combining the metadata with a public key for an agent associated with the information. ScriptPubKey values of each script are used to provide keys for constructing a database and mapping the keys from the scriptPubKey values, linked to the information. A derivation of script hash addresses from the scriptPubKey values is used to populate a digital wallet. A search and match algorithm is used to find UTXOs with matching script hash addresses on a blockchain. The database is populated with UTXOs that match the script hash addresses and keys to complete the combinations.

Abstract: According to a first aspect of the disclosure, there is provided a method of accessing data from one or more destination transactions stored on a blockchain, wherein the method comprises selecting one or more hyperlinks linking to the destination transaction(s). According to a second aspect of the disclosure, there is provided a request-response protocol for requesting access to data from a destination transaction.

Abstract: In one aspect, the present disclosure proposes methods, devices and systems and devices for providing a new structured data pertaining to blockchain transactions to implement a new data structure. This new data structure is provided to implement a distributed database. In another aspect, a new distributed data management system (DBMS) is provided, that can manage data associated with the new data structure. However, unlike a conventional DBMS for traditional databases, the present disclosure provides a blockchain DBMS that is configured to managed data associated with one or more blockchain transactions, said data being stored in the new data structure. In another aspect, the present disclosure provides a method for generating or providing one or more blockchain transactions for implementing one or more standard database commands that are received for accessing or manipulating a database, where the data is stored on the new data structure.

Abstract: A computer-implemented method of alerting users to on-chain events, wherein a primary user is associated with a primary user public key, and wherein the method is performed by an alerting entity and comprises: identifying one or more event transactions, wherein each event transaction comprising respective event data; generating a primary alert transaction, wherein the primary alert transaction comprises a first output locked to the primary user public key, and a second output comprising alert data, and wherein the alert data comprises a respective identifier of each identified event transaction; and transmitting the primary alert transaction to the blockchain network.

Abstract: A computer-implemented method for transferring a total data record from an input node to an output node using a blockchain. The total data record may be a total payment, in some cases, such as using Bitcoin. The output node shares public key material and the input node selects unspent transaction outputs to use in paying the total value, and determines a plurality of outputs payable to the output node in fixed denominations. The input node generates an output address for each output using the public key material and a respective random number, and mixes the inputs and outputs in one or more coin mixing transactions. A nonce public key for each output, generated based on the respective random number, is shared with the output node either separately or through the blockchain, and the output node can derive the corresponding private key for each output address, enabling it to search for and identify the outputs to which it can then claim ownership.

Abstract: Techniques are presented for the implementation of automated processes, such as device/system control, process control, distributed computing and storage, and event detecting, monitoring and/or counting mechanism. The event may be, for example, a vote, decision or selection which is made by a given entity. A counting solution is presented in which a computing resource, running simultaneously and in parallel to the 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.

Abstract: A computer-implemented method for improving the security of a data record distribution process using a blockchain having a group of input nodes and a group of output nodes, each group having a private-public key pair, but wherein the nodes only have a key share of their respective private key and no node has a full private key. Using threshold signature scheme, secret share joining, and stealth addresses, data records from the input nodes are pooled at a stealth address determined through collaborative action of the input nodes, requiring cooperative determination of their public key, a shared secret, and the stealth address. The public key is copied into the transaction. The output nodes locate the transaction and extract the public key, collaboratively verify its authenticity, and collaboratively determine the shared secret. Having done so, the output nodes may, collectively, sign a second transaction for distributing data records from the stealth address to the output addresses.

Abstract: A method for enabling a verifying party to verify an identity of a target party or device. The method comprises, in a set-up phase: storing, in a data store, a respective piece of response data for each of a set of one or more responses resulting from a setting-up party inputting a respective set of one or more challenges into a PUF module comprising a physically unclonable function, PUF, to generate the one or more responses based on the PUF; and storing an indication of the set of challenges in the data store. The indication does not comprise a value of each of the challenges in the set, but rather a master challenge from which the set of challenges is derivable by applying a derivation function to the master challenge.

Abstract: Techniques are presented to enable or facilitate the execution of a portion of source code, written in a high-level language (HLL), on a blockchain platform. The technique comprises receiving a portion of source code as input; and generating an output script comprising a plurality of op_codes. The op_codes are a subset of op_codes that are native to a functionally-restricted, blockchain scripting language. The outputted script is arranged and/or generated such that, when executed, the script provides, at least in part, the functionality specified in the source code. The blockchain scripting language is restricted such that it does not natively support complex control-flow constructs or recursion via jump-based loops or other recursive programming constructs.

Abstract: The invention presents a solution in which blockchain transactions are created to implement the functionality of a logic gate. The invention may be implemented on the Bitcoin platform or an alternative blockchain platform. The transaction includes a locking script which comprises instructions to process Boolean inputs and implement the functionality of a logic gate, such as the XOR gate. When the script is executed, the inputs will be evaluated, using computing agents, to provide an output of TRUE or FALSE, and the output will be subsequently provided to an unlocking script associated with a second transaction attempting to spend the output associated with the locking script. The second transaction is transmitted to the blockchain network for validation and, if determined to be valid (evaluated to a TRUE output), it will be written to the blockchain. Thus, the locking script of the first transaction provides the functionality.

Abstract: A first token associated with a first set of metadata and a first quantity of an asset is minted. A condition for triggering a process to duplicate the first token is determined to have been fulfilled. A second token that duplicates the first token is minted by at least causing a token minting transaction to be recorded to a peer-to-peer distributed ledger, wherein the token minting transaction associates a second set of metadata with the second token with the second set of metadata matching the first set of metadata, allocates the first quantity of the asset to the second token, and indicates that the first quantity of the asset has been transferred to the second token and that the first token is no longer valid. Aa identifier for the second token is provided, where the identifier is usable to determine that the second token is valid.

Abstract: A specialized network (“merchant”) node to facilitate fast distribution of blockchain transactions over a network of interconnected nodes, as subset of which are merchant nodes interconnected by an overlay network. The merchant node includes a memory storing an assigned portion of a distributed mempool structured as a distributed hash table, the distributed mempool containing pending transactions awaiting confirmation. The merchant node operates by receiving a transaction, including a transaction identifier; hashing the new transaction identifier to obtain a key; determining, using the key, whether the transaction is stored in the distributed mempool or not and, if not, then storing the transaction in the distributed mempool as a pending transaction; and sending the transaction to a set of nodes other than merchant nodes using peer-to-peer connections. The invention may be used in conjunction with the Bitcoin blockchain or an alternative.

Abstract: A computer-implemented method of executing blockchain transactions, wherein a first blockchain transaction comprises a first output, wherein the first output comprises a first locking script comprising a version opcode, wherein a second transaction comprises a first input that references the first output of the first transaction and comprises a first unlocking script, and wherein the method is performed by a blockchain node and comprises: executing the first locking script together with the first unlocking script, wherein said execution comprises, upon executing the version opcode, obtaining a node protocol version number of the blockchain node, and outputting the node protocol version number, wherein the node protocol version number is associated with a particular functionality that the blockchain node is configured to execute.

Abstract: Distributing first shares of a first secret value, known to a first participant, to second participants. The first shares encrypted using a private key and a public key that is elliptic curve generator point multiplied by the private key. A first threshold number of first shares being required to enable a second participant to determine the first secret value. A second share of a second secret value is received from each of the second participants. The second shares encrypted using a private key and a public key that is an elliptic curve generator point multiplied by the private key. A second threshold number of second shares being required to enable a participant other than the second participant to determine the second secret value. A third share of a third secret value formed from the second shares. A third threshold number of third shares being required to enable the third secret value to be determined.

Abstract: A computer-implemented access method is provided. The method comprises the steps of: (i) submitting, to a blockchain (such as the Bitcoin blockchain), an access blockchain transaction addressed to a derived public key derived at least in part from a secret value and a public key; (ii) generating a verification public key based at least in part on the secret value and the public key; (iii) comparing the derived public key and the verification public key; and (iv) based on the comparison of step (iii): (a) allocating the at least one of the derived and verification public key as a further public key for verifying a further derived public key; and (b) granting access to a resource associated with at least one of the secret value and the derived public key.

Abstract: Techniques are presented for cryptographic secure processing, transmission and exchange of data. A computer implemented method is presented comprising associating one or more elements of a structure with a cryptographic sub-key derived from another cryptographic key, wherein the structure is formed by elements within a hierarchical entity, and the hierarchical entity has a plurality of elements organized or associated in a hierarchical relationship; extracting or copying, from a blockchain transaction, data comprising or relating to the cryptographic sub-key associated with the one or more elements; and transmitting the extracted data to a non-blockchain based computer system associated with the hierarchical entity.