KR102389465B1 - Apparatus and method for generating block chain - Google Patents

Abstract

A block chain generating apparatus according to an embodiment of the present invention includes a communication module for communicating with other nodes; at least one processor; and a memory electrically coupled to the processor, wherein, when executed, the processor records a transaction in the body of the second block and generates a public key for encrypting the third block through a public key algorithm. and stored in the header of the second block, and instructions for generating the second block by calculating the private key corresponding to the public key pair encrypted with the first block are stored.

Description

Apparatus and method for generating a block chain

The present invention relates to a block chain generating apparatus and method for generating a block by recording a public key and a private key in a block header.

In general, a blockchain is a computer-based decentralized distributed system in which peers participating in a peer-to-peer (P2P) network or participants to create a transaction copy and store all blocks generated in the P2P network.

Conventionally, data recording, storage, and management are performed in a centralized server, whereas in a blockchain, all users participating in a transaction share blocks in which transaction details are stored, and multiple nodes perform verification by collating blocks. It can effectively prevent data forgery and hacking, so it has excellent security.

This block chain is not simply a technology applied only to online virtual currency, but when applied to other file systems, its use field and demand are increasing due to the advantage of reducing huge costs due to database (DB) maintenance and security. It is an exponentially increasing trend.

1 is an exemplary diagram for explaining a conventional block chain, and FIG. 2 is a block diagram for explaining the block of FIG. 1 .

In the conventional block chain of FIG. 1, blocks (10-1, 10-2) and blocks (10-1, 10-2) in which transaction information transacted during the block generation period are stored are generated every preset block generation cycle. It consists of a chain, which is a data link between them.

Blocks 10-1 and 10-2 are newly created every preset block generation cycle, and transaction information transacted during the block generation cycle is stored. At this time, the newly created block is placed next to the previous block and connected to each other by the chain.

Also, blocks 10-1 and 10-2 include a header 11 and a body 12, as shown in FIG.

At this time, the header 11 contains the block header version, block creation time, hash value of the previous block, data summarizing all transaction details of the Merkle Tree, the difficulty of proof-of-work required for block generation, and the Previous block header hashes and nonces are stored, and transaction information that was transacted during the block generation cycle is stored in the body 12 .

In general, the hash value of a block is created by combining the block creation date and time, version, bits, root hash, hash of the previous block, and a temporary value called a nonce, and then converting it into a hash. The creation date and time, version, difficulty, root hash, and hash value of the previous block of the block have already been determined and have a set value, but as the temporary value called nonce changes, the block hash value generated as a result of the hash operation will also vary. can For example, the hash value when the nonce is 1 and the hash value when the nonce is 2 are completely different. A new block is successfully created when the newly generated hash value is smaller than a certain target value while changing this nonce value countless times and substituting it one by one.

The conventional block chain 10 configured in this way uses an irreversible hash function to input an arbitrary number and find a nonce value smaller in size than the result value, thereby creating a block. I adjusted the difficulty by adjusting the size.

Therefore, in the conventional blockchain, it is difficult to raise the difficulty beyond a certain limit, so the difficulty adjustment acted as a limit in controlling the mining time of the blockchain.

An object of the present invention is to provide an apparatus and method for creating a block chain with free difficulty control.

The problem to be solved by the present invention is not limited to the problem(s) mentioned above, and another problem(s) not mentioned will be clearly understood by those skilled in the art from the following description.

A block chain generating apparatus according to an embodiment of the present invention for achieving the above object includes a communication module for communicating with other nodes; at least one processor; and a memory electrically coupled to the processor, wherein, when executed, the processor records a transaction in the body of the second block and generates a public key for encrypting the third block through a public key algorithm. and stored in the header of the second block, and instructions for storing instructions for generating the second block by calculating the private key corresponding to the public key pair encrypted with the first block are stored.

Preferably, the memory, when executed, stores instructions in which the processor divides the header hash of the block by a random prime number p used to generate the public key and uses the remainder as the first private key.

Preferably, the memory stores instructions that, when executed, add to the second block header by obtaining a nonce that causes the processor to become a private key corresponding to a public key pair encrypted with the first block.

