KR102610530B1 - A neural consensus node apparatus for using a non-random consensus proof-based blockchain network as a random consensus proof-based blockchain network, and its operation method - Google Patents

Abstract

A method of operating a node device connected to a non-random consensus proof-based blockchain network, comprising: acquiring new block data propagated through the blockchain network; extracting validation data from the new block data; Acquiring neural consensus designation information for the next block generated based on a random consensus proof process according to the verification processing of the validation data; Based on the neural consensus designation information of the next block, selectively driving the consensus node function to generate validation data of the next block; and constructing the next block by combining the generated validation data and the new block, and disseminating it through the blockchain network.

Description

Neural consensus node apparatus for using a non-random consensus proof-based blockchain network as a random consensus proof-based blockchain network and its operation method {A neural consensus node apparatus for using a non-random consensus proof-based blockchain network as a random consensus proof -based blockchain network, and its operation method}

The present invention relates to a device for building a blockchain network and a method of operating the same. More specifically, the present invention relates to a neural consensus node device and a method of operating the same that uses a non-random consensus proof-based blockchain network as a random consensus proof-based blockchain network.

In general, blockchain is a distributed database that utilizes a P2P (Peer to Peer) network. Distributed database is a technology that physically distributes data and allows multiple users to share a large database. Blockchain is a list of structures that store data, and node terminals participating in the network can jointly record and manage ledger data that stores data and records transaction information through verification.

As an example of blockchain utilization, blockchain can be created by forming a P2P network of node terminals of virtual currency users connected to the Internet. Through this, blocks containing virtual currency transaction details can be managed at the user node terminal and connected to and propagated with new blocks. When a new block is created, the block verified through the consensus algorithm of multiple participants (node terminals) can be linked to the existing block, confirmed as a final ledger containing transaction details, and stored distributedly. Additionally, when a transaction occurs at a participating node terminal, the transaction information verified through validation of the transaction is disseminated to each node terminal. Through this, transaction details, i.e. verified transactions, are propagated and stored distributedly, and when data of some nodes is falsified, the authenticity can be determined based on the distributedly stored transactions. The security stability of blockchain increases as more users share data. In addition to Bitcoin, blockchain is used in various online services such as cloud computing services.

Blockchain technology can reduce transaction costs and prevent data forgery and falsification by changing the existing centralized data management structure to a decentralized or distributed one. Such blockchain technology can create economic value by combining with industries such as finance/medical/content/public/logistics/distribution/energy fields.

Blockchain allows nodes participating in the network to create blocks and spread the generated block information to other nodes. Additionally, nodes that have received new block information can determine and verify the consistency of the new block information. At this time, transaction details that may be included in a newly created block, that is, validation of transactions, can also be performed by nodes participating in the blockchain network.

Additionally, a consensus algorithm can be applied to the blockchain network to ensure the integrity and review the legitimacy of the block information that makes up the ledger managed by participating nodes. Commonly applied consensus algorithms are Proof of Work (PoW), Proof of Stake (PoS), Delegated Proof of Stake (DPoS), and Practical Byzantine Fault Tolerance (PBFT). .

Proof-of-Work (PoW) is a method of suppressing fraud by proving that resources (e.g. computing power, etc.) have been invested for work. In order to participate in proof-of-work (PoW), participating nodes must invest resources. Spam or DoS attacks can also be successful when more than 51% of resources are invested.

Pow requires a unique hash value to create a block, and since the unique hash value is a value that must be found by randomly assigning nonce values, excessive resources such as computing power must be invested to find this unique hash value. In addition, cost and environmental problems arise due to power consumption, and separate chips with intensive functions appear, which may cause centralization problems due to the unification of computing power.

To solve this, PoS (Proof-of-Stake) was proposed, and PoS adopts a method that allows proof in proportion to the node's stake. PoS makes the probability of creating a block proportional to the share of tokens held by each node. If you think of PoS as a resource for investing token shares, it can be seen as a specific type of PoW. The algorithmic formula of PoS can be expressed as ‘PoW using digest’. Compared to PoW, PoS consumes little energy and makes resource concentration difficult.

