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

Abstract

A mining device according to an embodiment of the present invention generates a block when a transaction occurs, and performs a proof-of-work through a proof-of-work consensus mechanism to form a block chain. By monitoring the block chain system, the mining difficulty a control unit comprising a mining difficulty determining unit that determines whether to increase or decrease , and a control unit for generating a block according to the applied mining difficulty determined by the mining difficulty determining unit to complete the proof of work; and a network unit for broadcasting the generated block to other mining devices.

Description

Code-Crypto Currency System {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 through an improved proof-of-work algorithm and verifies it.

In 2009, a blockchain-based cryptocurrency appeared 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 written in blocks, and these blocks form a linked list (ie, a chain) of blocks. Each user of the network stores the entire data in a decentralized manner without central authority. It makes it very difficult to manipulate transactions in blockchain-based cryptocurrencies, as each block in the blockchain constitutes a blockchain containing the hash value of the previous block.

Maintaining a single blockchain in a large P2P network requires a distributed consensus mechanism that ensures system integrity by mutually verifying results between peer nodes. This consensus mechanism should be able to determine who created a new block and whether the chain is valid.

Bitcoin is a representative cryptocurrency that uses a 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 find and verify hash values that meet certain requirements to reach consensus. Proof of work is the process of finding the nonce value that makes the block hash value less than the target value. A nonce is one piece of information specified in the block header. A nonce set, which is a set of nonce values, is defined, and each nonce value is selected from the nonce set and assigned to the hash function. In this case, the once used nonce value is excluded from the nonce set and is not used again. When a hash value satisfying the above requirements is found in a specific nonce value, the corresponding nonce value is recorded and inserted into the block header to create 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

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

In addition, the method of operating a mining device according to an embodiment of the present invention aims to solve a problem that may occur when a small number of miners monopolize hash power due to the advent of ASIC.

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

In addition, according to an embodiment of the present invention, since the difficulty of mining can be finely adjusted, we propose a mining device and an operating method of the mining device that maintain the code-cryptocurrency system more robustly.

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

The mining apparatus according to an embodiment of the present invention includes a mining difficulty determining unit that monitors the blockchain system to determine whether 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 to complete the proof-of-work; and a network unit for broadcasting the generated block to other mining devices.

The method of operating a mining device 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 operating method of the mining device according to an embodiment of the present invention can restore the essence of the blockchain-based cryptocurrency through re-centralization, thereby restoring transaction credit and money credit.

In addition, in the method of operating a mining apparatus according to an embodiment of the present invention, the difficulty of proof-of-work may be adjusted as needed.

In addition, since the method of operating a mining device according to an embodiment of the present invention allows fine adjustment of the mining difficulty, it is possible to prevent monopoly of the mined cryptocurrency and prevent malicious mining of the cryptocurrency.

1 shows a general block and a block chain in which blocks are connected.
2 is a flowchart illustrating 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 device according to an embodiment of the present invention.
5 is a diagram for explaining 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 illustrating a mining apparatus according to an embodiment of the present invention.
7 is a graph illustrating fine adjustment of mining difficulty using four check metrics.
8 is a flowchart illustrating a proof-of-work algorithm satisfying an improved condition according to another embodiment of the present invention.
9 is a block diagram illustrating a mining apparatus according to another embodiment.
10 is a detailed view of the mining difficulty determining 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 change other embodiments included within the scope of the same idea by adding, changing, deleting, and adding components. It may be suggested, but this will also be included within the scope of the present invention.

In the accompanying drawings, in describing the overall structure in order to easily understand the spirit of the invention, minute parts may not be specifically expressed, and in describing the minute parts, the overall structure may not be specifically reflected. In addition, even if specific parts such as an installation location are different, when the action is the same, the same name is assigned to improve the convenience of understanding. 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 thereof will be omitted.

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

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

The block chain (2) is a form in which a plurality of blocks (1) are connected.

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

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

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

As described above, the proof-of-work algorithm determines whether the proof-of-work succeeds by comparing the block hash with the target value. Specifically, proof-of-work is performed in so-called peer nodes, and each peer node determines whether a value smaller than the target value is obtained by performing hash calculation while changing the nonce value in the header information.

Here, a peer node is also referred to as a miner or mining device, and refers to 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.

Peer nodes change 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 successful proof of work and all transactions included in the block are confirmed as valid transactions. And when a valid block is generated, the peer node broadcasts the generated block to the entire network, and when other peer nodes approve it and add it to the blockchain, the transaction is completed.

Here, a block can be simultaneously generated by several peer nodes and the chain can be branched. At this time, the peer nodes reach a 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 aforementioned proof-of-work based cryptocurrency, has several problems.

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

The greater the number of miners for a cryptocurrency, the better protection against possible attacks, which helps to maintain blockchain immutability and reliability of the cryptocurrency. In the early stages of the Bitcoin network (2010-2013), even ordinary people using home computers could perform Bitcoin proof-of-work.

However, as time went on, it was not possible to quickly perform proof-of-work only with the computing power of a home computer, and as computing platforms for Bitcoin mining reached from GPUs and FPGAs to ASICs recently, a small number of miners monopolized computing power. is appearing This centralizes the Bitcoin network, moving away from decentralization, the identity of the Bitcoin blockchain. Therefore, the public trust in the blockchain is collapsing as the possibility of the blockchain being tampered with by a small number of miners with overwhelming computing power is emerging.

The cause of the problem of re-centralization of all Proof-of-Work-based blockchain networks, including Bitcoin, is the limited availability of cryptographic 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]. Although ASIC chips are relatively expensive, they are optimized for Bitcoin proof-of-work and the hash power of a small number of miners performing mining through ASIC chips accounts for a large portion of the hash power of the entire network, resulting in overwhelming mining influence. got to have

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

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

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

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