Preferably, the memory stores, when executed, instructions for the processor to add a private key corresponding to a public key pair that has encrypted the first block to a second block header.

Preferably, the memory further stores instructions that, when executed, record the difficulty of generating the public key in the header of the second block by the processor.

Preferably, the memory further stores instructions that, when executed, use, by the processor, a header hash of the first block as a seed for generating a public key written to a second block.

The memory further stores instructions that, when executed, cause the processor to write a version, a timestamp, and a Merkle root to a header of the second block.

A method of generating a block chain by a block chain generating apparatus according to an embodiment of the present invention, the method comprising: recording a transaction in a body of a second block; generating a public key for encrypting the third block through a public key algorithm and storing it in the header of the second block; calculating a private key and a nonce corresponding to a public key pair encrypted with the first block; and adding the nonce to the header of the second block to generate a second block.

In the step of calculating a second private key and nonce corresponding to the public key pair encrypted with the second block, the remainder obtained by dividing the header hash of the block by a random prime number p used to generate the public key is the private key, It is characterized in that the nonce is obtained so that the private key corresponding to the public key of the previous block is obtained.

A method of generating a block chain by a block chain generating apparatus according to an embodiment of the present invention, the method comprising: recording a transaction in a body of a second block; generating a public key for encrypting the third block through a public key algorithm and storing it in the header of the second block; calculating a private key corresponding to a public key pair encrypted with the first block; and adding the private key to the header of the second block to generate a second block.

Preferably, in the block chain generation method by the block chain generation device, a second genesis block including a public key for encrypting the first block in a header, and a first genesis including a public key for encrypting the second genesis block The method further includes generating a block.

In the present invention, there is a limit value for increasing the difficulty in the conventional method of finding a nonce value that causes the hash value of a block header to be less than or equal to a certain value, but there is no limit to adjusting the difficulty of the public key algorithm. , it is possible to implement a time-release blockchain without complex cryptographic techniques and effectively respond to the increase in computing power of computers.

1 is an exemplary diagram for explaining a conventional block chain.
FIG. 2 is a block diagram for explaining the detailed configuration of the block of FIG. 1 .
3 is a block diagram illustrating a configuration of an electronic device according to various embodiments of the present disclosure.
4 is a block diagram for explaining a block chain according to the first embodiment of the present invention.
5 is a diagram illustrating an example of a block structure according to the first embodiment of the present invention.
6 is a flowchart illustrating a method of generating a block chain of an electronic device according to the first embodiment of the present invention.
7 is a flowchart illustrating a method for generating a public key according to the first embodiment of the present invention.
8 is a flowchart illustrating a nonce generating method according to the first embodiment of the present invention.
9 is a graph comparing the time required for calculating only the private key and calculating the nonce according to the first embodiment of the present invention.
10 is a block diagram for explaining a block chain according to the second embodiment of the present invention.
11 is a diagram illustrating an example of a block structure according to a second embodiment of the present invention.
12 is a flowchart illustrating a method for generating a block chain of an electronic device according to a second embodiment of the present invention.
13 is a flowchart of a public key algorithm according to a second embodiment of the present invention.

Since the present invention can have various changes and can have various embodiments, specific embodiments are illustrated in the drawings and described in detail in the detailed description. However, this is not intended to limit the present invention to specific embodiments, and it should be understood to include all modifications, equivalents and substitutes included in the spirit and scope of the present invention. In describing each figure, like reference numerals have been used for like elements.

Terms such as first, second, A, and B may be used to describe various elements, but the elements should not be limited by the terms. The above terms are used only for the purpose of distinguishing one component from another. For example, without departing from the scope of the present invention, a first component may be referred to as a second component, and similarly, a second component may also be referred to as a first component. and/or includes a combination of a plurality of related listed items or any of a plurality of related listed items.

When a component is referred to as being “connected” or “connected” to another component, it may be directly connected or connected to the other component, but it is understood that other components may exist in between. it should be On the other hand, when it is said that a certain element is "directly connected" or "directly connected" to another element, it should be understood that the other element does not exist in the middle.

