KR20190020721A - Blockchain system and method of creating blockchain - Google Patents

Abstract

Provided are methods for generating a blockchain. According to the present invention, one of the methods comprises: a step of generating and storing, in a storage, blockchain data comprising a main branch including one or more first type blocks each being connected according to a generation order of the blocks, and one or more sub-branches including one of the first type blocks and one or more second type blocks each being connected by using the first type block as a root block, wherein the second type blocks of the sub-branches are connected according to a generation order of the blocks, and the second type block which is generated for the first time from the sub-branches is connected to the root block; and a step of generating a novel first type block to be connected to the final first type block of the main branch, wherein the novel first type block includes a hash value of at least a part of the final second type block of the sub-branches.

Description

[0001] Block Chain System and Method for Creating Block Chain [

The present invention relates to a block-chain system and a method for generating a block-chain, and more particularly, to a block-chain system including a main branch and a sub-branch, and a method for generating such a block-chain.

The block chain is a kind of distributed database, known as the concept introduced in encrypted virtualization bit-coin. Conventionally, digital contents such as transaction books and documents are stored and managed in a centralized server. In a block chain system, cumulative digital contents are stored and managed in a plurality of participants (nodes) connected through a network. This block chain system is advantageous in that it is very difficult for forgery or alteration because the digital contents themselves are disclosed through the Internet and the verification is progressed frequently by a large number of participants.

Such a block chain system is used for a virtual currency system such as a bit coin or a transaction record keeping of a financial institution. In recent years, such a block chain system is also used for electronic document management and original verification.

For example, in the case of the bit coin, the nodes collect the transfer information on average every 10 minutes to newly generate a block, propagate the same to the corresponding peer-to-peer network, and propagate the nodes or the cipher money wallet, To the block chain.

The block chain includes a plurality of blocks, and a new block is added in a chain form to the last block of the block chain at a specific time. In the case of the bit coin, the block is composed of a header part including a transaction part including transfer records, a previous block number and a current block number as shown in the figure.

For example, if the first block including block number 1 is generated in block chain of bit coin, block 2 is generated. After the initial block is generated, a node that has won the competition to find the next block generates block 2 and propagates to the corresponding network. At this time, the block 2 includes the block number 2 of the previous block together with the block number 2 of its own in the header part. That is, a new block includes a block number of a previous block in a header portion, and a method of connecting a previous block and a new block in a chain form is used.

The bit coin purse installed in the computing device receives the whole block chain through the peer-to-peer network and stores it in the storage unit of the computing device. However, by installing a lightweight wallet, only the header portion of the block chain can be stored in the storage of the computing device.

On the other hand, the nodes participating in the block chain must store and maintain the data of the entire block chain in the computing device. It is not a problem if the size of the entire block chain is small because there are few accumulated transactions, but as the number of new blocks increases, the size of the entire block chain gradually increases. The total block chain size of bit coin, which is a representative block chain system, is now several tens of Gbytes.

Thus, nodes participating in a block chain need a high level of storage and computing devices capable of storing and maintaining such large amounts of data. However, typical personal computers may not achieve this level of performance. In particular, personal mobile devices such as smart phones and tablet computers do not reach this level of performance.

SUMMARY OF THE INVENTION It is an object of the present invention to provide a block chain system in which blocks are connected to a plurality of branches so that data can be efficiently and systematically managed.

Another problem to be solved by the present invention is to provide a block chain system and a method of generating such a block chain, which can ensure safety against forgery and falsification of all blocks even if blocks are connected by a plurality of branches.

The present invention has been made in view of the above problems, and it is an object of the present invention to provide a method of manufacturing the same.

According to an embodiment of the present invention, there is provided a method for generating a block chain, the method comprising: generating a block including at least one first type block and at least one first type block, And at least one second type block, wherein the second type block comprises at least one sub-branch connected with the first type block as a root block, and the second type block Wherein the second type block generated first in the one sub-branch generates block-chain data connected to the root block and stores the block-chain data in a storage, Generating a block to be connected to a last first type block of the main branch, wherein the new first type block comprises: The film of claim comprises at least a part of the hash value of the second type block.

The new first type block may further include a hash value of at least a portion of the last type 1 block.

And may include a hash value of at least a portion of the last type 2 block and a hash value of at least a portion of the last type 1 block.

The new first type block may include in the block header a hash value of at least a portion of the last type 2 block and a hash value of at least a portion of the last type 1 block.

The new first type block may include hash values of at least some of the last type 2 blocks of all sub-branches.

The new first type block may include a hash value of at least a portion of a last type 2 block that is not included in a first type block having at least some hash values different from each other.

Wherein the new first type block comprises a hash value of at least a portion of two or more last type 2 blocks and the hash value is a hash value for a root of the merge tree generated from at least a portion of each last type 2 block Lt; / RTI >

The last type 2 block may be a block previously generated before the new type 1 block.

The details of other embodiments are included in the detailed description and drawings.

The block chain system according to an embodiment of the present invention can efficiently and systematically manage data by configuring the blocks to be connected to a plurality of branches.

In addition, the block-chain system according to an embodiment of the present invention can ensure safety against forgery and falsification of all blocks even if the blocks are connected by a plurality of branches.

The effects according to the embodiments of the present invention are not limited by the contents exemplified above, and more various effects are included in the specification.

1 shows the construction of individual blocks of a block-chain system according to an embodiment of the invention.
Figure 2 illustrates two blocks of a block chain system in accordance with an embodiment of the present invention.
3 is a diagram for explaining data of a block-chain system according to an embodiment of the present invention.
4 is a diagram for explaining a display method of a block in a block chain.
5 is an exemplary diagram of a block-chain system in accordance with an embodiment of the present invention.
6 is a diagram for explaining a final first type block of a block chain system according to an embodiment of the present invention.
7 is an exemplary diagram of a block chain system according to another embodiment of the present invention.
Figures 8 and 9 are illustrations of a block chain system in accordance with another embodiment of the present invention.
10 is a flowchart illustrating a data management method using a block chain according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings. In describing the present invention, if it is judged that it is possible to make the gist of the present invention obscure by adding a detailed description of a technique or configuration already known in the field, it is omitted from the detailed description. In addition, terms used in the present specification are terms used to appropriately express the embodiments of the present invention, which may vary depending on the person or custom in the relevant field. Therefore, the definitions of these terms should be based on the contents throughout this specification.

Hereinafter, a block-chain system according to an embodiment of the present invention will be described with reference to FIGS. 1 to 5 attached hereto.

1 shows the construction of individual blocks of a block-chain system according to an embodiment of the invention. Figure 2 illustrates two blocks of a block chain system in accordance with an embodiment of the present invention.

Referring to FIG. 1, one block 100 includes a block header 110 and a block body 120.

The block header 110 may include a title of a block, a hash value of a previous block, a hash value of a block body, a timestamp, a difficulty target, and a nonce. The information included in the block header 110 may be configured in various ways.

The title of a block indicates identification information that can distinguish the block 100 from other blocks. The title of a block can be determined according to the connection relationship with other blocks.

The hash value of the immediately preceding block is a hash value of a block generated before the corresponding block in the branch and connected to the corresponding block. The hash value of the immediately preceding block may be the hash value of the entire or selected part of the immediately preceding block. For example, the hash value of the previous block may be defined as a hash value of the information of the block header of the immediately preceding block. By including the hash value of the immediately preceding block in the block header, the connectivity between the blocks can be enhanced. The enhancement of the connectivity between the blocks means that the security of the entire block chain system is improved.

The hash value of the block body is the hash value of the data contained in the block body 120 of the block. As will be described later, the block body 120 includes data. The hash value of the block body may be a hash value of the entire or selected portion of the data that the block body contains. The hash value of the block body can be determined in various ways. For example, the hash value of the block body may be a hash value for the root of the merge tree generated from the data of the block body 120. [ The hash value of the block body corresponds to a summary of the data of the block body 120, which enables efficient management and verification of data of the block body 120 having a relatively large size.

The time stamp is information on the generation time of the corresponding block.

The difficulty goal is the difficulty goal for the task proof algorithm of the block. This is information about determining the hashing power needed to find the nonce of the block.

The nonce is the counter information used in the task proof algorithm of the block.

In the block header 110, some of the above-described information may be excluded, or other information may be additionally included.

The block body 120 includes data that the block 100 stores and manages. The data corresponds to digital data. The data can be of various types of data. For example, the data may include digital contents, document information, account information, transaction information, personnel information, production history information, design and drawings of products or buildings, sound information, and the like.

The data included in the block body 120 may be limited in type or size depending on the block. The limitation of such data may be applied to all the blocks in common, or may be selectively applied to only certain specific blocks. Further, the limitation of such data can be changed as needed.

Referring to FIG. 2, the two blocks may be connected to each other. Specifically, a plurality of blocks may be sequentially connected to form a branch. Here, a branch means a set of blocks in which a plurality of blocks are linearly connected with each other. FIG. 2 shows a state where two arbitrary blocks are connected in this branch.

Referring to FIG. 2, any one block 200 in the branch is connected to the immediately preceding block 100 in the branch. The block 200 is concatenated by including the hash value of the immediately preceding block 100. Specifically, block 200 may be concatenated by including a hash value of block 100 that was generated in block header 210 immediately before.

The hash value of the immediately preceding block 100 may be a hash value of information of all or a selected portion of the immediately preceding block 100, as described above. For example, as shown in FIG. 2, the hash value of the immediately preceding block 100 may be defined as a hash value of the information of the block header 110 of the immediately preceding block. The hash value of the immediately preceding block can be variously changed according to the preference and judgment of the person designing the block.

Referring to FIG. 3, data of a block-chain system according to an embodiment of the present invention will be described.

The block chain system of the present invention includes a plurality of blocks. One block contains one piece of data. Here, the data means a unit set of information included in one block. In particular, the block body of the block may contain data.

The data included in the block of the block chain system can be divided into the first type data and the second type data. Type 1 data corresponds to data that is not based on other data. The second type data corresponds to the data based on the first type data.

Referring to FIG. 3, the first type data 10 may be data relating to generating new data. The second type data 20 may be data related to performing at least one of modification, modification, deletion, discarding, inquiry, and delivery of existing data. Here, the existing data means the data generated by the first type data 10.

Specifically, the data can be digital content, documents, accounts, transactions, greetings, production histories, designs, drawings, sounds, programming codes, and the like. Also, the first type data and the second type data can be classified according to these various kinds. The first type data and the second type data are not limited to those described above.

Referring to Fig. 4, the blocks constituting the block chain shown in Figs. 5 to 9 will be briefly described.

The block includes a block header and a block body, as described with reference to FIG. 1 and FIG. However, for convenience of explanation, FIGS. 5 to 9 show individual blocks in the manner shown in FIG.

Referring to FIG. 3, in describing one block, a title of a block, a hash value of a previous block, and a hash value of the block are displayed. One block is a table of three columns arranged vertically. In the first column, the title of the block is displayed. In the second column, the hash value of the previous block is displayed. In the third column, the hash value of the block is displayed.

The last type 1 block to be described below may further include the hash value of the last type 2 node. In describing the last type 1 block, the hash value of the last type 2 node may be additionally displayed in addition to the title of the block, the hash value of the previous block, and the hash value of the block. In the last type 1 block, the title of the block is displayed in the first column, the hash value of the previous block is displayed in the second column, and the hash value of the last type 2 node is displayed in the third column And the fourth column shows the hash value of the block. The hash value of the last type 2 node will be described in detail below.

The title of the block is displayed in the form of Bn or Bnm. The title of the block is Bn, which means that the block is the nth block of the main branch. And the title of the block is Bnm, this means that the block is the mth second type block of the sub branch that branches from the nth block of the main branch. And the m < th > second type block of an arbitrary sub branch corresponds to the (m + 1) th block of the sub branch.

The hash value of a certain block is indicated by using the symbol " H ". For example, a hash value of a block whose title is Bnm is denoted by Hnm. Referring to FIG. 4, a block immediately before a block whose title is Bnm is a block whose title is Bn (m-1), and a hash value of a previous block is Hn (m-1).

The main branch, the sub-branch, the second type block, and so on, which are described while explaining the title of the block, the symbol of the hash value, etc. will be described in detail with reference to FIG.

Referring to FIG. 5, a block chain system according to an embodiment of the present invention will be described. 5 is an exemplary diagram of a block-chain system in accordance with an embodiment of the present invention.

The block chain system of the present invention includes a plurality of blocks. One block contains one piece of data. As described above, the data can be divided into the first type data 10 and the second type data 20. The block may be divided into a first type block 100 and a second type block 200 according to the type of data to be included. The first type block 100 corresponds to a block including the first type data 10. The second type block 200 corresponds to a block including the second type data 20.

The block chain system of the present invention includes a main branch 1000 and at least one sub-branch 2000. Here, a branch means a set of blocks in which a plurality of blocks are linearly connected with each other.

The main branch 1000 includes a first genesis block and at least one connection block connected thereto. In the main branch 1000, the connection block is connected in the first generated block without branching in one direction. Branches may not be included in the main branch 1000 although other branches may be formed in the main branch 1000. The branched blocks may be included in the sub-branch 2000, which will be described below.

The main branch 1000 is comprised of first type blocks 100. That is, the first block and the connection block included in the main branch 1000 correspond to the first type block 100. The blocks included in the main branch 1000 are connected in order according to the created order. The concatenation of the blocks is accomplished by the block containing the hash value of at least a portion of the immediately preceding block. This type of connection is indicated by an arrow between blocks in Fig. Thus, except for the first generated block, one type 1 block includes at least some hash values of the immediately preceding type 1 block.

The sub branch 2000 is a branch formed from the main branch 1000. The sub-branch 2000 includes a root block and at least one connection block connected thereto. The root block is also a block included in the main branch 1000, and is a block in which branching of the sub branch 2000 starts. The root block corresponds to a first genesis block in the sub-branch 2000.

Here, the root block corresponds to the first type block 100. The connection block included in the sub branch 2000 corresponds to the second type block 200. The blocks included in one sub-branch 2000 are connected in order according to the order in which they are generated. The concatenation of the blocks is accomplished by the block containing the hash value of at least a portion of the immediately preceding block. Therefore, the first connection block (the second type block) generated in one sub-branch 2000 includes the hash value of at least a part of the connected root block of the sub-branch 2000. In addition, the connection block (the second type block) not originally generated in one sub-branch 2000 includes the hash value of at least a part of the second type block included in the sub-branch 2000 and generated immediately before. This type of connection is indicated by an arrow between blocks in Fig.

Sub-branch 2000 is conditional on including at least one connection block (second type block). In some cases, a sub-branch in which there is no link block (second type block) and only one root block (first type block) exists is one block in height (length) Is not present. That is, for convenience of description, the sub-branch 2000 defines that there is one root block (first type block) and at least one connection block (second type block) connected thereto.

One or more than two sub-branches 2000 may be formed. The sub-branches 2000 may be formed in a form in which one or more of the sub-branches 2000 extend from one root block. However, for convenience of description, it is assumed that only one sub-branch 2000 is formed in one root block in the accompanying drawings and the following description. However, this description does not exclude that two or more sub-branches 2000 are extended in one root block in the present invention.

If one sub-branch 2000 is formed in one root block, the sub-branch 2000 can be formed up to the number of blocks of the largest main branch 1000.

Although FIG. 5 illustrates that the block chain system is composed of the main branch 1000 and the sub branch 2000, and the blocks are composed of the first type block 100 and the second type block 200, A main branch, a sub branch, and a sub-branch, and the blocks may also be composed of a first type block, a second type block, and a third type block. Here, the sub-sub-branch means a branch branching from a sub-branch to a sub-branch with a main branch. The root block of the sub-sub-branch may be a type 2 block included in the sub-branch. And the connection block of the sub-sub-branch may be a type 3 block. As described above, in the block-chain system of the present invention, the main branch and the sub-branch are relative, and the sub-branch may be generated in a cascade fashion.

The final type 1 block 190 will now be described with reference to FIG. The block chain system shown in FIG. 5 is only one example of a block chain system of the present invention, and the last type 1 block 190 of such a block chain system is only an example for explanation of the present invention.

Referring to FIG. 5, a last block 190 exists in the main branch 1000. The last block 190 corresponds to the last type 1 block. Specifically, the last block 190 corresponds to the last first type block 190 of the branch connected starting with the first generated block in the main branch 1000. In FIG. 5, the last first type block 190 corresponds to a B5 block. In FIG. 5, the last type 1 block 190 corresponds to the last block generated in all the other blocks shown in FIG.

5 includes the hash value of another block such as the hash value H4 of the previous block, but the hash value H5 of the last type 1 block is included in another block It does not. The hash value H5 of the last type 1 block may be included in the block in which the first type block is additionally connected in the main branch 1000, At this point in time, the hash value (H5) of the last type 1 block is not included in another block.

The last first type blocks B5 and 190 further include hash values of other blocks in addition to the hash value H4 of the previous block. The hash value H4 of the immediately preceding block corresponds to the hash value of at least a part of the first type block B4 included in the main branch 1000 and generated immediately before the last first type block B5, do. The hash value of another block is a hash value distinguished from the hash value of the immediately preceding block. Hereinafter, the hash values of the other blocks will be described in detail.

5, the last block type B5, 190 may include a hash value (Hsum) of at least a portion of the last type 2 block 290 of the sub-branch 2000. Here, the range of the last type 2 block 290 is determined at the time when the last first type block B5, 190 is generated. Specifically, the sub branch 2000 connects the first type blocks B1, B2, B3, and B4 of the main branch 1000 generated before the last first type blocks B5 and 190 as root blocks It is a branch. And the last type 2 block 290 corresponds to the last type 2 block 290 of the branch connected starting with the root block of this sub-branch 2000. The last type 2 block 290 is a block that was generated before the last type 1 block B 5, 190. That is, the last second type block 290 is a block corresponding to the last block of the sub-branch 2000 when the last first type block B5, 190 is generated.

A plurality of sub-branches 2000 may exist at the time when the last first type blocks B5 and 190 are generated. And the last second type block 290 may exist in plural. Specifically, one last sub-block 290 is present in each of the plurality of sub-branches. In Figure 5, the last second type block 290 is shown as B13, B33, and B44. As described above, since the sub-branch 2000 includes at least one second-type block 200, the last second-type block 290 exists in the number of the sub-branches 2000.

5, if there is one last type 2 block 290, then the last type 1 block 190 includes the hash value of at least a portion of one last type 2 block 290 can do.

5, if there are a plurality of the last second type blocks 290, the last first type blocks B5 and 190 may be the same as those of all the last second type blocks B13, B33, and B44. And may include at least some hash values. Here, the hash value of at least some of the last second type blocks B13, B33, and B44 may be the hash value of the block header of the last second type blocks B13, B33, and B44.

The hash value (Hsum) of at least a portion of this last type 2 block may be included in the block header of the last type 1 block (B5, 190). The hash value (Hsum) of at least a part of the last type 2 block and the hash value (Hsum) contained in the main branch and generated immediately before the last type 1 block B5, 190 A hash value H4 of at least a portion of the first type block may be included. The hash value (Hsum) of at least a portion of the last type 2 block and the hash value (H4) of at least a portion of the immediately-generated first type block are distinguished from the block header of the last type block (B5, 190) . Thus, the hash values Hsum, H4 may be used for verification of the last type 2 block 290 and the main branch 1000. If the hash value H5 of the block header of the last first type block 190 including such hash values Hsum and H4 is generated so that the first type block is further connected to the main branch 1000, Are included in the blocks generated as < / RTI >

Referring to FIG. 6, the case where the last first type block B5, 190 includes a hash value (Hsum) of at least a part of a plurality of last second type blocks will be described. If there are a plurality of the last second type blocks 290, the hash values included in the last type 1 block 190 are the hash values for the root of the merge tree generated from at least a portion of each last type 2 block 290, Value (Hsum). Specifically, the last type 1 block 190 may include a hash value (Hsum) for the root of the merge tree generated from the hash values (H13, H33, H44) of the block header of each last type 2 block have.

The block-chain system described with reference to FIGS. 5 and 6 may not store and use the entire block chain data for verification of a specific block. Specifically, when the specific block is the first type block 100, the node can verify the specific block using only the block chain data of the main branch 1000. When the specific block is the second type block 200, the node can verify the specific block using only the block chain data of the main branch 2000 and the main branch 1000 including the specific block. This reduces the size of blocks that the node must store and verify.

Also, by including the hash value (Hsum) of at least a portion of the last type 2 block 290 as described above, the safety of the last type 2 block 290 can be enhanced have.

In the conventional block chain system, the safety of the last block is relatively weak. This is because the last block does not contain its hash value again in another block. In the block-chain system including the main branch and the at least one sub-branch described above, there may be a number of last blocks corresponding to the number of branches, and there may be many last blocks that are relatively insecure.

However, as described above, the last type 1 block 190 includes the hash value Hsum of at least a portion of the last type 2 block 290 to ensure the safety of the last type 2 block 290 . Specifically, the last type 2 block 290 is the last block of the individual sub-branches 2000, but its hash value is included in the last type 1 block 190, so that the aforementioned vulnerabilities can be overcome. As a result, in the inventive block-chain system, there is only one actual last block as in a conventional block-chain system.

A block chain system according to another embodiment of the present invention will be described with reference to FIG.

The block chain system described with reference to FIG. 7 differs from the hash value of at least a portion of the last type 2 block included in the block type system and the last type 1 block 190 described above with reference to FIGS. 5 and 6 have. Therefore, for convenience of explanation, the block chain system according to the present embodiment will be described mainly on the points different from those described above with reference to FIGS. 5 and 6. FIG.

In FIG. 7, the last type 1 block 190 corresponds to the last generated block than all the other blocks shown in FIG.

Referring to FIG. 7, the last type 1 block 190 may include a hash value (Hsum) of at least a portion of the last type 2 block 290 of the sub-branch. The last type 1 block 190 may include a hash value of at least a portion of the last type 2 block that is not included in the first type block having a hash value of at least a portion of the last type 2 block 290 have. That is, before the last first type block 190 is generated, another type 1 block is generated, and a second type block in which at least a part of the hash values are included in the other first type blocks, The second type block does not correspond to the last type 2 block of the hash value included in the hash value.

Referring to the example block chain system shown in FIG. 7, there are B13, B33, and B44 of the last second type block 290 at the time when the last first type block B5, 190 is generated. However, B13 is generated, and B2 is generated before B33 and B44 are generated. At the time when B2 is generated, a hash value (H13) of at least a part of B13 is included in B2.

Therefore, the last second type block in which at least some hash values of the last second type blocks 290 at the time of generation of the last first type blocks B5 and 190 are not included in the first type blocks are B33 and B44 . Thus, the last type 1 block B5, 190 includes hash values of at least some of B33 and B44. Specifically, the last first type block B5, 190 may include a hash value (Hsum) for the root of the merge tree generated from the hash values (H33, H44) of the block headers of B33 and B44.

In this case, at the time when the last type 1 block is generated, the last type 2 block in which at least some hash values are not included in the other type blocks may not exist. In the example block-chain system shown in Fig. 7, B3 and B4 correspond to this case. In this case, the last type 1 block includes only the hash values of at least some of the first type blocks included in the main branch and generated immediately before the last type 1 block, and the hash values of at least some of the last type 2 blocks May not be included.

According to this scheme, the last type 2 block has only one hash value of at least some of it contained in the last type 1 block. Therefore, the number of the last type 2 blocks to be included in the last first type block is reduced as compared with the case of the embodiment described above with reference to FIG. 5, the safety of the last type 2 block can be improved. However, when the size of the block chain is increased, the number of the last type 2 blocks to be referred to by the new last type 1 block gradually increases do. This may be a factor in reducing the efficiency of the block chain. Therefore, according to the embodiment described with reference to FIG. 7, there is an advantage that the efficiency of the block chain can be secured while improving the safety of the last type 2 block.

5 through 7, the block chain system and the final first type block according to various embodiments of the present invention have been described in detail.

However, the last type 1 block including the hash value of at least part of the last type 2 block does not correspond to the last type 1 block as other type 1 blocks are created and connected to the main branch. Thus, a block chain system including a case where a first type block including at least a hash value of a type 2 block is not the last block of the main branch will be further described.

8 is an exemplary diagram of a block-chain system in accordance with an embodiment of the present invention. Referring to FIG. 8, a block chain system according to another embodiment of the present invention will be described.

In Fig. 8, the order of generation of each block is indicated by red letters. The block chain system will be described with reference to this generation sequence.

In the embodiment of FIG. 8, any first type block of the main branch contains a hash value of at least a portion of some of the second type blocks previously created before any first type blocks. Specifically, the certain block may be the last block of the sub-branch when the first type block is generated. More specifically, some of the blocks may be the last block of all sub-branches when the first type block is created. This will be described with reference to the example block chain system shown in Fig.

The last block of the sub-branch that exists when the B2 block is generated is the B11 block. Therefore, the B2 block includes the hash value (H11) of at least a part of the B11 block. The B2 block includes a hash value (H1) of at least a part of the first type block (B1 block) generated in the main branch before the B2 block so as to be distinguished from the hash value (H11).

The last block of the sub-branch that exists when the B3 block is generated is also the B11 block. When the B3 block is generated, since there is no sub-branch that uses the B2 block as the root block, the last block of the sub-branch existing when the B3 block is generated is unique to the B11 block. Therefore, the B3 block includes a hash value (H11) of at least a part of the B11 block. The B3 block includes at least a part of the hash value H2 of the first type block (B2 block) generated in the main branch and immediately before the B3 block so as to be distinguished from the hash value H11.

The last block of the sub-branch that exists when the B4 block is created is the B13 and B32 blocks. Hence, the B4 block includes a hash value (Hsum) of at least a part of B13 and B32 blocks. The B4 block includes a hash value (H3) of at least a part of the first type block (B3 block) included in the main branch so as to be distinguished from the hash value (Hsum) and generated immediately before the B4 block.

When the B5 block is generated, the last block of the sub-branch that exists is the B13, B33, and B43 blocks. Therefore, the B5 block includes a hash value (Hsum) of at least a part of the blocks B13, B33, and B44. The B5 block includes a hash value (H4) of at least a part of the first type block (B4 block) included in the main branch so as to be distinguished from the hash value (Hsum) and generated immediately before the B5 block.

After the B5 block is generated, the B44 block is generated. The state of the block chain system shown in Fig. 8 is generated up to block B44. If another type 2 block is not generated after this, and the first type block is additionally generated, then the last block of the present sub branch is a block B13, B33 and B44. Thus, the newly generated last type 1 block includes hash values of at least some of the blocks B13, B33, and B44.

Referring to FIG. 9, a block chain system according to another embodiment of the present invention will be described. 9 is an exemplary diagram of a block-chain system in accordance with an embodiment of the present invention.

In Fig. 9, the order of generation of each block is indicated by red letters. The block chain system will be described with reference to this generation sequence. FIG. 9 shows that the block chain system shown in FIG. 8 and the connection and generation order of the respective blocks are the same.

In the embodiment of FIG. 9, any first type block of the main branch contains a hash value of at least a portion of some of the second type blocks previously created before any first type blocks. In particular, some of the blocks may be the last block of the sub-branch when any first-type blocks are created. More specifically, some of the blocks may be blocks in which at least some hash values are not included in another type 1 block when any type 1 block is generated. This will be described with reference to the example block chain system shown in FIG.

The last block of the sub-branch that exists when the B2 block is generated is the B11 block. The B11 block is a block whose hash value of at least a part of it is not included in the first type block which is different from the first type block. Therefore, the B2 block includes the hash value (H11) of at least a part of the B11 block. The B2 block includes a hash value (H1) of at least a part of the first type block (B1 block) generated in the main branch before the B2 block so as to be distinguished from the hash value (H11).

The last block of the sub-branch that exists when the B3 block is generated is also the B11 block. When the B3 block is generated, since there is no sub-branch that uses the B2 block as the root block, the last block of the sub-branch existing when the B3 block is generated is unique to the B11 block. However, the hash value of at least a part of the B11 block is already included in the B2 block. Therefore, the B3 block includes only the hash value (H2) of at least a part of the first type block (B2 block) included in the main branch and generated immediately before the B3 block, and does not include the hash value of at least a part of the type 2 block Do not.

The last block of the sub-branch that exists when the B4 block is created is the B13 and B32 blocks. Blocks B13 and B32 are blocks whose hash values of at least some of them are not included in the first type block. Hence, the B4 block includes a hash value (Hsum) of at least a part of B13 and B32 blocks. The B4 block includes a hash value (H3) of at least a part of the first type block (B3 block) included in the main branch so as to be distinguished from the hash value (Hsum) and generated immediately before the B4 block.

When the B5 block is generated, the last block of the sub-branch that exists is the B13, B33, and B43 blocks. Among them, the hash value of at least a part of the B13 block is already included in the B4 block. The B33 and B43 blocks are blocks in which at least a part of their hash values are not included in the first type block. Therefore, the B5 block includes a hash value (Hsum) of at least a part of the B33 and B44 blocks. The B5 block includes a hash value (H4) of at least a part of the first type block (B4 block) included in the main branch so as to be distinguished from the hash value (Hsum) and generated immediately before the B5 block.

After the B5 block is generated, the B44 block is generated. The state of the block chain system shown in Fig. 9 is generated up to block B44. If another type 2 block is not generated after this, and the first type block is additionally generated, then the last block of the present sub branch is a block B13, B33 and B44. Among them, the hash values of at least some of the B13 and B33 blocks are already included in the B5 block. Further, the B44 block is a block whose hash value of at least a part thereof is not included in the first type block having a different hash value. Thus, the newly generated last type 1 block includes at least some hash values of the B44 block.

10 is a flowchart illustrating a data management method using a block chain according to an embodiment of the present invention. Hereinafter, a block chain generation method according to an embodiment of the present invention will be described with reference to FIG.

The block chain generation method to be described with reference to FIG. 10 relates to a method of generating a block chain of the block chain system described with reference to FIGS. Therefore, for convenience of description, some of the contents overlapping with those described above with reference to Figs. 1 to 9 will be omitted.

Referring to FIG. 10, a block chain generation method includes a step S100 of providing a block chain and a step S200 of generating a new first type block.

Hereinafter, each of the above-described steps will be described in detail.

Step S100 of preparing a block chain corresponds to a step in which the block chain system generates and stores block-chain data including a main branch and at least one sub-branch in a storage in the system. Here, the storage means a separate storage space in the block body 120 or the block chain system. This has been described in detail with reference to FIG.

A step S200 of creating a new first type block is a step in which the block chain system generates a new first type block to be connected to the last first type block of the main branch. Here, the new first type block includes the hash value of at least a portion of the last type 2 block of the sub-branch. In addition, the new first type block may further include hash values of at least some of the last type 1 block. The new first type block may include a hash value of at least a portion of the last type 2 block and a hash value of at least a portion of the last type 1 block in a block header.

Specifically, the new first type block may include hash values of at least some of the last type 2 blocks of all sub-branches. This has been described in detail with reference to FIGS. 5 and 8. FIG.

In some cases, the new first type block may include hash values of at least some of the last type 2 blocks that are not included in the first type block, at least some hash values being different. This has been described in detail with reference to FIGS. 7 and 9. FIG.

The new first type block may include a hash value of at least a portion of two or more last type 2 blocks and the hash value may be a hash value for the root of the merge tree generated from at least a portion of each last type 2 block . This has been described in detail with reference to FIG.

The embodiments of the block chain system and the block chain generation method of the present invention have been described above. The present invention is not limited to the above-described embodiments and the accompanying drawings, and various modifications and changes may be made by those skilled in the art to which the present invention pertains. Therefore, the scope of the present invention should be determined by the equivalents of the claims and the claims.

10: first type data 20: second type data
100: first type block 200: second type block
110, 210: block header 120, 220: block body
190: Last Type 1 block 290: Last Type 2 block
1000: Main Branch 2000: Sub Branch

Claims (8)

Wherein the first type block comprises at least one first type block, each of the first type blocks being a main branch,
Wherein the first type block comprises at least one of the first type blocks and at least one second type block, the second type block comprises at least one sub-branch connected with the first type block as a root block,
Wherein the second type blocks of the one sub-branch are connected according to a generation order of blocks,
Generating block-chain data connected to the root block and storing the generated block-chain data in a storage, the second type block being generated first in the one sub-branch; And
And generating a new first type block to be connected to a last first type block of the main branch,
Wherein the new first type block comprises a hash value of at least a portion of a last type 2 block of the sub-branch. The method according to claim 1,
Wherein the new first type block comprises:
Further comprising a hash value of at least a portion of the last type 1 block. 3. The method of claim 2,
Wherein the new first type block comprises:
Wherein a hash value of at least a portion of the last type 2 block is distinguished from a hash value of at least a portion of the last type 1 block. 3. The method of claim 2,
Wherein the new first type block comprises:
Wherein a hash value of at least a portion of the last type 2 block and a hash value of at least a portion of the last type 1 block are included in a block header. The method according to claim 1,
Wherein the new first type block comprises:
A hash value of at least a portion of a last type 2 block of all sub-branches. The method according to claim 1,
Wherein the new first type block comprises:
Wherein at least some hash values include hash values of at least some of the last type 2 blocks not included in the other type 1 blocks. The method according to claim 1,
Wherein the new first type block comprises:
A hash value of at least a portion of at least two last type 2 blocks,
The hash value,
A hash value for the root of the merge tree generated from at least a portion of each last type 2 block. The method according to claim 1,
The last type < RTI ID = 0.0 >
Wherein the new block is a block generated before the new first type block.

Images