KR102451115B1 - Method for selecting consensus node using nonse, method and apparatus for generating blockchain using the same - Google Patents

Abstract

A method of generating a block chain according to the present invention includes the steps of selecting second candidate nodes from a node pool according to a consensus node selection method using a nonce in a first master node that has generated a first block; and selecting a second master node by using the voting results of the first candidate nodes in the first master node, wherein the second master node generates the second master node from among the candidate blocks generated from the second candidate nodes. It is characterized in that the candidate block is fixed as the second block.

Description

A method for selecting a consensus node using Nonce and a method and apparatus for creating a block chain using the same

The present invention relates to a method for selecting a consensus node using nonce, and a method and apparatus for generating a block chain using the same.

In general, blockchain utilizes a peer-to-peer (P2P) network as one of the distributed databases. A distributed database is a technology that physically distributes data so that multiple users can share a large-scale database. Blockchain creates a peer-to-peer network of cryptocurrency users connected to the Internet. Through this, transaction details (blocks) of virtual currency are stored in the user's computer. Among them, transaction details that match the data of the majority of users are verified as normal ledgers and stored in blocks. If errors such as omissions are found in a specific user's ledger, it is corrected by duplicating the normal ledger and replacing it. When a block containing new transaction details is created, the process of appending it after the previous block is repeated. The name blockchain also means that transaction details (blocks) are linked. When trading, each user's transaction history is compared. Through this, the authenticity of transaction details can be identified, preventing data forgery. The security and stability of the blockchain increases as more users share data. In addition to Bitcoin, blockchain is being used for various online services such as cloud computing services.

In the case of a private blockchain, blocks are maintained by the distributed agreement of some authorized nodes. With this delegation of authority, many transactions can be processed compared to public blockchains, but the advantages of public blockchains have to be abandoned. Therefore, there is a need for a new consensus algorithm that can be used simultaneously in public and private blockchains.

Patent Publication: 10-2017-0137388, Publication Date: December 13, 2017, Title: Integrity Guarantee Method Using Blockchain Technology. US Patent Publication: US 2017-0344987, Publication Date: November 30, 2017, Title: METHOD AND SYSTEM FOR AN EFFICIENT CONSENSUS MECHANISM FOR PERMSSIONED BLOCKCHAINS USING BLOOM FILTERS AND AUDIT GUARANTEES. US Patent Publication: US 2019/0068380, Publication Date: January 28, 2019 (First Application Date: August 21, 2017, CN 2017106\736740.5), Title: BLOCKCHAIN CONSENSUS NODE SELECTION.

It is an object of the present invention to provide a method and apparatus for allowing only a part of all nodes participating in a distributed consensus to participate in a consensus.

It is an object of the present invention to minimize resource consumption by participating in block generation of only some of the entire nodes, to represent the probabilistic whole while making it impossible to predict in advance the node that will acquire the block generation authority, and to select a certain number of consensus nodes. It is to provide a method and device for selecting the subject of a distributed agreement that guarantees and prevents fork occurrence.

An object of the present invention is to provide a method and apparatus for creating a block chain that cannot be arbitrarily damaged after block confirmation and can be applied to public and private block chains.

The method of generating a block chain according to an embodiment of the present invention selects second candidate nodes from a node pool according to a consensus node selection method using a nonce in a first master node that has generated a first block to do; generating second candidate blocks by the selected second candidate nodes one by one; and selecting, by the first master node, a second master node from among second candidate nodes according to the voting results of the first candidate nodes for the generated second candidate blocks, It is characterized in that the candidate block is fixed as the second block.

In an embodiment, the nonce is generated with a hash value of a block generated by the first master node and a unique value of the nodes.

In an embodiment, the unique value is a value obtained from a private key or a nonce chain.

In an embodiment, the nonce uses all or part of a hash value of a block generated by the first master node and a value signed with the private key of the corresponding node or a value obtained from the nonce chain of the corresponding node. characterized as

In an embodiment, the selecting of the second candidate nodes may further include comparing a coupon having at least some of the hashed values with a reference value.

In an embodiment, the selecting of the second candidate nodes may include calculating a distance corresponding to a result of comparing the coupon with the reference value.

In an embodiment, each of the second candidate nodes records an electronic signature that confirms whether the corresponding distance and distance have been issued properly in the candidate block, and transmits the recorded candidate block to another node, or ,

