KR20200096045A - Blockchin generation apparatus, method for sharding blockchain thereof, and system the same - Google Patents

Abstract

The present invention is to provide a method for sharding a blockchain in which a subject of a distributed consensus of a specific block height of a specific shard cannot be predicted and an apparatus thereof. According to the present invention, a method of sharding a blockchain of a blockchain generation apparatus may comprise the steps of: getting a nonce value from a nonce chain at a node; allocating the node to a random shard using the nonce value; and selecting a consensus node in order to select a consensus subject for the allocated shard.

Description

Blockchain generation device, a method of sharding its blockchain, and a system including it {BLOCKCHIN GENERATION APPARATUS, METHOD FOR SHARDING BLOCKCHAIN THEREOF, AND SYSTEM THE SAME}

The present invention relates to an apparatus for generating a block chain, a method for sharding a block chain thereof, and a system including the same.

In general, blockchain has advantages such as transparency and security, but it is not easily applied to existing services due to limitations in data processing performance. In order to solve this problem, a sharding technology that processes blockchain in parallel is drawing attention. Basically, sharding is a method of distributing and retrieving data in a physically different database in a horizontal partitioning method. In order to increase the scalability of the blockchain, the blockchain sharding technology horizontally divides the blockchain network into shards, and the distributed consensus subject of each shard divides and processes data, enabling parallel processing. As a result, if the number of distributed consensus nodes participating in the blockchain increases, the performance of the blockchain can be improved by increasing the number of shards.

Korean Patent Publication: 10-2018-0113145, Publication date: October 15, 2018, Title: Blockchain-based real-time transaction processing method and system thereof. US Patent Publication: US 2018-351732, Publication Date: December 6, 2018, Title: EHANCING PROCESSING EFFICIENCY OF BLOCKCHAIN TECHONOGIES USING PAPALLEL SERVICE DATA PROCESSING.

An object of the present invention is to provide a method and apparatus for sharding a block chain in which the subject of a distributed consensus of a specific block height of a specific shard cannot be predicted.

It is an object of the present invention to provide a method and apparatus for sharding a blockchain in which a specific node is not continuously selected as the subject of distributed consensus of the same shard.

It is an object of the present invention to provide a method and apparatus for sharding a blockchain that does not have an additional consensus process in order to continuously select a specific node as a distributed consensus subject of an arbitrary shard.

An object of the present invention is to provide a method and apparatus for sharding a blockchain in which the minimum number of nodes required for distributed agreement in each shard can obtain the qualification.

An object of the present invention is to provide a method and apparatus for sharding a blockchain capable of obtaining a distributed consensus qualification regardless of the computational capability of a node.

The technical problems of the present invention are not limited to the technical problems mentioned above, and other technical problems that are not mentioned will be clearly understood by those skilled in the art from the following description.

A method of sharding a block chain of an apparatus for generating a block chain according to an embodiment of the present invention includes: obtaining a nonce value from a nonce chain at a node; Allocating the node to a random shard by using the nonce value; And selecting a consensus node to select a consensus subject for the allocated shard.

In an embodiment, the nonce chain is generated by repeatedly hashing a unique value.

In an embodiment, the node is characterized in that the last hash value of the nonce chain is disclosed to other nodes.

In an embodiment, when publishing the last hash value, the node simultaneously discloses a block number from which to use the nonce chain to the other nodes.

In an embodiment, the step of allocating the random shard may include dividing the nonce value by the number of shards; And allocating the node to the random shard by using the remaining value according to the result of the division.

In an embodiment, the nonce value of the node is changed for each block height of the block chain.

In an embodiment, the selecting of the consensus node may further include selecting a consensus node of a next block based on information of a previous block.

In an embodiment, the step of selecting the consensus node may further include performing an operation for confirming whether to select the consensus node of the allocated shard.

In an embodiment, the node is characterized in that the number of times of the operation is limited in order to qualify for distributed agreement regardless of the operation capability.

In an embodiment, the number of consensus nodes of the allocated shard is the number of nodes that can participate in consensus (n), the minimum number of nodes required for consensus (x), and a probability value at which less than the number of the minimum nodes is selected. It is characterized by being determined by (k).

