Token Link

By using smart contracts and multi-signature technology in blockchain networks, linking and updating tokens is achieved, solving the problems of single point failure and insufficient data redundancy of centralized databases, and providing safe and reliable data storage and Access improves the functionality of the computing system and the efficiency of the commercial network.

CN111798233BActive Publication Date: 2024-11-26INTERNATIONAL BUSINESS MACHINE CORPORATION
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202010258292.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2019-04-05
Filing Date
2020-04-03
Publication Date
2024-11-26
Estimated Expiration
2040-04-03

AI Technical Summary

Technical Problem

Centralized databases have problems such as single point of failure, insufficient data redundancy, low search capabilities, lack of security and slow transaction speed, making it difficult to implement linking and automation methods of tokens in blockchain networks.

Method used

By using smart contracts and multi-signature technology in blockchain networks, linking and updating tokens is achieved, ensuring data consistency and security between different blockchain networks, and taking advantage of the immutability and decentralization of blockchains. Features that provide secure and reliable data storage and access.

Benefits of technology

Implements the automated method of token linking and updating in the blockchain network, improves the functions of the computing system, provides untampered responsibility, security, privacy and accessibility, and solves the tokens in traditional databases. The link and storage defects improve the reliability and efficiency of the commercial network.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN111798233B_ABST
    Figure CN111798233B_ABST
Patent Text Reader

Abstract

Example operations may include one or more of the following: Node A sends a signed transaction Tr to Node B A To update the token TKN on the ledger of blockchain A A Node A submits Tr signed by Node B to Blockchain A A ; Receive signed transaction Tr from node B B To create a token TKN on the ledger of blockchain B B ; Send Tr signed by node A to node B B to be submitted to blockchain B; and node A activates TKN by submitting a key value (x) signed by node A's private key to blockchain A and submitting the key value (x) to blockchain B. B To activate Tr A To update TKN A .
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates generally to a database storage system, and more particularly to the linking of tokens. Background Art

[0002] A centralized database stores and maintains data in a single database (e.g., a database server) located in one location. This location is typically a central computer, such as a desktop central processing unit (CPU), a server CPU, or a mainframe computer. Information stored in a centralized database can typically be accessed from multiple different points. For example, based on a client / server configuration, multiple users or client workstations can work on a centralized database simultaneously. A centralized database is easy to manage, maintain, and control, particularly for security purposes, because it is located in a single location. In a centralized database, data redundancy is minimized because the single storage location for all data also implies that a given set of data has only one master record.

[0003] However, centralized databases suffer from significant drawbacks. For example, they present a single point of failure. Specifically, if fault tolerance is not considered and a hardware failure (e.g., hardware, firmware, and / or software malfunction) occurs, all data in the database will be lost, and all users' work will be interrupted. Furthermore, centralized databases are highly dependent on network connectivity. As a result, slower connections increase the time required for each database access. Another disadvantage is the bottleneck that can occur when a centralized database experiences high traffic due to its single location. Furthermore, because the database maintains only a single copy of the data, centralized databases provide limited access to the data. As a result, multiple devices cannot access the same piece of data simultaneously without causing serious problems or risking overwriting already stored data. Furthermore, because database storage systems have little or no data redundancy, recovering accidentally lost data is difficult, except through manual recovery from backup storage.

[0004] Traditionally, centralized databases have been limited by low search capabilities, lack of security, and slow transaction speeds. Therefore, a blockchain-based solution is needed to overcome these significant drawbacks.

[0005] Blockchains can store user assets. Asset-backed tokens can be defined as blockchain manifestations of an entity, reflecting its lifecycle. Asset-backed tokens can be issued (and maintained) within a "competent" network, where competent peers operate the network and control the token's state. Given the interconnected nature of commercial, economic, and legal processes, the state of a token created in one network is inherent to the state of other tokens in another network. This creates the need to forge linked tokens so that derived tokens (tokens that depend on the state of a base token) consistently reflect the same information. This is particularly important when trust between the parties maintaining the (linked) tokens on separate networks is nonexistent. For example, using blockchain for bank guarantees eliminates the risk of fraud compared to traditional processes. However, using linked tokens (i.e., derivative tokens of a bank guarantee) allows parties to conduct genuine business activities abroad.

[0006] Therefore, it is desirable to have a method and system for creating / updating / deleting "linked ledger fields" of tokens that always carry the same value in certain fields and exist on separate blockchain networks in a way that no single party has the authority to modify both fields. Summary of the Invention

[0007] One example embodiment provides a system comprising a processor and a memory, wherein the processor is configured to perform one or more of the following operations: send a signed transaction Tr to node B A To update the token TKN on the ledger of blockchain A A , submit Tr signed by node B to blockchain A A , receives the signed transaction Tr from node B B To create token TKN on the ledger of blockchain B B , sends Tr signed by node A to node B B By submitting the key value (x) signed by the private key of node A to blockchain A and activating TKN by submitting the key value (x) to blockchain B B , to activate Tr A To update TKN A .

[0008] Another example embodiment provides a method comprising one or more of the following operations: sending a signed transaction Tr by node A to node B. A To update the token TKN on the ledger of blockchain A A Node A submits Tr signed by node B to blockchain A A, receives the signed transaction Tr from node B B To create token TKN on the ledger of blockchain B B , sends Tr signed by node A to node B B To submit to blockchain B, and node A activates TKN by submitting the key value (x) signed by node A's private key to blockchain A and submitting the key value (x) to blockchain B B , to activate Tr A To update TKN A .

[0009] Another example embodiment provides a non-transitory computer-readable medium comprising instructions that, when read by a processor, cause the processor to perform one or more of the following operations: send a signed transaction Tr to node B. A To create token TKN on the ledger of blockchain A A , submit Tr signed by node B to blockchain A A , receives the signed transaction Tr from node B B To update the token TKN on the ledger of blockchain B B , sends Tr signed by node A to node B B By submitting the key value (x) signed by the private key of node A to blockchain A and activating TKN by submitting the key value (x) to blockchain B B , to activate Tr A To update TKN A . BRIEF DESCRIPTION OF THE DRAWINGS

[0010] Figure 1 A network diagram of a system including a ledger database is shown according to an example embodiment.

[0011] Figure 2A An example peer node configuration is shown according to an example embodiment.

[0012] Figure 2B Another peer node configuration according to an example embodiment is shown.

[0013] Figure 3 A permissioned network according to an example embodiment is shown.

[0014] Figure 4A A flow chart according to an example embodiment is shown.

[0015] Figure 4B Another flow chart according to an example embodiment is shown.

[0016] Figure 5AAn example system configured to perform one or more operations described herein is shown according to an example embodiment.

[0017] Figure 5B Another example system configured to perform one or more operations described herein is shown according to an example embodiment.

[0018] Figure 5C A smart contract configuration between contracting parties and an intermediary server configured to execute the smart contract terms on a blockchain are shown according to example embodiments.

[0019] Figure 5D Another additional example system according to an example embodiment is shown.

[0020] Figure 6A A process of adding new data to a database according to an example embodiment is shown.

[0021] Figure 6B The contents of a data block including new data according to an example embodiment are shown.

