KR20210019922A - Error-correction code based crypto currency system - Google Patents

Abstract

According to one embodiment of the present invention, a mining device in a mining device creating a block when a transaction occurs and performing proof-of-work through a proof-of-work consensus mechanism to form blockchain includes a mining difficulty determination unit monitoring a blockchain system and deciding to increase or decrease the mining difficulty. The mining device includes a control unit creating a block according to the applied mining difficulty determined by the mining difficulty determination unit to complete the proof of work and a network unit broadcasting the created block to other mining devices.

Description

Error-correction code based crypto currency system}

The present invention relates to a cryptocurrency system. Specifically, it relates to a cryptocurrency system including a mining device that generates a block and verifies it through an improved proof-of-work algorithm.

In 2009, a blockchain-based cryptocurrency emerged from Bitcoin[1] developed by Satoshi Nakamoto. Blockchain is a distributed data processing technology for public distributed ledgers. Peer-to-Peer (P2P) transaction data is recorded in blocks, which form a linked list of blocks (that is, a chain). Each user on the network stores the entire data in a distributed manner without central authority. Since each block in the blockchain constitutes a blockchain containing the hash value of the previous block, it makes it very difficult to manipulate transactions in a blockchain-based cryptocurrency.

To maintain a single blockchain in a large-scale P2P network, a distributed consensus mechanism is needed to ensure system integrity by mutually verifying results between peer nodes. This consensus mechanism should be able to determine who created the new block and whether the chain is valid.

Bitcoin is a representative cryptocurrency that uses the Proof-of-work (PoW) [2] algorithm. Proof-of-work is the most commonly used consensus algorithm in blockchain-based cryptocurrencies. In short, computing power is used to reach consensus by finding and checking hash values that meet specific requirements. Proof-of-work is the process of finding a nonce value that makes the block hash value smaller than the target value. Nonce is one of the information specified in the block header. A nonce set, which is a set of nonce values, is defined, and a nonce value is selected one by one from the nonce set and assigned to the hash function. At this time, the nonce value used once is excluded from the nonce set and is not used again. When a hash value that satisfies the above requirements is found in a specific nonce value, the corresponding nonce value is recorded and inserted into the block header to generate a block. This series of processes is called proof of work. In the proof-of-work process, the target value represents the difficulty of calculating the nonce value, and is adjusted to generate a single block every 10 minutes on average.

[1] Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system. Consulted, 1: 2012, 2008. [2] Dwork, Cynthia; Naor, Moni (1993). "Pricing via Processing, Or, Combatting Junk Mail, Advances in Cryptology". CRYPTO'92: Lecture Notes in Computer Science No. 740. Springer: 139-147. [3] Harald Vranken, in Current Opinion in Environmental Sustainability, 2017, 28: 1-9 [4] https://www.asicminervalue.com/miners/ebang/ebit-e10 [5] Henri Gilbert, Helena Handschuh: Security Analysis of SHA-256 and Sisters. en:Selected Areas in Cryptography 2003: pp175-193

The method of operating a mining device according to an embodiment of the present invention is to solve the re-centralization occurring in the existing proof-of-work-based cryptocurrency.

In addition, the method of operating a mining device according to an embodiment of the present invention is to solve a problem that may occur by monopolizing hash power by a small number of miners due to the advent of ASICs.

In addition, a method of operating a mining device according to an embodiment of the present invention is to propose a method of operating a mining device in which mining difficulty can be adjusted and an input value is changed for each block.

In addition, according to an embodiment of the present invention, since the difficulty of mining can be finely adjusted, a mining apparatus and a method of operating the mining apparatus are proposed to maintain a more robust code-cryptocurrency system.

In addition, according to an embodiment of the present invention, it is proposed a mining apparatus and a method of operating the mining apparatus which can suppress malicious miners by finely adjusting the mining difficulty according to the state of the code-cryptocurrency system. .

A mining apparatus according to an embodiment of the present invention includes a mining difficulty determination unit that monitors the blockchain system and determines to increase or decrease the mining difficulty, and generates a block according to the applied mining difficulty determined by the mining difficulty determination unit. A control unit that completes proof of work; And a network unit for broadcasting the generated block to another mining device.

The method of operating a mining apparatus according to an embodiment of the present invention is an algorithm that is almost impossible to implement with an ASIC chip, and can solve re-centralization occurring in a proof-of-work-based cryptocurrency system.