Blockchain system according to an embodiment of the present invention, participation nodes; A first shard having a first block chain of a first height; And a second shard having a second block chain having the first height, wherein each of the participating nodes is assigned to the first shard and the second shard according to a nonce value read from a nonce chain, , It is characterized in that it is selected as a consensus node of the allocated shard according to the nonce value.

In an embodiment, each of the participating nodes discloses a starting height using a nonce value corresponding to a last nonce value of the nonce chain to other nodes.

In an embodiment, each of the other nodes verifies a nonce value to be used by each of the participating nodes by using the last nonce value.

In an embodiment, each of the participating nodes is assigned to one of the first shard and the second shard according to each block height.

In an embodiment, each of the participating nodes knows the shard assigned to the block height using the nonce value.

상기 난스 체인으로부터 얻은 난스 값(

)과 상기 배정받은 샤드의 이전 블록의 해시 값(

)을 해쉬한 값 쿠폰 값(coupon)이 난이도(

)보다 작은 지에 따라 합의 노드 선정 여부를 알아내는 것을 특징으로 한다.In an embodiment, each of the participating nodes, as shown in the following equation,

The nonce value obtained from the above nonce chain (

) And the hash value of the previous block of the allocated shard (

) Is hashed, and the coupon value is the difficulty level (

It is characterized by determining whether to select a consensus node according to whether it is smaller than ).

)는 상기 참여 노드의 개수(n), 각 샤드에서 합의에 필요한 최소 노드의 개수(x), 합의에 필요한 최소 노드의 개수 이하로 선택될 확률(k)에 의해 계산되는 것을 특징으로 한다.In an embodiment, the difficulty level (

) Is calculated by the number of participating nodes (n), the minimum number of nodes required for consensus in each shard (x), and the probability (k) of being selected less than the minimum number of nodes required for consensus.

Block chain generation apparatus according to an embodiment of the present invention, at least one processor; And a memory for storing at least one instruction executed by the at least one processor, wherein the at least one instruction reads a nonce value from a nonce chain; Allocating the block chain generating device to a random shard using the nonce value; And executing an operation for selecting a consensus node of the allocated shards in the at least one processor.

In an embodiment, the nonce chain is generated by hashing a random value of the block chain generating device a plurality of times.

In an embodiment, the assigned shard is assigned based on the nonce value by a predetermined calculation method.

In the method and apparatus for sharding a block chain according to an embodiment of the present invention, it is impossible for a malicious node to predict and attack the consensus subject node because it is not possible to predict the subject of distributed consensus of a specific block height of a specific shard.

In the method and apparatus for sharding a block chain according to an embodiment of the present invention, it is impossible for a malicious node to continuously attack a corresponding shard because a specific node is not continuously selected as the subject of distributed consensus of the same shard.

The method and apparatus for sharding a block chain according to an embodiment of the present invention do not have an additional consensus process in order to continuously select a specific node as a distributed consensus subject of another shard, so there is no computation and communication cost for this.

In the method and apparatus for sharding a block chain according to an embodiment of the present invention, a minimum number of nodes required for distributed consensus for each shard can obtain distributed consensus qualification, thereby enabling rapid consensus among nodes participating in the distributed consensus.

In the method and apparatus for sharding a block chain according to an embodiment of the present invention, since a node can obtain a distributed consensus qualification regardless of its computing power, some nodes that have secured strong computing power cannot monopolize the distributed consensus qualification.

The accompanying drawings are provided to help understanding of the present embodiment, and provide embodiments together with a detailed description. However, the technical features of the present embodiment are not limited to a specific drawing, and features disclosed in each drawing may be combined with each other to constitute a new embodiment.
1 is a diagram conceptually showing a method of sharding a general blockchain.
2 is a diagram illustrating a block chain platform that provides a general sharding processing method as an example.
3 is a diagram for conceptually explaining a method of sharding a block chain according to an embodiment of the present invention.
FIG. 4 is a diagram illustrating an attacker's distributed consensus subject prediction scenario in a block chain sharding method according to an embodiment of the present invention.
5 is a diagram illustrating an attack scenario of an attacker consensus node in a block chain sharding method according to an embodiment of the present invention.
6 is a diagram conceptually showing the effect of selecting a consensus node in a block chain sharding method according to an embodiment of the present invention.
7 is a diagram for explaining a nonce chain used when each node receives a shard and determines whether to select a consensus subject.
8 is a diagram for explaining a process in which a node is allocated to one shard for each block height.
9 is a diagram for explaining a process in which a node is selected as a consensus subject for each block height.
10 is a diagram illustrating a method of determining a difficulty according to an embodiment of the present invention.
11 is a flowchart illustrating a method of sharding a block chain according to an embodiment of the present invention.
12 is a diagram illustrating an apparatus 1000 for generating a block chain according to an embodiment of the present invention.