[0022] Figure 7 An example system is shown that supports one or more example embodiments. DETAILED DESCRIPTION

[0023] It is readily understood that the example components as generally described and illustrated in the figures herein may be arranged and designed in a variety of different configurations. Therefore, the following detailed description of embodiments of at least one of the methods, apparatuses, non-transitory computer-readable media, and systems as illustrated in the figures is not intended to limit the scope of the claimed application but is merely representative of selected embodiments.

[0024] The example features, structures, or characteristics described throughout this specification may be combined in any suitable manner in one or more embodiments. For example, use of the phrases "an example embodiment," "some embodiments," or other similar language throughout this specification refers to the fact that a particular feature, structure, or characteristic described in connection with that embodiment may be included in at least one embodiment. Thus, appearances of the phrases "an example embodiment," "in some embodiments," "in other embodiments," or other similar language throughout this specification are not necessarily referring to the same set of embodiments, and the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0025] In addition, although the term "message" may have been used in the description of the embodiments, the present application is applicable to many types of network data (such as packets, frames, datagrams, etc.). The term "message" also includes packets, frames, datagrams, and their equivalents. Furthermore, although certain types of messages and signaling may be depicted in the exemplary embodiments, they are not limited to specific types of messages, and the present application is not limited to specific types of signaling.

[0026] Example embodiments provide methods, systems, components, non-transitory computer-readable media, devices, and / or networks that provide linking of tokens in a blockchain network.

[0027] A decentralized database is a distributed storage system consisting of multiple nodes that communicate with each other. A blockchain is an example of a decentralized database that includes an append-only, immutable data structure similar to a distributed ledger, which can maintain records between mutually untrusting parties. Untrusted parties are referred to herein as peers or peer nodes. Each peer maintains a copy of the database records, and no single peer can modify the database records without reaching consensus among the distributed peers. For example, peers may execute a consensus protocol to validate blockchain storage transactions, group storage transactions into blocks, and construct a hash chain on these blocks. To maintain consistency, this process forms a ledger by sorting storage transactions. In a public or permissionless blockchain, anyone can participate without a specific identity. Public blockchains typically involve native cryptocurrencies and use consensus based on various protocols, such as proof-of-work (PoW). On the other hand, permissioned blockchain databases provide a system that enables secure interactions between a group of entities that share a common goal but do not fully trust each other (such as businesses exchanging funds, goods, information, etc.).

[0028] Blockchains operate on arbitrary programmable logic, called "smart contracts" or "chaincode," tailored for decentralized storage solutions. In some cases, dedicated chaincodes may exist for managing functionality and parameters, referred to as system chaincodes. Smart contracts are trusted distributed applications that leverage the tamper-resistant properties of blockchain databases and an underlying protocol between nodes known as endorsements or endorsement policies. Generally speaking, blockchain transactions must be "endorsed" before being committed to the blockchain; unendorsed transactions are ignored. A typical endorsement policy allows chaincodes to specify the endorsers of a transaction, in the form of a set of peer nodes required for endorsement. When a client sends a transaction to the peers specified in the endorsement policy, the transaction is executed to validate it. After validation, transactions enter the ordering phase, where a consensus protocol is used to generate an ordered sequence of endorsed transactions, grouped into blocks.

[0029] A node is a communication entity in a blockchain system. A "node" can perform a logical function, in the sense that multiple nodes of different types can run on the same physical server. Nodes are grouped in trust domains and associated with logical entities that control them in various ways. Nodes can include different types, such as client or submission client nodes, which submit transaction invocations to endorsers (e.g., peers) and broadcast transaction proposals to an ordering service (e.g., an ordering node). Another type of node is a peer node, which can receive transactions submitted by clients, submit them, and maintain the state and copy of the blockchain transaction ledger. Peers can also play the role of endorsers, although this is not required. An ordering service node, or orderer, is a node that runs a communication service for all nodes and implements delivery guarantees, such as broadcasting to every peer node in the system when submitting transactions and modifying the blockchain's world state. This is another name for initial blockchain transactions, which typically include control and setup information.

[0030] The ledger is an ordered, tamper-proof record of all state transitions in a blockchain. State transitions can be generated by chaincode invocations (i.e., transactions) submitted by participants (e.g., client nodes, orderer nodes, endorser nodes, peer nodes, etc.). Transactions can result in a set of asset key-value pairs being submitted to the ledger as one or more operands, such as create, update, and delete. The ledger includes a blockchain (also called a chain), which stores an immutable, sequential record in blocks. The ledger also includes a state database, which maintains the current state of the blockchain. Typically, there is one ledger per channel. Each peer node maintains a copy of the ledger for each channel of which it is a member.

[0031] A chain is a transaction log structured as hash-linked blocks, with each block containing a sequence of N transactions, where N is equal to or greater than 1. A block header includes the hash of the block's transactions, as well as the hash of the previous block's header. In this way, all transactions on the ledger are sequenced and cryptographically linked together. Therefore, tampering with the ledger data is impossible without breaking the hash links. The hash of the most recently added blockchain block represents every transaction in the chain that preceded it, ensuring that all peers are in a consistent and trusted state. The chain can be stored on a peer node's file system (i.e., locally, on attached storage, in the cloud, etc.), effectively supporting the append-only nature of blockchain workloads.

[0032] The current state of the immutable ledger represents the latest values ​​of all keys included in the chain's transaction log. Because the current state represents the most recent key values ​​known to the channel, it is sometimes referred to as the world state. Chaincode calls execute transactions against the current state of the ledger. To enable these chaincode interactions, the latest values ​​of keys are stored in a state database. The state database is simply an indexed view of the chain's transaction log and can therefore be regenerated from the chain at any time. The state database can be automatically restored (or regenerated on demand) after a peer node starts and before accepting transactions.

[0033] Some benefits of the example solutions described and depicted herein include methods and systems for linking asset-backed tokens in a blockchain network. The example embodiments address time and trust issues by extending database features such as immutability, digital signatures, and a single source of truth. The example embodiments provide a solution for linking tokens in a blockchain-based network. Blockchain networks can be homogenous based on asset type and smart contract-based rules governing assets.

[0034] Blockchain differs from traditional databases in that it is not a centralized storage system, but rather a decentralized, immutable, and secure storage system, where nodes must share any changes to stored records. Certain inherent blockchain features that contribute to blockchain functionality include, but are not limited to, an immutable ledger, smart contracts, security, privacy, decentralization, consensus, endorsements, and accessibility, as further described herein. According to various aspects, a system for linking tokens within a blockchain network is enabled by blockchain's inherent and unique features of immutable accountability, security, privacy, permissioned decentralization, smart contract availability, endorsements, and accessibility. In particular, blockchain ledger data is immutable, providing an efficient method for linking tokens and their ledger fields within a blockchain network. Furthermore, the use of encryption within the blockchain provides security and builds trust. Smart contracts manage the state of assets throughout their lifecycle. The exemplary blockchain is permissioned and decentralized. Therefore, each end user can access their own copy of the ledger. Multiple organizations (and peers) can onboard a blockchain network. Key organizations can act as endorsing peers to validate smart contract execution results, read sets, and write sets. In other words, the inherent characteristics of blockchain provide an efficient implementation method for token chaining.