However, since PoS is a method that becomes more advantageous the more stakes there are, problems with block generation centralization may occur due to stakes, and each node may tend to collect tokens and not use them. Furthermore, since the stake reaches 100% at the genesis block, which is the first block of the blockchain, the person who started the system can recreate the entire block any number of times. As long as each node has a stake, it is possible to start over from that point, so PoS alone cannot prevent forgery.

To solve this problem, Korea Patent Publication No. 10-2019-0122149 discloses a method of selecting a consensus node using nonce. This method uses a fair random consensus, so there is no need for excessive resource use like PoW, and to improve the disadvantage of nodes with many resources monopolizing update rights like PoS, a consensus among all nodes is selected according to the nonce chain. Only some participate in block creation to minimize resource consumption, and it is impossible to predict in advance the nodes that will acquire block creation rights through the nonce proof process, but it is a representative of the probabilistic whole and has the advantage of allowing a certain number of consensus nodes to be selected.

Nevertheless, currently, blockchain networks that have already been established around the world, such as Bitcoin or Ethereum, still use PoW and Pow methods, and private blockchain networks use small nodes such as PBFT to preserve communication efficiency. Since we operate a network in which only those who can participate, even if we build a new network by proposing a new consensus technique, it is very difficult to quickly overcome the waste of resources and social costs caused by the existing blockchain network that has already been built on a large scale. am.

The present invention was created to solve the problems described above, by building a cluster of neural consensus proof modules that use the existing blockchain network based on non-random consensus proof as a random consensus proof-based block chain network, thereby reducing the existing PoW, A device and device that supports the operation of a random consensus proof-based blockchain network based on an existing blockchain network while controlling the existing PoS-type blockchain network to no longer operate in the PoW or PoS method. The purpose is to provide a method of operation.

A method according to an embodiment of the present invention to solve the above-described problem is a method of operating a node device connected to a non-random consensus proof-based blockchain network, wherein new block data propagated through the blockchain network Obtaining a; extracting validation data from the new block data; Acquiring neural consensus designation information for the next block generated based on a random consensus proof process according to the verification processing of the validation data; Based on the neural consensus designation information of the next block, selectively driving the consensus node function to generate validation data of the next block; and constructing the next block by combining the generated validation data and the new block, and disseminating it through the blockchain network.

A device according to an embodiment of the present invention for solving the problems described above is a node device connected to a non-random consensus proof-based blockchain network, and acquires new block data propagated through the blockchain network. , a validation processing unit that extracts validation data from the new block data and obtains neural consensus designation information for the next block generated based on a random consensus proof process according to the validation processing of the validation data; a consensus node function unit that is selectively driven based on the neural consensus designation information of the next block to generate validation data for the next block; and a block chain service unit that configures the next block by combining the generated validation data and the new block and disseminates it through the block chain network.

According to an embodiment of the present invention, by building a neural consensus proof module cluster that uses the existing blockchain network based on non-random consensus proof as a random consensus proof-based blockchain network, existing blocks of existing PoW and PoS methods are built. A random consensus proof-based blockchain network based on an existing blockchain network, controlling the chain network to no longer operate in the PoW or PoS manner, or controlling the operation to be limited according to the minimum number of nodes of the Byzantine fault-tolerant consensus. A node terminal device forming a network that can be operated and a method of operating the same can be provided.

Accordingly, the infrastructure and utility of the existing non-random consensus proof-based blockchain network can be maintained as much as possible while being converted to a random consensus proof-based blockchain network, thereby preventing waste of resources and social costs and improving efficiency. It is possible to provide a device that provides a distributed consensus process based on fair neural consensus proof and a method of operating the same.

Figure 1 is a diagram schematically showing the entire system according to an embodiment of the present invention, and Figure 2 is a diagram for explaining a blockchain network according to an embodiment of the present invention.
Figure 3 is a block diagram illustrating a node device according to an embodiment of the present invention in more detail.
Figure 4 is a conceptual diagram for explaining the neural consensus proof module cluster configuration and overall process according to an embodiment of the present invention.
Figure 5 is a flowchart for explaining a method of operating a node device according to an embodiment of the present invention.
Figures 6 to 9 are diagrams illustrating step-by-step data processed by the consensus proof module node device according to an embodiment of the present invention.
Figure 10 is a flowchart for explaining a method of operating a node device according to another embodiment of the present invention.

