TWI673988B - Method and system for generating blockchain - Google Patents

Abstract

A method for generating a blockchain includes the following steps: a plurality of nodes obtain a shared file based on a blockchain agreement, and respectively establish a blockchain based on the shared file, wherein each blockchain includes a block, and each The contents of the blockchain established by a node are not completely the same; these nodes mutually confirm the blockchain to form a plurality of confirmed blockchains; and compact the confirmed blockchains to form a common blockchain. Compared with the conventional technology, the method and system for generating a blockchain according to the present invention can generate blocks more quickly and greatly reduce the amount of calculations. It has unlimited scalability, prevents network congestion, ensures fair transactions, and achieves true The advantages of decentralization.

Description

Generation method and system of block chain

The present invention relates to a blockchain system, and in particular, to a blockchain system in which multiple nodes each produce a blockchain, and then the multiple blockchains are compacted into a common blockchain.

In recent years, various virtual currencies (Crypto Currency) based on blockchain technology have begun to be widely used and popular on the Internet, such as Bitcoin, Ethereum, Dogecoin, etc., and the daily transaction value of these virtual currencies exceeds 1,000 Million dollars and growing. Currently, Wikipedia, Dell Computer, Newegg, PayPal and other well-known companies and institutions support the use of Bitcoin as a transaction currency.

Blockchain technology is a technical solution that does not rely on third parties to store, verify, transfer and communicate network data through its own distributed nodes. Therefore, from the perspective of financial accounting, some people regard blockchain technology as a decentralized and open decentralized large-scale network book (public ledger). Anyone can join using the same technical standards at any time. Own information, extend the blockchain, and continue to meet the data entry needs brought by various needs.

The public ledger used by Bitcoin is a decentralized storage scheme based on the Proof-of-Work mechanism, which usually has extremely high security and anti-attack characteristics. To effectively attack the security of the Bitcoin blockchain, calculations of up to thousands of TH / s are required Power, which has exceeded the sum of the computing power of the top 500 supercomputers in the world.

However, although Bitcoin has the advantages of decentralization and immutable data, there are still many shortcomings. For example, resources are wasted. Bitcoin uses the Proof-of-Work mechanism to determine who produces new blocks. This method results in a large number of computers calculating a meaningless mathematical problem at the same time, resulting in resources. Waste; incomplete decentralization, Bitcoin uses the Proof-of-Work mechanism to determine who produces new blocks, resulting in computers with higher computing power controlling most of the rights to produce blocks, forming Another form of centralization problem; non-scalable, in order to ensure the consistency of data, Bitcoin can only produce one recognized block per period of time, so the average number of transactions per second (TPS) can only load 7 transactions , Causing problems such as network congestion and slow block generation speed; there is a risk of front-running. Each transaction data on the blockchain is open and transparent. The transactions sent by Bitcoin may need to go through several Only hours or days will be acknowledged in the block, and before the transaction is written in the block, there will be a risk of being preempted by others, causing an unfair problem. As can be seen from the above, Bitcoin currently based on blockchain has many shortcomings and is not a good design.

In view of this, the present invention provides a method for generating a blockchain, which is executed on a computer system, the computer system includes a plurality of nodes, which includes the following steps: the nodes obtain a shared file based on the blockchain agreement, and according to the A shared file establishes a blockchain, where each blockchain contains a block, and the content of the blockchain established by each node is not exactly the same; the nodes mutually confirm (Ack) the blockchain, Forming a plurality of confirmed blockchains; and compacting the confirmed blockchains into a common blockchain.

In a specific embodiment, the steps in which the nodes mutually confirm the blockchain to form a plurality of confirmed blockchains further include the following sub-steps: one of the nodes, the first section The point generates a first block in the established blockchain and sends out a first broadcast corresponding to the first block; the nodes other than the first node receive the broadcast and confirms the first Block; and when the first block is confirmed by more than a predetermined number of the nodes, the block chain established by the first node becomes the confirmed block chain. The predetermined number is two thirds of the total number of these nodes.

