WO2021027529A1

WO2021027529A1 - Block processing method and device, block consensus method and device and block synchronization method and device

Info

Publication number: WO2021027529A1
Application number: PCT/CN2020/104618
Authority: WO
Inventors: 陈宇杰; 李辉忠; 张开翔; 石翔; 范瑞彬
Original assignee: 深圳前海微众银行股份有限公司
Priority date: 2019-08-12
Filing date: 2020-07-24
Publication date: 2021-02-18
Also published as: CN110493148A; CN110493148B

Abstract

A block processing method and device, a block consensus method and device and a block synchronization method and device. The present invention is applicable to a blockchain system comprising a main consensus node and an auxiliary consensus node. The blockchain system comprises a blockchain and an empty block cache, wherein any block in the blockchain is not an empty block; the empty block cache is used for storing empty blocks, wherein the empty block in the empty block cache is an empty block generated after the mth block in the blockchain and is emptied when the (m+1)th block is added to the blockchain. The block processing method comprises: when determining that an ith block to be generated is an empty block, a main consensus node determining an empty block index value and a hash value of the latest empty block from an empty block cache, generating the ith block and broadcasting the ith block to each auxiliary consensus node, and storing the ith block in the empty block cache after it is determined that the ith block passes consensus verification. The technical solution can solve the problem that an empty block occupies a great deal of disk storage space in a node and improve the utilization of the disk in the node.

Description

Method and device for block processing, block consensus and block synchronization

Cross references to related applications

This application requires the priority of a Chinese patent application filed with the Chinese Patent Office, the application number is 201910741064.X, and the application name is "a block processing, block consensus and block synchronization method and device" on August 12, 2019 , Its entire content is incorporated in this application by reference.

Technical field

The present invention relates to the field of financial technology (Fintech), in particular to a block processing, block consensus and block synchronization method and device.

Background technique

With the development of computer technology, more and more technologies (for example: blockchain, cloud computing or big data) are applied in the financial field. The traditional financial industry is gradually transforming to financial technology, and blockchain technology is no exception. However, due to the security and real-time requirements of the finance and payment industries, financial technology also puts forward higher requirements on blockchain technology.

In the blockchain system, in order to ensure the timing of block generation, blockchain systems based on the consensus algorithm of proof of work (POW) and proof of stake (POS), such as Bitcoin, Ethereum, etc. The empty blocks are agreed and stored in the blockchain. In order to ensure the normal operation of the blockchain system and prevent the nodes in the blockchain system from doing evil, the blockchain system (such as Algorand) based on the practical byzantine fault tolerance (PBFT) consensus algorithm will be used when there is no transaction. In this case, empty blocks are generated, and the generated empty blocks are verified by consensus, and stored in the blockchain after the verification is passed.

However, the above methods all require the blockchain system to store empty blocks on the blockchain, and empty blocks will occupy a large amount of disk storage space in the node, reduce the utilization of the disk in the node, and then affect the storage of transactions in the node. Quantity.

Summary of the invention

The present invention provides a block processing, block consensus, and block synchronization method and device, which are used to solve the problem that the storage of empty blocks on the blockchain in the prior art causes the empty blocks to occupy the disk storage space in the node, thereby improving the Disk utilization.

In the first aspect, the present invention provides a block processing method, which is suitable for a blockchain system including a main consensus node and an auxiliary consensus node, and the blockchain system includes a blockchain and an empty block cache, Any block in the blockchain is not an empty block, and the empty block cache is used to store empty blocks. The block processing method includes:

When determining that the i-th block to be generated is an empty block, the master consensus node first determines the empty block index value of the latest empty block and the hash value of the latest empty block from the empty block cache, and then generates The i-th block and the i-th block are broadcast to each auxiliary consensus node to perform consensus verification on the i-th block. If it is determined that the i-th block passes the consensus verification, then Store the i-th block in the empty block cache.

Among them, i and m are positive integers. The empty block in the empty block cache is for the empty block generated after the mth block in the blockchain, and the empty block in the empty block cache is increased by the m+1th block in the blockchain When the block is cleared. The empty block index value is used to indicate the order in which each empty block in the empty block cache is generated, and the i-th block includes the empty block index value and the parent empty block hash of the i-th block Value, the hash value of the parent empty block of the i-th block is the hash value of the latest empty block, and the empty block index value of the i-th block is based on the empty block index of the latest empty block The value is determined.

In the above technical scheme, the blockchain system includes a blockchain and an empty block cache. The blockchain is used for permanent storage of ledger data, and the empty block cache is used for temporary storage of empty blocks. When a new block is generated and stored on the blockchain, the empty block in the current empty block cache will be emptied to save disk storage space in the node and improve disk utilization. Moreover, when the empty block is generated, the empty block index value and the parent empty block hash value of the empty block are packaged into the empty block at the same time, which is beneficial to each consensus node according to the empty block index value and the parent empty block hash value. , Combined with the local empty block cache to perform consensus verification on empty blocks, which helps to ensure the stability and security of the blockchain system. It can be seen that, under the premise of ensuring the security of the blockchain system, the technical solution can also increase the utilization rate of the disk in each node, which helps to enable each node to store more ledger data.

In an optional technical solution, generating the i-th block by the master consensus node includes: the master consensus node first obtains the block height and hash value of the highest block on the blockchain, Then add 1 to the block height of the highest block to determine the block height of the i-th block, and determine the hash value of the highest block as the parent block of the i-th block. Hope value, and finally the block height of the i-th block, the hash value of the parent block of the i-th block, the empty block index value of the i-th block and the i-th zone The hash value of the parent empty block of the block is packed into the i-th block.

In the above technical solution, when the master consensus node generates an empty block, it also determines the block height and the hash value of the parent block of the current empty block to be generated according to the block height and hash value of the highest block in the current blockchain. , Each consensus node can perform consensus verification on the empty block based on the block height of the empty block and the hash value of the parent block, combined with the locally stored blockchain, so as to further ensure the stability and security of the blockchain system.

In an optional technical solution, if the master consensus node determines that the i-th block to be generated is not an empty block, it can obtain the block height and hash value of the highest block on the blockchain , The block height of the highest block is increased by 1 to determine the block height of the i-th block, and the hash value of the highest block is determined as the parent block of the i-th block. Hope value, and then pack the block height of the i-th block and the hash value of the parent block of the i-th block into the i-th block.

In the above technical solution, when the master consensus node generates a non-empty block, it will also determine the block height and parent block hash of the current non-empty block to be generated according to the block height and hash value of the highest block in the current blockchain In this way, each consensus node can also perform consensus verification on the non-empty block based on the block height of the non-empty block and the hash value of the parent block in combination with the locally stored blockchain. Furthermore, when storing the non-empty block on the blockchain, all empty blocks in the current empty block cache can be cleared to further reduce the disk occupancy rate in the node.

In an optional technical solution, the empty block cache includes the latest empty block index value, and the latest empty block index value is the empty block index value of the latest empty block. In this case, determining the empty block index value of the latest empty block and the hash value of the latest empty block by the master consensus node from the empty block cache includes: the master consensus node according to the latest empty block Index value, determining the latest empty block from the empty block cache, and obtaining the empty block index value of the latest empty block and the hash value of the latest empty block. Correspondingly, after storing the i-th block in the empty block cache, the master consensus node may also add 1 to the latest empty block index value.

In the above technical solution, by setting the latest empty block index value in the empty block cache (that is, the empty block index value of the latest empty block in the current empty block cache), the master consensus node can also generate an empty block according to the latest empty block index. The block index value determines the empty block index value and hash value of the latest empty block from the empty block cache. This technical solution does not require the master consensus node to find the latest empty block from the empty block cache, but can directly determine the latest empty block according to the index value of the latest empty block, thereby improving the efficiency of the master consensus node generating empty blocks.

In a second aspect, the present invention provides a block consensus method, which is applicable to a blockchain system including a main consensus node and an auxiliary consensus node, and the blockchain system includes a blockchain and an empty block cache, Any block in the blockchain is not an empty block, and the empty block cache is used to store empty blocks. Wherein, the empty block in the empty block cache is for the empty block generated after the mth block in the blockchain, and the empty block in the empty block cache is increased by the m+th block in the blockchain. 1 block is cleared, m is a positive integer, the empty block includes the empty block index value and the parent empty block hash value, the empty block index value is used to indicate the empty block in the empty block cache Successively. The block consensus method includes:

After the secondary consensus node receives the i-th block broadcast by the main consensus node, it determines the empty block index value of the i-th block and the i-th block from the i-th block Determine the hash value of the first empty block and the empty block index value of the first empty block from the empty block cache of the auxiliary consensus node, and then perform consensus on the i-th block Verification: If it is determined that the i-th block passes the consensus verification, the i-th block is stored in the empty block cache of the auxiliary consensus node. Wherein, i is a positive integer, the first empty block is the latest empty block in the empty block cache of the auxiliary consensus node, and the i-th block passing consensus verification includes: the empty block of the i-th block The block index value and the empty block index value of the first empty block meet a preset requirement, and the hash value of the parent empty block of the i-th block is equal to the hash value of the first empty block.

In the above technical scheme, the blockchain system includes a blockchain and an empty block cache. The blockchain is used for permanent storage of ledger data, and the empty block cache is used for temporary storage of empty blocks. When a new block is generated and stored on the blockchain, the empty block in the current empty block cache will be cleared, which helps to save the disk storage space in the node and improve the utilization of the disk. Moreover, after receiving the i-th block, the secondary consensus node determines the empty block index value and parent empty block hash value of the i-th block from the i-th block, and combines the local empty block cache The empty block index value and hash value of the latest empty block in, perform consensus verification on the i-th block, which can ensure the stability and security of the blockchain system.

In an optional technical solution, the auxiliary consensus node may also determine the block height of the i-th block and the parent block of the i-th block from the i-th block. Hope value, determine the block height of the highest block and the hash value of the highest block from the blockchain of the secondary consensus node, if the block height of the i-th block is equal to the highest block’s If the block height is increased by 1, and the hash value of the parent block of the i-th block is equal to the hash value of the highest block, the i-th block passes the consensus verification.

