KR20230096526A - Method of distributing and storing block chain data and device of thereof - Google Patents

Abstract

Block chain data distribution storage method according to an embodiment of the present invention, based on the capacity of each block chain data including at least one of first data and reference information data, block chain data that is divided and stored among block chain data is at least selecting as one piece of second data; dividing the second data to generate a plurality of third data each having a predetermined reference capacity; selecting at least one first peer node from among a plurality of peer nodes based on states of a plurality of peer nodes and a plurality of third data; and copying each of the generated third data based on the number of the plurality of first peer nodes and storing them in the plurality of selected first peer nodes.

Description

Block chain data distribution storage method and block chain data distribution storage device {METHOD OF DISTRIBUTING AND STORING BLOCK CHAIN DATA AND DEVICE OF THEREOF}

The present invention relates to a blockchain data distributed storage device and a blockchain data distributed storage method.

Recently, with the advent of cryptocurrencies such as Bitcoin, Ethereum, and Ripple, blockchain technology is in the limelight. Blockchain technology guarantees the security of data and enables transparent management based on P2P distributed computing. Blockchain, a key technology in the 4th industrial era, is a trend that is applied to various fields such as finance and medical care. Unlike the server-client network model in which a server manages data and provides services to clients, a blockchain network has a decentralized structure without a server, and each node must store blockchain data to participate in the network.

On the other hand, since blockchain data gradually increases as transactions continuously occur, all nodes must store such large-capacity blockchain data to participate in the blockchain network, which causes problems with space to store large-capacity blockchain data. there is. In addition, when only the hash value of large-capacity blockchain data is stored and the original blockchain data is stored in an external storage device, there is a possibility of leakage or loss of the original data, resulting in a security problem of blockchain technology.

The problem to be solved by the present invention is to provide a method and apparatus for distributing and storing block-chain data when the block-chain data grows beyond a certain capacity.

However, the problem to be solved by the present invention is not limited to those mentioned above, and another problem to be solved that is not mentioned can be clearly understood by those skilled in the art from the description below. will be.

Block chain data distribution storage method according to an embodiment of the present invention, based on the capacity of each block chain data including at least one of first data and reference information data, block chain data divided and stored among the block chain data selecting as at least one second data; dividing the second data to generate a plurality of third data each having a predetermined reference capacity; selecting at least one first peer node from among the plurality of peer nodes based on states of a plurality of peer nodes and the plurality of third data; and copying each of the generated third data based on the number of the plurality of first peer nodes and storing them in the selected plurality of first peer nodes.

The selecting of the second data includes selecting the first data as the second data when the first data exceeds the reference capacity and the reference information data is equal to or less than the reference capacity, and The generating of the 3 data may include generating each data divided by the predetermined capacity unit and residual data remaining after dividing the second data by the predetermined capacity unit as third data.

The selecting of the second data includes selecting the first data and the transaction data as second data when the first data exceeds the reference capacity and the reference information data is equal to or less than the reference capacity. And the generating of the third data may include generating each data divided by the predetermined capacity unit and residual data remaining after dividing the second data by the predetermined capacity unit as third data. .

The step of selecting the second data includes selecting the first data and the reference information data as second data when each of the first data and the reference information data exceeds the reference capacity; The generating of the third data may include generating third data, each data obtained by dividing the second data by the predetermined capacity unit, and residual data remaining after dividing the second data by the predetermined capacity unit.

The state of the plurality of peer nodes includes a storage space of the plurality of peer nodes or a sum of routing distances between the plurality of peer nodes, and the selecting of the plurality of first peer nodes comprises: selecting the number of peer nodes required for consensus as the number of the first peer nodes; and selecting a plurality of first peer nodes having the number of first peer nodes in the order in which the storage space of each of the plurality of peer nodes is greater than or equal to the reference capacity and the sum of routing distances is the smallest among the plurality of peer nodes. steps may be included.

The blockchain data distribution and storage method includes generating a hash table based on the generated plurality of third data and the plurality of first peer nodes; and storing the generated hash table in the plurality of second peer nodes.

The hash table may be stored in an in-memory database of the plurality of first peer nodes.

The generating of the hash table may include calculating a hash value of the third data by using a hash function of the plurality of first peer nodes and the third data; generating a Merkle tree with the calculated hash value; and generating a hash table using the generated Merkle tree and hash values of the third data.

A block chain data distribution storage device according to another aspect of the present invention includes a transceiver for acquiring block chain data including at least one of first data and reference information data; And based on the capacity of each block-chain data including at least one of the obtained first data and reference information data, block-chain data that is divided and stored among the block-chain data is selected as at least one second data, The second data is divided to generate a plurality of third data each having a predetermined reference capacity, and at least one of the plurality of peer nodes is generated based on the state of the plurality of peer nodes and the plurality of third data. and a controller for controlling to select a first peer node of , copy each of the generated third data based on the number of the plurality of first peer nodes, and store the generated third data in the selected plurality of first peer nodes. .

A computer program according to another embodiment of the present invention includes instructions for causing a processor to perform a block chain data distribution storage method performed by a block chain data distribution storage device, the method comprising: a first Selecting block chain data divided and stored from among the block chain data as at least one second data based on the capacity of each block chain data including at least one of data and reference information data; dividing the second data to generate a plurality of third data each having a predetermined reference capacity; selecting at least one first peer node from among the plurality of peer nodes based on states of a plurality of peer nodes and the plurality of third data; and copying each of the generated third data based on the number of the plurality of first peer nodes and storing them in the selected plurality of first peer nodes.

A computer readable recording medium according to another embodiment of the present invention stores a computer program, and the computer program provides instructions for causing a processor to perform a block chain data distribution storage method performed by a block chain data distribution storage device. and, wherein the method selects, as at least one second data, block-chain data that is divided and stored from among the block-chain data, based on the capacity of each block-chain data including at least one of the first data and the reference information data. doing; dividing the second data to generate a plurality of third data each having a predetermined reference capacity; selecting at least one first peer node from among the plurality of peer nodes based on states of a plurality of peer nodes and the plurality of third data; and copying each of the generated third data based on the number of the plurality of first peer nodes and storing them in the selected plurality of first peer nodes.

According to an embodiment of the present invention, when the capacity of blockchain data exceeds a predetermined capacity, data loss can be prevented by dividing and storing it in each blockchain network, and data leakage can be prevented by distributed storage. In addition, not only general data, but also standard information data and hash tables can be distributed and stored, so that the capacity stored in the entire blockchain network can be reduced, and leakage of each data can be prevented.

1 is a block diagram illustrating a block chain data distribution storage device according to an embodiment of the present invention.
2 is a block diagram illustrating a block chain data distribution storage system for distributed storage of block chain data according to an embodiment of the present invention.
3 shows the classification of peer nodes according to the capacity of data stored in a blockchain data distribution storage device according to an embodiment of the present invention.
4 illustrates how peer nodes are configured as local clusters according to one embodiment of the present invention.
5 is a block diagram illustrating the function of a data broker unit according to an embodiment of the present invention.
6 is a block diagram for explaining a block chain data distribution storage device in terms of hardware.
7 is a flowchart of a block chain data distribution storage method according to another aspect of the present invention.

Advantages and features of the present invention, and methods of achieving them, will become clear with reference to the detailed description of the following embodiments taken in conjunction with the accompanying drawings. However, the present invention is not limited to the embodiments disclosed below, but may be implemented in various different forms, and only these embodiments make the disclosure of the present invention complete, and common knowledge in the art to which the present invention belongs. It is provided to completely inform the person who has the scope of the invention, and the present invention is only defined by the scope of the claims.

In describing the embodiments of the present invention, if it is determined that a detailed description of a known function or configuration may unnecessarily obscure the subject matter of the present invention, the detailed description will be omitted. In addition, terms to be described later are terms defined in consideration of functions in the embodiment of the present invention, which may vary according to the intention or custom of a user or operator. Therefore, the definition should be made based on the contents throughout this specification.

1 is a block diagram illustrating a block chain data distribution storage device according to an embodiment of the present invention.

Referring to FIG. 1, the blockchain data distribution storage device 100 includes a transmission/reception unit 110, a mode determination unit 120, a cluster unit 130, a transaction broker unit 140, and a data broker unit 150. can do.

In a blockchain network, blockchain data gradually increases over time due to continuously occurring transactions, and as a result, all nodes must store blockchain data, so some nodes need to have large amounts of blockchain data unnecessarily. There is a need.

According to an embodiment, the blockchain data distribution storage device 100 may determine a storage mode based on the capacity of blockchain data to be stored, and divides and copies the blockchain data to be stored according to the determined storage mode to each It can be stored in node. Here, the blockchain data to be stored may include transaction data, general data, company standard information data, and hash tables.

The transceiver 110 may receive block chain data from an external device or receive a request signal to store the block chain data using wired or wireless communication. In addition, the transceiver 110 may transmit blockchain data to be stored in the node using wired or wireless communication, and transmits a signal requesting agreement to the node where the blockchain data is stored for consensus of the blockchain data, or A request signal may be transmitted to transmit data for which an agreement has been completed to an external device. A method in which the transceiver 110 transmits or receives data using wired or wireless communication may use, for example, wired communication such as a data cable or a known wireless communication method such as Wi-Fi or NFC. However, the method of data communication by the transceiver 110 is not limited thereto.

2 is a block diagram illustrating a block chain data distribution storage system for distributed storage of block chain data according to an embodiment of the present invention.

Referring further to FIG. 2 , the blockchain data distribution storage system 10 may include a blockchain data distribution storage device 100, a client 200, and N (where N is a natural number).

When the client 200 requests storage of blockchain data, the blockchain data distribution storage device 100 stores at least one of the N peer nodes 300 to store the blockchain data based on the requested capacity of the blockchain data. A peer node of can be selected. In addition, the blockchain data distribution storage device 100 may request the peer node to distribute and store hash table data generated from the blockchain data as well as the requested blockchain data.

When the client 200 requests blockchain data, the blockchain data distribution storage device 100 distributes the blockchain data by using a hash table stored in the peer node for at least one peer node where the blockchain data is distributed and stored. Saved peer nodes can be searched. Subsequently, the blockchain data distribution storage device 100 may verify distributed and stored blockchain data from the searched peer node, request transmission of the verified blockchain data to the client 200, and block chain data distribution storage device 100 ) can be received from at least one peer node and transmitted directly.

The mode determining unit 120 may determine the storage mode according to the capacity of blockchain data requested for storage by the client 200, and at least one peer node corresponding to the determined storage mode among the N peer nodes 300 can be selected. Blockchain data may include at least one of first data, reference information data, and transaction data. Depending on the embodiment, the mode determination unit 120 may select at least one second data to be divided and stored in the peer node 300 from among the blockchain data based on the capacity of each of the blockchain data. According to one embodiment, the predetermined reference capacity may be 1 MB.

In contrast, when the capacity of each block chain data does not exceed the standard capacity, the mode determination unit 120 stores the block chain data in all peer nodes 300, which is a conventional storage method, without dividing and storing the block chain data. can also judge.

Here, the mode determined by the mode determining unit 120 may be determined as the first mode when all data among the blockchain data does not exceed the standard capacity, and if only the first data exceeds the standard capacity, It may be determined as the second mode, and when only the reference information data exceeds the standard capacity, it may be determined as the third mode, and when both the first data and the reference information data exceed the standard capacity, it may be determined as the fourth mode. can

Depending on the embodiment, even if the capacity of the transaction data or hash table exceeds the predetermined reference capacity in addition to the four modes determined by the mode determination unit 120, the transaction data or hash table is also divided by the predetermined reference capacity and the peer node ( 300).

3 shows the classification of peer nodes according to the capacity of data stored in a blockchain data distribution storage device according to an embodiment of the present invention.

Referring further to FIG. 3 , the peer node 300 may have four modes corresponding to (a) to (d) of FIG. 3 according to the type of data that can be stored. Here, the mode of the peer node 300 may vary depending on the service using the blockchain.

Referring further to (a) of FIG. 3 , the peer node 300 has a first mode corresponding to a transaction node capable of storing a transaction block, a state database (DB), and a data hash table (DHT). can If the mode determination unit 120 determines to store blockchain data in the first mode, which is the basic mode, based on the capacity of the blockchain data, the mode determination unit 120 determines the peer node 300 corresponding to the first mode. ) to store the corresponding blockchain data.