In the following, the contents of the present invention will be described clearly and in detail so that those skilled in the art of the present invention can easily implement the drawings using the drawings.

The present invention can be applied to various changes and may have various forms, and specific embodiments will be illustrated in the drawings and described in detail in the text. However, this is not intended to limit the present invention to specific disclosure forms, and it should be understood that all modifications, equivalents, and substitutes included in the spirit and scope of the present invention are included. Terms such as first and second may be used to describe various elements, but the elements should not be limited by the terms. The terms may be used for the purpose of distinguishing one component from other components. For example, the first component may be referred to as the second component without departing from the scope of the present invention, and similarly, the second component may also be referred to as the first component. When an element is said to be "connected" or "connected" to another component, it is understood that other components may be directly connected to or connected to the other component, but other components may exist in the middle. It should be. On the other hand, when a component is referred to as being "directly connected" or "directly connected" to another component, it should be understood that there is no other component in the middle.

Terms used in the present application are only used to describe specific embodiments, and are not intended to limit the present invention. Singular expressions include plural expressions unless the context clearly indicates otherwise. In this application, the terms "include" or "have" are intended to indicate the existence of a feature, number, step, action, component, part or combination thereof carried out, one or more other features or numbers. It should be understood that it does not preclude the existence or addition possibilities of, steps, actions, components, parts or combinations thereof. Unless otherwise defined, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which the present invention belongs. Terms as defined in a commonly used dictionary should be interpreted as having a meaning consistent with the meaning in the context of the related technology, and should not be interpreted as an ideal or excessively formal meaning unless explicitly defined in this application. .

The block chain device and method thereof according to an embodiment of the present invention can shard (horizontally divide) the block chain by random nodes in order to secure high-performance data processing.

1 is a diagram conceptually showing a method of sharding a general blockchain. Referring to FIG. 1, in order to process the blockchain in parallel, the main chain may be converted into a plurality of shards (SHARD 0, SHARD 1, ??, SHARD N, N are integers of 2 or more).

Each of the plurality of shards (SHARD 0, ..., SHARD N) may generate a block by an assigned Distributed Consensus subject.

2 is a diagram illustrating a block chain platform that provides a general sharding processing method as an example. Referring to FIG. 2, a method of parallel processing a blockchain for high-performance data processing in a blockchain platform is as follows.

First, the DS Committee (Directory Service Committee) decides the subject of variance agreement. The DS committee is formed through the DS blockchain. The last n nodes that succeeded in connecting blocks to the DS blockchain become DS NODEs.

On the other hand, the DS blockchain adds a new block with a PoW (Proof of Work) proof-of-work method. Therefore, the DS committee is fixed until a node completes the next PoW Proof of Work. At this time, the node that became the last DS member is the DS Leader node.

The DS leader node is responsible for allocating distributed consensus nodes to each shard, proposing this to the DS committee, and obtaining consent. In order to be selected as the consensus subject from the DS leader node, it is necessary to pass the PoW proof of work with the current DS committee composition as input. The DS leader node sorts the m distributed consensus nodes that have passed the proof-of-work according to the nonce value submitted by each distributed consensus node, allocates one shard as the subject of the distributed consensus, and obtains the consent of the DS committee. The subject of the dispersion sum of each shard is determined in the manner described above.

