Abstract: A computer-implemented method of transmitting blockchain transactions to nodes of a blockchain network, wherein a compact transaction is a blockchain transaction comprising i) a CS at least partly written in a high-level (HL) scripting language, wherein the CS is configured to perform an operation equivalent to an expanded script (ES) written in the LL scripting language, and wherein the method comprises: obtaining a set of compact transactions; transmitting one or more of the set of compact transactions to at least one other CS-enabled node; converting one or more of the set of compact transactions to one or more respective expanded transactions, wherein said converting comprises, for a given compact transaction, replacing the CS of that compact transaction with an equivalent ES; and transmitting the one or more expanded transactions to at least one CS-disabled node.

Abstract: A computer-implemented method of transmitting compact transactions, wherein a compact transaction is a blockchain transaction comprising a compact script at least partly written in an intermediate-level scripting language, comprising: generating a first compact transaction comprising a first CS, wherein the first CS comprises a first library identifier of a first high-level reference library, the first HL reference library comprising a first set of HL functions written in a HL scripting language, each HL function being configured to perform an operation equivalent to an operation performed by a respective set of one or more LL functions, a respective function identifier of one or more of the first set of HL functions, and at least one IL function configured to call the one or more HL functions during script execution; and transmitting the first compact transaction to at least one CS-enabled node, wherein each CS-enabled node is configured to validate compact transactions.

Abstract: A computer-implemented method of generating blockchain transactions, wherein the method is performed by a first party and comprises: generating a first blockchain transaction, wherein the first blockchain transaction comprises a first compact script (CS), wherein the first CS is at least partly written in a high-level (HL) scripting language and comprises one or more HL functions, wherein when executed, each HL function is configured to perform an operation equivalent to a respective operation performed by one or more low-level (LL) functions of a LL scripting language, wherein the first CS is configured to perform an operation equivalent to a first expanded script (ES) written in the LL scripting language and comprising a plurality of LL functions, and wherein the first CS is smaller in storage size than the first ES; and making the first blockchain transaction available to one or more nodes of a blockchain network and/or a second party.

Abstract: A computer-implemented method of verifying the integrity of part of a pre-image corresponding to a hash digest generated by hashing the preimage with a SHA-based hash function, wherein the pre-image comprises a first message and a second message, and wherein the method comprises: a) receiving an iteration input vector; b) obtaining a second sequence of blocks; c) generating a final iteration output vector by performing an iteration of the SHA-based hash computation for each of the second sequence of blocks in order of a respective position in the second sequence of blocks, wherein the iteration of the SHA-based hash computation performed on a first one of the second sequence of blocks is based on the obtained iteration input vector; and d) generating a candidate hash digest based on the final iteration output vector, the candidate hash digest being for comparison with the hash digest.

Abstract: A method of enforcing a locking script to be propagated throughout a chain of blockchain transactions. The method comprises generating a primary transaction comprising a primary locking script configured to, when executed by an unlocking script of an auxiliary transaction, verify that the unlocking script comprises a message generated based on the auxiliary transaction, and verify, based on the message, that an output of the auxiliary transaction comprises an auxiliary locking script. The auxiliary locking script is configured to verify that an unlocking script of a second primary transaction comprises a message generated based on the second primary transaction, verify that the unlocking script of the second primary transaction comprises a data item comprising one or more locking scripts of the primary transaction, and verify, based on the message and the data item, that an output of the second primary transaction comprises the primary locking script.

Abstract: Methods and computing devices for consolidating tokens in a token system. The method may include receiving an instruction to consolidate two or more serialized tokens, each token having a respective serial number that includes a root identifier, a denomination code, and a leaf identifier allocated to that denomination code. The tokens are of denominations that, when summed, equate to a larger denomination. The method may include identifying a candidate root identifier and candidate leaf identifier, wherein the candidate leaf identifier is allocated to the larger denomination; determining that the candidate root identifier and the candidate leaf identifier are available for use; generating a new token having a new serial number containing the candidate root identifier, the candidate leaf identifier, and a denomination code corresponding to the larger denomination; and notifying an issuer computing device of consolidation and deactivation of the two or more serialized tokens resulting in the new token.