In an embodiment, each of the second candidate nodes is characterized by a verification process through a nonce chain that checks whether the corresponding distance and distance are issued properly.

In an embodiment, the method may further include informing each of the second candidate nodes of the coupon and the calculated distance to the node pool or the first candidate node.

In an embodiment, each of the first candidate nodes aligns the second candidate nodes according to the calculated distance alignment result.

In an embodiment, each of the first candidate nodes transmits the collected distance of the second candidate nodes to the first master node.

In an embodiment, in the voting of the first candidate nodes, the number of the second candidate nodes is used as a parameter of the voting.

In an embodiment, it is characterized in that the distance value of the second candidate nodes is used in the voting of the first candidate nodes.

In an embodiment, a node selected as a candidate block generating node to be used as a private consensus structure is shared with the node pool, and predetermined nodes are registered in the node pool.

In an embodiment, it is characterized in that all participating nodes can participate in the node pool for use as a public consensus structure.

The method for selecting a consensus node used to create a block chain according to an embodiment of the present invention performs a hash operation by inputting the hash value of the previous block and a digital signature signed with the private key of the participating node or a value obtained from the nonce chain. to do; comparing a coupon composed of at least a portion of the hashed values with a reference value; and selecting the participating node as a candidate node for generating a block according to the comparison result.

In an embodiment, the node pool is predetermined or includes all nodes.

In an embodiment, the node pool is divided into two or more groups according to the comparison result.

In an embodiment, the two or more groups include a pass group and a fail group, and the pass group and the fail group have a characteristic of a binomial distribution.

In an embodiment, it is characterized in that the average and variance of the nodes to be selected according to a specific probability distribution are calculated.

A block chain generating 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 calculates a hash value of a block generated by the first master node and digitally signs the value The second candidate nodes are selected through the result obtained by hashing the obtained value or the hash value of the block generated by the first master node and the value obtained from the nonce chain, and the selected candidate nodes fix the second master block among the second candidate blocks. It is characterized in that it is executed in the at least one processor to proceed with voting to lock, and to lock the second master block by the first master node.

In an embodiment, the first master node locks the second candidate block that proposes the minimum or maximum distance obtained by a certain ratio or more through the voting results of the nodes that have generated the second candidate block. .

The method for selecting a consensus node according to an embodiment of the present invention, and a method and apparatus for generating a block chain using the same do not require excessive resource use such as Proof-of-Work (PoW).

The method for selecting a consensus node according to an embodiment of the present invention, and the method and apparatus for generating a block chain using the same, determine the node participating in the block update at each block generation step, making it impossible to predict and attack the node.

A consensus node selection method according to an embodiment of the present invention, and a block chain generation method and apparatus using the same, select the majority opinion voted by previous block generation nodes, so that nodes with many resources such as PoS (Proof-of-Stake) The disadvantage of monopolizing update rights can be improved.

The method for selecting a consensus node according to an embodiment of the present invention, and a method and apparatus for generating a block chain using the same, prevent transaction fraud such as double payment because the process of locking the second block is determined through the nodes that agreed to the first block can do.

The consensus node selection method according to an embodiment of the present invention and the block chain generation method and apparatus using the same can be used in common for a private block chain and a public block chain when only nodes participating in candidate block generation are managed.

The accompanying drawings below are provided to help understanding of the present embodiment, and provide embodiments together with detailed description. However, the technical features of the present embodiment are not limited to specific drawings, and features disclosed in each drawing may be combined with each other to constitute a new embodiment.
1 is a flowchart exemplarily illustrating a method for selecting a consensus node according to an embodiment of the present invention.
2 is a diagram conceptually illustrating the operation of a variance consensus algorithm according to an embodiment of the present invention.
3 is a flowchart exemplarily showing a block chain generation method according to an embodiment of the present invention.
4 is a diagram exemplarily showing a block chain generating apparatus 1000 according to an embodiment of the present invention.

Hereinafter, the content of the present invention will be described clearly and in detail to the extent that a person skilled in the art can easily implement it using the drawings.

Since the present invention can have various changes and can have various forms, specific embodiments are illustrated in the drawings and described in detail in the text. However, this is not intended to limit the present invention to the specific disclosed form, it should be understood to include all modifications, equivalents and substitutes included in the spirit and scope of the present invention. Terms such as first, second, etc. may be used to describe various elements, but the elements should not be limited by the terms.

