CN110933022A - Block processing method and device, computer equipment and storage medium - Google Patents

Block processing method and device, computer equipment and storage medium Download PDF

Info

Publication number
CN110933022A
CN110933022A CN201910964135.2A CN201910964135A CN110933022A CN 110933022 A CN110933022 A CN 110933022A CN 201910964135 A CN201910964135 A CN 201910964135A CN 110933022 A CN110933022 A CN 110933022A
Authority
CN
China
Prior art keywords
data
peer node
node
peer
block
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
Application number
CN201910964135.2A
Other languages
Chinese (zh)
Inventor
冯世伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
OneConnect Smart Technology Co Ltd
OneConnect Financial Technology Co Ltd Shanghai
Original Assignee
OneConnect Financial Technology Co Ltd Shanghai
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by OneConnect Financial Technology Co Ltd Shanghai filed Critical OneConnect Financial Technology Co Ltd Shanghai
Priority to CN201910964135.2A priority Critical patent/CN110933022A/en
Publication of CN110933022A publication Critical patent/CN110933022A/en
Priority to PCT/CN2020/085562 priority patent/WO2021068477A1/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/12—Applying verification of the received information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a block processing method, a block processing device, computer equipment and a storage medium, which are used for solving the problems that a peer node is high in work and burden, occupies too much network resources and is low in network resource utilization rate. The method comprises the following steps: the orderer node packs the transaction data corresponding to each peer node fed back by the transaction terminal into an original block, each peer node is a peer node corresponding to the same block chain channel in the block chain network, and the transaction data is generated in the block chain channel; the method comprises the steps of segmenting an original block to obtain a plurality of data segments, wherein each data segment comprises transaction data corresponding to at least one peer node; and sending the first data fragment to the first peer node.

Description