Abstract: Methods and devices for propagating blocks in a blockchain network. At a first mining node, while hashing a first block header of a first candidate block, the first mining node sends, to other mining nodes, a first message specifying transactions and their order in a first ordered set of transactions contained in the first candidate block. To prevent the other nodes from relying on the first mining node having validated the transactions in the candidate block, the first mining node seeds the first ordered set with one or more invalid transactions to create a poisoned ordered set, and provides an encrypted list identifying the invalid transactions. Once a proof-of-work is found for the candidate block, the first mining node provides a decryption key to decrypt the encrypted list and identify the invalid transactions. It may further provide replacement transactions for the invalid transactions.

Abstract: A method of enforcing a locking script to be propagated throughout a chain of blockchain transactions. The method comprises generating a primary transaction comprising a primary locking script configured to, when executed by an unlocking script of an auxiliary transaction, verify that the unlocking script comprises a message generated based on the auxiliary transaction, and verify, based on the message, that an output of the auxiliary transaction comprises an auxiliary locking script. The auxiliary locking script is configured to verify that an unlocking script of a second primary transaction comprises a message generated based on the second primary transaction, verify that the unlocking script of the second primary transaction comprises a data item comprising one or more locking scripts of the primary transaction, and verify, based on the message and the data item, that an output of the second primary transaction comprises the primary locking script.

Abstract: Methods and devices for compressing transaction identifiers by a first mining node in a blockchain network. The method may include building a first candidate block containing a first ordered list of transaction identifiers; receiving, from a second mining node, data defining a second ordered list of transaction identifiers in a second candidate block being mined by the second mining node; determining that at least one of the transaction identifiers in the first ordered list is also in the second ordered list; generating an append message containing data defining the first ordered list of transaction identifiers, wherein the data specifies said at least one transaction identifier in the first ordered list of transaction identifiers by including an index position of said at least one transaction identifier in the second ordered list of transaction identifiers; and transmitting the append message to the second mining node.

Abstract: A computer-implemented method of verifying the integrity of part of a pre-image corresponding to a hash digest generated by hashing the preimage with a SHA-based hash function, wherein the pre-image comprises a first message and a second message, and wherein the method comprises: a) receiving an iteration input vector; b) obtaining a second sequence of blocks; c) generating a final iteration output vector by performing an iteration of the SHA-based hash computation for each of the second sequence of blocks in order of a respective position in the second sequence of blocks, wherein the iteration of the SHA-based hash computation performed on a first one of the second sequence of blocks is based on the obtained iteration input vector; and d) generating a candidate hash digest based on the final iteration output vector, the candidate hash digest being for comparison with the hash digest.

Abstract: Methods and devices for propagating blocks in a blockchain network. At a first mining node, while hashing a first block header of a first candidate block, the first mining node sends, to other mining nodes, a first message specifying transactions and their order in a first ordered set of transactions contained in the first candidate block. To prevent the other nodes from relying on the first mining node having validated the transactions in the candidate block, the first mining node seeds the first ordered set with one or more invalid transactions to create a poisoned ordered set, and provides an encrypted list identifying the invalid transactions. Once a proof-of-work is found for the candidate block, the first mining node provides a decryption key to decrypt the encrypted list and identify the invalid transactions. It may further provide replacement transactions for the invalid transactions.

Abstract: Methods and devices for compressing transaction identifiers by a first mining node in a blockchain network. The method may include building a first candidate block containing a first ordered list of transaction identifiers; receiving, from a second mining node, data defining a second ordered list of transaction identifiers in a second candidate block being mined by the second mining node; determining that at least one of the transaction identifiers in the first ordered list is also in the second ordered list; generating an append message containing data defining the first ordered list of transaction identifiers, wherein the data specifies said at least one transaction identifier in the first ordered list of transaction identifiers by including an index position of said at least one transaction identifier in the second ordered list of transaction identifiers; and transmitting the append message to the second mining node.

Abstract: Methods and systems for registering identity of a mining node on a blockchain in a blockchain network. The methods may include creating a validity-check transaction having a first output controlled by the mining node and containing a miner identifier and propagating the validity-check transaction on the blockchain network. The methods may further include mining, by the mining node, a new block containing a generation transaction, wherein the generation transaction includes an information field that contains the miner identifier and a reference to the validity-check transaction. Another node may validate identity by receiving the miner identifier and the reference to the validity-check transaction, retrieving the validity-check transaction to confirm it contains the miner identifier, and determining that the first output is an unspent transaction output.