In a specific embodiment, the sub-steps of the nodes other than the first node receiving the first broadcast to confirm the first block further include the following steps: a second node among the nodes receives the first block The first broadcast of the node; the second node generates a second block according to the shared file, wherein the second block contains confirmation information corresponding to one of the first block; and the second node sends the second block One of the second broadcasts corresponding to the block.

In practical applications, the confirmation data includes the creator code of the first block, the hash value of the first block, the height of the first block, and a confirmation time stamp, where the confirmation time stamp is the The second node receives the timestamp of the first broadcast. And the creation timestamp of one of the second blocks is greater than the creation timestamp of one of the first blocks, where the creation timestamp is a timestamp created by the block.

In a specific embodiment, after the steps of compacting the confirmed blockchains to form a common blockchain, the method further includes the following steps: storing the common blockchain at the nodes.

In a specific embodiment, the block of each block chain is compacted according to an ordering algorithm to form the common block chain.

In practical applications, the block includes a creator code, a transaction record, a hash value of the block, a hash value of a previous block of the block, a creator signature, a block height, and a Confirm the information. And the transaction record contains multiple transaction data, each transaction data It includes a transaction code, a sender code, a receiver code, a transaction volume, and a sender signature.

Another aspect of the present invention is to provide a blockchain generation system including: a blockchain network that stores a shared file; and a plurality of nodes that are connected to the blockchain network to obtain the shared file, and A block chain is established according to the shared file, and the nodes mutually confirm (Ack) the block chain to form a plurality of confirmed block chains; wherein the confirmed block chains are compacted to form A common blockchain, and each blockchain contains a block, and the content of the blockchain established by each node is not exactly the same.

The method and system for generating a blockchain according to the present invention utilize a plurality of nodes to form a blockchain each, and use a consensus algorithm and a ranking algorithm to compact a plurality of blockchains into a common blockchain. Compared with the conventional technology, the present invention proposes an innovative blockchain data structure based on Directed Acyclic Graph (DAG). Multiple nodes establish their own blockchains at the same time, making the output speed much faster than The current blockchain system avoids the problem of centralization. On the other hand, the present invention uses the method of mutual confirmation (Ack) between nodes to achieve consensus between the nodes, which can not only solve the Byzantine Generals Problem, but also greatly reduce the system's calculation volume and avoid waste of resources. . At the same time, because the block production speed of the present invention is much faster than the current blockchain system, it means that when a transaction is put on the blockchain generation system of the present invention, it can be written into the block quickly, so Solved the problem of fairness of conventional technology.

10, 12, 14‧‧‧ nodes

Blocks 20, 21, 22, 23, 24, 25, 26, 27‧‧‧

30, 32, 34‧‧‧ Blockchain

100‧‧‧ the first node

110‧‧‧ Block 1

120‧‧‧First Broadcast

200‧‧‧ the second node

210‧‧‧Second Block

220‧‧‧Second Broadcast

1000‧‧‧ steps

2000‧‧‧ steps

2100‧‧‧step

2200‧‧‧step

2300‧‧‧step

2301‧‧‧step

2400‧‧‧step

2500‧‧‧ steps

2510‧‧‧step

2520‧‧‧step

2530‧‧‧step

2531‧‧‧step

2540‧‧‧step

2600‧‧‧step

3000‧‧‧ steps

FIG. 1 is a flowchart of a method according to a specific embodiment of the present invention.

FIG. 2 is a sub-flow chart of step 2000 of FIG. 1.

FIG. 3 is a flowchart of step 2500 in FIG. 2.

FIG. 4 is a schematic diagram of a specific embodiment of steps 2300 and 2400 of FIG. 2.

FIG. 5 is a schematic diagram of a specific embodiment of steps 2530 and 2540 in FIG. 3.

FIG. 6 is a schematic diagram of a node generating a branch chain.

FIG. 7 is a schematic diagram of a blockchain structure of the present invention.

FIG. 8 is a schematic diagram of a specific embodiment of step 3000 in FIG. 1.

In order to make the advantages, spirits and features of the present invention easier and clearer, it will be detailed and discussed in the following with specific embodiments and with reference to the accompanying drawings. It is worth noting that these specific embodiments are only representative specific embodiments of the present invention, and the specific methods, devices, conditions, materials, etc. exemplified therein are not intended to limit the present invention or corresponding specific embodiments. In addition, each device in the figure is only used to express its relative position and is not depicted in its actual proportion, which will be described together.

Please refer to FIG. 1, which is a flowchart of a method according to a specific embodiment of the present invention. The present invention provides a method and system for generating a blockchain. The blockchain generation system includes a blockchain network and a plurality of nodes. A shared file is stored in the blockchain network. The shared file is an open file uploaded by a user, such as transaction records, contract contents, etc. Each node can obtain the shared file by accessing the blockchain network. A plurality of nodes are co-maintainers of the blockchain network, and play a storage and a validator of the blockchain network. Generally, each node represents an electronic computer device. Each node includes a first node and a second node. As shown in FIG. 1, in step 1000, a plurality of nodes respectively establish a blockchain based on a shared file on the blockchain network. In practical applications, there are several shared files on the blockchain network, and each node can obtain different shared files to establish a blockchain. The blockchains established by the nodes are not exactly the same (some of the same content may occur). In a specific embodiment, the user can choose to deliver the uploaded shared file to the selected node, or a delegate (Delegate) randomly allocates the shared file to multiple nodes for data packaging.

In a specific embodiment, the block chain established by each node is connected by multiple blocks, and each block includes a creator code (Block Proposer ID) and a transaction record (Transactions) , The block hash (block hash), the previous block hash (previous block hash), the creator signature (signature), a block height (block height), and a confirmation Information (Acks). Further, the transaction record includes a plurality of transaction data, and each transaction data includes a transaction code (Transaction ID), a sender code (Sender ID), a receiver code (Receiver ID), a transaction load (Payload), And a Sender Signature.

Please refer to FIG. 1, FIG. 2, and FIG. 3. FIG. 2 is a sub-flow chart of step 2000 in FIG. 1, and FIG. 3 is a sub-flow chart of step 2500 in FIG. 2. In step 2000, each node confirms (Ack) the blockchain to form a plurality of confirmed blockchains. Step 2000 can be divided into the following sub-steps: step 2100, the first node obtains the shared file; step 2200, the first node checks whether the shared file is correct? If not, continue to step 2301 and delete the shared files that have not passed the check. If yes, continue to step 2300 and the first node creates a first block; step 2400, the first node sends a first broadcast; step 2500, the remaining nodes After receiving the first broadcast, the first block is confirmed (Ack); step 2600, when the first block is confirmed by more than a predetermined number of nodes, a confirmed block chain is formed. Among them, step 2500 can be divided into the following steps: step 2510, the second node receives the first broadcast; step 2520, the second node checks whether the first broadcast content is correct? If not, proceed to step 2531, and delete the first broadcast that fails the check. If yes, proceed to step 2530, and the second node is based on sharing. The file creates a second block, where the second block contains a confirmation data; step 2540: the second node sends a second broadcast. The above steps will be described in detail in the embodiments and the drawings.

Please refer to FIG. 2 and FIG. 4. FIG. 4 is a schematic diagram of a specific embodiment of steps 2300 and 2400 in FIG. 2. In a specific embodiment, the first node 100 obtains a transaction record (shared file) from the blockchain network and checks the transaction record. The check items include checking whether the data format of the transaction record is correct and whether the content of the transaction record is correct. In accordance with the data stored in the first node 100, for example, check whether there is sufficient balance in the account of the transaction sender to perform the transaction. If the inspection result shows that the data is incorrect, the transaction record will be deleted and will not be recorded in the new block. In actual application, the first node 100 can directly delete the transaction record that fails the inspection, or the error message Return to Delegate or other nodes. If the inspection result shows that the data is correct, the transaction record is written into the newly created first block 110. When the first node 100 establishes the first block 110, it sends a first broadcast 120 to notify other nodes. The first broadcast 120 includes information about the first block 110, and the first broadcast 120 is based on the Gossip protocol. Protocol) to ensure that all nodes can receive the broadcast, but the broadcast method is not limited to this.

