IP Library Granted Patent US 10,579,643
Granted Patent B2
US 10,579,643 · App. 16/564,063 · Granted Mar 3, 2020

Method and system for tuning blockchain scalability, decentralization, and security for fast and low-cost payment and transaction processing

Inventors: Vijay Madisetti (Johns Creek, GA); Arshdeep Bahga (Chandigarh, IN)
G06F16/27G06Q20/06G06Q20/0658H04L9/0637H04L9/12H04L9/3236H04L9/3247H04L9/3297H04L2209/38H04L2209/56
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,579,643
App. No.
16/564,063
Granted
Mar 3, 2020
Kind
B2
Abstract

A method for sharing data between blockchains in a multi-chain network including receiving a first plurality of account addresses associated with first and second blockchains and an account state for each account associated with the first plurality of account addresses, generating a first hash tree comprising a mapping between the first plurality of account addresses and the account states, defining a world state trie, generating a root hash of the world state trie, receiving a first plurality of transactions associated with the first and second blockchains, generating a second hash tree comprising the first plurality of transactions, defining a transactions trie, and generating a root hash of the transactions trie.

Claims (44)

1. A method for sharing data between blockchains in a multi-chain network comprising:

receiving a first plurality of account addresses associated with first and second blockchains and an account state for each account associated with the first plurality of account addresses;

generating a first hash tree comprising a mapping between the first plurality of account addresses and the account states, defining a world state trie;

generating a root hash of the world state trie;

receiving a first plurality of transactions associated with the first and second blockchains;

generating a second hash tree comprising the first plurality of transactions, defining a transactions trie; and

generating a root hash of the transactions trie.

2. The method of claim 1 wherein the root hash of both of the world state trie and the transaction trie is recorded to each block of the first and second blockchains.

3. The method of claim 1 wherein at least a portion of both of the world state trie and the transactions trie are accessible by the first and second blockchains.

4. The method of claim 1 wherein the first blockchain has a parameter difference from the second blockchain selected from the group consisting of block generation time, transaction throughput, transaction latency, stale block rate, block propagation delay, and consensus algorithm used.

5. The method of claim 1 wherein the entirety of at least one of the world state trie and the transactions trie is accessible by the first and second blockchains.

6. The method of claim 1 wherein the entirety of both of the world state trie and the transactions trie is accessible by the first and second blockchains.

7. The method of claim 1 wherein the second blockchain is decentralized compared to the first blockchain.

8. The method of claim 7 wherein the first blockchain is fully centralized.

9. The method of claim 7 wherein the second blockchain is fully decentralized.

10. The method of claim 1 wherein account addresses for the first blockchain are within an address space separate from an address space from account addresses for the second blockchain.

11. The method of claim 1 wherein account addresses for the first blockchain are within the same address space as account addresses for the second blockchain.

12. A method for sharing data between blockchains in a multi-chain network comprising:

receiving a first plurality of account addresses associated with first and second blockchains and an account state for each account associated with the first plurality of account addresses;

generating a first hash tree comprising a mapping between the first plurality of account addresses and the account states, defining a world state trie;

generating a root hash of the world state trie;

receiving a first plurality of transactions associated with the first and second blockchains;

generating a second hash tree comprising the first plurality of transactions, defining a transactions trie; and

generating a root hash of the transactions trie;

wherein the root hash of both of the world state trie and the transactions trie is recorded to each block of the first and second blockchains;

wherein at least a portion of both of the world state trie and the transactions trie are accessible by the first and second blockchains; and

wherein the first blockchain has a parameter difference from the second blockchain selected from the group consisting of block generation time, transaction throughput, transaction latency, stale block rate, block propagation delay and consensus algorithm used.

13. The method of claim 12 wherein the entirety of at least one of the world state trie and the transactions trie is accessible by the first and second blockchains.

14. The method of claim 13 wherein the entirety of both of the world state trie and the transactions trie is accessible by the first and second blockchains.

15. The method of claim 14 wherein the second blockchain is decentralized compared to the first blockchain.

16. The method of claim 15 wherein the first blockchain is fully centralized.

17. The method of claim 15 wherein the second blockchain is fully decentralized.

18. The method of claim 14 wherein account addresses for the first blockchain are within an address space separate from an address space from account addresses for the second blockchain.

19. The method of claim 14 wherein account addresses for the first blockchain are within the same address space as account addresses for the second blockchain.

20. A method for sharing data between blockchains in a multi-chain network comprising:

receiving a first plurality of account addresses associated with first and second blockchains and an account state for each account associated with the first plurality of account addresses;

generating a first hash tree comprising a mapping between the first plurality of account addresses and the account states, defining a world state trie;

generating a root hash of the world state trie;

receiving a first plurality of transactions associated with the first and second blockchains;

generating a second hash tree comprising the first plurality of transactions, defining a transactions trie; and

generating a root hash of the transactions trie;

wherein the root hash of both of the world state trie and the transactions trie is recorded to each block of the first and second blockchains;

wherein the second blockchain is decentralized compared to the first blockchain; and

wherein the entirety of at least one of the world state trie and the transactions trie is accessible by the first and second blockchains.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 18, 2026
From: MADISETTI, VIJAY
To: VM INNOVATIONS I, LLC
Reel/Frame 075116/0289 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 12, 2019
From: BAHGA, ARSHDEEP
To: MADISETTI, VIJAY
Reel/Frame 050352/0437 →
Continuity (10)
Continuation 16375351 · Apr 4, 2019
Continuation 16135701 · Sep 19, 2018
Continuation In Part 16119163 · Aug 31, 2018
Continuation 15942604 · Apr 2, 2018
Continuation In Part 16127283 · Sep 11, 2018
Provisional Application 62484555 · Apr 12, 2017
Provisional Application 62620616 · Jan 23, 2018
Provisional Application 62557820 · Sep 13, 2017
Provisional Application 62618784 · Jan 18, 2018
Related Publication 20200026712A1 · Jan 23, 2020
Cited By (2)
US 12,238,231 US 12,254,435