In addition, the operation method of the mining device according to an embodiment of the present invention may restore the nature of a blockchain-based cryptocurrency through re-centralization solution to restore transaction credit and currency credit.

In addition, the operation method of the mining apparatus according to an embodiment of the present invention may adjust the difficulty of proof of work as necessary.

In addition, in the operating method of the mining apparatus according to an embodiment of the present invention, since the mining difficulty can be adjusted finely, the monopoly of the cryptocurrency to be mined can be prevented and the mining of malicious cryptocurrency can be prevented.

1 shows a general block and a block chain to which blocks are connected.
2 is a flowchart showing an improved proof-of-work algorithm according to an embodiment of the present invention.
3 shows the codeword and condition set described above.
4 is a flowchart illustrating a verification process of a mining apparatus according to an embodiment of the present invention.
5 is a diagram illustrating a method of adjusting the mining difficulty in the proof-of-work algorithm according to an embodiment of the present invention through an 8 by 16 check matrix.
6 is a block diagram showing a mining apparatus according to an embodiment of the present invention.
7 is a graph showing fine adjustment of the mining difficulty by using four check metrics.
8 is a flowchart illustrating a proof-of-work algorithm that satisfies an improved condition according to another embodiment of the present invention.
9 is a block diagram showing a mining apparatus according to another embodiment.
10 is a view showing in detail the mining difficulty determination unit.

Hereinafter, specific embodiments of the present invention will be described in detail with reference to the drawings. However, the spirit of the present invention is not limited to the following embodiments, and those skilled in the art who understand the spirit of the present invention can easily add, change, delete, and add components to other embodiments included within the scope of the same idea. It may be suggested, but it will be said that this is also included within the scope of the inventive concept.

In the accompanying drawings, in explaining the overall structure in order to easily understand the spirit of the invention, minute parts may not be specifically expressed, and when describing the minute parts, the overall structure may not be specifically reflected. In addition, even if specific parts such as the installation location are different, if the action is the same, the same name is given, so that the convenience of understanding can be improved. In addition, when there are a plurality of identical configurations, only one configuration will be described, and the same description will be applied to other configurations, and the description will be omitted.

Before explaining the present invention, the proof of work performed in the blockchain-based cryptocurrency is briefly described, and related terms are briefly defined.

1 shows a general block and a block chain to which blocks are connected.

Block chain (2) is a form in which a number of blocks (1) are connected.

Block 1 is a bundle of a number of valid transaction information.

The block header 3 displays block information. The block header contains the hash value of the previous block.

The block hash (4) is a value obtained by calculating the block header with a hash function. Here, the hash function is a function that maps data of an arbitrary length to data of a fixed length.

In the proof-of-work algorithm, as described above, the block hash and the target value are compared to determine whether the proof-of-work is successful. Specifically, proof-of-work is performed at a so-called peer node, and each peer node determines whether a value smaller than the target value appears by calculating a hash while changing the nonce value among the header information.

Here, the peer node is also referred to as a miner or mining device, and means a computing device or a set of computing devices that perform proof of work. For example, the computing device could be a computer with a high-performance graphics card and processor.

The peer node changes the nonce until the block hash is less than the target value, and if the block hash is less than the target value, it is judged as a proof-of-work success and all transactions included in the block are confirmed as valid transactions. And when a valid block is created, the peer node broadcasts the created block to the entire network, and when it is approved by other peer nodes and added to the blockchain, the transaction is completed.

Here, a block can be created at the same time in several peer nodes and the chain can be branched. At this time, the peer nodes reach consensus using a predetermined consensus algorithm and expand the consensus chain. For example, the Bitcoin consensus mechanism considers only the longest chain to be the correct chain.

Bitcoin, the above-described proof-of-work-based cryptocurrency, has several problems.

First, it consumes too much power for proof of work [3]. The difficulty of the crypto puzzle, the so-called mining difficulty, is gradually increasing because the number of companies participating in bitcoin mining increases, and the hash power of the entire mining network increases. The higher the hash power, the faster the proof-of-work speed and consequently the faster the speed of generating blocks. The Bitcoin protocol aims to fill the block generation time by one block every 10 minutes on average. To this end, the bitcoin protocol reconstructs the hash difficulty level every 2016 block [1]. Therefore, as the hash power increases, the difficulty level increases. Due to this, more power is consumed for mining.