The above terms may be used for the purpose of distinguishing one component from another. For example, without departing from the scope of the present invention, a first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component. When an element is referred to as being “connected” or “connected” to another element, it is understood that it may be directly connected or connected to the other element, but other elements may exist in between. it should be On the other hand, when it is said that a certain element is "directly connected" or "directly connected" to another element, it should be understood that the other element does not exist in the middle.

The terms used in the present application are only used to describe specific embodiments, and are not intended to limit the present invention. The singular expression includes the plural expression unless the context clearly dictates otherwise.

In the present application, terms such as "comprise" or "have" are intended to designate the existence of an embodied feature, number, step, operation, component, part, or combination thereof, but one or more other features or numbers , it should be understood that it does not preclude the possibility of the existence or addition of steps, operations, components, parts, or combinations thereof. Unless defined otherwise, all terms used herein, including technical and scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. Terms such as those defined in commonly used dictionaries should be interpreted as having meanings consistent with the context of the related art, and unless explicitly defined in the present application, they are not to be interpreted in an ideal or excessively formal meaning. .

In general, distributed consensus algorithms include Proof-of-Work (PoW) and Proof-of-Stake (PoS). PoW is a consensus algorithm used in Bitcoin, the first blockchain application. PoS is a consensus algorithm that has been widely introduced in public blockchains recently.

First, the concept and characteristics of Proof-of-Work (PoW) are as follows. Below, for convenience of explanation, the description will be limited to Bitcoin. PoW is a method of suppressing fraud by proving that resources (eg, computing power, etc.) have been invested for work. To participate in Proof of Work (PoW), participating nodes must commit resources. Even spam and DoS attacks can be successful when more than 51% of resources are invested. A unique hash value is needed to create a block. Here, the unique hash value is a value that must be found by randomly substituting a nonce value. By ensuring that there is no cost to verify such a hash value, all participating nodes can be easily verified.

Among participating nodes, only the node that finds the hash value of the next block creates (mines) a block. For example, if the cost required to generate a block is close to '0', all nodes can easily create a block and connect it to the chain.

If the node that created the block appears at the same time, the chain can be branched and multiple can be created. Among them, the longest chain is selected. If a large number of malicious nodes participate and continue to create illegal blocks, Bitcoin may collapse. In order to prevent such Bitcoin collapse, the cost required to generate the next block is put into the task of finding a random hash value. This time can be obtained by vigorously running the computers of all nodes for about 10 minutes. Even if malicious nodes try to disrupt the Bitcoin network, they cannot properly attack without investing more than a certain number of resources, or more than 51% of the total resources.

However, PoW requires a unique hash value to be found by randomly substituting a nonce value for block generation. In order to find such a unique hash value, resources such as computing power must be excessively invested. Costs and environmental problems caused by power consumption (electricity bills are consumed more than the compensation amount by mining, and the cost of mining < electricity bills, also called meaningless energy consumption). In addition, PoW enforces only certain computational power. Separate chips with intensive computing power appeared, and the problem of dividing into ‘haves’ and ‘have-nots’ in the money economy (privatization of minority groups) occurs. This may cause a centralization problem due to the unity of computing power. It is a monopoly structure by an initial few. In the case of Bitcoin, the number of blocks is limited to 21 million, causing inflation problems. It can be provided as an illegal fund, criminal fund channel, and tax evasion route.

Second, the concept and characteristics of PoS (Proof-of-Stake) are as follows. PoS adopts a method that can be verified in proportion to the stake held by the node. PoS makes the probability of creating a block proportional to the stake of the token each node has. PoS can be viewed as a specific type of PoW when viewed as a resource for injecting token stakes. The algorithm formula of PoS can be expressed as 'PoW using digest'. Compared to PoW, PoS consumes little energy and makes resource intensive difficult.

PoS is a method in which the more stakes, the more advantageous. The problem of centralization of block generation may occur due to the stake. There may be a tendency that each node only collects tokens and does not want to use them. A method called ‘Proof of Stake Velocity’ that lowers the stake valuation for unused old tokens is being proposed. The cost of inputting the necessary resources is too low, resulting in a ‘Nothing at Stake’ problem. This problem should be rectified when the chain is forked. Once the chain is forked, each node has the same amount of stake in both chains. Since calculations can be performed from both sides, there is no reason to rectify the situation. Conversely, you can bet on both chains, so you can deliberately aim for a chain branch and keep trying.

