Blockchain communication and ordering

By identifying and recording multiple transactions, using verification sets to maintain transaction sequence, and using Overledger communication layer to separate application functions and blockchain protocols, the difficulty of maintaining transaction sequence in multi-blockchain environment in blockchain technology is solved, and the difficulty of maintaining transaction sequence in multi-blockchain environment is achieved Efficient security and stability ensure the correctness of transaction sequence and interoperability between blockchains.

CN118967246APending Publication Date: 2024-11-15QUANT NETWORK LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411123234.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2017-12-15
Filing Date
2018-11-28
Publication Date
2024-11-15

AI Technical Summary

Technical Problem

The difficulty in maintaining transaction sequence in a multi-blockchain environment leads to security and stability issues, especially when blockchain forks and cross-ledger transactions, it is difficult to ensure the correctness and reliability of transaction sequence.

Method used

By identifying and recording multiple transactions, using verification sets to maintain transaction sequence, ensuring the relative order of transactions on the blockchain, using Overledger communication layer to separate application functions from blockchain protocols, realizing interoperability across blockchains and data transmission, using hash pointers to store messages to ensure data integrity.

Benefits of technology

It improves the security and stability of the blockchain system, ensures the reliability and integrity of the transaction sequence, reduces the risk of fraud, and enhances the interoperability and data transmission efficiency between blockchains.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118967246A_ABST
    Figure CN118967246A_ABST
Patent Text Reader

Abstract

The invention provides a method for a block chain communication layer to provide interoperability between an application program function layer and a plurality of different block chains, and the application program function layer comprises function operation using one or more block chains in the plurality of different block chains. The method comprises the steps that the block chain communication layer receives a block chain request from the application program function layer, and the block chain request relates to a block chain operation to be executed on one or more block chains in the multiple different block chains; and according to the protocol of the one or more block chains, performing interface connection with the one or more block chains to execute the block chain operation.
Need to check novelty before this filing date? Find Prior Art

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application is a divisional application of the Chinese patent application with application number 201880077922.9. The Chinese patent application with application number 201880077922.9 is a Chinese national phase application of international application PCT / EP2018 / 082832, which claims the priority of European patent application 17425121.5 filed on December 01, 2017 and Italian patent application 102017000145294 filed on December 15, 2017, all of which are incorporated herein by reference in their entirety. Technical Field

[0002] The present disclosure relates to methods, systems, computer programs, and software development kits (SDKs) for maintaining sequential records of transactions appearing on one or more blockchains, and more particularly to methods, systems, computer programs, and software development kits related to blockchain communications. Background Art

[0003] Blockchain technology has broad application prospects, providing a way to store data safely and reliably without a central data authentication agency. Therefore, in many fields, blockchain technology has outstanding technical advantages, including, for example, improving data transparency, achieving more robust data storage without relying on specific storage entities, enhancing data security, and improving anti-fraud capabilities, and has been applied in many fields such as power distribution and peer-to-peer cloud storage.

[0004] A blockchain is a decentralized, distributed digital ledger that stores an effectively immutable record of data. It is decentralized because it does not necessarily require a central authority to add data to the blockchain or maintain the integrity of the blockchain. Data can be added to the blockchain by an entity broadcasting a "transaction" to a network of nodes participating in the blockchain, where the transaction includes the data to be added to the blockchain and cryptographic elements that conform to the blockchain protocol. In this way, each node participating in the blockchain can check the validity of the transaction and, if it passes the check, add the transaction to a new block that the node is currently participating in.

[0005] Each node can also add other new transactions that have been broadcasted to the node network to the new block that the node is currently participating in. The node will then announce its new block to the other nodes in the network, which includes the various new transactions and encrypted data that links the new block to the previous blocks in the blockchain. In this way, consecutive blocks are cryptographically linked, which can be easily detected if a block in the blockchain is changed at any time later (for example, if someone attempts to fraudulently change the data stored in the blockchain).

[0006] After a node publishes a new block, other nodes in the network can check the contents of the new block, and if the new block is accepted, they can start processing their next new block, which will again be cryptographically linked to its previous block. Therefore, it can be seen that the blockchain grows every time a new block is published and accepted, and each newly accepted block will be cryptographically linked to its previous block. This process of nodes checking the new blocks that have been published and accepting them into the blockchain is usually called a "consensus" mechanism.

[0007] It has been recognised that blockchain technology can be widely utilised and used in any situation where an effectively immutable record of data is useful. This has led to a rapid increase in the number of different blockchains currently in existence, each tailored for its own specific use case, and is expected to continue to increase as the technology gains further traction and acceptance. Summary of the invention

[0008] In a first aspect of the present disclosure, a computer-implemented method for maintaining a record of the order of transactions appearing on one or more blockchains (DLTs) is provided. The method includes: identifying a plurality of transactions, wherein each transaction in the plurality of transactions is included in any one of the one or more blockchains; and storing a record of the plurality of transactions in a data store, wherein the record indicates a relative order of the plurality of transactions.

[0009] By maintaining a record of transaction order, security and stability vulnerabilities associated with out-of-order messages can be mitigated, thereby improving the security and stability of systems that utilize one or more blockchains. Given that transaction ordering across multiple blockchains is difficult to implement and prone to security and fraud issues, this technical advantage is particularly evident when recording the order of transactions across two or more (multiple) blockchains.

[0010] Identifying the plurality of transactions may include reading content of each new block added to each of the one or more blockchains.

[0011] Identifying the plurality of transactions may also include comparing the transactions in each new block with a relevance criterion, wherein the identified plurality of transactions include transactions that meet the relevance criterion. By comparing with the relevance criterion, only relevant transactions in the data store need be identified, which may increase the speed of subsequent viewing of the data store and reduce the required data storage capacity.

[0012] Preferably, storing records of the plurality of transactions in the data store comprises storing a record of the identified transaction in the data store each time a transaction is identified in a new block, wherein the relative order of the plurality of transactions is the relative order in which each transaction in the plurality of transactions is identified.

[0013] Preferably, the record of the plurality of transactions comprises: a plurality of consecutive verification sets, wherein at least some of the plurality of consecutive verification sets comprise one or more transaction identifiers corresponding to respective one or more transactions of the plurality of transactions.

[0014] The method may also include: storing a record of the latest verification set in a plurality of consecutive verification sets on at least one of the one or more blockchains. In this way, the integrity and non-repudiation of the record may be enhanced, thereby improving the security and stability of the method.

[0015] The method may also include: checking whether the record of the previous verification set in the plurality of verification sets exists on at least one of the one or more blockchains; and if the record of the previous verification set does not exist on at least one of the one or more blockchains, replaying the record of the previous verification set to at least one of the one or more blockchains. In this way, earlier forks in the blockchain can be quickly identified while still maintaining the reliability of the recorded transaction order.

[0016] Before storing the record of the latest verification set on at least one of the one or more blockchains, the record of the previous verification set may be replayed on at least one of the one or more blockchains.

[0017] The method may also include: if the record of the previous verification set does not exist on at least one blockchain of the one or more blockchains, checking whether each transaction identified in the previous verification set exists on a corresponding blockchain of the one or more blockchains; and if one or more transactions identified in the previous verification set do not exist on the corresponding blockchain of the one or more blockchains, replaying the one or more transactions to their corresponding blockchains.

[0018] The method may also include: checking whether each transaction identified in the latest verification set exists on at least one blockchain of the one or more blockchains; and if one or more transactions identified in the latest verification set do not exist on the corresponding blockchain of the one or more blockchains, replaying the one or more transactions to their corresponding blockchains.

[0019] Prior to storing a record of a latest validation set on at least one of the one or more blockchains, one or more transactions may be replayed to their corresponding blockchains.

[0020] The record of the latest validation set may include a validation set identifier determined at least in part based on the content of the latest validation set.

[0021] The validation set identifier of the latest validation set may include: a hash of the contents of the latest validation set.

[0022] Storing a record of the latest validation set may include broadcasting a transaction to at least one of the one or more blockchains for inclusion in the at least one blockchain, wherein the broadcast transaction includes a unique identifier of the latest validation set.

[0023] The record of the plurality of transactions may include: a plurality of transaction identifiers, each transaction identifier being determined based at least in part on the content of its transaction.

[0024] The multiple transaction identifiers may include multiple hashes of the contents of the multiple transactions.

[0025] The record of multiple transactions may include the contents of at least some of the multiple transactions.

[0026] In a second aspect of the present disclosure, a system is provided, comprising: one or more processors; and A memory storing a software program. When executed by the one or more processors, the software program causes the one or more processors to perform the method according to the first aspect.

