KR20230046644A - Representative and canditate selection method of blockchain network using comtitive bidding and blockchain network - Google Patents

Abstract

According to the present invention, a representative and candidate selection method of a blockchain network using competitive bidding comprises the following steps of: initiating of representative and candidate selection performance of a blockchain network; performing bidding with random values in individual nodes configuring the blockchain network; confirming bidding validity including a bidding participation rate; excluding the maximum value and the minimum value among bid values when the bidding is closed; and selecting a node mote suitable for a selection condition as a representative and selecting a node suitable next as a candidate.

Description

Blockchain network representative and candidate selection method using competitive bidding {REPRESENTATIVE AND CANDITATE SELECTION METHOD OF BLOCKCHAIN NETWORK USING COMTITIVE BIDDING AND BLOCKCHAIN NETWORK}

The present invention relates to a method for selecting a representative node and a candidate node of a blockchain network to which a high-speed consensus technique for private network transactions using a competitive bidding method is applied, and a blockchain network composed of nodes performing the same.

As cryptocurrencies such as Bitcoin play a major role in the global economy, interest in blockchain has soared, and related technologies have been developed and various platforms have been commercialized. Accordingly, as more services using blockchain were discovered and requirements increased, fundamental problems of blockchain began to be raised, and the most important factor among them was performance (speed). Currently, the official speed of Bitcoin is 7TPS (Transaction Per Second), which is the level of processing 7 transactions per second, and Ethereum is about 20TPS. It's a difficult situation to get right. Therefore, one of the biggest factors determining the success or failure of blockchain is speed.

There are many ways to improve the speed of the block chain, and the most common method is to quickly and fairly determine who creates the block. In other words, since the speed of block generation is directly related to how the block creator called the Primary Node (representative) is selected, various ideas and technologies are being developed for the method of selecting the Primary Node or the blockchain consensus method.

Among the several methods proposed so far, representative methods and related technologies are introduced as follows.

First, in 'Blockchain Consensus Method and Device', a method for diversifying consensus techniques specialized for each service and randomly processing consensus was proposed, but rather than proposing a new consensus technique, PoW (Proof of Work) and PoS (Proof of Stake) ) and other existing consensus methods were suggested depending on the situation.

Second, the ‘method of creating a block chain with a node proof consensus process and price distribution process by hierarchical and stochastic representative election’ suggests a random selection method based on random probability rather than specific logic.

Third, 'Agreement node selection method using nonce and block chain generation method and device using it' is a method to secure randomness of consensus technique by constructing a block generator candidate group based on a random value (nonce) and determining the final generator by voting. is proposing

Fourth, 'Method for Selecting a Representative in Blockchain-based Consensus Algorithm' suggests that simply selecting a representative at random is a desirable consensus method.

In addition, many literatures suggest a method for selecting a representative, but there is a similarity in that they suggest the existing energy consumption or share competition method or a simple random method.

In addition, in addition to the selection of representatives, the speed can be increased by simplifying or efficiently processing the process, but there are not many research results on this in the early stages.

As described above, the problem to be solved by the present invention in the prior art, that is, the method for selecting a representative who is the subject of block generation, is as follows.

As a representative representative consensus method, there is PBFT (Byzantine Fault Tolerance), which elects a representative from a node group selected by policy and includes a method for selecting the next representative in the event of a malfunction of the representative. SBFT (Simplified BFT), which is an extension of this, tried to reduce the network overhead of PBFT by applying the Threshold Signature technique with a separate node (Collector) that plays a specific role. These BFT-type methods operate in such a way that a representative is already selected at the beginning or the selection process is delegated to an operating institution or consultative body, so the representative is defined in advance, that is, a predictable situation. The Loop Fault Tolerance technique is also a kind of Round-Robin method called Spinning. Since the leader is replaced every block, it can be said that the fairness of the representative selection is secured, but it has the disadvantage of predicting the representative of the next round. This can be seen as the same as the Tendermint of the Round-Robin method with added weights.

Symsensus, which was designed based on game theory, also designed the block generation and consensus-building process by dividing the block generation candidates into groups and dividing the roles of nodes within the group into multiple stages. The downside is that vulnerabilities exist.

On the other hand, Proof-based blockchain algorithms that do not select a representative who is a block generator do not match the blockchain method that pursues high-speed consensus because competitive behavior for block creation and abnormal situations such as fork occur.