In the above technical solution, the block height of the i-th block and the hash value of the parent block are obtained through the auxiliary consensus node, and the block height of the i-th block and the hash value of the parent block are combined with the local blockchain. The block height and hash value of the highest block of, and the consensus verification of the i-th block can further ensure the stability and security of the blockchain system.

In an optional technical solution, when the secondary consensus node determines from the i-th block that the empty block index value of the i-th block is a preset value, and the i-th zone If the hash value of the parent empty block of the block is a null value, the secondary consensus node determines the block height of the i-th block and the parent block of the i-th block from the i-th block Hash value, determine the block height of the highest block and the hash value of the highest block from the blockchain of the secondary consensus node, if it is determined that the block height of the i-th block is equal to the highest zone If the block height is increased by 1, and the hash value of the parent block of the i-th block is equal to the hash value of the highest block, it is determined that the i-th block passes the consensus verification, and The i-th block is stored in the empty block cache of the auxiliary consensus node.

In the above technical solution, when the secondary consensus node determines that the index value of the empty block in the i-th block is a preset value, and the hash value of the parent block is empty, it can be determined that the i-th block is an empty block in the cache The first empty block. The auxiliary consensus node performs consensus verification on the first empty block in the empty block cache, which can verify the block height of the first empty block and the hash value of the parent block, which helps to ensure the stability and security of the blockchain system Sex.

In a third aspect, the present invention provides a block synchronization method, which is suitable for a block chain system including multiple nodes. The block chain system includes a block chain and an empty block cache. Any block in the chain is not an empty block, and the empty block cache is used to store empty blocks. Wherein, the empty block in the empty block cache is for the empty block generated after the mth block in the blockchain, and the empty block in the empty block cache is increased by the m+th block in the blockchain. 1 block is cleared, m is a positive integer, the multiple nodes include a first node and a second node, the first node is any one of the multiple nodes, and the second node is all Any one of the plurality of nodes except the first node. The block synchronization method includes:

The first node receives the state information broadcast by the second node, and obtains the empty block index value of the latest empty block in the empty block cache of the second node and the block of the second node from the state information The block height of the highest block of the chain, if it is determined that the block height of the highest block of the second node’s blockchain is equal to the block height of the highest block of the first node’s blockchain, and the second If the empty block index value of the latest empty block of the node is greater than the empty block index value of the latest empty block of the first node, the empty block to be synchronized is determined from the empty block cache of the second node, and the to-be-synchronized empty block is determined The empty block is synchronized to the empty block cache of the first node. The empty block to be synchronized is an empty block whose empty block index value in the empty block cache of the second node is greater than the empty block index value of the latest empty block of the first node.

In the above technical solution, considering that if the performance of each node in the blockchain system is different, there may be cases in which the data in the blockchain or empty block cache of the nodes in the blockchain system is not synchronized. Therefore, if the first node and the The data in the blockchain of the second node is synchronized, and the data in the empty block cache is not synchronized, the first node can obtain the empty block to be synchronized from the second node to ensure that all nodes in the blockchain system are up to date status.

In an optional technical solution, the first node synchronizing the empty block to be synchronized to the empty block cache of the first node includes: the first node targets any empty block to be synchronized, Obtain the parent empty block hash value and the empty block index value of the empty block to be synchronized, if it is determined that the parent empty block hash value of the empty block to be synchronized is equal to the latest empty block in the empty block cache of the first node Hash value, and the empty block index value of the empty block to be synchronized is equal to the empty block index value of the latest empty block of the first node plus 1, then it is determined to synchronize the empty block to be synchronized to the first node The empty block is in the cache.

In an optional technical solution, the empty block to be synchronized includes the hash value of the parent block. In this case, the first node determines to synchronize the empty block to be synchronized to the first node Before the empty block is cached, it can also be determined whether the hash value of the parent block in the empty block to be synchronized is equal to the hash value of the highest block on the blockchain of the first node.

In the above technical solution, considering that the first node will receive the state information broadcast by multiple nodes, that is, the first node can synchronize data to multiple nodes at the same time. In order to avoid the first node from synchronizing repeated data to multiple nodes, When the first node synchronizes data, it can first perform repetitive verification on empty blocks to be synchronized, so that the first node does not synchronize data that has already been synchronized as much as possible.

In an optional technical solution, the state information further includes the block height of the block chain of the second node. In this case, the first node is in the empty block from the second node. Before the cache determines the empty block to be synchronized, if it is determined that the block height of the highest block of the blockchain of the second node is greater than the block height of the highest block of the blockchain of the first node, synchronize the second After the blocks of the block chain of the node that are higher than the block chain of the first node are synchronized, the empty block cache of the first node is cleared.

In the above technical solution, the first node first synchronizes the non-empty blocks on the blockchain from the second node according to the block height of the highest block of the local blockchain and the block height of the highest block of the second node’s blockchain. , And after synchronizing to a non-empty block, clear the empty block in the local empty block cache. By adopting the scheme of synchronizing the non-empty blocks first and then synchronizing the empty blocks, the data synchronization in the first node can be realized with the least number of synchronizations.

In a fourth aspect, the present invention provides a block processing device suitable for a block chain system including a main consensus node and an auxiliary consensus node. The block chain system includes a block chain and an empty block cache. The block chain None of the blocks is an empty block, and the empty block cache is used to store empty blocks. The device includes:

The determining unit is configured to determine the empty block index value of the latest empty block and the hash value of the latest empty block from the empty block cache when it is determined that the i-th block to be generated is an empty block; where i , M is a positive integer; the empty block in the empty block cache is for the empty block generated after the mth block in the blockchain, and the empty block in the empty block cache is in the blockchain It is emptied when the m+1 th block is added, and the empty block index value is used to indicate the sequence in which the empty blocks in the empty block cache are generated;

A generating unit, configured to generate the i-th block and broadcast the i-th block to each auxiliary consensus node; the i-th block includes the empty block index of the i-th block Value and the parent empty block hash value, the parent empty block hash value of the i-th block is the hash value of the latest empty block, and the empty block index value of the i-th block is based on the The empty block index value of the latest empty block is determined;

The storage unit is configured to store the i-th block in the empty block cache after determining that the i-th block passes the consensus verification.

In an optional technical solution, the generating unit is specifically configured to: obtain the block height and hash value of the highest block on the blockchain, and determine that the block height of the highest block is increased by 1 The block height of the i-th block, the hash value of the highest block is determined as the parent block hash value of the i-th block, and the block height of the i-th block The hash value of the parent block of the i-th block, the empty block index value of the i-th block and the hash value of the parent empty block of the i-th block are packed into the i-th zone Piece.

In an optional technical solution, the generating unit is further configured to: when the determining unit determines that the i-th block to be generated is not an empty block, obtain the value of the highest block on the blockchain Block height and hash value, the block height of the highest block plus 1 is determined as the block height of the i-th block, and the hash value of the highest block is determined as the i-th zone The hash value of the parent block of the block, the block height of the i-th block and the hash value of the parent block of the i-th block are packed into the i-th block.

In an optional technical solution, the empty block cache includes the latest empty block index value, and the latest empty block index value is the empty block index value of the latest empty block. The determining unit is specifically configured to: determine the latest empty block from the empty block cache according to the latest empty block index value and obtain the empty block index value of the latest empty block and the hash value of the latest empty block. Hope value. Correspondingly, the storage unit is further configured to: after storing the i-th block in the empty block cache, add 1 to the latest empty block index value.

In a fifth aspect, the present invention provides a block consensus device, which is suitable for a block chain system including a main consensus node and an auxiliary consensus node. The block chain system includes a block chain and an empty block cache. The block chain None of the blocks is an empty block, and the empty block cache is used to store empty blocks. Wherein, the empty block in the empty block cache is for the empty block generated after the mth block in the blockchain, and the empty block in the empty block cache is increased by the m+th block in the blockchain. 1 block is cleared, m is a positive integer, the empty block includes the empty block index value and the parent empty block hash value, the empty block index value is used to indicate the empty block in the empty block cache Priority. The device includes:

A receiving unit for receiving the i-th block broadcast by the master consensus node; i is a positive integer;

The determining unit is configured to determine the empty block index value of the i-th block and the hash value of the parent empty block of the i-th block from the i-th block, and from the auxiliary consensus node Determining the hash value of the first empty block and the empty block index value of the first empty block in the empty block cache; the first empty block is the latest empty block in the empty block cache of the secondary consensus node;

A storage unit, configured to store the i-th block in the empty block cache of the auxiliary consensus node if it is determined that the i-th block passes the consensus verification; the i-th block passes the consensus verification Including the empty block index value of the i-th block and the empty block index value of the first empty block meet the preset requirements, and it is determined that the hash value of the parent empty block of the i-th block is equal to the The hash value of an empty block.

In an optional technical solution, the determining unit is further configured to: determine the block height of the i-th block and the parent block of the i-th block from the i-th block The hash value determines the block height of the highest block and the hash value of the highest block from the blockchain of the auxiliary consensus node. Correspondingly, the i-th block passes the consensus verification, further comprising: the block height of the i-th block is equal to the block height of the highest block plus 1, and the parent area of the i-th block The block hash value is equal to the hash value of the highest block.

In an optional technical solution, the determining unit is further configured to: determine from the i-th block that the empty block index value of the i-th block is a preset value, and the i-th block The hash value of the parent empty block of each block is a null value, and the block height of the i-th block and the hash value of the parent block of the i-th block are determined from the i-th block, Determine the block height of the highest block and the hash value of the highest block from the blockchain of the secondary consensus node, if it is determined that the block height of the i-th block is equal to the block height of the highest block Plus 1, and the hash value of the parent block of the i-th block is equal to the hash value of the highest block, it is determined that the i-th block passes the consensus verification.

In a sixth aspect, the present invention provides a block synchronization device, which is suitable for a block chain system including multiple nodes. The block chain system includes a block chain and an empty block cache, and any block in the block chain All blocks are not empty blocks, and the empty block cache is used to store empty blocks. Wherein, the empty block in the empty block cache is for the empty block generated after the mth block in the blockchain, and the empty block in the empty block cache is increased by the m+th block in the blockchain. 1 block is cleared, m is a positive integer, the multiple nodes include a first node and a second node, the first node is any one of the multiple nodes, and the second node is all Any one of the plurality of nodes except the first node. The device includes:

The receiving unit is configured to receive the state information broadcast by the second node; the state information includes the empty block index value of the latest empty block in the empty block cache of the second node and the block chain value of the second node The block height of the highest block;

The determining unit is configured to determine that the block height of the highest block of the blockchain of the second node is equal to the block height of the highest block of the blockchain of the first node and the latest empty block of the second node If the empty block index value is greater than the empty block index value of the latest empty block of the first node, the empty block to be synchronized is determined from the empty block cache of the second node; the empty block to be synchronized is the second The empty block whose empty block index value is greater than the empty block index value of the latest empty block of the first node in the empty block cache of the node;

The synchronization unit is configured to synchronize the empty block to be synchronized to the empty block cache of the first node.

In an optional technical solution, the synchronization unit is specifically configured to: for any empty block to be synchronized, obtain the parent empty block hash value and the empty block index value of the empty block to be synchronized, and if it is determined that the The hash value of the parent empty block of the empty block to be synchronized is equal to the hash value of the latest empty block in the empty block cache of the first node, and the empty block index value of the empty block to be synchronized is equal to the latest empty block of the first node The empty block index value of the empty block is increased by 1, and it is determined to synchronize the empty block to be synchronized to the empty block cache of the first node.

In an optional technical solution, the empty block to be synchronized includes the hash value of the parent block. In this case, before determining to synchronize the empty block to be synchronized to the empty block cache of the first node, the synchronization unit also determines whether the hash value of the parent block in the empty block to be synchronized is equal to all The hash value of the highest block on the blockchain of the first node.

In an optional technical solution, the state information further includes the block height of the blockchain of the second node. In this case, before the synchronization unit determines the empty block to be synchronized from the empty block cache of the second node, if it is determined that the block height of the highest block of the blockchain of the second node is greater than the If the block height of the highest block of the blockchain of the first node is synchronized, the block of the blockchain of the second node that is higher than the block of the first node’s blockchain is synchronized, and is in the area of the first node. After the blocks of the block chain are synchronized, the empty block cache of the first node is cleared.

In a seventh aspect, the present invention provides a computing device, including:

Memory, used to store program instructions;

The processor is configured to call the program instructions stored in the memory, and execute the block processing method, block consensus method, and block synchronization method described in any of the first to third aspects according to the obtained program.

In an eighth aspect, the present invention provides a computer-readable non-volatile storage medium, including computer-readable instructions. When the computer reads and executes the computer-readable instructions, the computer executes the first to third aspects described above. Any of the block processing methods, block consensus methods, and block synchronization methods.

Description of the drawings

In order to more clearly describe the technical solutions in the embodiments of the present invention, the following will briefly introduce the drawings needed in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, without creative work, other drawings can be obtained from these drawings.

FIG. 1 is a schematic structural diagram of an empty block header provided by an embodiment of the present invention;

2 is a schematic flowchart of a block processing method provided by an embodiment of the present invention;

FIG. 3 is a schematic flowchart of another block processing method provided by an embodiment of the present invention;

4 is a schematic flowchart of a block consensus method provided by an embodiment of the present invention;

FIG. 5 is a schematic flowchart of another block consensus method provided by an embodiment of the present invention;

6 is a process of hollow block processing and consensus in a PBFT consensus algorithm provided by an embodiment of the present invention;

FIG. 7 is a schematic flowchart of a block synchronization method provided by an embodiment of the present invention;

FIG. 8 is a schematic diagram of a second node broadcasting status information according to an embodiment of the present invention;

FIG. 9 is a schematic diagram of receiving state information of a first node according to an embodiment of the present invention;

10 is a schematic structural diagram of a block processing apparatus provided by an embodiment of the present invention;

FIG. 11 is a schematic structural diagram of a block consensus device provided by an embodiment of the present invention;

FIG. 12 is a schematic structural diagram of a block synchronization device provided by an embodiment of the present invention.

detailed description

In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of them. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of the present invention.

To better explain the present invention, first explain the terms involved in the embodiments of the present invention:

Block: The basic unit that constitutes the blockchain. It consists of a block header containing metadata and a block body containing transaction data. The block header mainly includes the hash of the parent block.

Blockchain: A blockchain is a chain composed of a series of blocks. In addition to recording the data of the block, each block also records the hash value (Hash) of the previous block. In this way, a chain is formed. There are two core concepts of the blockchain, one is cryptography and the other is decentralization. Based on these two concepts, the historical information on the blockchain cannot be tampered with. A block is composed of a block header and a block body. The block header includes important fields such as the block height of the block and the parent block hash (prevHash), and the block body mainly stores transaction data.

Consensus algorithm: Each node in the blockchain network confirms a batch of transactions through an algorithm, and ensures that all nodes have a consistent confirmation result for this batch of data. This algorithm is the consensus algorithm of the blockchain, which is currently common Consensus algorithms include PBFT, replication and fault tolerance (Raft), POW, POS, etc.

Transaction pool: The queue that stores all valid transactions initiated by the client is called the transaction pool. The transactions that enter the transaction pool must meet the following conditions: (1) It does not overlap with existing transactions in the transaction pool; (2) It is the same as that recorded in the block. The transaction is not repeated; (3) The signature is valid.

Node: Each participant in the blockchain network is a node, and the node participates in network formation and data exchange. In the blockchain network, a node refers to a participant with a unique identity. The node has a complete copy of the ledger and has the ability to participate in the consensus and maintenance of the blockchain network.

Consensus node: A node that can participate in consensus block generation. Its main functions include: packaging transactions in the transaction pool into blocks; executing transactions; running consensus algorithms and writing consensus blocks into the ledger.

PBFT consensus algorithm: It can reach a consensus in a few nodes doing evil (such as forging messages). It uses cryptographic algorithms such as signatures, signature verification, and hashing to ensure tamper-proof modification, anti-forgery, and non-repudiation in the process of message transmission. And optimize the previous work, reduce the complexity of the Byzantine fault-tolerant algorithm from exponential level to polynomial level, in a system composed of (3×f+1) nodes, as long as there are no less than (2×f+1) If non-malicious nodes work normally, the system can reach consistency. For example, in a 7-node system, 2 nodes are allowed to have Byzantine errors.

Empty block: A block that does not contain any transactions.

Non-empty block: corresponds to the empty block, including the transaction block.

QPS (Query Per Second): The number of requests per second. The calculation consensus is the number of requests divided by time.

The present invention provides a block processing method, a block consensus method, and a block synchronization method, which are suitable for a block chain system. The block chain system is the aforementioned block chain network. The block chain system includes a block chain and Empty block cache, the blockchain is used to store non-empty blocks, that is, any block in the blockchain is not an empty block, the empty block cache is used to store empty blocks, and the empty blocks in the empty block cache are for the blockchain The empty blocks generated after the mth block in the middle and empty blocks in the empty block cache are emptied when the m+1th block is added to the blockchain. Among them, m is a positive integer.

It is explained that there are two storage methods in the blockchain system, one is to store non-empty blocks in the blockchain, and the other is to store empty blocks in the empty block cache. The purpose of the block chain system to generate empty blocks is to prevent malicious nodes in the block chain from tampering with data, and the block chain system will be consensus on the chain after generating the empty blocks. The empty block upload in the present invention refers to storing the empty block in the empty block cache. In order to save storage space in the node, the empty block in the empty block cache will be emptied after the next non-empty block is uploaded (stored to the blockchain), that is, all empty blocks in the current empty block cache are deleted.

For example, there are 100 non-empty blocks on the current blockchain, that is, the block height is 100. At this point, the first empty block is generated and stored in the empty block cache, and then the second empty block, the third empty block...the tenth empty block is generated and stored in the empty block cache. However, no non-empty block will be generated from the first empty block to the tenth empty block. When the 101st non-empty block is generated in the blockchain system and stored on the blockchain after consensus, the block height is 101, and the blockchain system deletes the 10 empty blocks currently cached in the empty block cache. If the blockchain system generates an empty block again, it will be stored as the first empty block in the empty block cache again, and then the second empty block to the nth empty block may be stored in the empty block cache, but it will When the 102nd non-empty block is generated and stored on the blockchain by consensus, it is emptied again.

Through the above process, all empty blocks and non-empty blocks generated in the blockchain system can be guaranteed to be agreed, so as to reduce the storage space occupied by empty blocks in the blockchain system. Improve disk utilization efficiency.

For example, a block chain system generates a block in 1 second. There are no transactions 50% of the time in a day. Each empty block is 1KB in size. If these empty blocks are stored on the blockchain, a sky block will occupy The disk space is: 3600s/h×24h×50%×1KB≈43.2MB, and one-year empty blocks occupy about 15.7GB of disk space. Assuming that the average transaction size is 1KB, then 15.7GB of disk space can be used to store 15.7GB/1KB=15700 transactions.

In combination with the above description, in order to realize the empty block consensus, the header of the empty block can be set. The header of an empty block includes multiple fields, which can include empty block index value, parent empty block hash value, parent block hash value (prevHash), block height (blockNumber), and sealer. Wherein, the index value of the empty block and the hash value of the parent empty block can be stored in an extended array (extraData). FIG. 1 is a structure of an empty block header provided by an embodiment of the present invention. The following describes each field in the header of the empty block shown in FIG. 1.

Parent block hash: the hash value of the highest non-empty block, that is, the hash value of the highest block on the blockchain;

Block height: the block height of the highest non-empty block plus 1, that is, the block height of the highest block on the blockchain plus 1;

Packager: The index of the consensus node that generates the empty block, which is equivalent to the index of the master consensus node. Considering that the node identification number (Identification, ID) is very long, directly including the node ID field in the consensus message will consume part of the network bandwidth. Therefore, the blockchain system in the embodiment of the present invention introduces a node index. A public node list can be set in the blockchain system, and the node index of each node is recorded in the public node list, and the node index is used to indicate the position of each node in the public node list. When sending a network message packet, you only need to bring the node index, and other nodes can index the node ID from the public node list, and then verify the signature of the network message.

Empty block index value; the empty block index value generated based on the highest non-empty block, used to indicate the order of the empty blocks in the empty block cache, such as: the current empty block is the fifth generated based on the 10th non-empty block Empty block, the empty block index of the current empty block is 4.