The following merely illustrates the principles of the invention. Therefore, those skilled in the art will be able to invent various devices that embody the principles of the present invention and are included in the spirit and scope of the present invention, although not explicitly described or shown herein. In addition, it is understood that all conditional terms and embodiments listed herein are, in principle, expressly intended only for the purpose of ensuring that the concept of the invention is understood, and are not limited to the embodiments and conditions specifically listed as such. It has to be.

Additionally, it is to be understood that any detailed description reciting principles, aspects, and embodiments of the invention, as well as specific embodiments, is intended to encompass structural and functional equivalents thereof. In addition, these equivalents should be understood to include not only currently known equivalents but also equivalents developed in the future, that is, all elements invented to perform the same function regardless of structure.

Accordingly, for example, the block diagrams herein should be understood as representing a conceptual view of an example circuit embodying the principles of the invention. Similarly, all flow diagrams, state transition diagrams, pseudo-code, etc. are understood to represent various processes that can be substantially represented on a computer-readable medium and are performed by a computer or processor, whether or not the computer or processor is explicitly shown. It has to be.

Additionally, the clear use of terms such as processor, control, or similar concepts should not be construed as exclusively referring to hardware capable of executing software, and should not be construed as referring exclusively to hardware capable of executing software, including without limitation digital signal processor (DSP) hardware and ROM for storing software. It should be understood as implicitly including ROM, RAM, and non-volatile memory. Other hardware for public use may also be included.

The above-described purpose, features and advantages will become clearer through the following detailed description in conjunction with the accompanying drawings, and accordingly, those skilled in the art will be able to easily implement the technical idea of the present invention. There will be. Additionally, in describing the present invention, if it is determined that a detailed description of known technologies related to the present invention may unnecessarily obscure the gist of the present invention, the detailed description will be omitted.

Hereinafter, a preferred embodiment according to the present invention will be described in detail with reference to the attached drawings.

Figure 1 is a diagram schematically showing the entire system according to an embodiment of the present invention, and Figure 2 is a diagram for explaining a blockchain network according to an embodiment of the present invention.

First, referring to FIG. 1, the blockchain network system 1000 according to an embodiment of the present invention configures a blockchain network with a mesh network topology by one or more node terminals connected through a wired or wireless network. can do. The node terminals are connected to the blockchain network through input/output devices and can exchange data. The blockchain network system (1000) is a mobile device such as a mobile phone, smart phone, PDA, tablet computer, or laptop computer, a computing device such as a personal computer, tablet computer, or netbook, or an electronic device such as a television, smart television, or security device for gate control. Various electronic systems, such as products, may be included as the node terminal.

Additionally, each node terminal 100 may be equipped with a communication module for accessing the blockchain network. A blockchain network may be implemented as a wired network, for example, a Local Area Network (LAN), a Wide Area Network (WAN), or a Value Added Network (VAN). In addition, blockchain networks include mobile radio communication networks, satellite communication networks, Bluetooth, Wibro (Wireless Broadband Internet), HSDPA (High Speed Downlink Packet Access), Wi-Fi, and LTE (Long Term). It can be implemented in all types of wireless networks such as Evolution). Depending on need, the blockchain network may be a mixed wired and wireless network.

In addition, each node terminal can register account information according to its node connection in the transaction ledger data shared in the cloud through the network. In addition, when a transaction of encryption information is required to create a block chain, each trader terminal can transmit the transaction information to be recorded in the transaction ledger data to each trader terminal.

And, according to the corresponding mutual verification process, the transaction ledger data is updated and the information is shared, so that a transaction of encryption information to create a block chain can be processed.

Here, the transaction ledger data is a block chain having a structure in which a plurality of blocks are connected sequentially according to the order of creation such that the current block includes a hash value for a previously created block for each block corresponding to a certain time or unit ( block chain) data. Accordingly, verification of whether transaction ledger data has been forged or altered can be easily processed by verifying the hash value of the block chain.