[0035] One benefit of the example embodiments is that they improve the functionality of computing systems by implementing methods for linking tokens across different blockchain-based systems. Through the blockchain system described herein, computing systems can perform functions for linking asset-backed tokens across blockchain networks by providing access to capabilities such as distributed ledgers, peers, encryption, MSPs, and event processing. Furthermore, blockchain enables the creation of business networks and the participation of any user or organization. Therefore, blockchain is more than just a database. Blockchain has the ability to create business networks of users and on-board and off-board organizations, enabling collaboration and execution of service processes in the form of smart contracts.

[0036] Example embodiments provide multiple benefits over traditional databases. For example, through blockchain, embodiments provide blockchain's inherent and unique immutable accountability, security, privacy, permissioned decentralization, availability of smart contracts, endorsement, and accessibility.

[0037] At the same time, traditional databases cannot be used to implement the example embodiments because they do not bring all parties together on a business network, do not create trusted collaboration, and do not provide efficient storage of digital assets. Traditional databases do not provide tamper-proof storage or preservation of stored digital assets. Therefore, the proposed method for linking tokens in a blockchain network cannot be implemented in traditional databases.

[0038] Meanwhile, if a traditional database is used to implement the example embodiment, the example embodiment will suffer from unnecessary drawbacks such as search capabilities, lack of security, and slow transaction speeds. Furthermore, it is simply impossible to implement an automated method of linking tokens in a blockchain network.

[0039] Thus, example embodiments provide specific solutions to problems in the technology / field of asset-backed tokens in blockchain networks.

[0040] Example embodiments also modify how data can be stored within the blockchain's block structure. For example, digital asset data can be securely stored within specific portions of a data block (i.e., in the header, data segment, or metadata). By storing digital asset data within a blockchain's data block, the digital asset data can be attached to an immutable blockchain ledger via a hash-linked blockchain. In some embodiments, the data block can differ from traditional data blocks by not storing personal data associated with the digital asset within the blockchain's traditional block structure. By removing personal data associated with the digital asset, the blockchain can provide the benefits of anonymity with the added benefits of immutable accountability and security.

[0041] According to an exemplary embodiment, a method and system are provided for creating linked token ledger fields (defined as entries that always carry the same value in certain (predetermined) fields) such that no single party has the authority to modify both fields. According to an exemplary embodiment, the linked tokens are on separate blockchain networks (or different chains of the same network).

[0042] According to an exemplary embodiment, the relevant information required to create or perform an operation on a token may include information from other tokens (located on other networks / chains). Any modifications / changes to the state of linked tokens must always be reflected in the current token, and vice versa.

[0043] Hashed time locks (HTLCs) can be used to exchange assets across a blockchain network. However, with HTLCs, there is no control over the previous owner of the asset after the exchange. For example, after user A provides user B with 10 BTC for 5 ETH, user A has no control over the state of the ETH. This approach is not suitable for linked tokens, where fields need to remain linked until a decision is made to mutually unlink them. According to one exemplary embodiment, ledger fields need to remain linked for the entire time the token is active. The exemplary embodiment provides a method and system for creating, updating, and deleting linked ledger fields. In other words, ledger fields can only be modified with the mutual consent of both parties. In one embodiment, a token data structure design can be used. The token data structure can carry information about the parties whose approval is required before a field (to be linked) can be modified using a multi-signature (multi-sig) approach.

[0044] In another embodiment, a synchronous link protocol (based on HTLC) can be used. The synchronous link protocol can give the other party the joint right to modify the fields of the link on their respective blockchain networks.

[0045] Hash-signed locks (HSLC) can be used as follows. Participant A has a field F_A on the BC_A network, and participant B has a field F_B on the BC_B network. Participants A and B want to link fields F_A and F_B together. Both parties can maintain a metafield containing access control data for modifying the corresponding field in the smart contract.

[0046] Participant A enters into a contract on his network using the hash H(x) and the certificate of participant B (using mutli-sig) with expiration time 2T. Note that x is a random value known only to participant A.

[0047] If participant B submits x to the contract, participant B's certificate is added to the metafield of F_A. Participant B enters into the contract on its network using the same hash H(x) and participant A's certificate with expiration time T. If participant A submits x to the contract, participant B's certificate is added to the metafield of F_A. Participant A submits x to the BC_B contract within time T (i.e., has a say in any future modifications to F_B). Participant B reads x and then submits x to the BC_A network within time 2T (i.e., has a say in any future modifications to F_A). Thus, participant A and participant B have write access on one blockchain and read access on both blockchains. Each party can submit a transaction to the other, which will be deemed valid by the blockchain network without any additional input from the party submitting the transaction. The transaction can be verified by the other party to confirm its legitimacy (as determined by the relevant blockchain network) and its appropriateness for the task it is intended to complete (which has been predetermined).

[0048] The token data structure may have fields for storing information related to access control rights for each token information field, which may be parsed and enforced by smart contracts that manipulate the token state. The token data structure may have specific fields marked as shared updates (linked), and other fields will be assumed to be independently updated (non-linked). The characteristic values ​​of the fields may be specified when defining the token and may be enforced by the smart contract. Non-linked fields may be updated independently without relying on any other token in the network. Linked fields may only be updated atomically on two tokens and may also be enforced by the smart contract. Note that the motivation or incentive for creating linked tokens may need to be decided offline and is not part of the scope of this disclosure. Multi-sig refers to a transaction that requires multiple keys to authorize it on the blockchain.

[0049] According to an exemplary embodiment, the setting for linking tokens can be implemented as follows. Participant A and Participant B respectively A and BC B Participant A and Participant B have write access to BC B and BC A Read access to PK A , PrK A and PK B , PrK B These are the public and private keys of participants A and B, respectively. Smart contracts in two blockchains can work in two steps:

[0050] a) accept all details of the transaction after checking that both parties’ signatures are present, and b) accept the hash-preimage if it is signed by one of the two parties.

[0051] Before updating a field (based on the submitted transaction), the smart contract can check that all necessary authorization signatures are present. Essentially, all field updates are multi-signature controlled.

[0052] For example, BC B Token TKN B It needs to be created using a specific linked field with BC A Pre-existing tokens in TKN A .

[0053] Participant node A can send a signed transaction Tr to participant node B A This transaction will update the token TKN A And PK B Added for future use of token TKN A One of the signature lock keys required to update the linked fields in the transaction Tr A We can have h = Hash(x), where x is chosen randomly and is known only to node A. We can provide a duration of time 2t as a requirement, within which Tr is traded only when the preimage of h (i.e., the value x) is provided. A can be activated.

[0054] Participant node A can receive Tr signed by participant node B A , and can be submitted to BC A Submit Tr A . Participant node A can send a BC A The private key PrK A Signed with public key PK A and PK B Verification transaction (no input).

[0055] Participant node A can receive the signed transaction Tr from participant node B B , this transaction can create tokens TKN B And PK A Added for future support of TKN B The transaction can provide a hash h = Hash(x), where x is still only known to the participant node A. The transaction can specify a time duration t as a requirement, within which Tr can only be updated when the original image of h (i.e., the value x) is provided. B can be activated.