Block processing method and device, computer equipment and storage medium
Technical Field
The present invention relates to the field of block chain technologies, and in particular, to a block processing method and apparatus, a computer device, and a storage medium.
Background
A blockchain is generally understood to be a distributed ledger, which is essentially a distributed database. In the existing blockchain network, each peer node needs to receive a completed block, and needs to verify transactions and blocks occurring in each blockchain network. The traditional method is that a transaction terminal initiates a transaction, a peer node returns a transaction result to the transaction terminal after executing the transaction, the corresponding transaction results of all peer nodes of a block chain are packaged to generate a complete block through an orderer node, the block is transmitted to each node in a block chain network, the block is verified by each node, and finally the verified block is written into a block file by each node. It can be seen that, in the above conventional method, each peer node needs to verify the blocks generated by all transactions in the blockchain, each peer node has repeated verification work, the peer node has a large work and burden and needs to occupy too much network resources, and the network resource utilization rate is low.
Disclosure of Invention
Embodiments of the present invention provide a block processing method and apparatus, a computer device, and a storage medium, which are used to solve the problems that a peer node has a large work and burden, occupies too many network resources, and has a low network resource utilization rate.
A method of block processing, applied to an orderer node in a blockchain network, the blockchain network further including a transaction terminal and a plurality of peer nodes, the method comprising:
the orderer node packs transaction data corresponding to each peer node fed back by a transaction terminal into an original block, each peer node is a peer node corresponding to the same block chain channel in the block chain network, and the transaction data is generated in the block chain channel;
the orderer node segments the original block to obtain a plurality of data segments, wherein each data segment comprises transaction data corresponding to at least one peer node in each peer node;
the orderer node sends the first data fragment to a first peer node so that the first peer node generates a final block according to the first data fragment, a first verification result corresponding to the first data fragment data, a second data fragment shared by a second peer node and second verification result data, and writes the final block into a block file corresponding to the first peer node;
the first data fragment comprises at least one data fragment of the multiple data fragments, the first peer node is one peer node of peer nodes corresponding to the same blockchain channel, the second data fragment is other data fragments except the first data fragment of the multiple data fragments, and the second peer node is a peer node of each peer node and is distributed to the second data fragment.
A method of block processing applied to a first peer node in a blockchain network, the blockchain network further comprising an orderer node and a transaction terminal, the method comprising:
a first peer node receives a first data fragment sent by the orderer node, wherein the first data fragment comprises at least one data fragment in a plurality of data fragments, the data fragments are obtained by fragmenting an original block for the orderer node, the original block is formed by packaging transaction data corresponding to each peer node fed back by the transaction terminal by the orderer node, each peer node is a peer node corresponding to the same block chain channel in the block chain network, the transaction data is generated in the block chain channel, and the first peer node is one of the peer nodes corresponding to the same block chain channel;
the first peer node verifies the validity of the transaction data corresponding to the first data fragment to obtain first verification result data corresponding to the first data fragment;
the first peer node receives a second data fragment and second verification result data fed back by a second peer node, wherein the second data fragment is the other data fragments except the first data fragment in the multiple data fragments, and the second peer node is a peer node distributed to the second data fragment in each peer node;
the first peer node generates a final block according to the first and second data fragments and the first and second verification result data;
and the first peer node writes the final block into a block file corresponding to the first peer node.
A block processing apparatus applied to an orderer node in a blockchain network, the blockchain network further comprising a transaction terminal and a plurality of peer nodes, the block processing apparatus comprising:
the system comprises a packaging module, a processing module and a processing module, wherein the packaging module is used for packaging transaction data corresponding to each peer node fed back by a transaction terminal into an original block, each peer node is a peer node corresponding to the same blockchain channel in the blockchain network, and the transaction data is generated in the blockchain channel;
a slicing module, configured to slice the original block to obtain multiple data slices, where each data slice includes transaction data corresponding to at least one peer node in the peer nodes
The sending module is used for sending the first data fragment to a first peer node so that the first peer node generates a final block according to the first data fragment, a first verification result corresponding to the first data fragment data, a second data fragment shared by a second peer node and second verification result data, and writes the final block into a block file corresponding to the first peer node;
the first data fragment comprises at least one data fragment of the multiple data fragments, the first peer node is one peer node of peer nodes corresponding to the same blockchain channel, the second data fragment is other data fragments except the first data fragment of the multiple data fragments, and the second peer node is a peer node of each peer node and is distributed to the second data fragment.
A block processing apparatus applied to a first peer node in a blockchain network, the blockchain network further comprising an orderer node and a transaction terminal, the block processing apparatus comprising:
a receiving module, configured to receive a first data fragment sent by the orderer node, where the first data fragment includes at least one data fragment of multiple data fragments, the multiple data fragments are obtained by the orderer node by fragmenting an original block, the original block is formed by the orderer node packing transaction data corresponding to each peer node fed back by the transaction terminal, each peer node is a peer node corresponding to a same block chain channel in the block chain network, the transaction data is transaction data generated in the block chain channel, and the first peer node is a certain peer node in the peer nodes corresponding to the same block chain channel;
the verification module is used for verifying the validity of the transaction data corresponding to the first data fragment so as to obtain first verification result data corresponding to the first data fragment;
the receiving module is further configured to receive a second data fragment and second verification result data fed back by a second peer node, where the second data fragment is another data fragment of the multiple data fragments except the first data fragment, and the second peer node is a peer node allocated to the second data fragment in each peer node;
the generating module is used for generating a final block according to the first data fragment, the second data fragment, the first verification result data and the second verification result data;
and the writing module is used for writing the final block into a block file corresponding to the first peer node.
A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the steps of the above-described block processing method when executing the computer program.
A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the above-mentioned block processing method.
It can be seen that in the scheme implemented by the block processing method, the apparatus, the computer device, and the storage medium, the peer nodes in the same blockchain channel do not verify all transaction data of the complete block any more, and specifically, each peer node only needs to verify part of transaction data in one block, which can reduce the repeated verification work of each peer node, reduce the workload of each peer node, and reduce the network resources occupied by each peer node, thereby improving the utilization rate of network resources in the blockchain.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive labor.
Fig. 1 is a schematic structural diagram of a blockchain network to which a block processing method is applied according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a block processing method according to an embodiment of the present invention;
FIG. 3 is a flow chart illustrating a block processing method according to another embodiment of the present invention;
FIG. 4 is a flowchart illustrating a block processing method according to another embodiment of the present invention;
FIG. 5 is a flowchart illustrating a block processing method according to another embodiment of the present invention;
FIG. 6 is a flow chart of another embodiment of a block processing method according to the present invention;
FIG. 7 is a flowchart illustrating another embodiment of a block processing method according to the present invention;
FIG. 8 is a schematic diagram of a block processing apparatus according to the present invention;
FIG. 9 is a schematic view of another block processing apparatus according to the present invention;
FIG. 10 is a schematic diagram of a computer apparatus according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
First, in order to facilitate understanding of the present solution, a system framework of the present solution needs to be described, where the system framework in the present solution mainly relates to several main bodies, as shown in fig. 1, and the block processing method provided in the embodiment of the present invention is applied to a block chain network as shown in fig. 1, where the main bodies are a transaction terminal and each transaction institution, the peer node network of a unit (a certain enterprise or organization) referred by the transaction institution, and the order node and the peer node corresponding to each transaction institution jointly form the block chain network, where the transaction institution may deploy multiple peer nodes, and different peer nodes may correspond to multiple block chain channels, that is, the same block chain channel may correspond to multiple peer nodes, and peer nodes of the same block chain channel trust each other, as shown in fig. 1, the transaction institution includes multiple peer nodes (peer 1 nodes in the figure), The peer2 node, the peer3 node …), and the transaction terminal may initiate a transaction request to the peer node in the institution, and it should be noted that the system framework diagram is only illustrated schematically and is not limited herein.
The block chain network described in this specification may specifically be a private chain, a common chain, a federation chain, and the like, and is not particularly limited in the present invention. For example, in one scenario, the blockchain network may specifically be a federation chain formed by a server of a third-party payment platform, an internal banking server, an external banking server (a peer node may be deployed in the server), and several user node devices (transaction terminals) as member devices. The operator of the federation chain, i.e., the transaction institution, may rely on the federation chain to deploy online services such as federation chain-based cross-border transfers, asset transfers, and the like. The transaction described in this specification refers to a piece of data that is created by a user through a client of a blockchain and needs to be finally published to a distributed database of the blockchain. The transactions in the blockchain are classified into narrow transactions and broad transactions. A narrowly defined transaction refers to a transfer of value issued by a user to a blockchain; for example, in a conventional bitcoin blockchain network, the transaction may be a transfer initiated by the user in the blockchain. The broad transaction refers to a piece of business data with business intention, which is issued to the blockchain by a user; for example, an operator may build a federation chain based on actual business requirements, relying on the federation chain to deploy some other types of online business unrelated to value transfer (e.g., a rental house business, a vehicle dispatching business, an insurance claim settlement business, a credit service, a medical service, etc.), and in such federation chain, the transaction may be a business message or a business request with a business intent issued by a user in the federation chain.
The consensus algorithm carried by the block chain network is not particularly limited in this specification; in practical application, a Byzantine Fault-tolerant (Byzantine Fault-tolerant) series algorithm may be specifically adopted as the consensus algorithm, and a non-Byzantine Fault-tolerant series algorithm may also be adopted as the consensus algorithm. The Byzantine fault-tolerant algorithm is a distributed fault-tolerant algorithm which needs to consider Byzantine nodes (namely rogue nodes) in a distributed network consisting of a plurality of node devices; for example, the pbft algorithm; if the Byzantine fault-tolerant algorithm is adopted to carry out consensus processing in the block chain network, the malicious nodes and the fault nodes are considered to be simultaneously stored in the block chain. Correspondingly, the non-Byzantine fault-tolerant algorithm refers to a distributed fault-tolerant algorithm which does not consider Byzantine nodes in a distributed network consisting of a plurality of node devices; e.g., raft algorithm, etc.; if the common identification processing is carried out in the block chain network by adopting the non-Byzantine fault-tolerant algorithm, the block chain is considered to have no malicious nodes but only fault nodes. Specific details regarding the blockchain network are not described herein.
The following describes a block processing method according to an embodiment of the present invention in detail:
in one embodiment, as shown in fig. 2, there is provided a block processing method applied to an orderer node in a blockchain network, where the blockchain network further includes a transaction terminal and a plurality of peer nodes, including the following steps:
s10: and the orderer node packs the transaction data corresponding to each peer node fed back by the transaction terminal into an original block, each peer node is a peer node corresponding to the same block chain channel in the block chain network, and the transaction data is the transaction data generated in the block chain channel.
It can be understood that the transaction terminal communicates with any peer node in the transaction mechanism in the corresponding blockchain channel according to transaction requirements and initiates a transaction request to the peer node, the peer node in the transaction mechanism executes corresponding transaction after receiving the transaction request of the transaction terminal, and generates transaction data, such as transaction amount, transaction time and other transaction data, for the peer node, the peer node can feed back the transaction data to the transaction terminal, and the transaction terminal can send the transaction data fed back by the peer node to the order node.
It is understood that one peer node may join one or more blockchain channels (i.e., own multiple ledgers), and after joining a blockchain channel, peer nodes of the same blockchain channel may share or manage all ledgers within the blockchain channel. A peer node may join multiple channels, but the ledger for each blockchain channel is isolated. Thus, a blockchain channel is a logical structure that is composed of various physical device nodes that are physically present. In the embodiment of the invention, after the orderer node receives the transaction data fed back by the transaction terminal, the orderer node packs the transaction data generated by all peer nodes in the same block chain channel into the original block. For the orderer node, after the orderer node receives the transaction data fed back by the transaction terminal, the orderer node packs the transaction data generated by all peer nodes in the same block chain channel into an original block.
It should be noted that the above-mentioned blockchain Channel is formed by Channel Configuration (Channel Configuration), and the blockchain Channel controls the authority of each peer node that is accessed. In a specific implementation, the above blockchain network may be constructed based on hyperhedgerfric, and specifically, the msp (multimedia Service provider) component completes a configuration function of a blockchain channel. The MSP determines the role of a peer node, and the access to the blockchain resources, and the configuration process of the blockchain channel is not described in detail herein.
S20: the orderer node segments the original block to obtain a plurality of data segments, wherein each data segment comprises transaction data corresponding to at least one peer node in each peer node.
After the orderer node packs the transaction data corresponding to each peer node fed back by the transaction terminal into an original block, the orderer node segments the original block to obtain a plurality of data segments, wherein each data segment comprises the transaction data corresponding to at least one peer node. It can be understood that the original block is formed by packaging transaction data corresponding to each peer node, that is, the original block includes the transaction data corresponding to each peer node, and the obtained data fragment includes the transaction data corresponding to any one of the peer nodes.
S30: the orderer node sends the first data fragment to the first peer node, so that the first peer node generates a final block according to the first data fragment, a first verification result corresponding to the first data fragment data, a second data fragment shared by the second peer node and second verification result data, and writes the final block into a block file corresponding to the first peer node.
After obtaining the plurality of data fragments through step S20, the orderer node transmits the first data fragment to the first peer node. The first data fragment includes at least one data fragment of the multiple data fragments, that is, the first data fragment is a data fragment of the multiple data fragments, and includes at least one data fragment, that is, the first data fragment refers to one data fragment, and may also refer to two or more data fragments, or data fragments of other orders of magnitude, which is not limited herein. The first peer node is a certain peer node in peer nodes corresponding to the same blockchain channel, that is, after the first data fragment is obtained, the first data fragment is sent to a certain peer node in peer nodes corresponding to the same blockchain channel. It should be noted that, the embodiment of the present invention is not limited specifically to how many data fragments the peer nodes in the same blockchain channel specifically receive, and which peer nodes receive the data fragments sent by the orderer node. For convenience of understanding, in the embodiment of the present invention, for the same blockchain channel, the data fragments other than the first data fragment are referred to as second data fragments, and all other peer nodes of the second data fragment sent by the received orderer node under the same blockchain channel are referred to as second peer nodes.
For the first peer node, after receiving the first data slice sent by the orderer node, the first peer node verifies the validity of the transaction data corresponding to the first data slice. It is to be appreciated that, as described above, the first data segment includes at least one transaction datum, and thus, the first peer node verifies the validity of all transaction data corresponding to the first data segment. Similarly, for the second peer node, after receiving the second data fragment, the second peer node verifies the validity of all transaction data corresponding to the second data fragment. And finally, the peer nodes under the same blockchain channel mutually share respective data fragments and verification result data, namely the first peer node receives a second data fragment and second verification result data of a second peer node, and finally, the first peer node generates a final block according to the first data fragment, a first verification result corresponding to the first data fragment data, and a second data fragment and second verification result data shared by the second peer node, and writes the final block into a block file corresponding to the first peer node. The processing procedures of other peer nodes under the same blockchain channel, namely the second peer node, are similar and are not described herein.
It should be noted that, verifying the validity of the transaction data corresponding to the first data segment specifically means verifying whether the signature of the transaction, the transaction id of the transaction conflict, and whether the data version used in the transaction is correct. For example, verifying the validity of the transaction data may include the following process: in the first step, it is necessary to verify whether the transaction ID corresponding to the transaction data is repeated. Secondly, whether the signature of the transaction is normal needs to be verified, namely a certain peer node signs the transaction, so that whether the signature of the transaction is legal needs to be verified; third, it is necessary to verify whether the transaction data used in the transaction is the latest data. It is possible that this transaction uses old transaction data. If the transaction does not meet the requirements, the transaction is considered invalid and needs to be processed as an invalid transaction. Specifically, the contents of the verification of the transaction data are not described here, and in addition, the transaction verification process of the second peer node is similar to that of the first peer node, and is not described here.
It can be seen that the first peer node and the second peer node are peer nodes in the same blockchain channel, and after receiving the data fragment sent by the orderer node, the peer nodes under the same blockchain channel perform validation of the transaction data, that is, the peer nodes in the same blockchain channel do not perform validation on all transaction data of the complete block any more, specifically, the peer nodes only need to validate part of transaction data in one block, which can reduce the repeated validation of each peer node, reduce the workload of each peer node, and reduce the network resources occupied by each peer node, thereby improving the utilization rate of network resources in the blockchain.
In an embodiment, as shown in fig. 3, in step S10, that is, the orderer node packs the transaction data corresponding to each peer node fed back by the transaction terminal into an original block, the method specifically includes the following steps:
s11: and the orderer node hashes the transaction data corresponding to each peer node to obtain a first hash value.
S12: and the orderer node combines the first hash values corresponding to the transaction data corresponding to the peer nodes to obtain a combined value.
S13: and the orderer node takes the hash aiming at the combined value to obtain a second hash value.
S14: and the orderer node takes the second hash value as the total hash value of the original block, and packs the transaction data corresponding to each peer node into the original block according to the total hash value.
For steps S11-S14, when packing into the original block, hash is taken for each transaction data under the same blockchain channel, and hash is taken for the hash values corresponding to all transaction data, so that the final total hash value is used as the hash value in the block header, and finally the transaction data corresponding to each peer node is packed into the original block according to the total hash value. Therefore, when any transaction data in the block is tampered, the hash value of the whole original block is changed, and the transaction data in the block can be maintained.
It should be noted that, for the generated original block, hash values corresponding to all transaction data in the original block may be constructed by adopting a tree structure of the meikel tree, that is, the hash value of the original block, that is, the above total hash value, is used as a root of the meikel tree, and the hash value corresponding to the transaction data in the original block is used as a leaf of the meikel tree. By adopting the form, the method can be used for restoring the transaction sequence and verifying the integrity of each transaction when the final block is generated subsequently, and the transaction data of each transaction changed in the original block can be traced. That is, when the first peer node and the second peer node generate the final block according to the first data fragment, the second data fragment, the first verification result data and the second verification result data, the peer node analyzes the hash values of the received transaction data corresponding to all the data fragments, and restores the final block with the total hash value being the same as that of the original block according to the hash values of all the transactions. Specifically, the hash value of each transaction will be compared to the leaf node hash values on the meikel tree, since the order on the leaf nodes of the meikel tree cannot be changed. And each block has a fixed Merkel tree, so that the transaction sequence in the block chain network can be restored to obtain the final block as long as each transaction is restored to the Merkel tree, namely, the process of restoring the original block by using the Merkel tree is utilized.
In an embodiment, as shown in fig. 4, in step S20, that is, the orderer node slices the original chunk to obtain a plurality of data slices, the method specifically includes the following steps:
s21: the orderer node determines the transaction amount corresponding to all transaction data in the original block.
For example, if there are 10 transaction data in the original tile, then the transaction amount may be determined to be 10.
S22: and the orderer node determines the number of the fragments according to the transaction number.
S23: and the orderer node fragments the original block according to the number of fragments so as to obtain a plurality of data fragments with the same number as the fragments.
For steps S22-S23, after obtaining the transaction number, the orderer node determines the number of fragments according to the transaction number, and fragments the original chunk according to the number of fragments to obtain a plurality of data fragments with the same number of fragments. For example, transaction data 1 corresponding to the peer1 node, transaction data 2 corresponding to the peer2 node, transaction data 3 corresponding to the peer3 node, and transaction data 4 corresponding to the peer4 node, after the transaction data 1, 2, 3, and 4 are packed into an original chunk, the original chunk can be fragmented into a plurality of data fragments, where each data fragment includes at least one transaction data. Illustratively, the original chunk is divided into 3 data slices, wherein one data slice contains 2 transaction data, and the other two data slices each contain 1 transaction data. The purpose of this is to distribute the transaction verification work of each subsequent peer node more evenly, which can improve the verification efficiency. It should be noted that, in some embodiments, in addition to the above-mentioned fragmentation mode, other fragmentation modes may be provided, and an embodiment of the present invention is not limited specifically, for example, 5 transaction data exist, and an original block may also be divided into 3 data fragments, where one data fragment includes 3 transaction data, and the other 2 data fragments include 1 transaction data.
In an embodiment, as shown in fig. 5, before step S30, that is, before the orderer node sends the first data fragment to the first peer node, the method further includes the following steps:
s40: the orderer node determines the total node number of the peer nodes corresponding to the same block chain channel.
It can be understood that, in the above blockchain network, there are multiple blockchain channels, and different peer nodes may be added to 1 or multiple blockchain channels. For example, if there are 10 peer nodes in the same blockchain channel, the total number of nodes is determined to be 10.
S50: and the orderer node determines the number to be distributed of the first peer node according to the total node number and the fragment number.
After the total node number of the peer nodes corresponding to the same blockchain channel is obtained, the orderer node determines the number to be allocated of the first peer node according to the total node number and the fragment number, that is, the number to be allocated of each peer node in the same blockchain channel can be determined. When the number of the fragments of the data fragments is equal to the total number of the nodes, the data fragments are evenly divided into the peer nodes, and the peer nodes are evenly divided to obtain the data fragments. When the fragment data volume of the data fragments is larger than the total node number and reaches the average number, the data fragments can be evenly divided to each peer node. For example, when the number of the shards is 20 and the total number of the nodes is 10, each peer node may be allocated to 2 data shards. When the fragment data volume of the data fragments is larger than the total node number and does not reach the equipartition number, the orderer nodes can sort according to the processing capacity of each peer node, and the data fragments are distributed to each peer node. When the fragment data volume of the data fragments is smaller than the total node number, the orderer nodes can be sequenced according to the processing capacity of each peer node, and the data fragments are distributed to the peer nodes with strong processing capacity. It should be noted that the processing capability of the peer node may be determined according to the processing capability of the physical device, and the higher the processing capability of the physical device is, the higher the processing capability of the peer node carried in the physical device is, which is not specifically described herein. By the embodiment of the invention, the transaction verification work of the peer nodes under the same block chain channel can be well shared, and the peer nodes only need to verify part of transaction data in one block, so that the repeated verification work of each peer node can be reduced, the workload of each peer node can be reduced, the network resources occupied by each peer node can be reduced, and the utilization rate of the network resources in the block chain can be improved.
S60: and the orderer node determines the data fragments to be distributed from the plurality of data fragments according to the quantity to be distributed.
S70: the orderer node takes the data fragment to be distributed as a first data fragment.
As for steps S60-S70, it can be understood that after the orderer node determines the number to be allocated of the first peer node according to the total node number and the fragment number, the data fragment to be allocated may be determined from the plurality of data fragments, that is, the data fragment to be allocated to the first peer node, that is, the first data fragment is determined. It should be noted that, in some embodiments, the data segment containing the transaction data of the first peer node is preferentially allocated to the first peer node. It can be seen that, a specific way of determining the first data fragment is provided here, because the number of peer nodes in the same blockchain channel is different, and the number of data fragments obtained according to a block is also not determined, in order to make the fragments sent to each peer node uniform subsequently in this embodiment, the orderer node needs to determine the number to be allocated to the target peer node according to the total node number and the fragment number. For example, there are 5 peer nodes, but there are 10 data fragments actually, then 2 data fragments can be uniformly allocated to each peer node, and each peer node only needs to verify the transaction data corresponding to the 2 data fragments, so that the workload of each peer node is effectively shared, and the processing efficiency is improved as a whole. In addition, it should be noted that the orderer node randomly determines the data fragments to be allocated from the plurality of data fragments according to the number to be allocated, and the specific details are not limited herein.
In an embodiment, as shown in fig. 6, step S30, that is, the orderer node sends the first data fragment to the first peer node, includes the following steps:
s31: and the orderer node selects the main peer node from each peer node according to the main node selection algorithm.
S32: the orderer node sends the first data fragment to the main peer node so that the main peer node forwards the first data fragment to the first peer node, wherein the peer node and the first peer node are different peer nodes.
For steps S31-S32, it is understood that before each round of consensus of the blockchain network begins, a master peer node may be selected from among peer nodes in the blockchain, and other peer nodes may be used as slave peer nodes, and a specific master node selection algorithm is not limited herein. And finally, the orderer node sends the first data fragment to the main peer node so that the main peer node forwards the first data fragment to the first peer node, wherein the peer node and the first peer node are different peer nodes. It can be understood that, through the embodiment of the present invention, the main peer node can be selected from the blockchain channel in a polling manner, and then the main peer node performs the distribution work of the data fragments to distribute to each peer node.
The foregoing embodiment describes the block processing method in the implementation of the present invention from the orderer node side, and the following describes the embodiment of the present invention from the peer node side, including the following steps:
s100: the method comprises the steps that a first peer node receives a first data fragment sent by an orderer node, wherein the first data fragment comprises at least one data fragment in a plurality of data fragments, the data fragments are obtained by fragmenting an original block for the orderer node, the original block is formed by packaging transaction data corresponding to each peer node fed back by a transaction terminal by the orderer node, each peer node is a peer node corresponding to the same block chain channel in a block chain network, the transaction data is generated in the block chain channel, and the first peer node is one of the peer nodes corresponding to the same block chain channel.
S200: the first peer node verifies the validity of the transaction data corresponding to the first data fragment to obtain first verification result data corresponding to the first data fragment.
S300: and the first peer node receives a second data fragment and second verification result data fed back by the second peer node, wherein the second data fragment is other data fragments except the first data fragment in the plurality of data fragments, and the second peer node is a peer node distributed to the second data fragment in each peer node.
S400: and the first peer node generates a final block according to the first and second data fragments and the first and second verification result data.
S500: and the first peer node writes the final block into a block file corresponding to the first peer node.
It should be noted that, for the specific process of the first peer node executing the block processing method, reference may be made to the description of the first peer node side in the foregoing embodiment, and details are not repeated here.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
In an embodiment, a block processing device 10 is provided, the block processing device 10 is applied to an orderer node in a block chain network, the block chain network further includes a transaction terminal and a plurality of peer nodes, and the block processing device 10 corresponds to the method on the orderer node side in the block processing method in the above embodiment. As shown in fig. 8, the block processing apparatus 10 includes a packing module 101, a slicing module 102, and a transmitting module 103. The functional modules are explained in detail as follows:
the packaging module 101 is configured to package transaction data corresponding to each peer node fed back by a transaction terminal into an original block, where each peer node is a peer node corresponding to a same blockchain channel in the blockchain network, and the transaction data is transaction data generated in the blockchain channel;
a slicing module 102, configured to slice the original block to obtain a plurality of data slices, where each data slice includes transaction data corresponding to at least one peer node in each peer node;
a sending module 103, configured to send a first data fragment to a first peer node, so that the first peer node generates a final chunk according to the first data fragment, a first verification result corresponding to the first data fragment data, and a second data fragment and second verification result data shared by a second peer node, and writes the final chunk into a chunk file corresponding to the first peer node;
the first data fragment comprises at least one data fragment of the multiple data fragments, the first peer node is one peer node of peer nodes corresponding to the same blockchain channel, the second data fragment is other data fragments except the first data fragment of the multiple data fragments, and the second peer node is a peer node of each peer node and is distributed to the second data fragment.
In an embodiment, a block processing apparatus 20 is provided, which is applied to a first peer node in a blockchain network, the blockchain network further includes an orderer node and a transaction terminal, and the block processing apparatus 20 corresponds to the method on the first peer node side in the block processing method in the foregoing embodiments. As shown in fig. 9, the block processing apparatus 20 includes a receiving module 201, a verifying module 202, a generating module 203, and a writing module 204. The functional modules are explained in detail as follows:
a receiving module 201, configured to receive a first data fragment sent by the orderer node, where the first data fragment includes at least one data fragment of multiple data fragments, the multiple data fragments are obtained by the orderer node by fragmenting an original block, the original block is formed by the orderer node packing transaction data corresponding to each peer node fed back by the transaction terminal, each peer node is a peer node corresponding to a same block chain channel in the block chain network, the transaction data is transaction data generated in the block chain channel, and the first peer node is a certain peer node in the peer nodes corresponding to the same block chain channel;
the verification module 202 is configured to verify validity of transaction data corresponding to the first data fragment to obtain first verification result data corresponding to the first data fragment;
the receiving module 201 is further configured to receive a second data fragment and second verification result data fed back by a second peer node, where the second data fragment is another data fragment of the multiple data fragments except the first data fragment, and the second peer node is a peer node allocated to the second data fragment in each peer node;
a generating module 203, configured to generate a final block according to the first and second data fragments and the first and second verification result data;
a writing module 204, configured to write the final block into a block file corresponding to the first peer node.
For the specific limitations of the block processing apparatus, reference may be made to the above limitations of the block processing method, which are not described herein again. The respective modules in the block processing apparatus described above may be implemented in whole or in part by software, hardware, and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as shown in fig. 10. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for accessing transaction data and the like. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to realize a block processing method corresponding to the orderer node side or the peer node side.
In one embodiment, a computer device is provided, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
packaging transaction data corresponding to each peer node fed back by a transaction terminal into an original block, wherein each peer node is a peer node corresponding to the same blockchain channel in a blockchain network, and the transaction data is generated in the blockchain channel;
segmenting the original block to obtain a plurality of data segments, wherein each data segment comprises transaction data corresponding to at least one peer node in each peer node;
sending the first data fragment to a first peer node, so that the first peer node generates a final block according to the first data fragment, a first verification result corresponding to the first data fragment data, a second data fragment shared by a second peer node and second verification result data, and writes the final block into a block file corresponding to the first peer node;
the first data fragment comprises at least one data fragment of a plurality of data fragments, the first peer node is one peer node of peer nodes corresponding to the same blockchain channel, the second data fragment is other data fragments except the first data fragment of the plurality of data fragments, and the second peer node is a peer node of the second data fragment distributed to each peer node.
Or the like, or, alternatively,
receiving a first data fragment sent by an orderer node, wherein the first data fragment comprises at least one data fragment in a plurality of data fragments, the data fragments are obtained by fragmenting an original block for the orderer node, the original block is formed by packaging transaction data corresponding to each peer node fed back by a transaction terminal by the orderer node, each peer node is a peer node corresponding to the same block chain channel in a block chain network, the transaction data is generated in the block chain channel, and the first peer node is one peer node in the peer nodes corresponding to the same block chain channel;
verifying the validity of the transaction data corresponding to the first data fragment to obtain first verification result data corresponding to the first data fragment;
receiving a second data fragment and second verification result data fed back by a second peer node, wherein the second data fragment is other data fragments except the first data fragment in the plurality of data fragments, and the second peer node is a peer node distributed to the second data fragment in each peer node;
generating a final block according to the first and second data fragments and the first and second verification result data;
and writing the final block into a block file corresponding to the first peer node.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
packaging transaction data corresponding to each peer node fed back by a transaction terminal into an original block, wherein each peer node is a peer node corresponding to the same blockchain channel in a blockchain network, and the transaction data is generated in the blockchain channel;
segmenting the original block to obtain a plurality of data segments, wherein each data segment comprises transaction data corresponding to at least one peer node in each peer node;
sending the first data fragment to a first peer node, so that the first peer node generates a final block according to the first data fragment, a first verification result corresponding to the first data fragment data, a second data fragment shared by a second peer node and second verification result data, and writes the final block into a block file corresponding to the first peer node;
the first data fragment comprises at least one data fragment of a plurality of data fragments, the first peer node is one peer node of peer nodes corresponding to the same blockchain channel, the second data fragment is other data fragments except the first data fragment of the plurality of data fragments, and the second peer node is a peer node of the second data fragment distributed to each peer node.
Or the like, or, alternatively,
receiving a first data fragment sent by an orderer node, wherein the first data fragment comprises at least one data fragment in a plurality of data fragments, the data fragments are obtained by fragmenting an original block for the orderer node, the original block is formed by packaging transaction data corresponding to each peer node fed back by a transaction terminal by the orderer node, each peer node is a peer node corresponding to the same block chain channel in a block chain network, the transaction data is generated in the block chain channel, and the first peer node is one peer node in the peer nodes corresponding to the same block chain channel;
verifying the validity of the transaction data corresponding to the first data fragment to obtain first verification result data corresponding to the first data fragment;
receiving a second data fragment and second verification result data fed back by a second peer node, wherein the second data fragment is other data fragments except the first data fragment in the plurality of data fragments, and the second peer node is a peer node distributed to the second data fragment in each peer node;
generating a final block according to the first and second data fragments and the first and second verification result data;
and writing the final block into a block file corresponding to the first peer node.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.