The technique proposed according to the above prior art has the following problems.

First, many technologies adhere to competitive energy consumption (PoW, etc.) or rely on proof-of-stake methods (PoS, etc.) in which authority is concentrated in a specific minority, so energy problems, environmental problems, or security based on fairness or prediction of the next representative etc., there are problems.

Second, in order to ensure fairness, there are cases where a random representative selection method is proposed, such as the Round-Robin technique that simply rotates the turn or the random selection method based on random selection. However, the round-robin method has inherent security vulnerabilities because the next representative is predictable, and the random selection poses problems such as securing fairness in the process or the right to select the previous representative.

Third, even if a representative is selected in a fair manner, a transparent and specific process for sharing information and procedures in the selection process must be presented. In particular, it should not be possible to derive advantageous information from shared information or to have a competitive advantage with other nodes, but there is no case in which a concrete solution to this problem has been proposed.

Fourth, most of the representative selection techniques contain inefficiency due to the repetition of the same process every time.

In addition to this, it is rare to present a process for efficiently handling the process of selecting a representative.

Republic of Korea Registration No. 10-1949712

The present invention aims to provide a method for selecting a representative and candidate of a blockchain network that can secure efficiency and security at the same time in the process of randomly selecting a representative who leads block generation on a blockchain network, and a blockchain network that performs the same. .

A method for selecting a representative and a candidate for a blockchain network using competitive bidding according to an aspect of the present invention includes the steps of initiating selection of a representative and candidate for a blockchain network; Bidding with random values in each node constituting the blockchain network; Checking the validity of the bid including the bid participation rate; Excluding the maximum value and the minimum value among bid values when the bidding is closed; and selecting a node that most satisfies the selection condition as a representative, and then selecting a node that satisfies the selection condition as a candidate.

Here, in the step of initiating the selection of representatives and candidates, selection of representatives and candidates to perform one or a predetermined number of rounds for decision-making of the blockchain network may be initiated.

Here, the selection condition may be closest to the average value of non-excluded bid values.

Here, in the step of selecting the representative and the candidate according to the selection condition, if there are two or more nodes closest to the average value, the previous representative node history may be searched and the node having the oldest representative node history may be selected as the representative node. there is.

Here, the candidate may perform the method of selecting the representative and candidate of the blockchain network for the next round in a situation where the representative cannot proceed with the round in charge.

Here, in the step of initiating the selection of the representative and the candidate, an acyclic tree topology defining a path for transmitting the bidding and selection results may be configured.

Here, the root node of the acyclic tree topology may be a previously selected representative or candidate node.

A blockchain network according to another aspect of the present invention is composed of a plurality of nodes that perform data communication with each other through a dedicated network, and includes a representative node and a candidate node, wherein the representative node performs subsequent rounds. In order to select another representative node to proceed with, a representative selection auction bidding may be conducted in a method of excluding random value bidding and maximum and minimum values.

Here, the candidate node may perform the representative selection auction bidding for the next round in a situation where the representative cannot proceed with the round in charge.

Here, the representative node performs the representative selection auction bidding for the next round in the last round in charge, selects the node that most satisfies the selection conditions as the representative, and selects the next matching node as the candidate. .

Here, the representative node comprises: receiving random value wallets from the plurality of nodes; Checking the validity of the bid including the bid participation rate; Excluding the maximum value and the minimum value among bid values when the bidding is closed; and selecting a node that most satisfies the selection condition as a representative, and then selecting a node that satisfies the selection condition as a candidate.

Here, the representative node may configure a topology of an acyclic tree structure among the plurality of nodes defining an information transfer path for the representative selection auction bidding operation.

Here, each of the plurality of nodes encrypts information generated by itself or information received from a previous node on the source side on the topology using a one-time private key generated by the node, and forwards the information to the next node on the sink side on the topology. can

Here, the representative node may transmit the selection result of the representative selection auction bidding to the plurality of nodes together with information for time synchronization.

Here, the plurality of nodes that have received the information for time synchronization may set the start point and end point of the next round according to the information for time synchronization.

Here, the plurality of nodes may create a block of the corresponding round in each round, request verification, verify the block generated in the previous round to form a chain, and select representative nodes and candidate nodes for the next round. there is.

Efficiency and security in the process of randomly selecting a representative who leads block generation on the blockchain network when the blockchain network representative and candidate selection method and/or the blockchain network according to the spirit of the present invention having the above configuration are implemented. has the advantage of being able to secure both at the same time.

