TWI759028B - Block packaging method, block packaging device based on blockchain transaction, and electronic device - Google Patents

Abstract

The present application provides a block packaging method and device based on blockchain transaction, and an electronic device. The block packaging method includes: each node in the blockchain receiving and storing blockchain transactions, each node calculating a hash value of each node according to the blockchain transaction, generating a voting information according to the hash value of each node, and sending the voting information to the node which being voted on; each node obtaining the number of votes for each node regarded as voted nodes according to the voting information; each node taking the node with the largest number of votes as a target node, and the target node packaging the received blockchain transactions into chunks and broadcasting the chunks to all nodes in the blockchain.

Description

Block packaging method, device and electronic device based on block chain transaction

The invention relates to the technical field of blockchain, in particular to a block packaging method, device and electronic device based on blockchain transactions.

In a decentralized blockchain network, each node follows a consensus algorithm to define who has the right to package a block. The node with the packaging right transmits the packaged block to all nodes by broadcasting. After receiving the broadcast block, other nodes first verify the validity of the block, and then write the valid block into the blockchain. The existing Proof of Work (PoW) consensus algorithm makes all nodes in the blockchain network have to spend a lot of computing resources to guess the hash value to determine which node obtains the right to pack the block.

In view of the above, it is necessary to propose a block packaging method, device and electronic device based on blockchain transactions, so as to avoid the problem of consuming a lot of computing resources by using the proof-of-work consensus algorithm when determining the packaging rights of blocks.

A first aspect of the present application provides a block packaging method based on blockchain transactions, the method comprising:

Each node in the blockchain receives and stores blockchain transactions;

Each node calculates the hash value of each node according to the blockchain transaction, generates a packaged voting information according to the hash value of each node, and sends the packaged voting information to the voted node, wherein the The packaged voting information includes the digital signature of the voting node and the unique identification code of the voted node;

Each node obtains the number of votes for each node according to the received packaged voting information record as the number of voted nodes;

Each node selects the node with the most votes as a target node according to the votes; and

The target node packages the received blockchain transactions into blocks and broadcasts them to all nodes in the blockchain.

Preferably, each node in the blockchain receives and stores blockchain transactions comprising:

Each node in the blockchain receives the blockchain transaction through a peer-to-peer network and stores the blockchain transaction in each node's local transaction pool.

Preferably, the blockchain transaction is a transaction combination including multiple transactions.

Preferably, each node calculates the hash value of each node according to the blockchain transaction, generates a packaged voting information according to the hash value of each node, and sends the packaged voting information to the voted Nodes include:

Calculate the hash value of each transaction in the transaction combination received by each node, and perform XOR operation on the hash value of each transaction in the transaction combination to obtain the hash value of the corresponding node;

XORing the hash value of each node with the unique identification codes of all nodes in the blockchain to obtain the XOR distance value between each node and each node in the blockchain;

Determine the minimum value of the XOR distance value between each node and each node of the blockchain respectively;

In the blockchain, the node corresponding to the minimum value of the XOR distance from each node is used as the node to be voted in the packaged voting information of each node; and

Each node sends the packaged voting information to the corresponding voted nodes.

Preferably, each node in the blockchain calculates the hash value of each node according to the blockchain transaction, generates a packaged voting information according to the hash value of each node, and sends the packaged voting information Sent to voted nodes include:

Each node in the blockchain calculates the hash value of each node according to the blockchain transaction within a preset time period, and generates a packaged voting information according to the hash value of each node, and sends the Package the voting information and send it to the voted nodes.

Preferably, each node obtains the number of votes for each node according to the received packaged voting information records as the number of voted nodes, including:

Each node generates voting information according to the number of votes as the voted node, the unique identification code and verification information of the voted node; and

Each node broadcasts voting information to all nodes in the blockchain.

Preferably, each node in the blockchain receives the same or a different blockchain transaction.

A second aspect of the present application provides a block packaging device based on blockchain transactions, the device comprising:

The transaction receiving module is used to control each node in the blockchain to receive and store blockchain transactions;

The voting module is used to control each node to calculate the hash value of each node according to the blockchain transaction, generate a packaged voting information according to the hash value of each node, and send the packaged voting information to the recipient A voting node, wherein the packaged voting information includes the digital signature of the voting node and the unique identification code of the voted node;

