# US 2026/0303381 A1 · A system for partially synchronous scalable blockchains

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

- Number: US 2026/0303381 A1
- Document ID: US20260303381A1
- Status: Published application
- Kind: A1
- Application number: 19/481,165
- Filed: 2024-05-06
- Published: 2026-10-01
- Earliest claimed: 2023-05-05
- Assignees: Visa International Service Association
- Applicants: Visa International Service Association
- Inventors: Mahdi Zamani; Adithya BHAT
- Web page: https://patentgrep.com/patent/US20260303381A1

## CPC

- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 9/3255: {using group based signatures, e.g. ring or threshold signatures}
- H04L 69/40: for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection (management of faults, events, alarms or notifications in data switching networks H04L41/06)
- H04L 2209/463: Electronic voting
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A system for a verifying a transaction in a sharded blockchain network. The system comprises a plurality of worker shards that allows the system to scale the transaction processing power with the increase in the number of worker shards. The plurality of worker shards that allow multiple committees of nodes to process incoming transactions in parallel. A data shard coordinates the commitment of blocks to ensure that the highest block in a chain is accurately committed.

## Claims

### Claim 1

A system for scalable block consensus in a blockchain network, the system comprising:
a plurality of nodes, wherein each of the plurality of nodes is a distributed computing device, the plurality of nodes further comprising:
a plurality of worker shards, wherein each worker shard of the plurality of worker shards comprises a first quantity of nodes of the plurality of nodes, and wherein the first quantity of nodes in each of the plurality of worker shards meets a first threshold for a safety parameter and a second threshold for a liveness parameter, and wherein the plurality of worker shards process transaction data corresponding to a plurality of blocks in the blockchain network;
a reference shard, wherein the reference shard comprises a second quantity of nodes of the plurality of nodes, and wherein the second quantity of nodes meets a third threshold for the liveness parameter; and
a data shard, wherein the data shard comprises a third quantity of nodes of the plurality of nodes, and wherein the third quantity of nodes meets a fourth threshold for the safety parameter; and
wherein the system is configured to:
establish a consensus for the transaction data by a first worker shard of the plurality of worker shards, wherein the first worker shard comprises a first set of nodes, and wherein the first worker shard determines the consensus based on a quorum of the first set of nodes;
transmit a commit message to the data shard by the first worker shard, wherein the commit message comprises the consensus for the transaction data;
reorganize the plurality of nodes by the reference shard, based on an epoch interval, wherein the first worker shard is reorganized to comprise a second set of nodes of the plurality of nodes, wherein the second set of nodes is different from the first set of nodes, and wherein the second set of nodes is equal in quantity to the first quantity of nodes; and
broadcast, by the data shard, a highest block number based on the commit message.

### Claim 2 (depends on 1)

The system of claim 1, wherein the consensus for the transaction data by the first worker shard is determined by a quorum certificate.

### Claim 3 (depends on 2)

The system of claim 2, wherein the quorum certificate requires the quorum of nodes to exceed x number ofsignatures by the first worker shard, where x>(n+q)/2, and wherein n is a total number of nodes in each of the plurality of worker shards, and q is a total number of nodes needed to establish the quorum of nodes in each of the plurality of worker shards.

### Claim 4 (depends on 3)

The system of claim 3, wherein q defines the total number of nodes needed to establish the quorum of nodes in each of the plurality of worker shards, wherein f is a total number of faulty nodes in the first worker shard, and wherein q=n−f.

### Claim 5 (depends on 1)

The system of claim 1, wherein the liveness parameter determines the number of nodes in each of the plurality of worker shards that are needed to reach the quorum of nodes without the plurality of worker shards stalling indefinitely.

### Claim 6 (depends on 1)

The system of claim 1, wherein the commit message comprises a hash value for one of the plurality of blocks.

### Claim 7 (depends on 1)

The system of claim 1, wherein the data shard comprises a table corresponding to the highest block number associated with each of the plurality of worker shards.

### Claim 8 (depends on 1)

The system of claim 1, wherein the first threshold for the safety parameter of the plurality of worker shards is defined by f<q<n, where f is a total number of faulty nodes in each of the plurality of worker shards, g is the total number of nodes needed to establish the quorum of nodes in each of the plurality of worker shards, and n is the total number of nodes in each of the plurality of worker shards.

### Claim 9 (depends on 8)

The system of claim 8, wherein the second threshold for the liveness parameter of the plurality of worker shards is defined by f<n/3, where f is the total number of faulty nodes in each of the plurality of worker shards, and n is the total number of nodes in each of the plurality of worker shards.

### Claim 10 (depends on 8)

The system of claim 8, wherein the second threshold for the liveness parameter of the plurality of worker shards is defined by f<n/2, where f is the total number of faulty nodes in each of the plurality of worker shards, and n is the total number of nodes in each of the plurality of worker shards.