The security stability of this blockchain can be formed by the participation of sharers in the system who share data. Therefore, transaction information blocks containing details of sharing between each sharer terminal connected to the blockchain network and details of encryption information issuance/transactions for creating a blockchain can be stored sequentially, and to prevent forgery and alteration. Transaction verification processing to sequentially block hash values can be distributed and performed on each trader's terminal.

In this transaction verification process, as shown in FIG. 2, an existing blockchain network may typically be a non-random consensus proof-based blockchain network. Representative examples include Proof-of-Work (PoW) and Proof-of-Stake (PoS), which may be non-random consensus proof-based blockchain networks (200), and blockchain networks such as Bitcoin and Ethereum. This may apply.

In response to this, the node device 100 according to an embodiment of the present invention can configure a neural consensus proof module cluster, and the neural consensus proof module cluster combines neural consensus validation data based on a random consensus proof method. A new block can be formed, and the constructed new block can be processed to be propagated through the non-random consensus blockchain network 200.

Accordingly, in the non-random consensus blockchain network 200, the re-propagated block data is shared within the network, and can be processed to generate the next block again by the node device 100 constituting the neural consensus proof module cluster. there is. Since separate proofs such as PoW and PoS are not required in this process, it is possible to build a new random consensus blockchain network system (1000) that can implement decentralization in a non-competitive manner.

That is, according to an embodiment of the present invention, a node device ( 100), controlling the existing blockchain network to no longer operate in the PoW or PoS method, or controlling it to operate in a limited manner according to the minimum number of nodes of the Byzantine fault-tolerant consensus. , It is possible to provide a node terminal device 100 that forms a network that allows a random consensus proof-based blockchain network based on an existing blockchain network to be operated.

Accordingly, the infrastructure and utility of the existing non-random consensus proof-based blockchain network can be maintained as much as possible while being converted to a random consensus proof-based blockchain network, thereby preventing waste of resources and social costs and improving efficiency. It can provide a distributed consensus process based on fair neural consensus proof. Here, the nonce chain and hash confirmation process based on one-time random numbers may be used to prove participation in the random consensus, but this is only an example, and designation of the random consensus or proof of participation credentials may be possible in various other ways.

More specifically, referring to FIGS. 3 and 4, FIG. 3 is a block diagram illustrating a node device according to an embodiment of the present invention in more detail, and FIG. 4 is a neural consensus proof module cluster according to an embodiment of the present invention. This is a conceptual diagram to explain the composition and overall process.

The node terminals 100 of the blockchain system 1000 according to an embodiment of the present invention may be included in a neural consensus proof module cluster for configuring the next block by a random node selection process, and this neural consensus proof module cluster may each include a neural consensus verification module 110 for performing a random consensus verification process according to an embodiment of the present invention.

In addition, the node terminal 100 is connected to the non-random consensus blockchain network 200, and processes the shared propagation process of the next block constructed by the random consensus proof process through the non-random consensus blockchain network 200. It may include a blockchain service unit 120 that performs through.

Accordingly, in an embodiment of the present invention, the node terminals 100 participate in the non-random consensus blockchain network 200 and are selected through a random consensus selection process to selectively have the authority to create each block according to consensus agreement. These may be assigned node terminals 100, through which a random consensus blockchain network system 1000 can be independently built.

In addition, as shown in FIG. 4, the node terminals 100 perform the functions of the fourth node terminal as a general node, the third node terminal as a participating node, the second node terminal as a council node, and the first node terminal as a committee node. It can be performed optionally.

Neural consensus proof mode cluster can be built based on a third node terminal, which is a terminal registered as a participating node. The participating node, which is the third node terminal, can verify participation qualifications based on the next consensus body selection information confirmed in the consensus validation data of the newly propagated block, and the second node terminal determines whether to select a council node based on the verification results. It may be a terminal that verifies and processes the operation of the parliamentary node function. The first node terminal may be a terminal that processes committee node function operations by confirming whether the committee node is selected according to the verification result.