The distributed consensus subject of each shard processes data in parallel, providing a blockchain system capable of high-performance data processing. However, this parallel processing method has the following problems. First, since the subject of the distributed consensus of each shard is fixed for a certain period of time, a malicious node can predict and attack the consensus node. Second, the cost is high because the DS committee's consent procedure is additionally required to change the distributed consensus subject of each shard to prevent malicious node attacks. Third, the higher the computing power of a node, the higher the probability of joining the DS committee and becoming the subject of the variance sum, so some nodes with strong computing power can monopolize the variance consensus qualification.

The method and apparatus for sharding a block chain according to an embodiment of the present invention may provide a block chain horizontal division (shard) by a random node in order to solve the above-described problems.

3 is a diagram for conceptually explaining a method of sharding a block chain according to an embodiment of the present invention. Referring to FIG. 3, data is processed in parallel in two shards (SHARD 0 and SHARD 1) for high-performance data processing. A total of 8 nodes are participating in the blockchain network. If parallel processing is not performed, all 8 nodes can participate in the consensus process to generate one block. As shown in FIG. 3, when data is divided into two shards (SHARD 0 and SHARD 1) and processed, two blocks may be simultaneously generated.

In FIG. 3, nodes selected as consensus subjects only for blocks 2 and 4 are displayed. For example, nodes selected as consensus subjects for block 2 of the first shard (SHARD 0) are N1, N2, N3, and N4, and are selected as consensus subjects for block 2 of the second shard (SHARD 1). The nodes are N5, N6, N7, N8. As described above, the eight nodes N1 to N8 are divided into two shards SHARD 0 and SHARD 1 to process data in parallel, thereby providing high-performance data processing based on a blockchain.

On the other hand, the first node (N1) participates in data processing as the consensus subject of the first shard (SHARD 0) for block 2, and the consensus subject of the second shard (SHARD 1) for block 4 You can participate. This is to secure parallel processing by continuously changing the consensus subject of a specific shard. For example, even if there is a malicious node that attempts to attack the first shard (SHARD 0), the corresponding node cannot be continuously assigned to the first shard (SHARD 0).

FIG. 4 is a diagram illustrating an attacker's distributed consensus subject prediction scenario in a block chain sharding method according to an embodiment of the present invention. 4, the block chain sharding method according to an embodiment of the present invention changes the consensus subject of a specific shard, thereby distributing the consensus subject of a specific block height of the first shard (SHARD 0) and the second shard (SHARD 1). Is impossible to predict. Therefore, malicious nodes cannot predict and attack the subject of distributed consensus.

5 is a diagram illustrating an attack scenario of an attacker consensus node in a block chain sharding method according to an embodiment of the present invention. Referring to FIG. 5, since a specific node is continuously selected as the subject of distributed consensus of other shards, a malicious node cannot continuously attack the same shard.

6 is a diagram conceptually showing the effect of selecting a consensus node in a block chain sharding method according to an embodiment of the present invention. The method of sharding a block chain according to an embodiment of the present invention does not require an additional consensus process so that the consensus subject is unpredictable for each block. Therefore, no additional computation and communication costs are incurred.

In addition, the shard (SHARD 0, SHARD 1) can acquire the qualification for distributed consensus with the minimum number of nodes irrelevant to the computational capability. This prevents the monopoly of distributed consensus qualifications based on strong computational power, and enables fast consensus among the minimum number of nodes.

On the other hand, it should be understood that the number of shards, the number of nodes, and the number of consensus subjects to agree on one block are not limited to a specific value.

In the method and apparatus for sharding a block chain according to an embodiment of the present invention, a nonce value that cannot be predicted by another node is obtained from a nonce chain, a node is assigned to a random shard, and the minimum node in each shard is a consensus subject. Can be selected as

7 is a diagram for explaining a nonce chain used when each node receives a shard and determines whether to select a consensus subject. Referring to FIG. 7, a node first creates a nonce chain to be selected as a consensus subject, and discloses a start height and a last nonce to other nodes. Here, start height is the height of the block to start using the nonce chain. The last nonce is a value to verify the nonce value that the node will use in the future.

