CN114445073A - Computer-implemented method, information processing apparatus, and storage medium - Google Patents
Computer-implemented method, information processing apparatus, and storage medium Download PDFInfo
- Publication number
- CN114445073A CN114445073A CN202011215819.1A CN202011215819A CN114445073A CN 114445073 A CN114445073 A CN 114445073A CN 202011215819 A CN202011215819 A CN 202011215819A CN 114445073 A CN114445073 A CN 114445073A
- Authority
- CN
- China
- Prior art keywords
- transaction
- data packet
- information
- computer
- transaction data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 70
- 230000010365 information processing Effects 0.000 title claims abstract description 22
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 21
- 230000006870 function Effects 0.000 claims description 9
- 238000004891 communication Methods 0.000 claims description 7
- 230000007704 transition Effects 0.000 claims description 5
- 230000009286 beneficial effect Effects 0.000 abstract 1
- 238000012795 verification Methods 0.000 description 13
- 238000012545 processing Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000004590 computer program Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 5
- 239000004744 fabric Substances 0.000 description 5
- 230000007246 mechanism Effects 0.000 description 5
- 230000008901 benefit Effects 0.000 description 4
- 238000004806 packaging method and process Methods 0.000 description 3
- 238000012163 sequencing technique Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000003999 initiator Substances 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000001151 other effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3827—Use of message hashing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Finance (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Technology Law (AREA)
- Marketing (AREA)
- Economics (AREA)
- Computer Security & Cryptography (AREA)
- Computing Systems (AREA)
- Development Economics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present disclosure relates to a computer-implemented method, an information processing apparatus, and a storage medium for a two-layer chain network in a block chain network. According to one embodiment of the disclosure, the computer-implemented method includes: determining a linked list based on a plurality of transaction requests from the client node and including a plurality of transaction packets based on a common consensus algorithm for a plurality of relay nodes; determining a selected transaction data packet of the plurality of transaction data packets for which attestation information is to be generated by the relay node based on a common allocation rule of the plurality of relay nodes; attempting to generate proof information for a selected transaction data package for proving correctness of the transaction; and transmitting a combined data packet corresponding to the combination of the selected transaction data packet and the attestation information to a layer of link points in the blockchain network, in the event that the attestation information is successfully generated. The beneficial effects of the method, the device and the storage medium of the disclosure at least comprise: the expandability of the block chain architecture is improved.
Description
Technical Field
The present disclosure relates generally to blockchains, and more particularly, to a computer-implemented method, information processing apparatus, and storage medium for a two-layer chain network in a blockchain network.
Background
In recent years, in the field of finance, a blockchain technology has attracted attention. A blockchain may be viewed as a distributed database that operates in a decentralized manner. The blockchain technology realizes decentralized point-to-point transaction by means of data encryption, time stamping, distributed consensus, economic incentive and the like, thereby solving the problems of high cost, low efficiency, unsafe data storage and the like commonly existing in centralized institutions.
For blockchain frames such as the hyper book Fabric blockchain, there are currently some drawbacks: 1) the whole frame tends to be complex, a plurality of roles are contained in the whole network, different roles carry out independent work, in order to ensure the consistency of data on a block chain, a plurality of times of network transmission exist among the roles, and the performance of the whole network is limited along with the steps of executing and verifying data on the chain for a plurality of times, 2) because the super account book Fabric Block chain frame carries out data chaining based on three main steps of endorsement, consensus and submission, the read-write conflict problem of the data is brought, and the defect exists in realizing asset transfer based on an account model in the frame directly.
Disclosure of Invention
A brief summary of the disclosure is provided below in order to provide a basic understanding of some aspects of the disclosure. It should be understood that this summary is not an exhaustive overview of the disclosure. It is not intended to identify key or critical elements of the disclosure or to delineate the scope of the disclosure. Its sole purpose is to present some concepts in a simplified form as a prelude to the more detailed description that is discussed later.
According to one aspect of the disclosure, a computer-implemented method is provided. The computer-implemented method can be performed by each of a plurality of relay nodes of a two-tier link network of a blockchain network. The computer-implemented method includes: determining a linked list based on a plurality of transaction requests from at least one client node and including a plurality of transaction packets based on a common consensus algorithm for a plurality of relay nodes; determining a selected transaction packet of the plurality of transaction packets for which the attestation information is to be generated by the current relay node based on a common allocation rule of the plurality of relay nodes to enable the plurality of relay nodes to perform attestation information generation in parallel; attempting to generate proof information for a selected transaction data package for proving correctness of the transaction; and in the event of successful generation of the attestation information, sending a combined data packet corresponding to a combination of the selected transaction data packet and the attestation information to a layer of link points in the blockchain network to enable the layer of link nodes to generate a layer of link blocks corresponding to the selected transaction data packet based on the attestation information.
According to an aspect of the present disclosure, there is provided an information processing apparatus for serving as one relay node among a plurality of relay nodes of a two-layer chain in a blockchain network. The information processing apparatus includes: a memory having instructions stored thereon; and one or more processors in communication with the memory to execute the instructions retrieved from the memory, and the instructions cause the one or more processors to: determining a linked list based on a plurality of transaction requests from at least one client node and including a plurality of transaction packets based on a common consensus algorithm for a plurality of relay nodes; determining, based on a common allocation rule of the plurality of relay nodes, a selected transaction packet of the plurality of transaction packets for which the relay node is to generate the attestation information to enable the plurality of relay nodes to perform the attestation information generation in parallel; attempting to generate proof information for a selected transaction data package for proving correctness of the transaction; and in the event of successful generation of the attestation information, sending a combined data packet corresponding to a combination of the selected transaction data packet and the attestation information to a layer of link points in the blockchain network to enable the layer of link nodes to generate a layer of link blocks corresponding to the selected transaction data packet based on the attestation information.
According to another aspect of the present disclosure, there is provided a computer readable storage medium having a program stored thereon. The program causes a computer to act as one of a plurality of relay nodes of a two-tier chain in a blockchain network to: determining a linked list based on a plurality of transaction requests from at least one client node and including a plurality of transaction packets based on a common consensus algorithm for a plurality of relay nodes; determining, based on a common allocation rule of the plurality of relay nodes, a selected transaction packet of the plurality of transaction packets for which the relay node is to generate the attestation information to enable the plurality of relay nodes to perform the attestation information generation in parallel; attempting to generate proof information for a selected transaction data package for proving correctness of the transaction; and in the event of successful generation of the attestation information, sending a combined data packet corresponding to a combination of the selected transaction data packet and the attestation information to a layer of link points in the blockchain network to enable the layer of link nodes to generate a layer of link blocks corresponding to the selected transaction data packet based on the attestation information.
Advantageous effects of the computer-implemented method, the information processing apparatus, and the storage medium of the present disclosure include at least: the expandability of the block chain architecture is improved.
Drawings
The above and other objects, features and advantages of the present disclosure will be more readily understood from the following description of embodiments thereof with reference to the accompanying drawings. The drawings are only for the purpose of illustrating the principles of the disclosure. The dimensions and relative positioning of the elements in the figures are not necessarily drawn to scale. Like reference numerals may denote like features. In the drawings:
FIG. 1 shows an exemplary flow diagram of a computer-implemented method according to an embodiment of the present disclosure;
FIG. 2 shows an exemplary Mercker tree before and after a transaction;
FIG. 3 illustrates an information processing apparatus according to one embodiment of the present disclosure;
FIG. 4 shows an information processing apparatus according to one embodiment of the present disclosure;
FIG. 5 shows an exemplary block diagram of an information processing device according to one embodiment of the present disclosure; and
fig. 6 shows a schematic diagram of a blockchain system according to one embodiment of the present disclosure.
Detailed Description
Exemplary embodiments of the present disclosure will be described hereinafter with reference to the accompanying drawings. In the interest of clarity and conciseness, not all features of an actual embodiment are described in the specification. It will of course be appreciated that in the development of any such actual embodiment, numerous implementation-specific decisions may be made to achieve the developers' specific goals, such as compliance with system-related and business-related constraints, which will vary from one implementation to another.
Here, it should be further noted that, in order to avoid obscuring the present disclosure with unnecessary details, only the device structure closely related to the scheme according to the present disclosure is shown in the drawings, and other details not so related to the present disclosure are omitted.
It is to be understood that the disclosure is not limited to the described embodiments, as described below with reference to the drawings. In this context, embodiments may be combined with each other, features may be replaced or borrowed between different embodiments, one or more features may be omitted in one embodiment, where feasible.
Computer program code for carrying out operations for aspects of embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages.
The method of the present disclosure may be implemented by a circuit having a corresponding functional configuration. The circuitry includes circuitry for a processor.
Embodiments of the present disclosure may be implemented in computer hardware, firmware, or software, or in combinations of them, with digital electronic circuitry. Embodiments may be implemented using a computer program product such as the following: the computer program is tangibly embodied in an information carrier, such as a machine-readable medium, for execution by, or to control the operation of, data processing apparatus, e.g., a programmable processor, a computer, or multiple computers.
A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, subroutine, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.
In general, aspects of the present disclosure are based on a two-tier chain architecture of multiple relays. In particular, a consensus mechanism between two-layer chain relays is introduced to solve the trust problem between the relays, and the computing efficiency of the two-layer chain certification information is improved by using a parallel computing method.
One aspect of the disclosure provides a computer-implemented method. The computer-implemented method can be performed by each of a plurality of relay nodes of a two-tier link network of a blockchain network. The term "two-layer chain" (layer2 chain) is a relative term to "one-layer chain" (layer1 chain). The transaction data recorded on the chain of one layer is formal accepted transaction data. A layer of chains is also called a main chain (main chain), a top chain or an on-chain (on-chain). The double strand is also called an off-chain (off-chain) or a pull-down chain. The transaction data recorded on the two-layer chain needs to be uploaded to the one-layer chain and can become formal recognized transaction data after being verified by the nodes on the one-layer chain. The computer-implemented method involves a client node, a relay node of a two-tier link network, and a one-tier link node. There is a transmission of transaction information between these nodes. The transaction associated with the transaction information is a transaction using the same token. In other words, the computer-implemented method does not involve cross-chain transactions. The one-tier chain of the blockchain network involved in the computer-implemented method may be an ethernet blockchain or a hyper-ledger Fabric blockchain.
The computer-implemented method of the present disclosure is illustrated below with reference to FIG. 1.
Fig. 1 illustrates an exemplary flow diagram of a computer-implemented method 100 according to one embodiment of the present disclosure. The method 100 can be performed by each of a plurality of relay nodes (Nrel [0], Nrel [1], … …, Nrel [ j ], … …, Nrel [ jmax ], also abbreviated as { Nrel [ j ] }) of a two-layer chain network in a blockchain network Net. The blockchain network Net also includes a layer of chain networks. The one-layer chain network comprises a plurality of one-layer chain nodes which store formal account book data of the block chain. Each repeater node may locally maintain a complete merkel tree indicating the account balances of all users of the two-tier link network. The method 100 is exemplarily described below by taking a relay node Nrel [ j ] (also referred to as a "current relay node") in the plurality of relay nodes { Nrel [ j ] } as an executor of the method 100.
At step S101, a linked list based on a plurality of transaction requests (Req [0], Req [1], … …, Req [ i ], … …, Req [ imax ], also abbreviated as { Req [ i ] }) from at least one client node and including a plurality of transaction packets is determined based on a common consensus algorithm of a plurality of relay nodes { Nrel [ j ] }. A plurality of transaction requests { Req [ i ] } correspond to imax +1 transactions (Tx [0], Tx [1], … …, Tx [ i ], … …, Tx [ imax ], also abbreviated as { Tx [ i ] }) for the client. Each transaction request may include information regarding the payment account identification, the collection account identification, the signature of the transaction initiator, the token amount, and the like. The relay node Nrel [ j ] may obtain the plurality of transaction data packets by packaging transaction information included in the plurality of transaction requests based on the common consensus algorithm. Each transaction data packet includes transaction information for at least one transaction. Each transaction packet may correspond to a blockchain block. This means that in the two-layer chain network, after the transaction data packet and its certification information are finally uploaded to a layer link point of the main chain network by the relay node of the two-layer chain, the transaction data packet and its certification information will be constructed into a corresponding on-chain block and linked in the existing on-chain linked list under the condition of being certified by the layer link point. The multiple transaction requests received by the relay node Nrel j may come directly from the client node and/or from information forwarded by other relay nodes. Preferably the plurality of relay nodes are functionally peer nodes. A plurality of transaction packets (Pt [0], Pt [1], … …, Pt [ k ], … …, Pt [ kmax ], also abbreviated as { Pt [ k }) are linked together according to a predetermined rule to form a linked list. For example, the linked lists are arranged in transaction initiation chronological order. Since the same common consensus algorithm is used by the plurality of relay nodes, the linked lists determined by the relay nodes are the same for each relay node when the transaction requests are determined, or each relay node stores a copy of the same linked list.
The client node may send a transaction request including transaction information to at least one of the plurality of relay nodes through a customized API (Application Programming Interface). Since multiple repeater nodes are communicatively connected to each other, each repeater node will eventually know all transaction requests within the two-tier chain network over a period of time. The API is mainly used for packaging initial transaction information of a transaction occurring at a client node.
At step S103, a selected transaction packet Pt [ k' ] to be used by the current relay node Nrel [ j ] to generate the certification information is determined among the transaction packets { Pt [ k ] } based on a common allocation rule of the relay nodes { Nrel [ j ] }, so that the relay nodes can perform the certification information generation in parallel. A common allocation rule means that multiple relay nodes use the same allocation rule. For example, in a case where the number of the plurality of relay nodes is 6 and the number of the plurality of transaction data packets is 30, the 30 transaction data packets may be equally distributed (to be exact, selected) to the 6 relay nodes according to a predetermined rule, and each relay node is responsible for generation of the certification information of the 5 selected transaction data packets. After the linked list is determined, each relay node can basically and simultaneously select the transaction data packets, basically and simultaneously start to generate the certification information of the corresponding selected transaction data packets, and basically and simultaneously complete the generation of the certification information, so that the plurality of relay nodes can be considered to execute the generation of the certification information in parallel. For example, a remainder function is used to determine a selected transaction packet of the plurality of transaction packets for which the attestation information is to be generated by the current relay node based on the number kmax +1 of the plurality of transaction packets and the number jmax +1 of nodes of the plurality of relay nodes. For example, 100 packets may be numbered 0 to 99, 10 relay nodes may be numbered 0 to 9, and for the transaction packet Pt [11], since mod (11,10) is 1, the relay node Nrel [1] may be designated to generate the certification information of the transaction packet Pt [11 ]. That is, the common allocation rule may be: and x is the index number of the current relay node, y is the current transaction data packet to be selected, and z is the node number of the relay node, if mod (y, z) is x, the current transaction data packet to be selected is set as the selected transaction data packet aiming at the current relay node. Therefore, a plurality of transaction data packets can be divided into a plurality of matched data packet groups according to the number of the relay nodes, so that the proof information of the data packets in the corresponding data packet groups can be generated in parallel by each relay node, and the processing performance of the block chain architecture is improved. Specifically, as the certification information generation is a sub-process which consumes more time in the block generation process, a plurality of relay nodes are arranged to process the certification information generation in parallel, so that the amount of concurrent transactions which can be processed by the whole block chain architecture is increased, and the expandability of the block chain architecture is improved.
In step S105, it is attempted to generate proof information Infp [ k '] for proving the correctness of the transaction of the selected transaction packet Pt [ k' ]. The attestation information may include hash attestations based on root hash values (root hashes) of merkel (Merkle) trees. Since the Mercker tree records the balance status of an account, it is also called status Mercker tree. The hash attestation may include an old merkel root hash value (old merkel root hash) and a new merkel root hash value (new merkel root hash). Although the hash certification takes less time to generate and is faster in generation speed, there is a drawback that when the main chain verifies the authenticity and/or compliance of a transaction included in a combined data packet sent by a node in a two-layer chain network by using the hash certification, the hash certification puts a large pressure on verification of the main chain and requires relatively much verification time. The backbone wants to verify that the hash certificate is correct, the associated transaction must be re-verified and executed, and the complete merkel tree needs to be saved as well. This is not very economical for backbones where computational resources are tight.
Preferably, the certification information may further include a zero knowledge certification in addition to the hash certification. The zero knowledge proof is configured to prove, or, in other words, the zero knowledge proof requires proof of several constraints as follows: the signature of each transaction included in the selected transaction data packet is correct; selecting the account involved in the transaction included in the transaction data packet to have a correct balance; the state transition corresponding to the selected transaction data packet is correct; and the new merkel root hash value is correct. The proof information for proving correctness of the transaction attempting to generate the selected transaction data packet may include: verifying whether the signature for each transaction included in the selected data packet is correct; and generating a new Merck tree by modifying the balance of the corresponding account (corresponding to the executed transaction) in case the signature is correct. The proof information for proving the correctness of the transaction attempting to generate the selected transaction data package may further include: verifying that the old mercker tree is authentic and that the new mercker tree is authentic. When the repeater node performs the operations of signature verification, transaction execution, verification of the old mercker tree, verification of the new mercker tree (associated with the constraints mentioned above), it is able to generate correct certification information. After the intelligent contract on the chain of one layer verifies the certification information, whether the operation of the relay node is correct can be confirmed. After verification, the corresponding transaction data packet can be constructed into an on-chain block and linked into the current on-chain linked list. In other words, after having a zero knowledge proof, the backbone verification process may only include verifying the zero knowledge proof without verifying a hash proof included in the transaction data packet.
Further, the transaction data may include certification information that may be zero knowledge certification. In other words, the attestation information may be a zero knowledge attestation without a hash attestation. This will be advantageous to reduce the size of the uploaded combined data packet. Of course, if the combined data includes hash proofs, the backbone node may obtain more information about the transaction and may apply more optional operations to the transaction data. The two-layer chain information proof mechanism combining the Hash proof and the zero knowledge proof can fully ensure the data consistency and the safety of the two-layer chain and the main chain.
Since the verification complexity of the zero knowledge proof is low and the time consumption is low, the intelligent contract of the one-layer chain can verify whether the transaction data packet (transaction block) sent by the relay node of the two-layer chain network is correct or not through the zero knowledge proof only by spending little computing resources, and does not need to verify each transaction and whether the state transition is correct or not again, so that the transaction processing efficiency of the block chain architecture of the disclosure can be greatly improved. In other words, the zero-knowledge proof-based proof scheme of the present disclosure can shift the main computational cost to a two-tier chain, allowing the main chain to more easily validate transaction blocks.
In step S107, it is determined whether the generation of the certification information is successful. If the determination result is yes, go to step S109; if the determination result is "no", step S111 is performed.
In step S109, a combined packet Pc [ k '] corresponding to the combination of the selected transaction packet Pt [ k' ] and the certification information Infp [ k '] is transmitted to one layer of link nodes in the block chain network Net so that the one layer of link nodes can generate one layer of link blocks B [ k' ] corresponding to the selected transaction packet Pt [ k '] based on the certification information Infp [ k' ]. Thereby completing the verification and storage of block B k'. The combined data packet may be a compressed data packet obtained by compressing the selected transaction data packet and the certification information. The first-layer chain node ensures the consistency and the safety of the transaction data sent from the second-layer chain network through the verification certification information. A layer of chain nodes may generate a block B k' based on an intelligent contract.
In step S111, error processing is performed. Attempting to generate the attestation information for the selected transaction data packet includes verifying the selected transaction data packet. If the verification result indicates that there is an error in the transaction data packet, an indication may be output indicating that the generation of the attestation information failed. Based on the identification, the relay node Nrel [ j ] performs error handling. Validating the selected transaction data package may include: when an error is found in the selected transaction data packet, error information regarding the error is broadcast to other relay nodes of the plurality of relay nodes. Other relay nodes may optionally perform data rollback and the like until there are no false transactions in the linked list. The error handling includes at least one of: broadcast error information and data roll-back. In the event that the current relay node finds that the current transaction packet is erroneous, the relay node may verify that it proves whether the last transaction packet generated by the current relay node was correct to determine valid transaction packets in the linked list that can be approved. Valid transaction packets may also be determined by voting by multiple repeater nodes.
In one embodiment, the relay node performing the method 100 may be a layer of chain ordering nodes. Therefore, the consensus mechanism of the one-layer chain (main chain) can be multiplexed, and the transaction data package meeting the common consensus condition of the two-layer chain is carried out by utilizing the originally wasted resources. In a layer of chain of a Fabric block chain of a super ledger, common nodes are usually different from verification storage nodes of the ledger, the common nodes only perform operations related to common ordering, and all the common nodes are also called ordering nodes. Usually, the computation resources of the system of the sequencing nodes have redundancy, and the consensus mechanism adopted by the one-layer chain is usually a choice after comprehensive consideration of performance and security, so that directly utilizing the sequencing nodes of the one-layer chain as the relay nodes and multiplexing the consensus mechanism of the one-layer chain is a very efficient scheme. This achieves that the common consensus algorithm of the relay nodes is the same as the one-tier chain consensus algorithm.
In the present disclosure, the functions of the relay node include: receiving a transaction request, verifying the transaction, performing the transaction in the layer two chain (modifying the layer two chain balance data), generating attestation information, and sending attestation information.
As can be seen, for the method 100, since a plurality of relay nodes that generate the certification information in parallel are arranged in the two-layer chain network, the capability of processing the concurrent transaction of the blockchain architecture is improved, and the performance of the blockchain architecture is improved. Meanwhile, as a plurality of repeater nodes share the original time-consuming certification generation, compared with the situation that only one repeater node is used for serially generating the certification information of all transaction data packets of the whole linked list, the scheme of the disclosure has the advantages of obvious speed advantage and expansion capability, and can also properly reduce the hardware configuration requirement of the repeater node.
The computer-implemented method of the present disclosure is designed to be executable by each relay node of a plurality of relay nodes of a two-tier link network of a blockchain network. Since the functions performed by the relay nodes are the same, it can be considered that the computer-implemented method can be performed in parallel by each of the relay nodes of the plurality of relay nodes of the two-tier link network in the block link network. In addition, although the computer-implemented method of the present disclosure is designed such that a plurality of relay nodes can perform certification information generation in parallel, in the case where the transaction request amount per unit time is not large, if a single relay node can process all transaction requests, other relay nodes will temporarily not start the parallel execution certification information generation function, that is, other relay nodes have the parallel execution certification information generation capability, but call it when necessary.
Further description of the hash attestation is provided below. The relay nodes of the two-layer chain network locally store a complete merkel tree. The lowest node of the Mercker tree is used for storing account balance information of all users on a two-layer chain. Upon receiving a transaction request from a client node, the relay node, in addition to verifying and executing the transaction (modifying the balance of the underlying node record of the mercker tree), generates and verifies a hash value for the root node corresponding to the mercker tree. The hash values of the old merck tree before the transaction and the new merck tree after the transaction together form a hash certificate.
Fig. 2 shows an exemplary merkel tree before and after a transaction, which may be a merkel tree maintained by a relay node of a two-tier chain network. In FIG. 2, the top Merck tree 20 is the Merck tree before transaction, and the bottom Merck tree 20' is the Merck tree after transaction. Illustratively, there are 2 transactions that occur, with account 0xa 1 (account id) paying 10 tokens to account 0xfd1 and account 0xba2 paying 10 tokens to account 0xd1 a. By way of example, a two-tier chain network includes 4 accounts, 0xab1, 0xfd1, 0xba2, and 0xd1 a. The bottommost node 205 of the merkel tree 20 records the account balance. The intermediate node 203 of the merkel tree 20 records a hash value determined based on its lower adjacent two nodes. The topmost node 201 of the merkel tree 20, which is marked with "Root", records the merkel Root hash value of the merkel tree 20. After 2 transactions have occurred, the Merck tree 20 changes to Merck tree 20'. This process may be referred to as state transition. As shown in FIG. 2, the balance shown by the lowest node of the Mercker tree 20' has changed accordingly. Such changes ultimately result in changes to the merkel root hash value. It is clear that if the account balance is tampered with, the account balance cannot be verified through the merkel root hash value. Thus, the merkel root hash value may serve as proof information to prove authenticity and/or correctness of the transaction. The relay node can package and submit the payment list on the two-layer chain and the corresponding old and new Mercker root hash value as a proof to the main chain. The backbone can verify whether the merkel root hash is correct and, if so, store the data in the on-chain database. If the data submitted to the main chain is attached with zero knowledge proof, only the zero knowledge proof needs to be verified, and the Mercker root hash does not need to be verified. In the actual transaction scenario to be explained, the number of layers of the merkel tree may be more than three, since there are many (e.g., more than 4) accounts in the two-layer chain network. The merkel tree in fig. 2 has only a three-layer structure, which is merely exemplary.
The present disclosure also provides an information processing apparatus for serving as one of a plurality of relay nodes of a two-layer chain in a blockchain network. An exemplary description is provided below with reference to fig. 3. Fig. 3 shows an information processing apparatus 300 that may be used to act as one of a plurality of relay nodes of a two-tier chain in a blockchain network, according to one embodiment of the present disclosure. The information processing apparatus 300 includes: linked list determining section 301, selecting section 303, certification information generating section 305, transmitting section 309, and error processing section 311. The linked list determining unit 301 is configured to determine a linked list based on a plurality of transaction requests from at least one client node and including a plurality of transaction data packets based on a common consensus algorithm of a plurality of relay nodes. The selecting unit 303 is configured to determine, based on a common allocation rule of the plurality of relay nodes, a selected transaction packet of the plurality of transaction packets for which the relay node is to generate the certification information, so that the plurality of relay nodes can perform the certification information generation in parallel. The proof information generating unit 305 is used to attempt to generate proof information for proving the correctness of the transaction for the selected transaction data packet. The transmitting unit 309 is configured to, in a case where the certification information is successfully generated, transmit a combined data packet corresponding to a combination of the selected transaction data packet and the certification information to a one-layer link node in the blockchain network so that the one-layer link node can generate a one-layer link block corresponding to the selected transaction data packet based on the certification information. The error processing unit 311 is configured to perform error processing in a case where generation of the certification information fails. Further configuration of the information processing apparatus can be found in the description of the method 100 of the present disclosure.
The present disclosure also provides an information processing apparatus 400 for serving as one of a plurality of relay nodes of a two-tier chain in a blockchain network. An exemplary description is provided below with reference to fig. 4. Fig. 4 illustrates an information processing apparatus 400 that may be used to act as one of a plurality of relay nodes of a two-tier chain in a blockchain network, according to one embodiment of the present disclosure. The information processing apparatus 400 includes: a memory 401 having instructions stored thereon; and one or more processors 403, the one or more processors 403 capable of communicating with the memory to execute the instructions retrieved from the memory, and the instructions cause the one or more processors to: determining a linked list based on a plurality of transaction requests from at least one client node and including a plurality of transaction packets based on a common consensus algorithm for a plurality of relay nodes; determining, based on a common allocation rule of the plurality of relay nodes, a selected transaction packet of the plurality of transaction packets for which the relay node is to generate the attestation information to enable the plurality of relay nodes to perform the attestation information generation in parallel; attempting to generate proof information for a selected transaction data package for proving correctness of the transaction; and in the event of successful generation of the attestation information, sending a combined data packet corresponding to a combination of the selected transaction data packet and the attestation information to a layer of link points in the blockchain network to enable the layer of link nodes to generate a layer of link blocks corresponding to the selected transaction data packet based on the attestation information. Further configuration of the information processing apparatus can be found in the description of the method 100 of the present disclosure.
One aspect of the present disclosure provides a computer-readable storage medium having a program stored thereon. The program causes a computer to act as one of a plurality of relay nodes of a two-tier chain in a blockchain network to: determining a linked list based on a plurality of transaction requests from at least one client node and including a plurality of transaction packets based on a common consensus algorithm for a plurality of relay nodes; determining, based on a common allocation rule of the plurality of relay nodes, a selected transaction packet of the plurality of transaction packets for which the relay node is to generate the attestation information to enable the plurality of relay nodes to perform the attestation information generation in parallel; attempting to generate proof information for a selected transaction data package for proving correctness of the transaction; and in the event of successful generation of the attestation information, sending a combined data packet corresponding to a combination of the selected transaction data packet and the attestation information to a layer of link points in the blockchain network to enable the layer of link nodes to generate a layer of link blocks corresponding to the selected transaction data packet based on the attestation information.
According to an aspect of the present disclosure, there is also provided an information processing apparatus.
Fig. 5 is an exemplary block diagram of an information processing apparatus 500 according to one embodiment of the present disclosure. In fig. 5, a Central Processing Unit (CPU)501 performs various processes in accordance with a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 to a Random Access Memory (RAM) 503. The RAM 503 also stores data and the like necessary when the CPU 501 executes various processes, as necessary.
The CPU 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An input/output interface 505 is also connected to bus 504.
The following components are connected to the input/output interface 505: an input portion 506 including a soft keyboard and the like; an output portion 507 including a display such as a Liquid Crystal Display (LCD) and a speaker; a storage portion 508 such as a hard disk; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet, a local area network, a mobile network, or a combination thereof.
A driver 510 is also connected to the input/output interface 505 as necessary. A removable medium 511 such as a semiconductor memory or the like is mounted on the drive 510 as needed, so that the program read therefrom is mounted on the storage section 508 as needed.
The CPU 501 may run a program for one relay node among a plurality of relay nodes of a two-layer chain network in a block chain network. The program can realize the functions of the method 100.
The present disclosure provides a block chain system comprising a plurality of relay nodes in a two-layer chain network. This is described below with reference to fig. 6. Fig. 6 shows a schematic diagram of a blockchain system 600 according to one embodiment of the present disclosure. The blockchain system 600 includes a one-layer chain network Net1 and a two-layer chain network Net2 communicatively connected. The one-tier chain network includes a plurality of one-tier chain nodes nos. A layer of chain node nos may be configured to store a layer of chain blocks that record ledger information and/or validate received information. A plurality of layer one link nodes may communicate with each other through various known network connections. The two-tier chain network Net2 includes a plurality of relay nodes Nrel and a plurality of client nodes Ct. Multiple relay nodes may communicate with each other, and client nodes and relay nodes, through various known network connections. Each relay node may be configured to generate, in parallel, attestation information for selected transaction packets and send the selected transaction packets containing the transaction information and their attestation information to a layer of link points in a layer of the link network to record transactions within the selected transaction packets in a layer of the link blocks upon successful verification. The specific implementation forms of the client node and the layer of chain nodes to be described are not limited to the example forms shown in the figures. For example, the client node may be a mobile communication device such as a smartphone. The first client node may be of a different type than the second client node. For example, the first client node is a desktop computer and the second client node is a tablet computer.
Aspects of the present disclosure include generating attestation information in parallel using a plurality of layer two link repeater nodes. This is advantageous: the method has the advantages of improving the overall transaction processing speed of the blockchain architecture, improving the expandability of the blockchain architecture, improving the performance of the blockchain system, relieving transaction concurrency conflicts and relieving data read-write conflicts.
As described above, in accordance with the present disclosure, principles are provided for using a plurality of layer two link relay nodes. It is to be noted that the effects of the scheme of the present disclosure are not necessarily limited to the above-described effects, and any of the effects shown in the present specification or other effects that can be understood from the present specification may be achieved in addition to or instead of the effects described in the preceding paragraphs.
While the invention has been described in terms of specific embodiments thereof, it will be appreciated that those skilled in the art will be able to devise various modifications (including combinations and substitutions of features between the embodiments, where appropriate), improvements and equivalents of the invention within the spirit and scope of the appended claims. Such modifications, improvements and equivalents are also intended to be included within the scope of the present invention.
It should be emphasized that the term "comprises/comprising" when used herein, is taken to specify the presence of stated features, elements, steps or components, but does not preclude the presence or addition of one or more other features, elements, steps or components.
Furthermore, the methods of the embodiments of the present invention are not limited to being performed in the time sequence described in the specification or shown in the drawings, and may be performed in other time sequences, in parallel, or independently. Therefore, the order of execution of the methods described in this specification does not limit the technical scope of the present invention.
Supplementary note
1. A computer-implemented method, wherein the computer-implemented method is executable by each relay node of a plurality of relay nodes of a two-tier chain network of a blockchain network, and wherein the computer-implemented method comprises:
determining, based on a common consensus algorithm for the plurality of relay nodes, a linked list based on a plurality of transaction requests from at least one client node and comprising a plurality of transaction data packets;
determining, based on a common allocation rule of the plurality of relay nodes, a selected transaction packet of the plurality of transaction packets for which attestation information is to be generated by a current relay node to enable the plurality of relay nodes to perform attestation information generation in parallel;
attempting to generate proof information for the selected transaction data packet for proving correctness of the transaction; and
upon successful generation of the attestation information, sending a combined data packet corresponding to a combination of the selected transaction data packet and the attestation information to a layer one link node in the blockchain network to enable the layer one link node to generate a layer one link block corresponding to the selected transaction data packet based on the attestation information.
2. The computer-implemented method according to supplementary note 1, wherein the plurality of transaction data packages are obtained by transaction packaging the plurality of transaction requests based on the common consensus algorithm.
3. The computer-implemented method of supplementary note 1, wherein the selected transaction data packet is the same token used for the transaction recorded by the one-tier chain block record.
4. The computer-implemented method of supplementary note 3, wherein a layer of links of the blockchain network is an etherhouse blockchain or a hyper-ledger Fabric blockchain.
5. The computer-implemented method according to supplementary note 1, wherein the certification information includes hash certification based on a root hash value of the merkel tree.
6. The computer-implemented method according to supplementary note 5, wherein the hash attestation includes an old mercker root hash value and a new mercker root hash value.
7. The computer-implemented method of supplementary note 6, wherein the attestation information further comprises a zero knowledge attestation.
8. The computer-implemented method of supplementary note 7, wherein the zero knowledge proof is configured to be able to prove that:
the signature of each transaction included in the selected transaction data packet is correct;
the balance of the account involved in the transaction included in the selected transaction data packet is correct;
the state transition corresponding to the selected transaction data packet is correct; and
the new merkel root hash value is correct.
9. The computer-implemented method of supplementary note 1, wherein the current relay node executing the computer-implemented method is a one-tier chain-sequencing node.
10. The computer-implemented method of supplementary note 9, wherein the common consensus algorithm is the same as a one-tier chain consensus algorithm.
11. The computer-implemented method according to supplementary note 1, wherein the common allocation rule includes: determining, using a remainder function, the selected one of the plurality of transaction packets for which the attestation information is to be generated by the current relay node based on a number of packets of the plurality of transaction packets and a number of nodes of the plurality of relay nodes.
12. The computer-implemented method of supplementary note 1, wherein attempting to generate the proof information for proving the correctness of the transaction of the selected transaction data package comprises verifying the selected transaction data package.
13. The computer-implemented method of supplementary note 12, wherein validating the selected transaction data package comprises: broadcasting error information regarding the error to other relay nodes of the plurality of relay nodes when the error is found in the selected transaction data packet.
14. The computer-implemented method according to supplementary note 1, wherein attempting to generate the proof information for proving the correctness of the transaction of the selected transaction data packet comprises:
verifying whether the signature of each transaction included in the selected data packet is correct; and
in case the signature is correct, a new merkel tree is generated by modifying the balance of the corresponding account.
15. The computer-implemented method of supplementary note 1, wherein the combined data package includes a payment account identification, a collection account identification, and a token amount for each transaction included in the selected transaction data package.
16. An information processing apparatus for serving as one of a plurality of relay nodes of a two-layer chain in a blockchain network, comprising:
a memory having instructions stored thereon; and
one or more processors in communication with the memory to execute the instructions retrieved from the memory, and the instructions cause the one or more processors to:
determining, based on a common consensus algorithm for the plurality of relay nodes, a linked list based on a plurality of transaction requests from at least one client node and comprising a plurality of transaction data packets;
determining, based on a common allocation rule of the plurality of relay nodes, a selected transaction packet of the plurality of transaction packets for which attestation information is to be generated by the relay node to enable the plurality of relay nodes to perform attestation information generation in parallel;
attempting to generate proof information for the selected transaction data packet for proving correctness of the transaction; and
upon successful generation of the attestation information, sending a combined data packet corresponding to a combination of the selected transaction data packet and the attestation information to a layer one link node in the blockchain network to enable the layer one link node to generate a layer one link block corresponding to the selected transaction data packet based on the attestation information.
17. A computer-readable storage medium having a program stored thereon, the program causing a computer to function as one of a plurality of relay nodes of a two-tier chain in a blockchain network to:
determining, based on a common consensus algorithm for the plurality of relay nodes, a linked list based on a plurality of transaction requests from at least one client node and comprising a plurality of transaction data packets;
determining, based on a common allocation rule of the plurality of relay nodes, a selected transaction packet of the plurality of transaction packets for which attestation information is to be generated by the relay node to enable the plurality of relay nodes to perform attestation information generation in parallel;
attempting to generate proof information for the selected transaction data packet for proving correctness of the transaction; and
upon successful generation of the attestation information, sending a combined data packet corresponding to a combination of the selected transaction data packet and the attestation information to a layer one link node in the blockchain network to enable the layer one link node to generate a layer one link block corresponding to the selected transaction data packet based on the attestation information.
Claims (10)
1. A computer-implemented method, wherein the computer-implemented method is executable by each relay node of a plurality of relay nodes of a two-tier chain network of a blockchain network, and wherein the computer-implemented method comprises:
determining, based on a common consensus algorithm for the plurality of relay nodes, a linked list based on a plurality of transaction requests from at least one client node and comprising a plurality of transaction data packets;
determining, based on a common allocation rule of the plurality of relay nodes, a selected transaction packet of the plurality of transaction packets for which attestation information is to be generated by a current relay node to enable the plurality of relay nodes to perform attestation information generation in parallel;
attempting to generate proof information for the selected transaction data packet for proving correctness of the transaction; and
upon successful generation of the attestation information, sending a combined data packet corresponding to a combination of the selected transaction data packet and the attestation information to a layer one link node in the blockchain network to enable the layer one link node to generate a layer one link block corresponding to the selected transaction data packet based on the attestation information.
2. The computer-implemented method of claim 1, wherein the selected transaction data packet and the layer chain block record transactions for tokens using the same type of block chain.
3. The computer-implemented method of claim 1, wherein the attestation information comprises hashed attestation based on a root hash value of a state merkel tree.
4. The computer-implemented method of claim 3, wherein the hash attestation includes an old Mercker root hash value and a new Mercker root hash value.
5. The computer-implemented method of claim 4, wherein the attestation information further comprises a zero knowledge attestation.
6. The computer-implemented method of claim 5, wherein the zero-knowledge proof is configured to be able to prove that:
the signature of each transaction included in the selected transaction data packet is correct;
the balance of the account involved in the transaction included in the selected transaction data packet is correct;
the state transition corresponding to the selected transaction data packet is correct; and
the new merkel root hash value is correct.
7. The computer-implemented method of claim 1, wherein the current relay node performing the computer-implemented method is a level of chain ordering nodes.
8. The computer-implemented method of claim 1, wherein the common allocation rule comprises: determining, using a remainder function, the selected one of the plurality of transaction packets for which the attestation information is to be generated by the current relay node based on a number of packets of the plurality of transaction packets and a number of nodes of the plurality of relay nodes.
9. An information processing apparatus for serving as one of a plurality of relay nodes of a two-layer chain in a blockchain network, comprising:
a memory having instructions stored thereon; and
one or more processors in communication with the memory to execute the instructions retrieved from the memory, and the instructions cause the one or more processors to:
determining, based on a common consensus algorithm for the plurality of relay nodes, a linked list based on a plurality of transaction requests from at least one client node and comprising a plurality of transaction data packets;
determining, based on a common allocation rule of the plurality of relay nodes, a selected transaction packet of the plurality of transaction packets for which attestation information is to be generated by the relay node to enable the plurality of relay nodes to perform attestation information generation in parallel;
attempting to generate proof information for the selected transaction data packet for proving correctness of the transaction; and
upon successful generation of the attestation information, send a combined data packet corresponding to a combination of the selected transaction data packet and the attestation information to a layer of link nodes in the blockchain network to enable the layer of link nodes to generate a layer of link blocks corresponding to the selected transaction data packet based on the attestation information.
10. A computer-readable storage medium having a program stored thereon, the program causing a computer to function as one of a plurality of relay nodes of a two-tier chain in a blockchain network to:
determining, based on a common consensus algorithm for the plurality of relay nodes, a linked list based on a plurality of transaction requests from at least one client node and comprising a plurality of transaction data packets;
determining, based on a common allocation rule of the plurality of relay nodes, a selected transaction packet of the plurality of transaction packets for which attestation information is to be generated by the relay node to enable the plurality of relay nodes to perform attestation information generation in parallel;
attempting to generate proof information for the selected transaction data packet for proving correctness of the transaction; and
upon successful generation of the attestation information, sending a combined data packet corresponding to a combination of the selected transaction data packet and the attestation information to a layer one link node in the blockchain network to enable the layer one link node to generate a layer one link block corresponding to the selected transaction data packet based on the attestation information.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011215819.1A CN114445073A (en) | 2020-11-04 | 2020-11-04 | Computer-implemented method, information processing apparatus, and storage medium |
| JP2021163578A JP2022075522A (en) | 2020-11-04 | 2021-10-04 | Method executed by computer, information processing device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011215819.1A CN114445073A (en) | 2020-11-04 | 2020-11-04 | Computer-implemented method, information processing apparatus, and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114445073A true CN114445073A (en) | 2022-05-06 |
Family
ID=81361123
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011215819.1A Pending CN114445073A (en) | 2020-11-04 | 2020-11-04 | Computer-implemented method, information processing apparatus, and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| JP (1) | JP2022075522A (en) |
| CN (1) | CN114445073A (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114445073A (en) * | 2020-11-04 | 2022-05-06 | 富士通株式会社 | Computer-implemented method, information processing apparatus, and storage medium |
| CN116127148B (en) * | 2023-04-04 | 2023-07-21 | 之江实验室 | Data trusted storage method and device, storage medium and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019147295A1 (en) * | 2018-01-29 | 2019-08-01 | Ubiquicorp Limited | Proof of majority block consensus method for generating and uploading a block to a blockchain |
| CN110400221A (en) * | 2018-09-29 | 2019-11-01 | 腾讯科技（深圳）有限公司 | Data processing method, system, storage medium and computer equipment |
| CN111448781A (en) * | 2019-07-11 | 2020-07-24 | 阿里巴巴集团控股有限公司 | Shared blockchain data storage |
| JP2022075522A (en) * | 2020-11-04 | 2022-05-18 | 富士通株式会社 | Method executed by computer, information processing device and storage medium |
-
2020
- 2020-11-04 CN CN202011215819.1A patent/CN114445073A/en active Pending
-
2021
- 2021-10-04 JP JP2021163578A patent/JP2022075522A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019147295A1 (en) * | 2018-01-29 | 2019-08-01 | Ubiquicorp Limited | Proof of majority block consensus method for generating and uploading a block to a blockchain |
| CN110400221A (en) * | 2018-09-29 | 2019-11-01 | 腾讯科技（深圳）有限公司 | Data processing method, system, storage medium and computer equipment |
| CN111448781A (en) * | 2019-07-11 | 2020-07-24 | 阿里巴巴集团控股有限公司 | Shared blockchain data storage |
| JP2022075522A (en) * | 2020-11-04 | 2022-05-18 | 富士通株式会社 | Method executed by computer, information processing device and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 张奥 等: ""区块链隐私保护研究与实践综述"", 《软件学报》, no. 05, 15 May 2020 (2020-05-15), pages 170 - 198 * |
Also Published As
| Publication number | Publication date |
|---|---|
| JP2022075522A (en) | 2022-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10965446B2 (en) | Blockchain-based automated user matching | |
| CN110599143B (en) | Data processing method, related device and medium | |
| CN110442652B (en) | Cross-chain data processing method and device based on block chain | |
| US11153069B2 (en) | Data authentication using a blockchain approach | |
| WO2020258848A1 (en) | Method and apparatus for cross-chain transmission of resources | |
| CN110599177A (en) | Transaction verification method and related equipment | |
| CN111431903B (en) | Cross-link relay method, device and computer readable storage medium | |
| US11790363B2 (en) | Cryptocurrency storage distribution | |
| US10693646B2 (en) | Event execution using a blockchain approach | |
| JP2021533502A (en) | Transaction verification methods, devices, storage media and electronic devices | |
| EP3739538A1 (en) | System and method of supporting reflection of transactions between blockchain networks | |
| US20230275771A1 (en) | Pre-execution of block chain transaction in parallel during block consensus | |
| WO2022000482A1 (en) | System and method for providing privacy and security protection in blockchain-based private transactions | |
| CN114445073A (en) | Computer-implemented method, information processing apparatus, and storage medium | |
| CN115701078B (en) | Cross-chain transaction processing method, device, electronic equipment and storage medium | |
| CN113128998B (en) | Service processing method, device and system of block chain system | |
| CN114820181A (en) | Method, apparatus and storage medium for processing transactions | |
| CN116827957B (en) | Information processing method, device, equipment and medium based on multi-block chain | |
| CN114785776B (en) | Blockchain-based clearing system and blockchain-based clearing method | |
| CN114629663B (en) | Block chain-based digital commodity transaction method and device | |
| CN117376366A (en) | Block chain transaction processing method, device, medium and electronic equipment | |
| CN114782032A (en) | Digital RMB payment method, hard wallet and readable storage medium | |
| CN114140118A (en) | Distributed accounting method and device and computer readable medium | |
| US20240223388A1 (en) | Method and system for atomic, consistent and accountable cross-chain rewriting | |
| Scaffino et al. | Alba: The Dawn of Scalable Bridges for Blockchains |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |