# US 2022/0035796 A1 · Block Confirmation Method, Device and Storage Medium

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

- Number: US 2022/0035796 A1
- Document ID: US20220035796A1
- Status: Published application
- Kind: A1
- Application number: 17/296,981
- Filed: 2019-11-23
- Published: 2022-02-03
- Earliest claimed: 2018-11-28
- Assignees: Jiangsu Fuzamei Technology Co., Ltd
- Applicants: Jiangsu Fuzamei Technology Co., Ltd.
- Inventors: Sijin WU; Zhiwen WANG
- Web page: https://patentgrep.com/patent/US20220035796A1

## CPC

- G06F 16/2379: {Updates performed during online database operations; commit processing}
- G06Q 20/0655: {e-cash managed centrally}
- G06Q 20/3821: {Electronic credentials}
- G06Q 20/389: {Keeping log of transactions for guaranteeing non-repudiation of a transaction}
- G06Q 20/405: {Establishing or using transaction specific rules}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/3247: {involving digital signatures}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2209/463: Electronic voting
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A block confirmation method, a device, and a storage medium are provided. The method comprises: receiving several pieces of voting information of a first block, the voting information being generated by means of a signature after a committee node has received the first block packaged and broadcasted by a first recording node and verifies the first block successfully (S13); determining whether the voting information satisfies a preconfigured voting confirmation rule; if so, performing packaging according to the voting information to generate a first transaction (S14); and packaging the first transaction into a second block (S15). Said method shortens the block confirmation time, reduces the risk of double spending, improves the performance of blockchain systems, and provides a good user experience for users.

## Claims

### Claim 1

A block confirmation method, comprising:
receiving several pieces of voting information of a first block, wherein the voting information is generated by means of a signature after a committee node has received the first block packaged and broadcasted by a first recording node and verifies the first block successfully;
determining whether the voting information satisfies a preconfigured voting confirmation rule; if so, performing packaging according to the voting information to generate a first transaction; and
packaging the first transaction into a second block.

### Claim 2 (depends on 1)

The method, as recited in claim 1, wherein the second block is a next block of the first block.

### Claim 3 (depends on 1)

The method, as recited in claim 1, wherein the second block is the nth block after the first block, and n is a positive integer greater than 1.

### Claim 4 (depends on 1, 2, 3)

The method, as recited in any of claims 1-3, wherein the step to determine whether each of the voting information satisfies the preconfigured voting confirmation rule comprises:
determining whether the quantity of the currently received voting information is not less than the quantity of voting information required by the current time point confirmation block for confirming the block, wherein the number of voting information required by the current time point confirmation block for confirming the block is determined according to the relationship between the preconfigured block packing timer and the quantity of voting information required for confirming the block.

### Claim 5 (depends on 1, 2, 3)

The method, as recited in any of claims 1-3, wherein for said step to determine whether each of the voting information satisfies the preconfigured voting confirmation rule: if yes, packaging to generate a first transaction according to the voting information, which comprises:
determining whether the quantity of the currently received voting information is not less than the quantity of voting information required by the current time point confirmation block for confirming the block:
if yes, the voting information which does not exceed the quantity of votes allowed by the current time point is selected from the voting information, and the selected voting information is packaged to generate the first transaction.

### Claim 6 (depends on 1, 2, 3)

The method, as recited in any of claims 1-3, wherein the step of packing the first transaction into the second block comprises:
sorting and packaging the first transaction with other common transactions to a second block, wherein the arrangement sequence number of the first transaction is the first.

### Claim 7 (depends on 1, 2, 3)

The method, as recited in any of claims 1-3, wherein before receiving several pieces of the voting information of the first block, the node of the blockchain further performs the following operations:
calculating a first value according to a first formula; and
determining whether the first value satisfies a first condition:
if yes, broadcasting the first value to a blockchain network to become a committee node, and sorting the first values, wherein the committee node corresponding to the first value with the smallest sequence number is the accounting node.

### Claim 8 (depends on 7)

The method, as recited in claim 7, wherein the first formula is configured as:
hash1=Hash(sig(Hash(addr( )+time+hash(H−1)+hash(H−2)+hash(H−3)))), where H is the block height of the second block, hash1 is the first value, Hash( ) is the hash algorithm, sig( ) is the encryption algorithm, addr( ) is the public key address of the node, time is the generation time of the first block, hash(H−1) is the first value of the recording node of the first block before the second block, hash(H−2) is the first value of the recording node of the second block before the second block, hash(H−3) is the first value of the recording node of the third block before the second block.

### Claim 9 (depends on 7)

The method, as recited in claim 7, wherein the node of the blockchain is configured with a first contract, adapted for:
the system difficulty value is adjusted every a predetermined block height, wherein whether the first value satisfies a first condition is determined according to the system difficulty value.

### Claim 10 (depends on 1, 2, 3)

The method, as recited in any of claims 1-3, wherein the node of the blockchain is configured with a first contract, adapted for:
after the committee node receives the first block packaged and broadcasted by the first recording node and after the first block is successfully verified and signed, certain interests held by the committee node is deducted.

### Claim 11 (depends on 1, 2, 3)

The method, as recited in any of claims 1-3, wherein the node of the blockchain is configured with a first contract, adapted for:
monitoring if voting information of other first block from the time at which each of the voting information is packaged to generate the first transaction is received:
if yes, deducting a certain right held by the node broadcasting the voting information of the other first block.

### Claim 12 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11)

A device, comprising:
one or more processors; and
a storage, adapted for storing one or more program, wherein when said one or more program was executed by said one or more processor, said one or more processor is allowed to execute the method, as recited in any of the claims 1-11.

### Claim 13 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11)

A storage medium with program stored therein, wherein said program is executed by a processor so as to perform the method, as recited in any of the claims 1-11.