In an embodiment, the nonce chain may be generated by hashing an arbitrary nonce multiple times. Here, the arbitrary nonce may be the private key of the node.

)을 얻을 수 있다.For example, a nonce value that can be used in a block in which the first node N1 shown in FIG. 7 has a height of 1 is 0xe1. The nonoce value of the first node N1 cannot be predicted by other nodes. However, if the first node N1 discloses the nonce value, the other node can verify whether the nonce value is obtained from the nonce chain registered in advance by using the last nonce. In other words, using a nonce chain, each node has a nonce value that other nodes cannot predict for a specific height h (

) Can be obtained.

8 is a diagram for explaining a process in which a node is allocated to one shard for each block height. Referring to FIG. 8, the first node N1 is allocated in the order of a first shard (SHARD 0), a second shard (SHARD 1), and a first shard (SHARD 0) for block heights 1, 2, and 3 I can.

The first node N1 discloses the nonce chain, and can find out the assigned shard using the following equation for each block height.

Here, N _s is the number of shards.

값을 이용해서 높이 h에 대해 배정받은 샤드를 알아 낼 수 있다.According to Equation 1, each node is obtained from a nonce chain.

You can use the value to find out the shard assigned for height h.

The first node N1 has 0xe1 as a nonce value for height 1. When the number of shards is 2, the first node N1 may be assigned to the first shard SHARD 0 according to Equation 1.

Meanwhile, in Equation 1, a simple residual operation was used to map the nonce value of a node to an arbitrary shard. However, it should be understood that the shard mapping of the present invention is not limited thereto.

값은 블록의 높이에 따라 계속 달라지기 때문에 노드는 계속해서 임의의 샤드에 배정 될 수 있다.Meanwhile, of which node

Nodes can continue to be assigned to arbitrary shards because the value keeps changing with the height of the block.

Meanwhile, in Equation 1, the value of N _s may be shared through communication between nodes or managed by recording the value of N _{s in} a block. However, it should be understood that the present invention is not limited thereto.

9 is a diagram for explaining a process in which a node is selected as a consensus subject for each block height. Referring to FIG. 9, the consensus subject selection may operate based on an unpredictable variance consensus subject selection method.

The first node (N1) is selected as the consensus subject of the first shard (SHARD 0) for block height 1, cannot be selected as the consensus subject for block height 2, and the second shard (SHARD 1) for block height 3 Can be selected as the consensus subject of

After the first node N1 discloses the nonce chain and finds out the assigned shard as shown in FIG. 8, it can determine whether or not the subject of the distributed sum is selected using the following equation.

값과 배정받은 샤드의 이전 블록의 해시 값(

)을 이용해서 분산합의 주체 선정 여부를 알아 낼 수 있다. 한편, 수학식 2에서

가 특정 해시 함수로 제한되지 않는다고 이해되어야 할 것이다. 또한, 수학식 2에서

을 연산한 값은 coupon값이다. 여기서 난이도(

)는 coupon의 기준이 된다.According to Equation 2, each node is obtained from a nonce chain.

The value and the hash value of the previous block of the assigned shard (

) Can be used to find out whether the subject of the variance agreement is selected. Meanwhile, in Equation 2

It should be understood that is not limited to a specific hash function. Also, in Equation 2

The calculated value of is the coupon value. Here the difficulty (

) Is the standard of the coupon.

)에 대하여 모든 노드는 이전 블록이 결정될 때까지 분산합의 주체 선정 여부를 예측할 수 있다.In an embodiment, the hash value of the previous block (

), all nodes can predict whether or not to select the subject of variance until the previous block is determined.

값은 다음과 같은 특징을 갖게 한다. 연산 능력을 이용해서 nonce 값을 바꾸어 가면서 분산 합의 주체가 될 확률은 높일 수 없다. 다른 노드의 nonce 값을 알 수 없음으로, 다른 노드의 합의 주체 선정 여부를 알 수 없다. 다른 노드가 nonce 값을 공개하면, 해당 노드가 공개한 nonce chain을 기반으로 합의 주체 선정 여부를 검증할 수 있다.In an embodiment, obtained from the nonce chain