In the case of the node terminal 100 selected as a council node, a candidate block presentation and consensus process can be performed like the second node terminal shown in FIG. 4, and in the case of the node terminal 100 selected as a committee node, consensus By determining the block and collecting signature information, the process of constructing and distributing consensus validation data for the next block can be performed. Here, consensus body validation data may include consensus process verification data, multi-signature information, and next consensus body selection information, which may be disseminated through the previously established non-random consensus blockchain network 200.

According to this new block composition and propagation processing, the proof process of the existing non-random consensus blockchain network (200) may be limited, and there may be exceptional cases where the number of some nodes falls below the number set based on the Byzantine Tolerance (PBFT) threshold. Only in this case can generation of the next block based on Pow or Pos proof between node terminals 100 be processed.

Meanwhile, the participation qualification and verification information of the node terminal 100 can be calculated and mutually disclosed and verified based on a random value calculated for each individual node according to the participation node registration, which is a nonce as described above. A chain may be used. For example, depending on the value of its qualification verification value based on hash processing using the nonce value included in the next consensus body selection information and the height value of the current block, the node terminal 100 may be selected as a participating node, a congress node, or It may be determined to be at least one of a committee node or a chairman node.

In addition, as shown in FIG. 3, the node terminal 100 according to an embodiment of the present invention includes a device information setting unit 111, a node information setting unit 112, a validation processing unit 113, and a qualification verification processing unit ( 114), and includes a consensus node function unit 115 and a data interface unit 116.

The device information setting unit 111 acquires, stores, and manages device information of the terminal 100 on which the neural consensus verification module 110 is installed. Here, the device information may include at least one of node name information of the terminal 100, device address information, device performance information, device reliability information, and network information in use. This device information can be used to identify or build a neural consensus proof module cluster, perform a voting consensus process, etc.

The node information setting unit 112 sets node information for registering the non-random consensus blockchain network 200 and participating nodes. The set node information may include blockchain network client address information, and the terminal 100 can acquire or share block information by accessing the blockchain network through the blockchain network client address information.

The validation processing unit 113 acquires new block data propagated through the non-random consensus blockchain network 200, extracts validation data from the new block data, and performs verification processing of the validation data. , Obtain the neural consensus designation information for the next block generated based on the random consensus proof process.

In addition, the consensus node function unit 115 is selectively driven based on the neural consensus designation information of the next block to generate validation data for the next block, and the chairman node function unit 1151 and the council node function unit ( 1152), at least one of the committee node function unit 1153 may be selectively driven. The chairman node function unit 1151 may be selectively driven by comparing the neural consensus designation information with at least a portion of the nonce value of the designated node terminal 100, but the present invention is not limited to this selection method.

First, the chairman node function unit 1151 is capable of performing a chairman process corresponding to the congress and committee nodes, and receives delegation information and participation qualification verification information of valid transaction blocks taken from the transaction pool of the blockchain network from the congress nodes. , information on candidates for the next block consensus can be collected. Accordingly, more than 3f + 1 (f is a natural number) council nodes can be selected for the next block, and more than 2f + 1 committee nodes can be selected.

In addition, the council node functional unit 1152 is a node terminal 100 on which the chairman node functional unit 1151 is driven, and the delegation information and participation qualifications of valid transaction blocks taken from the transaction pool of the non-random consensus blockchain network 200 Verification information can be transmitted.

In addition, the chairman node function unit 1151 selects a block that matches more than the consensus quorum of the council nodes among the transaction blocks proposed by the council nodes as a candidate block, and processes partial signatures in the multi-signature area indicating consensus on the candidate block. A message requesting can be delivered to the node terminals 100 in which the committee node function unit 1153 is driven. For example, the chairman node functional unit 1151 determines a transaction data candidate block that matches f+1 of 2f+1 transaction data candidate blocks, and processes partial signatures in the multi-signature area with the committee node functional unit 1153. A message requesting a message can be transmitted, and the node terminal 100 in which the committee node functional unit 1153 is driven processes a partial signature indicating the agreement corresponding to the candidate block, and the chairman node functional unit 1151 is driven. It can be transmitted to the node terminal 100.