The blockchain network representative and candidate selection method and / or blockchain network of the present invention should be able to respond immediately even in abnormal situations, and should be operated in a concise manner to obtain a speed-up effect.

The method for selecting representatives and candidates of the blockchain network and/or the blockchain network of the present invention, in order to reduce overhead and secure security while minimizing energy consumption in a situation where the blockchain is expanding to various services, generates blocks It has the advantage of improving the method, i.e. block generation and consensus method.

1 is a conceptual diagram illustrating a blockchain network performing a representative selection method of a competitive bidding method proposed in the present invention.
2 is a flowchart illustrating an embodiment of a method for selecting a representative and a candidate of a blockchain network according to the spirit of the present invention.
3 is a conceptual diagram illustrating a method of forming a topology in configuring a network between blockchain nodes.
4 is a conceptual diagram illustrating a random value transmission procedure for selecting a representative and a candidate in a situation where a blockchain node topology is formed.
5 is a block diagram showing an example of a blockchain node device that can be each node constituting the blockchain network of FIG. 1;
6 is a conceptual diagram showing procedures for selecting a representative, generating a block, verifying, and forming a chain for each round.

In describing the present invention, terms such as first and second may be used to describe various components, but the components may not be limited by the terms. Terms are only for the purpose of distinguishing one element from another. For example, a first element may be termed a second element, and similarly, a second element may be termed a first element, without departing from the scope of the present invention.

When a component is referred to as being connected or connected to another component, it may be directly connected or connected to the other component, but it may be understood that another component may exist in the middle. .

Terms used in this specification are only used to describe specific embodiments, and are not intended to limit the present invention. Singular expressions may include plural expressions unless the context clearly dictates otherwise.

In this specification, the terms include or include are intended to designate that there is a feature, number, step, operation, component, part, or combination thereof described in the specification, and one or more other features or numbers, It can be understood that the presence or addition of steps, operations, components, parts, or combinations thereof is not precluded.

In addition, shapes and sizes of elements in the drawings may be exaggerated for clearer description.

In order for blockchain technology to be commercialized and applied to various services, the following requirements must be satisfied.

1) Ancillary effort (energy consumption, etc.) in selecting a representative to create the next block should be minimized.

2) The representative who will create the next block must be completely random and unpredictable.

3) When selecting a representative, network overhead due to information sharing must be minimized.

4) When selecting a representative, the other party must not know the shared information in advance (Hiding feature), and the sender must not be able to modify the information after transmission (Binding feature).

5) The block generation process, including the selection of representatives, must be concise and efficient.

6) If the current representative is malicious or abnormal, it is necessary to immediately select the next representative.

7) A synchronization process method is needed to enable operation in an asynchronous network.

In the present invention, in order to achieve the above-mentioned requirements, a method for selecting representatives of randomness based on a bidding agreement method is presented for a blockchain network in a dedicated network environment, and the representative selection bidding process is performed in parallel with the step-by-step process of block generation, verification, and chain formation. Suggests how to deal with

1 is a schematic diagram of a block chain network that performs a method for selecting a block generator (ie, representative) of the competitive bidding method proposed in the present invention. Nodes forming a blockchain (A (1000), B, C, etc. in FIG. 1) generate a random value (R _A, etc.) when a new round starts and propagate it according to the network policy (MST method) .

Afterwards, the average value of the remaining values excluding the maximum and minimum values among the random values generated by all nodes is calculated, and this is compared with the random values generated by the nodes, and the node generating the closest value becomes the representative node for the next round. decide Here, the reason for excluding the maximum and minimum values is to prevent damage to fairness due to some malicious acts or collusion in the general price bidding method, and the same is applied to the method of selecting a representative in the blockchain (some malicious nodes Generating the lowest or highest value that can be generated can greatly affect the overall average value, so that the desired node can become a representative with a high probability).

When a representative is selected according to the competitive bidding method, it is impossible to predict a representative for the next round, and since the representative of this round is qualified as a representative of the next round, complete randomness can be maintained.

2 is a flowchart showing an embodiment of a method for selecting a representative and a candidate for a blockchain network according to the spirit of the present invention, which has a form of a process for selecting a representative and a candidate for each round.