The greater the number of miners for cryptocurrency, the better the protection against possible attacks, so it helps to maintain blockchain immutability and credibility of cryptocurrency. In the early stages of the Bitcoin network (2010-2013), even ordinary people using home computers were able to perform Bitcoin's proof of work.

However, as time went by, it was not possible to quickly perform proof-of-work with only the computing power of a home computer, and as computing platforms for bitcoin mining recently reached ASICs from GPUs and FPGAs, few miners monopolize computing power. Is appearing. Through this, the Bitcoin network has been centralized, moving away from decentralization, the identity of the Bitcoin blockchain. Therefore, as the possibility of the blockchain being altered by a small number of miners with overwhelming computing power is emerging, it is the time when public trust in the blockchain is collapsing.

As a cause of the problem of re-centralization of all Proof-of-Work-based blockchain networks including Bitcoin, there is limited availability of crypto puzzles. The proof-of-work method in the bitcoin consensus mechanism is based on a fixed hash function (e.g. SHA-256) algorithm, resulting in an ASIC chip optimized for the Bitcoin proof-of-work algorithm [4]. The ASIC chip is relatively expensive, but the hash power of the few miners who mine through the ASIC chip is optimized for proof of work in Bitcoin, which accounts for a large portion of the hash power of the entire network, and has overwhelming mining influence. I got it.

Therefore, a new proof-of-work algorithm is required to solve the re-centralization of such a blockchain network. The new proof-of-work algorithm is required to meet the following requirements.

1) The puzzle should be difficult to solve, but on the contrary, the check should be easy.

2) The puzzle must have solid resistance from external attacks.

3) The nonce value of the solved puzzle is not reused.

4) The difficulty level of the puzzle must be adjustable.

5) Anyone who has a CPU should be able to participate in proof-of-work.

Hereinafter, a proof-of-work algorithm in an improved PoW-based blockchain network according to an embodiment of the present invention that satisfies the above-described requirements will be described. One of the improved requirements

6) The function used for proof-of-work must be able to change by changing every block.

to be.

2 is a flowchart showing a proof-of-work algorithm that satisfies an improved condition according to an embodiment of the present invention.

The proof-of-work algorithm described in FIG. 2 may be performed through the above-described mining device, and specifically, may be performed in a processor such as a CPU provided in the mining device.

The mining device obtains a data value for proof of work from the current block header (S1001). Here, the current block refers to a block that the miner currently wants to create, and it is a block that has not been connected to the chain because proof-of-work has not been completed. The block header included in the block chain may include one or more pieces of information about the block. The information included in the block header may include at least one of version information, difficulty level information, timestamp information, nonce information, hash value information of a previous block, or transaction set information.

이고

이 될 수 있다. 채굴 장치는 현재 블록 인덱스 t (양의정수) 에서 이전 블록의 해쉬 값(h_t-1)을 이용하여 체크 매트릭스(F_t)를 생성할 수 있다. 여기에서 체크 매트릭스의 생성은 부호이론 분야에서 일반적으로 알려진 것을 사용할 수 있다.The mining apparatus generates a check matrix based on the first value included in the acquired data value (S1003). Here, the first value used to generate the check matrix may be a hash value of the previous block. _{The check matrix may be an N c-} N _m by Nc matrix composed of elements of Galois Field GF(q) (0 or 1 binary element when q = 2). chamberlain

ego

Can be The mining apparatus may generate the check matrix F _{t by using the hash value h t -1} of the previous block at the current block index t (positive integer). Here, for the generation of the check matrix, one generally known in the field of code theory can be used.

The mining device generates a hash tree based on the second value included in the acquired data value (S1005). Here, the second value used to generate the hash tree may be transaction set information. In an embodiment, the mining device may generate a hash tree value based on the second value.

The mining apparatus generates an input set S based on the generated hash tree and the third value included in the acquired data value (S1007). The third value used herein may be at least one of version information, difficulty level information, or timestamp information of a previous block. Also, other information included in the block header may be additionally used as the third value.

The mining device applies the input set to the hash function to obtain a result vector r (S1009). The hash function used here may be the SHA 256 [5] function, and other functions whose security has been verified may be used. At this time, the mining device generates a result vector that is an output of the hash function for a specific nonce value.