4) The difficulty of the puzzle should be adjustable.

5) Anyone with 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-mentioned requirements will be described. One of the improved requirements is

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

am.

2 is a flowchart illustrating a proof-of-work algorithm satisfying 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 by 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 wants to create and is not connected to the chain because proof-of-work has not been completed yet. A block header included in a block chain may include one or more pieces of information about a block. The information included in the block header may include at least one of version information, difficulty information, timestamp information, nonce information, hash value information of a previous block, or transaction set information.

이고

이 될 수 있다. 채굴 장치는 현재 블록 인덱스 t (양의정수) 에서 이전 블록의 해쉬 값(h_t-1)을 이용하여 체크 매트릭스(F_t)를 생성할 수 있다. 여기에서 체크 매트릭스의 생성은 부호이론 분야에서 일반적으로 알려진 것을 사용할 수 있다.The mining device 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 a 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 elements when q = 2). chamberlain

ego

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

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 device generates an input set S based on the third value included in the acquired data value and the generated hash tree (S1007). The third value used here may be at least one of version information, difficulty information, and timestamp information of the previous block. In addition, 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 with verified security may be used. At this time, the mining device generates a result vector that is a hash function output for a specific nonce value.

The mining device applies the result vector (r) that is the output of the hash function and the check matrix generated in step S1003 as input values to the decoding function (S1011). The mining device 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 of Error-Correction Code, a Sphere-Decoding signal receiver in communication theory, a sparse signal restoration algorithm in compression sensing, or an algorithm to solve an inverse problem in mathematics. can be used.

As a preferred embodiment, when a decoding function related to 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 the error generated by the channel. An error correction code is used to catch and correct this error. The transmitter generates a codeword by performing 1-to-1 mapping, that is, encoding, the 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 a received word is input, a restoration function that recovers the transmitted codeword by solving the inverse problem of the encoding function is called a decoder or decoding function.

In order to create a margin to remove the error by itself, the size N _c of the codeword vector is made longer than _{the size N m} of the message vector. And, R = N _m /N _c is called a code rate. The smaller the code rate, the more robust to channel errors; However, it requires more computing to decode.

The present invention shows the application of a decoder used in Error-Correction Code to proof-of-work as an embodiment of the invention. Combining the decoder function with a cryptographic function such as SHA-256 makes a composite function. That is, the output value of the encryption 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 compound function, that is, the nonce value, where 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 synthesized function created in this way satisfies 1) of the requirements of the proof-of-work algorithm. In a preferred embodiment, a graph-decoder may be used as a decoding function. In addition, for the decoding function, an algorithm capable of the fastest codeword mapping in the field of linear graph-decoder may be used.

The mining device determines whether the obtained output word of the decoder satisfies a preset condition (S1013). The mining device has a set of conditions related to the mapped output word in advance, and determines whether the output word value obtained in step S1011 is a codeword and whether a preset condition set is satisfied if it is a codeword.

3 shows the codeword and condition set described above.

As illustrated in FIG. 3 , there are 2 ²⁵⁶ vectors (eg, the output of the SHA function), among which there are about ^{2 64 codewords 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.

Return to FIG. 2 again.

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

In other words, in the proof-of-work algorithm by 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 every block, a different decoder puzzle for every block must be performed as a proof-of-work . As the check matrix relies on the previous block hash value, a different input value is used for every block, and consequently, the appearance of an ASIC chip can be suppressed. In other words, by making mining using ASIC chips difficult, anyone can participate in proof-of-work even with a CPU with relatively low hash power, 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 with one-way characteristics, which is also a factor in suppressing the appearance of ASIC chips due to the fixed algorithm. Also, even if a nonce value for a specific puzzle problem is found, a different input value is used for each block to make a puzzle, so the existing nonce value cannot be reused as a nonce value for a new block. That is, the requirement 3) of the new working algorithm is satisfied.