The method for selecting the representative and candidate of the block chain network shown includes the step of starting the selection of the representative and candidate of the block chain network (S110); Bidding with a random value at each node (S120); Checking the validity of the bid including the bid participation rate (S140); Excluding the maximum value and the minimum value among bid values when the bidding is closed (S150); and selecting a node that most satisfies the selection conditions as a representative, and then selecting a node that satisfies the selection condition as a candidate (S160).

A round refers to the minimum unit of time in which a number of nodes make a decision according to a certain consensus algorithm in a decentralized distributed system such as blockchain or hashgraph.

In the step of starting the selection of representatives and candidates (S110), selection of representatives and candidates to perform one or a predetermined number of rounds for decision-making of the blockchain network is started. In the latter case, a plurality of rounds determined at once can be regarded as one aggregation round.

In the step S110, the representative or candidate of the corresponding round may instruct bidding for selecting the representative and candidate for the next round, or all nodes may bid for selecting the representative and candidate for the next round as soon as the corresponding round starts.

In the case of the illustrated embodiment, when a new round starts (S110), each node generates a random value and bids, and if more than 2/3 of all nodes participate after a set time, it is recognized as a normal bidding, but not more than 2/3. If not, re-bidding starts (S140). At this time, depending on the implementation, the node to bid in the past may be considered to have participated in the bidding with the value already bid without having to participate in re-bidding. This is a measure to minimize network overhead.

The bid closing criterion in the illustrated step S140 can be set variably according to the network or node operating environment, not 2/3 of all nodes. For example, in the illustrated step S140 , the bidding validity is confirmed only by “participation of 2/3 or more of all nodes”, but other valid conditions may be additionally confirmed in other implementations.

When the bid is closed (S125), the average value of the remaining values excluding the maximum and minimum values among the bid values of the nodes is calculated. Depending on the implementation, if there are multiple maximum or minimum values, only one can be excluded, and a predetermined number of maximum and minimum values to be excluded may be specified instead of one (if the number of nodes is large).

Next, among the bid values of each node, a node that presents the closest value to the calculated average value is selected as a representative (primary node), and then the node that presents the approximate value is designated as a candidate (secondary node) (S160).

That is, in the competitive bidding method according to the idea of the present invention, a random value is generated for each node, shared with each other, and the average of the remaining values excluding the maximum and minimum values among the shared information is calculated, and then the closest random value is obtained based on this. The node that generated is selected as a representative node (S162, S164), and the node that generated the second closest random value is designated as a candidate node (S166, S168).

The candidate responds to the abnormal operation by immediately replacing the representative when the primary node is in an abnormal situation, but ends the role as soon as the round ends. If the bidding according to the present invention is not performed with the start of the next round after the end of the round, the candidate may instruct bidding for the next round.

In the competitive bidding logic at step S160, the representative may be selected based on a value higher (or lower) than the average or similar to the average value, rather than based on the approximate average value of the values excluding the maximum/minimum values.

At this time, if there are two or more nodes that generated the closest random value (No in S162), the previous representative node history is searched (S165), the node with the oldest representative node history is selected as the representative node, and the second oldest By selecting a node with a representative node history as a candidate node, fairness between nodes can be adjusted.

Alternatively, if there are two or more nodes that generated the second closest random value (No in S166), the previous representative node history is searched (S165) and the node with the oldest representative node history is selected as a candidate node to achieve fairness between nodes. can be adjusted. In this case, the shown step S165 is completed, and in FIG. 2 it is omitted.

In the step of initiating the selection of the representative and the candidate (S110), a non-recursive tree topology defining a path for transmitting the bidding and selection results may be configured in the previously selected representative node.

3 is a conceptual diagram showing a method of forming an acyclic topology in constructing a network between blockchain nodes.

The competitive bidding method proposed in the present invention is a method of calculating the average value of all nodes, so a root node that can manage it is required, and the minimum spanning tree technique is used as a way to configure it (the representative of the previous round is the corresponding round serves as the root node). In FIG. 3, Node A (1000) becomes a root node as a representative of the previous round, and based on this, a topology that can be configured with minimum cost is formed (right figure in FIG. 3).

By using the minimum spanning tree method, it is possible to check whether a node is missing in the bidding, induce participation, and minimize network overhead. The minimum cost referred to here is a numerical value quantifying the network delay time, the amount of resources (CPU, memory) of network configuration nodes, and the node error rate. The "minimum spanning tree" has a relatively high complexity, but the complexity does not have a large effect in a dedicated network, which is an environment to which the present invention can be applied. The direction of the arrow in FIG. 3 represents the order of topology configuration, and FIG. 4 shows a bidding process in a state where nodes A, B, and C are formed.