[0056] Participant node A can sign Tr B and send it to participant node B to be delivered to BC B Participant node A can receive a request for BC from participant node B (no input) B by PrK B Signed with PK A and PK B The verification transaction of PrK. Participant node A can send PrK to A Signed BC A Submit value x and enable transaction Tr A , thereby updating TKN A . Subsequently, participant node B may, after time t, A Read x and can be used to B Signed BC B Submit x, thus enabling the transaction to create a link to TKN A Token TKN B .

[0057] According to an exemplary embodiment, the requirement for a counterparty to sign (i.e., a signature lock) for future modifications to a shared update field of a token in a blockchain to which one party has write access ensures that both parties will need to agree before any modification of the value in the linked field can be made. The presence of a hash lock ensures that publishing a secret on one blockchain network will allow another party to reuse it on another blockchain network.

[0058] To prevent replay attacks, the token data structure should have a monotonically increasing identifier (ID) field that should be incremented by the smart contract each time the token is updated. The token ID should be mentioned in the signed transaction presented to the other party, and the receiving party should ensure that the received ID is earlier than the currently recorded transaction ID for the token. Otherwise, the transaction should be rejected.

[0059] In one embodiment, instead of a token field, the linked items can be universal ledger fields on both blockchains. In another embodiment, instead of two separate blockchains, the two linked entries can exist in two separate channels on a single blockchain network, provided that no trusted party has write access to both channels. In yet another embodiment, one party may have write access but may not be trusted.

[0060] Figure 1 A logical network diagram for linking tokens in different blockchain networks is shown, according to an example embodiment.

[0061] refer to Figure 1, the example network 100 includes a node A 102 connected to a node B 105. Node A 102 may be connected to a blockchain A 106, which has a protocol for storing tokens TKN A 110 of the ledger 108. Node B 105 can be connected to the blockchain B 107, which has a blockchain for storing tokens TKN B 111 of the ledger 109. Although this example only describes one node A 102 and node B 105 in detail, multiple such nodes may be connected to the blockchain 106 and 107, respectively. It should be understood that node A 102 may include additional components, and some components described herein may be removed and / or modified without departing from the scope of node A 102 disclosed herein. Node A 102 may be a computing device or server computer, etc., and may include a processor 104, which may be a semiconductor-based microprocessor, a central processing unit (CPU), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), and / or other hardware device. Although a single processor 104 is shown, it should be understood that node A 102 may include multiple processors, multiple cores, etc., without departing from the scope of the node A 102 system.

[0062] Node A 102 may also include a non-transitory computer-readable medium 112, which may have machine-readable instructions stored thereon that are executable by processor 104. Examples of machine-readable instructions are shown as 114-122 and discussed further below. Examples of non-transitory computer-readable medium 112 may include electronic, magnetic, optical, or other physical storage devices that contain or store executable instructions. For example, non-transitory computer-readable medium 112 may be a random access memory (RAM), an electrically erasable programmable read-only memory (EEPROM), a hard disk, an optical disk, or other type of storage device.

[0063] Processor 104 may fetch, decode, and execute machine-readable instructions 114 to send the signed transaction Tr to Node B 105. A , to update the token TKN on the ledger 108 of the blockchain A106 A 110. The blockchain 106 and 107 networks may be configured to utilize one or more smart contracts that manage transactions for multiple participating nodes.

[0064] Processor 104 may fetch, decode, and execute machine-readable instructions 116 to submit Tr signed by node B to blockchain A 106. A Processor 104 may fetch, decode, and execute machine-readable instructions 118 to receive a signed transaction Tr from Node B 105. B , to create the token TKN on the ledger 109 of the blockchain B107B 111. The processor 104 may fetch, decode, and execute the machine-readable instructions 120 to send the Tr signed by the node A 102 to the node B 105. B The processor 104 can retrieve, decode and execute the machine-readable instructions 122 to activate Tr by submitting the key value (x) signed by the private key of node A 102 to blockchain A 106. A To update TKN A 110.

[0065] Figure 2A A blockchain architecture configuration 200 is shown according to an example embodiment. Figure 2A The blockchain architecture 200 may include certain blockchain elements, such as a set of blockchain nodes 202. Blockchain nodes 202 may include one or more nodes 204-210 (four nodes are described by way of example only). These nodes participate in various activities, such as blockchain transaction addition and validation processes (consensus). One or more of the blockchain nodes 204-210 may endorse transactions based on endorsement policies and may provide ordering services for all blockchain nodes in the architecture 200. Blockchain nodes may initiate blockchain authentication and seek to write to the blockchain's immutable ledger stored in the blockchain layer 216, a copy of which may also be stored on the underlying physical infrastructure 214. The blockchain configuration may include one or more applications 224, which link to an application programming interface (API) 222 to access and execute stored program / application code 220 (e.g., chaincode, smart contracts, etc.). These applications may be created based on the customized configuration sought by participants and may maintain their own state, control their own assets, and receive external information. This may be deployed as a transaction and installed on all blockchain nodes 204-210 by attaching it to the distributed ledger.

[0066] The blockchain foundation or platform 212 may include various layers of blockchain data, services (e.g., cryptographic trust services, virtual execution environments, etc.), and underlying physical computer infrastructure that can be used to receive and store new transactions and provide access to auditors seeking to access data entries. The blockchain layer 216 may expose an interface that provides access to the virtual execution environment necessary to process program code and participate in the physical infrastructure 214. Cryptographic trust services 218 may be used to verify transactions, such as asset exchange transactions, and keep information private.

[0067] Figure 2AThe blockchain architecture configuration may process and execute program / application code 220 via one or more interfaces exposed by the blockchain platform 212 and services provided by the blockchain platform 212. Code 220 may control blockchain assets. For example, code 220 may store and transmit data and may be executed by nodes 204-210 in the form of smart contracts and chaincodes associated with conditions or other code elements executed thereon. As a non-limiting example, smart contracts may be created to execute reminders, updates, and / or other notifications of changes, updates, etc. The smart contracts themselves may be used to identify rules associated with authorization and access requirements and use of the ledger. For example, token information 226 may be processed by one or more processing entities (e.g., virtual machines) included in the blockchain layer 216. Result 228 may include a data block reflecting the updated token field on the ledger. Physical infrastructure 214 may be used to obtain any data or information described herein.

[0068] Within chaincode, smart contracts can be created via high-level applications and programming languages ​​and then written to blocks in a blockchain. Smart contracts can include executable code that is registered, stored, and / or replicated with a blockchain (e.g., a distributed network of blockchain peers). A transaction is the execution of smart contract code, which can be executed in response to conditions associated with the smart contract being met. The execution of a smart contract can trigger trusted modifications to the state of the digital blockchain ledger. Modifications to the blockchain ledger resulting from the execution of a smart contract can be automatically replicated across the distributed network of blockchain peers via one or more consensus protocols.

[0069] Smart contracts can write data to the blockchain in the form of key-value pairs. Furthermore, smart contract code can read values ​​stored on the blockchain and use them in application operations. Smart contract code can write the outputs of various logical operations to the blockchain. The code can be used to create temporary data structures within a virtual machine or other computing platform. The data written to the blockchain can be public and / or encrypted and maintained privately. Temporary data used / generated by the smart contract is stored in memory by the provided execution environment and then deleted after the data required by the blockchain is identified.