If the mapped output word does not satisfy the condition set, the mining device excludes the previously used nonce value from the nonce set, selects a new nonce value that is not used from the nonce set, and returns to step S1009 (S1015) . The mining device 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 device according to an embodiment of the present invention.

The steps described 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 the proof of work is completed. And if other mining devices verify the broadcast block and it is recognized that it is 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 the broadcast block from another mining device that generated the block (S2001). Here, the block header data obtained by the mining device is the same as described above.

The mining device 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 device obtains the 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 device obtains the output word as the output value of the hash function and the output value of the decoding function using the check matrix as input values (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 delivered together when a block is broadcast.

If the output word satisfies the condition set as a result of the determination, 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 device determines that the broadcast block is not a valid block and rejects the broadcast block approval (S2013).

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

5 is a diagram for explaining 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 reality, a check matrix with a size much larger than this is used, but for ease of explanation, an 8 by 16 check matrix is described as an example.

5(b) is a table in which codeword values are arranged based on the check matrix in (a). n represents the Hamming weight of the codeword, that is, refers to the number of non-zero numbers included in the codeword. V _n represents a set of conditions having 1 as many as the number indicated by the Hamming weight. p represents the ratio of the number of codewords included in the _{V n} conditional 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 1s is different, and the share of each 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, in the case of lowering the difficulty, 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 that a codeword satisfying the condition set will be selected differs by about 55% and 2.5%, respectively. In the latter case, more operations must be performed to obtain a codeword value that satisfies the condition set. As a result, the difficulty of proof-of-work increases. That is, the difficulty of the puzzle can be flexibly adjusted by changing the code rate and adjusting the size of the matrix to control the amount of computing required to solve the decoder puzzle, thus satisfying the requirement 4) of the new proof-of-work algorithm.

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

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

A 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 controller 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 obtaining unit 111 , an input value generating unit 112 , a hash function applying unit 113 , a codeword obtaining unit 114 , and a block generating unit. (115).

The current block header data obtaining 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 information, timestamp information, nonce information, hash value information of a previous block, and 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 the 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, for example, at least one of version information, difficulty information, and timestamp information.

The hash function application unit 113 obtains a hash function output 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 security-secured functions are also applicable.

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 a method of finding one codeword close to the output word from the input value. In another embodiment, as the output word mapping algorithm, graph codeword mapping may be used.

The block generator 115 verifies the obtained 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. When the obtained output word satisfies the condition set, the block generating unit 115 stores a corresponding nonce value and generates a block. On the other hand, when the output word does not satisfy the condition set, the block generating unit 115 changes the nonce value and receives a new output word value from the output word obtaining unit again to perform 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. Also, the network unit 120 may receive a block generated by another mining device and transmit it to the current block header data obtaining unit 111 .

The storage unit 130 stores various instructions used in the control unit 110 . In addition, the storage unit 130 stores the block chain ledger to which the block generated by the control unit 110 is 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 of applying the previously presented description as it is, the previously presented description may be applied to a portion without a specific description.

7 is a graph illustrating fine adjustment of 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 the 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 in which the Hamming weights are selected may be determined by a combination of the Hamming weights.

For example, if the mining difficulty is to be extremely high, a single Hamming weight having the lowest share may be set. All possible hamming weights can be set to make the mining difficulty extremely low. This is a problem of the combination of the Hamming weights. Through the combination of the Hamming weights, it is possible to control the probability of selecting a codeword satisfying a set of conditions by the number of various cases. Through this, the difficulty of mining can be adjusted.

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

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

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 satisfying the condition set is the lowest at 0.46%. Therefore, in order to set a higher mining difficulty, more complex check metrics must be applied.

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

The second upward curve from the right 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 located at the front, and the Hamming weight setting with the highest mining difficulty is located at the back. do.

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

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

On the other hand, if it exceeds the highest possible mining difficulty from one check matrix, it is natural to move to another check matrix to implement a higher mining difficulty.

8 is a flowchart illustrating a proof-of-work algorithm satisfying an improved condition according to another embodiment of the present invention. This embodiment is characteristically different in that it is added to monitor the blockchain system to determine the mining difficulty, and otherwise, the description presented in FIG. 2 can be applied as it is.

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

The mining device may connect with 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 the current mining difficulty is low and there are a large number of mining and malicious mining. When the number of miners currently participating in mining is small, the mining apparatus may determine the mining difficulty to lower the mining difficulty.

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

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

Once again, in this case, the operation of the proof-of-work algorithm is performed in compliance with the mining difficulty determined corresponding 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 corresponding to the graph shown in FIG. 7 . Information related to FIG. 7 may be stored in the memory 330 .

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

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. A generator 216 may be included.

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

10 is a detailed view of the mining difficulty determining unit.