The terms used in the present application are only used to describe specific embodiments, and are not intended to limit the present invention. The singular expression includes the plural expression unless the context clearly dictates otherwise. In the present application, terms such as “comprise” or “have” are intended to designate that a feature, number, step, operation, component, part, or combination thereof described in the specification exists, but one or more other features It should be understood that this does not preclude the existence or addition of numbers, steps, operations, components, parts, or combinations thereof.

Unless defined otherwise, all terms used herein, including technical and scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. Terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with the meaning in the context of the related art, and should not be interpreted in an ideal or excessively formal meaning unless explicitly defined in the present application. does not

Hereinafter, preferred embodiments according to the present invention will be described in detail with reference to the accompanying drawings.

3 is a block diagram illustrating a configuration of an electronic device according to various embodiments of the present disclosure.

Referring to FIG. 3 , the electronic device 100 may include a processor 110 , a memory 130 , and a communication module 150 .

The processor 110 may be driven based on a program stored in the memory 130 . For example, the memory 130 may store instructions that cause the processor 110 to perform various operations. Hereinafter, the operation of the processor 110 may be performed according to instructions stored in the memory 130 . In an embodiment, the processor 110 may be set to control other components of the electronic device 100 .

The memory 130 may store various information related to the operation of the electronic device 100 .

The communication module 150 may provide wired communication or wireless communication between the electronic device 100 and another electronic device.

For example, the communication module 150 may provide wired communication or wireless communication between the electronic device 100 and another node.

The above-described electronic device 100 may be a node or a block chain generating device of a block chain to be described later.

Hereinafter, unless otherwise described, an operation of the electronic device 100 may be referred to as an operation performed by the processor 110 .

first Example

4 is a block diagram for explaining a block chain according to a first embodiment of the present invention, and FIG. 5 is a diagram showing an example of a block structure according to the first embodiment of the present invention.

As shown in Fig. 4, a structure in which each block is connected with two genesis blocks as a starting point is called a block chain.

In one embodiment of the present invention, a block is created by recording a transaction in the body, calculating a private key paired with the public key that encrypted the previous block, and obtaining a nonce value using the calculated private key. . Thereafter, the public key of the next block is generated using the public key generation function and stored in the header of the block. The public key generation function in an embodiment of the present invention is used by modifying the elgamal encryption method.

Hereinafter, the block chain structure of the present invention will be described in detail.

In an embodiment of the present invention, two genesis blocks are used as starting points.

Each genesis block stores the public key of the block 2 blocks later. That is, the first genesis block G1 stores the public key paired with the private key recorded in the first block, and the second genesis block G2 stores the public key paired with the private key recorded in the second block. save the The second genesis block G2 is encrypted by the public key recorded in the first genesis block G1, and the first block is encrypted by the public key recorded in the second genesis block G2.

This will be described in detail later. Prior to the description, referring to FIG. 5 , referring to the block structure according to the first embodiment of the present invention, the block 500 may include a header 510 and a body 530 .

Components of header 510 of block 500 include version 511, timestamp 512, merkle root 513, difficulty 514, nonce 515, next block public key 516 . Body 530 contains a transaction.

Version 511 includes a version number for tracking software/protocol upgrades. The size of the version number is 4 bytes.

The timestamp 512 may include the time the block was created. The timestamp 512 may be a Unix timestamp. The size of the timestamp is 4 bytes. A Unix timestamp is a representation of how many seconds have passed since January 1, 1970, 0:0:0 (UTC).

The Merkle root 513 is a hash of the root of the Merkle tree generated from the transaction included in the body 530 of the block. The size of the Merkle hash is 32 bytes.

The difficulty 514 is a numerical value for adjusting the difficulty for the proof of work of the block.

The difficulty is related to the creation time of the block. For example, in the case of Bitcoin, blocks are created with an average cycle of 10 minutes, and the frequency of currency issuance and transaction settlement speed are determined according to this cycle. This cycle should be kept constant for decades, not for a short period of time. Since the number of computers participating in mining and their performance change over time, the time taken for mining can be adjusted by appropriately adjusting the mining difficulty.

