Optimal transactions sharding for scalable blockchain

A system comprising:

• one or more computing processors;
• and
• one or more memory storage elements;
• wherein the one or more computing processors are configured to:
• split a distributed ledger into a plurality of shards, wherein each shard is maintained by a subgroup of computer nodes and stored in the one or more storage elements;
• store a shard across the subgroup of computer nodes associated with the shard;
• assign a new transaction to one of the plurality of shards, wherein assigning the new transaction comprises:
• iteratively choosing one of the plurality of shards;
• in each iteration, determining a transaction-to-shard score that is an estimate of a probability that a subgroup of computing nodes associated with the chosen shard for a current iteration would be involved in a same-shard transaction for the new transaction;
• in each iteration, determining a latency-to-shard score that is an estimate of a confirmation latency of the new transaction under the chosen shard for the current iteration;
• and
• selecting the new transaction to be assigned to the shard in the plurality of shards based on a combination of the transaction-to-shard score and the latency-to-shard score;
• and
• transmit the new transaction to each of the computer nodes in the subgroup associated with the selected shard for validation.

A non-transitory computer-readable medium having instructions stored thereon that, in response to execution by a computer-based system, cause the computer-based system to perform operations comprising:

• splitting a distributed ledger into a plurality of shards, wherein an individual shard is maintained by a subgroup of computer nodes;
• storing a shard across the subgroup of computer nodes associated with the shard;
• assigning a new transaction to one of the plurality of shards, wherein assigning the new transaction comprises:
• iteratively choosing one of the plurality of shards;
• in each iteration, determining a transaction-to-shard score that is an estimate of a probability that a subgroup of computing nodes associated with the chosen shard for a current iteration would be involved in a same-shard transaction for the new transaction;
• in each iteration, determining a latency-to-shard score that is an estimate of a confirmation latency of the new transaction under the chosen shard for the current iteration;
• and
• selecting the new transaction to be assigned to the shard in the plurality of shards based on a combination of the transaction-to-shard score and the latency-to-shard score;
• and
• transmitting the new transaction to each of the computer nodes in the subgroup associated with the selected shard for validation.