[0070] Chaincode may include a code interpretation of a smart contract with additional features. As described herein, chaincode may be program code deployed on a computing network where it is executed and validated by chain validators together during a consensus process. The chaincode receives a hash and fetches a hash from the blockchain associated with a data template created by using a previously stored feature extractor. If the hash of the hashed identifier and the hash created from the stored identifier template data match, the chaincode sends the authorization key to the requested service. The chaincode may write blockchain data associated with cryptographic details. In Figure 2AIn

[0026] , linking of a token may include execution of a smart contract. One function may be submitting a transaction related to executing a smart contract on a ledger to record an update to a token field, which transaction may be provided to one or more of nodes 204-210.

[0071] Figure 2B An example of a transaction flow 250 between nodes of a blockchain according to an example embodiment is shown. Figure 2B The transaction process may include a transaction proposal 291 sent by the application client node 260 to the endorsing peer node 281. The endorsing peer 281 may verify the client signature and execute the chaincode function to initiate the transaction. The output may include the chaincode result, a set of key / value versions read from the chaincode (read set), and a set of key / value versions written to the chaincode (write set). If the transaction proposal is approved, a proposal response 292 is sent back to the client 260 along with the endorsement signature. The client 260 assembles the endorsement into a transaction payload 293 and broadcasts it to the ordering service node 284. The ordering service node 284 then delivers the ordered transaction as a block to all peers 281-283 on the channel. Before committing to the blockchain, each peer 281-283 may validate the transaction. For example, a peer may check the endorsement policy to ensure that the correct allocation of designated peers has signed the result and authenticated the signature against the transaction payload 293.

[0072] Reference again Figure 2B , the client node 260 initiates a transaction 291 by constructing and sending a request to the peer node 281 acting as an endorser. The client 260 may include an application utilizing a supported software development kit (SDK), such as NODE, JAVA, PYTHON, etc., which utilizes available APIs to generate a transaction proposal. The proposal is a request to invoke a chaincode function so that data can be read and / or written to the ledger (i.e., writing a new key-value pair for an asset). The SDK can serve as a shim to package the transaction proposal into an appropriate architecture format (e.g., protocol buffers over remote procedure calls (RPCs)) and obtain the client's cryptographic certificate to generate a unique signature for the transaction proposal.

[0073] In response, the endorsing peer 281 can verify that: (a) the transaction proposal is well-formed, (b) no transaction has been submitted in the past (replay-attack protection), (c) the signature is valid, and (d) the submitter (in this example, client 260) is properly authorized to perform the proposed operation on the channel. The endorsing peer 281 can input the transaction proposal as a parameter to the invoked chaincode function. The chaincode is then executed against the current state database to produce a transaction result including the response value, read set, and write set. However, no updates are made to the ledger at this time. In 292, this set of values, along with the signature of the endorsing peer 281, is passed back to the SDK of the client 260 as a proposal response 292, which parses the payload for use by the application.

[0074] In response, the client 260 application checks / verifies the endorsement peer signatures and compares the proposal responses to determine if the proposal responses are identical. If the chaincode only queries the ledger, the application will check the query response and typically will not submit the transaction to the sorting node service 284. If the client application intends to submit the transaction to the sorting node service 284 to update the ledger, the application determines whether the endorsement policy specified before submission has been satisfied (i.e., whether all peer nodes required for the transaction endorse the transaction). Here, the client may only include one of the multiple parties to the transaction. In this case, each client can have its own endorsing node, and each endorsing node is required to endorse the transaction. This architecture ensures that even if the application chooses not to check the response or otherwise forward an unendorsed transaction, the endorsement policy will still be enforced by the peers and maintained during the commit validation phase.

[0075] After a successful check, in step 293, client 260 assembles the endorsement into a transaction and broadcasts the transaction proposal and response to orderer 284 in a transaction message. The transaction may contain read / write sets, signatures of endorsing peers, and the channel ID. Orderer 284 does not need to examine the entire contents of the transaction in order to perform its operations. Instead, orderer 284 can simply receive transactions from all channels in the network, sort them by channel in chronological order, and create a transaction block by channel.

[0076] The transaction block is passed from the ordering node 284 to all peer nodes 281-283 on the channel. Transactions 294 within the block are validated to ensure that any endorsement policies are satisfied and that the ledger state of the read set variables has not changed, as the read set is generated by the transaction execution. The transactions in the block are marked as valid or invalid. Furthermore, in step 295, each peer node 281-283 appends the block to the channel's chain and, for each valid transaction, commits the write set to the current state database. Events are emitted to notify the client application that the transaction (call) has been immutably appended to the chain and whether the transaction has been validated or invalidated.

[0077] Figure 3 An example of a permissioned blockchain network 300 is shown, featuring a distributed, decentralized peer-to-peer architecture and a certificate authority 318 that manages user roles and permissions. In this example, a blockchain user 302 can submit transactions to the permissioned blockchain network 310. In this example, transactions can be deployments, calls, or queries, and can be issued directly through a client-side application utilizing an SDK, such as a REST API. The trusted business network provides access to a regulator system 314, such as an auditor (e.g., the Securities and Exchange Commission in the U.S. stock market). Meanwhile, the node's blockchain network operator 308 manages member permissions, such as registering the regulator system 314 as an "auditor" and registering the blockchain user 302 as a "client." Auditors can be limited to querying the ledger, while clients can be authorized to deploy, call, and query specific types of chaincode.

[0078] The blockchain developer system 316 writes chaincode and client-side applications. The blockchain developer system 316 can deploy chaincode directly to the network via a REST interface. To include certificates from a traditional data source 330 in the chaincode, the developer system 316 can use out-of-band connections to access the data. In this example, a blockchain user 302 connects to the network via a peer node 312. Before proceeding with any transaction, the peer node 312 obtains the user's registration and transaction certificates from a certificate authority 318. In some cases, blockchain users must possess these digital certificates in order to conduct transactions on the permissioned blockchain network 310. Furthermore, users attempting to drive chaincode may be required to verify their certificates against the traditional data source 310. To confirm the user's authorization, the chaincode can use an out-of-band connection to this data via a traditional processing platform 320.

[0079] Figure 4A A flowchart 400 is shown of an example method of linking tokens in different blockchain networks according to an example embodiment. Figure 4A , method 400 may include one or more steps described below.

[0080] Figure 4A Node A 102 (see Figure 1 ) is a flowchart of an example method performed. It should be understood that Figure 4A The method 400 depicted in FIG4 may include additional operations, and some of the operations described therein may be deleted and / or modified without departing from the scope of the method 400. For illustrative purposes, the description of the method 400 also refers to FIG4. Figure 1 In particular, the processor 104 of the node A 102 may perform some or all of the operations included in the method 400 .