Here, the transaction block is blockchain data generated to record conventional external transactions, the state DB is data representing the latest state of the block, and DHT is the case where blockchain data is distributed and stored in the peer node 300 and blockchain data In case of searching for , the location of the peer node where the blockchain data is distributed is recorded. DHT, which stores the location where blockchain data is distributed and stored, can be stored in the node's in-memory DB for fast location inquiry.

Referring further to (b) of FIG. 3 , the peer node 300 may have a second mode corresponding to a large data node capable of storing a transaction block, a large file block, a state DB, and a DHT.

here. The large file block may be a blockchain block for data corresponding to the first data requested by the client 200 to be stored.

Referring further to (c) of FIG. 3 , the peer node 300 may have a third mode corresponding to a master data distribution node capable of storing a transaction block, state DB, master data, and DHT.

Here, the master data may correspond to standard information data of various companies. For example, if a logistic waybill is stored in a blockchain network, it can be stored in a mass data node, which is the third mode, and in SCM (Supply Chain Management), reference information of various companies is used as master data by peers corresponding to the third mode. It can be distributed and stored in the nodes 300.

Referring further to (d) of FIG. 3 , the peer node 300 may have a fourth mode corresponding to a full node capable of storing transaction blocks, large-capacity blocks, state DBs, master data, and DHT.

Here, all peer nodes 300 are implemented to store transaction blocks, large-capacity blocks, and master data, and can be selected according to the purpose of the service. In addition, the peer node 300 that provides storage space for blockchain data can select a mode according to the purpose of the storage service to be provided, and can be provided with differentiated incentives according to the mode. For example, when the peer node 300 corresponds to the fourth mode in which all data can be stored, more incentives may be provided than when corresponding to the first mode.

4 illustrates how peer nodes are configured as local clusters according to one embodiment of the present invention.

Referring further to FIG. 4 , the cluster unit 130 may configure at least one peer node in which blockchain data will be stored as a local cluster based on the mode determined by the mode determination unit 120. there is. In other words, the cluster unit 130 may configure a local cluster, which is a group of on-chain dynamic peer nodes, to store large-capacity or large-scale blockchain data.

Here, the local cluster configuration method of the cluster unit 130 may configure a local cluster in a state of a plurality of peer nodes 300 . The state of the plurality of peer nodes 300 may include the storage space of the plurality of peer nodes or the sum of routing distances between the plurality of peer nodes. That is, the cluster unit 130 may configure a local cluster, which is an optimal peer node group, based on the storage space remaining in the peer node 300 and the optimized routing distance.

The cluster unit 130 may determine the number of peer nodes based on the number of pieces of data divided by the mode determination unit 120 or the data broker unit 150 to be described later to form a local cluster. For example, the cluster unit 130 stores the divided blockchain data in an order in which the storage space of each of the plurality of peer nodes is equal to or greater than the reference capacity and the sum of routing distances is the smallest among the plurality of peer nodes. A plurality of peer nodes having the number of peer nodes to become can be selected.

For example, if peer node 1 (311) to peer node 12 (324) all correspond to the second mode, the blockchain data to be stored is determined to be the second mode, and the blockchain data is divided into two pieces of data, respectively. When copying and storing 4 pieces of data, the cluster unit 130 uses peer node 1 (311) and peer node 2 to store one of the divided data based on the available storage space and the optimized routing distance. 312 , peer node 5 313 , and peer node 6 314 may constitute a first local cluster 310 .

In addition, the cluster unit 130 removes peer node 7 (321), peer node 8 (322), peer node 11 (323), and peer node 12 (324) to store the other one of the divided data. It can be composed of 2 local clusters (320).

In addition, the cluster unit 130 monitors the state of the peer node 300 to maintain the minimum number of peer nodes required for storing blockchain data, and when there is a peer node that is not connected among peer nodes included in the local cluster, , can dynamically configure a new local cluster containing other storable peer nodes.

The transaction broker unit 140 may process transactions through a conventional Dapp server. A Dapp is an application whose backend code runs on a decentralized peer-to-peer network (or calls and registers data to a blockchain database) and provides it as an interface on the frontend.