[0027] In a third aspect of the present disclosure, one or more computer programs are provided. When executed by one or more processors, the computer programs enable the one or more processors to perform the method according to the first aspect.

[0028] In a fourth aspect of the present disclosure, a software development kit (SDK) is provided, which includes a set of software development tools for developing one or more computer programs according to the third aspect.

[0029] In a fifth aspect of the present disclosure, a method for providing interoperability between an application functional layer and a plurality of different blockchains is provided, wherein the application functional layer includes functional operations utilizing one or more of the plurality of different blockchains. The method includes a blockchain communication layer: receiving a blockchain request from the application functional layer, wherein the blockchain request relates to a blockchain operation to be performed on one or more of the plurality of different blockchains; and interfacing with the one or more blockchains according to the protocol of the one or more blockchains to perform the blockchain operation. Thus, the application functional layer can be separated from the blockchain protocol, thereby enabling applications to more directly operate across blockchains and switch between blockchains, thereby more quickly mitigating any security or stability threats in a particular blockchain.

[0030] The blockchain request may include a request to read data on one or more blockchains. The request to read data from one or more blockchains may include a data identifier indicating the data to be read from the one or more blockchains.

[0031] Interfacing with the one or more blockchains may include reading the requested data on the one or more blockchains, and wherein the method further comprises the blockchain communication layer: communicating the data read from the one or more blockchains to the application functionality layer.

[0032] Blockchain requests may include requests to write data to one or more blockchains.

[0033] A request to write data may include data to be written to one or more blockchains.

[0034] The blockchain request may include a request to perform a cross-ledger transaction (XLT) between a first blockchain among the plurality of blockchains and a second blockchain among the plurality of blockchains, and wherein the request to perform the XLT includes an XLT data identifier indicating data transmitted from the first blockchain to the second blockchain via the XLT.

[0035] The communication between the blockchain communication layer and the application function layer can be performed according to the method defined by the blockchain programming interface (BPI).

[0036] In a sixth aspect of the present disclosure, a system is provided. The system comprises: one or more processors; and a memory storing a software program. When executed by the one or more processors, the software program causes the one or more processors to perform the method according to the fifth aspect.

[0037] In a seventh aspect of the present disclosure, one or more computer programs are provided. When executed by one or more processors, the computer programs enable the one or more processors to perform the method according to the fifth aspect.

[0038] In an eighth aspect of the present disclosure, a software development kit (SDK) is provided, which includes a set of software development tools for developing one or more computer programs according to the seventh aspect.

[0039] In a ninth aspect of the present disclosure, a method for performing a cross-ledger transaction (XLT) between a first blockchain and a second blockchain is provided. The method includes: identifying a proposed XLT transaction related to XLT on the first blockchain; storing a record of the proposed XLT transaction in a transaction record in a data store; identifying a ready XLT transaction on the second blockchain; storing a record of the ready XLT transaction in a transaction record in the data store, wherein the record indicates a relative order of the proposed XLT transaction and the ready XLT transaction; determining whether the proposed XLT transaction and the ready XLT transaction meet the XLT criteria; if the proposed XLT transaction and the ready XLT transaction meet the XLT criteria, broadcasting the submission XLT transaction to the first blockchain and the second blockchain to perform XLT between the first blockchain and the second blockchain, wherein the XLT criteria include a first criterion that the ready XLT transaction corresponds to the proposed XLT transaction, and a second criterion that the transaction record indicates a proposed XLT transaction before the ready XLT transaction. Therefore, even in the event of a fork on one or more blockchains, the order of transactions across two or more blockchains can be reliably maintained and understood, thereby improving the security and reliability of cross-ledger transactions and reducing the risk of fraud.

[0040] The method may also include broadcasting one or more transactions to the first blockchain and / or the second blockchain, wherein the one or more transactions include respective one or more transaction identifiers, each transaction identifier is determined at least in part based on at least a portion of the content of the transaction record, and the one or more transaction identifiers collectively indicate a proposed XLT transaction and a record of a ready XLT transaction.

[0041] The one or more transaction identifiers may include one or more hashes of at least a portion of the contents of the transaction record.

[0042] The XLT criteria may include a third criterion that the one or more transactions are included on the first blockchain and / or the second blockchain, such that one or more transaction identifiers are stored on the first blockchain and / or the second blockchain.

[0043] The record of the proposed XLT transaction may include a hash of the contents of the proposed XLT transaction, and the record of the ready XLT transaction may include a hash of the contents of the ready XLT transaction.

[0044] In a tenth aspect of the present disclosure, a system is provided. The system includes: one or more processors; and a memory storing a software program. When executed by the one or more processors, the software program causes the one or more processors to perform the method according to the ninth aspect.

[0045] In an eleventh aspect of the present disclosure, one or more computer programs are provided. When executed by one or more processors, the computer programs enable the one or more processors to perform the method according to the ninth aspect.

[0046] In a twelfth aspect of the present disclosure, a software development kit (SDK) is provided, which includes a set of software development tools for developing one or more computer programs described in the eleventh aspect.

[0047] In a thirteenth aspect of the present disclosure, a method for maintaining a record of the relative order of transactions executed on two or more blockchains is provided. In this way, the order of transactions on different blockchains can be reliably sorted, thereby improving security and reliability, especially in the case of blockchain forks and / or XLT.

[0048] In the fourteenth aspect of the present disclosure, a system is provided, comprising: one or more processors; and a memory storing a software program, wherein the software program, when executed by the one or more processors, causes the one or more processors to execute the method described in the thirteenth aspect.

[0049] In a fifteenth aspect of the present disclosure, one or more computer programs are provided. When executed by one or more processors, the computer programs cause the one or more processors to perform the method according to the thirteenth aspect.

[0050] In a sixteenth aspect of the present disclosure, a software development kit (SDK) is provided, which includes: a set of software development tools for developing one or more computer programs according to the fifteenth aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] Various aspects of the present disclosure are described, by way of example only, with reference to the following drawings, in which:

[0052] Figure 1 shows an example representation of the Overledger communication layer according to one aspect of the present disclosure;

[0053] Figure 2 Shows the use of Figure 1 An example representation of a system with the Overledger communication layer;

[0054] Figure 3 Shows the use of Figure 1 An example representation of another system of the Overledger communication layer;

[0055] Figure 4 Shows the use of Figure 3 representation of steps of an example method performed by a system;

[0056] Figure 5 Shows the use of Figure 1 An example representation of yet another system of Overledger communication layers;

[0057] Figure 6 An example representation of a fork in a blockchain is shown;

[0058] Figure 7 An example representation of a method for maintaining a record of the order of transactions appearing on one or more blockchains according to one aspect of the present disclosure is shown;

[0059] Figure 8 shows the execution on which Figure 7 Example representation of two blockchains of the approach;

[0060] Fig. 9 shows the execution on which Figure 7 Another example representation of two blockchains of the method;

[0061] Fig.10 An example representation of two blockchains on which a cross-ledger transaction is performed according to one aspect of the present disclosure is shown;

[0062] Fig.11 shows an example representation of another system according to one aspect of the present disclosure; and

[0063] Fig.12 Shown by Fig.11 An example representation of a method performed by a system. DETAILED DESCRIPTION

[0064] The inventors have recognized that as blockchain technology grows and develops, it becomes increasingly difficult for different entities to utilize blockchain securely, stably, and reliably. For example, currently, if an entity wishes to develop a new software application that uses blockchain technology, it must either launch its own new blockchain (which is extremely time-consuming and complex, requiring the establishment of an entirely new blockchain protocol) or utilize an existing blockchain technology, such as Ethereum.

[0065] The inventors have recognized that in order to utilize existing blockchain technology, an entity must develop its software application to fully comply with the protocol of the blockchain, such as using encryption techniques, transaction formats, and communication channels specified by the protocol. Therefore, it is necessary to choose which blockchain technology to use early in software development, and this technology choice may be made before the requirements and uses of the software application are fully understood.

[0066] Each blockchain has a specific protocol that was developed to meet the specific needs of that blockchain. The blockchain protocol cannot be changed without causing a hard fork of the blockchain, which means that the blockchain does not adapt well to changes in requirements. Therefore, if an entity later believes that the blockchain technology they have chosen no longer meets their needs (for example, because the selected blockchain technology has become unstable or insecure, or because the requirements of the software application have changed in a way that makes a different blockchain technology advantageous, or because a newer blockchain is superior to the originally selected but now obsolete blockchain technology), in order to begin using the alternative blockchain technology, it must modify its software to comply with the protocol of the alternative blockchain technology. In practice, this can be very difficult, if not impossible, because the software will be built on the basis of the protocol of the originally selected blockchain technology. Therefore, choosing the right blockchain technology from the outset can be very important, but due to the rapidly evolving nature of blockchain technology, this can be difficult to achieve in practice.

