Graphic-blockchain-orientated sharding storage apparatus and method thereof

Patent metadata

Field	Value
Publication number	US-12461785-B2
Application number	US-202217806614-A
Country	US
Kind code	B2
Filing date	Jun 13, 2022
Priority date	Jul 12, 2021
Publication date	Nov 4, 2025
Grant date	Nov 4, 2025

Abstract

The present invention relates to a graphic-blockchain-orientated sharding storage apparatus, at least comprising a first sharding module and a second sharding module, wherein the first sharding module shards nodes having different resource capacity levels based on ledger data organized using a DAG structure, and the second sharding module assigns transactions to the shards matching with execution difficulty levels of the transactions, so that each said transaction is processed and stored in the shard corresponding thereto. The present invention incorporates the sharding technology into a graphic blockchain to provide a graphic-blockchain-orientated sharding storage method, so as to reduce pressure in terms of data storage and transaction processing on nodes of the graphic blockchain system. In addition, nodes, transactions, and data are dynamically divided according to resource heterogeneity among nodes, so as to further enhance performance of the graphic blockchain system while achieving efficient use of resources.

First claim

What is claimed is:

1 . A graphic-blockchain-orientated sharding storage apparatus, comprising
a first sharding module and a second sharding module, wherein the first sharding module divides nodes having different resource capacity levels into shards based on ledger data organized using a directed acyclic graph (DAG) structure, and the second sharding module assigns a set of transactions, so that each respective transaction of said set of transactions is processed and stored in a shard matched with an execution difficulty level of the respective transaction, wherein the first sharding module rates the different resource capacity levels of the nodes to get rating results, and each of the nodes solves a Hash puzzle through a Proof of Work (PoW) mechanism so as to obtain a PoW result, wherein each node in a shared shard has an equal resource capacity rating, wherein each respective shard of the shards has a processing capacity matching a working difficulty for processing transactions of the respective shard, and the transactions of the respective shard execute using the processing capacity of the respective shard, wherein each respective node of the nodes broadcasts a rating result and a PoW result of the respective node, so as to discover members and establish the shards, wherein each respective shard of the shards only stores a part of a DAG ledger, and each node of the respective shard only stores a copy of the part of the DAG ledger, wherein a transaction newly added to the DAG ledger is only broadcasted to a shard matched with an execution difficulty level of the newly added transaction and is stored by each node in the shard matched with the execution difficulty level of the newly added transaction, wherein the graphic-blockchain-orientated sharding storage apparatus is configured to reconstruct the shards, so that all of the nodes are re-sharded, in order to start a new round of a consensus process, wherein the graphic-blockchain-orientated sharding storage apparatus is configured such that each transaction, when added into the DAG ledger, has to randomly select two Tip transactions for validation, wherein each respective Tip transaction of the two Tip transactions is a transaction that is at a tail of the ledger data and has not been validated, and that in the DAG ledger, for each respective Tip transaction, an accumulated confirmation value of the respective Tip transaction is used to represent a number of transactions that directly or indirectly validated the respective Tip transaction, and when the accumulated confirmation value reaches a preset threshold, determining that the respective Tip transaction is in a confirmed state.

2 . A graphic-blockchain-orientated sharding storage method, comprising:
dividing nodes having different resource capacity levels into shards on basis of ledger data organized using a directed acyclic graph (DAG) structure; and assigning a set of transactions, so that each respective transaction of said set of transactions is processed and stored in a shard matched with an execution difficulty level of the respective transaction,
wherein the step of dividing nodes having different resource capacity levels into shards comprises:
rating the different resource capacity levels of the nodes to get rating results; and
having each of the nodes solve a Hash puzzle through a Proof of Work (PoW) mechanism so as to obtain a PoW result,

wherein each node in a shared shard has an equal resource capacity rating,
wherein each respective shard of the shards has a processing capacity matching a working difficulty for processing transactions of the respective shard, and the transactions of the respective shard execute using the processing capacity of the respective shard,
wherein each respective shard of the shards only stores a part of a DAG ledger, and each node of the respective shard only stores a copy of the part of the DAG ledger,
wherein a transaction newly added to the DAG ledger is only broadcasted to a shard matched with an execution difficulty level of the newly added transaction and is stored by each node in the shard matched with the execution difficulty level of the newly added transaction,
wherein each transaction, when added into the DAG ledger, has to randomly select two Tip transactions for validation, wherein each respective Tip transaction of the two Tip transactions is a transaction that is at a tail of the ledger data and has not been validated, and wherein in the DAG ledger, for each respective Tip transaction, an accumulated confirmation value of the respective Tip transaction is used to represent a number of transactions that directly or indirectly validated the respective Tip transaction, and when the accumulated confirmation value reaches a preset threshold, determining that the respective Tip transaction is in a confirmed state.

3 . The graphic-blockchain-orientated sharding storage method of claim 2 , further comprising: reconstructing the shards, so that all of the nodes are re-sharded, in order to start a new round of a consensus process.

4 . A graphic-blockchain-orientated sharding storage system, which comprises a computer device, wherein the computer device is programmed or configured to execute the steps of the graphic-blockchain-orientated sharding storage method of claim 2 .

5 . A graphic-blockchain-orientated sharding storage system, which comprises a computer device, wherein the computer device has its storage medium storing a computer program that is programmed or configured to execute the graphic-blockchain-orientated sharding storage method of claim 2 .

6 . A graphic-blockchain-orientated sharding storage system, which comprises a computer device, wherein the computer device comprises computer readable storage medium, the computer readable storage medium stores therein a computer program that is programmed or configured to execute the graphic-blockchain-orientated sharding storage method of claim 2 .

7 . An electronic device for storing data, which comprises: a storage device and a processor, the processor and the storage device communicate with each other through a bus, the storage device stores therein program instructions that can be executed by the processor, the processor calls the program instructions to execute the graphic-blockchain-orientated sharding storage method of claim 2 .

Assignees

• Univ Huazhong Science Tech

Inventors

• Xiao Jiang
• Cheng Feng
• Ni Junpei
• Yang Wenhui
• Jin Hai

Classifications

• G06F2209/505

  Clust · CPC title

• G06F9/5061

  Partitioning or combining of resources · CPC title

• H04L9/0643

  Hash functions, e.g. MD5, SHA, HMAC or f9 MAC · CPC title

• H04L9/50 Primary

  using hash chains, e.g. blockchains or hash trees · CPC title

• G06Q20/382

  insuring higher security of transaction · CPC title