Hash value of the parent empty block: The hash value of the previous empty block can be obtained through the empty block cache.

The empty block cache can be understood as an empty block table consisting of multiple empty block arrangements. As shown in Table 1, it is an empty block table structure. The nth empty block records the n-1th empty block Hash value, the index value of the empty block recorded in the nth empty block is (n-1). The empty block table records the latest empty block index value (latestIdx) of the current empty block cache, that is, the empty block index value of the latest empty block. When the n+1th empty block is generated in the blockchain system, the blockchain system will add 1 to the index value of the latest empty block and pack it into the header of the n+1th empty block. When the empty block is stored in the empty block cache, the latest empty block index value is updated to n.

Table 1

KeyKey	ValueValue
number_0number_0	emptyBlock_0emptyBlock_0
number_1number_1	emptyBlock_1emptyBlock_1
……	……
number_(n-1)number_(n-1)	emptyBlock_(n-1)emptyBlock_(n-1)
latestIdxlatestIdx	(n-1)(n-1)

Further, the blockchain system includes multiple nodes, and each node stores the above-mentioned blockchain and empty block cache locally. The multiple nodes include a main consensus node and an auxiliary consensus node. Among them, the main consensus node is used for packaging blocks and block consensus, and the auxiliary consensus node is used for block consensus. There is one and only one master consensus node in each round of consensus, and after each round of consensus, the master consensus node will be switched.

Figures 2 and 3 exemplarily show the flow of a block processing method provided by an embodiment of the present invention. The flow can be executed by a block processing device, which can be located in a node of a blockchain network, for example, The master consensus node for packaging blocks. In the embodiment of this application, the blockchain system periodically generates blocks. When the master consensus node is generating blocks, it can first determine whether any transactions are packaged into the block when the current block is generated, that is, whether the block to be generated is an empty block . In the embodiment of the present invention, when the block to be generated is an empty block and a non-empty block, the corresponding operation steps are different, and the following descriptions are divided into situations.

As shown in Figure 2, the specific process when the master consensus node determines that the block to be generated is an empty block, the process includes:

Step 201: When determining that the i-th block to be generated is an empty block, the master consensus node determines the empty block index value of the latest empty block and the hash value of the latest empty block from the empty block cache;

Step 202: The main consensus node generates the i-th block and broadcasts the i-th block to each auxiliary consensus node;

In step 203, after determining that the i-th block passes the consensus verification, the master consensus node stores the i-th block in the empty block cache.

Among them, i is a positive integer, at least one empty block is stored in the empty block cache, and the master consensus node can determine the latest empty block from the empty block cache, that is, the last empty block stored in the empty block cache. The master consensus node determines the empty block index value of the latest empty block and the hash value of the latest empty block according to the latest empty block, wherein the empty block index of the i-th block is determined according to the empty block index value of the latest empty block The value can be the empty block index value of the i-th block determined by adding 1 to the empty block index value of the latest empty block, and the hash value of the latest empty block is determined as the parent empty block of the i-th block. Hope value, and generate the i-th block according to the empty block index value of the i-th block and the hash value of the parent empty block.

In an optional implementation manner, the i-th block may include the empty block index value and the parent empty block hash value of the i-th block, and may also include the block height of the i-th block and the i-th block. The hash value of the parent block of each block. Among them, the block height of the i-th block can be the block height of the highest block on the current blockchain plus 1, or it can be equal to the highest block on the current blockchain. The hash value of the parent block of the i-th block may be the hash value of the highest block on the current blockchain, for example, it may be the hash value of the block header of the highest block. In this situation:

In one implementation, the master consensus node can obtain the block height and hash value of the highest block from the blockchain, add 1 to the block height of the highest block to determine the block height of the i-th block, and The hash value of the highest block is determined as the hash value of the parent block of the i-th block, and then the block height of the i-th block, the hash value of the parent block of the i-th block, and the i-th block The empty block index value of the block and the hash value of the parent empty block of the i-th block are packed into the i-th block.

In another implementation manner, the latest empty block index value may be set in the empty block cache, and the latest empty block index value is the empty block index value of the latest empty block. In this way, the master consensus node can determine the latest empty block index value from the empty block cache, and according to the latest empty block index value, determine the latest empty block from the empty block cache and obtain the empty block index value of the latest empty block and the latest empty block index value. Hash value, and then hash the block height of the i-th block, the hash value of the parent block of the i-th block, the empty block index value of the i-th block and the parent empty block of the i-th block The value is packed into the i-th block. After storing the i-th block in the empty block cache, the master consensus node can increase the index value of the latest empty block by 1.

It should be noted that in the above embodiment, before the master consensus node generates the i-th block, if at least one empty block is stored in the empty block cache, the master consensus node can obtain the parent empty block of the i-th block. Hope value. If there is no empty block stored in the empty block cache, it is equivalent to the i-th block being the first empty block in the current empty block cache, and the master consensus node cannot obtain the parent empty block hash of the i-th block In this case, the master consensus node can set the hash value of the parent empty block of the i-th block to be empty. In the embodiment of the present invention, the master consensus node can directly determine whether there are empty blocks stored in the current empty block cache before generating the i-th block, or read the latest empty block index value in the current empty block cache to determine Whether there are empty blocks stored in the current empty block cache, if the master consensus node reads that the latest empty block index value is a preset value, it can determine that there are no empty blocks stored in the current empty block cache. The preset value can be -1 or 0 or other values, the preset value is used to indicate that there are no empty blocks in the current empty block cache. Further, after determining that no empty block is stored in the current empty block cache, the master consensus node sets the hash value of the parent empty block of the i-th block to empty, and sets the empty block index value of the i-th block Set to the preset value plus 1.

In specific implementation, the master consensus node can obtain the latest empty block index value. If the latest empty block index value is -1, the block header of the highest non-empty block on the blockchain is obtained, and the block header of the highest non-empty block is hashed The value is determined as the hash value of the parent block of the current empty block, and 0 is determined as the empty block index value of the current empty block, and the block height of the highest non-empty block is added by 1 to determine the block height of the current empty block. If the index value of the latest empty block is greater than 0, read the block header of the latest empty block from the empty block cache, and determine the hash value of the latest empty block as the parent empty block hash value of the current empty block. The latest empty block index value plus 1 is determined as the empty block index value of the current empty block, and the block header hash value of the highest non-empty block is determined as the parent block hash value of the current empty block, and the highest non-empty block The block height plus 1 is determined as the block height of the current empty block.

As shown in Figure 3, the specific process when the master consensus node determines that the block to be generated is a non-empty block, the process includes:

Step 301: When determining that the i-th block to be generated is not an empty block, the master consensus node obtains the block height and hash value of the highest block on the blockchain;

Step 302: The master consensus node adds 1 to the block height of the highest block to determine the block height of the i-th block, and determines the hash value of the highest block as the parent block hash value of the i-th block;

Step 303: The master consensus node packs the block height of the i-th block and the hash value of the parent block of the i-th block into the i-th block;

Step 304, the main consensus node broadcasts the i-th block to each auxiliary consensus node;

Step 305: After determining that the i-th block passes the consensus verification, the master consensus node stores the i-th block in the blockchain, and clears the empty block in the current empty block cache.

In this case, the i-th block is the m+1th block, and storing the i-th block in the blockchain is equivalent to storing the m+1th block in the blockchain. That is, the empty block in the empty block cache is generated after the mth block in the blockchain, and will be deleted when the m+1th block is stored in the blockchain.

In the foregoing embodiment, the master consensus node can generate an empty block or a non-empty block, and each consensus node can perform consensus verification on the empty block and the non-empty block respectively. The details are as follows:

Each consensus node performs consensus verification on non-empty blocks: non-empty blocks include parent block hash value, block height, and master consensus node index. Each consensus node can be based on the parent block hash value and block height of the non-empty block. , The index of the master consensus node, combined with the blockchain of this consensus node, to perform consensus verification on the non-empty block;

Each consensus node performs consensus verification on the empty block: the empty block generated by the master consensus node can be divided into whether it is the first empty block in the empty block cache. If it is not the first empty block in the empty block cache, the empty block The block includes the parent block hash value, block height, empty block index value, parent block hash value, and master consensus node index. When consensus is on the empty block, each consensus node can be based on the parent block in the empty block. Hope value, block height, empty block index value, parent empty block hash value, master consensus node index, combined with the consensus node's blockchain and empty block cache, perform consensus verification on the empty block. If it is the first empty block in the empty block cache, the empty block includes the hash value of the parent block, the block height, the index value of the empty block, and the index of the master consensus node. When consensus is reached on the empty block, each consensus node can According to the parent block hash value, block height, empty block index value, master consensus node index in the empty block, combined with the consensus node's blockchain and empty block cache, consensus verification is performed on the empty block.

It can be seen from this that, in the embodiment of the present invention, whether the blockchain system generates empty blocks or non-empty blocks, consensus verification will be performed on the generated empty blocks or non-empty blocks to ensure the security of nodes in the blockchain system. At the same time, non-empty blocks will be stored in the blockchain for permanent storage, empty blocks will be stored in the empty block cache, and the empty block cache will be cleared when a new block is added to the blockchain to save disk storage Space to improve disk utilization. Under the premise of ensuring the security of the blockchain system, this method can also improve the utilization of disks in each node, which helps to enable each node to store more ledger data.

Based on the same inventive concept, the present invention also provides a block consensus method. The block consensus method is also applicable to the above-mentioned blockchain system, and may be after the master consensus node packs and broadcasts the i-th block, The process by which consensus nodes carry out consensus. Each consensus node can agree on empty blocks, non-empty blocks, and in empty block consensus, it can be the consensus on the first empty block in the empty block cache, or the consensus on the first empty block in the empty block cache. Empty block consensus. Here, the consensus of a non-empty block is to verify the block height of the i-th block and the hash value of the parent block. The specific verification process will not be repeated, but the consensus node will determine that the i-th block has passed the consensus verification. After the empty blocks are stored on the blockchain, the empty blocks in the local empty block cache can be cleared.