A vote counting module, used for: controlling each node to obtain the number of votes of each node according to the received packaged voting information records as the number of nodes to be voted; and controlling each node to maximize the number of votes according to the number of votes node as the target node; and

The packaging module is used to control the target node to package the received blockchain transaction into blocks and broadcast to all nodes in the blockchain.

Preferably, the blockchain transaction is a transaction combination including multiple transactions, and the voting module is further used for:

Calculate the hash value of each transaction in the transaction combination received by each node, and perform XOR operation on the hash value of each transaction in the transaction combination to obtain the hash value of the corresponding node;

XORing the hash value of each node with the unique identification codes of all nodes in the blockchain to obtain the XOR distance value between each node and each node in the blockchain;

Determine the minimum value of the XOR distance value between each node and each node of the blockchain respectively;

In the blockchain, the node corresponding to the minimum value of the XOR distance from each node is used as the node to be voted in the packaged voting information of each node; and

Each node sends the packaged voting information to the corresponding voted nodes.

A third aspect of the present application provides an electronic device, the electronic device includes a processor and a memory, the processor is configured to implement the block packaging based on the blockchain transaction when executing a computer program stored in the memory method.

In this application, each node uses the node with the largest number of votes as the target node according to the number of votes, and the target node packages the received blockchain transactions into blocks and broadcasts them to the blockchain. All nodes, so as to avoid the problem of consuming a lot of computing resources using the proof-of-work consensus algorithm when determining the packaging rights of the block.

In order to more clearly understand the above objects, features and advantages of the present invention, the present invention will be described in detail below with reference to the accompanying drawings and specific embodiments. It should be noted that the embodiments of the present application and the features in the embodiments may be combined with each other in the case of no conflict.

In the following description, many specific details are set forth in order to facilitate a full understanding of the present invention, and the described embodiments are only some, but not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terms used herein in the description of the present invention are for the purpose of describing specific embodiments only, and are not intended to limit the present invention.

Preferably, the block packaging method based on block chain transactions of the present invention is applied in one or more electronic devices. The electronic device is a device that can automatically perform numerical calculations and/or information processing according to pre-set or stored instructions, and its hardware includes but is not limited to microprocessors, application specific integrated circuits (ASICs) , Programmable Gate Array (Field-Programmable Gate Array, FPGA), Digital Signal Processor (Digital Signal Processor, DSP), embedded devices, etc.

The electronic device may be a computing device such as a desktop computer, a notebook computer, a tablet computer, and a cloud server. The device can interact with the user by means of a keyboard, a mouse, a remote control, a touch pad or a voice control device.

Example 1

FIG. 1 is a flowchart of a block packaging method based on block chain transactions in an embodiment of the present invention. According to different requirements, the order of the steps in the flowchart can be changed, and some steps can be omitted.

Referring to FIG. 1 , the block packaging method based on blockchain transactions specifically includes the following steps.

Step S11, each node in the blockchain receives and stores the blockchain transaction.

In this embodiment, the newly generated blockchain transaction is broadcast to all nodes in the blockchain through a peer-to-peer (P2P) network. Each node in the blockchain receives the blockchain transaction through a peer-to-peer network and stores the blockchain transaction in each node's local transaction pool. For example, any node in the blockchain generates a new blockchain transaction and broadcasts it to all nodes in the blockchain through the peer-to-peer network, and each node in the blockchain receives the corresponding node After the broadcasted blockchain transaction, the blockchain transaction is stored in the local transaction pool of each node.

Step S12, each node calculates the hash value of each node according to the blockchain transaction, and generates a packaged voting information according to the hash value of each node, and sends the packaged voting information to the voted node, Wherein, the packaged voting information includes the digital signature of the voting node and the unique identification code of the voted node.

In this embodiment, the blockchain transaction is a transaction combination including multiple transactions. In this embodiment, due to the influence of the transmission delay of the P2P network, the blockchain transactions received by each node in the blockchain may be the same or different, that is, each node in the blockchain may receive the same or different blockchain transactions. Transactions in a combination of transactions received by a node may or may not be the same. In this embodiment, when two nodes of the blockchain receive the same blockchain transaction, the hash values calculated by the two nodes are the same; when the two nodes of the blockchain receive different The hash value calculated by the two nodes is also different when the blockchain transaction is performed.

