Transaction, method, device and storage medium for broadcasting blocks

Abstract

The present invention provides a method, device, and storage medium for broadcasting transactions and blocks. The method includes: when a first transaction is generated by the current node or received through an rpc port, broadcasting the first transaction to other consensus nodes and subscribing to each first non-consensus node of the current node; when a second transaction is received through a p2p port, broadcasting the second transaction to other consensus nodes and each first non-consensus node; and broadcasting a first block to other consensus nodes and each first non-consensus node. This application improves the throughput of the blockchain network.

Description

Technical Field

[0001] This application relates to the field of blockchain technology, and specifically relates to a method, device, and storage medium for broadcasting transactions and blocks. Background Art

[0002] After a blockchain node starts the blockchain service and connects to the blockchain network, it can perform operations such as transaction broadcasting and block downloading.

[0003] As long as the communication protocols of the nodes are consistent, or some identification measures are added, such as the same ChainID of the blockchain, the nodes can freely join the blockchain network. As the number of nodes increases, the network will expand rapidly, resulting in a gradual decrease in the efficiency of transaction data transmission. Some nodes take a long time to receive the data, and at the same time, the network bandwidth will also expand, which is not conducive to the throughput of the overall blockchain network. Summary of the Invention

[0004] In view of the above-mentioned defects or deficiencies in the prior art, it is desirable to provide a method, device, and storage medium for broadcasting transactions and blocks that can improve the throughput of the blockchain network.

[0005] In a first aspect, the present invention provides a method for broadcasting transactions and blocks applicable to consensus nodes. In a blockchain network, consensus nodes and non-consensus nodes are configured. Each consensus node can communicate with each other, and each consensus node forms a consensus network. The method includes:

[0006] When a first transaction is generated by the current node or received through the rpc port, broadcast the first transaction to other consensus nodes and subscribe to each first non-consensus node of the current node for each first non-consensus node:

[0007] Broadcast the first transaction to each second consensus node that subscribes to the first non-consensus node and each second non-consensus node that subscribes to the first non-consensus node;

[0008] When a second transaction is received through the p2p port, broadcast the second transaction to other consensus nodes and each first non-consensus node for each first non-consensus node:

[0009] Broadcast the second transaction to each second consensus node and each second non-consensus node;

[0010] Broadcast the first block to other consensus nodes and each first non-consensus node for each first non-consensus node:

[0011] Broadcast the first block to each second non-consensus node.

[0012] In a second aspect, the present invention further provides a device, including one or more processors and a memory, where the memory contains instructions executable by the one or more processors to cause the one or more processors to execute the transaction and block broadcasting methods provided according to the embodiments of the present invention.

[0013] In a third aspect, the present invention further provides a storage medium storing a computer program, and the computer program causes a computer to execute the transaction and block broadcasting methods provided according to the embodiments of the present invention.

[0014] The transaction and block broadcasting methods, devices, and storage media provided by many embodiments of the present invention improve the throughput of the blockchain network by broadcasting a first transaction to other consensus nodes when the first transaction is generated by the current node or received through an rpc port, and subscribing to each first non-consensus node of the current node; when receiving a second transaction through a p2p port, broadcasting the second transaction to other consensus nodes and each first non-consensus node; and broadcasting a first block to other consensus nodes and each first non-consensus node. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Other features, objects, and advantages of the present application will become more apparent by reading the detailed description of the non-limiting embodiments with reference to the following drawings:

[0016] Figure 1 It is a flowchart of a transaction and block broadcasting method provided by an embodiment of the present invention.

[0017] Figure 2 It is a schematic structural diagram of a device provided by an embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0018] The present application will be further described in detail below with reference to the drawings and embodiments. It can be understood that the specific embodiments described herein are only for explaining the related invention and not for limiting the invention. Additionally, it should be noted that only parts related to the invention are shown in the drawings for the convenience of description.

