CPC H04L 9/32 (2013.01) [G06F 9/3836 (2013.01); G06F 16/2246 (2019.01); G06F 16/2379 (2019.01); G06F 16/278 (2019.01); G06F 16/9027 (2019.01); G06Q 20/065 (2013.01); G06Q 20/0658 (2013.01); G06Q 20/223 (2013.01); G06Q 20/3674 (2013.01); G06Q 20/3678 (2013.01); G06Q 20/3827 (2013.01); H04L 9/0618 (2013.01); H04L 9/0643 (2013.01); H04L 9/3239 (2013.01); H04L 9/50 (2022.05); H04L 2209/56 (2013.01)] | 14 Claims |
1. A computer-implemented method for allocating transactions associated with a blockchain network, wherein the blockchain network is partitioned into a plurality of shards, each shard comprising at least one node, and wherein each node in the blockchain network is associated with at least one shard among the plurality of shards, the method comprising the steps of, at a first node:
identifying a transaction id of a blockchain transaction;
based on the transaction id and the number of shards in the plurality of shards, determining a shard among the plurality of shards;
allocating the transaction to the determined shard;
distributing the transaction to the at least one node in the determined shard; and
communicating a request for shard membership information of a node to another node;
wherein the step of determining the shard further comprises the step of performing an operation using the transaction id, and wherein the step of allocating the transaction to a shard is based on the result of the operation.
|