Accordingly, the chairman node functional unit 1151 verifies the candidate block for which multi-signature processing has been completed according to the committee agreement and determines it as a distribution block, generates validation data corresponding to the consensus process, combines it with the distribution block, and creates a new Create a block.

The data interface unit 116 may convert the generated new block into the format of the non-random consensus blockchain network 200 and transmit it to the blockchain service unit 120.

In addition, the blockchain service unit 120 can process the new block to be propagated through the non-random consensus blockchain network 200, and the new block is not only propagated through the non-random consensus blockchain network 200. In addition, depending on the operation of the transaction data management unit 121, it may be added to the transaction data memory pool (mem pool).

Meanwhile, although not shown, the node terminal 100 device may include memory that can be utilized by the above-described blockchain service unit 120 and the neural consensus verification module 110. The memory may include instructions that can be read by a computer, and the blockchain service unit 120 and the neural block module 110 can perform the aforementioned operations as the instructions stored in the memory are executed on the processor. there is. The memory may be volatile memory or non-volatile memory.

The memory may include a storage device to store user data. The storage device may be an embedded multimedia card (eMMC), solid state drive (SSD), or universal flash storage (UFS). The storage device may include at least one non-volatile memory device. Non-volatile memory devices include NAND Flash Memory (NAND FlashMemory), Vertical NAND (VNAND), NOR Flash Memory (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. It can be.

Figure 5 is a flowchart for explaining the operation method of the node terminal 100 according to an embodiment of the present invention.

Referring to FIG. 5, when new block data propagated through the pre-established non-random consensus blockchain network 200 is obtained (S101), the node terminal 100 according to an embodiment of the present invention uses a validation processing unit. In (113), validation data is extracted from the new block data, and consensus designation information is obtained according to the verification process of the validation data (S103).

According to the verification processing of the validation data, the validation processing unit 113 can specify the neural consensus body of the next block generated based on the random consensus body verification process. As described above, the validation data is the random consensus body. It may include consensus process verification data corresponding to the proof process.

For example, consensus process verification data is membership verification information of a congress node that processes consensus on transaction data, and includes multi-signature data formed by combining nonce chain-based credential hash data and partial signatures of the congress node. can do. Additionally, the neural consensus designation information for the next block may include nonce information for verifying the participation qualifications of the neural consensus corresponding to the next block.

Afterwards, the node terminal 100 determines whether it has been selected as a node constituting the neural consensus proof cluster node for the next block (S107), and if selected, confirms whether it is a chairman node based on the consensus designation information (S109).

If it is not designated as a chairman node, the delegation information and participation qualification verification information of a valid transaction block taken from the transaction pool of the blockchain network can be delivered to the council chairman node according to each qualification (S113).

Accordingly, the node terminal 100 in which the chairman node function unit 1151 is driven can collect delegation information and next block consensus candidate information from other nodes (S115).

In addition, the node terminal 100 in which the chairman node functional unit 1151 is driven determines the candidate block agreed upon by the node terminal 100 in which the congress node functional unit 1152 is driven, and the multiplex signal representing the consensus on the candidate block is determined. A message requesting partial signature processing of the signature area is delivered to the committee member node (S117).

Then, the node terminal 100 in which the chairman node function unit 1151 is driven verifies the candidate block for which multi-signature processing has been completed according to the committee agreement and determines it as a distribution block (S119), generates validation data, and combines it with the distribution block. creates a new block (S121), registers the combined new block in the transaction pool of the non-random consensus blockchain network (200), and creates a new block through the previously established non-random consensus blockchain network (200). Spread it (S123).

Figures 6 to 9 are diagrams illustrating step-by-step data processed by the consensus proof module node device according to an embodiment of the present invention.

Figure 6 illustrates the delegation information delivered to the chairman node at the delegation request stage for composing the current block. The delegation information includes a nonce value corresponding to the current block height and the Qi that each council node wishes to use for multi-signature. Value information, transaction data, next consensus council candidate information, and nonce value of the next block height may be included.

And, Figure 7 illustrates the candidate block information transmitted from the chairman node to the committee node in the preparation stage. The candidate block information includes header information including the Merkle root, candidate block transaction data, council designation information of the next consensus body, and multiple It may include signature request data (Q data incorporating Qi, public key Pk) and verification data. Verification data may be, for example, bitmap information that can identify server information that proposed transaction data, which can prevent cases such as those proposed by the chairman node itself in advance.

In addition, Figure 8 illustrates partial signature data propagated from the committee node to the chairman node in the process of committee verification, and the chairman node can calculate the signature completed data S by integrating the partial signature data Si.

Meanwhile, Figure 9 shows the configuration of a new block generated and propagated according to an embodiment of the present invention. The new block may include header information, transaction block information, and validation data. As described above, validation data may include information on designating the next consensus body, completed multi-signature information, and various information that can prove the consensus process and participation qualifications. Additionally, header information may also include MerkleRoot values to verify the validity of the block data itself.

Accordingly, the validation processing unit 113 can first verify the consensus process by first checking the multi-signature information, and then perform secondary verification by checking whether the Merkle root value of the header is normal, and then verify again using the transaction block information. By performing third verification by comparing with the calculated Merkle root value, safe transaction block processing is possible.

Figure 10 is a flowchart for explaining a method of operating a node terminal device according to another embodiment of the present invention.

Referring to FIG. 10, the node terminal 100 according to another embodiment of the present invention first identifies the number of council and committee nodes of the next neural consensus (S201).

In addition, the node terminal 100 determines whether the preset consensus quorum is not met according to the minimum allowable number of nodes for Byzantine tolerance.

For example, the consensus quorum can be determined by the maximum Byzantine number (maximum allowed number of malicious nodes) that can be selected by node selection probability P, corresponding to the number of participating nodes N, and the congress nodes have at least 3f+1 (f is a natural number), and there must be at least 2f+1 committee nodes to satisfy the consensus quorum.

If the number of consensus nodes is less than the quorum of the neural consensus assembly and committee preset according to the minimum allowable number of Byzantine tolerance nodes, the node terminal 100 may use the PoW (Proof of Work) or Selective exception processing is performed using Pos (Proof of stake) method (S205).

On the other hand, if the number of consensus nodes is more than the quorum of the neural consensus assembly and committee preset according to the minimum allowable number of Byzantine tolerance nodes, Proof of Work (PoW) or Proof of stake (Pos) of the non-random consensus proof-based blockchain network ) The process can be limited, a neural consensus can be formed using the process of FIG. 5 described above, and validation data can be configured to create and propagate a new block (S203).