[0081] refer to Figure 4A At block 412, processor 104 may send the signed transaction Tr to node B. A To update the token TKN on the ledger of blockchain A A At block 414, processor 104 may submit to blockchain A the Tr signed by node B. A At block 416, processor 104 may receive the signed transaction Tr from node B. B , to create token TKN on the ledger of blockchain B B At block 418, processor 104 may send Tr signed by node A to node B. B To submit to blockchain B. At block 420, processor 104 may activate Tr by submitting to blockchain A the key value (x) signed by node A’s private key. A To update TKN A .

[0082] Figure 4B A flowchart 450 is shown of an example method of linking tokens in different blockchain networks according to an example embodiment. Figure 4B , method 450 may further include one or more of the following steps. At block 452, processor 104 may provide x to node B to sign x with node B's private key and submit the signed x to blockchain B. At block 454, node B may enable Tr B Link to TKN for updates A TKN B At block 456, processor 104 may send Tr A Add the public key of node B as the signature lock key to update TKN A At block 458, the processor 104 may include the hash value h=Hash(x) and the time in Tr A where x is randomly chosen and known only to node A, and the time is Tr A Note that Tr is activated only when the pre-image of h is provided.A At block 460 , processor 104 may send a verification transaction to node B that includes node A's public key and node B's public key, where the verification transaction is signed by node A's private key.

[0083] Figure 5A An example system 500 is shown including a physical infrastructure 510 configured to perform various operations according to an example embodiment. Figure 5A , physical infrastructure 510 includes module 512 and module 514. Module 514 includes blockchain 520 and smart contract 530 (which may reside on blockchain 520), which may perform any of the operational steps (in module 512) included in any example embodiment. Step / operation 508 may include one or more of the described or depicted embodiments and may represent output or written information written to or read from one or more smart contracts 530 and / or blockchain 520. Physical infrastructure 510, module 512, and module 514 may include one or more computers, servers, processors, memories, and / or wireless communication devices. Furthermore, module 512 and module 514 may be the same module.

[0084] Figure 5B Another example system 540 is shown that is configured to perform various operations according to an example embodiment. Figure 5B , system 540 includes module 512 and module 514. Module 514 includes blockchain 520 and smart contract 530 (which may reside on blockchain 520), which may perform any of the operational steps (in module 512) included in any example embodiment. Step / operation 508 may include one or more of the described or depicted embodiments and may represent output or written information written to or read from one or more smart contracts 530 and / or blockchain 520. Physical infrastructure 510, module 512, and module 514 may include one or more computers, servers, processors, memories, and / or wireless communication devices. Furthermore, module 512 and module 514 may be the same module.

[0085] Figure 5C An example smart contract configuration between contracting parties and an intermediary server configured to enforce the terms of the smart contract on a blockchain are shown in accordance with an example embodiment. Figure 5CConfiguration 550 may represent a communication session, asset transfer session, or process or progression driven by a smart contract 530 that explicitly identifies one or more user devices 552 and / or 556. The execution, operations, and results of the smart contract execution may be managed by server 554. The content of smart contract 530 may require digital signatures from one or more of entities 552 and 556 that are participants in the smart contract transaction. The results of the smart contract execution may be written to blockchain 520 as blockchain transactions. Smart contract 530 resides on blockchain 520, which may reside on one or more computers, servers, processors, memories, and / or wireless communication devices.

[0086] Figure 5D A public interface 560 for accessing the logic and data of a blockchain is shown according to an example embodiment. Figure 5D In the example of , an application programming interface (API) gateway 562 provides a public interface for accessing blockchain logic (e.g., smart contracts 530 or other chaincodes) and data (e.g., distributed ledgers, etc.). In this example, API gateway 562 is a public interface for executing transactions (calls, queries, etc.) on the blockchain by connecting one or more entities 552 and 556 to blockchain peers (i.e., server 554). Here, server 554 is a blockchain network peer component that holds a copy of the world state and distributed ledger, allowing clients 552 and 556 to query data about the world state and submit transactions to the blockchain network, where, depending on the smart contract 530 and the endorsement policy, endorsing peers will execute the smart contract 530.

[0087] The above embodiments may be implemented in hardware, in a computer program executed by a processor, in firmware, or a combination thereof. The computer program may be embodied on a computer-readable medium, such as a storage medium. For example, the computer program may reside in random access memory ("RAM"), flash memory, read-only memory ("ROM"), erasable programmable read-only memory ("EPROM"), electrically erasable programmable read-only memory ("EEPROM"), registers, a hard disk, a removable disk, a compact disk read-only memory ("CD-ROM"), or any other form of storage medium known in the art.

[0088] An exemplary storage medium may be coupled to a processor so that the processor can read information from and write information to the storage medium. In an alternative embodiment, the storage medium may be an integral part of the processor. The processor and the storage medium may reside in an application specific integrated circuit ("ASIC"). In an alternative embodiment, the processor and the storage medium may reside as discrete components. For example, FIG6 illustrates an exemplary computer system architecture 600, which may represent or be integrated into any of the aforementioned components, etc.

[0089] Figure 6A shows a process 600 of adding a new block to a distributed ledger 630 according to an example embodiment, Figure 6B The contents of a block structure 650 for a blockchain are shown according to an example embodiment. Figure 6A , a client (not shown) can submit a transaction to blockchain nodes 621, 622, and / or 623. A client can be an instruction received from any source to enact an activity on blockchain 632. By way of example, a client can be an application acting on behalf of a requester, such as a device, person, or entity proposing a transaction on the blockchain. Multiple blockchain peers (e.g., blockchain nodes 621, 622, and 623) can maintain the state of the blockchain network and a copy of the distributed ledger 630. Different types of blockchain nodes / peers can exist in the blockchain network, including endorsing peers, which simulate and endorse transactions proposed by clients, and committing peers, which verify endorsements, validate transactions, and commit transactions to the distributed ledger 630. In this example, blockchain nodes 621, 622, and 623 can perform the roles of endorser nodes, committer nodes, or both.

[0090] The distributed ledger 630 includes a blockchain 632 that stores an immutable, ordered record in blocks, and a state database 634 (the current world state) that maintains the current state of the blockchain 632. One distributed ledger 630 may exist for each channel, and each peer maintains its own copy of the distributed ledger 630 for each channel of which it is a member. The blockchain 632 is a transaction log structured as hash-linked blocks, where each block contains a sequence of N transactions. A block may include various components, such as Figure 6B As shown. The link of a block can be generated by adding the hash of the previous block header to the block header of the current block (by Figure 6A ). In this way, all transactions on blockchain 632 are ordered and cryptographically linked together to prevent tampering with the blockchain data without breaking the hash link. Furthermore, due to this linking, the latest block in blockchain 632 represents every transaction that came before it. Blockchain 632 can be stored on a peer-to-peer file system (local or attached storage) that supports append-only blockchain workloads.

[0091] The current state of blockchain 632 and distributed ledger 630 can be stored in state database 634. Here, current state data represents the latest values ​​of all keys ever included in the chain transaction log of blockchain 632. Chaincode invocations execute transactions against the current state in state database 634. To make these chaincode interactions highly efficient, the latest values ​​of all keys are stored in state database 634. State database 634 can include an indexed view into the transaction log of blockchain 632, so that state database 634 can be regenerated from the chain at any time. State database 634 can be automatically restored at peer startup (or generated on demand) before a transaction is accepted.