For example, since the stake reaches 100% at the time of the genesis block, which is the first block of the blockchain, the person who started the system can recreate the entire block again and again. If each node also has a stake, it is possible to start over from that point, so PoS alone cannot prevent forgery. In addition, since the cost of creating a block is so low, there is a possibility of forgery of all chains up to the present by going back to previous blocks.

In summary, the block chain tries to prevent information forgery by verifying the validity in the process of linking blocks in the order in which they are created, but PoW and PoS, which are representative distributed consensus algorithms, have limitations due to the above-mentioned problems. Rather, the hash power of a small number of mining groups or the centralization problem caused by excessive stake holders are occurring. In the case of PoW, nodes with high computational power take the initiative in distributed consensus. In the case of PoS, an owner with a large stake has an advantage. Therefore, a new distributed consensus algorithm is needed that makes the block creation authority transparent and has a structure that guarantees trust in all transactions.

A method for selecting a consensus node according to an embodiment of the present invention, and a method and apparatus for generating a block chain using the same, by using a distributed consensus algorithm by selecting an untraceable distributed agreement subject, proof-of-work (PoW) of the existing block chain -Work) and Proof-of-Stake (PoS) methods can overcome the scalability and security limitations.

The distributed consensus algorithm according to an embodiment of the present invention minimizes resource consumption by participating in block generation by only a part of all nodes, and the selection prediction is impossible and at the same time probabilistically guaranteed representative of the selected node acquiring block generation authority. Nodes are stably secured over a certain number and can be implemented so as not to prevent fork occurrence. In addition, the distributed consensus algorithm according to an embodiment of the present invention cannot arbitrarily damage the ledger after block confirmation, and will be applicable to public and private block chains.

The distributed consensus algorithm according to an embodiment of the present invention may be implemented to perform proof-of-nonse (PoN) in order to provide a structure, scalability, and security of a lightweight distributed agreement.

1 is a flowchart exemplarily showing a method for selecting a candidate node for block generation in a distributed consensus algorithm according to an embodiment of the present invention. Referring to FIG. 1 , PoN may determine candidate node selection for block generation as follows.

Each of the participating nodes can digitally sign the previous block hash value with the private key of each participating node. Here, the hash value (hd) of the previous block may be the head hash value of the previous block (S110).

Pre_blk_sign = sign(Key_private)(pre_hash)

By digitally signing (Pre_blk_sign) for each node using the previous block hash value (pre_hash) with the private key (Key_private) of the participating nodes, other nodes cannot predict whether or not the block creation authority is acquired. Since each of the nodes cannot know the private key (Key_private) of the other node, the digital signature result cannot be predicted. In an embodiment, a node that has obtained the right to generate a candidate block may verify the fact that it has obtained the right by presenting a digital signature together with other nodes.

In an embodiment, in order for nodes to become block generation candidates, there may be a procedure for registering in advance with a node pool. Also, when registering a node in the pool, it can be used as a private blockchain if the registration conditions of the node are strongly controlled. On the other hand, it can be used in a public blockchain if the possibility of registration is opened to all nodes participating in the blockchain.

The result of the digital signature (Pre_blck_sign) for each participating node may be processed to have a uniform distribution characteristic. For example, a significant value (key; nonce) can be generated by hashing the digital signature (Pre_blck_sign) as follows.

key = hash(Pre_blk_sign)

Here, the key value has a uniform distribution characteristic by the hash characteristic. In addition, it is possible to implement the key value through the hash value of the value obtained from the previous block hash value and the nonce chain in order to have the above characteristics.