Referring to FIG. 10 , the mining difficulty determination unit 211 includes a monitoring unit 320 for determining the state of the block chain system. The monitoring unit 320 can connect to the full blockchain node and grasp the current and past mining status.

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

The determination of the mining difficulty is variously determined, so that the current block generation can be applied. For example, if the current mining difficulty is low and there are a lot of mining and malicious mining, the mining difficulty may be determined to increase the mining difficulty. If the number of mining devices currently participating in mining is small, the mining difficulty may 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 determination unit 310, a Hamming weight determination unit 340 for determining which Hamming weight is to be applied may be further included.

As already explained, the larger the size of the check matrix, the more computation is required. Therefore, it is not necessary to apply a check matrix with a large number of elements in order to apply it to a low mining difficulty. If the mining difficulty is high, it cannot be implemented with a check matrix with a small number of elements. The check matrix determining unit 340 may determine a check matrix that satisfies these two points of view.

As described in FIG. 7 , it is possible to finely adjust the mining difficulty through the same check matrix through the combination of the Hamming weights. In FIG. 7 , it is possible to determine a Hamming weight that implements the mining difficulty determined in the check matrix determined by the check matrix determiner 340 .

On the other hand, according to this embodiment, it is possible to optimally fine-tune the mining difficulty.

For example, the difficulty implemented in any one of the first check matrices is up to the highest difficulty of 10 (as a number for explanation, the higher the number, the greater the difficulty, hereinafter the same), and the second check of the other The difficulty implemented in the matrix may have a maximum difficulty of 100.

In this case, let's say that the applied mining difficulty that we want to fine-tune now is 8. In this case, in the first check matrix, the mining difficulty adjacent to 8 obtained by adjusting the Hamming weight is 7.4, and 8.1. Similarly, in the second check matrix, there may be 7.95 and 8.2 for the mining difficulty adjacent to 8, which can be obtained by adjusting the Hamming weight. In this case, the check matrix determiner 340 may determine the second check matrix as a used check matrix.

Of course, in this case, the Hamming weight determiner 350 may select the Hamming weight combination of the second check matrix to determine the mining difficulty as 7.95.

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

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

The present invention described above can be implemented as computer-readable code on a medium in which a program is recorded. The computer-readable medium includes all kinds of recording devices in which data readable by a computer system is stored. Examples of computer-readable media include Hard Disk Drive (HDD), Solid State Disk (SSD), Silicon Disk Drive (SDD), ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical data storage device, etc. there is this Accordingly, the above detailed description should not be construed as restrictive in all respects but as exemplary. The scope of the present invention should be determined by a reasonable interpretation of the appended claims, and all modifications 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 performs proof-of-work through a proof-of-work consensus mechanism to form a block chain,
a control unit comprising a mining difficulty determining unit that monitors the block chain system to determine whether to increase or decrease the mining difficulty; and
and a network unit that broadcasts the generated block to other mining devices,
In the mining difficulty determining unit,
a monitoring unit for monitoring the block chain system;
a difficulty determination unit for determining the applied mining difficulty according to the monitored result by the monitoring unit; and
In order to implement the applied mining difficulty, a check matrix determining unit that determines a check matrix to be used in a mining device is included,
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 1,
In the mining difficulty determining unit,
and a Hamming weight determination unit configured to determine a Hamming weight that implements the applied mining difficulty in the check matrix determined to be used by the check matrix determination unit. 3. The method of claim 2,
Mining apparatus comprising a memory, in which information corresponding to the difficulty of mining implemented by a combination of at least one of the check matrix and the Hamming weight implemented by the check matrix is stored. 4. The method of claim 3,
The memory stores at least two check matrices and information corresponding to a mining difficulty implemented by a Hamming weight implemented by the at least two check matrices. monitoring the blockchain system to determine the 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 third value and a hash tree included in the acquired data value;
applying the input set to the 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 device, comprising the step of generating a new block based on a determination result or acquiring a codeword again using a different nonce value. 6. The method of claim 5,
The step of determining whether the codeword satisfies a preset condition set comprises:
It includes adjusting a set of preset conditions to adjust the difficulty of the proof-of-work process,
The preset condition set is different for each check matrix, the method of operating a mining device. 7. The method of claim 6,
The steps to adjust the condition set are:
A method of operating a mining device adjusted by determining a combination of Hamming weights indicating the number of 1s included in a codeword. 7. The method of claim 6,
Broadcasting the block to other mining devices when a new block is created;
The step of broadcasting the block to other mining devices includes broadcasting the adjusted condition set information together with the block. 6. The method of claim 5,
The step of determining the check matrix to implement the applied mining difficulty is determined as a check matrix capable of implementing the mining difficulty closest to the mining difficulty among a plurality of check matrices. 10. The method of claim 9,
The combination of the check matrix and the Hamming weight implemented by the check matrix is stored in a memory in advance.

Images