[0092] An endorsing peer receives a transaction from a client and endorses it based on the simulation results. The endorsing peer holds the smart contract that proposes the simulated transaction. When an endorsing peer endorses a transaction, it creates a transaction endorsement, which is a signed response from the endorsing peer to the client application indicating its endorsement of the simulated transaction. The method for endorsing a transaction depends on the endorsement policy that can be specified in the chaincode. An example of an endorsement policy is "a majority of endorsing peers must endorse the transaction." Different channels can have different endorsement policies. The client application forwards the endorsed transaction to the ordering service 610.

[0093] The ordering service 610 accepts endorsed transactions, orders them into blocks, and delivers the blocks to the submitting peers. For example, the ordering service 610 may initiate a new block when a threshold of transactions has been reached, a timer has expired, or other conditions have occurred. Figure 6A In the example of , blockchain node 622 is a committing peer that has received a new data block 650 for storing the new data block on blockchain 630.

[0094] The ordering service 610 may be composed of a cluster of orderers. The ordering service 610 does not process transactions, smart contracts, or maintain a shared ledger. Instead, the ordering service 610 may accept endorsed transactions and specify the order in which those transactions are submitted to the distributed ledger 630. The architecture of the blockchain network may be designed to make a specific implementation of "ordering" (e.g., Solo, Kafka, BFT, etc.) a pluggable component.

[0095] Transactions are written to the distributed ledger 630 in a consistent order. The order of transactions is established to ensure that updates to the state database 634 are valid when they are submitted to the network. Unlike cryptocurrency blockchain systems (e.g., Bitcoin, etc.) where ordering is achieved by solving cryptographic puzzles or mining, in this example, participants in the distributed ledger 630 can choose the ordering mechanism that best suits the network.

[0096] When ordering service 610 initializes a new block 650, it may broadcast the new block 650 to committing peers (e.g., blockchain nodes 621, 622, and 623). In response, each committing peer validates the transactions in new block 650 by checking to ensure that the read and write sets still match the current world state in state database 634. Specifically, the committing peer may determine whether the read data present when the endorser simulated the transaction is the same as the current world state in state database 634. When the committing peer validates the transaction, it is written to blockchain 632 on distributed ledger 630, and state database 634 is updated with the write data from the read and write sets. If the transaction fails—that is, if the committing peer discovers that the read and write sets do not match the current world state in state database 634—the transaction ordered into the block will still be included in the block, but it will be marked as invalid, and state database 634 will not be updated.

[0097] refer to Figure 6B , a block 650 (also referred to as a data block) stored on the blockchain 632 of the distributed ledger 630 may include multiple data segments, such as a block header 660, block data 670, and block metadata 680. It should be understood that the various blocks and their contents (e.g., Figure 6B The block 650 and its contents shown are for example purposes only and are not intended to limit the scope of the example embodiments. In some cases, both the block header 660 and the block metadata 680 may be smaller than the block data 670 storing the transaction data, but this is not a requirement. The block 650 may store transaction information for N transactions (e.g., 100, 500, 1000, 2000, 3000, etc.) within the block data 670. The block 650 may also include: a link to the previous block (e.g., in the block header 660); Figure 6A 632 in the blockchain). Specifically, block header 660 may include a hash of the previous block header. Block header 660 may also include a unique block number, a hash of block data 670 of the current block 650, and the like. Block numbers for block 650 may be unique and assigned in various sequences, such as an ascending / sequential sequence starting from zero. The first block in a blockchain may be referred to as a genesis block, which includes information about the blockchain, its members, the data stored therein, and the like.

[0098] The block data 670 may store transaction information for each transaction recorded in the block 650. For example, the transaction data may include one or more of the following: transaction type, version, timestamp, channel ID of the distributed ledger 630, transaction ID, epoch, payload visibility, chaincode path (deploy tx), chaincode name, chaincode version, inputs (chaincode and function), client (creator) identity (such as public key and certificate), client signature, endorser identity, endorser signature, proposed hash, chaincode event, response status, namespace, read set (a list of keys and versions read by the transaction, etc.), write set (a list of keys and values, etc.), start key, end key, key list, Merkel tree query summary, etc. Transaction data may be stored for each of the N transactions.

[0099] In some embodiments, block data 670 may also store data 672 that adds additional information to the hash-linked blockchain in blockchain 632. Thus, data 672 may be stored in an immutable log of blocks on distributed ledger 630. Some of the benefits of storing such data 672 are reflected in the various embodiments disclosed and described herein.

[0100] Block metadata 680 can store multiple fields of metadata (e.g., as a byte array, etc.). Metadata fields may include a signature at the time of block creation, a reference to the last configuration block, a transaction filter that identifies valid and invalid transactions within the block, the last offset persisted by the ordering service that orders the block, etc. The signature, the last configuration block, and the orderer metadata can be added by the ordering service 610. At the same time, the block's submitter (e.g., blockchain node 622) can add validity / invalidity information based on endorsement policies, verification of read / write sets, etc. The transaction filter may include a byte array of size equal to the number of transactions in the block data 670 and a verification code that identifies whether the transaction is valid / invalid.

[0101] Figure 7 It is not intended to imply any limitation on the scope of use or functionality of the embodiments of the present application described herein.In any case, computing node 700 is capable of being implemented and / or performing any of the functions set forth above.

[0102] In computing node 700, there is a computer system / server 702, which can operate with numerous other general-purpose or special-purpose computing system environments or configurations. Examples of well-known computing systems, environments, and / or configurations that may be suitable for use with computer system / server 702 include, but are not limited to, personal computer systems, server computer systems, thin clients, thick clients, handheld or laptop devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputer systems, mainframe computer systems, and distributed cloud computing environments that include any of the above systems or devices, etc.

[0103] Computer system / server 702 may be described in the general context of computer system-executable instructions, such as program modules, executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, etc. that perform specific tasks or implement specific abstract data types. Computer system / server 702 may be practiced in a distributed cloud computing environment where tasks are performed by remote processing devices linked through a communication network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media, including memory storage devices.

[0104] like Figure 7 As shown, computer system / server 702 in cloud computing node 700 is implemented as a general-purpose computing device. Components of computer system / server 702 may include, but are not limited to, one or more processors or processing units 704, system memory 706, and a bus connecting various system components (including system memory 706 and processing units 704).

[0105] The term "bus" refers to one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures. Examples of these architectures include, but are not limited to, the Industry Standard Architecture (ISA) bus, the Micro Channel Architecture (MAC) bus, the Enhanced ISA bus, the Video Electronics Standards Association (VESA) local bus, and the Peripheral Component Interconnect (PCI) bus.

[0106] Computer system / server 702 typically includes a variety of computer system-readable media. These media can be any available media that can be accessed by computer system / server 702, including volatile and non-volatile media, removable and non-removable media. In one embodiment, system memory 706 implements the flowcharts of the other figures. System memory 706 can include computer system-readable media in the form of volatile memory, such as random access memory (RAM) 710 and / or cache memory 712. Computer system / server 702 can further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, storage system 714 can be used to read and write to non-removable, non-volatile magnetic media (not shown, commonly referred to as a "hard drive"). Although not shown, magnetic disk drives for reading and writing to removable non-volatile magnetic disks (e.g., "floppy disks") and optical disk drives for reading and writing to removable non-volatile optical disks (e.g., CD-ROMs, DVD-ROMs, or other optical media) can also be provided. In these cases, each drive can be connected to the bus via one or more data media interfaces. The memory 706 may include at least one program product having a set (eg, at least one) of program modules configured to perform the functions of various embodiments of the present invention.