Abstract: Methods and devices for resolving a collision in short transaction identifiers in a blockchain network. The method may include receiving a set of short transaction identifiers from a sending node. The receiving node locates a corresponding full transaction identifier for each short transaction identifier in a mempool. For at least one short transaction identifier, the receiver identifies a collision. It then sends a message to the sending node requesting resolution of the collision regarding the at least one short transaction identifier, and receives collision resolution data from the sending node to enable identification of a valid corresponding full transaction identifier for the at least one short transaction identifier. The receiver may send intermediate Merkle tree hashes with its request for resolution, and the collision resolution data may include information identifying which of the hashes is incorrect.

Abstract: Methods and devices for propagating blocks in a blockchain network. At a mining node, while hashing a first block header of a first candidate block, the mining node sends, to other mining nodes, a first message specifying transactions and their order in a first ordered set of transactions contained in the first candidate block. The mining also receives a second message specifying transactions and their order in a second ordered set of transactions contained in a second candidate block being mined by a second mining node. If the mining node succeeds in mining the candidate block it notifies other mining nodes by providing them with a coinbase transaction, hash value, and timestamp. If another mining node is successful, then the mining node receives information from the other mining node from which, in conjunction with the second message, it can assemble the second candidate block and validate it.

Abstract: In a first aspect, the present disclosure proposes computer implemented methods, devices, and systems for implementing a channel service for messages or transactions that are associated with a blockchain, the channel service being provided for one or more clients. The method comprising providing a given client access to one or more functions that enable direct communication between the given client and another entity, the one or more functions include (i) channel functions or procedures pertaining to one or more channels for transmission of data; and/or (ii) message functions or procedures pertaining to the data being transmitted using the one or more channels. In a second aspect, the present disclosure proposes computer implemented methods, devices, and systems for implementing addressing for a channel service, such as the channel service in the first aspect. Communication using a channel associated with the channel service is initiated based on the addressing keys pertaining to the communicating entities.

Abstract: Methods and devices for propagating blocks in a blockchain network. At a mining node, while hashing a first block header of a first candidate block, the mining node sends, to other mining nodes, a first message specifying transactions and their order in a first ordered set of transactions contained in the first candidate block. The mining also receives a second message specifying transactions and their order in a second ordered set of transactions contained in a second candidate block being mined by a second mining node. If the mining node succeeds in mining the candidate block it notifies other mining nodes by providing them with a coinbase transaction, hash value, and timestamp. If another mining node is successful, then the mining node receives information from the other mining node from which, in conjunction with the second message, it can assemble the second candidate block and validate it.

Abstract: Methods and system of recording work history of a mining node on a blockchain in a blockchain network. The methods may include mining a first block containing a registration generation transaction that includes, within a registration information field, a miner identifier for the mining node; and mining two or more additional blocks in an order, each additional block containing a generation transaction that includes an information field containing the miner identifier, a reference to the generation transaction of the preceding additional block in the order, wherein the registration generation transaction is a first block in the order. Work history may be verified by tracing the recorded work history and validating the miner identifier. Recorded work history may serve as the basis for a reputation score for the miner, which reflects contributed work evidenced by the proof-of-work secured work history.

Abstract: A computer-implemented method of verifying the integrity of part of a pre-image corresponding to a hash digest generated by hashing the preimage with a SHA-based hash function, wherein the pre-image comprises a first message and a second message, and wherein the method comprises: a) receiving an iteration input vector; b) obtaining a second sequence of blocks; c) generating a final iteration output vector by performing an iteration of the SHA-based hash computation for each of the second sequence of blocks in order of a respective position in the second sequence of blocks, wherein the iteration of the SHA-based hash computation performed on a first one of the second sequence of blocks is based on the obtained iteration input vector; and d) generating a candidate hash digest based on the final iteration output vector, the candidate hash digest being for comparison with the hash digest.

Abstract: Methods and system of recording work history of a mining node on a blockchain in a blockchain network. The methods may include mining a first block containing a registration generation transaction that includes, within a registration information field, a miner identifier for the mining node; and mining two or more additional blocks in an order, each additional block containing a generation transaction that includes an information field containing the miner identifier, a reference to the generation transaction of the preceding additional block in the order, wherein the registration generation transaction is a first block in the order. Work history may be verified by tracing the recorded work history and validating the miner identifier. Recorded work history may serve as the basis for a reputation score for the miner, which reflects contributed work evidenced by the proof-of-work secured work history.