Claims (10)

1. A method for processing a block, applied to an orderer node in a blockchain network, wherein the blockchain network further comprises a transaction terminal and a plurality of peer nodes, the method comprising:
the orderer node packs transaction data corresponding to each peer node fed back by the transaction terminal into an original block, each peer node is a peer node corresponding to the same block chain channel in the block chain network, and the transaction data is generated in the block chain channel;
the orderer node segments the original block to obtain a plurality of data segments, wherein each data segment comprises transaction data corresponding to at least one peer node in each peer node;
the orderer node sends the first data fragment to a first peer node so that the first peer node generates a final block according to the first data fragment, a first verification result corresponding to the first data fragment, a second data fragment shared by a second peer node and second verification result data, and writes the final block into a block file corresponding to the first peer node;
the first data fragment comprises at least one data fragment of the multiple data fragments, the first peer node is one peer node of peer nodes corresponding to the same blockchain channel, the second data fragment is other data fragments of the multiple data fragments except the first data fragment, and the second peer node is a peer node of the second data fragment distributed to each peer node.
2. A block processing method as claimed in claim 1, wherein the orderer node packs transaction data corresponding to each peer node fed back by the transaction terminal into an original block, comprising:
the orderer node hashes the transaction data corresponding to each peer node to obtain a first hash value;
the orderer node combines the first hash values corresponding to the transaction data corresponding to the peer nodes to obtain a combined value;
the orderer node hashes the combined value to obtain a second hash value;
and the orderer node takes the second hash value as a total hash value of an original block, and packs the transaction data corresponding to each peer node into the original block according to the total hash value.
3. A block processing method as claimed in claim 1, wherein said orderer node slices said original block to obtain a plurality of data slices, comprising:
the orderer node determines the transaction quantity corresponding to all transaction data in the original block;
the orderer node determines the number of the fragments according to the transaction number;
and the orderer node fragments the original block according to the fragment number to obtain a plurality of data fragments with the same fragment number.
4. A block processing method as claimed in claim 3, wherein before the orderer node sends the first data slice to the first peer node, the method further comprises:
the orderer node determines the total node number of peer nodes corresponding to the same block chain channel;
the orderer node determines the number to be distributed of the first peer node according to the total node number and the fragment number;
the orderer node determines the data fragments to be distributed from the plurality of data fragments according to the quantity to be distributed;
and the orderer node takes the data fragment to be distributed as the first data fragment.
5. A block processing method as claimed in any one of claims 1 to 4, wherein said orderer node sends a first data slice to a first peer node, comprising:
the orderer node selects a main peer node from each peer node according to a main node selection algorithm;
the order node sends the first data fragment to the main peer node so that the main peer node forwards the first data fragment to the first peer node, wherein the peer node and the first peer node are different peer nodes.
6. A method for processing a block, applied to a first peer node in a blockchain network, the blockchain network further including an orderer node and a transaction terminal, the method comprising:
the first peer node receives a first data fragment sent by the orderer node, wherein the first data fragment comprises at least one data fragment in a plurality of data fragments, the data fragments are obtained by fragmenting an original block for the orderer node, the original block is formed by packaging transaction data corresponding to each peer node fed back by the transaction terminal by the orderer node, each peer node is a peer node corresponding to the same block chain channel in the block chain network, the transaction data is generated in the block chain channel, and the first peer node is one of the peer nodes corresponding to the same block chain channel;
the first peer node verifies the validity of the transaction data corresponding to the first data fragment to obtain first verification result data corresponding to the first data fragment;
the first peer node receives a second data fragment and second verification result data fed back by a second peer node, wherein the second data fragment is the other data fragments except the first data fragment in the multiple data fragments, and the second peer node is a peer node distributed to the second data fragment in each peer node;
the first peer node generates a final block according to the first and second data fragments and the first and second verification result data;
and the first peer node writes the final block into a block file corresponding to the first peer node.
7. A block processing apparatus applied to an orderer node in a blockchain network, the blockchain network further comprising a transaction terminal and a plurality of peer nodes, the block processing apparatus comprising:
the packaging module is used for packaging the transaction data corresponding to each peer node fed back by the transaction terminal into an original block, wherein each peer node is a peer node corresponding to the same blockchain channel in the blockchain network, and the transaction data is generated in the blockchain channel;
the slicing module is used for slicing the original block to obtain a plurality of data slices, and each data slice comprises transaction data corresponding to at least one peer node in each peer node;
the sending module is used for sending the first data fragment to a first peer node so that the first peer node generates a final block according to the first data fragment, a first verification result corresponding to the first data fragment data, a second data fragment shared by a second peer node and second verification result data, and writes the final block into a block file corresponding to the first peer node;
the first data fragment comprises at least one data fragment of the multiple data fragments, the first peer node is one peer node of peer nodes corresponding to the same blockchain channel, the second data fragment is other data fragments of the multiple data fragments except the first data fragment, and the second peer node is a peer node of the second data fragment distributed to each peer node.
8. A block processing apparatus applied to a first peer node in a blockchain network, the blockchain network further comprising an orderer node and a transaction terminal, the block processing apparatus comprising:
a receiving module, configured to receive a first data fragment sent by the orderer node, where the first data fragment includes at least one data fragment of multiple data fragments, the multiple data fragments are obtained by the orderer node by fragmenting an original block, the original block is formed by the orderer node packing transaction data corresponding to each peer node fed back by the transaction terminal, each peer node is a peer node corresponding to a same block chain channel in the block chain network, the transaction data is transaction data generated in the block chain channel, and the first peer node is a certain peer node in the peer nodes corresponding to the same block chain channel;
the verification module is used for verifying the validity of the transaction data corresponding to the first data fragment so as to obtain first verification result data corresponding to the first data fragment;
the receiving module is further configured to receive a second data fragment and second verification result data fed back by a second peer node, where the second data fragment is another data fragment of the multiple data fragments except the first data fragment, and the second peer node is a peer node allocated to the second data fragment in each peer node;
the generating module is used for generating a final block according to the first data fragment, the second data fragment, the first verification result data and the second verification result data;
and the writing module is used for writing the final block into a block file corresponding to the first peer node.
9. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the steps of the block processing method according to any one of claims 1 to 6 when executing the computer program.
10. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the block processing method according to any one of claims 1 to 6.
CN201910964135.2A 2019-10-11 2019-10-11 Block processing method and device, computer equipment and storage medium Pending CN110933022A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201910964135.2A CN110933022A (en) 2019-10-11 2019-10-11 Block processing method and device, computer equipment and storage medium
PCT/CN2020/085562 WO2021068477A1 (en) 2019-10-11 2020-04-20 Block processing method, apparatus, computer device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910964135.2A CN110933022A (en) 2019-10-11 2019-10-11 Block processing method and device, computer equipment and storage medium