The mining apparatus applies the result vector r as an output of the hash function and the check matrix generated in step S1003 as input values to the decoding function (S1011). The mining apparatus may obtain an output word (c^) as an output value of the decoding function.

Here, the decoding function is a function that creates a unique output value for one input value, such as a decoder for Error-Correction Code, a Sphere-Decoding signal receiver for communication theory, a Sparse signal restoration algorithm for compression sensing, or an algorithm for solving an inverse problem in mathematics. Can be used.

As a preferred embodiment, when a decoding function for error correction coding is used, the Error-Correction Code is used when a transmitter and a receiver communicate through a Noisy channel. The word received through the Noisy channel is different from the transmitted word due to an error generated by the channel. An error correction code is used to catch and correct this error. The transmitter generates a codeword by 1-to-1 mapping, that is, encoding a message vector, and transmits the generated codeword to the receiver instead of the message vector. The receiver can remove the error occurring in the channel by decoding the received word including the received error. When the received word is input, a decoder or decoding function is called a decoding function that recovers the transmitted codeword by solving the inverse problem of the encoding function.

In order to create a margin to eliminate errors by itself, the size of the codeword vector N _c is made longer than the size of the message vector N _m. And, R = N _m /N _c is called a code rate. The smaller the code rate, the more robust it is to channel errors; But decoding requires more computing.

The present invention shows an example of the invention that the decoder used in the Error-Correction Code is applied to the proof of work. The Decoder function is combined with a cryptographic function such as SHA-256 to create a composite function. That is, the output value of the cryptographic function is put as one of the input values of the decoding function.

In proof-of-work, it is very difficult to find the input value of the synthesized function, that is, the nonce value, in which the output word of the synthesized function satisfies the given condition, but it is easy to verify whether the found codeword value meets the condition. Therefore, the synthesis function created in this way satisfies 1) of the requirements of the proof-of-work algorithm. In a preferred embodiment, graph-decoder may be used as the decoding function. In addition, as an additional decoding function, an algorithm capable of the fastest codeword mapping in the linear graph-decoder field may be used.

The mining device determines whether the acquired output word of the decoder satisfies a preset condition (S1013). The mining apparatus has a condition set for the mapped output word in advance, and determines whether the output word value obtained in step S1011 is a code word and, if it is a code word, whether or not a preset condition set is satisfied.

3 shows the codeword and condition set described above.

As an example in FIG. 3, there are 2 ²⁵⁶ vectors (for example, the output of the SHA function), of which ^{about 2 64} codewords exist at a 1/4 code rate. When a vector is input to the decoding function Dec(), it is mapped to one output word. Here, the mining device determines whether the mapped output word is a codeword included in the condition set.

It comes back to FIG. 2 again.

As described above, when the mapped output word satisfies the condition set, the mining device determines that proof-of-work has been completed, creates a new block while recording the current nonce value, and broadcasts it to other mining devices (S1017). . Therefore, in contrast to determining whether the proof of work is completed only with the output value of the hash function in the existing proof of work in Bitcoin, the process of verifying the output word value using a decoding function is added. A problem that may occur in a standardized algorithm (using ASIC Re-centralization).

In other words, in the proof-of-work algorithm using the synthesis function according to an embodiment of the present invention, since the check matrix, which is one of the inputs of the decoder part, can be changed for each block, a different decoder puzzle must be performed for each block as proof of work. . As the check matrix depends on the previous block hash value, a different input value is used for each block, and as a result, the appearance of ASIC chips can be suppressed. In other words, by making mining using ASIC chips difficult, anyone with a relatively low hash power can participate in proof-of-work, thus satisfying the requirement 5) of the new proof-of-work algorithm. In addition, the function used for decoding can also be changed to another type of function having a one-way characteristic, which is also a factor that suppresses the appearance of ASIC chips due to a fixed algorithm. Also, even if a nonce value for a specific puzzle problem is found, a different input value for each block is used to create the puzzle, so the existing nonce value cannot be reused as the nonce value of a new block. That is, it satisfies the requirement 3) of the new work algorithm.

If the mapped output word does not satisfy the condition set, the mining apparatus excludes the previously used nonce value from the nonce set, selects a new nonce value not used in the nonce set, and returns to step S1009 (S1015). . The mining apparatus repeats each step while selecting a new nonce value until the mapped output word satisfies the condition.

4 is a flowchart illustrating a verification process of a mining apparatus according to an embodiment of the present invention.