In an embodiment, some of the generated keys (eg, 32 bits of key data) may be used as coupons. In an embodiment, a coupon in which some of the key values are selected also has a uniform distribution characteristic. In an embodiment, the coupon may be a value obtained by hashing the electronic signature value (sign(pre_block, pri_key) and the hash value (hd) of the previous block. In another embodiment, the coupon is a nonce chain value (nonce_chain()) and It may be a value obtained by hashing the hash value (hd) of the previous block (S120).

When a specific condition is satisfied by comparing the coupon with an arbitrary reference value (THD), a block generation candidate right may be obtained (S130). If a specific condition is satisfied, the block creation candidate authority is pass. In this case, the probability p to be selected may be determined by comparison with reference values. On the other hand, if the specific satisfaction is not met, the block creation candidate authority is fail. In this case, the probability is 1-p. The probability distribution that has two outcomes and that K nodes out of the total N nodes will be selected will follow a binomial distribution with mean Np and variance Np(1-p). In the binomial distribution, if N is large enough, the probability distribution that K nodes will be selected out of all N nodes will converge to a normal distribution with the mean and variance of the binomial distribution according to the central limit theorem. Through this, it is possible to select a node that will be the representative of the whole probabilistically. In the case of controlling the average of nodes that have obtained candidate rights, stable nodes can be continuously selected through the cumulative distribution function of the normal distribution.

A node that has obtained the right to create a candidate block records the distance (coupon value or coupon and the calculation result of the reference value (e.g., the difference between the two values)) and an electronic signature that confirms whether the distance has been issued properly in the candidate block and records other nodes. can be delivered to (S140).

The above-described candidate node selection method minimizes resource consumption by participating in block generation by only a part of all nodes, makes prediction impossible for the node that acquires block generation authority, and allows the selected node to represent the probabilistically guaranteed whole, It is possible to stably secure more than a certain number of selected nodes.

On the other hand, the new distributed consensus algorithm (PoN) according to an embodiment of the present invention prevents fork occurrence, cannot arbitrarily damage the ledger after block confirmation, and is applicable to public and private blockchains.

2 is a diagram conceptually illustrating the operation of a variance consensus algorithm according to an embodiment of the present invention. Referring to FIG. 2 , the operation of the variance consensus algorithm may proceed as follows.

As described above, the first candidate blocks may be generated according to the participating node selection method. When one block among the generated first candidate blocks is locked (fixed), the selected node may operate as a master node of the first block (①). In an embodiment, when selecting the first master node, the master node of the first block (N-1 Block) informs the number of nodes that have generated the first candidate block and the distance suggested by each node in the second block voting. It can be used as a parameter of the vote to be used.

In an embodiment, the hash value of the block generated by the master node of the first block may be used as the previous block hash value for generating the second candidate blocks. At this time, each node can calculate whether to acquire the authority of the second block generating node by comparing the coupon with the reference value through the operation described in the method for determining the right to select a candidate node for block generation (②).

A node that has obtained the right to create a second candidate block can create a candidate block and distribute it to all nodes (③)

The nodes that have generated the first candidate block can participate in voting by passing one or more distances included in the block delivered by the second candidate nodes received by each node to the first master node (④).

The first master node has a minimum distance (or maximum, distance) agreed upon by more than a certain percentage of nodes participating in the first block generation (eg, majority, 2/3, etc.) from the voting results of the nodes that generated the first candidate block. The lock block can be delivered to all nodes to lock the second candidate block proposed (extracted by sorting) (lock, final block generation) (⑤)

At this time, when the second block (N Block) is locked, the block chain can be completed by repeating the above-described processes for the third block.

The distributed consensus algorithm (PoN) according to an embodiment of the present invention may provide a consensus structure in which fork does not occur by the first master node determining the second master node according to the voting results of the first candidate blocks.

In addition, the distributed consensus algorithm (PoN) according to an embodiment of the present invention locks the block so that voting cannot be performed again in order to change it after the master node is selected, thereby making it impossible to damage the ledger.

In addition, the Distributed Consensus Algorithm (PoN) according to an embodiment of the present invention can be used as a private block chain when nodes capable of participating in candidate block generation are predetermined, and can be applied to a public block chain when there is no restriction on participating nodes. .

In addition, the distributed consensus algorithm (PoN) according to an embodiment of the present invention does not require excessive use of resources such as PoW.

In addition, since the distributed consensus algorithm (PoN) according to an embodiment of the present invention determines a node participating in block update at every block generation step, it is impossible to predict and attack it.

In addition, the Distributed Consensus Algorithm (PoN) according to an embodiment of the present invention can improve the disadvantage that a node with many resources, such as PoS, monopolizes the update right by selecting the majority opinion voted by the previous block generating nodes.

In addition, in the distributed consensus algorithm (PoN) according to an embodiment of the present invention, since the process of locking the second block is determined through the first nodes, it is possible to prevent fraudulent transactions such as double payment.

In addition, the Distributed Consensus Algorithm (PoN) according to an embodiment of the present invention can be commonly used for both private and public blockchains as long as only nodes participating in candidate block generation are managed.

3 is a flowchart exemplarily showing a block chain generation method according to an embodiment of the present invention. 1 to 3 , the block chain generation method may proceed as follows.

Second candidate blocks for generating the second block may be selected using the block generated by the first master node and the nonce calculated through the digital signatures of nodes registered in the pool or the value obtained from the nonce chain (S210) ). For example, second candidate nodes may be selected from among all nodes according to the candidate node selection method described in FIG. 1 .