The following specifically describes the specific implementation of consensus nodes on empty blocks. For the convenience of description, the nodes used for consensus are called auxiliary consensus nodes below. When the secondary consensus node receives the i-th block, it can determine whether there is a parent empty block hash value in the i-th block or can read the empty block index value in the i-th block to determine the Whether the i-th block is the first empty block in the empty block cache.

In an optional implementation manner, when the auxiliary consensus node determines that the i-th block is not the first empty block, the auxiliary consensus node may execute the process of each step in the flowchart shown in FIG. 4, which includes :.

Step 401, the auxiliary consensus node receives the i-th block broadcast by the main consensus node;

Step 402: The auxiliary consensus node determines the empty block index value of the i-th block and the hash value of the parent empty block of the i-th block from the i-th block;

Step 403: The auxiliary consensus node determines the hash value of the first empty block and the empty block index value of the first empty block from the empty block cache of the auxiliary consensus node;

In step 404, if the auxiliary consensus node determines that the i-th block passes the consensus verification, the i-th block is stored in the empty block cache of the auxiliary consensus node.

In this implementation manner, after the auxiliary consensus node receives the i-th block, it combines the blockchain of the auxiliary consensus node and the empty block cache to perform consensus verification on the empty block. Specifically, after determining that the latest empty block in the local empty block cache is the first empty block, the secondary consensus node determines the empty block index value of the first empty block and the hash value of the first empty block, and determines the i-th empty block Whether the empty block index value of the block and the empty block index value of the first empty block meet the preset requirements can be determined by judging whether the empty block index value of the i-th block is equal to the empty block index value of the first empty block plus 1. And judging whether the hash value of the parent empty block of the i-th block is equal to the hash value of the first empty block, and if the two judgments are equal, it is determined that the i-th block passes the consensus verification.

Exemplarily, when the auxiliary consensus node performs consensus verification on the i-th block, it may also include verification of the block height in the i-th block and the hash value of the parent block. Specifically, the secondary consensus node determines the block height of the i-th block and the hash value of the parent block of the i-th block from the i-th block, and determines the highest block from the blockchain of the secondary consensus node The block height of and the hash value of the highest block, and the consensus verification of the i-th block is performed according to the block height and the parent block hash. In other words, consensus verification includes not only verifying whether the empty block index value of the i-th block and the empty block index value of the first empty block meet the preset requirements, but also verifying whether the hash value of the parent empty block is equal to that of the first empty block. The hash value also includes: verifying whether the block height of the i-th block is equal to the block height of the highest block plus 1 and whether the hash value of the parent block of the i-th block is equal to the hash value of the highest block.

In another optional implementation, when the auxiliary consensus node determines that the i-th block is the first empty block, that is, the auxiliary consensus node determines that the empty block index value of the i-th block is a preset value, and If the hash value of the parent empty block of the i-th block is a null value, the auxiliary consensus node can execute the process of each step in the flowchart shown in FIG. 5, which includes:

Step 501, the auxiliary consensus node determines the block height of the i-th block and the hash value of the parent block of the i-th block from the i-th block;

Step 502, the auxiliary consensus node determines the block height of the highest block and the hash value of the highest block from the blockchain of the auxiliary consensus node;

Step 503: If the secondary consensus node determines that the block height of the i-th block is equal to the block height of the highest block plus 1, and the hash value of the parent block of the i-th block is equal to the hash value of the highest block, it determines The i-th block passes consensus verification;

In step 504, the auxiliary consensus node stores the i-th block in the empty block cache of the auxiliary consensus node.

In order to better explain the embodiments of the present invention, the PBFT consensus algorithm is taken as an example for specific description. First, explain the related concepts involved in the PBFT consensus algorithm:

(1) Node ID, node index

In order to prevent nodes from doing evil, each consensus node signs the messages it sends during the PBFT consensus process, and verifies and signs the received message packets. Therefore, each node maintains a public and private key pair, and the private key is used to The sent message is signed, and the public key is used as the node ID to identify and verify the signature. The node ID is the signature public key of the consensus node and the unique identification of the consensus node, which is generally a 64-byte binary string. Other nodes use the node ID of the message packet sender to verify the message packet.

Considering that the node ID is very long, including this field directly in the consensus message will consume part of the network bandwidth. Therefore, the embodiment of the present invention introduces a node index. Each consensus node maintains a public consensus node list. The node index records the position of each consensus node ID in this list. When sending network message packets, only the node index is required, and other nodes can get from the public consensus. The node ID is indexed in the node list, and the message is verified and signed. The node index is used to indicate the position of each consensus node ID in this public node ID list.

(2) Node types in the PBFT consensus algorithm

Consensus nodes can be divided into primary consensus nodes (Leader/Primary nodes) and replica nodes (Replica nodes, which are equivalent to secondary consensus nodes in the embodiment of the present invention). Among them, the master consensus node is responsible for packaging transactions into blocks and block consensus. There is and only one master consensus node during each round of consensus. In order to prevent the master consensus node from forging blocks, after each round of PBFT consensus, the master will switch Consensus node. The replica node is responsible for block consensus. There can be multiple replica nodes in each round of consensus, and the processing process of each replica node is similar. In specific implementation, the main consensus node in the current consensus process can be determined according to a preset algorithm. For example, assuming that the current system includes N consensus nodes, the latest block hash is blockHash, then the current main consensus node index Can be: blockHash%N.

Further, according to whether the consensus node is a malicious node, the consensus node can also be divided into Byzantine nodes and non-Byzantine nodes. Among them, Byzantine nodes are understood as malicious nodes and cannot normally participate in consensus. Assuming that the total number of system nodes is 3×f+1, when the Byzantine nodes exceed f, the system cannot reach a normal consensus. Non-Byzantine nodes are understood as honest nodes and can participate in the consensus normally. If the total number of system nodes is 3×f+1, when the non-Byzantine nodes are not less than 2×f+1, the system can agree normally.

(3) View (view)

The PBFT consensus algorithm uses a view to record the consensus state of each node, and the same view node maintains the same node list of the master consensus node and the replica node. When the master consensus node fails, a view switch will occur. If the view switch is successful (for example, at least 2×f+1 nodes reach the same view), a new master consensus node will be selected based on the new view, and the new master consensus node will start Generate a block, otherwise continue to switch views until most of the nodes in the entire network (greater than or equal to 2×f+1) reach a consistent view.

Combining the above description, assuming that there are 3×f+1 consensus nodes in the blockchain system, the block height of the highest block on the current blockchain is A, and the hash value of the highest block is Hash(A), empty The index value of the latest empty block in the block cache is B. The process of empty block processing and empty block consensus in the PBFT consensus algorithm can be shown in Figure 6.

Step 601: The master consensus node determines that the block to be generated is an empty block;

Step 602, the master consensus node determines the latest empty block index value B:

If B is -1, go to step 603;

If B is greater than or equal to 0, go to step 604;

Step 603: Determine that there are no empty blocks in the current empty block cache;

In this case, you can also get the block header of the highest block on the blockchain, set the hash of the parent block of the empty block to be generated to the hash value of the highest block, and set the block height of the empty block to be generated to The block height of the highest block is increased by 1, and then the empty block index value of the empty block to be generated is set to 0.

Step 604: Determine that there are empty blocks in the current empty block cache;

In this case, you can also read the latest empty block from the empty block cache, set the hash of the parent block of the empty block to be generated to the hash value of the highest block, and set the block height of the empty block to be generated to The block height of the highest block is increased by 1, the empty block index value of the empty block to be generated is set to B+1, and then the hash value of the parent empty block to be generated is set to the hash value of the latest empty block;

In step 605, the master consensus node packs the empty block, encapsulates the empty block in a prepare package (Prepare package), and broadcasts it to all other consensus nodes;

Step 606: After receiving the preparation packet broadcast by the master consensus node, the auxiliary consensus node performs a first verification on the preparation packet, and if the verification is passed, it proceeds to step 607, otherwise it ends;

Wherein, performing the first verification on the preparation package may specifically include: verifying whether the preparation package is generated by the master consensus node and whether it is a repeated package (that is, whether a repeated preparation package is received). Correspondingly, the first verification is passed, which may specifically include: the preparation package is generated by the master consensus node and is not a duplicate package.

Step 607: The auxiliary consensus node obtains the parent block hash value, packager index, empty block index value, and parent empty block hash value in the prepared package;

In step 608, the secondary consensus node performs a second verification on the preparation packet, and if the verification is passed, it proceeds to step 609, otherwise it ends.

The second verification of the preparation package may specifically include: verifying whether the hash value of the parent block in the preparation package is the hash value of the highest block on the blockchain of the current node, and the block height in the preparation package Whether it is the block height of the highest block on the current node’s blockchain plus 1, whether the packager index in the prepared package is the packager index determined by the current node, and whether the empty block index value in the prepared package is the current node’s empty block The index value of the latest empty block in the cache is increased by 1, and the hash value of the parent empty block in the preparation package is the hash value of the latest empty block in the empty block cache of the current node. Here, if the empty block in the preparation package is the first empty block in the empty block cache, only the verification of the packer index, the hash value of the parent block, the empty block index value, and the block height are performed.

In step 609, the auxiliary consensus node determines that the package verification is passed, and then calculates the hash value of the empty block, and after signing the hash value, the hash value and the signature are encapsulated together to form a signature package (SignReq package), and broadcast To all other consensus nodes;

Step 610, the auxiliary consensus node collects the signature request.

Specifically, if more than 2×f+1 signature packets from different consensus nodes whose hash value is the hash value of an empty block are collected, a submission request (CommitReq) is broadcast to all consensus nodes.

Step 611: The auxiliary consensus node collects submission requests, and submits the empty block to the empty block cache.

Specifically, if the consensus node collects more than 2×f+1 submission requests from different consensus nodes whose hash value is the hash value of the empty block, the empty block is submitted to the empty block cache. For example, it can insert a new entry in the empty block cache and update the latest empty block index value to B+1.

In the above embodiment, the secondary consensus node verifies the empty block index value, the parent empty block hash value, the block height, the parent block hash value, and the packager index in the received i-th block. Consensus verification when i blocks are empty. Furthermore, when a new non-empty block is stored on the blockchain, the empty block in the empty block cache will also be cleared, thereby reducing the storage space occupied by the empty block and improving disk utilization efficiency.