[0107] A program / utility 716 having a set (at least one) of program modules 718 may be stored, for example, in memory 706. Such program modules 718 include, but are not limited to, an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may include an implementation of a network environment. Program modules 718 generally perform the functions and / or methodologies of the embodiments described herein.

[0108] As will be appreciated by those skilled in the art, aspects of the present application may be embodied as a system, method, or computer program product. Accordingly, aspects of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, microcode, etc.), or an embodiment combining software and hardware aspects, which may generally be referred to herein as a "circuit," "module," or "system." Herein, aspects of the present application may take the form of a computer program product embodied in one or more computer-readable media having computer-readable program code embodied therein.

[0109] Computer system / server 702 can also communicate with one or more external devices 720 (e.g., a keyboard, pointing device, display 722, etc.), one or more devices that enable a user to interact with computer system / server 702, and / or any device that enables computer system / server 702 to communicate with one or more other computing devices (e.g., a network card, a modem, etc.). Such communication can occur via input / output (I / O) interface 724. Furthermore, computer system / server 702 can communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network such as the Internet) via network adapter 726. As shown, network adapter 726 communicates with other modules of computer system / server 702 via a bus. It should be understood that, although not shown, other hardware and / or software modules can be used in conjunction with computer system / server 702, including but not limited to microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0110] Although exemplary embodiments of at least one of the systems, methods, and non-transitory computer-readable media are shown in the accompanying drawings and described in the foregoing detailed description, it should be understood that the present application is not limited to the disclosed embodiments, but is capable of many rearrangements, modifications, and substitutions as described and defined in the following claims. For example, the capabilities of the systems in the various figures may be performed by one or more modules or components described herein or in a distributed architecture, and may include transmitters, receivers, or pairs of both. For example, all or part of the functions performed by each module may be performed by one or more of these modules. In addition, the functions described herein may be performed at different times and in relation to various events within or external to the modules or components. In addition, information sent between the modules may be sent between the modules via at least one of the following: a data network, the Internet, a voice network, an Internet Protocol network, a wireless device, a wired device, and / or multiple protocols. In addition, messages sent or received by any module may be sent or received directly and / or via one or more other modules.

[0111] Those skilled in the art will appreciate that a "system" may be embodied as a personal computer, server, console, personal digital assistant (PDA), cellular telephone, tablet computing device, smartphone, or any other suitable computing device, or combination of devices. Presenting the above functions as being performed by a "system" is not intended to limit the scope of this application in any way, but is intended to provide an example of many embodiments. In practice, the methods, systems, and apparatus disclosed herein may be implemented in both localized and distributed forms consistent with computing technology.

[0112] It should be noted that some system features described in this specification have been presented as modules in order to more specifically emphasize their implementation independence. For example, a module can be implemented as a hardware circuit comprising: a custom very large scale integrated (VLSI) circuit or gate array, an off-the-shelf semiconductor such as a logic chip, a transistor, or other discrete components. A module can also be implemented in a programmable hardware device such as a field programmable gate array, programmable array logic, a programmable logic device, a graphics processing unit, etc.

[0113] Modules may also be implemented at least in part in software for execution by various types of processors. The identified executable code unit may, for example, include one or more physical or logical blocks of computer instructions, which may, for example, be organized as objects, procedures, or functions. However, the executable file of the identified module need not be physically located in one place, but may include different instructions stored in different locations, which, when logically connected together, include the module and achieve the purpose for the module. In addition, the module may be stored on a computer-readable medium, which may be, for example, a hard drive, a flash memory device, a random access memory (RAM), a magnetic tape, or any other such medium for storing data.

[0114] In practice, a module of executable code may be a single instruction or multiple instructions, and may even be distributed across multiple different code segments, across different programs, and across multiple memory devices. Similarly, operational data may be identified and illustrated herein within a module, and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed across different locations (including across different storage devices), and may exist, at least in part, solely as electronic signals on a system or network.

[0115] It is easy to understand that, as generally described and illustrated in the drawings herein, the components of the present application can be arranged and designed in a variety of different configurations. Therefore, the detailed description of the embodiments is not intended to limit the scope of the claimed application, but merely represents selected embodiments of the application.

[0116] Those skilled in the art will readily appreciate that the above can be practiced with steps in a different order and / or using hardware elements in a configuration different from that disclosed. Therefore, although the present application has been described based on these preferred embodiments, it will be apparent to those skilled in the art that certain modifications, variations, and alternative constructions will be apparent.

[0117] While preferred embodiments of the present application have been described, it should be understood that the described embodiments are illustrative only and that the scope of the present application is limited solely by the appended claims when considered in light of their full range of equivalents and modifications (e.g., protocols, hardware devices, software platforms, etc.).

Claims

1. A method for linking tokens in a blockchain network, wherein the blockchain network comprises at least blockchain A, blockchain B, node A and node B, wherein node A is connected to blockchain A, node B is connected to blockchain B, and node A is connected to node B. include: In the blockchain network, the node A sends the signed transaction Tr to the node B. A To update the token TKN on the ledger of the blockchain A in the blockchain network A ; The node A submits the Tr signed by the node B to the blockchain A. A ; Receive the signed transaction Tr from the node B in the blockchain network B To create a token TKN on the ledger of the blockchain B in the blockchain network B ; Send the Tr signed by the node A to the node B B To submit to the blockchain B; as well as The Tr is activated by the node A submitting the key value x signed by the private key of the node A to the blockchain A. A To update the TKN A ; Among them, the TKN B Link to the TKN A .

2. The method according to claim 1, further comprising: include: Provide the x to the node B to sign the x by the private key of the node B, and submit the signed x to the blockchain B.

3. The method according to claim 2, in, The Node B enables the Tr B Link to the TKN for updates A TKN B .

4. The method according to claim 1, further comprising: include: Send the Tr A To add the Node B's public key as a proxy for the TKN A The updated signature lock key for the link field.

5. The method according to claim 1, further comprising: include: Include the hash value h=Hash(x) and time in the Tr A , where x is randomly selected and known only to the node A, and the time is the Tr A The activation time period.

6. The method according to claim 5, in, When the original image of h is provided, the Tr is activated. A .

7. The method according to claim 1, further comprising: include: Sending a verification transaction including the public key of the node A and the public key of the node B to the node B, wherein the verification transaction is signed by the private key of the node A.

8. A system for linking tokens in a blockchain network, include: The processor of node A; A memory having machine-readable instructions stored thereon, which instructions, when executed by the processor, cause the processor to perform the steps of any one of claims 1 to 7.

9. A computer program product comprising a non-transitory computer readable medium of instructions which, when read by a processor, cause the processor to perform the steps of any one of claims 1 to 7.