[0067] Additionally, due to differences between blockchain protocols, any data previously stored on one blockchain may not be directly transferable to an alternative blockchain.

[0068] In view of these long-standing difficulties that the inventors have recognized, the inventors have designed and provided in the present disclosure a technical solution that introduces a new communication layer to separate the functionality of the application from the blockchain utilized. By separating the application functionality from the various requirements of the blockchain on which the application runs, the interoperability between the application and the blockchain can be improved. As can be understood from the various aspects of the present disclosure described in more detail below, this may mean that changes in blockchain technology in the future can be responded to more efficiently and flexibly. This may help to respond to security threats (for example, if a blockchain technology is considered to have a security vulnerability, the application can switch to a more secure blockchain technology more directly), thereby improving security and reliability (because the application can more easily run across multiple blockchains, store duplicate data across blockchains, and / or transfer data between blockchains) and / or improve efficiency and speed (for example, in the case of a newer blockchain technology that improves the speed of transaction processing, the application may switch to the newer blockchain technology more directly).

[0069] In the following disclosure, the terms "blockchain", "blockchain technology" and "distributed ledger technology (DLT)" are used interchangeably. In addition, in all of the following disclosures, the term "transaction" is used in connection with blockchain. It will be understood by those skilled in the art that a "transaction" is a means of putting some form of information into a blockchain. For example, an entity can broadcast a "transaction" to be put on a blockchain, which includes the information to be put on the blockchain and any other data items required for the transaction to be accepted on the blockchain (such as a public key, signature, hash, etc.). The information to be put on the blockchain can be any kind of information (for example, a piece of data that an entity wishes to store on the blockchain for its later reference).

[0070] Figure 1 A visual example of the introduction of an "Overledger Communication Layer" 20 located between the application functional layer 30 and the DLT layer 10 is shown. The term "Overledger Communication Layer" is used in this disclosure to refer to a communication layer that separates the protocol requirements of the DLT from the functional operations (sometimes referred to as "business logic") of the applications that utilize the DLT.

[0071] exist Figure 1 In the , two DLTs - a first DLT 12 and a second DLT 14 - are shown as part of the DLT layer 10, although it should be understood that the Overledger communication layer 20 may be able to interface with any number of different DLTs, such as Ethereum, Corda, Openchain, Hyperledger, etc. Each DLT has its own specific protocol for blockchain operations, such as reading data from a blockchain, writing data to a blockchain, and / or transferring ownership of data from one entity to another entity on the same blockchain, or to a different blockchain (different blockchains may allow any one or more of the read, write and transfer operations to be performed on the blockchain, depending on the purpose the blockchain has been configured to perform).

[0072] The Overledger communication layer 20 includes different methods that can perform blockchain operations on the first DLT 12 and the second DLT 14. For example, the first DLT 12 may have a specific protocol for writing new transactions to its blockchain. The protocol defines the allowed format of each item (e.g., length and / or object type), the cryptographic techniques that must be used to generate hashes and signatures (e.g., SHA-256), and the order in which each item appears in the transaction. The protocol may also define how to read information from the blockchain, such as identifying the information stored in each transaction and each block on the blockchain, the format and order of the information, and the cryptographic techniques used to generate hashes, signatures, and proofs of work (so that they can be verified when the blockchain is read). In contrast, the second DLT 14 may have a completely different protocol that allows different blockchain operations to be performed, such as read-only operations (e.g., because it is a closed blockchain that anyone can read but only authorized entities can write to), and each block may include different information in a different order and / or using different cryptographic techniques than the first DLT 12. The Overledger communication layer 20 will include methods that enable various permitted operations to be performed on each of the first DLT 12 and the second DLT 14.

[0073] Figure 1 The application functional layer 30 represented in comprises the functional operations (sometimes referred to as “business logic”) of an application that utilizes one or more DLTs. When the application functional layer 30 of an application wishes to perform a blockchain operation, it passes the relevant information (blockchain request) to the Overledger communication layer 20 (e.g., including the data it wishes to write to the DLT, or the nature of the information it wishes to read from the DLT), which then interfaces with the relevant DLT according to the protocol of the relevant DLT to perform the blockchain operation. The Overledger communication layer 20 may then return any relevant results to the application functional layer 30. This operation may be more fully understood from the more specific examples described later in this disclosure.

[0074] Thus, various different entities may use methods performed in the Overledger communication layer 20, which may be encapsulated, for example, in a software development kit (SDK), hereinafter referred to as the Overledger SDK. It will be appreciated that the methods performed in the Overledger communication layer 20 may be encapsulated in any other suitable equivalent manner. By obtaining the Overledger SDK, developers may more directly select which DLT(s) they wish to use for a particular software application being developed, and have the methods and tools required to interact with the DLT(s) of their choice provided through the Overledger SDK.

[0075] Figure 2 An example representation of a system 200 is shown, which includes an SDK provider 210, an application developer 220, a developed application 230, a first DLT network 240 and a second DLT network 250. The SDK provider 210 may be responsible for building and maintaining the Overledger SDK, which in this example includes methods for interfacing (interacting) with at least the first DLT 12 and the second DLT 14, although it may include methods for interacting with any number of DLTs (i.e., for multiple DLTs). When an application developer 220 wishes to develop an application that utilizes the first DLT 12 and / or the second DLT 14, they may obtain the Overledger SDK from the SDK provider 210 (e.g., by downloading it from the SDK provider 210 or from any other Overledger SDK hosting entity). They may then develop an application 230 utilizing the Overledger SDK, which may then interact with the first DLT 12 and / or the second DLT 14 according to the methods defined in the Overledger SDK. In Figure 2 In FIG. 1 , the first DLT network 240 represents a network of participating nodes for the first DLT 12, and the second DLT network 250 represents a network of participating nodes for the second DLT 14. Figure 2 In the particular example shown in , the application 230 is shown as being able to interact with both the first DLT network 240 and the second DLT network 250, although it will be appreciated that the application developer may alternatively utilize the Overledger SDK to configure the application 230 to interact only with the first DLT network 240 or only with the second DLT network 250.

[0076] In one particular aspect, as part of developing the application 230, the application developer 220 may develop a programming interface to handle communications between the Overledger communication layer 20 and the application functional layer 30 of the application 230. The interface, hereinafter referred to as a Blockchain Programming Interface (BPI), is configured to help simplify the interaction between the application functional layer 30 and the Overledger communication layer 20. For example, the Overledger communication layer 20 of the application 230 may operate according to methods defined in the Overledger SDK to handle communications to and from the first DLT network 240 and / or the second DLT network 250. The application developer 220 may develop the BPI to define specific types of information that may be passed to and / or received from the Overledger communication layer 20 by the application functional layer 30 of the application 230 in a blockchain request related to a blockchain operation to be performed on one or more blocks. For example, it may provide a "write to first DLT 12" command that may specify any relevant parameters of the data to be written to the first DLT 12 (e.g., maximum length, object type, etc.) and / or a "read from second DLT 14" command that may specify any relevant data required to read information from the second DLT 14 (e.g., if data that has been written to the second DLT 14 by a particular entity needs to be read on the second DLT 14, the "read from second DLT 14" command may specify that it requires the blockchain identifier of that particular entity (e.g., its public key), by which the Overledger communication layer 20 may search the contents of the second DLT 14 for transactions that include that blockchain identifier). Thus, it can be seen that the application functionality layer 30 of the application 230 may utilize various commands provided by the BPI, thereby enabling the Overledger communication layer 20 to interface with any DLT supported by the Overledger SDK.