Publications (1)

Publication Number Publication Date
CN110933022A true CN110933022A (en) 2020-03-27

Family

ID=69848798

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910964135.2A Pending CN110933022A (en) 2019-10-11 2019-10-11 Block processing method and device, computer equipment and storage medium

Country Status (2)

Country Link
CN (1) CN110933022A (en)
WO (1) WO2021068477A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111917572A (en) * 2020-07-12 2020-11-10 中信银行股份有限公司 Transaction request processing method and device, electronic equipment and readable storage medium
WO2021068477A1 (en) * 2019-10-11 2021-04-15 深圳壹账通智能科技有限公司 Block processing method, apparatus, computer device and storage medium
CN113643031A (en) * 2021-08-24 2021-11-12 上海点融信息科技有限责任公司 Alliance link information verification system and method

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109345386A (en) * 2018-08-31 2019-02-15 阿里巴巴集团控股有限公司 Transaction common recognition processing method and processing device, electronic equipment based on block chain
CN109379397A (en) * 2018-08-31 2019-02-22 阿里巴巴集团控股有限公司 Transaction common recognition processing method and processing device, electronic equipment based on block chain
CN109447804A (en) * 2018-10-30 2019-03-08 杭州复杂美科技有限公司 Transaction shunt method, equipment and storage medium
CN110011814A (en) * 2019-04-16 2019-07-12 北京艾摩瑞策科技有限公司 A kind of DPoS common recognition method and its system that can verify that

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10102265B1 (en) * 2017-04-12 2018-10-16 Vijay K. Madisetti Method and system for tuning blockchain scalability for fast and low-cost payment and transaction processing
CN109285006A (en) * 2018-09-20 2019-01-29 中链科技有限公司 A kind of parallel proof processing method and processing device of block chain data
CN109359992A (en) * 2018-10-09 2019-02-19 北京彩球世纪科技有限公司 A kind of novel block chain subregion sliced fashion and device
CN109508968B (en) * 2018-10-25 2020-12-18 常州唯康信息科技有限公司 Block chain system and control method thereof
CN110149373B (en) * 2019-04-28 2022-01-07 平安科技（深圳）有限公司 Data storage method, device, medium and server based on peer-to-peer network
CN110933022A (en) * 2019-10-11 2020-03-27 深圳壹账通智能科技有限公司 Block processing method and device, computer equipment and storage medium

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109345386A (en) * 2018-08-31 2019-02-15 阿里巴巴集团控股有限公司 Transaction common recognition processing method and processing device, electronic equipment based on block chain
CN109379397A (en) * 2018-08-31 2019-02-22 阿里巴巴集团控股有限公司 Transaction common recognition processing method and processing device, electronic equipment based on block chain
CN109447804A (en) * 2018-10-30 2019-03-08 杭州复杂美科技有限公司 Transaction shunt method, equipment and storage medium
CN110011814A (en) * 2019-04-16 2019-07-12 北京艾摩瑞策科技有限公司 A kind of DPoS common recognition method and its system that can verify that

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021068477A1 (en) * 2019-10-11 2021-04-15 深圳壹账通智能科技有限公司 Block processing method, apparatus, computer device and storage medium
CN111917572A (en) * 2020-07-12 2020-11-10 中信银行股份有限公司 Transaction request processing method and device, electronic equipment and readable storage medium
CN111917572B (en) * 2020-07-12 2022-10-25 中信银行股份有限公司 Transaction request processing method and device, electronic equipment and readable storage medium
CN113643031A (en) * 2021-08-24 2021-11-12 上海点融信息科技有限责任公司 Alliance link information verification system and method

