Blockchain data compression and storage
US-11652604-B2 · May 16, 2023 · US
US2024275621A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2024275621-A1 |
| Application number | US-202418444769-A |
| Country | US |
| Kind code | A1 |
| Filing date | Feb 19, 2024 |
| Priority date | Aug 18, 2021 |
| Publication date | Aug 15, 2024 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A first blockchain node determines a block type of a first block and determines the first block based on the block type of the first block. The first blockchain node sends the first block to a second blockchain node and the second blockchain node determines the block type of the first block. The second blockchain node performs block verification on the first block based on the block type of the first block. After verification succeeds, the second blockchain node updates a first blockchain, where the block type is a first type or a second type. The first blockchain node and the second blockchain node are configured to maintain the first blockchain, and the first blockchain includes at least one first-type block and at least one second-type block.
Opening claim text (preview).
What is claimed is: 1 . A blockchain generation method, comprising: determining, by a first blockchain node, a block type of a first block, wherein the block type is a first type or a second type; determining, by the first blockchain node, the first block based on the block type of the first block; and sending, by the first blockchain node, the first block to a second blockchain node, wherein the first blockchain node and the second blockchain node are configured to maintain a first blockchain comprising at least one first-type block and at least one second-type block. 2 . The method according to claim 1 , further comprising: determining, by the first blockchain node, first information comprising one or more of the following information: preposition block information of the first block, second-type block reference information, block confirmation information, transaction information, or a block confirmation period; and obtaining, by the first blockchain node, a block header of the first block based on the first information. 3 . The method according to claim 2 , wherein the obtaining, by the first blockchain node, a block header of the first block based on the first information comprises: performing, by the first blockchain node, one or more of the following processing on the first information: generating a first Merkle tree based on the transaction information or generating a second Merkle tree based on the second-type block reference information; performing, by the first blockchain node, a hash operation on at least one of the first Merkle tree, the preposition block information, or the second Merkle tree, to obtain a third Merkle tree; and obtaining, by the first blockchain node, the block header of the first block based on a root of the third Merkle tree. 4 . The method according to claim 2 , wherein the determining, by a first blockchain node, a block type of a first block comprises: performing, by the first blockchain node, a hash operation on the block header of the first block; and determining, by the first blockchain node, the block type of the first block based on a result of the hash operation. 5 . The method according to claim 4 , wherein the determining, by the first blockchain node, the block type of the first block based on a result of the hash operation comprises: when the result of the hash operation is less than or equal to a first threshold, determining, by the first blockchain node, that the block type of the first block is the first type; or when the result of the hash operation is greater than a first threshold, and the result of the hash operation is less than a second threshold, determining, by the first blockchain node, that the block type of the first block is the second type, wherein the first threshold is less than the second threshold. 6 . A blockchain generation method, comprising: receiving, by a second blockchain node, a first block from a first blockchain node; determining, by the second blockchain node, a block type of the first block, wherein the block type is a first type or a second type; performing, by the second blockchain node, block verification on the first block based on the block type of the first block; and after block verification succeeds, updating, by the second blockchain node, a first blockchain, wherein the first blockchain node and the second blockchain node are configured to maintain the first blockchain, and the first blockchain comprises at least one first-type block and at least one second-type block. 7 . The method according to claim 6 , wherein the determining, by the second blockchain node, a block type of the first block comprises: determining, by the second blockchain node, a hash value of the first block; and when the hash value of the first block is less than or equal to a first threshold, determining, by the second blockchain node, that the block type of the first block is the first type; or when the hash value of the first block is greater than a first threshold, and a first hash value is less than a second threshold, determining, by the second blockchain node, that the block type of the first block is the second type, wherein the first threshold is less than the second threshold. 8 . The method according to claim 6 , wherein the determining, by the second blockchain node, a block type of the first block comprises: receiving, by the second blockchain node, the block type of the first block from the first blockchain node. 9 . The method according to claim 6 , wherein when the block type of the first block is the second type, the performing, by the second blockchain node, block verification on the first block based on the block type of the first block comprises one or more of the following: verifying whether a proof of membership of transaction information in the first block is correct; verifying whether a transaction in the first block is valid; verifying whether a first Merkle tree in the first block is correct; or verifying whether a hash value of a block header of the first block is correct. 10 . The method according to claim 6 , wherein when the block type of the first block is the first type, the performing, by the second blockchain node, block verification on the first block based on the block type of the first block comprises one or more of the following: verifying whether a proof of membership of second-type block reference information in the first block is correct; verifying whether a proof of membership of block confirmation information in the first block is correct; verifying whether a proof of membership of a preposition block of the first block is correct; or verifying whether a hash value of a block header of the first block is correct. 11 . A blockchain generation apparatus, comprising: a processor; a communication interface to connect to a first blockchain node; and a memory including instructions that, when executed by the processor, cause the apparatus to: determine a block type of a first block, wherein the block type is a first type or a second type, and determine the first block based on the block type of the first block; and send the first block to a second blockchain node, wherein the first blockchain node and the second blockchain node are configured to maintain a first blockchain, and the first blockchain comprises at least one first-type block and at least one second-type block. 12 . The apparatus according to claim 11 , wherein the instructions, when executed by the processor, further cause the apparatus to: determine first information, wherein the first information comprises one or more of the following information: preposition block information of the first block, second-type block reference information, block confirmation information, transaction information, or a block confirmation period; and obtain a block header of the first block based on the first information. 13 . The apparatus according to claim 12 , wherein when obtaining the block header of the first block based on the first information, the instructions, when executed by the processor, further cause the apparatus to: perform one or more of the following processing on the first information: generating a first Merkle tree based on the transaction information or generating a second Merkle tree based on the second-type block reference information; perform a hash operation on at least one of the first Merkle tree, the preposition block information, or the second Merkle tree, to obtain a third Merkle tree; and obtain the block header of the first block based on a root of the third Merkle tree. 14 . The appara
Trees, e.g. B+trees · CPC title
Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor · CPC title
involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD · CPC title
using hash chains, e.g. blockchains or hash trees · CPC title
Business processing using cryptography · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.