The value has the following characteristics. It is not possible to increase the probability of becoming the subject of the variance sum by changing the nonce value using computational power. Since the nonce value of other nodes is unknown, it is not possible to know whether or not the consensus subject of other nodes is selected. When another node discloses the nonce value, it can be verified whether the consensus subject is selected based on the nonce chain disclosed by the node.

)는 분산합의에 필요한 최소한의 노드만 분산합의 자격을 얻도록 모든 노드가 높이 h에 대해 사용하는 동일한 값일 수 있다.On the other hand, in Equation 2, the difficulty (

) Can be the same value that all nodes use for height h so that only the minimum number of nodes required for distributed consensus qualify for distributed consensus.

)를 계산될 수 있다.On the other hand, when n is the number of nodes that can participate in consensus, the minimum number of nodes required for consensus of each shard is x, and k is the probability value that less than the minimum number of nodes required for consensus is selected, these three variables ( The difficulty of controlling the number of subjects in the consensus using n, x, k) (

) Can be calculated.

) 값을 조정함으로써 분산 합의에 필요한 최소한의 노드만 분산 합의 자격이 부여될 수 있다.In the embodiment, the difficulty (

), only the minimum number of nodes required for distributed consensus can be eligible for distributed consensus.

Meanwhile, the number of distributed consensus nodes can be represented by a normal distribution (n,p).

10 is a diagram illustrating a method of determining a difficulty according to an embodiment of the present invention. Referring to FIG. 10, n is the number of nodes to which the nonce chain is disclosed, and p is difficulty/max_difficulty. The difficulty level (difficulty) can be determined such that the minimum number of nodes (x) of nodes required for distributed consensus yields a specific probability.

11 is a flowchart illustrating a method of sharding a block chain according to an embodiment of the present invention. 3 to 11, a method of sharding a block chain may proceed as follows.

A node (eg, N1) may obtain a nonce value that is not predictable by another node from the nonce chain (S110). A node may be assigned to an arbitrary shard using the nonce value (S120). A minimum node may be selected as a consensus subject to a corresponding shard from the assigned node (S130).

In an embodiment, the nonce chain may be a hash chain created by repeatedly hashing an arbitrary nonce value. In an embodiment, the node may disclose the last nonce of the hash chain to other nodes, and use the previous nonce value sequentially.

In an embodiment, the nonce value used by the node cannot be predicted by other nodes due to the anti-phase resistance characteristic of the hash. However, when the nonce value is disclosed, it is possible to easily verify whether it is a nonce value obtained from the nonce chain that disclosed the last nonce with a simple operation.

In an embodiment, when the last nonce value is disclosed, the block number (start height) to start using the nonce chain is disclosed together, and one nonce value may be consumed for each block height.

In an embodiment, in order to unpredictably allocate each node to a random shard for each block height, each node may be assigned to a shard using a nonce value obtained from a nonce chain.

In an embodiment, a nonce value may be divided by the number of shards, and a node may be assigned to a shard using the remaining value.

In an embodiment, as the nonce value of the node changes for each block height, a specific node may be continuously assigned to a random shard without additional computation or communication.

In an embodiment, even if the node itself can predict the shard to be allocated in advance, in order not to know in advance whether the consensus subject is selected in the shard, the consensus subject of the next block is It cannot be predicted. For this, the consensus subject of the next block may be selected based on the information of the previous block.

In an embodiment, a computational opportunity for confirming whether to select a consensus subject may be limited so as to grant a distributed consensus qualification regardless of the computational capability of a node. For this, only the nonce value obtained from the nonce chain can be used.

In an embodiment, when the number of nodes that can participate in consensus is n, the minimum number of nodes required for consensus of each shard is x, and the probability value that less than the minimum number of nodes required for consensus is selected is k, these three variables (n The number of consensus subjects can be controlled through, x, k).

12 is a diagram illustrating an apparatus 1000 for generating a block chain according to an embodiment of the present invention. Referring to FIG. 12, the block chain generating apparatus 1000 may include at least one processor 1100, a network interface 1200, a memory 1300, a display 1400, and an input/output device 1500.

The processor 1100 may include at least one device through FIGS. 3 to 11, or may be implemented by at least one method described above through FIGS. 3 to 11. The processor 1100 reads a nonce value from a nonce chain, as described above, and assigns the block chain generating device 1000 to a random shard by using the nonce value; And it is possible to execute instructions (instructions) to perform an operation for selecting a consensus node of the assigned shard.