In this embodiment, each node calculates the hash value of each node according to the blockchain transaction, generates a packaged voting information according to the hash value of each node, and sends the packaged voting information to the recipient. The voting nodes include: calculating the hash value of each transaction in the transaction combination received by each node, and performing XOR operation on the hash value of each transaction in the transaction combination to obtain the hash value of the corresponding node; The hash value of each node is XORed with the unique identification codes of all nodes in the blockchain to obtain the XOR distance value between each node and each node in the blockchain; The minimum value of the XOR distance value between a node and each node of the blockchain; in the blockchain, the node corresponding to the minimum XOR distance value from each node is taken as each node The voted nodes in the packaged voting information of ; and each node sends the packaged voting information to the corresponding voted nodes.

For example, the blockchain consists of four nodes: node X, node Y, node Z, and node U. The unique identification code of node X is 0xF000, the identification code of node Y is 0x0F00, the identification code of node Z is 0x00F0, and the identification code of node U is 0x000F. where F represents the number F in hexadecimal. The blockchain transaction includes one or more of transaction A, transaction B, and transaction C. The hash value of transaction A is calculated to be 0x0FFF, the hash value of transaction B is calculated to be 0xF0FF, and the hash value of transaction C is calculated to be 0xFF0F. When the blockchain transaction received by node X includes transaction A, transaction B and transaction C, node X performs XOR operation on the hash values ​​of transaction A, transaction B and transaction C, that is, 0x0FFF⊕​0xF0FF⊕0xFF0F is obtained by operation The hash value of node X is 0x000F. When the blockchain transaction received by node Y includes transaction A, transaction B and transaction C, node Y performs XOR operation on the hash values ​​of transaction A, transaction B and transaction C, that is, 0x0FFF⊕​0xF0FF⊕0xFF0F is obtained by operation The hash value of node Y is 0x000F. When the blockchain transaction received by node Z includes transaction A and transaction B, node Z performs an XOR operation on the hash values ​​of transaction A and transaction B, that is, 0x0FFF⊕​0xF0FF is calculated to obtain the hash value of node Y as 0xFF00. When the blockchain transaction received by node U includes transaction B and transaction C, node U performs XOR operation on the hash value of transaction B and transaction C, that is, ​0xF0FF⊕0xFF0F is calculated to obtain the hash value of node U. 0x0FF0. Node X performs XOR operation on the hash value of node X with the unique identification codes of node X, node Y, node Z, and node U, respectively, to obtain the XOR distance value of node X and node X, which is 61455, and obtains the difference between node X and node Y. The XOR distance value is 3855, the XOR distance value between node X and node Z is 255, and the XOR distance value between node X and node U is 0. Since the XOR distance value between node X and node U is the smallest, node X takes node U as the node to be voted in the packaged voting information of node X, and node X sends the packaged voting information to node U. The process for the remaining nodes Y, Z, and U in the blockchain to determine the voted node in their respective packaged voting information is the same as the process for node X to determine the voted node in the packaged voting information node, and will not be described in detail here. .

In one embodiment, each node in the blockchain calculates a hash value of each node according to the blockchain transaction, generates a packaged voting information according to the hash value of each node, and sends the Packing the voting information and sending it to the voted node includes: each node in the blockchain calculates the hash value of each node according to the blockchain transaction within a preset time period, and calculates the hash value of each node according to the hash value of each node within a preset time period. value to generate a packaged voting information and send the packaged voting information to the voted nodes. In this embodiment, the preset time period is 10 seconds.

Step S13, each node obtains the number of votes for each node according to the received packaged voting information record as the number of voted nodes.

In this embodiment, each node obtains the number of votes of each node according to the number of voted nodes recorded according to the received packaged voting information, including: each node according to the number of votes as the voted node, as the voted node The unique identification code and verification information generate voting information; and each node broadcasts the voting information to all nodes in the blockchain.

Step S14, each node selects the node with the largest number of votes as the target node according to the number of votes.