When the "minimum spanning tree" algorithm is applied, an acyclic network topology configurable at a minimum cost can be created in consideration of network delay time, resource amount for each node, and node error rate.

In another implementation, in order to configure the acyclic tree topology, a network shortest path selection method (Dijkstra algorithm) or the like can be applied instead of the minimum spanning tree.

4 is a conceptual diagram illustrating a procedure for sharing (transmitting) a bid value (random value) for selecting a representative and a candidate in a situation where a blockchain node topology is formed.

A node marked as Node A (1000) in FIG. 4 is a root node (also linked to FIG. 3). Node A generates its own random value R _A and one-time private key E _A , calculates V _A according to Equation 1 below, and transmits it to node B.

In the above equation, H denotes a hash function, but may be a function that extracts upper or lower 1/2 bits to reduce the amount of calculation. Also, the E[·] at the end means the encryption algorithm, which means that R _A contained in it is encrypted using the encryption key 'E _A ' at the end. Depending on the situation, a hash function or a 1/2 derivation function can be selectively used.

Node B receives V _A from node A, generates V B using random value R _B and one-time secret key E _B generated by node B, and transmits V _A and _{V B to} node C. Intermediate nodes in the topology perform the same actions as node B. Assuming node C is the last node in the topology in FIG. 4, node C generates only its own random value R _C and transmits it in the reverse order (node C in FIG. 4 → node B). Upon receiving this, node B stores R _C and transmits its own random values R _B and R _C to node A.

Node A calculates the average of the remaining values excluding the maximum and minimum values among all received random values (bid values of each node), and presents the second approximate bid value with the representative node presenting the closest bid value. After selecting one node as a candidate, it transmits it to node B along with its one-time private key E _A (N _P in FIG. 4). Upon receiving this _, node B verifies the bid value of node A using the one-time private key E _A and then verifies the result of selecting the representative and candidate. _B is transmitted to node C along with the results of selecting representatives and candidates. C, the last node, derives R _{A and} R _B from the previously received VA and V _B using E _A and E _B , verifies the result of selecting the representative and candidate, and selects the representative and candidate by accepting them if there is no problem. end the process

Competitive bidding information sharing in the above-described manner is By encrypting its own random value with a one-time secret key in the topology configuration sequence direction and adding a hash value of the random value to prove it, it can protect its own random value from being leaked before the bidding ends. For example, the above Random value leakage can be prevented by encrypting one's own random value with a one-time secret key in the topology configuration order direction and adding the upper 1/2 bit or lower 1/2 bit instead of the hash value of the random value to prove it. .

In addition, the sharing of competitive bidding information in the above-described manner, By transmitting its own random value in the opposite direction of the topology configuration sequence, the receiving side provides information to organize the bidding results, and by transmitting a one-time private key that encrypts its own random value in the topology configuration sequence direction, the receiving side bids Information can be provided so that the results can be verified.

In the above-described competitive bidding information sharing, the representative node of the round, which is the root node at the top in the topology configuration order direction, collects the random values of all nodes together with its own one-time secret key to determine the minimum and maximum values. Except for the calculation of the average value of the remaining random values, and based on this, the result of selecting the representative node and candidate node of the next round is transmitted in the order of topology configuration.

In the above process, since the random value is encrypted and transmitted in the direction of the topology formation order, even if the receiving node generates its own random value after receiving the random value of the sending node, the random value of the sending node cannot be confirmed, so the hiding characteristic can be maintained. there is. On the other hand, the node on the sending side cannot fake the random value sent once with another value. This is because it is almost impossible to find two different input values that produce the same result due to the characteristics of the hash function and the encryption function, so the Binding characteristic can be maintained.

In addition, time information (‘T’ in FIG. 4) is also shared when the representative and candidate selection results are transmitted, which is to promote efficient operation through time synchronization between nodes, assuming that the blockchain operates in a generally asynchronous network. In addition, the time information is necessary information when operating a round in an asynchronous network.

Figure 5 is a block diagram showing an example of a block chain node device that can be each node constituting the block chain network of Figure 1.