The steps described above in FIGS. 2 to 3 are the mining process of the mining device, and the mining device broadcasts the newly created block to other mining devices when proof of work is completed. In addition, if the broadcasted block is verified by other mining devices and recognized as a legitimate block, the mining devices update the blockchain ledger by adding the block to the existing block chain.

The mining device acquires block header data of a block broadcast from another mining device that has generated the block (S2001). Here, the block header data acquired by the mining device is the same as described above.

The mining apparatus generates a check matrix based on the hash value included in the block header data (S2003). Here, the method of generating the check matrix is the same as described above.

The mining apparatus obtains an output value of the hash function based on the block header data (S2005). Here, the step of obtaining the output value of the hash function is the same as described above.

The mining apparatus obtains an output word as an output value of a hash function and an output value of a decoding function using a check matrix as an input value (S2007). The decoding function used here is the same as described above.

The mining device determines whether the output word satisfies the condition (S2009). Here, the conditions are set to the same conditions as those in the previous mining process. The set of conditions for verification may be collectively set for all mining devices, and may be transmitted together when a block is broadcast.

As a result of the determination, if the output word satisfies the condition set, the mining device approves the broadcast block and updates the ledger by extending it to the existing block chain (S2011).

On the other hand, if the output word does not satisfy the condition set as a result of the determination, the mining apparatus determines that the broadcasted block is not a valid block and rejects the broadcasted block approval (S2013).

As a result, the above-described verification method only needs to verify whether it meets the condition set by putting the received value into a known (or already set) decoding function.It works by looking for a codeword that meets the condition while changing the nonce value. Compared to the process of completing the proof, it is relatively very simple and is a suitable verification method for the blockchain. Therefore, even if an external attacker manipulates the contents of the block, the validator can easily know whether it has been manipulated, thus satisfying the requirement 2) of the new proof-of-work algorithm.

FIG. 5 is a diagram illustrating a method of adjusting the mining difficulty in the proof-of-work algorithm according to an embodiment of the present invention through an 8 by 16 check matrix.

5(a) is an example of an 8 by 16 check matrix. In practice, a check matrix of a much larger size is used, but an 8 by 16 check matrix is described as an example for ease of explanation.

Fig. 5(b) is a table in which codeword values are summarized based on the check matrix in (a). n represents the Hamming weight of the codeword, that is, the number of non-zero numbers included in the codeword. V _n represents a condition set that has 1 as much as the number indicated by the Hamming weight. p represents the ratio of the number of codewords included in the _{V n} condition set among the total number of codewords.

As shown in the table of FIG. 5(b), it can be seen that the size of the condition set including n number of 1s is different, and the respective occupancy rate for it can be known. Therefore, it is possible to determine the Hamming weight according to the difficulty of the cryptographic puzzle to be adjusted. For example, when the difficulty level is lowered, the Hamming weight may be set to 7 to 10. Conversely, if you want to increase the difficulty, you can set the Hamming weight to 3. In each case, the probability of selecting a codeword that satisfies the set of conditions differs by about 55% and 2.5%, respectively.In the latter case, more operations are required to obtain a codeword value that satisfies the set of conditions. As a result, the difficulty of proof-of-work increases. That is, the difficulty level of the puzzle can be flexibly adjusted by changing the code rate and adjusting the size of the matrix to adjust the amount of computing required to solve the decoder puzzle, thus satisfying the requirement 4) of the new proof-of-work algorithm.

The above-described adjustment of the mining difficulty will be described in more detail through another embodiment below in FIG. 7.

6 is a block diagram showing a mining apparatus according to an embodiment of the present invention.

The mining apparatus according to an embodiment of the present invention includes a control unit 110, a network unit 120, and a storage unit 130.

The control unit 110 may refer to a processor, and may include a microprocessor or a controller.

As shown in FIG. 6, the control unit 110 includes a current block header data acquisition unit 111, an input value generation unit 112, a hash function application unit 113, a codeword acquisition unit 114, and a block generation unit. (115) may be included.

The current block header data acquisition unit 111 obtains data included in the header by extracting the header of the current block to be mined. Here, the data acquired by the current block header data acquisition unit 111 may include at least one of version information, difficulty level information, timestamp information, nonce information, hash value information of a previous block, or transaction set information.