The processor 1100 may execute a program and control the block chain generating device 1000. The generation device 1000 is connected to an external device (eg, a personal computer or a network) through the input/output device 1500 and may exchange data. The block chain generation device 1000 is a mobile phone, a smart phone, a PDA, a tablet computer, a mobile device such as a laptop computer, a computing device such as a personal computer, a tablet computer, and a netbook, or an electronic device such as a television, a smart television, and a security device for gate control. It may include various electronic systems such as products.

The network interface 1200 may be implemented to perform communication with an external network through various wired/wireless methods.

The memory 1300 may include instructions that can be read by a computer. The processor 1100 may perform the aforementioned operations as instructions stored in the memory 1300 are executed by the processor 1100. The memory 1300 may be a volatile memory or a nonvolatile memory. The memory 1300 may include a storage device to store user data. The storage device may be an embedded multimedia card (eMMC), a solid state drive (SSD), a universal flash storage (UFS), or the like. The storage device may include at least one nonvolatile memory device. Non-volatile memory devices include NAND flash memory, vertical NAND (VNAND), NOR flash memory, resistive random access memory (RRAM), and phase change memory. (Phase-Change Memory: PRAM), Magnetoresistive Random Access Memory (MRAM), Ferroelectric Random Access Memory (FRAM), Spin Transfer Torque Random Access Memory (STT-RAM), etc. Can be

The embodiments described above may be implemented as a hardware component, a software component, and/or a combination of a hardware component and a software component. For example, the devices, methods, and components described in the embodiments are, for example, a processor, a controller, an Arithmetic Logic Unit (ALU), a digital signal processor, a microcomputer, a field programmable gate (FPGA). Array), PLU (Programmable Logic Unit), microprocessor, or any other device capable of executing and responding to instructions, it can be implemented using one or more general purpose computers or special purpose computers. The processing device may execute an operating system (OS) and one or more software applications executed on the operating system.

In addition, the processing device may access, store, manipulate, process, and generate data in response to the execution of the software. For the convenience of understanding, although it is sometimes described that one processing device is used, those of ordinary skill in the corresponding technical field, the processing device is a plurality of processing elements and/or multiple types of processing. You can see that it can contain elements. For example, the processing device may include a plurality of processors or one processor and one controller. In addition, other processing configurations, such as parallel processors, are possible.

Software may include a computer program, code, instruction, or a combination of one or more of these, and configure the processing unit to operate as desired or process it independently or collectively. You can command the device. Software and/or data is any type of machine, component, physical device, virtual equipment, computer storage medium or device to be interpreted by the processing device or to provide instructions or data to the processing device. , Or may be permanently or temporarily embodyed in a transmitted signal wave. The software may be distributed on networked computer systems, and stored or executed in a distributed manner. Software and data may be stored in one or more computer-readable recording media.

The method according to the embodiment may be implemented in the form of program instructions that can be executed through various computer means and may be recorded on a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, etc. alone or in combination. The program instructions recorded in the medium may be specially designed and configured for the embodiment, or may be known to and usable by those skilled in computer software. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tapes, optical media such as CD-ROMs and DVDs, and magnetic media such as floptical disks. -Includes hardware devices specially configured to store and execute program instructions such as magneto-optical media, ROM, RAM, flash memory, etc. Examples of program instructions include high-level language code that can be executed by a computer using an interpreter, etc., as well as machine language codes produced by a compiler. The hardware device described above may be configured to operate as one or more software modules to perform the operation of the embodiment, and vice versa.

In the method and apparatus for sharding a block chain according to an embodiment of the present invention, it is impossible for a malicious node to predict and attack the consensus subject node because it is not possible to predict the subject of distributed consensus of a specific block height of a specific shard.

In the method and apparatus for sharding a block chain according to an embodiment of the present invention, it is impossible for a malicious node to continuously attack a corresponding shard because a specific node is not continuously selected as the subject of distributed consensus of the same shard.

The method and apparatus for sharding a block chain according to an embodiment of the present invention do not have an additional consensus process to continuously select a specific node as a distributed consensus subject of another shard, so there is no computation and communication cost for this.