[0019] It should be noted that, without conflict, the embodiments in the present application and the features in the embodiments can be combined with each other. The present application will be described in detail below with reference to the drawings and embodiments.

[0020] Figure 1 It is a flowchart of a transaction and block broadcasting method provided by an embodiment of the present invention. As Figure 1 shown, in this embodiment, the present invention provides a transaction and block broadcasting method applicable to consensus nodes. In the blockchain network, consensus nodes and non-consensus nodes are configured, and each consensus node can communicate with each other. Each consensus node forms a consensus network. The above method includes:

[0021] S12: When the first transaction is generated by the current node or received through the rpc port, broadcast the first transaction to other consensus nodes and subscribe to each first non-consensus node of the current node for each first non-consensus node to:

[0022] Broadcast the first transaction to each second consensus node that subscribes to the first non-consensus node and each second non-consensus node that subscribes to the first non-consensus node;

[0023] S14: When the second transaction is received through the p2p port, broadcast the second transaction to other consensus nodes and each first non-consensus node for each first non-consensus node to:

[0024] Broadcast the second transaction to each second consensus node and each second non-consensus node;

[0025] S16: Broadcast the first block to other consensus nodes and each first non-consensus node for each first non-consensus node to:

[0026] Broadcast the first block to each second non-consensus node.

[0027] Specifically, before S12, it also includes "When starting the blockchain service, subscribe to several third non-consensus nodes", and S14 includes "When receiving the second transaction broadcast by the third non-consensus node or when receiving the second transaction broadcast by other consensus nodes, broadcast the second transaction to other consensus nodes and each first non-consensus node" as an example;

[0028] Suppose there are consensus nodes N1 to N4 and non-consensus nodes n1 to n5 in the blockchain network;

[0029] At this time, the consensus node N5 starts the blockchain service;

[0030] N5 subscribes to several non-consensus nodes. Suppose it subscribes to n5;

[0031] After that, N5 is also subscribed to by several non-consensus nodes. Suppose N5 is also subscribed to by n5;

[0032] In addition, it is also assumed that at this time, N1 and n1 have a two-way subscription, N2 and n2 have a two-way subscription... N4 and n4 have a two-way subscription; and, n1 subscribes to n2, n2 subscribes to n3, n3 subscribes to n4, n4 subscribes to n5 and n1, and n5 subscribes to n1;

