Abstract: At least one proof transaction for recording on a blockchain comprises at least an s-part for an Elliptic Curve Digital Signature Algorithm, ECDSA, signature. The s-part is computed from a set of signature components, each provided by a participant of a signing subset of a set of keyshare participants. Each of keyshare participant holds an ephemeral keyshare of an unknown ephemeral key, and each of the signing components is provided by the participant of the signing subset based on their ephemeral keyshare. The at least one proof transaction indicates an r-challenge of at least one challenge transaction, and a node of a blockchain network applies signature verification to: (i) the s-part of the at least one proof transaction, and (ii) one of: (iia) an r-part of the r-challenge, (iib) an r-part of the at least one proof transaction, and in that event checks that that r-part satisfies the r-challenge.

Abstract: A method of generating a blockchain transaction, wherein each second party is associated with a public key, each public key is associated with a index, and wherein the method comprises: generating a first transaction comprising a locking script comprising a plurality of sub-scripts, each sub-script being associated with a respective index and comprising a expected hash value of the public key associated with the index associated with that sub-script, and wherein the locking script is configured to require a first unlocking script to comprise a target index, a target public key, and a target signature, and execute the sub-script associated with the target index, wherein each sub-script is configured to generate a hash of the target public key and require the generated hash value to match the respective expected hash value included in that sub-script, and verify that the target signature is a valid signature for the target public key.

Abstract: A method and system for controlling a flow execution of a generated script transaction according to a blockchain protocol are disclosed. The method comprises using a software resource to determine how a logic is to be controlled and stored as a portion of code, generate an input by a computing resource as a result of a computation, retrieve the stored portion of code, and insert, based on the input, the stored portion of code into a transaction script associated with a blockchain transaction such that, upon execution of the transaction script. Embodiments allow the generation of a more complex blockchain script, control how the script will execute when implemented on the blockchain, and control how or when an output of the transaction is unlocked.

Abstract: According to a first aspect disclosed herein there is provide a device comprising: a PUF module, and one or more outer layer components providing at least part of an unsecured channel for inputting a challenge to the PUF module and receiving back a response. Internal logic of the PUF module comprises a logging mechanism arranged to automatically log a record of the challenge and/or response in a log medium, e.g. a blockchain. According to a second aspect, there is provided a method comprising: sending a first message to be recorded on a blockchain, submitting a query to check that the first message has been recorded on the blockchain without manipulation, on condition thereof, sending a second messaging transaction to be recorded on the blockchain. The first and second aspects may be used together or independently.

Abstract: Techniques are presented for a blockchain-implemented method and system of controlling use of or access to a parking space. The method comprises generating a blockchain transaction indicative of a condition on use of, or access to, the parking space, the blockchain transaction comprising a multi-signature script requiring a plurality of signatures for completion of the blockchain transaction; providing a first subset of the plurality of signatures to the blockchain transaction to generate a partially signed signature script to partially complete the blockchain transaction; and responsive to the condition on use of or access to the parking space being satisfied, providing a second subset of the plurality of signatures to the blockchain transaction to fully complete the blockchain transaction.

Abstract: A challenge is input to a PUF device comprising a physically unclonable function, PUF. The device generates a corresponding response. A wallet application is instantiated to use a seed determined from the response, the instantiating comprising storing a transform of the seed or response in association with the wallet application. At a later time, a user supplies the wallet application with information demonstrating a right to use the seed, wherein the wallet application is configured so as in response to verify this information based on the transform as stored in association with the wallet application, and on condition that the information is thereby verified, to derive at least one child key from the seed. A blockchain transaction is then signed using the child key as derived by the wallet application in response to the verification.

Abstract: A computer-implemented method for adapting connections between nodes of 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 an adapting node, the adapting node being a node of the layered network that is connected to one or more second nodes and multiple core nodes. The method comprises, based on one or more network properties of the layered network, disabling a respective connection between the adapting node and at least one but not all of the multiple core nodes.

Abstract: This invention relates generally to blockchain implementations and is suited for, but not limited to, use with the Bitcoin blockchain. A method of using a blockchain to control a process executing on a computing resource, the method comprising: executing a loop on the computing resource, and using a state of the blockchain to influence the execution of the loop, wherein the process: is an automated voting process; or comprises a distribution or an allocation of one or more tokens to a voter, wherein each token is associated with an amount of cryptocurrency.

Abstract: A method of sharing a first common secret among a plurality of nodes for enabling secure communication for blockchain transactions. The method comprises determining, for at least one first node a plurality of second common secrets, wherein each second common secret is common to the first node and a respective second node, is determined at the first node based on a first private key of the first node and a first public key of the second node and is determined at the second node based on the first private key of the second node and the first public key of the first node. The method further comprises exchanging encrypted shares of the first common secret among the plurality of nodes to enable each of the plurality of nodes to reach a threshold number of shares of the first common secret to access the first common secret.

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: The invention relates to the fields of tokenisation, blockchain, and smart contract technologies. Provided herein are a computer-implemented method and system which use a computer-based repository to store a contract and control the visibility and/or performance of the contract. A transaction is broadcasted to a blockchain, the transaction comprising i) at least one unspent output (UTXO) and ii) metadata comprising an identifier indicative of the location where the contract is stored. The contract is then renewed or rolled on by generating a new key using data relating to a previous key associated with the contract, generating a script comprising the new key, the location of the contract and a hash of the contract, and paying an amount of currency to the script. Functionalities provided or disclosed herein enable authorised parties to view a source (or existing) contract by means of its connection with the renewed or rolled on contract.