Also Published As

Publication number Publication date
WO2021068477A1 (en) 2021-04-15

Similar Documents

Publication Publication Date Title
CN109728954B (en) Federation node point management system and method
CN107809484B (en) Block chain transaction information processing method and block chain link point
CN109472572B (en) Contract system based on block chain main chain and parallel multiple sub-chains
CN110727712A (en) Data processing method and device based on block chain network, electronic equipment and storage medium
CN110933022A (en) Block processing method and device, computer equipment and storage medium
CN110855777B (en) Node management method and device based on block chain
CN110569251A (en) Data processing method, related equipment and computer readable storage medium
CN111612614A (en) Public link-based sub-chain service system
CN111628886B (en) Method, device and computer equipment for building blockchain network in private cloud environment
CN112910965B (en) Method and system for submitting fragmented block chain down-across-fragmentation transaction
CN110992178A (en) Verification method and device for block chain node, computer equipment and storage medium
CN111737104A (en) Block chain network service platform, test case sharing method thereof and storage medium
CN111899019A (en) Method and system for cross validation and sharing of blacklist and multiple parties
CN113255014B (en) Data processing method based on block chain and related equipment
CN111311254A (en) Service processing method, device and system based on block chain
CN114297304A (en) Product information block chain transaction storage method, server and readable medium
CN115695408A (en) File transmission method and device, computer equipment and storage medium
CN111260253A (en) Information sending method and device, computer equipment and storage medium
CN111260475A (en) Data processing method, block chain node point equipment and storage medium
CN114528601A (en) Access method and device based on block chain data, processor and electronic equipment
CN114143090A (en) Firewall deployment method, device, equipment and medium based on network security architecture
CN112632638A (en) Multi-copy data integrity verification method and device
CN113157450A (en) Method and apparatus for performing blocks in a blockchain system
CN113010894A (en) Data processing method and device and computer readable storage medium
CN111524009A (en) Transaction verification method and device for blockchain system and hardware equipment

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20200327