The input value generator 112 generates a plurality of input values based on the current block header data. In an embodiment, the input value generator 112 may generate a check matrix based on a previous block hash value. In another embodiment, the input value generator 112 may generate a hash tree value based on a transaction set. In another embodiment, the input value generator 112 may generate a hash function input set based on a hash tree value and other header data. Here, the other header data value may be at least one of version information, difficulty level information, and timestamp information, for example.

The hash function application unit 113 obtains an output of the hash function by using the input set generated by the input value generation unit 112 as an input value. Here, the hash function may be a SHA function, and other functions with secured security can also be applied.

The output word acquisition unit 114 acquires an output word based on the check matrix and the hash function output value. In an embodiment, the output word mapping algorithm may be obtained by finding one codeword close to an input value. In another embodiment, graph codeword mapping may be used as the output word mapping algorithm.

The block generator 115 verifies the acquired output word and generates a block according to the verification result. The block generator 115 generates a nonce value and determines whether an output word corresponding to the nonce value satisfies a condition set. The block generator 115 stores a corresponding nonce value and generates a block when the acquired output word satisfies the condition set. On the other hand, when the output word does not satisfy the condition set, the block generator 115 changes the nonce value and receives a new output word value from the output word acquisition unit again to perform a verification operation.

The network unit 120 is a wired/wireless communication device. The network unit 120 connects with other mining devices and broadcasts the generated block. In addition, the network unit 120 may receive a block generated by another mining device and transmit it to the current block header data acquisition unit 111.

The storage unit 130 stores various instructions used by the control unit 110. In addition, the storage unit 130 stores a block chain ledger to which blocks generated by the control unit 110 are connected. The storage unit 130 may be a memory device.

Hereinafter, another embodiment of finely adjusting the mining difficulty is presented. Since the following description is an example that the already presented description is applied as it is, the already presented description may be applied to a portion without a specific description.

7 is a graph showing fine adjustment of the mining difficulty using four check metrics.

Referring to FIG. 7, when the number of columns of the check matrix is 64, 28, 256, and 512, it is shown that mining difficulty may increase as the number of columns increases.

As shown in FIG. 5, when the size of the check matrix is 8 by 16, the number of cases of selecting the Hamming weights may be determined by a combination of Hamming weights.

For example, when the mining difficulty is to be extremely high, a single Hamming weight having the lowest share may be set. In order to make the mining difficulty extremely low, all possible Hamming weights can be set. This is a problem of the combination of the Hamming weights. Through the combination of the Hamming weights, the probability of selecting a codeword that satisfies the set of conditions can be adjusted in various cases. Through this, the difficulty of mining can be adjusted.

The combination of the Hamming weight setting corresponding to the mining difficulty level may correspond to each other and may be predetermined.

The combination of the Hamming weight setting corresponding to the mining difficulty may be calculated in advance and stored in a memory (refer to 330 of FIG. 9) in advance. In FIG. 7, when the size of the check matrix is 48 by 64, the first upward-going curve from the right is located in front of the Hamming weight setting with the lowest mining difficulty, and is located behind the Hamming weight setting with the highest mining difficulty. Shows.

The graph information may be stored in the memory 330 as a matching table or function information for matching.

As for the mining difficulty, the highest difficulty is determined according to the check matrix. For example, in the case of FIG. 5, when the Hamming weight is 14, the probability of selecting a codeword that satisfies the condition set is the lowest at 0.46%. Therefore, in order to set a higher mining difficulty, a more complex check matrix must be applied.

In order to implement a more complex check matrix, the size of the check matrix can be increased.

In FIG. 7, when the size of the check matrix is 96 by 128, the second upward-right curve in FIG. 7 shows that when the size of the check matrix is 96 by 128, the Hamming weight setting with the lowest mining difficulty is positioned in the front, and the Hamming weight setting having the highest mining difficulty is positioned in the rear. do.

Similarly, in FIG. 7, a third upward-right curve indicates a case in which the size of a check matrix is 192 by 256, and a fourth upward-right curve in FIG. 7 indicates a case in which the size of a check matrix is 384 by 512.

In this way, the mining difficulty can be adjusted infinitely difficult. Of course, at some times, you can change to a higher mining difficulty than before, and at other times you can change to a lower mining difficulty than before. Therefore, it is possible to implement a mining difficulty adaptive to the current state.

On the other hand, when it exceeds the highest mining difficulty that can be obtained from one check matrix, it is natural that a higher mining difficulty can be realized by moving to the other check matrix.