Considering that the performance of each node in the blockchain system is different, there may also be cases where the blockchain data of the nodes in the blockchain system is not synchronized or the data in the empty block cache is not synchronized, for example, the blockchain system includes node 1 As with node 2, there are 10 empty blocks stored in node 1 and 5 empty blocks stored in node 2, so the data in the empty block caches of node 1 and node 2 are not synchronized. For another example, if there are 10 non-empty blocks stored in node 1 and 6 non-empty blocks are stored in node 2, the data in the blockchains of node 1 and node 2 are not synchronized. In this case, in order to ensure that the data in each node in the blockchain system is in the latest state, it is also necessary to perform synchronization operations on each node in the blockchain system.

In the embodiment of the present invention, the first node and the second node are set. The first node is any one of the multiple nodes of the blockchain system, and the second node is the first node among the multiple nodes of the blockchain system. Any one other than. The data synchronization process between the first node and the second node can refer to the process shown in Fig. 7. The execution subject in the process includes the first node and the second node, and the process includes:

Step 701: The second node periodically broadcasts the status information of its own node.

Wherein, the status information includes the empty block index value of the latest empty block in the empty block cache of the second node and the block height of the highest block of the block chain of the second node.

As shown in Figure 8, in the specific implementation process, the second node periodically broadcasts the status information of its own node, which is equivalent to the second node broadcasting the status information to all nodes in the blockchain system. Each node will The status information of the second node determines whether data needs to be synchronized from the second node. In the embodiment of the present invention, only the second node broadcasting status information to the first node is taken as an example for description.

Step 702: The first node receives the status information broadcast by the second node.

Step 703: If the first node determines that the block height of the highest block of the second node's blockchain is equal to the block height of the highest block of the first node's blockchain, and the empty block index of the latest empty block of the second node If the value is greater than the empty block index value of the latest empty block of the first node, the empty block to be synchronized is determined from the empty block cache of the second node.

Here, the empty block to be synchronized refers to an empty block whose empty block index value in the empty block cache of the second node is greater than the empty block index value of the latest empty block of the first node. For example, the empty block cache of the second node stores 3 empty blocks, the empty block index values are 1, 2, and 3 respectively, and the empty block cache of the first node stores 1 empty block, and the empty block index value If it is 1, it can be determined that the empty block to be synchronized that the first node synchronizes from the second node is an empty block with an empty block index value of 2 and an empty block with an empty block index value of 3.

Step 704: The first node synchronizes the empty block to be synchronized into the empty block cache of the first node.

As shown in FIG. 9, in the specific implementation process, the first node will receive the status information broadcast by multiple nodes, that is, the first node can synchronize data to multiple nodes at the same time. In the embodiment of the present invention, only the synchronization of the first node to the second node is taken as an example for description. In order to avoid synchronizing repeated data to multiple nodes, the first node can also perform repetitive verification according to the following steps when synchronizing data:

For any empty block to be synchronized, the first node obtains the parent empty block hash value and the empty block index value of the empty block to be synchronized, if it is determined that the parent empty block hash value of the empty block to be synchronized is equal to the empty block of the first node The hash value of the latest empty block in the cache, and the empty block index value of the empty block to be synchronized is equal to the empty block index value of the latest empty block of the first node plus 1, then it is determined to synchronize the empty block to be synchronized to the empty block of the first node In the cache. Moreover, the consensus signature of the empty block to be synchronized can also be verified.

In this embodiment, the first node may also verify the hash value of the parent block of the empty block to be synchronized when performing repeated verification, that is, the first node obtains the hash value of the parent block in the empty block to be synchronized , Determine whether the hash value of the parent block in the empty block to be synchronized is equal to the hash value of the highest block on the blockchain of the first node, and if so, further determine the hash value of the parent empty block and the index value of the empty block .

The premise of the above embodiment is that the block height of the highest block of the blockchain of the second node is equal to the block height of the highest block of the blockchain of the first node, that is, the first node only needs to synchronize the space from the second node. Piece. However, there may also be a possibility that the first node synchronizes non-empty blocks to the second node. Optionally, the step of synchronizing non-empty blocks is performed before the step of synchronizing empty blocks. If the first node determines that the block height of the highest block of the second node’s blockchain is greater than the block height of the highest block of the first node’s blockchain, then synchronize the second node’s blockchain to be higher than that of the first node Blocks of the blockchain, and the first node clears the empty block cache of the first node after the block is synchronized.

In an achievable way, the first node receives the status information of the second node, and first determines whether the block height of the highest block of the second node's blockchain is greater than that of the highest block of the first node's blockchain. If the block is high, the first node first requests a non-empty block from the second node and clears the empty block cache. If the block height of the highest block of the blockchain of the second node is equal to the block height of the highest block of the blockchain of the first node, then it is determined whether the latest empty block index value of the empty block cache of the second node is greater than that of the first node. The latest empty block index value of the empty block cache of one node. If it is, the empty block is requested from the second node. At this time, the following four verifications are required:

(1) The hash value of the parent empty block of the empty block to be synchronized is equal to the hash value of the latest empty block in the local empty block cache;

(2) The empty block index value of the empty block to be synchronized is equal to the latest empty block index value in the local empty block cache plus 1;

(3) The hash value of the parent block of the empty block to be synchronized is equal to the hash value of the highest block in the local blockchain;

(4) The consensus signature information of the empty block to be synchronized.

In addition, if the first node determines that the block height of the highest block of the second node's blockchain is not greater than the block height of the highest block of the first node's blockchain, the blocks on the blockchain are not synchronized. Alternatively, if the first node determines that the latest empty block index value of the empty block cache of the second node is not greater than the latest empty block index value of the empty block cache of the first node, then the empty blocks in the empty block cache are not synchronized.

In the above-mentioned embodiment, considering that the performance of each node in the blockchain system is different, the blockchain data of the nodes in the blockchain system may not be synchronized or the data in the empty block cache may not be synchronized. Therefore, this application is aimed at Different situations provide implementation methods for data synchronization between nodes, so as to ensure that all nodes in the blockchain system are in the latest state. In addition, when the node synchronizes to a non-empty block, it will also clear the empty block in the local empty block cache, which can also reduce the storage space occupied by the empty block and improve disk utilization efficiency.

Based on the same inventive concept, FIG. 10 exemplarily shows the structure of a block processing device provided by an embodiment of the present invention, and the device can execute the flow of the block processing method. Wherein, the device is suitable for a blockchain system including a master consensus node and an auxiliary consensus node. The blockchain system includes a blockchain and an empty block cache, and any block in the blockchain is not an empty block, The empty block cache is used to store empty blocks. As shown in Figure 10, the device includes:

The determining unit 1001 is configured to determine the empty block index value of the latest empty block and the hash value of the latest empty block from the empty block cache when it is determined that the i-th block to be generated is an empty block; i, m is a positive integer, the empty block in the empty block cache is for the empty block generated after the mth block in the blockchain, and the empty block in the empty block cache is in the blockchain It is emptied when the m+1 th block is added; the empty block index value is used to indicate the generation sequence of each empty block in the empty block cache;

The generating unit 1002 is configured to generate the i-th block and broadcast the i-th block to each auxiliary consensus node; the i-th block includes the empty block index of the i-th block Value and the parent empty block hash value, the parent empty block hash value of the i-th block is the hash value of the latest empty block, and the empty block index value of the i-th block is based on the The empty block index value of the latest empty block is determined;

The storage unit 1003 is configured to store the i-th block in the empty block cache after determining that the i-th block passes the consensus verification.

Optionally, the generating unit 1002 is specifically configured to: obtain the block height and hash value of the highest block on the blockchain, and determine the i-th block height after adding 1 to the block height of the highest block The block height of the block, the hash value of the highest block is determined as the hash value of the parent block of the i-th block, the block height of the i-th block, the i-th block The parent block hash value of the block, the empty block index value of the i-th block, and the parent empty block hash value of the i-th block are packed into the i-th block.

Optionally, when the determining unit 1001 determines that the i-th block to be generated is not an empty block, the generating unit 1002 is further configured to: obtain the block height and the block height of the highest block on the blockchain. Hope value, the block height of the highest block is added by 1 to determine the block height of the i-th block, and the hash value of the highest block is determined as the parent area of the i-th block The block hash value packs the block height of the i-th block and the parent block hash value of the i-th block into the i-th block.

Optionally, the empty block cache includes the latest empty block index value, and the latest empty block index value is the empty block index value of the latest empty block. In this case, the determining unit 1001 is specifically configured to: determine the latest empty block from the empty block cache according to the latest empty block index value and obtain the empty block index value of the latest empty block and all State the hash value of the latest empty block. Correspondingly, the storage unit 1003 is further configured to: after storing the i-th block in the empty block cache, add 1 to the latest empty block index value.

Based on the same inventive concept, FIG. 11 exemplarily shows the structure of a block consensus device provided by an embodiment of the present invention, which can execute the process of the block consensus method. Wherein, the device is suitable for a blockchain system including a master consensus node and an auxiliary consensus node. The blockchain system includes a blockchain and an empty block cache, and any block in the blockchain is not an empty block, The empty block cache is used to store empty blocks, the empty blocks in the empty block cache are for empty blocks generated after the mth block in the blockchain, and the empty blocks in the empty block cache are in all When the m+1 th block is added to the blockchain, the empty block includes an empty block index value and a parent empty block hash value, and the empty block index value is used to indicate each of the empty block caches The sequence of empty blocks, m is a positive integer. As shown in Figure 11, the device includes:

The receiving unit 1101 is configured to receive the i-th block broadcast by the master consensus node; i is a positive integer;

The determining unit 1102 is configured to determine the empty block index value of the i-th block and the hash value of the parent empty block of the i-th block from the i-th block, and from the auxiliary consensus Determine the hash value of the first empty block and the empty block index value of the first empty block in the empty block cache of the node; the first empty block is the latest empty block in the empty block cache of the secondary consensus node;

The storage unit 1103 is configured to store the i-th block in the empty block cache of the auxiliary consensus node if it is determined that the i-th block passes the consensus verification; the i-th block passes the consensus Verify that the empty block index value of the i-th block and the empty block index value of the first empty block meet the preset requirements, and it is determined that the hash value of the parent empty block of the i-th block is equal to the The hash value of the first empty block.