Step S15, the target node packages the received blockchain transaction into blocks, and broadcasts it to all nodes in the blockchain.

In this embodiment, the target node packages the received blockchain transactions into blocks, and broadcasts them to all nodes in the blockchain through a P2P network.

In the present invention, each node uses the node with the largest number of votes as the target node according to the number of votes, and the target node packages the received blockchain transactions into blocks and broadcasts them to the blockchain. All nodes, so as to avoid the problem of consuming a lot of computing resources using the proof-of-work consensus algorithm when determining the packaging rights of the block.

Example 2

FIG. 2 is a structural diagram of a block packaging device 30 based on block chain transactions in an embodiment of the present invention.

In some embodiments, the block packaging device 30 based on blockchain transactions may include a plurality of functional modules composed of program code segments. The program codes of each program segment in the block packing device 30 based on blockchain transactions can be stored in the memory and executed by at least one processor to perform the block packing function.

In this embodiment, the block packaging device 30 based on blockchain transactions can be divided into a plurality of functional modules according to the functions it performs. Referring to FIG. 2 , the block packaging device 30 based on blockchain transactions may include a transaction receiving module 301 , a voting module 302 , a vote counting module 303 and a packaging module 304 . The module referred to in the present invention refers to a series of computer program segments that can be executed by at least one processor and can perform fixed functions, and are stored in a memory. In some embodiments, the functions of each module will be described in detail in subsequent embodiments.

The transaction receiving module 301 is used to control each node in the blockchain to receive and store blockchain transactions.

In this embodiment, the newly generated blockchain transaction is broadcast to all nodes in the blockchain through the P2P network. The transaction receiving module 301 controls each node in the blockchain to receive the blockchain transaction through a peer-to-peer network, and stores the blockchain transaction in the local transaction pool of each node. For example, after any node in the blockchain generates a new blockchain transaction, it broadcasts it to all nodes in the blockchain through a peer-to-peer network, and the transaction receiving module 301 controls the transaction in the blockchain. After receiving the blockchain transaction broadcasted by the corresponding node, each node of the node stores the blockchain transaction in the local transaction pool of each node.

The voting module 302 is used to control each node to calculate the hash value of each node according to the blockchain transaction, generate a packaged voting information according to the hash value of each node, and send the packaged voting information To the voted node, wherein the packaged voting information includes the digital signature of the voted node and the unique identification code of the voted node.

In this embodiment, the blockchain transaction is a transaction combination including multiple transactions. In this embodiment, due to the influence of the transmission delay of the P2P network, the blockchain transactions received by each node in the blockchain may be the same or different, that is, each node in the blockchain may receive the same or different blockchain transactions. Transactions in a combination of transactions received by a node may or may not be the same. In this embodiment, when two nodes of the blockchain receive the same blockchain transaction, the hash values calculated by the two nodes are the same; when the two nodes of the blockchain receive different The hash value calculated by the two nodes is also different when the blockchain transaction is performed.

In this embodiment, the voting module 302 controls and calculates the hash value of each transaction in the transaction combination received by each node, and performs XOR operation on the hash value of each transaction in the transaction combination to obtain the corresponding The hash value of the node; the hash value of each node is XORed with the unique identification codes of all nodes in the blockchain to obtain the XOR of each node and each node in the blockchain Distance value; determine the minimum value of the XOR distance value between each node and each node of the blockchain respectively; in the blockchain, set the XOR distance value from each node to the minimum value The corresponding node is used as the voted node in the packaged voting information of each node; and each node respectively sends the packaged voting information to the corresponding voted node.

