KR20210134408A - mining equipment - Google Patents

Abstract

A mining device is started. In a mining device that forms a block chain by performing proof-of-work through a proof-of-work consensus mechanism when a transaction occurs, the mining device includes: a network unit; and a control unit that selects one generic ID and broadcasts the generated block to other mining devices corresponding to the selected generic ID.

Description

mining equipment

The present invention relates to a mining device capable of realizing an equal block chain by breaking away from centralization by considering both online and offline policies.

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

The present invention is to provide a mining device capable of realizing an equal block chain by breaking away from centralization by considering both the online policy and the offline policy.

When a transaction occurs, a mining device that forms a block chain by performing proof-of-work through a proof-of-work consensus mechanism generates a block when the transaction occurs, and a network unit, and a generic ID of any one of a plurality of generic IDs in the ID pool and a controller for broadcasting the generated block to other mining devices corresponding to the selected generic ID.

In this case, the plurality of generic IDs may be IDs corresponding to members of a closed blockchain community that have agreed on an operation method.

The controller may broadcast the generated block only to mining devices corresponding to the plurality of generic IDs.

Meanwhile, the plurality of generic IDs may be generated using fingerprints of mining devices owned by the members.

Meanwhile, the plurality of generic IDs may be generated using fingerprints of the members.

In this case, the members may each have one generic ID.

Meanwhile, the control unit may receive a block from the previous mining device and perform the operation when the generic ID included in the block header of the received block matches the generic ID of the mining device.

In this case, if the block is not generated within a specific time, the control unit may return to the previous mining device.

Meanwhile, the controller may insert the selected generic ID into a block header and broadcast the block including the block header into which the generic ID is inserted.

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 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 illustrating a mining apparatus according to an embodiment of the present invention.
7 is a diagram for explaining a method of establishing blockchain governance.

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, the proof-of-work is performed in so-called peer nodes, and each peer node determines whether a value smaller than the target value comes out 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 generated simultaneously by multiple 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.

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 Nc - Nm by Nc matrix composed of elements of Galois Field GF(q) (0 or 1 binary elements when q = 2). For example, N _m =128 and N _c =256. The mining device can generate a check matrix (Ft) using the hash value (ht-1) of the previous block in 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 Nc of the codeword vector is made longer than the size Nm of the message vector. And, R = Nm/Nc 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 2256 vectors (eg, the output of the SHA function), of which about 264 codewords exist at a code rate of 1/4. 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. Vn 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 Vn 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.

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.

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.

7 is a diagram for explaining a method of establishing blockchain governance.

Good blockchain governance is to break away from centralization and realize an equal blockchain.

And if there is a generic technology to identify an entity (miner or miner), the design of an equitable blockchain becomes easier.

For example, suppose that a generic ID technology exists. And each of the plurality of nodes has a single, generic, and unforgeable ID. Here, non-forgery means that the owner of a node must present a true ID in order to claim mining rights. And when requested by others, the real ID cannot be provided.

In this case, a plurality of nodes may perform mining in a round robin method. Specifically, as a plurality of nodes have mining rights alternately or randomly, mining rights can be equally distributed to all participating nodes. Therefore, if there is a generic ID, it becomes easier to realize an equal block chain with an on-chain policy (On-chain policy).

However, generic ID technology is difficult to realize. Assume, for example, the physical copy protection function (PUF).

The physical copy protection function cannot duplicate the pattern and thus can be utilized as a fingerprint. Thus, the owner of the chip can create a private key using physical copy protection.

However, cypher data of the private key may be stored in the non-volatile memory and stolen, or the private key may be physically stolen. Also, the owner of the chip may have other means of generating a private key in addition to physical copy protection.

Therefore, physical copy protection does not provide a solution to Sybil Attacks.

As such, since generic ID technology does not exist, it is important that on-chain policies and off-chain policies are properly harmonized.

In order to break away from centralization and realize an equal block chain, a mixed policy that mixes on-chain policy and off-chain policy can be used.

Here, the off-chain policy may mean a political, economic, and social agreement between people.

Also, on-chain policy is to insert the policy into the block chain in the form of computer code through programming. In this case, when the block chain is operated, the policy is automatically realized through the computer API.

As described above, since there is no generic ID technology, problems may arise in realizing an equal block chain in a public block chain.

Therefore, as an off-chain policy, a closed blockchain community that agrees on how to operate can be formed. In this case, the blockchain is operated by members of a closed blockchain community. Therefore, even if there is no generic ID technology, each other can confirm each other's ID and participate in mining. Accordingly, the realization of an equal block chain is possible.

In the off-chain policy, there may be a third party that manages the registration of generic IDs for each mining device. This is to prevent Sybil Attacks such as multiple registrations on one computer. Here, the term third party may be used interchangeably with the term third party server.

Also, fingerprints of mining devices owned by community members can be registered with third parties. In this case, the third party may collect fingerprints of the mining devices and generate a generic ID corresponding to each mining device.