In addition, the transaction broker unit 140 performs a transaction using the trx and signature submitted by the client 200, the blockchain data hash, the data merkle tree generated by the data broker unit 150 to be described later, and the signature of the trx broker. can handle

The data broker unit 150 may divide and distribute the blockchain data obtained from the transmission/reception unit 110, generate a kerkle tree, and perform a consistent hash operation. The transaction processing process performed by the transaction broker unit 140 and the data broker process performed by the data broker unit 150 may be performed simultaneously, and each process of the transaction broker unit 140 and the data broker unit 150 If all ends without error, verification is optimally completed and can be committed to the ledger.

5 is a block diagram illustrating the function of a data broker unit according to an embodiment of the present invention.

Referring further to FIG. 5 , the data broker 150 may include a data partitioning unit 151, a Merkle tree generating unit 152, and a consistent hashing unit 153.

The data broker unit 150 receives large-capacity blockchain data from the transaction broker unit 140, encrypts and de-identifies the blockchain data, divides it, and creates a hash table containing peer node information for storing the segmented data. Thus, it can be stored in each peer node determined by the mode determination unit 120.

The data division unit 151 may divide blockchain data into a plurality of data having a predetermined reference capacity. Here, the predetermined reference capacitance may be the reference capacitance used by the mode determining unit 120 to determine each mode. When the storage capacity of blockchain data requested by the client 200 exceeds the standard capacity, the data division unit 151 may divide the blockchain data into units of standard capacity.

For example, if the capacity of the blockchain data requested by the client 200 for storage is 2.1MB and the reference capacity is 1MB, the data partitioning unit 151 divides the blockchain data into 1MB units to generate two pieces of divided data. , and one segmented data can be created with the remaining 0.1MB. Subsequently, the three pieces of divided data may be stored in peer nodes included in the local cluster determined by the operations performed by the data broker and the transaction broker.

The Merkle tree generation unit 152 may calculate a hash value of the divided blockchain data using a hash function for a plurality of peer nodes and the divided blockchain data, and generate a Merkle tree with the calculated hash value. .

In addition, the Merkle tree generation unit 152 adds a checksum to the blockchain data divided by the data segmentation unit 151 to verify the integrity of the divided blockchain data in the future, and uses it to construct a Merkle tree structure. You can verify the split data in .

Here, the Merkle tree is a data structure that summarizes all blockchain data information included in one block in the blockchain and expresses it in the form of a tree. Also, the Merkle tree generation unit 152 may generate a Merkle tree using a multi-patricia tree (MPT). Since a method of generating a Merkle tree is a known technology, a detailed description thereof will be omitted.

The consistent hashing unit 153 may perform a consistent hash based on the divided blockchain data and the signature of the data broker.

Here, the consistent hash is constructed by hashing the divided blockchain data, and by using the merkle tree and hashed data generated by the merkle tree generation unit 152 by the cluster unit 130 using a mod function, etc. It refers to the process of creating a hash table where each peer node of the local cluster is placed and storing the created hash table in the peer node.

Depending on the embodiment, the hash table may be stored in all peer nodes 300 or in the first peer node of the local cluster.

Here, in the hash table, a hash value of the divided blockchain data is calculated by using a hash function for a plurality of peer nodes and the divided blockchain data, and a Merkle tree is generated with the calculated hash value, It may be generated as a hash value of the generated Merkle tree and the third data. Also, for fast location tracking of divided data, the hash table may be stored in an in-memory database of a first peer node of a local cluster.

6 is a block diagram for explaining a block chain data distribution storage device in terms of hardware.

1 and 6, the blockchain data distribution storage device 100 includes a storage device 161 for storing at least one command and a processor 162 for executing at least one command of the storage device 161. , a transmitting/receiving device 163, an input interface device 164, and an output interface device 165.

Each of the components 161, 162, 163, 164, and 165 included in the blockchain data distribution storage device 100 are connected by a data bus 166 to communicate with each other.

The storage device 161 may include at least one of a memory or a volatile storage medium and a non-volatile storage medium. For example, the storage device 161 may include at least one of read only memory (ROM) and random access memory (RAM).

The storage device 161 may further include at least one command to be executed by the processor 162 to be described later, and may store information about the reference capacity input from the user through the input interface device 164, a hashing function, and the like. .