In the method and apparatus for sharding a block chain according to an embodiment of the present invention, a minimum number of nodes required for distributed consensus for each shard can obtain distributed consensus qualification, enabling rapid consensus among nodes participating in the distributed consensus.

In the method and apparatus for sharding a block chain according to an embodiment of the present invention, a node can obtain a distributed consensus qualification regardless of its computing power, so that some nodes with strong computing power cannot monopolize the distributed consensus qualification.

Meanwhile, the contents of the present invention described above are only specific examples for carrying out the invention. The present invention will include not only specific and practically usable means itself, but also technical ideas that are abstract and conceptual ideas that can be utilized as future technologies.

SHARD 0: 1st shard
SHARD 1: second shard
N1 to N8: nodes
1000: Blockchain generation device

Claims (20)

In the method of sharding a block chain of a block chain generating device,
Obtaining a nonce value from a nonce chain at the node;
Allocating the node to a random shard by using the nonce value; And
And selecting a consensus node to select a consensus subject for the allocated shard. The method of claim 1,
The method of claim 1, wherein the nonce chain is generated by repeatedly hashing a unique value. According to claim 2,
Wherein the node discloses the last hash value of the nonce chain to other nodes. The method of claim 3,
When publishing the last hash value, the node simultaneously discloses a block number from which to use the nonce chain to the other nodes. The method of claim 1,
The step of assigning to the random shard,
Dividing the nonce value by the number of shards; And
And allocating the node to the random shard by using the remaining value according to the result of the division. The method of claim 1,
The method, characterized in that the nonce value of the node is changed for each block height of the block chain. The method of claim 1,
The step of selecting the consensus node,
The method further comprising the step of selecting a consensus node of the next block based on the information of the previous block. The method of claim 1,
The step of selecting the consensus node,
The method further comprising the step of performing an operation to check whether the consensus node of the allocated shard is selected. The method of claim 8,
The method of claim 1, wherein the node limits the number of times of the operation in order to grant the variance sum qualification regardless of the operation capability. The method of claim 1,
The number of consensus nodes of the allocated shard is determined by the number of nodes that can participate in consensus (n), the minimum number of nodes required for consensus (x), and a probability value (k) at which less than the number of the minimum nodes is selected. Method, characterized in that determined. Participating nodes;
A first shard having a first block chain of a first height; And
Including a second shard having a second block chain of the first height,
Each of the participating nodes,
A blockchain system, characterized in that: assigned to the first shard and the second shard according to a nonce value read from a nonce chain, and selected as a consensus node of the assigned shard according to the nonce value. The method of claim 11,
Each of the participating nodes,
Blockchain system, characterized in that the nonce value of the nonce chain and the start height using the corresponding nonce value is disclosed to other nodes. The method of claim 12,
Each of the other nodes verifies a nonce value to be used by each of the participating nodes by using the last nonce value. The method of claim 11,
Each of the participating nodes is assigned to one of the first shard and the second shard according to each block height. The method of claim 14,
Each of the participating nodes knows the shard assigned to the block height by using the nonce value. The method of claim 14,
Each of the participating nodes, as shown in the following equation,

The nonce value obtained from the above nonce chain (

) And the hash value of the previous block of the allocated shard (

) Is hashed, and the coupon value is the difficulty level (

Blockchain system characterized by determining whether to select a consensus node based on whether it is smaller than ). The method of claim 16,
The above difficulty level (

) Is a block chain characterized in that it is calculated by the number of participating nodes (n), the minimum number of nodes required for consensus in each shard (x), and the probability (k) to be selected less than the minimum number of nodes required for consensus system. In the block chain generation device,
At least one processor; And
A memory for storing at least one instruction executed by the at least one processor,
The at least one instruction,
Read nonce value from nonce chain;
Allocating the block chain generating device to a random shard using the nonce value; And
Blockchain generation apparatus, characterized in that executed in the at least one processor to perform an operation for selecting a consensus node of the assigned shard. The method of claim 18,
The nonce chain is generated by hashing a random value of the block chain generating device a plurality of times. The method of claim 18,
The allocated shard is allocated based on the nonce value by a predetermined operation method.

Images