Optionally, the determining unit 1102 is further configured to determine the block height of the i-th block and the hash value of the parent block of the i-th block from the i-th block, from The block height of the highest block and the hash value of the highest block are determined in the blockchain of the auxiliary consensus node. Correspondingly, the i-th block passes the consensus verification, further comprising: the block height of the i-th block is equal to the block height of the highest block plus 1, and the parent area of the i-th block The block hash value is equal to the hash value of the highest block.

Optionally, the determining unit 1102 is further configured to: determine from the i-th block that the empty block index value of the i-th block is a preset value, and the parent of the i-th block The hash value of an empty block is a null value, the block height of the i-th block and the hash value of the parent block of the i-th block are determined from the i-th block, and the auxiliary consensus Determine the block height of the highest block and the hash value of the highest block in the node’s blockchain, if it is determined that the block height of the i-th block is equal to the block height of the highest block plus 1, and so If the hash value of the parent block of the i-th block is equal to the hash value of the highest block, it is determined that the i-th block passes the consensus verification.

Based on the same inventive concept, FIG. 12 exemplarily shows the structure of a block synchronization device provided by an embodiment of the present invention, and the device can execute the process of the block synchronization method. Wherein, the device is suitable for a blockchain system including multiple nodes. The blockchain system includes a blockchain and an empty block cache. Any block in the blockchain is not an empty block, and the empty block The cache is used to store empty blocks, the empty blocks in the empty block cache are for empty blocks generated after the mth block in the blockchain, and the empty blocks in the empty block cache are in the blockchain It is cleared when the m+1 th block is added to it, the multiple nodes include a first node and a second node, the first node is any one of the multiple nodes, and the second node is all For any one of the plurality of nodes except the first node, m is a positive integer. As shown in Figure 12, the device includes:

The receiving unit 1201 is configured to receive status information broadcast by the second node; the status information includes the empty block index value of the latest empty block in the empty block cache of the second node and the blockchain of the second node The block height of the highest block;

The determining unit 1202 is configured to determine that the block height of the highest block of the blockchain of the second node is equal to the block height of the highest block of the blockchain of the first node and the latest free space of the second node If the empty block index value of the block is greater than the empty block index value of the latest empty block of the first node, the empty block to be synchronized is determined from the empty block cache of the second node; the empty block to be synchronized is the first An empty block whose empty block index value is greater than the empty block index value of the latest empty block of the first node in the empty block cache of the second node;

The synchronization unit 1203 is configured to synchronize the empty block to be synchronized to the empty block cache of the first node.

Optionally, the synchronization unit 1203 is specifically configured to: for any empty block to be synchronized, obtain the parent empty block hash value and the empty block index value of the empty block to be synchronized, and if it is determined that the empty block to be synchronized is The hash value of the parent empty block is equal to the hash value of the latest empty block in the empty block cache of the first node, and the empty block index value of the empty block to be synchronized is equal to the empty block of the latest empty block of the first node When the index value is increased by 1, it is determined to synchronize the empty block to be synchronized to the empty block cache of the first node.

Optionally, the empty block to be synchronized includes the hash value of the parent block. In this case, before determining to synchronize the empty block to be synchronized to the empty block cache of the first node, the synchronization unit 1203 is further configured to: determine the hash value of the parent block in the empty block to be synchronized Whether it is equal to the hash value of the highest block on the blockchain of the first node.

Optionally, the status information further includes the block height of the blockchain of the second node. In this case, before determining the empty block to be synchronized from the empty block cache of the second node, the synchronization unit 1203 is further configured to: if the block of the highest block of the blockchain of the second node is determined If the height is greater than the block height of the highest block of the blockchain of the first node, the block of the second node’s blockchain that is higher than the block of the first node’s blockchain will be synchronized in the first node’s blockchain. After the blocks of the node's blockchain are synchronized, the empty block cache of the first node is cleared.

Based on the same inventive concept, an embodiment of the present invention also provides a computing device, including:

Memory, used to store program instructions;

The processor is configured to call the program instructions stored in the memory, and execute the block processing method, block consensus method, and block synchronization method described in any one of FIGS. 2 to 9 according to the obtained program.

Based on the same inventive concept, embodiments of the present invention also provide a computer-readable non-volatile storage medium, including computer-readable instructions, when the computer reads and executes the computer-readable instructions, the computer executes To the block processing method, block consensus method, and block synchronization method described in any one of FIG. 9.

The present invention is described with reference to flowcharts and/or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and/or block in the flowchart and/or block diagram, and the combination of processes and/or blocks in the flowchart and/or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing equipment to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing equipment are generated It is a device that realizes the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device. The device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so as to execute on the computer or other programmable equipment. The instructions provide steps for implementing functions specified in a flow or multiple flows in the flowchart and/or a block or multiple blocks in the block diagram.

Although the preferred embodiments of the present invention have been described, those skilled in the art can make additional changes and modifications to these embodiments once they learn the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications falling within the scope of the present invention.

Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. In this way, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalent technologies, the present invention is also intended to include these modifications and variations.

Claims

A block processing method, characterized in that it is suitable for a block chain system including a main consensus node and an auxiliary consensus node; the block chain system includes a block chain and an empty block cache; any one of the block chains None of the blocks are empty blocks; the empty block cache is used to store empty blocks;

The method includes:

When determining that the i-th block to be generated is an empty block, the master consensus node determines the empty block index value of the latest empty block and the hash value of the latest empty block from the empty block cache; The empty block in the block cache refers to the empty block generated after the mth block in the blockchain and the empty block in the empty block cache adds the m+1th block to the blockchain Is emptied; the empty block index value is used to indicate the sequence of each empty block in the empty block cache; i is a positive integer, and m is a positive integer;

The main consensus node generates the i-th block and broadcasts the i-th block to each auxiliary consensus node, and the i-th block includes the empty block index value of the i-th block And the parent empty block hash value, the parent empty block hash value of the i-th block is the hash value of the latest empty block; the empty block index value of the i-th block is based on the latest The empty block index value of the empty block is determined;

After determining that the i-th block passes the consensus verification, the master consensus node stores the i-th block in the empty block cache.
The method according to claim 1, wherein said master consensus node generating said i-th block comprises:

The master consensus node obtains the block height and hash value of the highest block on the blockchain; adds 1 to the block height of the highest block and determines it as the block height of the i-th block. The hash value of the highest block is determined to be the hash value of the parent block of the i-th block;

The master consensus node calculates the block height of the i-th block, the hash value of the parent block of the i-th block, the empty block index value of the i-th block, and the i-th block The hash value of the parent empty block of the block is packed into the i-th block.
The method of claim 1, further comprising:

When the master consensus node determines that the i-th block to be generated is not an empty block, it obtains the block height and hash value of the highest block on the blockchain; and the block height of the highest block After adding 1, it is determined as the block height of the i-th block, and the hash value of the highest block is determined as the hash value of the parent block of the i-th block;

The master consensus node packs the block height of the i-th block and the hash value of the parent block of the i-th block into the i-th block.
The method according to claim 1, wherein the empty block cache includes a latest empty block index value, and the latest empty block index value is the empty block index value of the latest empty block;

The master consensus node determining the empty block index value of the latest empty block and the hash value of the latest empty block from the empty block cache includes:

The master consensus node determines the latest empty block from the empty block cache according to the latest empty block index value and obtains the empty block index value of the latest empty block and the hash value of the latest empty block;

After the master consensus node stores the i-th block in the empty block cache, the method further includes:

The master consensus node adds 1 to the index value of the latest empty block.
A block consensus method, characterized in that it is suitable for a block chain system including a main consensus node and an auxiliary consensus node; the block chain system includes a block chain and an empty block cache; any one of the block chains Blocks are not empty blocks; the empty block cache is used to store empty blocks; the empty block in the empty block cache is for the empty block generated after the mth block in the blockchain and the empty block The empty block in the cache is emptied when the m+1 th block is added to the blockchain; the empty block includes an empty block index value and a parent empty block hash value; the empty block index value is used to indicate The sequence of the generation of each empty block in the empty block cache; m is a positive integer;

The method includes:

The secondary consensus node receives the i-th block broadcast by the main consensus node; i is a positive integer;

The secondary consensus node determines the empty block index value of the i-th block and the hash value of the parent empty block of the i-th block from the i-th block;

The auxiliary consensus node determines the hash value of the first empty block and the empty block index value of the first empty block from the empty block cache of the auxiliary consensus node; the first empty block is the auxiliary consensus node The latest empty block in the empty block cache;

If the auxiliary consensus node determines that the i-th block passes the consensus verification, the i-th block is stored in the empty block cache of the auxiliary consensus node; the i-th block passes the consensus verification Including the empty block index value of the i-th block and the empty block index value of the first empty block meet the preset requirements, and it is determined that the hash value of the parent empty block of the i-th block is equal to the The hash value of an empty block.
The method of claim 5, wherein the method further comprises:

The auxiliary consensus node determines the block height of the i-th block and the hash value of the parent block of the i-th block from the i-th block;

The auxiliary consensus node determines the block height of the highest block and the hash value of the highest block from the blockchain of the auxiliary consensus node;

The i-th block passes consensus verification, and further includes:

The block height of the i-th block is equal to the block height of the highest block plus 1, and the hash value of the parent block of the i-th block is equal to the hash value of the highest block.
The method of claim 5, wherein the method further comprises:

The secondary consensus node determines from the i-th block that the empty block index value of the i-th block is a preset value, and the hash value of the parent empty block of the i-th block is a null value ；

The auxiliary consensus node determines the block height of the i-th block and the hash value of the parent block of the i-th block from the i-th block;

The auxiliary consensus node determines the block height of the highest block and the hash value of the highest block from the blockchain of the auxiliary consensus node;

If the secondary consensus node determines that the block height of the i-th block is equal to the block height of the highest block plus 1, and the hash value of the parent block of the i-th block is equal to the highest block The hash value of, it is determined that the i-th block passes the consensus verification;

