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 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: 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.

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: 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: The present disclosure relates to highly secure, high speed encryption methodologies suitable for applications such as media streaming, streamed virtual private network (VPN) services, large file transfers and the like. For example, encryption methodologies as described herein can provide stream ciphers for streaming data from, for example, a media service provider to a plurality of users. Certain configurations provide wire speed single use encryption. The methodologies as described herein are suited for use with blockchain (e.g. Bitcoin) technologies.

Abstract: A method of communicating a secret (k0, k1) on the Bitcoin blockchain is disclosed. The method comprises sending information identifying secrets selectable by the recipient and receiving a first public key (Ui) of an elliptic curve cryptography system, corresponding to a first secret (Si) selected for access by the recipient and for which a first private key (m) is accessible to the recipient. A second public key (U1-i) is received, corresponding to a second secret not selected for access by the recipient, wherein a corresponding second private key is not available to the recipient. First and second secrets encrypted by means of the respective first and second public keys (X0, X1) are sent to the recipient, wherein the first secret is accessible to the recipient by means of the first private key, the second secret is inaccessible to the recipient, and the sender is unable to distinguish between the first and second secrets.

Abstract: Techniques are provided for a computer-implemented security method implemented on one or more blockchains. The method comprises the steps of: applying a one-way function to a first secret value accessible to a first user to create a first veiled secret value; communicating the first veiled secret value from the first user to a second user; receiving a second veiled secret value from the second user, wherein the second veiled secret value is created by applying a one-way function to a second secret value accessible to the second user; and constructing a first blockchain transaction comprising the first veiled secret value and the second veiled secret value, the first blockchain transaction arranged to be unlockable to transfer control of a first resource upon provision of both the first secret value and the second secret value to the first transaction.

Abstract: A method and system are disclosed for a computing resource to oversee handling and execution of a looping process, comprising: the computing resource monitoring a state of the blockchain to cause one or more transactions to be written to a blockchain, wherein execution of the looping process comprises the computing resource managing and running a loop, the loop having an index representing a current iteration and a limit indicating a total number of iterations of the loop, wherein an iteration of the loop comprises: incrementing the index by one, and executing a code block of the loop containing an if condition then action statement; storing the cryptographic hash in a blockchain transaction and broadcasting the blockchain transaction to the blockchain network to record the execution of the iteration of the loop; and repeating the loop steps until the limit is reached.

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 system and a method for providing user related data, such as reputational information, on users of a blockchain involved in transactions is detailed. The method includes an approach for evaluating fulfilment of transactions, particularly in the context of contracts, and then providing a record of that on the blockchain through reputational information. As a result, at a late time, this reputational information can be retrieved. Similar reputational information for other transactions can be retrieved and linked to the same user, for instance based on the use of a hash of the master public key for a user. Aggregate reputational information can be computed from the pieces of reputational information retrieved.

Abstract: A method and corresponding system is presented for controlling a blockchain transaction output and/or specifying the recipient of the output. It also provides a method of controlling and/or generating an electronic communication. The unlocking script is provided in order to spend an output from a further transaction (Tx2) on the blockchain. The input of the transaction (Tx1) and/or the output of the further transaction (Tx2) may be associated with a tokenised asset represented on, or referenced via, the blockchain. The notification address may be associated with an asset or resource represented on the blockchain, or a controller of an asset or resource represented on the blockchain. The notification address may be a network address, a cryptographic key, a uniform resource locator (URI), email address or any other address or identifier which can be represented in the metadata of a transaction script and used as a destination for an electronic communication.

Abstract: A computer-implemented method and system are provided that provides functionality of a portion of source code, written in a high-level language (HILL), on a blockchain platform. The method and system comprise the steps of receiving a portion of source code as input, wherein the portion of source code is written in a high-level language, HILL; and generating an output script comprising a plurality of op_codes selected from and/or native to a blockchain scripting language such that, when executed, the output script provides, at least in part, a functionality specified in the portion of source code, the blockchain scripting language restricted from supporting recursive programming constructs.

Abstract: Embodiments provide verification methods and systems for use in respect of data-oriented blockchain applications. In contrast to conventional signature verification in blockchain protocols, embodiments disclosed herein are performed in-situ within a single transaction, using only data that is provided within that transaction. Therefore, there is no reliance upon signatures provided from other transactions, and potential exploits such as replay attacks can be prevented. In an embodiment, this can be achieved by placing the signature in the output of the transaction rather than the locking script.

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 exchange method is provided. The method may be performed on one or more blockchains, such as the Bitcoin Cash blockchain. The method comprises the steps of: communicating a first veiled secret value (H(A0)) from a first user to a second user and a second veiled secret value (H(B0) from the second user to the first user; and constructing first and second blockchain transactions (tx1, tx2) each comprising the first veiled secret value and the second veiled secret value, the transactions arranged to be unlockable to transfer control of a respective first or second resource upon provision of both the first secret value (A0) and the second secret value (B0) to the respective blockchain transaction, wherein unlocking of the first blockchain transaction causes a first secret value to be revealed to the second user, and unlocking of the second blockchain transaction causes a second secret value to be revealed to the first user.

Abstract: A computer-implemented method for participating in a blockchain-based data record distribution process which includes multiple input addresses for input nodes and multiple output addresses for output nodes. One or more input nodes of the group of input nodes perform steps of: collaborating to determine a stealth address, forming a first transaction that pools data records to be transferred to the stealth address, and transmitting the first transaction to be validated and incorporated into the blockchain. One or more output nodes of the group of output nodes perform steps of: searching the blockchain to find the first transaction, identifying the stealth address, forming a second transaction that distributes pooled data records, collaborating via a threshold signature scheme to sign the second transaction, and transmitting the second transaction to be validated and incorporated into the blockchain. The invention may be used in conjunction with any blockchain implementation.

Abstract: A method of obtaining digitally signed data is disclosed. The method comprises sending first data (e2)from at least one of a plurality of first participants to at least one second participant, wherein the first data is based on second data (e) accessible to at least one said first participant, and the second data is inaccessible to the or each said second participant. A digital signature (s1) of the first data is received from at least one said second participant, and the digital signature of the first data is processed, by a plurality of the first participants, to provide shares of a digital signature (s) of the second data, wherein the digital signature of said second data is accessible by means of a threshold number of said shares and is inaccessible to less than said threshold number of shares.

Abstract: Embodiments of the present disclosure provides protocols, methods and systems which provides advantages such as the resistance of centralisation of mining on a blockchain network, preferably a Proof-of-Work blockchain. A method in accordance with an embodiment may comprise generating a plurality of non-parallelisable challenges (or “puzzles”) and allocating one of said plurality of challenges to each miner on the network. The miner uses an inherently sequential (non-parallelisable) algorithm to find a solution to his allocated challenge. The challenges are generated by a committee of nodes, and a new set of challenges is generated for each block.