For example, the blockchain consists of four nodes: node X, node Y, node Z, and node U. The unique identification code of node X is 0xF000, the identification code of node Y is 0x0F00, the identification code of node Z is 0x00F0, and the identification code of node U is 0x000F. where F represents the number F in hexadecimal. The blockchain transaction includes one or more of transaction A, transaction B, and transaction C. The voting module 302 calculates the hash value of transaction A as 0x0FFF, calculates the hash value of transaction B as 0xF0FF, and calculates the hash value of transaction C as 0xFF0F. When the blockchain transaction received by node X includes transaction A, transaction B and transaction C, the voting module 302 controls node X to perform XOR operation on the hash values ​​of transaction A, transaction B and transaction C, that is, 0x0FFF⊕ ​0xF0FF⊕0xFF0F is calculated to obtain the hash value of node X as 0x000F. When the blockchain transaction received by node Y includes transaction A, transaction B and transaction C, the voting module 302 controls node Y to perform XOR operation on the hash values ​​of transaction A, transaction B and transaction C, that is, 0x0FFF⊕ ​0xF0FF⊕0xFF0F is calculated to obtain the hash value of node Y as 0x000F. When the blockchain transaction received by node Z includes transaction A and transaction B, the voting module 302 controls node Z to perform XOR operation on the hash values ​​of transaction A and transaction B, that is, 0x0FFF⊕​0xF0FF is calculated to obtain the node The hash value of Y is 0xFF00. When the blockchain transaction received by node U includes transaction B and transaction C, the voting module 302 controls node U to perform XOR operation on the hash values ​​of transaction B and transaction C, that is, ​0xF0FF⊕0xFF0F is calculated to obtain the node The hash value of U is 0x0FF0. The voting module 302 controls node X to perform XOR operation on the hash value of node X with the unique identification codes of node X, node Y, node Z, and node U respectively to obtain the XOR distance value between node X and node X is 61455, The XOR distance value between node X and node Y is 3855, the XOR distance value between node X and node Z is 255, and the XOR distance value between node X and node U is 0. Since the XOR distance between node X and node U is the smallest, the voting module 302 controls node X to use node U as the node to be voted in the packaged voting information of node X, and controls node X to send the packaged voting information to node U. The voting module 302 controls and controls the remaining nodes Y, node Z, and node U in the blockchain to determine the process of determining the voted node in their respective packaged voting information and the process of node X determining the voted node in the packaged voting information node. The process is the same and will not be described in detail here.

In one embodiment, each node in the blockchain calculates a hash value of each node according to the blockchain transaction, generates a packaged voting information according to the hash value of each node, and sends the Packing the voting information and sending it to the voted node includes: each node in the blockchain calculates the hash value of each node according to the blockchain transaction within a preset time period, and calculates the hash value of each node according to the hash value of each node within a preset time period. value to generate a packaged voting information and send the packaged voting information to the voted nodes. In this embodiment, the preset time period is 10 seconds.

The vote counting module 303 is used to control each node to obtain the number of votes of each node according to the received packaged voting information records as the number of voted nodes.

In this embodiment, the vote counting module 303 controls each node to generate voting information according to the number of votes as the voted node, the unique identification code and verification information of the voted node; and each node broadcasts the voting information to the All nodes in the blockchain.

The vote counting module 303 controls each node to use the node with the most votes as the target node according to the votes.

The packaging module 304 controls the target node to package the received blockchain transaction into blocks and broadcast to all nodes in the blockchain.

In this embodiment, the packaging module 304 controls the target node to package the received blockchain transaction into blocks, and broadcasts it to all nodes in the blockchain through the P2P network.

In the present invention, each node uses the node with the largest number of votes as the target node according to the number of votes, and the target node packages the received blockchain transactions into blocks and broadcasts them to the blockchain. All nodes, so as to avoid the problem of consuming a lot of computing resources using the proof-of-work consensus algorithm when determining the packaging rights of the block.

Example 3

FIG. 3 is a schematic diagram of an electronic device 6 in an embodiment of the present invention.

The electronic device 6 includes a memory 61 , a processor 62 and a computer program 63 stored in the memory 61 and executable on the processor 62 . When the processor 62 executes the computer program 63, the steps in the above embodiments of the block packaging method based on blockchain transactions are implemented, for example, steps S11 to S15 shown in FIG. 1 . Alternatively, when the processor 62 executes the computer program 63, the functions of each module/unit in the above-mentioned embodiment of the block packaging device based on blockchain transactions are implemented, such as modules 301 to 304 in FIG. 2 .

Exemplarily, the computer program 63 can be divided into one or more modules/units, and the one or more modules/units are stored in the memory 61 and executed by the processor 62 , to complete the present invention. The one or more modules/units may be a series of computer program instruction segments capable of performing specific functions, and the instruction segments are used to describe the execution process of the computer program 63 in the electronic device 6 . For example, the computer program 63 can be divided into a transaction receiving module 301, a voting module 302, a vote counting module 303, and a packaging module 304 in FIG.