In a perfectly decentralized network, the above difficulty reset is automatically executed independently on every node. In the case of Bitcoin, the difficulty resets every 2,016 blocks. Measure the time it takes to find the last 2,016th block through the reset equation, and reset the difficulty by comparing the measured time and the estimated time (20,160 minutes). If the network finds a block faster than the expected time, the difficulty goes up, and if it finds a block slowly, the difficulty goes down.

In the conventional block chain, there is a limit that the difficulty of the hash function must be smaller than that of the hash function, but according to an embodiment of the present invention, it can be freely set without any particular limitation in setting the difficulty. The size assigned to the difficulty field is 4 bytes.

The nonce 515 is a value such that the remainder obtained by dividing the header hash of the block by p becomes the private key (R1) paired with the public key (P1) (stored in the header of the block two blocks before) that encrypts the previous block. The private key is one of 1 to (p-1). The contents of a block cannot be changed without recalculating the nonce. The size of the nonce is 4 bytes.

The next block public key 516 is a public key (P3) paired with the private key recorded in the block two blocks behind, and is a public key (P3) for encrypting the next block. The public key 516 for encrypting the next block is determined by the header hash of the previous block. The size of the public key may be variable.

The second block encrypts the transaction by using the public key (P2) included in the header of the second genesis block.

The body 530 of block 500 contains a transaction for a transaction.

In more detail, the body 530 field may include, for example, a transaction count, a coinbase transaction, a transaction, and the like. Transaction count refers to the number of transactions in the block body. It can include transactions that pay Coinbase block mining rewards.

6 is a flowchart illustrating a method of generating a block chain of an electronic device according to a first embodiment of the present invention, FIG. 7 is a flowchart illustrating a method of generating a public key according to the first embodiment of the present invention, and FIG. 8 is It is a flowchart for explaining the nonce generating method according to the first embodiment of the present invention. 9 is a graph comparing the time required for calculating only the private key and calculating the nonce according to the first embodiment of the present invention.

Next, a block chain generation method of an electronic device according to an embodiment of the present invention will be described with reference to FIGS. 4 to 8 .

First, it is assumed that the first genesis block and the second genesis block are generated.

The two genesis blocks are hardcoded. The genesis block does not contain a nonce because it does not have the public key for the previous block.

The first genesis block includes a public key (P1) paired with the private key recorded in the first block in the header, and the second genesis block includes a public key (P1) paired with the private key recorded in the second block in the header P2).

First, a transaction is added to the body of the empty block (S100). At this time, you can add a transaction for block mining rewards or a signature that proves the transaction.

The difficulty of generating the public key is recorded in the header of the second block (S120). In the first embodiment of the present invention, the difficulty is the length of the public key. Also, in step S120, a version, a timestamp, and a merkle root are further recorded in the header of the second block.

The public key of the private key pair recorded in the fourth block is generated through the public key algorithm and stored in the header of the second block (S140). The transaction of the third block is encrypted by the public key stored in the header of the second block, and the transaction of the third block is decrypted by the private key stored in the header of the fourth block.

The public key generation will be described with reference to FIG. 7 . The public key algorithm shown in FIG. 7 is only an example, and is not limited thereto.

In general, in public key encryption, a private key is already created at the time of generating a public key, or a private key and a public key are generated at the same time. In order to generate and encrypt a public key without knowing the private key, a method of verifying whether a randomly generated public key is a valid public key must be used.

First, a public key is generated using the header hash of the previous block as a seed.

More specifically, a random prime p with the previous block header hash as a seed is found. Determine a circular group G of degree p and its generator A.

The generator proceeds in the same way as finding the primitive root of a prime number p. The process of finding a generator is as follows.

(p), p-1을 s라 하고, s의 소인수 분해한 결과를 a*b*c라고 가장한다. 여기서 기존의 소인수분해 방법은 큰 수에 대하여 오랜 시간을 소요하므로, 아래와 같은 방법으로 진행한다.1. prime number p

(p), p-1 is assumed to be s, and the result of prime factorization of s is assumed to be a*b*c. Here, since the existing prime factorization method takes a long time for a large number, it proceeds as follows.