The processor 162 may be a central processing unit (CPU), a graphics processing unit (GPU), a micro controller unit (MCU), or a dedicated processor on which methods according to embodiments of the present invention are performed. can mean

As described above, the processor 162 operates the mode determination unit 120, the cluster unit 130, the transaction broker unit 140, and the data broker unit 150 by at least one program command stored in the storage device 161. It can perform the functions of, and each of them can be stored in a memory in the form of at least one module and executed by a processor.

The transceiver 163 may receive or transmit data from an internal device or an external device connected through communication, and may perform the functions of the transceiver 110 .

The input interface device 164 may receive at least one control signal or set value from a user. For example, the input interface device 164 may receive user input, such as information about a reference capacity for dividing blockchain data and a hash function.

The output interface device 165 may output and visualize at least one piece of information including the location of a peer node where blockchain data is stored by an operation of the processor 162 .

In the above, the blockchain data distribution storage device 100 according to an embodiment of the present invention has been described. Hereinafter, a block chain data distribution storage method executed by a processor operation in the block chain data distribution storage device 100 according to another aspect of the present invention will be described.

7 is a flowchart of a block chain data distribution storage method according to another aspect of the present invention.

Referring further to FIG. 7, first, the processor 162 divides and stores at least one block chain data among the block chain data based on the capacity of each block chain data including at least one of the first data and the reference information data. Can be selected as the second data of (S100).

Subsequently, the processor 162 may divide the second data to generate a plurality of third data each having a predetermined reference capacity (S200).

Also, the processor 162 may select at least one first peer node from among the plurality of peer nodes based on the states of the plurality of peer nodes and the plurality of third data (S300).

The processor 162 may copy each of the generated third data based on the number of the plurality of first peer nodes and store them in the selected plurality of first peer nodes (S400).

Combinations of each block of the block diagram and each step of the flowchart accompanying the present invention may be performed by computer program instructions. Since these computer program instructions may be loaded into an encoding processor of a general-purpose computer, special-purpose computer, or other programmable data processing equipment, the instructions executed by the encoding processor of the computer or other programmable data processing equipment are each block or block diagram of the block diagram. Each step in the flow chart creates means for performing the functions described. These computer program instructions may also be stored in a computer usable or computer readable memory that can be directed to a computer or other programmable data processing equipment to implement functionality in a particular way, such that the computer usable or computer readable memory It is also possible for the instructions stored in to produce an article of manufacture containing instruction means for performing the function described in each block of the block diagram or each step of the flow chart. The computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operational steps are performed on the computer or other programmable data processing equipment to create a computer-executed process to generate computer or other programmable data processing equipment. It is also possible that the instructions performing the processing equipment provide steps for executing the functions described in each block of the block diagram and each step of the flowchart.

Additionally, each block or each step may represent a module, segment or portion of code that includes one or more executable instructions for executing specified logical function(s). It should also be noted that in some alternative embodiments, it is possible for the functions recited in blocks or steps to occur out of order. For example, two blocks or steps shown in succession may in fact be performed substantially concurrently, or the blocks or steps may sometimes be performed in reverse order depending on their function.

The above description is merely an example of the technical idea of the present invention, and various modifications and variations can be made to those skilled in the art without departing from the essential qualities of the present invention. Therefore, the embodiments disclosed in the present invention are not intended to limit the technical idea of the present invention, but to explain, and the scope of the technical idea of the present invention is not limited by these embodiments. The protection scope of the present invention should be construed according to the claims below, and all technical ideas within the scope equivalent thereto should be construed as being included in the scope of the present invention.

10: Blockchain data distributed storage system
100: Blockchain data distributed storage device
200: client
300: peer node
150: data broker

Claims (11)