8 is a flowchart showing a proof-of-work algorithm that satisfies an improved condition according to another embodiment of the present invention. This embodiment is characteristically different in that the addition of determining the mining difficulty by monitoring the blockchain system is added, and the description shown in FIG. 2 may be applied as it is.

Referring to FIG. 8, the mining apparatus obtains a data value for proof of work from a current block header (S3001). Here, the current block refers to a block that the miner currently wants to create, and it is a block that has not been connected to the chain because proof-of-work has not been completed. The block header included in the block chain may include one or more pieces of information about the block. The information included in the block header may include at least one of version information, difficulty level information, timestamp information, nonce information, hash value information of a previous block, or transaction set information.

The mining device can access the full blockchain node to determine the current state of the blockchain system, and determine the mining difficulty accordingly (S3003).

For example, the mining apparatus may determine the mining difficulty to increase the mining difficulty when there are a number of mining and malicious mining due to a low mining difficulty. When the number of miners currently participating in mining is small, the mining apparatus may determine the mining difficulty so as to lower the mining difficulty.

Thereafter, according to the determined difficulty level, the mining apparatus generates a check matrix based on the first value included in the acquired data value (S3005). And generating a hash tree based on the second value included in the acquired data value (S3007). The process shown in FIG. 2 may be performed in the same manner.

Meanwhile, in determining whether the codeword satisfies a preset condition set, it may be operated by a condition set corresponding to a Hamming weight combination that implements the determined mining difficulty.

Again, in this case, the operation of the proof-of-work algorithm is performed in compliance with the mining difficulty determined in response to the current state. Specifically, the selection of the check matrix and the Hamming weight may be determined as values corresponding to the determined mining difficulty. In this case, it may be performed in response to the graph shown in FIG. 7. Information related to FIG. 7 may be stored in the memory 330.

9 is a block diagram showing a mining apparatus according to another embodiment. This embodiment is characteristically different in that the mining difficulty determining unit is included. Therefore, the description of the mining apparatus shown in FIG. 6 may be applied to the description not specifically presented in this drawing.

Referring to FIG. 9, a mining apparatus according to another embodiment of the present invention includes a control unit 210, a network unit 220, and a storage unit 230.

The control unit 210 includes a current block header data acquisition unit 211, a mining difficulty determination unit 212, an input value generation unit 213, a hash function application unit 214, a codeword acquisition unit 215, and a block. It may include a generating unit 216.

The mining difficulty determining unit 211 is a block that determines the difficulty level to be applied to the current blockchain system. In addition, the description shown in FIG. 6 may be applied to the components included in the controller.

10 is a view showing in detail the mining difficulty determination unit.

Referring to FIG. 10, the mining difficulty determining unit 211 includes a monitoring unit 320 for determining the state of the blockchain system. The monitoring unit 320 may access the full block chain node to determine current and past mining conditions.

A difficulty level determining unit 310 for determining a mining difficulty level according to information detected by the monitoring unit 320 may be further included.

The mining difficulty is determined in various ways, and the current block generation can be applied. For example, if the current difficulty of mining is low and there are multiple mining and malicious mining, the mining difficulty can be determined to increase the mining difficulty. If the number of mining devices currently participating in mining is small, the mining difficulty can be determined to lower the mining difficulty.

In order to implement the mining difficulty determined by the mining difficulty determining unit 310, a check matrix determining unit 340 for determining which check matrix to apply may be further included.

In order to implement the mining difficulty determined by the mining difficulty determining unit 310, a Hamming weight determining unit 340 for determining which Hamming weight to apply may be further included.

As already explained, the larger the size of the check matrix, the more computing is required. Therefore, it is not necessary to apply a check matrix with a large number of elements in order to apply it to low mining difficulty. If the mining difficulty is high, it cannot be implemented with a check matrix with a small number of elements. A check matrix that satisfies these two viewpoints may be determined by the check matrix determination unit 340.

As described in FIG. 7, the difficulty of mining can be finely adjusted through the same check matrix through the combination of the Hamming weights. In FIG. 7, a Hamming weight for implementing a mining difficulty determined from a check matrix determined by the check matrix determiner 340 may be determined.

On the other hand, according to this embodiment, it is possible to finely adjust the mining difficulty optimally.