[0077] Thus, by virtue of the Overledger communication layer 20 operating in accordance with the Overledger SDK, the application functional layer 30 of the application 230 is decoupled from the specific DLT layer 10 protocol requirements of the first DLT 12 and the second DLT 14. To interact with the first DLT 12 and / or the second DLT 14, the application functional layer 30 need only send and receive data to the Overledger communication layer 20 in a manner defined by the BPI. Thus, if the first DLT 12 or the second DLT 14 were to change its protocol in the future, this could be handled by the Overledger communication layer 20 by making changes to the Overleger SDK. The application functional layer 30 of the application 230 could remain unchanged, in that it would still send and receive data to and from the Overledger communication layer 20 as defined in the BPI, or at most minimally changed if the DLT protocol changes such that the BPI must change in some way (e.g., if the object types that can be written to the DLT are changed, the BPI may also change, which may require the application functional layer 30 to provide data of different object types). However, it will be apparent that even in the event that changes may need to be made to the application functionality layer 30, these will be minimal changes and the core aspects of the application functionality layer 30 may remain unchanged. Likewise, the same would be true if the application developer 220 decided to start using a different DLT (e.g. because the originally chosen DLT is now unstable or has security vulnerabilities, or because a new DLT has been launched with improved speed and / or efficiency). If the Overledger SDK supports that different DLT, the application developer 220 can simply update the BPI to provide commands for interacting with that different DLT, which the application functionality layer 30 of the application 230 can then utilize. Again, it can be seen that the changes required to the application functionality layer 30 of the application 230 may be minimal or zero, as the application functionality layer 30 is not developed to interact with one specific DLT and the specific protocols required by that DLT - rather, the application functionality layer 30 is developed to perform the functional requirements of the application and utilize the BPI whenever some form of blockchain interaction is required.

[0078] The benefits of using the Overledger communication layer 20 to decouple the application functionality layer 30 from the DLT layer 10 can be further understood by considering a scenario where an application developer 220 develops a service offering for use by other “client” application developers. The service offering can be related to any type of blockchain service that other application developers may wish to use, for example, a service that enables writing specific types of information to the blockchain (described in detail later in the “Messaging Aspects” section) and / or a service that enables cross-ledger transactions (described in detail later in the “Cross-ledger Transactions Aspects” section) and / or a service that enables reading specific types of information from the DLT, etc.

[0079] Figure 3 An example system 300 is shown to illustrate a service offering that can be used by a "client" application developer. The system 300 includes an SDK provider 210 (described previously), a service solution developer 310, a client application developer 320, a client application 330, a first DLT network 240 (described previously), and a second DLT network 250 (described previously).

[0080] Figure 4 Example method steps are shown that illustrate how a service solution developer might utilize the Overledger SDK.

[0081] In step S410 , the service solution developer 310 may obtain the Overledger SDK from the SDK provider 210 (eg, by downloading it from the SDK provider 210 or from any entity hosting the Overledger SDK).

[0082] In step S420, the service solution developer 310 may develop a BPI for the service being provided and package it appropriately (e.g., in a BPI configuration file, although any other suitable alternative may be used instead). The BPI will specify functions, commands, etc. that can be used by the application function layer 30 of the client application 330 to interact with one or more DLTs, as previously described.

[0083] In step S430 , the client application developer 320 may obtain the Overledger SDK and BPI configuration files (e.g., by downloading from the service solution developer 310 or from any other suitable hosting entity).

[0084] In step S440, the client application developer 320 develops the application functionality layer 30 of its client application 330. In the event that the application functionality layer 30 needs to interact with the DLT in any way, the application functionality layer 30 can simply appropriately utilize commands or functions in the BPI to transmit blockchain requests to the Overledger communication layer 20, which blockchain requests are related to blockchain operations to be performed on one or more blockchains. Therefore, it can be seen that the Overledger SDK and BPI provided by the service solution developer 310 separate the application functionality layer 30 from the DLT layer 10. Therefore, the Overledger SDK can be regarded as performing the functions of the Overledger communication layer 20, and the BPI defines how the application functionality layer 30 interfaces with the Overledger communication layer 20 to perform specific services provided by the service solution developer.

[0085] Thus, if the client application developer 320 later decides that it wishes to change the DLT that it uses for the client application 330 (e.g., the application functionality layer 30 of the client application 330 may have initially been configured to use BPI functions and commands for interacting with the first DLT 12, but later decides to use the second DLT 14 instead), only the specific BPI functions and commands used by the application functionality layer 30 need to be changed (assuming that the Overledger SDK and the BPI support both the first DLT 12 and the second DLT 14). Similarly, if there are certain changes to the protocol of any of the DLTs supported by the Overledger SDK, the Overledger SDK can be updated, and if necessary, the service solution developer 310 can change the BPI accordingly. As a result, the client application developer need only change the specific BPI functions and commands used by the application functionality layer 30 of the client application 330 at most, without having to change any core aspects of the application functionality layer 30 of the client application.

[0086] Optionally, after the service solution developer 310 has created the BPI configuration file, it can be signed using standard public-private key encryption technology so that the client application developer 320 can verify that the BPI configuration file it obtains is valid.

[0087] The Overledger SDK can include many different functions that enable specific types of DLT interactions to occur. Two of these specific functions - the "messaging aspect" and the "cross-ledger transaction" aspect - are described in more detail below.

[0088] It will be appreciated that, although both the application functionality layer 30 and the Overledger communication layer 20 are described as "layers" as above, they may alternatively be viewed as software modules or software packages. For example, they may be two modules within the application 230 or the client application 330. Alternatively, each of them may be located within a different application and may run on a different electronic device. For example, the application functionality layer 30 may be a software module or software package running on a client electronic device, and the Overledger communication layer 20 may be a different software module or software package running on a service solution electronic device, wherein the two layers communicate in accordance with the BPI via any suitable communication interface. In addition, the Overledger communication layer 20 may be viewed as a software module or software package configured to be able to perform specific blockchain operations on any one or more different DLTs, wherein the service solution developer 310 allows the client application developer to download the Overledger communication layer 20 and use the Overledger communication layer 20 via the BPI, or remotely utilize the Overledger communication layer 20 via the BPI.

[0089] Messaging

[0090] The inventors have recognized that it may be generally useful to maintain an immutable record of information on a blockchain that is not necessarily intended to store such information. In the following, the term "message" is used, but it should be understood that this "message" covers any type of information for which a record is desired to be kept using a blockchain.

[0091] By using a blockchain to retain a record of messages, an effectively immutable record of the messages can be retained so that the contents of the messages can be verified in the future. A blockchain can accept certain types of information in the transactions contained in each block, but the types of this information are generally quite standardized. For example, other blockchains have been developed for other specific purposes, and more blockchains may be developed in the future for still further specific purposes. In the course of developing the Overledger communication layer 20, the inventors realized that it could be very useful to be able to store certain types of information on a blockchain that was not designed for that purpose. One specific example use is as part of maintaining a record of the order of transactions on one or more blockchains, as described later, although there are many other potential uses and benefits.

[0092] After realizing the potential benefits of storing messages on a blockchain that was not designed for this purpose, the inventors studied the details of transactions within existing blockchain architectures. It has been recognized that many blockchain architectures include a field within a transaction where non-essential data can be added. For example, Ethereum has a field for script bytecode, and Ripple has a "Memos" field. These fields can generally be referred to as "non-essential data fields". However, each of these fields is relatively limited in size, and therefore relatively limited in use.

[0093] The solution identified by the inventors is to use such a field to store a value that is at least partially based on the message and uniquely indicates the message (e.g., a hash or encryption of the message), and then store the message elsewhere (off-chain). The value that uniquely indicates the message can act as a pointer (e.g., a hash pointer) to the complete message stored off-chain. By storing a value that uniquely represents the message on the blockchain, the integrity of the message stored off-chain can be checked at any time by simply generating a test value based on the message stored off-chain and checking it against the value stored on the blockchain. Since the test value is generated in the same way as the value stored on the blockchain (e.g., using the same hashing method), if the test value matches the value stored on the blockchain, the message stored off-chain has integrity (i.e., has not been changed). If they do not match, the message stored off-chain has been tampered with in some way. This is because the contents of the blockchain are effectively immutable, so the values ​​stored on the blockchain cannot be changed in any way.

[0094] The skilled person will appreciate that the value of the unique indication message may be generated in any suitable manner. For example, the value may be generated by hashing the contents of the message using a hash algorithm such as SHA-2 (e.g., SHA-256, SHA-512, etc.) or SHA-3, so that the value of the unique indication message is a hash that acts as a hash pointer in the blockchain. Alternatively, the value may be generated by encrypting the contents of the message using any suitable encryption algorithm. The specific manner in which the value of the unique indication message may be generated (e.g., the integrity level provided by the algorithm, etc.) may be selected based on the requirements of the specific blockchain in which the value is to be stored and / or any specific cryptographic requirements that need to be met. For example, a transaction field in which a value is to be stored may have a specific maximum length that excludes certain hash algorithms because the hash it produces may be too long. The Overledger SDK may include a specific hash and / or encryption algorithm suitable for the DLT it supports, so that the application functional layer can simply pass the message to the Overledger communication layer 20, so that the Overledger communication layer 20 can appropriately process the message so that a record of the message is stored on the DLT. The application may then store a copy of the message somewhere else off-chain (e.g., in local storage on the device the application is running on, or in remote storage such as a remote database or cloud storage).