The auxiliary consensus node stores the i-th block in the empty block cache of the auxiliary consensus node.
A block synchronization method, characterized in that it is suitable for a block chain system including multiple nodes; the block chain system includes a block chain and an empty block cache; any block in the block chain is not Empty blocks; the empty block cache is used to store empty blocks; the empty blocks in the empty block cache are for empty blocks generated after the mth block in the blockchain and the empty block cache is empty A block is emptied when the m+1 th block is added to the blockchain; the multiple nodes include a first node and a second node, and the first node is any one of the multiple nodes, The second node is any one of the plurality of nodes except the first node; m is a positive integer;

The method includes:

The first node receives the status information broadcast by the second node; the status information includes the empty block index value of the latest empty block in the empty block cache of the second node and the block chain value of the second node The block height of the highest block;

If the first node determines that the block height of the highest block of the block chain of the second node is equal to the block height of the highest block of the block chain of the first node, and the latest empty block of the second node If the empty block index value of the block is greater than the empty block index value of the latest empty block of the first node, the empty block to be synchronized is determined from the empty block cache of the second node; the empty block to be synchronized is the first An empty block whose empty block index value is greater than the empty block index value of the latest empty block of the first node in the empty block cache of the second node;

The first node synchronizes the empty block to be synchronized into the empty block cache of the first node.
The method according to claim 8, wherein the first node synchronizing the empty block to be synchronized into the empty block cache of the first node comprises:

For any empty block to be synchronized, the first node obtains the hash value of the parent empty block and the empty block index value of the empty block to be synchronized;

If the first node determines that the hash value of the parent empty block of the empty block to be synchronized is equal to the hash value of the latest empty block in the empty block cache of the first node, and the empty block index of the empty block to be synchronized If the value is equal to the empty block index value of the latest empty block of the first node plus 1, it is determined to synchronize the empty block to be synchronized to the empty block cache of the first node.
The method according to claim 9, wherein the empty block to be synchronized includes the hash value of the parent block;

Before the first node determines to synchronize the empty block to be synchronized to the empty block cache of the first node, the method further includes:

The first node determines whether the hash value of the parent block in the empty block to be synchronized is equal to the hash value of the highest block on the blockchain of the first node.
The method according to claim 8, wherein the state information further includes the block height of the block chain of the second node;

Before the first node determines the empty block to be synchronized from the empty block cache of the second node, the method further includes:

If the first node determines that the block height of the highest block of the blockchain of the second node is greater than the block height of the highest block of the blockchain of the first node, then synchronize the zone of the second node Blocks in the block chain that are higher than the block chain of the first node;

The first node clears the empty block cache of the first node after the blocks of the blockchain of the first node are synchronized.
A block processing device, characterized in that it is suitable for a block chain system including a main consensus node and an auxiliary consensus node; the block chain system includes a block chain and an empty block cache; any one of the block chains None of the blocks are empty blocks; the empty block cache is used to store empty blocks;

The device includes:

The determining unit is configured to determine the empty block index value of the latest empty block and the hash value of the latest empty block from the empty block cache when it is determined that the i-th block to be generated is an empty block; The empty block in the block cache refers to the empty block generated after the mth block in the blockchain and the empty block in the empty block cache adds the m+1th block to the blockchain Is emptied; the empty block index value is used to indicate the sequence of each empty block in the empty block cache; i is a positive integer, and m is a positive integer;

A generating unit, configured to generate the i-th block and broadcast the i-th block to each auxiliary consensus node, and the i-th block includes the empty block index value of the i-th block And the parent empty block hash value, the parent empty block hash value of the i-th block is the hash value of the latest empty block; the empty block index value of the i-th block is based on the latest The empty block index value of the empty block is determined;

The storage unit is configured to store the i-th block in the empty block cache after determining that the i-th block passes the consensus verification.
The device according to claim 12, wherein the generating unit is specifically configured to:

Obtain the block height and hash value of the highest block on the blockchain; add 1 to the block height of the highest block and determine it as the block height of the i-th block. The hash value is determined as the hash value of the parent block of the i-th block;

The block height of the i-th block, the hash value of the parent block of the i-th block, the empty block index value of the i-th block, and the parent empty of the i-th block The block hash value is packed into the i-th block.
The device according to claim 12, wherein the generating unit is further configured to:

When the determining unit determines that the i-th block to be generated is not an empty block, obtain the block height and hash value of the highest block on the blockchain; add the block height of the highest block After 1, it is determined as the block height of the i-th block, and the hash value of the highest block is determined as the hash value of the parent block of the i-th block;

Pack the block height of the i-th block and the hash value of the parent block of the i-th block into the i-th block.
The apparatus according to claim 12, wherein the empty block cache includes a latest empty block index value, and the latest empty block index value is an empty block index value of the latest empty block;

The determining unit is specifically used for:

Determine the latest empty block from the empty block cache according to the latest empty block index value and obtain the empty block index value of the latest empty block and the hash value of the latest empty block;

The storage unit is also used for:

After storing the i-th block in the empty block cache, add 1 to the latest empty block index value.
A block consensus device, characterized in that it is suitable for a block chain system including a main consensus node and an auxiliary consensus node; the block chain system includes a block chain and an empty block cache; any one of the block chains The blocks are not empty blocks; the empty block cache is used to store empty blocks; the empty block in the empty block cache is for the empty block generated after the mth block in the blockchain and the empty block The empty block in the cache is emptied when the m+1 th block is added to the blockchain; the empty block includes an empty block index value and a parent empty block hash value; the empty block index value is used to indicate The sequence of the generation of each empty block in the empty block cache; m is a positive integer;

The device includes:

A receiving unit for receiving the i-th block broadcast by the master consensus node; i is a positive integer;

A determining unit, configured to determine the empty block index value of the i-th block and the hash value of the parent empty block of the i-th block from the i-th block; and from the auxiliary consensus node Determining the hash value of the first empty block and the empty block index value of the first empty block in the empty block cache; the first empty block is the latest empty block in the empty block cache of the secondary consensus node;

A storage unit, configured to store the i-th block in the empty block cache of the auxiliary consensus node if it is determined that the i-th block passes the consensus verification; the i-th block passes the consensus verification Including the empty block index value of the i-th block and the empty block index value of the first empty block meet the preset requirements, and it is determined that the hash value of the parent empty block of the i-th block is equal to the The hash value of an empty block.
The device according to claim 16, wherein the determining unit is further configured to:

Determine the block height of the i-th block and the hash value of the parent block of the i-th block from the i-th block;

Determine the block height of the highest block and the hash value of the highest block from the blockchain of the auxiliary consensus node;

The i-th block passes consensus verification, and further includes:

The block height of the i-th block is equal to the block height of the highest block plus 1, and the hash value of the parent block of the i-th block is equal to the hash value of the highest block.
The device according to claim 16, wherein the determining unit is further configured to:

Determining from the i-th block that the empty block index value of the i-th block is a preset value, and the hash value of the parent empty block of the i-th block is a null value;

Determine the block height of the i-th block and the hash value of the parent block of the i-th block from the i-th block;

Determine the block height of the highest block and the hash value of the highest block from the blockchain of the auxiliary consensus node;

If it is determined that the block height of the i-th block is equal to the block height of the highest block plus 1, and the hash value of the parent block of the i-th block is equal to the hash value of the highest block, It is determined that the i-th block passes the consensus verification.
A block synchronization device is characterized in that it is suitable for a block chain system including multiple nodes; the block chain system includes a block chain and an empty block cache; any block in the block chain is not Empty blocks; the empty block cache is used to store empty blocks; the empty blocks in the empty block cache are for empty blocks generated after the mth block in the blockchain and the empty block cache is empty A block is emptied when the m+1 th block is added to the blockchain; the multiple nodes include a first node and a second node, and the first node is any one of the multiple nodes, The second node is any one of the plurality of nodes except the first node; m is a positive integer;

The device includes:

The receiving unit is configured to receive the state information broadcast by the second node; the state information includes the empty block index value of the latest empty block in the empty block cache of the second node and the block chain value of the second node The block height of the highest block;

The determining unit is configured to determine if the block height of the highest block of the blockchain of the second node is equal to the block height of the highest block of the blockchain of the first node, and the latest empty of the second node If the empty block index value of the block is greater than the empty block index value of the latest empty block of the first node, the empty block to be synchronized is determined from the empty block cache of the second node; the empty block to be synchronized is the first An empty block whose empty block index value is greater than the empty block index value of the latest empty block of the first node in the empty block cache of the second node;

The synchronization unit is configured to synchronize the empty block to be synchronized to the empty block cache of the first node.
The device according to claim 19, wherein the synchronization unit is specifically configured to:

For any empty block to be synchronized, obtain the hash value of the parent empty block and the empty block index value of the empty block to be synchronized;

If it is determined that the hash value of the parent empty block of the empty block to be synchronized is equal to the hash value of the latest empty block in the empty block cache of the first node, and the empty block index value of the empty block to be synchronized is equal to the first node The empty block index value of the latest empty block of a node is increased by 1, and it is determined to synchronize the empty block to be synchronized to the empty block cache of the first node.
The device of claim 20, wherein the empty block to be synchronized includes a parent block hash value;

The synchronization unit is also used for:

Before determining to synchronize the empty block to be synchronized to the empty block cache of the first node, the method further includes:

Determine whether the hash value of the parent block in the empty block to be synchronized is equal to the hash value of the highest block on the blockchain of the first node.
The device according to claim 19, wherein the state information further comprises the block height of the blockchain of the second node;

The synchronization unit is also used for:

Before determining the empty block to be synchronized from the empty block cache of the second node, if it is determined that the block height of the highest block of the second node's blockchain is greater than the highest zone of the first node's blockchain If the block is high, the block in the block chain of the second node that is higher than the block chain of the first node is synchronized;

After the blocks of the blockchain of the first node are synchronized, the empty block cache of the first node is cleared.
A computing device, characterized by comprising a memory and a processor, the memory is used to store program instructions, the processor is used to call the program instructions stored in the memory, and execute any one of claims 1 to 11 according to the obtained program Methods.
A computer-readable non-volatile storage medium, characterized by comprising computer-readable instructions, when the computer reads and executes the computer-readable instructions, the computer is caused to execute any one of claims 1 to 11 Methods.