The methods according to an embodiment of the present invention described above can be produced as a program to be executed on a computer. Additionally, the program may be stored in a computer-readable recording medium, and examples of computer-readable recording media may include ROM, RAM, CD-ROM, magnetic tape, floppy disk, and optical data storage devices. there is.

The computer-readable recording medium is distributed in a computer system connected to a network, so that computer-readable code can be stored and executed in a distributed manner. And, functional programs, codes, and code segments for implementing the method can be easily deduced by programmers in the technical field to which the present invention pertains.

In addition, although preferred embodiments of the present invention have been shown and described above, the present invention is not limited to the specific embodiments described above, and the technical field to which the invention pertains without departing from the gist of the present invention as claimed in the claims. Of course, various modifications can be made by those skilled in the art, and these modifications should not be understood individually from the technical idea or perspective of the present invention.

Claims (16)

In a method of operating a node device connected to a non-random consensus proof-based blockchain network,
Obtaining new block data propagated through the blockchain network;
extracting first validation data from the new block data;
Acquiring neural consensus designation information for the next block generated based on a random consensus proof process according to the verification processing of the first validation data;
Based on the neural consensus designation information of the next block, selectively driving the consensus node function to generate second validation data of the next block; and
Propagating the next block containing the second validation data through the blockchain network,
The first validation data includes neural consensus designation information for the next block,
The step of generating the second validation data includes:
determining whether the node device has been selected as a node constituting a neural consensus proof cluster corresponding to the next block;
When selected as the constituting node, confirming whether the node device is a chairman node of the neural consensus verification cluster based on the neural consensus designation information of the next block;
If the node device is the chairman node, determining a distribution block by verifying a candidate block for which multi-signature processing has been completed according to an agreement of committee nodes; and
Generating the second validation data by the consensus node function,
The step of propagating through the blockchain network is,
combining the second validation data and the distribution block to generate the next block; and
Containing the step of converting the next block into the format of the blockchain network and disseminating it through the blockchain network,
How the node device works. According to paragraph 1,
The first validation data is,
Containing consensus process verification data corresponding to the random consensus verification process
How the node device works. According to paragraph 2,
The consensus process verification data is,
Containing multi-signature data formed by combining member verification information of a congress node that processes consensus on transaction data and partial signatures of the congress node
How the node device works. According to paragraph 1,
The neural consensus designation information for the next block includes nonce information for verifying the participation qualifications of the neural consensus corresponding to the next block.
How the node device works. According to paragraph 1,
The non-random consensus proof-based blockchain network is a PoW (Proof of Work) or Pos (Proof of stake) type blockchain network.
How the node device works. According to clause 5,
Identifying the number of consensus nodes identified from the neural consensus designation information of the next block; and
If the number of consensus nodes is less than the quorum of the neural consensus assembly and committee preset according to the minimum allowable number of Byzantine tolerance nodes, the second validation data is formed using the PoW (Proof of Work) or Pos (Proof of stake) method. which further includes an optional exception handling step that causes
How the node device works. According to clause 6,
If the number of consensus nodes is more than the quorum of the neural consensus assembly and committee preset according to the minimum allowable number of Byzantine tolerance nodes, the PoW (Proof of Work) or Pos (Proof of stake) process of the non-random consensus proof-based blockchain network further includes the step of limiting
How the node device works. delete In a node device connected to a non-random consensus proof-based blockchain network,
By acquiring new block data propagated through the blockchain network, first validation data is extracted from the new block data, and according to verification processing of the first validation data, the following is generated based on a random consensus proof process. A validation processing unit that obtains the neural consensus designation information of the block;
a consensus node function unit that is selectively driven based on the neural consensus designation information of the next block to generate second validation data of the next block; and
A block chain service unit that propagates the next block including the second validation data through the block chain network,
The first validation data includes neural consensus designation information for the next block,
The consensus node function unit is,
It is determined whether the node device has been selected as a node constituting the neural consensus proof cluster corresponding to the next block, and if selected as a node constituting the neural consensus body, the node device is selected as the neural consensus body based on the neural consensus designation information of the next block. Check whether the node device is the chairman node of the proof cluster, and if the node device is the chairman node, determine the distribution block by verifying the candidate block for which multi-signature processing has been completed according to the agreement of the committee nodes,
The blockchain service department,
Combining the second validation data and the distribution block to generate the next block, converting the next block into the format of the blockchain network and disseminating it through the blockchain network,
Node device. According to clause 9,
The first validation data is,
Containing consensus process verification data corresponding to the random consensus verification process
Node device. According to clause 10,
The consensus process verification data is,
Containing multi-signature data formed by combining member verification information of a congress node that processes consensus on transaction data and partial signatures of the congress node
Node device. According to clause 9,
The neural consensus designation information for the next block includes nonce information for verifying the participation qualifications of the neural consensus corresponding to the next block.
Node device. According to clause 9,
The non-random consensus proof-based blockchain network is a PoW (Proof of Work) or Pos (Proof of stake) type blockchain network.
Node device. According to clause 13,
Identify the number of consensus nodes identified from the neural consensus designation information of the next block,
The consensus node function unit, when the number of consensus nodes is less than the quorum of the neural consensus assembly and committee preset according to the minimum allowable number of nodes for Byzantine tolerance, the second validation data is provided as Proof of Work (PoW) or Proof of Work (PoW). of stake) method to perform selective exception handling.
Node device. According to clause 14,
The consensus node function unit is,
If the number of consensus nodes is more than the quorum of the neural consensus assembly and committee preset according to the minimum allowable number of Byzantine tolerance nodes, the PoW (Proof of Work) or Pos (Proof of stake) process of the non-random consensus proof-based blockchain network is limiting
Node device. delete