Abstract: The invention provides a blockchain-implemented control method and corresponding system(s). The invention may control access to an internet-enabled resource such as an IoT device that is provided with computing capabilities enabling it to communicate with other computer-based resources and interact with a distributed ledger such as a blockchain. In one embodiment, the invention provides a method for controlling the use of an internet-enabled resource comprising providing a first blockchain transaction comprising at least one output which is redeemable only by provision of at least: i) a secret value selected by a user; and ii) a signature associated with a resource provider; sending use-related information to the resource; generating a second blockchain transaction requesting at least the secret value; and modifying the second blockchain transaction to include the secret value.

Abstract: A computer-implemented access method is provided. The method comprises the steps of: (i) providing a verification data item of a one-way function chain of data items; (ii) submitting, to a blockchain (such as the Bitcoin blockchain), an access blockchain transaction comprising a data item of the chain; (iii) applying the one-way function to the data item to provide an output; (iv) comparing the output of step (iii) to the verification item to provide an outcome; and (v) based on the outcome of step (iv): (a) allocating the output as a further verification data item for verifying a further data item of the chain; and (b) granting access to a resource associated with the data item.

Abstract: Computer-implemented systems and methods are detailed for establishing information on states of a machine-executable contract on a blockchain, for instance in the context of unspent transaction outputs (UTXOs) and the determination of states within deterministic finite automaton (DFA) implementations of contracts. The states are determined using agent public keys, each public key having metadata for information of interest associated with codes or tags. Each of the agents provides a respective public key into a multi-signature redeem script that generates a locking script, with a hash to which a scriptPubkey is designated. ScriptPubKey values of each script may be used to provide keys for use in constructing an external database and mapping the keys from the scriptPubKey values. Upon searching the blockchain, the database is used to determine if the information of interest is present in UTXOs. A match from the search indicates, in a definitive manner, the state.

Abstract: The invention provides methods and systems which enable additional functionality to be inserted into blockchain scripts with ease and in an effective and manner. According to one embodiment, the invention provides a blockchain-implemented method comprising the steps of arranging a plurality or selection of scripting language primitives to provide, upon execution, the functionality of a high-level scripting language primitive, wherein the scripting language is associated with a blockchain protocol; inserting the plurality of scripting language primitives at least once into a script; and inserting the script into blockchain transaction (Tx). The high-level scripting language primitive may perform, for example, an arithmetic operation such as multiplication or division. The scripting language primitives may be called op_codes, words, or commands, and are native to the scripting language. The scripting language may be Script, and the blockchain protocol may be a version of the Bitcoin protocol.

Abstract: A computer-implemented method of implementing a hash function (HF) using blockchain transactions, wherein the method is performed by a first party and comprises: generating a first blockchain transaction; and submitting the first blockchain transaction to one or more nodes of a blockchain transaction, wherein the first blockchain transaction comprises a locking script configured to, when executed together with an unlocking script of a second blockchain transaction comprising a target data item, generate a hash result of the target data item.

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, wherein an 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 coin mixing transactions. A nonce public key for each output, generated based on 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 claim ownership.

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 token issuer issues a token evidencing that a first party passed a verification. A first blockchain transaction recorded on chain comprises an output comprising a) funds of the first party for a commercial transaction to be conducted with a second party and b) a locking script defining a condition for unlocking the funds. The locking script further comprises a data payload comprising the token. A second party verifies that the first blockchain transaction has been validated for recordal on the blockchain and that its output remains unspent, and thus in doing so verifies both that the first party has the funds available and is evidenced to have passed the verification by the token issuer. The commercial transaction is dependent on this verification, and involves a second blockchain transaction being recorded on chain, having an input pointing to the output of the first transaction and comprising a corresponding unlocking script.

Abstract: According to a first aspect of the present invention, there is provided a computer-implemented method for verifying that an identified transaction is stored in a blockchain. A blockchain uniform resource indicator (BURI) character string is obtained. The BURI character string is parsed to identify delimiter characters therein, and thereby extracting one or more Merkle proof portions and a transaction identifier portion separated by the delimiter characters, the Merkle proof portion(s) for verifying that the identified transaction belongs to an identified block. At least part of the BURI is used to obtain a Merkle root hash. The Merkle proof portion(s) is used to determine whether the transaction identifier portion is valid against the Merkle root hash, thereby verifying the identified transaction using the BURI character string, without accessing a payload of the identified block.