On the other hand, with the on-chain policy, a plurality of generic IDs respectively corresponding to a plurality of mining devices can be stored in the block chain. And only mining devices with generic IDs can be allowed to participate in mining.

And by giving one vote per chip (generic ID), it is possible to achieve a device-egalitarian blockchainis.

On the other hand, the problem of one person owning many chips can arise. Specifically, when one person registers several devices to secure a plurality of chips, a problem may occur that occupies a large number of votes required to reach an agreement.

Therefore, through the individual registration policy, an individual egalitarian blockchain community can be achieved.

Specifically, in the off-chain policy, a third party that manages the registration of each individual's generic ID may exist. In addition, each user's fingerprint can be registered with a third party. In this case, a third party can generate a generic ID for the mining device representing each member. That is, one member can have one registered generic ID.

Meanwhile, with the on-chain policy, the generated generic IDs can be stored in the blockchain. And only mining devices with generic IDs can be allowed to participate in mining.

Meanwhile, an ID pool composed of a plurality of generic IDs may be configured. And the generic ID may be composed of a 256-bit string.

In addition, the mining device to perform the mining operation may be determined by selecting any one generic ID from among a plurality of generic IDs in the ID pool. That is, immutability can be maintained by using a third party.

Next, with reference to FIG. 7 , a method of selecting a mining device (a next miner) will be described in more detail.

The control unit 110 of the mining device may determine the next mining device with a unique ID called to mine the next block.

Specifically, a routine for moving from the first block (#1) to the second block (#2) will be described.

Here, the input may be a block header and a set of all IDs except for the ID field. Also the output can be the following ID.

Specifically, the controller 110 may obtain all field elements of the block header of the first block #1 except for the ID.

In addition, the controller 110 may obtain a hash function output using all field elements of the block header of the first block #1 as input values, and store the hash function output y. Here, the hash function may be a SHA function.

Meanwhile, the controller 110 may determine a single ID from a set of all ID vectors. As one method of determining a single ID, there may be a method in which the control unit 110 selects the one having the smallest Hamming distance to the hash function output y.

Meanwhile, the selected single ID may be the ID (ID_next) of the next mining device (miner).

Meanwhile, the controller 110 may return the ID (ID_next) of the next mining device.

The following describes the mining routine.

An announcement of the first block #1 is made, and a mining device (hereinafter referred to as a second mining device) of the next block in the first block #1 may be selected. In this case, the second mining device may start a mining routine for the second block (#2).

In the second mining device, the input may be a transaction for the second block (#2) and a set of block headers for the first block (#1). Also, the output may be an announcement of the mined second block (#2).

The control unit of the second mining device may read the ID field of the announced block header of the first block.

And if the ID included in the block header of the first block (a single ID selected in the first block) matches its ID, the control unit of the second mining device may continue the operation. On the other hand, if the ID included in the block header of the first block is not the same as its own ID, the control unit of the second mining device may terminate the operation.

Meanwhile, the control unit of the second mining device may collect transactions to form the body of the second block #2.

In addition, the control unit of the second mining device may find the Merkel root hash and the rest of the block header field, and transmit the block header to the RS routine.

Also, the control unit of the second mining device may determine a next mining device (hereinafter referred to as a third mining device). Here, the method of determining the third mining device may be applied to the method of determining the second mining device.

Then, the control unit of the second mining device may complete the block header by inserting the ID of the third mining device into the block header, and may make an announcement of the second block (#2).

On the other hand, if the selected node (the third mining device) cannot be used or the current mining operation cannot be performed, the above-mentioned mining routine may fail.

And in order to prevent such a failure, the on-chain policy may include a time limit for the next block generation.

That is, if the next block is not generated within a certain time, the mining device can return to the previous mining device to determine the next mining device again.

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 (9)

In a mining device that forms a block chain by performing proof-of-work through a proof-of-work consensus mechanism when a transaction occurs,
network department; and
A control unit that generates a block when the transaction occurs, selects any one generic ID among a plurality of generic IDs in the ID pool, and broadcasts the generated block to other mining devices corresponding to the selected generic ID;
mining equipment. The method of claim 1,
The plurality of generic IDs,
It is an ID that corresponds to the members of a closed blockchain community who have agreed on how to operate.
mining equipment. The method of claim 1,
The control unit is
Broadcasting the generated block only to mining devices corresponding to the plurality of generic IDs.
mining device. 3. The method of claim 2,
The plurality of generic IDs,
Created using the fingerprint of the mining devices owned by the members
mining device. 3. The method of claim 2,
The plurality of generic IDs,
generated using the fingerprints of the members
mining device. 6. The method of claim 5,
The members each have one generic ID
mining device. The method of claim 1,
The control unit is
Receiving a block from a previous mining device, and performing an operation when the generic ID included in the block header of the received block matches the generic ID of the mining device
mining device. 8. The method of claim 7,
The control unit is
If a block is not generated within a certain time, it returns to the previous mining device.
mining device. The method of claim 1,
The control unit is
inserting the selected generic ID into a block header, and broadcasting the block including the block header into which the generic ID is inserted
mining device.

Images