### Claim 11 (depends on 1)

The system of claim 1, wherein the third threshold for the liveness parameter of the reference shard is defined by f<n/3, where f is a total number of faulty nodes in the reference shard, and n is the total number of nodes in the reference shard.

### Claim 12 (depends on 1)

The system of claim 1, wherein the fourth threshold for the liveness parameter of the data shard is defined by f<n/3, where f is a total number of faulty nodes in the data shard, and n is the total number of nodes in the data shard.

### Claim 13

A method for establishing block consensus in a scalable blockchain network, the method comprising:
generating, from a plurality of nodes, through epoch randomness for a first epoch of a plurality of epochs:
a plurality of worker shards that meet a first threshold for a safety parameter and a second threshold for a liveness parameter;
a reference shard that meets the second threshold for the liveness parameter; and
a data shard that meets the second threshold for the liveness parameter;
assigning, by the reference shard, a plurality of transactions to the plurality of worker shards for the first epoch of the plurality of epochs, wherein a first worker shard of the plurality of worker shards is assigned a first transaction of the plurality of transactions;
maintaining, by the reference shard, a transaction repository, wherein the transaction repository identifies the plurality of transactions assigned to each of the plurality of worker shards;
verifying, by the first worker shard, a commit message associated with the first transaction based on a predetermined number of signatures;
transmitting, by the first worker shard, the commit message to the data shard, wherein the commit message comprises a block number corresponding to the first transaction;
maintaining, by the data shard, a block repositor, wherein the block repository identifies a highest block committed by each of the plurality of worker shards;
verifying, by the data shard, the block number is the highest block committed for the first worker shard; and
broadcasting, by the data shard, an acknowledgement message corresponding to the commit message, wherein the acknowledgement message indicates that the commit message was verified.

### Claim 14 (depends on 13)

The method of claim 13, further comprising:
initiating, by the reference shard, a state transfer from the first epoch to a second epoch of the plurality of epochs;
locking, by the reference shard, the data shard from committing new blocks during the state transfer;
reorganizing the plurality of nodes to generate a plurality of new worker shards based on the first threshold for the safety parameter and the second threshold for the liveness parameter; and
performing, by the plurality of new worker shards, a transaction lookup in the transaction repository, wherein the transaction repository indicates a last transaction processed by each of the plurality of new worker shards.

### Claim 15 (depends on 13)

The method of claim 13, wherein:
the first threshold for the safety parameter of the plurality of worker shards is defined by f<q<n, where f is a total number of faulty nodes in each of the plurality of worker shards, q is the total number of nodes needed to establish the quorum of nodes in each of the plurality of worker shards, and n is the total number of nodes in each of the plurality of worker shards; and
the second threshold for the liveness parameter is defined by f<n/3, where f is the total number of faulty nodes in the reference shard, the data shard, and each of the plurality of worker shards, and n is the total number of nodes in the reference shard, the data shard, and each of the plurality of worker shards.

### Claim 16 (depends on 13)

The method of claim 13, wherein the commit message is certified by the first worker shard based on a quorum of x number of signature by the first worker shard, where x>(n+q)/2, n is a total number of nodes in the first worker shard, and q is a total number of nodes needed to establish the quorum for the worker shards.

### Claim 17 (depends on 13)

The method of claim 13, further comprising: determining, by the reference shard, a status of a second worker shard, of the plurality of worker shards, wherein the status is inactive.

### Claim 18 (depends on 17)

The method of claim 17, further comprising: decommissioning, by the reference shard, the second worker shard, wherein a second transaction assigned to the second worker shard is reassigned.

### Claim 19 (depends on 18)

The method of claim 18, further comprising:
determining, by the reference shard, the status of a third worker shard, wherein the status is active; and
assigning, by the reference shard, the second transaction to the third worker shard.

### Claim 20

A method for establishing block consensus in a scalable blockchain network, the method comprising:
generating, from a plurality of nodes, through epoch randomness for a first epoch of a plurality of epochs:
a plurality of worker shards that meet a first threshold for a safety parameter and a second threshold for a liveness parameter;
a reference shard that meets the second threshold for the liveness parameter; and
a data shard that meets the second threshold for the liveness parameter;
assigning, by the reference shard, a plurality of transactions to the plurality of worker shards for the first epoch of the plurality of epochs;
maintaining, by the reference shard, a transaction repository, wherein the transaction repository identifies the plurality of transactions assigned to each of the plurality of worker shards;
maintaining, by the data shard, a block repository, wherein the block repository identifies a highest block committed by each of the plurality of worker shards;
initiating, by the reference shard, a state transfer from the first epoch to a second epoch of the plurality of epochs;
locking, by the reference shard, the data shard from committing new blocks during the state transfer; and
reorganizing the plurality of node to generate a plurality of new worker shards based on the first threshold for the safety parameter and the second threshold for the liveness parameter.