Those skilled in the art can understand that the schematic diagram is only an example of the electronic device 6, and does not constitute a limitation to the electronic device 6, and may include more or less components than the one shown, or combine some components, or different Components such as the electronic device 6 may also include input and output devices, network access devices, bus bars, and the like.

The processor 62 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs) ), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or the processor 62 can also be any conventional processor, etc. The processor 62 is the control center of the electronic device 6, and uses various interfaces and lines to connect the entire electronic device 6. various parts.

The memory 61 can be used to store the computer programs 63 and/or modules/units, and the processor 62 runs or executes the computer programs and/or modules/units stored in the memory 61, And call the data stored in the memory 61 to realize various functions of the electronic device 6 . The memory 61 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; storage data The area may store data created according to the use of the electronic device 6 (such as audio data, phone book, etc.) and the like. In addition, the memory 61 may include high-speed random access memory, and may also include non-volatile memory, such as hard disk, memory, plug-in hard disk, Smart Media Card (SMC), Secure Digital (Secure Digital, SD) card, flash memory card (Flash Card), at least one disk memory device, flash memory device, or other volatile solid state memory device.

If the modules/units integrated in the electronic device 6 are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the present invention realizes all or part of the processes in the methods of the above embodiments, and can also be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a computer-readable storage medium, When the computer program is executed by the processor, the steps of the above method embodiments can be implemented. Wherein, the computer program includes computer program code, and the computer program code may be in the form of original code, object code, executable file, or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a flash drive, a removable hard disk, a magnetic disk, an optical disk, a computer memory, a read-only memory (ROM, Read-Only Memory); Only Memory), random access memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium, etc. It should be noted that the content contained in the computer-readable medium may be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction, for example, in some jurisdictions, according to legislation and patent practice, the computer-readable medium Electric carrier signals and telecommunication signals are not included.

In the several embodiments provided by the present invention, it should be understood that the disclosed electronic devices and methods may be implemented in other manners. For example, the above-described electronic device embodiments are only illustrative. For example, the division of the modules is only a logical function division, and other division methods may be used in actual implementation.

In addition, each functional module in each embodiment of the present invention may be integrated in the same processing module, or each module may exist physically alone, or two or more modules may be integrated in the same module. The above-mentioned integrated modules can be implemented in the form of hardware, or can be implemented in the form of hardware plus software function modules.

It will be apparent to those skilled in the art that the present invention is not limited to the details of the above-described exemplary embodiments, but that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics of the invention. Therefore, the embodiments are to be regarded in all respects as exemplary and not restrictive, and the scope of the present invention is defined by the appended claims rather than the foregoing description, and is therefore intended to fall within the scope of the patent application. All changes within the meaning and scope of equivalents to the scope are encompassed within the invention. Any reference signs in the patentable scope should not be construed as limiting the claimed scope. Furthermore, it is clear that the word "comprising" does not exclude other modules or steps, and the singular does not exclude the plural. Multiple modules or electronic devices stated in the scope of the electronic device patent application can also be implemented by the same module or electronic device through software or hardware. The terms first, second, etc. are used to denote names and do not denote any particular order.

To sum up, the present invention complies with the requirements of an invention patent, and a patent application can be filed in accordance with the law. However, the above descriptions are only the preferred embodiments of the present invention, and for those who are familiar with the techniques of this case, equivalent modifications or changes made in accordance with the creative spirit of this case shall be included in the scope of the following patent application.

30: Block packaging device based on blockchain transactions

301: Transaction receiving module

302: Voting Module

303: Voting module

304: Packaging Modules

6: Electronic equipment

61: Memory

62: Processor

63: Computer Programs

S11~S15: Steps

FIG. 1 is a flowchart of a block packaging method based on block chain transactions in an embodiment of the present invention.

FIG. 2 is a structural diagram of a block packaging device based on block chain transactions in an embodiment of the present invention.

FIG. 3 is a schematic diagram of an electronic device in an embodiment of the present invention.