1-1. Pick any prime number q.

1-2. If p = 2*q + 1, then q is a prime factor of p.

1-3. Let p = p/q, and proceed from step 1-1 again.

2. At this time, for any integer g, if the result of mod s of a ^ (b*c), b ^ (a*c), c ^ (a*b) is a number other than 1, g is a prime number. is the primitive root of p.

3. Also, if gcd (g ^ n , p) is 1 for any integer n, g ^ n is also a generator.

Then, verification is performed on whether the generated public key is valid, and if it is determined that the generated public key is invalid, the process returns to the step of generating the public key again. If it is determined that the public key is valid, the public key is output. As such, since the header hash of the previous block is used as a random seed, illegal mining that generates a public key through an unauthorized private key can be prevented.

Returning to FIG. 6 again, a nonce is generated using the private key corresponding to the first public key pair encrypted with the first block (S160).

More specifically, with reference to FIG. 8, by increasing the nonce from 0 to 1, the nonce that divides the header hash of the block by P of Elgamal encryption becomes the key key corresponding to the public key of the previous block. . Since the private key is one of 1 to (p-1), the nonce must be obtained through the above proof-of-work.

It checks whether the private key that found the nonce is a valid key, and if it is determined that it is valid, the private key and the nonce at this time are output. Creating a block in this way may be referred to as mining. If it is determined that the private key that found the nonce is not a valid key, the process returns to the step of finding the private key.

The first private key is added to the header of the second block, and the generated second block is propagated to neighboring nodes by a broadcast method (S180).

Here, the unencrypted transaction immediately becomes a pending state and waits to be recorded in the body of the block. If an encrypted transaction cannot be recorded in a block using the corresponding public key, the transaction is canceled.

A node that has received the block generated by the method as shown in FIG. 6 verifies the block and then adopts it.

According to the first embodiment of the present invention, when the contents are modified in a block, the merkle root is changed and thus the header hash is also greatly changed, so the nonce value must be newly calculated. In this way, the nonce calculation according to the content modification differs from the initial mining in that the private key is known. However, since it is not known how the header hash will change depending on the nonce value, it will take a similar amount of time to the initial mining time even if the private key is known.

이므로 채굴을 n번 시도해서 논스를 못 찾을 확률인

에 비해서 작은 값이다. 적당히 큰 소수인 2,147,483,647을 p로 두고 n번 시도해서 개인키를 못 찾을 확률은 도 9와 같다.On the other hand, if you anticipate an attack method that calculates only the private key of the previous block, the probability of not finding the private key after n attempts is

Therefore, the probability of not finding a nonce after n attempts to mine is

is a small value compared to The probability of not finding the private key by trying n times with 2,147,483,647, which is a moderately large prime number, as p is shown in FIG. 9 .

A1 is the case where only the private key is calculated, and B1 is the case where the nonce is calculated. However, such an attack has little effect on the network. In addition, since such mining cannot receive mining rewards, there will be few attackers who adopt an attack method that calculates only the private key.

second Example

10 is a block diagram for explaining a block chain according to a second embodiment of the present invention, and FIG. 11 is a diagram showing an example of a block structure according to a second embodiment of the present invention.

As shown in FIG. 10, a structure in which each block is connected with the genesis block as a starting point is called a block chain.

In an embodiment of the present invention, two genesis blocks are used as starting points.

A transaction is recorded in the body, a private key paired with the public key that encrypted the previous block is calculated, and the calculated private key is stored in a header to generate a block. Thereafter, a public key for encrypting the next block is generated using the public key generation function and stored in the header of the block.

Each genesis block contains a public key paired with a private key recorded in blocks two blocks later. That is, the first genesis block G1 includes a public key paired with the private key recorded in the first block, and the second genesis block G2 includes a public key paired with the private key recorded in the second block. save the

This will be described in detail later. Prior to the description, referring to FIG. 10 , referring to the block structure according to an embodiment of the present invention, the block 600 may include a header 610 and a body 630 .

Header 610 of block 600 includes version 611, timestamp 612, merkle root 613, difficulty 614, previous block private key 615, next block public key 616 . Body 630 contains a transaction.