Please refer to FIG. 3, FIG. 4, FIG. 5, and FIG. 6. FIG. 5 is a schematic diagram of a specific embodiment of steps 2530 and 2540 of FIG. 3, and FIG. In a specific embodiment, the second node 200 receives the first broadcast 120 and checks whether the content contained in the first broadcast 120 is correct, such as checking the previous block hash included in the broadcast (Previous Block Hash). Is it the same as other broadcasts? If it has the same previous block hash (Previous Block Hash), it means that the node sending the broadcast generates a branch (Fork), and the case where the same node generates a branch is not in the present invention. Allowed, so when it is detected that the node sending the broadcast generates a branch chain, the error message can be reported to the representative (Delegate) or other nodes, and even the node that generates the branch chain is punished. Here, a schematic diagram of the branch chain generated by the block 20 of the node 10 is shown in FIG. 6.

On the other hand, if it is checked that the content contained in the first broadcast 120 is correct, the second node 200 writes the confirmation information of the received first broadcast 120 into a newly generated second block 210. It is worth noting that The second node 200 does not establish the second block 210 because of receiving the first broadcast 120. The second node 200 may receive several broadcasts before establishing a new block 210, while the second node 200 is only establishing a new block When receiving the second block 210, the acknowledgement information (Ack) of the received broadcast (passing the inspection) is written into the second block 210. When the first broadcast 120 passes the check, and the second node 200 writes the confirmation information of the first broadcast 120 into a newly generated second block 210, it represents the second block 210 to confirm (Ack) the first area Block 110, as shown in FIG. 5, the second block 210 points to the arrow of the first block 110. In practice, the confirmation data includes the creator code of the first block (Block Proposer ID), the hash value of the first block (Block Hash), the height of the first block (Block Height), and a confirmation time stamp (Block Ack Timestamp), where the confirmation timestamp is the timestamp when the second node 210 received the first broadcast 120, and the height of the first block is the first block 110 generated in the blockchain of the first node 100 In sequence, for example, if the first block 110 is the second block generated by the first node 100, the height of the first block is 2. When the second node 200 establishes the second block 210, it sends a second broadcast 220 to notify other nodes, where the second broadcast 220 contains information about the second block 210, and the second broadcast 220 is based on the gossip protocol ( Gossip Protocol) to ensure that all nodes (including the first node 100) can receive the broadcast, but the broadcast method is not limited to this.

In a specific embodiment, the block is created with a creation time stamp. When the second block 210 confirms (Ack) the first block 110, the creation time stamp of the second block 210 must be greater than the first block. The creation timestamp of block 110, that is, the first block 110 must be created earlier than the second block 210.

Please refer to FIG. 7, which is a schematic diagram of the blockchain structure of the present invention. In Figure 7, Each node establishes multiple blocks to form a blockchain, and multiple nodes confirm the newly generated blocks with each other (as shown by the arrows between the blocks) to form a directed acyclic graph (Directed Acyclic Graph) Graph (DAG) architecture. In a specific embodiment, block 20 is the latest block generated by node 10. When block 20 is confirmed (Ack) by more than two-thirds of the total number of nodes, the block chain 30 to which block 20 belongs is Become a confirmed blockchain. It is worth noting that because the block information includes the previous block hash (Previous Block Hash), when the node 10 generates a new block 20 (subblock), it is confirmed by more than two-thirds of the nodes ( Ack) is equivalent to confirming all connected blocks (parent blocks) before block 20 (child blocks) of node 10. The consensus algorithm (Ack) used in the present invention solves the Byzantine Generals Problem in the blockchain.

Please refer to FIG. 1 and FIG. 8, which is a schematic diagram of a specific embodiment of step 3000 in FIG. 1. After performing the above steps 2000, a plurality of confirmed blockchains are obtained, and then step 3000 is performed to compact multiple confirmed blockchains to form a common blockchain. In the specific embodiment of FIG. 8, the blockchains 30, 32, and 34 generated by the nodes 10, 12, and 14 have been confirmed by more than two-thirds of the nodes (Ack) to form a confirmed blockchain, and the nodes can apply All confirmed blockchains are compacted into a common blockchain, which contains all the blocks of all confirmed blockchains, and these blocks (21, 22, 23, 24, 25 , 26, 27) The relative position of the sort is fixed. The order of the blocks can be sorted according to the creation timestamp of each block, or sorted according to an ordering algorithm. Among them, the sorting algorithm regards the previous block that has been placed in the common blockchain as the first order to enter the common blockchain, and then enters the common area based on the number of times the block is confirmed (Ack). The ordering of the blockchain, using the Ordering Algorithm for Total Ordering, can avoid the use of block creation timestamps. Avoid the risk of tampering with creation timestamps.

In practical applications, although each node establishes a different blockchain, each node will confirm each other by broadcast (Ack), so the common blockchain calculated by each node will be consistent. The common blockchain is stored in each node as a basis for inspection (public ledger). In a specific embodiment, a representative can also be used to check whether the common blockchain generated by each node is consistent to ensure the consistency of the data.

In practical applications, since each node establishes a blockchain by obtaining a shared file from the blockchain network, the same transaction record may be generated when two common blockchains are formed and recorded in two different districts. In the block, when the same transaction is detected repeatedly in real time, it will automatically delete one of the duplicate transaction records to ensure the correctness of the data.

In a specific embodiment, an electronic computer device is sliced into a plurality of nodes, and each node operates independently to generate a blockchain, so that the computing resources are used to the maximum.

The method and system for generating a blockchain according to the present invention utilize a plurality of nodes to form a blockchain each, and use a consensus algorithm and a ranking algorithm to compact a plurality of blockchains into a common blockchain. Compared with the conventional technology, the present invention proposes an innovative blockchain data structure based on Directed Acyclic Graph (DAG). Multiple nodes establish their own blockchains at the same time, making the block production speed much faster than The current blockchain system avoids the problem of centralization. On the other hand, the present invention uses the method of mutual confirmation (Ack) between nodes to achieve consensus between the nodes, which can not only solve the Byzantine Generals Problem, but also greatly reduce the system's calculation volume and avoid waste of resources. . At the same time, because the block production speed of the present invention is much faster than the current blockchain system, it means that when a transaction is put on the blockchain generation system of the present invention, it can be written into the block quickly, so Addressed the issue of fairness in conventional technology question.

With the above detailed description of the preferred embodiments, it is hoped that the features and spirit of the present invention can be more clearly described, and the scope of the present invention is not limited by the preferred embodiments disclosed above. On the contrary, the intention is to cover various changes and equivalent arrangements within the scope of the patents to be applied for in the present invention. Therefore, the scope of the patent scope of the present invention should be interpreted in the broadest sense according to the above description, so that it covers all possible changes and equal arrangements.

Claims (18)

A blockchain generation method is executed in a computer system. The computer system includes a plurality of nodes including the following steps: the nodes obtain a shared file based on a blockchain agreement, and create a block based on the shared file Chain, where each block chain contains a block, and the content of the block chain created by each node is not completely the same; the nodes confirm the block chain with each other to form a plurality of confirmed block chains; These confirmed blockchains are compacted to form a common blockchain; and the common blockchain is stored at these nodes. The method as described in item 1 of the patent application scope, wherein the steps of the nodes confirming the blockchain to form a plurality of confirmed blockchains, further comprising the following sub-steps: one of the nodes is the first A first block is generated in the established blockchain, and a first broadcast corresponding to the first block is issued; nodes other than the first node receive the broadcast and confirm the first block; And when the first block is confirmed by more than a predetermined number of the nodes, the block chain established by the first node becomes the confirmed block chain. The method as described in item 2 of the patent application scope, wherein the predetermined number is two-thirds of the total number of the nodes. The method as described in item 2 of the patent application scope, in which the nodes other than the first node receive the first broadcast to confirm the sub-step of the first block, and further include the following sub-steps: one of the nodes Two nodes receive the first broadcast of the first node; the second node generates a second block according to the shared file, wherein the second block contains confirmation data corresponding to the first block; and the first The two nodes send out a second broadcast corresponding to the second block. The method as described in item 4 of the patent application scope, wherein the confirmation data includes the creator code of the first block, the hash value of the first block, the height of the first block, and a confirmation time stamp , Where the confirmation timestamp is the timestamp when the second node received the first broadcast. The method as described in item 4 of the patent application scope, wherein a creation timestamp of one of the second blocks is greater than a creation timestamp of one of the first blocks, wherein the creation timestamp is the timestamp of the creation of the block. The method as described in item 1 of the patent application scope, wherein the block of each block chain is compacted according to a sorting algorithm to form the common block chain. The method as described in item 1 of the patent application scope, wherein the block contains a creator code, a transaction record, the hash value of the block, the hash value of the block before the block, and a creator signature , A block height and a confirmation data. The method as described in item 8 of the patent application scope, wherein the transaction record includes a plurality of transaction data, and each transaction data includes a transaction code, a sender code, a receiver code, a transaction volume, and a sender signature . A blockchain generation system includes: a blockchain network that stores a shared file; and a plurality of nodes that connect to the blockchain network to obtain the shared file, and create a Blockchain, these nodes mutually confirm the blockchain to form a plurality of confirmed blockchains; wherein, the confirmed blockchains are compacted to form a common blockchain, and the common blockchain is Stored in these nodes, and each blockchain contains a block, and the content of the blockchain created by each node is not exactly the same. The blockchain generation system as described in item 10 of the patent application scope, wherein the plurality of nodes includes a first node, the first node generates a first block based on the shared file, and issues the first block Corresponding to a first broadcast, where the nodes other than the first node receive the first broadcast and confirm the first block, when the first block is confirmed by more than a predetermined number of the nodes, the The blockchain established by the first node becomes the confirmed blockchain. The blockchain generation system as described in item 11 of the patent application scope, wherein the predetermined number is two-thirds of the total number of these nodes. The blockchain generation system as described in item 11 of the patent application scope, wherein the plurality of nodes includes a second node for receiving the first broadcast of the first node, wherein when the second node is based on the shared file When a second block is generated, the second block contains confirmation data corresponding to the first block, and the second node sends out a second broadcast corresponding to the second block. The blockchain generation system as described in item 13 of the patent application scope, wherein the confirmation data includes the creator code of the first block, the hash value of the first block, the height of the first block, and a A confirmation timestamp, where the confirmation timestamp is the timestamp that the second node received the first broadcast. The blockchain generation system as described in item 13 of the patent application scope, wherein the creation timestamp of one of the second blocks is greater than the creation timestamp of one of the first blocks, wherein the creation timestamp is the one created by the block Timestamp. The blockchain generation system as described in item 10 of the patent application scope, wherein the block of each blockchain is compacted according to a sorting algorithm to form the common blockchain. The blockchain generation system as described in item 10 of the patent application scope, in which the block contains a creator code, a transaction record, the hash value of the block, the hash value of the block before the block, A creator's signature, a block height, and a confirmation data. The blockchain generation system as described in item 17 of the patent application scope, wherein the transaction record includes a plurality of transaction data, each transaction data includes a transaction code, a sender code, a recipient code, a transaction volume and A sender's signature.