[0033] N5 executes step S12. When tx1 is generated by N5 or received through the rpc port (that is, after the user's client generates tx1, N5 is the first blockchain node to receive tx1), broadcast tx1 to N1 to N4 and n5;

[0034] n5 broadcasts tx1 to N5, as well as, n4;

[0035] n4 broadcasts tx1 to N4, as well as, n3;

[0036] …… The broadcasting principle of other non-consensus nodes is similar and will not be elaborated here;

[0037] N5 executes step S14. When tx2 is received through the p2p port (that is, tx2 is generated by another consensus node; or, generated by a non-consensus node; or, after the user's client generates tx2, before tx2 reaches N5, tx2 first reaches any one of N1 to N4, or, first reaches n5), N5 broadcasts tx2 to N1 to N4, as well as, n5;

[0038] n5 broadcasts tx2 to N5, as well as, n4;

[0039] n4 broadcasts tx2 to N4, as well as, n3;

[0040] …… The broadcasting principle of other non-consensus nodes is similar and will not be elaborated here;

[0041] N5 executes step S16 and broadcasts block(X) to N1 to N4, as well as, n5; Those skilled in the art should understand that block(X) is generated by any one of N1 to N5;

[0042] n5 broadcasts block(X) to n4;

[0043] n4 broadcasts block(X) to n3;

[0044] …… The broadcasting principle of other non-consensus nodes is similar and will not be elaborated here;

[0045] Those skilled in the art should understand that the consensus nodes can independently count the timeliness of the transactions broadcast by the subscribed non-consensus nodes (whether there are transactions with missed broadcasts, whether there are transactions with overly long delays in broadcasting), so as to regularly replace the subscribed non-consensus nodes;

[0046] The above embodiments bring the following advantages:

[0047] 1. Introducing the subscription mode makes the randomness of all nodes in the blockchain network obtaining network broadcast messages determined and controllable;

[0048] 2. Reducing the number of times of repeated propagation of network data effectively reduces bandwidth occupancy;

[0049] 3. Dividing the blockchain network into a consensus network and a non-consensus network; at the same time, the two-layer network is interconnected, and transactions are propagated in parallel in the two-layer network, improving the propagation efficiency and ensuring that the consensus nodes can receive transactions in the shortest time;

[0050] 4. Double-layer network isolation ensures that the consensus network can broadcast transactions and generate blocks normally even when the non-consensus network is congested. Consensus nodes must be a small number of nodes in the blockchain network. Their characteristics are few in number and fast in broadcasting speed. Spreading their hierarchical transactions in the limited consensus layer helps to solve the problem that when the network is unbalanced, broadcast data cannot be received normally all the time, resulting in slow block generation by consensus nodes.

[0051] Preferably, the first block is broadcast to other consensus nodes, and each first non-consensus node includes:

[0052] The first block is broadcast to other consensus nodes, and the first light block of the first block is broadcast to each first non-consensus node; wherein, the first light block broadcasts the first block header of the first block and the transaction hash list of the first block;

[0053] Broadcasting the first block to each second non-consensus node includes:

[0054] Finding the corresponding third transactions from the transaction pool according to the transaction hash list;

[0055] Restoring the first block body of the first light block according to each third transaction;

[0056] Restoring the first block according to the first block header and the first block body;

[0057] Broadcasting the first light block to each second non-consensus node.

[0058] Assume that block(X) is generated based on tx1~tx10;

[0059] Specifically, N5 broadcasts block(X) to N1~N4, and broadcasts blockhead(X), hash(tx1)~hash(tx10) to n5;

[0060] n5 finds tx1~tx10 from the transaction pool according to hash(tx1)~hash(tx10);

[0061] n5 restores blockbody(X) according to the found tx1~tx10;

[0062] n5 restores block(X) according to blockbody(X) and blockhead(X);

[0063] n5 broadcasts block(X) to n4.

[0064] Those skilled in the art should understand that N5 can also broadcast blockhead(X), hash(tx1) to hash(tx10) to N1 to N4. The principle for N1 to N4 to restore block(X) is the same as that of n5, and will not be elaborated here.

[0065] The above embodiments reduce the amount of network data broadcast and effectively reduce bandwidth occupation.

[0066] Further preferably, finding the corresponding third transactions according to the transaction hash list includes:

[0067] Perform the following operations on each transaction hash in the transaction hash list:

[0068] Judge whether there is a third transaction corresponding to the transaction hash in the transaction pool:

[0069] If not, cache the transaction hash;

[0070] Send each cached transaction hash to the current node to request the missing third transactions.

[0071] Specifically, assume that n5 caches hash(tx9) and hash(tx10);

[0072] n5 sends hash(tx9) and hash(tx10) to N5 to obtain tx9 and tx10.

[0073] Further preferably, sending each cached transaction hash to the current node to request the missing third transactions includes:

[0074] Perform the following operations on each cached transaction hash:

[0075] Regularly perform the following operations: Judge whether there is a third transaction corresponding to the cached transaction hash in the transaction pool: If yes, update each cached transaction hash;

[0076] After the first time period, send the latest cached transaction hashes to the current node to request the missing third transactions.

[0077] The above embodiments introduce a waiting mechanism. n5 can regularly (for example, 100 ms) check whether tx9 and tx10 exist in the transaction pool. Assume that tx9 is detected, then update the cached transaction hash to: hash(tx10); after the first time period (for example, 300 ms), send hash(tx10) to N5 to obtain tx10.

[0078] The blockchain network environment is complex, and the bandwidth capabilities of each node vary; the broadcasting of transactions and blocks cannot guarantee an absolute order. When a non-consensus node receives a lightweight block, there may be missing transactions in the transaction pool. At this time, if the non-consensus node directly requests the missing transactions from the consensus node, it will bring additional bandwidth overhead. The above embodiments can avoid the delayed receipt of transactions caused by the complex and unstable network.

[0079] Preferably, two consensus nodes communicate through the protocol = … / p2p / net / consensus, two non-consensus nodes communicate through the protocol = … / p2p / net / normal, and the consensus node and the non-consensus node communicate through the proto: … / p2p / net / cross protocol.

[0080] Further preferably, before the first transaction is generated by the current node or received through the rpc port, it further includes:

[0081] When starting the blockchain service, subscribe to a number of third non-consensus nodes;

[0082] When receiving the second transaction through the p2p port, broadcast the second transaction to other consensus nodes, and each first non-consensus node includes:

[0083] When receiving the second transaction broadcast by the third non-consensus node through the proto: … / p2p / net / cross protocol, or when receiving the second transaction through the protocol = … / p2p / net / consensus, broadcast the second transaction to other consensus nodes and each first non-consensus node.

[0084] A transaction can be generated by a consensus node, a non-consensus node, or a user's client; and when the transaction is generated by the user's client and sent to the blockchain network, the first node to receive the transaction may be a consensus node or a non-consensus node.

[0085] The above embodiments ensure that transactions can be broadcast to the consensus nodes of the consensus network as soon as possible.

[0086] Further preferably, subscribing to a number of third non-consensus nodes when starting the blockchain service includes:

[0087] When starting the blockchain service, connect to the first number of non-consensus nodes through the protocol proto: / chain33 / p2p / net / cross, and select a number of non-consensus nodes therefrom as the subscribed third non-consensus nodes according to the pre-configured subscription rules.

[0088] Those skilled in the art should understand that the above subscription rules can be configured according to actual needs. For example, it can be configured to select several non-consensus nodes with the fastest response speed as several third non-consensus nodes for subscription, or select several non-consensus nodes with the closest logical distance as several third non-consensus nodes for subscription, etc.

[0089] In addition, those skilled in the art should understand that when a consensus node starts the blockchain service, the way to discover and connect to other consensus nodes can be configured according to actual needs. For example, it can be configured to be guided by built-in consensus seed nodes and connect to the first number of non-consensus nodes through the protocol proto: / chain33 / p2p / net / cross;

[0090] Correspondingly, the consensus node is guided by the built-in consensus seed node and connected to other consensus nodes through the protocol protocol=… / p2p / net / consensus;

[0091] Correspondingly, the non-consensus node is guided by the built-in non-consensus seed node and communicates through the protocol protocol=… / p2p / net / normal.

[0092] The advantage of dividing the seed nodes into consensus seed nodes and non-consensus seed nodes is as follows:

[0093] 1. For a blockchain node configured as a consensus node, after the node starts, it can quickly enter the consensus network according to the guidance of the consensus seed node. At the same time, it can obtain a list of other non-consensus nodes through the non-consensus seed node, select some nodes to connect and subscribe to quickly obtain transactions in the non-consensus network.

[0094] 2. For a blockchain node configured as a non-consensus node, after the node starts, it only needs to be guided by the non-consensus seed node to access the non-consensus network. Obtain several consensus nodes through the consensus seed node for connection and subscription to quickly obtain transactions and blocks in the consensus network.

[0095] Preferably, the first transaction is broadcast to other consensus nodes, and subscribing to each first non-consensus node of the current node includes:

[0096] Verify the executability of the first transaction. When the verification passes, sign the first transaction according to the private key held, broadcast the signed first transaction to other consensus nodes, and subscribe to each first non-consensus node of the current node;

[0097] Broadcast the first transaction to each second consensus node that subscribes to the first non-consensus node, and subscribing to each second non-consensus node of the first non-consensus node includes:

[0098] Verify the signed first transaction according to the public key of the current node:

[0099] When the verification passes, broadcast the signed first transaction to each second consensus node that subscribes to the first non-consensus node, and each second non-consensus node that subscribes to the first non-consensus node;

[0100] When the verification fails, do not perform the step of broadcasting the signed first transaction to each second consensus node that subscribes to the first non-consensus node, and each second non-consensus node that subscribes to the first non-consensus node; and,

[0101] Mark the current node as an illegal node to reject other transactions or blocks broadcast by the current node.

[0102] In the prior art, all blockchain nodes need to locally verify the executability of tx1 before broadcasting tx1, which reduces the broadcast rate;

[0103] In the above embodiment, only N5 needs to first verify the executability of tx1 (including verifying the signature of tx1, verifying whether tx1 can be correctly pre-executed, etc.). When the verification is successful, use pri(N5) to sign tx1; after receiving the broadcast tx1, N1~N4 and n5 only need to verify whether pub(N5) can verify tx1 after being signed by pri(N5), that is, verify the matching of pub(N5) and pri(N5). When the verification passes, broadcast tx1; if the verification fails, consider N5 as an illegal node and block other transactions or blocks broadcast by N5 subsequently.

[0104] The above embodiment improves the broadcast efficiency of the blockchain network; and, it can timely mark and block the broadcast source, maintaining the security of the blockchain network.

[0105] Figure 2 The structural schematic diagram of a device provided by an embodiment of the present invention.

[0106] As Figure 2 shown, on the other hand, the present application also provides a device 200, including one or more central processing units (CPUs) 201, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 202 or the program loaded from the storage part 208 into the random access memory (RAM) 203. In the RAM 203, various programs and data required for the operation of the device 200 are also stored. The CPU 201, ROM 202, and RAM 203 are connected to each other through a bus 204. The input / output (I / O) interface 205 is also connected to the bus 204.

[0107] The following components are connected to the I / O interface 205: an input section 206 including a keyboard, a mouse, etc.; an output section 207 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 208 including a hard disk, etc.; and a communication section 209 including a network interface card such as a LAN card, a modem, etc. The communication section 209 performs communication processing via a network such as the Internet. A drive 210 is also connected to the I / O interface 205 as required. A removable medium 211, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 210 as required so that a computer program read from it can be installed into the storage section 208 as required.

[0108] Specifically, according to an embodiment of the present disclosure, the method described in any of the above embodiments can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product that includes a computer program tangibly embodied on a machine-readable medium, the computer program including program code for performing any of the above methods. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 209, and / or installed from the removable medium 211.

[0109] As yet another aspect, the present application also provides a computer-readable storage medium, which can be the computer-readable storage medium included in the device of the above embodiment; or can exist separately and be a computer-readable storage medium not assembled into the device. The computer-readable storage medium stores one or more programs, and the one or more programs are used by one or more processors to execute the methods described in the present application.

[0110] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagram may represent a module, a program segment, or a part of code that contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than marked in the accompanying drawings. For example, two consecutive blocks shown may actually be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, and combinations of blocks in the block diagram and / or flowchart, can be implemented by a dedicated hardware-based system that performs the specified functions or operations, or can be implemented by a combination of dedicated hardware and computer instructions.

[0111] The units or modules involved in the embodiments described in this application can be implemented in software or in hardware. The described units or modules can also be provided in a processor. For example, each of the units can be a software program provided in a computer or a mobile intelligent device, or a separately configured hardware device. Among them, the names of these units or modules do not, in some cases, constitute a limitation on the units or modules themselves.

[0112] The above description is only a preferred embodiment of this application and an explanation of the technical principles applied. Those skilled in the art should understand that the scope of the invention involved in this application is not limited to the technical solutions formed by the specific combination of the above technical features, and should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the concept of this application. For example, the technical solutions formed by mutually replacing the above features with the (but not limited to) technical features with similar functions disclosed in this application.

Claims

1. A method for broadcasting transactions and blocks, characterized in that, The blockchain network is configured with consensus nodes and non-consensus nodes. Each of the consensus nodes can communicate with each other, and the consensus nodes form a consensus network. The method is applicable to the consensus nodes and includes: When the first transaction is generated by the current node or received through the rpc port, broadcast the first transaction to other consensus nodes, and subscribe to each first non-consensus node of the current node for each of the first non-consensus nodes: Broadcast the first transaction to each second consensus node that subscribes to the first non-consensus node, and each second non-consensus node that subscribes to the first non-consensus node; When receiving a second transaction through the p2p port, broadcast the second transaction to other consensus nodes and each of the first non-consensus nodes for each of the first non-consensus nodes: Broadcast the second transaction to each of the second consensus nodes and each of the second non-consensus nodes; Broadcast the first block to other consensus nodes and each of the first non-consensus nodes for each of the first non-consensus nodes: Broadcast the first block to each of the second non-consensus nodes.

2. The method according to claim 1, characterized in that, The broadcasting the first block to other consensus nodes and each of the first non-consensus nodes includes: Broadcast the first block to other consensus nodes, and broadcast the first light block of the first block to each of the first non-consensus nodes; wherein, the first light block broadcasts the first block header of the first block and the transaction hash list of the first block; The broadcasting the first block to each of the second non-consensus nodes includes: Find the corresponding third transactions in the transaction pool according to the transaction hash list; Restore the first block body of the first light block according to each of the third transactions; Restore the first block according to the first block header and the first block body; Broadcast the first light block to each of the second non-consensus nodes.

3. The method according to claim 2, wherein The finding the corresponding third transactions according to the transaction hash list includes: Perform the following operations on each transaction hash in the transaction hash list: Judge whether there is a third transaction corresponding to the transaction hash in the transaction pool: If not, cache the transaction hash; Send each cached transaction hash to the current node to request to obtain the missing third transactions.

4. The method according to claim 3, wherein The sending each cached transaction hash to the current node to request to obtain the missing third transactions includes: Perform the following operations on each cached transaction hash: Regularly perform the following operations: Judge whether there is a third transaction corresponding to the cached transaction hash in the transaction pool: If so, update each cached transaction hash; After the first duration, send the latest cached transaction hashes to the current node to request to obtain the missing third transactions.

5. The method according to claim 1, characterized in that, The broadcasting the first transaction to other consensus nodes and each of the first non-consensus nodes that subscribe to the current node includes: Verify the executability of the first transaction. When the verification passes, sign the first transaction according to the private key held, and broadcast the signed first transaction to other consensus nodes and each of the first non-consensus nodes that subscribe to the current node; Broadcasting the first transaction to each second consensus node subscribing to the first non-consensus node, and each second non-consensus node subscribing to the first non-consensus node includes: Verifying the signed first transaction according to the public key of the current node: When the verification passes, broadcasting the signed first transaction to each second consensus node subscribing to the first non-consensus node, and each second non-consensus node subscribing to the first non-consensus node; When the verification fails, not performing the step of broadcasting the signed first transaction to each second consensus node subscribing to the first non-consensus node, and each second non-consensus node subscribing to the first non-consensus node; and Marking the current node as an illegal node to reject other transactions or blocks broadcast by the current node.

6. A computer device, characterized in that, The device includes: One or more processors; A memory for storing one or more programs, When the one or more programs are executed by the one or more processors, causing the one or more processors to execute the method according to any one of claims 1-5.

7. A storage medium storing a computer program, characterized in that, When the program is executed by the processor, it implements the method according to any one of claims 1-5.

Images