Thereafter, the first master node may fix the second master block among the candidate blocks generated by the second candidate nodes through the voting of the first candidate nodes ( S220 ).

In an embodiment, the first master node proposes a minimum (or maximum) distance obtained by a consensus of more than a certain ratio (eg, majority, 2/3, etc.) through the voting results of the nodes that generated the first candidate block 2 Candidate blocks can be locked.

In an embodiment, the first master node may fix the second master block.

In an embodiment, not all nodes, but only the first candidate block generating nodes may vote for the second candidate block.

In an embodiment, when a node selected as a candidate block generating node is shared with a pool and only predetermined nodes are registered in the pool, the consensus node selection method may be used as a private consensus structure. In another embodiment, when all participating nodes can participate in the pool, the consensus node selection method may be used as a public consensus structure. That is, the consensus node selection method of the present invention can be commonly used for both private and public.

In an embodiment, the first master block generating node may generate a second master block lock event.

In an embodiment, it is not possible to predict whether other nodes will acquire authority from each other by using the private key of an asymmetric key or a value obtained from the nonce chain to determine the authority of the second block generation candidate.

In an embodiment, each node may be classified into two or more groups by comparing a coupon with a reference value to determine the second block generation candidate authority. In an embodiment, two or more divided groups may be divided into two groups, pass and fail. The distinct group may have a characteristic of a binomial distribution. In an embodiment, the average and variance of the nodes to be selected according to a specific probability distribution may be calculated.

In an embodiment, since the node that has obtained the second candidate block generation right informs the distance by calculating the coupon and the reference value obtained by the node when generating the candidate block, the first candidate block generation nodes are arranged according to the size of the distance value can make it possible

In an embodiment, the first candidate block generating nodes may transmit one or more distances of the second candidate blocks collected by the first candidate block generating nodes to the first master node.

In an embodiment, when the first master node selects the second master based on the voting results of the first candidate blocks, the first master node informs all nodes of the number and distance value of the nodes that have generated the second candidate block. can In an embodiment, the number of generated second candidate blocks notified by the first master node may be used as a parameter of the second block voting. In an embodiment, the second candidate block distance alignment value informed by the first master node may be used for voting decision.

Depending on the embodiment, some or all of the steps and/or operations run instructions, programs, interactive data structures, clients and/or servers stored on one or more non-transitory computer-readable media. At least in part may be implemented or performed using one or more processors.

4 is a diagram exemplarily showing a block chain generating apparatus 1000 according to an embodiment of the present invention. Referring to FIG. 4 , 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 with reference to FIGS. 1 to 3 , or may be implemented with at least one method described above with reference to FIGS. 1 to 3 . As described above, the processor 1100 unpredictably selects a node participating in block generation and update with a digital signature using the previous block and the node's private key, and the second by voting of the first candidate block generation node. Instruction to prevent a specific node from monopolizing the authority by locking the block, and to prevent transaction fraud such as double payment by allowing the first block master to determine the second block master by verifying the digitally signed contents through the private keys of the nodes instructions can be executed.

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

As shown in FIG. 4 , the processor 1100 includes a block generating unit (BLK Generating Unit), a blockchain control unit (Blockchain Controlling Unit), a block propagating unit (BLK Propagating Unit), and a block verifying unit (BLK Verifying Unit). It can be implemented to run as program code. The block generator may create a new block required for the transaction history. The blockchain control unit can control a new block to be connected to its own blockchain by using the above-described blockchain creation method, in particular, the distributed consensus node selection method. The block propagation unit can propagate the new block to the network to verify the validity of the new block connected to the block chain. The block verifier may receive a block generated by another node forming a network and verify the validity of the received block.

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

The memory 1300 may include computer-readable instructions. The processor 1100 may perform the aforementioned operations as an instruction stored in the memory 1300 is executed in the processor 1100 . The memory 1300 may be a volatile memory or a non-volatile 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 non-volatile memory device. Non-volatile memory devices include NAND flash memory (NAND flash memory), vertical NAND flash memory (VNAND), NOR flash memory (NOR flash memory), resistive random access memory (RRAM), 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. this can be