[0095] As mentioned previously, there are many potential uses for the messaging aspects described above. Figure 5 Describes a specific, non-limiting example use case.

[0096] Figure 5A system 500 is shown, including a service solution developer 310, a client application developer 320, a client application backend 510, a first client application 520, a second client application 530, and a first DLT network 240. The service solution developer 310 can create a BPI for a messaging service, which is used to record the BPI function of a message on one or more DLTs by using the above-mentioned messaging aspects. The client application developer 320 can then use the Overledger SDK and BPI profile of the service solution developer 310 to develop a messaging application that allows users using the program to send messages to each other securely. The first client application 520 and the second client application 530 can be installed on the electronic devices of the first user and the second user, respectively, such as the same client application running on a mobile electronic device (such as a smartphone, tablet or laptop) or on a desktop computer. The first client application 520 and the second client application 530 can be installed as software on the device or run as a web browser-based application, etc. on the electronic devices of the first user and the second user.

[0097] If the first user wishes to communicate a message to the second user, the first user may enter the message and the second user's identity (which may take any suitable form, such as the username of the second user of the client application) into the first client application 520. The application functional layer 30 of the client application may be configured to pass the message to the Overledger communication layer 20 of the first client application 520 to add the message to the first DLT 12 using the appropriate function / command in the BPI generated by the service solution developer 310. The Overledger communication layer 20 may then hash the message according to the SDK method for interacting with the first DLT 12, construct an appropriate transaction for the first DLT 12 including the hash of the message, and transmit the transaction to the first DLT network 240. Thus, the hash of the message will be included on the first DLT 12. The Overledger communication layer 20 of the first client application 520 may also optionally be configured to return a notification to the application functional layer 30 when it is determined that the transaction has been successfully added to the first DLT 12. A copy of the entire message and a hash of the message may also be transmitted to the client application backend 510 (which may be, for example, a server, database, or cloud-based storage system provided by the client application developer 320 to receive, store, and retrieve messages) For example, the hash of the message is received from the Overledger communication layer 20 by the application functional layer 30 and then transmitted along with the message to the client application backend 510. Any suitable encryption technology may optionally be used to secure the communication between the first client application 520 and the client application backend 510.

[0098] The second user may then become aware that a message has been received. This may occur in many different ways, for example the second user identifier may already be the second user's DLT public key or DLT wallet, or may have been used by the first client application 520 to obtain the second user's DLT public key or DLT wallet, and the transaction on the first DLT 12 may identify the second user's public key or DLT wallet as the recipient of the transaction. In this case, the second client application 530 may notice that the new transaction on the first DLT 12 identifies the second user (if the second client application 530 is configured to monitor the contents of each new block added to the first DLT 12 for any new transactions that identify the second user's DLT public key or DLT wallet). Alternatively, a third party service may perform this monitoring process and notify the second client application 530. The application function layer 30 of the second client application 530 may then obtain the hash of the message from the first DLT 12 using an appropriate BPI "read" function.