The illustrated blockchain node device 1000 may include at least one processor 1100, a network interface 1200, a memory 1300, a display 1400, and an input/output device 1500.

As described above, the illustrated processor 1100 may perform a method for selecting a representative and a candidate of a blockchain network according to the spirit of the present invention together with blockchain node devices of other nodes.

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

As shown, the processor 1100 converts a block generating unit (BLK Generating Unit), a blockchain controlling unit, a block propagating unit, and a block verifying unit into program codes. can be implemented to run The block generator may create a new block required for transaction details. The blockchain control unit can control a new block to be connected to its own blockchain by using the above-described blockchain generation method, in particular, the distributed agreement node selection method. The block propagation unit may propagate the new block to the network in order to verify the validity of the new block connected to the blockchain. The block verifier may receive a block generated by another node forming the network and verify the validity of the received block.

The illustrated network interface 1200 may be implemented to perform communication 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 instructions stored in the memory 1300 are executed in the processor 1100 . The memory 1300 may be a volatile memory or a non-volatile memory.

According to the idea of the present invention constructed according to FIGS. 1 and 5, a blockchain network

It consists of a plurality of nodes that perform data communication with each other through a dedicated network, and is a blockchain network including representative nodes and candidate nodes. Here, the representative node performs a representative selection auction bidding in the next round in a method of random value bidding and maximum and minimum value exclusion, in order to select another representative node to proceed with the next round.

The representative selection auction bidding may be performed by a method for selecting a representative and a candidate of the blockchain network according to the flowchart of FIG. 2 .

The representative selection auction bidding may be performed at the start of each round, or the representative selection auction bidding for the next round may be performed in the last round in charge of the representative node of a specific round. In the latter case, the candidate node of the specific round may perform the representative selection auction bidding for the next round in a situation where the representative cannot proceed with the specific round.

In the representative selection auction bidding, a node that most satisfies the selection conditions is selected as a representative, and a node that meets next is selected as a candidate.

receiving, by the representative node, bid values that are random values from the plurality of nodes for bidding in the representative selection auction; Checking the validity of the bid including the bid participation rate; Excluding the maximum value and the minimum value among bid values when the bidding is closed; and selecting a node that most satisfies the selection conditions as a representative, and then selecting a node that satisfies the next selection condition as a candidate, as shown in FIG. 2 .

In addition, in performing the steps of FIG. 2, the representative node may create a topology of an acyclic tree structure among the plurality of nodes constituting the blockchain network defining an information transmission path for the representative selection auction bidding operation. there is.

The topology of the acyclic tree structure is used as an information transmission path in the representative selection auction bidding process, but may also be used as an information transmission path in block generation and verification processes, depending on implementation.

Each of the plurality of nodes constituting the blockchain network encrypts the information generated by itself or the information received from the previous node to the source side on the topology by using the one-time secret key generated by the node to encrypt the sink side on the topology. It can be passed on to the next node. For example, competitive bidding information is shared by transmitting a one-time private key that encrypts its own random value in the topology configuration sequence direction to provide information so that the receiving side can verify the bidding result.

The representative node leading the representative selection auction bidding may transmit a selection result of the representative selection auction bidding together with information for time synchronization to the plurality of nodes. Then, the plurality of nodes that have received the information for time synchronization can set the start point and end point of the next round according to the information for time synchronization.

6 is a conceptual diagram showing the process of selecting a representative, generating a block, verifying, and forming a chain for each round.

The process of selecting representatives (including candidates) of the first round takes place in the previous round (in FIG. 5, the selection of representatives for round 'n' is completed in the previous round, 'n-1' round). Also, for each round, a block of the corresponding round is created and a verification request process takes place. At the same time, the verification of the block created in the previous round and the chain construction take place. In other words, the process of selecting a representative, generating a block, verifying and forming a chain is processed in parallel rather than serially, and at the same time, message processing is also processed simultaneously in the same payload and procedure, thereby improving speed and reducing network overhead.

In summary, the plurality of nodes constituting the blockchain network generate a block of the corresponding round in each round and request verification, verify the block generated in the previous round to form a chain, and form a representative node for the next round. and candidate nodes may be selected. That is, in the parallel processing process of the private network environment blockchain network, the process of selecting a representative, generating and verifying a block, verifying a block, and forming a chain can be processed in parallel. At this time, network overhead can be reduced by including all processes of block creation, verification request, verification result notification, and representative selection in one message.