Version 611 includes the software/protocol version.

The time stamp 612 may include a time when the block was created.

The merkle root 613 may include the root of the merkle tree for verifying the contents of the body 630 .

The difficulty level 614 may include a value for adjusting the difficulty level. As will be described later, according to an embodiment of the present invention, the difficulty can be freely set, unlike the application of the difficulty of the hash function in the conventional block chain. That is, there is no limit to the difficulty setting.

The previous block private key 615 is a private key R1 paired with the public key P1 stored in the header of the block before two blocks. That is, the previous block private key 615 is paired with the public key P1 that encrypted the immediately preceding block.

The next block public key 616 is a public key P3 paired with the private key stored in the header of the block two blocks later. That is, the second block encrypts the transaction by using the public key P3 included in the header of the first block. The encrypted second block transaction is decrypted when the third block is mined and the private key R3 paired with the public key P3 is mined.

The body 630 of block 600 contains a transaction for a transaction.

12 is a flowchart illustrating a method of generating a block chain of an electronic device according to an embodiment of the present invention, and FIG. 13 is a flowchart illustrating a method of generating a public key according to a second embodiment of the present invention. Next, a block chain generation method of an electronic device according to an embodiment of the present invention will be described with reference to FIGS. 10 to 13 .

First, it is assumed that the first genesis block and the second genesis block are generated. The first genesis block includes a public key (R1) paired with the private key recorded in the first block in the header, and the second genesis block is paired with the private key (R2) recorded in the second block in the header contains the public key constituting the

First, a transaction is added to the body of the empty block (S200). At this time, you can add a transaction for block mining rewards or a signature that proves the transaction.

The difficulty of generating the public key is recorded in the header of the second block (S220). In addition, a version, a timestamp, and a merkle root are further recorded in the header of the second block.

A public key for encrypting the third block is generated through the public key algorithm and stored in the header of the second block (S240). For reference, the private key paired with the public key for encrypting the third block is recorded in the header of the fourth block.

In more detail, a method of generating a public key will be described with reference to FIG. 13 . 13, the public key algorithm according to the second embodiment of the present invention uses a hyperbolic algorithm. However, the public key algorithm shown in FIG. 13 is only an example and is not limited thereto. Assume that the public key is (r,s,x,y). Since the speed of unlocking a block is different depending on the length of the public key, that is, the difficulty level, the difficulty can be controlled by adjusting the length of the public key, and accordingly, the block generation speed can be adjusted.

As shown in FIG. 13, the result value encrypted by the public key of the first block is used as a seed for generating the public key of the third block of the public key algorithm.

Returning to FIG. 12 again, the second block is generated by calculating one private key corresponding to the public key pair encrypted with the first block (S260). Creating a block in this way may be referred to as mining.

The first private key is added to the header of the second block, and the generated second block is propagated to neighboring nodes by a broadcast method (S280). As the first private key is mined, the transaction of the first block is decrypted.

Here, the unencrypted transaction immediately becomes a pending state and waits to be recorded in the body of the block. If an encrypted transaction cannot be recorded in a block using the corresponding public key, the transaction is canceled.

A node that has received the block generated by the method as shown in FIG. 13 verifies the block and then adopts it.

As described above, the time release block chain according to an embodiment of the present invention encrypts the contents of the block using Proof of Work (PoW) among the consensus algorithms of the block chain and decrypts the contents after a certain period of time. It is a blockchain that provides the ability to reveal the contents after a certain time delay by finding a key that can be used.

The difficulty of the public key used to encrypt the block is appropriately adjusted by the computational power of the nodes participating in the blockchain network, so that a time-release blockchain can be implemented without complex cryptographic techniques, and it can effectively respond to the increase in computational power of the computer. .

In addition, the generated value is utilized in a smart contract to encrypt and protect the votes used in the election during the voting period, and when the voting period is over, the votes are decrypted by the mining node to automatically count the votes, etc. .

In addition, according to an embodiment of the present invention, since the hash value of the block header is used to generate the public key of the two blocks later, the block after the modulated block is recalculated without including the forged block. Therefore, it aims to popularize the blockchain more quickly and safely.