S11~S15: Steps

Claims (9)

A block packaging method based on block chain transactions, the improvement is that the method includes: each node in the block chain receives and stores the block chain transactions; hash value of a node, and generate a packaged voting information according to the hash value of each node, and send the packaged voting information to the voted node, wherein the packaged voting information includes the digital signature of the voting node and the unique identification code of the node to be voted; each node records the number of voted nodes according to the received packaged voting information to obtain the number of votes for each node, including: each node according to the number of votes as the voted node, as The unique identification code and verification information of the voted node generate voting information; each node broadcasts the voting information to all nodes in the blockchain; each node selects the node with the most votes as the target node according to the number of votes ; and the target node packages the received blockchain transaction into blocks and broadcasts it to all nodes in the blockchain. The block packaging method based on block chain transactions according to claim 1, wherein each node in the block chain receives and stores the block chain transactions comprising: each node in the block chain The other network receives the blockchain transaction and stores the blockchain transaction in the local transaction pool of each node. The block packaging method based on a blockchain transaction according to claim 1, wherein the blockchain transaction is a transaction combination including multiple transactions. The block packaging method based on blockchain transactions according to claim 3, wherein each node calculates a hash value of each node according to the blockchain transaction, and generates a hash value according to the hash value of each node Packing voting information and sending the voting information to the voted node includes: Calculate the hash value of each transaction in the transaction combination received by each node, and perform XOR operation on the hash value of each transaction in the transaction combination to obtain the hash value of the corresponding node; The value is XORed with the unique identification codes of all nodes in the blockchain to obtain the XOR distance value between each node and each node in the blockchain; The minimum value of the XOR distance value between each node of the blockchain; in the blockchain, the node corresponding to the minimum XOR distance value from each node is taken as the packaged voting information of each node. The voted nodes; and each node sends the packaged voting information to the corresponding voted nodes. The block packaging method based on block chain transactions according to claim 3, wherein each node in the block chain calculates the hash value of each node according to the block chain transaction, and according to each The hash value of the node generates a packaged voting information, and sending the packaged voting information to the node to be voted includes: each node in the blockchain calculates according to the blockchain transaction within a preset time period. hash value of each node, and generate a packaged voting information according to the hash value of each node, and send the packaged voting information to the voted node. The block packaging method based on block chain transactions according to claim 1, wherein each node in the block chain receives the same or different block chain transactions. A block packaging device based on blockchain transactions, the improvement is that the device includes: a transaction receiving module for controlling each node in the blockchain to receive and store blockchain transactions; a voting module for using Controlling each node to calculate the hash value of each node according to the blockchain transaction, and generating a packaged voting information according to the hash value of each node, and sending the packaged voting information to the voted node, wherein , the packaged voting information includes the digital signature of the voting node and the unique identification code of the voted node; the vote counting module is used for: Control each node to obtain the number of votes of each node according to the number of voted nodes recorded according to the received packaged voting information, including: each node is based on the number of votes as the voted node, the unique identification code and verification of the voted node information to generate voting information; each node broadcasts the voting information to all nodes in the blockchain; and controls each node to use the node with the largest number of votes as the target node according to the number of votes; and a packaging module, using It is used to control the target node to package the received blockchain transaction into blocks and broadcast it to all nodes in the blockchain. The block packaging device based on block chain transactions according to claim 7, wherein the block chain transaction is a transaction combination including multiple transactions, and the voting module is further configured to: the hash value of each transaction in the transaction combination, and perform XOR operation on the hash value of each transaction in the transaction combination to obtain the hash value of the corresponding node; Perform XOR operation on the unique identification codes of all nodes in the blockchain to obtain the XOR distance value between each node and each node in the blockchain; determine each node and each node in the blockchain respectively The minimum value of the XOR distance value between each node; the node corresponding to the minimum value of the XOR distance value from each node in the blockchain is regarded as the node voted in the packaged voting information of each node; and Each node sends the packaged voting information to the corresponding voted nodes. An electronic device, which is improved in that the electronic device includes a processor and a memory, and the processor is configured to implement the region-based system according to any one of claims 1 to 6 when executing a computer program stored in the memory. Block packaging method for blockchain transactions.

Images