[0099] Once the second client application 530 has a copy of the message hash, the application functionality layer 30 may transmit it to the client application backend 510 along with some form of authentication to authenticate the second user to the client application backend 510 (e.g., using any form of authentication process that the second client application 530 and the client application backend 510 have established, or by providing a digital signature signed by the second user's DLT private key, which the client application backend 510 may check by using the public key associated with the message hash stored on the first DLT network 240). If authentication is successful, the complete message corresponding to the message hash may be returned to the second client application 530. The second client application 530 may then create a test hash by subjecting the returned message to the same hash algorithm as that used by the first client application 520 (e.g., by using an appropriate "verify message" BPI function, or in any other manner deemed appropriate by the service solution developer 310 and / or the client application developer 320), and then compare the test hash to the message hash retrieved from the first DLT 12 to verify the integrity of the returned message.

[0100] A number of benefits of this particular example process may be immediately apparent. First, the contents of the message may be securely communicated from the first user to the second user without having to implement complex and often difficult to implement reliably techniques such as encrypted email or encrypted documents that require a password that is agreed upon between the two users. Furthermore, the second user can be assured that the client application backend 510 has not tampered with the message in any way, as otherwise the test hash will not match the message hash stored on the first DLT 12. Furthermore, if at any time in the future there is some form of dispute between the first user and the second user regarding the contents of the message, the message hash stored on the first DLT 12 can be used to resolve that dispute.

[0101] The second user can also reply to the message in a similar manner.

[0102] It will be appreciated that this is only one specific example of the messaging aspect of the present disclosure, and not all examples. In addition, many alternative implementations of the above specific use case are possible. For example, alternatively, the application backend may be provided by the service solution developer 310, and the BPI may be simply configured to receive the message, and the Overledger communication layer 20 is responsible for placing the message hash on the first DLT 12, and also passing the message and the message hash to the client application backend 510. In this case, the application function layer 30 of the client application may only be related to other functions, such as the GUI and other functions provided by the client application. In addition, the application function layer 30 can utilize the functions or commands provided by the BPI to place the message hash on not only one but many DLTs, thereby providing further redundancy and backup for the message hash.

[0103] Transaction sequencing

[0104] An important requirement for reliable blockchain operation is transaction ordering.

[0105] The inventors have recognized that reliable transaction ordering is important for all types of blockchains. For example, it is understood that in various Internet and telecommunication domains and protocols, incorrectly ordered messaging can be vulnerable to security and stability attacks. For example, the ordering and synchronization of TCP / IP packets can affect the security of the system in various ways, such as messages being out of order or message sets being incomplete, resulting in the security of the system being compromised in terms of integrity or effectiveness. Therefore, the inventors have recognized that maintaining the correct transaction order within a blockchain, such as when used to carry messages in accordance with the above-mentioned messaging aspects, and when used for any other purpose, is important for achieving a secure, reliable, and fraud-proof system based on one or more DLTs.

[0106] The inventors have identified two challenges to maintaining the correct order of transactions in DLT:

[0107] 1. If a blockchain forks, one or more transactions on the short prong of the fork may be lost from the blockchain. Technicians easily understand the possibility of DLT forking and the behavioral characteristics of DLT in this case. However, it is worth noting that traditionally, when a transaction is lost due to a fork, it can be attached to the long prong of the fork by the network of nodes participating in the transaction after it has been recognized that the transaction has been lost.

[0108] Figure 6An example representation of a fork in a blockchain is shown. Transaction 1 is part of block B1, which appears on "branch 1" of the blockchain. However, due to the fork, the blockchain continues on a long branch "branch 2", so transaction 1 has actually been lost from the blockchain. Transaction 2 is part of block B3, which appears on "branch 2". Transaction 1 is later appended to the blockchain as part of block B8 on "branch 2". Therefore, transaction 1 appears later in the blockchain than transaction 2. However, if it is important that transaction 1 comes before transaction 2 (for example, they are related to consecutive messages), this may cause security or stability issues in applications using the blockchain, or may allow fraud to occur.

[0109] 2. As mentioned above, in some cases it may be desirable for an application to use two or more different DLTs. As part of this, it may sometimes be necessary to perform a cross-ledger transaction (XLT) to facilitate the movement of data (e.g., a message (as mentioned above) or another type of information stored on a DLT) from one DLT to another. However, while each blockchain may be developed to maintain an order between different blocks on the blockchain (e.g., using timestamps), it may be very difficult to reliably discern the order between transactions appearing on different blockchains because each DLT may utilize a different timestamping process and / or its clocks used for timestamping may not be synchronized. Therefore, when utilizing two or more (multiple) DLTs, determining and maintaining the order of transactions appearing on the DLTs may be very important to the security and stability of the application using the DLTs.

[0110] Figure 7 Example method steps of a process developed by the inventors for maintaining transaction order using a "validation set" are shown. Figure 8 Visual examples of two DLTs and validation sets are shown to aid understanding Figure 7 method steps.

[0111] In step S710, the first DLT 12 and the second DLT 14 are monitored to identify when a new transaction of interest is included in a block added to the first DLT 12 or the second DLT 14. The first DLT 12 and the second DLT 14 may be monitored by reading the contents of each new block as it is added to the DLT. The relevance criteria for what constitutes a transaction of interest depends on the specific implementation of this method. For example, the BPI disclosed above may be configured so that any transaction placed on the DLT by utilizing the BPI includes some specific identifier that distinguishes it from transactions placed on the DLT by any other means (e.g., by other entities rather than utilizing the BPI). The specific identifier may be, for example, a public key for the transaction, or some other type of information within the transaction. Thus, the relevance criteria may be an identifier included in the BPI such that any transaction included in the first DLT 12 or the second DLT 14 that uses the service provided by the service solution developer 310 (e.g., transactions added by the first client application 520 or the second client application 530, or indeed some service application operated by the service solution developer to place transactions on the DLT when necessary) should meet the relevance criteria and can be identified as relevant. This may be particularly useful if the first DLT 12 and / or the second DLT 14 is a general purpose DLT that can be utilized by many different entities, but the service solution developer 310 needs to identify transactions related to its service to ensure the correct ordering of those transactions, thereby safeguarding the security and stability of its service solution.

[0112] exist Figure 8 In the example, Transaction A, Transaction C, Transaction E, and Transaction O are all transactions of interest. Transactions marked with "Transaction X" are transactions of no interest.

[0113] When a new block is added to the first DLT 12 or the second DLT 14 and it is identified in step S710 that it includes relevant transactions, in step S720, a transaction identifier (e.g., a hash) for each identified transaction can be determined based at least in part on the transaction content. The identifier is then added to the latest or "ongoing" validation set. The validation set is part of the off-chain record of relevant transactions, stored in a data store, such as any suitable storage, database, data array, cloud storage, etc. The transaction identifier can act as a pointer (e.g., a hash pointer) to the relevant transactions in the DLT. Each new transaction identifier is added to the "ongoing" validation set in the order in which it is detected. In this way, the record of identified transactions indicates the relative order of the transactions, regardless of whether they have appeared in the first DLT 12 or the second DLT 14. As a result, it can be seen that by monitoring two DLTs and adding a transaction identifier to each relevant transaction once it is added to the first DLT 12 or the second DLT 14, the relative order of transactions can be recorded across one or more different DLTs. The skilled person will appreciate that any suitable data storage technology that preserves the order of related transactions may be used to store the "ongoing" validation set. Once a new related transaction has been added to the "ongoing" validation set, the process may return to step S710 to continue monitoring the first DLT 12 and the second DLT 14.

[0114] At a particular time, the process may proceed to step S730 to begin the process of storing a record (e.g., a validation set identifier) ​​of the "in-progress" validation set (e.g., based at least in part on a hash or encryption of the contents of the "in-progress" validation set) to the first DLT 12 and the second DLT 14. The particular time at which the process proceeds to step S730 depends on the implementation, and may be, for example, after a particular time has elapsed to monitor the DLT since the record of the most recent previous validation set was added to the DLT, or after a particular number of relevant transactions have been added to the "in-progress" validation set, or after a particular number of blocks have been added to the first DLT 12 or the second DLT 14 since the record of the most recent previous validation set was added to the DLT, etc.

[0115] In step S730, it is determined whether a record (e.g., hashed or encrypted) of the contents of the most recent previous validation set exists on both the first DLT 12 and the second DLT 14 (e.g., checking that there has been no fork in either DLT that resulted in the loss of the record). If the record does appear in both DLTs ( Figure 7 If the record does not appear in either DLT ( Figure 7If "No" is found in the result, the process proceeds to step S740. This check can be performed by searching the two DLTs for the record of the most recent previous validation set.

[0116] In step S740, the lost record may be replayed onto the DLT from which it was lost (essentially, the record was first placed in a transaction on the DLT - e.g., using the "messaging aspect" above - which is rebroadcast and added to the DLT). However, before replaying the lost record, it may first be determined whether any transactions identified in the most recent previous validation set are also missing from the corresponding DLT in which they should have appeared. This can be quickly determined by using the pointer properties (e.g., hash pointers) of the transaction identifiers in the most recent validation set stored in the transaction records. Any lost transactions may then be replayed onto the relevant DLT before replaying the lost record of the most recent previous validation set. Although any replayed transactions may now appear in the DLT later than the transactions that should have occurred before the lost transaction (if not lost), the validation set will still maintain a record of the correct order of transactions. Thus, the lost validation set record and any lost transactions associated with it may still be added back to the DLT without losing the correct order in which the transactions occurred. From the following Figure 8 and 9 The details of this step can be more fully understood in the discussion of .

[0117] In step S750, it is determined whether all transactions identified in the "in progress" validation set are still present in the relevant DLT (e.g., to check that they have not been lost due to a fork in one or both of the DLTs). If they are still all present in the relevant DLT ( Figure 7 If it does not appear in all of the relevant DLTs ( Figure 7 If the check is "No" in the validation set, the process proceeds to step S760. This check can be performed by means of the pointer property of the conversion identifier in the "in progress" validation set.

[0118] In step S760, transactions identified as currently lost may be replayed onto (essentially, rebroadcasted and added to) the corresponding DLT where they should have appeared. The "in-progress" validation set will still maintain a record of the correct order of transactions, although any replayed transaction may now appear in the DLT later than the transaction that would have occurred before the lost transaction (if it had not been lost). Thus, the lost transactions may still be added back to the DLT without losing the correct order in which the transactions occurred.

[0119] In step S770, a record of the "in-progress" validation set is determined based at least in part on the contents of the "in-progress" validation set (e.g., a validation set identifier such as a hash or encryption is determined based at least in part on the contents of the validation set) and added to the first DLT 12 and the second DLT 14. The record can be added to both DLTs by utilizing the techniques described in the "messaging aspect" above. Therefore, it can be seen that by using the above-mentioned "messaging aspect", a record of the contents of the "in-progress" validation set can be added to both DLTs, thereby providing an effective immutable record of the contents of the validation set. By using this effective immutable record, data integrity of the record of the related transaction can be achieved, thereby improving security and reliability. The process can then return to step S710 to continue monitoring the DLTs and begin processing the next "in-progress" validation set.

[0120] return Figure 8 , we can see the records of related transactions 840 stored in the off-chain data storage (which can be any suitable type of data storage, database, cloud storage or any other type of storage), including the (n-1)th verification set 810, the nth verification set 820 and the (n+1)th verification set 830. The (n-1)th verification set 810 includes the hash of transaction Y and the hash of transaction Z, which are earlier transactions on the first DLT 12 or the second DLT 14, and for simplicity, in Figure 8 826. The nth verification set 820 includes a hash 822' of transaction A, a hash 824' of transaction O, and a hash 826' of transaction C. Transaction A 822 and transaction C 826 appear in the first DLT 12, and transaction O 824 appears in the second DLT 14. The order in which they appear in the nth verification set 820 indicates that transaction O 824 is detected after transaction A 822, but before transaction C 826. The (n+1)th verification set 830 includes a hash 832' of transaction E, and can be considered an "in progress" verification set in this example.

[0121] It can be seen that according to the above step S770, the hash 810' of the (n-1)th verification set and the hash 820' of the nth verification set have been pre-added to the two DLTs. When the nth verification set 820 is the "in progress" verification set, it can be understood that when it comes to the above step S730, the hash 810' of the (n-1)th verification set exists in the two DLTs, so the process can proceed directly to step S750. Similarly, in step S750, transaction A 822, transaction O 824 and transaction C 826 still appear in their related DLTs, so the process can then proceed directly to step S770 to add the hash 820' of the nth verification set to the two DLTs.

[0122] As a result of this process, it can be seen that, with the help of the validation set in the record of transaction 840, an off-chain record of the order of transactions that appear in both blockchains is retained. This off-chain record indicates the relative order of the transactions to which it is associated. By also storing hash pointers of each validation set on both DLTs using the "message passing aspect" described above, a record of each validation set can be retained on the DLT, which is particularly useful in maintaining the data integrity and security of the off-chain record of the validation set and in the event of a fork in the first DLT 12 and / or the second DLT 14, as described below.

[0123] Fig. 9 Another visualization example of two DLTs and a validation set is shown to help understand Figure 7 method steps, in particular steps S730 to S760. Fig. 9 and Figure 8 Similar, but Fig. 9 Includes a representation of a fork in the first DLT 12, which resulted in records of two transactions and one validation set being lost from the first DLT 12.

[0124] exist Fig. 9 , the first DLT 12 forks before including transaction C 826. Transaction C 826, the hash 820' of the nth validation set, and transaction E 832 all appear on "branch 1" of that fork. However, in this example, it is "branch 2" of the fork that moves forward with the first DLT 12, and the contents of "branch 1" are actually lost (at least temporarily). After the hash 820' of the nth validation set is added to the DLT, processing of the (n+1)th validation set 930 begins, and it can be seen that the (n+1)th validation set 930 includes, in order, the hash 832' of transaction E and the hash 934' of transaction G. In Fig. 9 At the point P marked in Figure 7 The process proceeds to step S730, at which point the hash 820' identifying the nth validation set and transaction C 826 no longer appear in the first DLT 12 (because they both appear in "branch 1", which is the branch of the fork that has been lost). As a result, in step S740, transaction C is replayed (in Fig. 9 826, although it will be appreciated that the contents of the original transaction C 826 and the replayed transaction C 926 will be identical), then the hash 820' of the nth validation set is replayed (in Fig. 9820', although it will be appreciated that the hash 820' of the original nth validation set will be the same as the hash 920' of the replayed validation set). Subsequently, in step S750, it is determined that transaction E 832 (identified in the (n+1)th validation set 930 "in progress") is no longer present in the first DLT 12 because it is included in "branch 1". Therefore, in step S760, transaction E is replayed (in Fig. 9 826 and the replayed transaction E 832, although it will be appreciated that the contents of the original transaction E 832 and the replayed transaction E 932 will be identical). Thereafter, the hash 930' verifying the (n+1)th verification set is added to both DLTs in step S770. Thus, it can be seen that even if transaction C 826, the hash 820' of the nth verification set, and transaction E 832 are lost from the first DLT 12, they can still be added back to the first DLT 12 after transaction G 934 (which originally occurred after transaction C 826 and transaction E 832) without losing a reliable record of the true order of transactions, thereby ensuring the security and stability of the system. Therefore, while including a hash of the validation set in the DLT is optional (or, one could simply keep an off-chain record of transactions without storing any hash of the validation set in the DLT), it will be appreciated that storing a record of each validation set on the DLT does not only improve security and reliability by enabling data integrity of the off-chain validation set, but also enables forks to be quickly identified and the missing records and / or transactions to be added back to the relevant DLT.

[0125] It is understandable that although Fig. 9 Each block shown in includes only a single transaction, but in reality each block will likely include many transactions. Furthermore, while the above describes a process using two DLTs, it will be appreciated that it may be applied to a single DLT or to three or more different DLTs. Furthermore, while a "hash" of a validation set and a transaction is described above, it will be appreciated that any suitable validation set identifier determined at least in part based on the contents of the validation set and any suitable transaction identifier based at least in part on the contents of the validation set may alternatively be used.

[0126] Furthermore, although in the above process the hash of the validation set is added to both DLTs, it may alternatively be added to only one of the DLTs. Even so, it is preferred that the hash of the validation set be included on both or more DLTs on which the process is being run, since even in the event of a fork there should always be a record of at least one of the most recent previous validation sets (it is extremely unlikely that two DLTs could independently fork at the same time, causing them both to lose the hash of the most recent previous validation set). This may be useful for data integrity and, therefore, security.

[0127] Additionally, in addition to or in lieu of storing hashes of related transactions in the validation set, full copies of related transactions may be stored. However, for data storage efficiency reasons, it is preferred to store hashes of related transactions. In one example implementation, a hash of each related transaction may be stored, and full copies of the most recent related transactions (e.g., the most recent one, two, three, four transactions in the validation set) may be stored, which may be useful for replaying lost transactions. By storing only the most recent related transactions, data storage requirements may still be minimized.

[0128] Furthermore, identifying and replaying lost transactions is optional, although it is preferred to perform these steps to ensure that the DLT is as up to date as possible and that the ordering of transactions on the DLT corresponds as closely as possible to the actual ordering of transactions as identified in transaction 840.

[0129] Cross-ledger transactions

[0130] To further help understand the importance of the transaction ordering aspect described above, an example cross-ledger transaction (XLT) process that utilizes the transaction ordering aspect will now be described.

[0131] In this example, it is desirable to transfer information about a transaction that appears in the first DLT 12 to the second DLT 14. This information may be anything, such as a hashed message (as described above under "message passing aspects") or any other data. The transaction may be a transfer of information from a first owner to a second owner, or there may be no transfer of ownership at all (e.g., an entity may simply wish to store the information in a different DLT and effectively delete it from the previous DLT).

[0132] Fig.10 A visual example of two DLTs is shown, along with corresponding validation sets constituting a record of a transaction 1040 stored off-chain, in which an XLT is to be performed. Transaction S 1012 comprises information to be transferred from a first DLT 12 to a second DLT 14. The (n-1)th validation set 1010 comprises a hash 1012' of transaction S. This XLT may be performed using a two-phase commit process. The two-phase commit process should be well understood by those skilled in the art, but for the sake of completeness, it has been briefly described below. First, the proposed addition to the first DLT 12 (in Fig.101022” in the second DLT 14). This effectively locks transaction S1012 so that it cannot be used in any other transaction. The intended recipient (which in some cases may be the same entity as the current owner of the information to be transferred, as described above) may then indicate in the second DLT 14 its readiness to accept the transfer (identified by “Ready XLT(S) 1026”). Alternatively, in some DLT protocols, readiness may be indicated by replaying “Proposed XLT(S) 1022” in the second DLT 14. Once readiness has been indicated on the second DLT 14, it may be confirmed by a commit transaction added to both DLTs (in Fig.10 The cross-ledger transaction is performed by the first DLT 1032 and the second DLT 1034. As can be appreciated by the skilled person, the submission effectively removes the items of the transaction from the first DLT 12 and places them into the second DLT 14.

[0133] In order to be able to safely and securely execute an XLT before it occurs, without risk of fraud or system failure, it is necessary to ensure that the indication of readiness appears on the second DLT 14 before the proposed transaction is placed on both DLTs. Furthermore, it is preferred that the indication of readiness always follows the proposed transaction so that the two can be properly matched and authenticated. In this way, it can be ensured that the indication of readiness does not actually relate to other similar but different transactions (e.g., an XLT proposed transaction between the same parties, except for the content of a different earlier transaction on the first DLT 12). It can also be ensured that the indication of readiness does not fraudulently change certain details of the XLT.

[0134] As mentioned previously, determining the correct order of transactions on different DLTs has previously been very difficult, especially in the presence of forks in one or more DLTs. As a result, it has been difficult to execute XLT securely, directly, and reliably. However, by leveraging the transaction ordering aspects described above, it is possible to record the correct order of related transactions even in the presence of forks in one or more DLTs.

[0135] For example, transaction ordering aspects may be used to ensure that XLT criteria are met, such as a proposed XLT(S) 1022 corresponding to a ready XLT(S) 1026 (and optionally, both still appear on the first DLT 12 and the second DLT 14, respectively) and that the proposed XLT(S) 1022 precedes the ready XLT(S) (even in the event of a fork). In this regard, the commit XLT(S) 1032 transaction may be added to the DLT only after the XLT criteria are met. Optionally, the XLT criteria may also include the criterion that a hash of a verification set identifying the proposed XLT(S) 1022 and the ready XLT(S) 1026 transactions exists on one or both DLTs, which will ensure that both the proposed XLT(S) 1022 and the ready XLT(S) 1026 transactions exist in their respective DLTs. It will be appreciated that although in this example the hash 1022' of the proposed XLT(S) and the hash 1026' of the ready XLT(S) appear in the same validation set, they may instead appear in different validation sets. If the hash 1022' of the proposed XLT(S) appears in a validation set before the validation set in which the hash 1026' of the ready XLT(S) appears, the correct order may be confirmed. If the hash 1022' of the proposed XLT(S) appears in a validation set after the hash 1026' of the ready XLT(S) appears, it may be confirmed that the transaction order is wrong and therefore the XLT should not have occurred.

[0136] from Fig.10 As can be seen in FIG. 1 , the nth validation set 1020 includes a hash 1022′ of the proposed XLT(S), followed by a hash 1026′ of the ready XLT(S) (the nth validation set 1020 also includes hashes of other transactions that are considered relevant, but not related to the XLT discussed here). In practice, the entity constructing the validation set may identify many related transactions in the DLT and identify them in the validation set. Some of these related transactions may be related to each other, such as transactions related to a particular XLT, while other transactions may not be related to each other in any way, such as related to different XLTs, or any other type of DLT transaction that the entity deems to be relevant. The hash 1020′ of the nth validation set appears in both DLTs, followed by a submitted XLT(S) 1032 on the first DLT 12 and a submitted XLT(S) 1034 on the second DLT 14 (which are subsequently identified in the next (n+1)th validation set 1030).

[0137] This type of XLT can be implemented in many different ways. Fig.11An example of a particular implementation is shown, which includes a service solution developer 310, which in this particular example has developed a service application (or software package / module) 1110 for executing XLT, and has also provided BPI to a client application developer 320. Therefore, its specific XLT client application can be developed (alternatively, the service solution developer 310 can create a client application for itself, in which case the BPI may not be provided to any external developer). The first client application 1120 and the second client application 1130 are copies of the XLT client application that the first entity 1140 and the second entity 1150 have obtained from the client application developer 320, respectively. The client application in this example can effectively implement the application function layer 30, and the service application 1110 can effectively implement the Overledger communication layer 20.

[0138] Fig.12 Shows Fig.11 Shown is an example system that performs example steps of XLT.

[0139] In step S1210, the service application 1110 receives a request from the first client application 1120 to execute an XLT to transfer information items present in the first DLT 12 to the second DLT 14 to transfer ownership to the second entity 1150. It will be appreciated that the request may include any necessary information for executing the XLT as defined in the BPI.

[0140] In step S1220 , the service application 1110 may broadcast the proposed XLT transaction to the first DLT network 240 for addition to the first DLT 12 .

[0141] In step S1230, the service application 1110 may then broadcast the ready XLT transaction to the second DLT network 250 for addition to the second DLT 14. Alternatively, the service application 1110 may have communicated the intent to execute the XLT to the second client application 1130, and then only perform steps S1220 or S1230 after receiving confirmation from the second client application 1130 that the transaction should occur.

[0142] Over time, the service application 1110 performs the transaction sequencing aspects described above and stores related transaction records in the data store 1115 indicating the order of related transactions.

[0143] In step S1240, the service application 1110 may check that the proposed XLT transaction identified in the stored transaction record occurred before the corresponding ready XLT transaction, and optionally that the hash of the associated verification set has appeared in one or both DLTs.

[0144] Once the check is passed, the service application 1110 broadcasts the submit XLT transaction to the first DLT network 240 and the second DLT network 250 to be added to the first DLT and the second DLT in step S1250. Optionally, the service application 1110 may notify the first client application 1120 and / or the second client application 1130 of the successful XLT (which may be performed after the submit XLT transaction has appeared on both DLTs, or after identifying that the hash of the verification set of the submit XLT transaction has been included in one or both DLTs). In the event that the check is not passed, after a period of time, the XLT process may time out and the failure may be notified to the first client application 1120 and / or the second client application 1130.

[0145] Thus, it can be seen that by performing the above-described ordering aspects and then posting the commit transaction to the DLT only after the proposed XLT transaction and the corresponding ready XLT transactions have been validated in the correct order in the validation set, the service application 1110 can ensure secure and stable execution of XLT.

[0146] It will be appreciated that this is merely one specific, non-limiting example. Alternatively, the first client application 1120 itself may broadcast the proposed XLT transaction to the first DLT network 240, and / or the second client application 1130 itself may broadcast the ready XLT transaction to the second DLT network 250, depending on the specific BPI provided by the service solution developer 310 and / or the implementation of the client application provided by the client application developer 320. In this case, the service application 1110 may simply perform the transaction sequencing aspects described above, and then perform steps S1240 and S1250 when the proposed XLT transaction and the corresponding ready XLT transaction are identified in the relevant DLT. In addition, the XLT may only involve one entity, as it may simply transfer its information from one DLT to another without any change in ownership.

[0147] It will be appreciated that the Overledger SDK may include rules and methods for performing transaction ordering aspects and optionally also XLT aspects. In this way, the Overledger SDK provides tools by which a service solution developer 310 can implement any service application / module that utilizes transaction ordering aspects (and optionally XLT aspects) on any DLT supported by the Overledger SDK of their choice. A corresponding BPI of their choice may then be created to allow a client application developer 320 to utilize any suitable functionality of the service solution, whereby the interaction with the DLT in performing the ordering aspects may be performed by the Overledger communication layer 20 and may be decoupled from the operation of any application functional layer 30 on the client application. Thus, the client application may take advantage of the security and stability benefits provided by the transaction ordering aspects while still being decoupled from interacting directly with the DLT.

[0148] As a result, it can be seen that by providing an Overledger SDK that includes rules and methods for enforcing transaction ordering, it provides tremendous flexibility and opportunity for the technical advantages of transaction ordering to be utilized in different ways by a variety of different entities, while still separating blockchain interactions from the application functional layer 30.

[0149] It will be easily understood by those skilled in the art that various changes or modifications may be made to the above-mentioned aspects of the present disclosure without departing from the scope of the present disclosure.

[0150] although Figure 2 , 3 All interfaces shown by arrows in , 5 and 11 show direct connections between each different entity and module, but it is understood that there may be any number of intermediate entities or modules as part of these interfaces, such as communication routers, etc. In addition, each interface can carry data / communication between each entity and module according to any appropriate communication architecture and protocol.

[0151] All aspects of the present disclosure described above may be implemented by software, hardware, or a combination of software and hardware. For example, transaction ordering aspects and / or XLT aspects and / or Overledger messaging layers may be implemented by software comprising computer readable code that, when executed on one or more processors (e.g., one or more microprocessors or programmable logic devices) in any electronic device (e.g., any standard computing device, such as a server, desktop computer, or laptop computer, etc.), can perform the above functions. The software may be stored on any suitable computer readable medium, for example, a non-transitory computer readable medium, such as a read-only memory, a random access memory, a CD-ROM, a DVD, a Blu-ray, a magnetic tape, a hard drive, a solid-state drive, and an optical drive. The computer readable medium may be distributed on a computer system coupled to a network so as to store and execute computer readable instructions in a distributed manner.

Claims

1. A method for a blockchain communication layer to provide interoperability between an application functional layer and a plurality of different blockchains, wherein: The application function layer includes functional operations utilizing one or more blockchains among a plurality of different blockchains, and the method includes: The blockchain communication layer receives a blockchain request from the application function layer, wherein the blockchain request relates to a blockchain operation to be performed on one or more blockchains of the plurality of different blockchains; and Interfacing with the one or more blockchains to perform the blockchain operations according to protocols of the one or more blockchains.

2. The method according to claim 1, wherein: The blockchain request comprises a request to read data on the one or more blockchains.

3. The method according to claim 2, wherein: The request to read data from the one or more blockchains includes a data identifier indicating the data to be read from the one or more blockchains.

4. The method according to claim 2 or 3, wherein: Interfacing with the one or more blockchains includes reading the requested data on the one or more blockchains, and The method also includes: the blockchain communication layer transmitting the data read from the one or more blockchains to the application function layer.

5. A method according to any one of the preceding claims, wherein: The blockchain request comprises a request to write data to the one or more blockchains.

6. The method according to claim 5, wherein: The request to write data to the one or more blockchains includes data to be written to the one or more blockchains.

7. The method according to claim 5 or 6, further comprising: A notification is returned to the sender of the request that the data is written to the one or more blockchains.

8. A method according to any one of the preceding claims, wherein: The blockchain request includes a request to perform a cross-ledger transaction XLT between a first blockchain among the plurality of blockchains and a second blockchain among the plurality of blockchains.

9. The method according to claim 8, wherein: The request to execute the XLT includes an XLT data identifier, wherein the XLT data identifier indicates data transmitted from the first blockchain to the second blockchain via the XLT.

10. The method according to claim 8 or 9, wherein: Interfacing with the one or more blockchains includes writing data to the first blockchain and writing data to the second blockchain to execute the XLT.

11. The method according to claim 10, wherein: The data written to at least one of the first blockchain and the second blockchain is based on, but different from, the data forming part of the request to execute the XLT.

12. The method according to any one of claims 8 to 11, wherein: Interfacing with the one or more blockchains includes any one or more of the following: Writing the proposed XLT transaction to the first blockchain; Write the prepared XLT transaction to the second blockchain; Writing the submitted XLT transaction into the first blockchain; Submit the XLT transaction to the second blockchain.

13. A method according to any one of the preceding claims, wherein: Interfacing with the one or more blockchains includes writing data to two or more blockchains of the plurality of different blockchains.

14. The method according to claim 13, wherein: The data written to each of the two or more blockchains is based on, but different from, the data forming part of the blockchain request.

15. The method according to claim 13 or 14, wherein: The data written to a first blockchain of the two or more blockchains is different from the data written to a second blockchain of the two or more blockchains.

16. The method according to claim 15, wherein: The data written to the first blockchain is logically associated with the data written to the second blockchain.

17. A method according to any one of the preceding claims, wherein: The communication between the blockchain communication layer and the application function layer is performed according to the method defined by the blockchain programming interface BPI.

18. A system comprising: one or more processors; as well as A memory having stored thereon a software program, wherein when executed by the one or more processors, the software program causes the one or more processors to perform a method according to any one of the preceding claims.

19. A computer program product, comprising one or more computer programs, which, when executed by one or more processors, cause the one or more processors to perform the method according to any one of claims 1 to 17.