# US 2019/0379538 A1 · Method and apparatus for selecting distributed consensus node based on proof of nonce

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0379538 A1
- Document ID: US20190379538A1
- Status: Published application
- Kind: A1
- Application number: 16/431,333
- Filed: 2019-06-04
- Published: 2019-12-12
- Earliest claimed: 2018-06-12
- Assignees: Electronics and Telecommunications Research Institute
- Applicants: Electronics and Telecommunications Research Institute
- Inventors: Jin Tae Oh; Joon-Young Park; Ki-Young Kim
- Web page: https://patentgrep.com/patent/US20190379538A1

## CPC

- G06F 16/9014: {hash tables}
- H04L 9/0869: {involving random numbers or seeds}
- G06F 16/1824: {implemented using Network-attached Storage [NAS] architecture (distributed or networked storage systems G06F3/067; protocols for distributed storage of data in a network H04L67/1097)}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Disclosed herein is a method for selecting a consensus node in an apparatus for generating a blockchain. The method may include reading a nonce from the nonce chain of a node, performing an operation on the read nonce and previous height information, and comparing the result of the operation with a reference value in order to select the node as a consensus node.

## Claims

### Claim 1

A method for selecting a consensus node in an apparatus for generating a blockchain, comprising:
reading a nonce from a nonce chain of a node;
performing an operation on the read nonce and previous height information; and
comparing a result of the operation with a reference value in order to select the node as the consensus node.

### Claim 2 (depends on 1)

The method of claim 1, wherein the nonce chain is a hash chain.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
generating the nonce chain.

### Claim 4 (depends on 3)

The method of claim 3, wherein generating the nonce chain comprises:
generating the nonce chain using a master key that is kept private by the node.

### Claim 5 (depends on 4)

The method of claim 4, wherein generating the nonce chain using the master key comprises:
generating a base using the master key;
generating a hash chain by repeatedly hashing the base multiple times; and
setting a start height from which the hash chain starts to be used.

### Claim 6 (depends on 1)

The method of claim 1, wherein a length of the nonce chain is determined according to a period at which a block is periodically generated.

### Claim 7 (depends on 1)

The method of claim 1, wherein performing the operation comprises:
hashing the read nonce and the previous height information.

### Claim 8 (depends on 1)

The method of claim 1, wherein the previous height information includes a hash value of a header of a previous block.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
disclosing a final nonce value of the nonce chain, a start height from which the nonce chain starts being used, and an address of the node to other nodes when the result of the operation is determined to be less than the reference value as a result of comparison.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
registering nonce chain information of the other nodes in an elite pool,
wherein the nonce chain information includes an address of a corresponding node, a final nonce value of a corresponding nonce chain, and a start height from which the corresponding nonce chain starts being used.

### Claim 11 (depends on 9)

The method of claim 9, wherein the address of the node includes at least one of a public key and a value through which the node is identified.

### Claim 12 (depends on 1)

The method of claim 1, wherein, in order to prevent all nodes, including the node, from predicting whether each of the nodes is selected as a consensus node for a block subsequent to a previous block until the previous block is generated, the consensus node is selected using information related to the previous block.

### Claim 13 (depends on 1)

The method of claim 1, wherein the nonce read from the nonce chain is used as a nonce of a hash function such that all nodes, including the node, are provided with an opportunity for calculation, through which a node is selected as the consensus node, only once for each height.

### Claim 14 (depends on 1)

The method of claim 1, wherein, when a number of nodes that are able to participate in distributed consensus is n, when a minimum number of nodes required for the distributed consensus is x, and when a cumulative probability that a number of selected nodes is equal to or less than the minimum number is k, a number of distributed consensus nodes is controlled by variables n, x and k.

### Claim 15 (depends on 14)

The method of claim 14, wherein k, which is the cumulative probability, has a binomial distribution characteristic.

### Claim 16 (depends on 14)

The method of claim 14, wherein a probability that the node is selected as the consensus node is Px,k, which is a probability value acquired by conducting a Bernoulli trial based on the variables n, x and k.

### Claim 17

A method for verifying a consensus node in an apparatus for generating a blockchain, comprising:
receiving a nonce value, a height of a new block, and an address of a first node from the first node that is selected as the consensus node;
retrieving a final nonce value and a start height, corresponding to the address of the first node, from an elite pool of a second node;
subtracting the start height from the height of the new block;
hashing the nonce value from the new block as many times as a result of subtraction; and
comparing a result of hashing with the nonce value received from the first node in order to verify whether the first node is eligible to serve as the consensus node.

### Claim 18 (depends on 17)

The method of claim 17, wherein, when the result of hashing is equal to the final nonce value, a block generation permission of the first node is verified.

### Claim 19 (depends on 17)

The method of claim 17, wherein, when the result of hashing is not equal to the final nonce value, the first node is demoted when generating a block or using the blockchain.

### Claim 20

An apparatus for generating a blockchain, comprising:
at least one processor; and
a memory for storing at least one instruction executed by the at least one processor,
wherein the at least one instruction is executed by the at least one processor such that a nonce is read from a nonce chain of a node, such that an operation is performed on the read nonce and previous height information, and such that a result of the operation is compared with a reference value in order to select the node as a consensus node.