The blockchain data distributed storage method performed by the blockchain data distributed storage device,
Based on the capacity of each of the block chain data including at least one of the first data and the reference information data, selecting block chain data that is divided and stored among the block chain data as at least one second data;
dividing the second data to generate a plurality of third data each having a predetermined reference capacity;
selecting at least one first peer node from among the plurality of peer nodes based on states of a plurality of peer nodes and the plurality of third data; and
Copying each of the generated third data based on the number of the at least one first peer node and storing the generated third data in the selected at least one first peer node.
Blockchain data distributed storage method. According to claim 1,
In the step of selecting the second data,
selecting the first data as the second data when the first data exceeds the reference capacity and the reference information data is equal to or less than the reference capacity;
Generating the third data,
Generating each data divided by the unit of the reference capacity and residual data remaining after dividing the second data by the unit of the reference capacity as third data,
Blockchain data distributed storage method. According to claim 1,
In the step of selecting the second data,
selecting the first data and the reference information data as second data when the first data exceeds the reference capacity and the reference information data is equal to or less than the reference capacity;
Generating the third data,
Generating each data divided by the unit of the reference capacity and residual data remaining after dividing the second data by the unit of the reference capacity as third data,
Blockchain data distributed storage method. According to claim 1,
In the step of selecting the second data,
selecting the first data and the reference information data as second data when each of the first data and the reference information data exceeds the reference capacity;
Generating the third data,
Generating each data divided by the unit of the reference capacity and residual data remaining after dividing the second data by the unit of the reference capacity as third data,
Blockchain data distributed storage method. According to claim 1,
The state of the plurality of peer nodes is
Includes a storage space of the plurality of peer nodes or a sum of routing distances between the plurality of peer nodes;
The step of selecting at least one first peer node,
selecting the number of peer nodes required to agree on the third data as the number of the first peer nodes; and
at least one first peer node having a storage space of each of the at least one peer node equal to or greater than the reference capacity, and having the number of the first peer nodes in order of smallest sum of routing distances among the at least one peer node; including the step of selecting
Blockchain data distributed storage method. According to claim 1,
The blockchain data distributed storage method
generating a hash table based on the generated plurality of third data and the at least one first peer node; and
Storing the generated hash table in the at least one first peer node
Blockchain data distributed storage method. According to claim 6,
The hash table is
stored in the in-memory database of the at least one first peer node,
Blockchain data distributed storage method. According to claim 6,
The step of generating the hash table is,
calculating a hash value of the third data by using a hash function of the at least one first peer node and the third data;
generating a Merkle tree with the calculated hash value; and
Further comprising generating a hash table with the generated Merkle tree and the hashing value of the third data.
Blockchain data distributed storage method. Transmitting and receiving unit for obtaining blockchain data including at least one of the first data and reference information data; and
Based on the capacity of each block-chain data including at least one of the obtained first data and reference information data, block-chain data that is divided and stored among the block-chain data is selected as at least one second data, and 2 Data is divided to generate a plurality of third data each having a predetermined reference capacity, and at least one of the plurality of peer nodes is generated based on the state of a plurality of peer nodes and the plurality of third data. and a control unit for selecting a first peer node, copying each of the generated third data based on the number of the at least one first peer node, and controlling the storage in the selected at least one first peer node. doing
Blockchain data distributed storage device. As a computer program stored in a computer readable recording medium,
The computer program,
Includes instructions for causing a processor to perform a blockchain data distribution storage method performed by a blockchain data distribution storage device,
The method,
Based on the capacity of each of the block chain data including at least one of the first data and the reference information data, selecting block chain data that is divided and stored among the block chain data as at least one second data;
dividing the second data to generate a plurality of third data each having a predetermined reference capacity;
selecting at least one first peer node from among the plurality of peer nodes based on states of a plurality of peer nodes and the plurality of third data; and
Copying each of the generated third data based on the number of the at least one first peer node and storing the generated third data in the selected at least one first peer node.
computer program. A computer-readable recording medium storing a computer program,
The computer program,
Includes instructions for causing a processor to perform a blockchain data distribution storage method performed by a blockchain data distribution storage device,
The method,
Based on the capacity of each of the block chain data including at least one of the first data and the reference information data, selecting block chain data that is divided and stored among the block chain data as at least one second data;
dividing the second data to generate a plurality of third data each having a predetermined reference capacity;
selecting at least one first peer node from among the plurality of peer nodes based on states of a plurality of peer nodes and the plurality of third data; and
Copying each of the generated third data based on the number of the at least one first peer node and storing the generated third data in the selected at least one first peer node.
A computer-readable recording medium.

Images