The embodiments described above may be implemented by a hardware component, a software component, and/or a combination of a hardware component and a software component. For example, the apparatus, methods, and components described in the embodiments may include, for example, a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable gate (FPGA). Array), a programmable logic unit (PLU), a microprocessor, or any other device capable of executing and responding to instructions, may be implemented using one or more general purpose or special purpose computers. The processing device may execute an Operating System (OS) and one or more software applications running on the operating system.

The processing device may also access, store, manipulate, process, and generate data in response to execution of the software. For convenience of understanding, although one processing device is sometimes described as being used, one of ordinary skill in the art will recognize that a processing device includes a plurality of processing elements and/or a plurality of types of processing. It can be seen that elements can be included. For example, the processing device may include a plurality of processors or one processor and one controller. Other processing configurations are also possible, such as parallel processors.

The software may include a computer program, code, instructions, or a combination of one or more thereof, which configures a processing device to operate as desired or is independently or collectively processed You can command the device. The software and/or data may be any kind of machine, component, physical device, virtual equipment, computer storage medium or device to be interpreted by or to provide instructions or data to the processing device. , or may be permanently or temporarily embody in a transmitted signal wave. The software may be distributed over 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 block chain generating apparatus 1000 according to an embodiment of the present invention includes at least one processor 1100 and a memory 1300 for storing at least one instruction executed by the at least one processor 1100, Using a digital signature to select participating nodes corresponding to the generation of the first block, voting is carried out so that the selected participating nodes lock the master block of the second block, and by the master node corresponding to the generation of the first block It may be executed in at least one processor 1100 to lock the master block corresponding to the generation of the second block.

The method according to the embodiment may be implemented in the form of program instructions that can be executed through various computer means and recorded in 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 on the medium may be specially designed and configured for the embodiment, or may be known and available to those skilled in the art of computer software.

Examples of the computer-readable recording medium include magnetic media such as hard disks, floppy disks and magnetic tapes, optical media such as CD-ROMs and DVDs, and magnetic such as floppy disks. - Includes hardware devices specially configured to store and execute program instructions, such as magneto-optical media, ROM, RAM, flash memory, and the like. Examples of program instructions include not only machine language codes such as those generated by a compiler, but also high-level language codes that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

A block chain method and apparatus according to an embodiment of the present invention unpredictably selects a node participating in block generation and update with an electronic signature based on the previous block and the node's private key, and votes for the first candidate block generating node. By locking the second block, the disadvantage that a specific node monopolizes the authority can be improved and the verification time can be dramatically shortened.

The block chain method and apparatus according to an embodiment of the present invention verifies the electronically signed contents through the private keys of nodes to ensure the integrity of the distributed ledger, so that the first block master determines the second block master, so that the transaction such as double payment It is capable of ensuring that fraud is prevented.

The block chain method and apparatus according to an embodiment of the present invention do not require excessive resource use such as PoW in the case of PoN, and can improve the disadvantage that nodes with many resources monopolize update rights such as PoS.

The block chain method and apparatus according to an embodiment of the present invention prevents excessive resource consumption by allowing the master node that has registered the first block to select the second block by election, and allows the master to select the next master, such as double payment, etc. It can block fraudulent transactions.

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

1000: block chain generator
1100: Processor
1200: communication device
1300: memory

Claims (20)

delete delete delete delete delete delete delete delete delete delete delete delete delete In the method of selecting a consensus node used to create a blockchain,
performing a hash operation by inputting a value obtained from a nonce chain of participating nodes;
comparing a comparison value generated using the hashed value with a reference value; and
selecting the participating node as a candidate node for generating a block according to the comparison result;
The comparison value is generated using a previous block-based value generated based on a previous block and a value obtained from the nonce chain. 15. The method of claim 14,
The candidate node is
A method, characterized in that it is predetermined or selected from a node pool including all nodes. 16. The method of claim 15,
The method, characterized in that the node pool is divided into two or more groups according to the comparison result. 17. The method of claim 16,
The two or more groups include a pass group and a fail group,
The pass group and the fail group method, characterized in that it has a characteristic of a binomial distribution. 17. The method of claim 16,
A method, characterized in that the mean and variance of the nodes to be selected are calculated according to a specific probability distribution. delete delete

Images