Meanwhile, the above-described embodiments of the present invention can be written as a program that can be executed on a computer, and can be implemented in a general-purpose digital computer that operates the program using a computer-readable recording medium.

The computer-readable recording medium includes a magnetic storage medium (eg, a ROM, a floppy disk, a hard disk, etc.) and an optically readable medium (eg, a CD-ROM, a DVD, etc.).

So far, the present invention has been looked at with respect to preferred embodiments thereof. Those of ordinary skill in the art to which the present invention pertains will understand that the present invention can be implemented in a modified form without departing from the essential characteristics of the present invention. Therefore, the disclosed embodiments are to be considered in an illustrative rather than a restrictive sense. The scope of the present invention is indicated in the claims rather than the foregoing description, and all differences within the scope equivalent thereto should be construed as being included in the present invention.

Claims (14)

a communication module for communicating with other nodes;
at least one processor; and
a memory electrically coupled to the processor;
The memory, when executed, causes the processor to:
A transaction is recorded in the body of the second block, and a public key for encrypting the third block is generated through a public key algorithm and stored in the header of the second block, and corresponds to the second block public key pair encrypted with the first block A block chain generating device that stores instructions for generating a second block by calculating a private key. According to claim 1,
The memory, when executed, causes the processor to:
A block chain generating device further storing commands using the remainder of dividing the header hash of the block by the random prime p used to generate the public key as a private key. According to claim 1,
The memory, when executed, causes the processor to:
A block chain generating apparatus for storing instructions for obtaining a nonce to become a private key corresponding to a second block public key pair encrypted with the first block and adding the nonce to the second block header. According to claim 1,
The memory, when executed, causes the processor to:
A block chain generating apparatus for storing instructions for adding a private key corresponding to a second block public key pair encrypted with the first block to a second block header. According to claim 1,
The memory, when executed, causes the processor to:
A block chain generating apparatus further storing instructions using the header hash of the first block as a seed for generating a fourth block public key recorded in a second block. According to claim 1,
The memory, when executed, causes the processor to:
A block chain generating apparatus further storing instructions for recording the difficulty of generating a public key in the header of the second block. According to claim 1,
The memory, when executed, causes the processor to:
A block chain generating apparatus further storing instructions for recording a version, a timestamp, and a Merkle root in the header of the second block. A block chain generation method by a block chain generation device, comprising:
recording the transaction in the body of the second block;
generating a fourth block public key for encrypting the third block through a public key algorithm and storing the fourth block public key in the header of the second block;
calculating a private key and a nonce corresponding to a second block public key pair that encrypted the first block; and
generating a second block by adding the nonce to a header of a second block;
A method of creating a blockchain that includes 9. The method of claim 8,
Calculating a second private key and a nonce corresponding to the public key pair encrypted with the second block,
A method of generating a block chain, characterized in that the remainder obtained by dividing the header hash of the block by the random prime number p used to generate the public key is used as a private key, and a nonce is obtained so that the private key corresponding to the public key of the previous block is obtained. A block chain generation method by a block chain generation device, comprising:
recording the transaction in the body of the second block;
generating a fourth block public key for encrypting a third block through a public key algorithm and storing the fourth block public key in a header of the second block;
calculating a private key corresponding to a second block public key pair encrypted with the first block; and
generating a second block by adding the private key to the header of the second block;
A method of creating a blockchain that includes 11. The method of claim 8 or 10,
The block chain generation method further comprising the step of recording the difficulty of public key generation in the header of the second block. 11. The method of claim 8 or 10,
In the step of generating a fourth block public key for encrypting the third block and storing it in the header of the second block,
A block chain generation method using the header hash of the first block as a seed for generating a fourth block public key recorded in the second block. 11. The method of claim 8 or 10,
The method further comprising the step of recording a version, a timestamp, and a merkle root in the header of the second block. 11. The method of claim 8 or 10,
Before recording the transaction in the body of the second block,
generating, in a header, a second genesis block including a second block public key for encrypting the first block, and a first genesis block including a first block public key for encrypting the second genesis block;
A method of creating a blockchain that includes

Images