In addition, in the parallel processing process of the dedicated network environment blockchain network, if any one of the block generation and verification request, verification result notification, and representative selection process is omitted or an error occurs, it can be retransmitted or passed on to the next step process.

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 characteristics 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 equivalent range should be construed as being included in the scope of the present invention.

For example, in the above description, the selection of block generators (representatives) using the competitive bidding method in a dedicated network and the method of configuring the network topology were described as specific examples, but in the case where a secure network environment between an unspecified small number or a specific number is supported (e.g. VPN) It can also be applied to the Internet network, and this also belongs to the scope of the present invention, of course.

1000: blockchain node device
1100: processor
1200: network interface
1300: memory
1400: display
1500: I/O device

Claims (16)

Initiating the selection of representatives and candidates of the blockchain network;
Bidding with random values in each node constituting the blockchain network;
Checking the validity of the bid including the bid participation rate;
Excluding the maximum value and the minimum value among bid values when the bidding is closed; and
Selecting the node that most satisfies the selection conditions as the representative, and selecting the node that meets the next criteria as the candidate
A method for selecting representatives and candidates for blockchain networks using competitive bidding, including
According to claim 1,
In the step of initiating the selection of representatives and candidates,
A method for selecting representatives and candidates of a blockchain network that initiates the selection of representatives and candidates to perform one or a predetermined number of rounds for decision-making in the blockchain network.
According to claim 1,
The selection conditions are:
A method for selecting representatives and candidates of a blockchain network, characterized in that it is closest to the average value of non-excluded bids.
According to claim 3,
In the step of selecting representatives and candidates according to the selection conditions,
If there are two or more nodes closest to the average value, a method for selecting a representative and candidate of a blockchain network by searching for previous representative node histories and selecting a node with the oldest representative node history as a representative node.
According to claim 1,
said candidate,
A method for selecting a representative and candidate of the blockchain network for performing the method for selecting the representative and candidate of the blockchain network for the next round in a situation where the representative cannot proceed with the round in charge.
According to claim 1,
In the step of initiating the selection of representatives and candidates,
A method for selecting representatives and candidates of a blockchain network constituting an acyclic tree topology defining a path for transmitting the bidding and selection results.
According to claim 6,
The root node of the acyclic tree topology is a node of a previously selected representative or candidate, and a representative and candidate selection method of a blockchain network.
A blockchain network consisting of a plurality of nodes that perform data communication with each other through a dedicated network and includes a representative node and a candidate node,
The representative node,
A blockchain network that conducts a representative selection auction bidding in the method of random value bidding, maximum and minimum value exclusion, in order to select other representative nodes to proceed with subsequent rounds.
According to claim 8,
The candidate node,
A blockchain network that conducts auction bidding for the representative selection for the next round in a situation where the representative cannot proceed with the round in charge.
According to claim 8,
The representative node,
In the last round in charge, the above-mentioned representative selection auction bid for the next round is carried out,
A blockchain network that selects the node that most satisfies the selection conditions as the representative, and selects the node that satisfies the next as the candidate.
According to claim 8,
The representative node,
Receiving random values of round wallets from the plurality of nodes;
Checking the validity of the bid including the bid participation rate;
Excluding the maximum value and the minimum value among bid values when the bidding is closed; and
Selecting the node that most satisfies the selection conditions as the representative, and selecting the node that meets the next criteria as the candidate
A blockchain network that performs a method for selecting representatives and candidates, including
According to claim 8,
The representative node,
A blockchain network constituting a topology of an acyclic tree structure between the plurality of nodes defining an information transmission path for the representative selection auction bidding operation.
According to claim 12,
Each of the plurality of nodes,
A blockchain network that encrypts information generated by itself or information received from a previous node on the source side of the topology using a one-time private key created by itself and forwards it to the next node of the sink side of the topology.
According to claim 8,
The representative node,
A blockchain network that transmits the selection result of the representative selection auction bid to the plurality of nodes together with information for time synchronization.
According to claim 14,
The plurality of nodes receiving the information for time synchronization,
A blockchain network that sets the starting point and ending point of the next round according to the information for time synchronization.
According to claim 8,
The plurality of nodes,
In each round, the blocks of that round are generated and verified,
Blocks created in the previous round are verified to form a chain,
A blockchain network that selects representative nodes and candidate nodes for the next round.

Images