For example, the difficulty level implemented in one of the first check matrix is up to the highest difficulty level of 10 (the higher the number for explanation, the greater the difficulty, and the same is the same hereinafter), and the other second check The maximum difficulty level implemented in the matrix can be up to 100.

In this case, let's assume that the currently applied mining difficulty to fine tune is 8. In this case, in the first check matrix, the mining difficulty level adjacent to 8 that can be obtained by adjusting the Hamming weight is 7.4 and 8.1. Similarly, in the second check matrix, the mining difficulty level adjacent to 8, which can be obtained by adjusting the Hamming weight, may be 7.95 and 8.2. In this case, the check matrix determination unit 340 may determine the second check matrix as the use check matrix.

Of course, in this case, the Hamming weight determination unit 350 may determine the mining difficulty as 7.95 by selecting a Hamming weight combination of the second check matrix.

The same process as in FIG. 6 may be performed according to the check matrix and the Hamming weight determined by the above method.

Information required for such control may be previously stored in the memory 330 and derived.

The above-described present invention can be implemented as a computer-readable code on a medium on which a program is recorded. The computer-readable medium includes all types of recording devices that store data that can be read by a computer system. Examples of computer-readable media include HDD (Hard Disk Drive), SSD (Solid State Disk), SDD (Silicon Disk Drive), ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical data storage device, etc. There is this. Therefore, the detailed description above should not be construed as restrictive in all respects and should be considered as illustrative. The scope of the present invention should be determined by rational interpretation of the appended claims, and all changes within the equivalent scope of the present invention are included in the scope of the present invention.

Claims (10)

In a mining device that creates a block when a transaction occurs and forms a block chain by performing a proof of work through a proof of work consensus mechanism,
A control unit that monitors the blockchain system and includes a mining difficulty determination unit that determines to increase or decrease the mining difficulty, and generates a block according to the applied mining difficulty determined by the mining difficulty determination unit to complete proof of work; And
Mining apparatus comprising a network unit for broadcasting the generated block to another mining apparatus. The method of claim 1,
In the mining difficulty determination unit,
A monitoring unit monitoring the block chain system;
A mining difficulty determining unit that determines the applied mining difficulty according to a result monitored by the monitoring unit;
A check matrix determination unit for determining an applied check matrix to be used in a mining apparatus in order to implement the applied mining difficulty; And
A Hamming weight determining unit for determining a Hamming weight implementing the crystal mining difficulty in the applied check matrix,
The check matrix is implemented based on a first input value based on a data value for proof of work from a header of a current block to be mined. The method of claim 2,
Mining apparatus including a memory in which information corresponding to a mining difficulty level implemented by a combination of at least one check matrix and the Hamming weight implemented by the check matrix is stored. The method of claim 3,
A mining apparatus in which information corresponding to a mining difficulty level implemented by a Hamming weight implemented by at least two of the check matrices and the at least two check matrices is stored in the memory. Monitoring the blockchain system to determine an applied mining difficulty;
Obtaining a data value for proof-of-work from a current block header, and determining a check matrix to implement the applied mining difficulty based on a first value included in the obtained data value;
Generating a hash tree based on a second value included in the acquired data value;
Generating an input set based on a hash tree and a third value included in the acquired data value;
Applying the input set to a hash function to obtain a result vector;
Obtaining a codeword based on the result vector and the check matrix;
Determining whether the codeword satisfies a preset condition set; And
A method of operating a mining apparatus comprising the step of generating a new block based on the determination result or obtaining a codeword again using a different nonce value. The method of claim 5,
The step of determining whether the codeword satisfies a preset condition set,
It includes adjusting a set of preset conditions for adjusting the difficulty of the proof-of-work process,
The preset condition set is different for each check matrix. The method of claim 6,
Adjusting the condition set is:
A method of operating a mining apparatus adjusted by determining a combination of Hamming weights indicating the number of 1s included in the codeword. The method of claim 6,
When a new block is generated, broadcasting the block to another mining device,
The step of broadcasting the block to another mining device includes broadcasting the adjusted condition set information together with the block. The method of claim 5,
The step of determining a check matrix for implementing the applied mining difficulty is determined as a check matrix capable of implementing a mining difficulty closest to the mining difficulty among a plurality of check matrices. The method of claim 9,
The combination of the check matrix and Hamming weights implemented by the check matrix is previously stored in a memory.

Images