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

Patent metadata

Field	Value
Publication number	US-10579643-B2
Application number	US-201916564063-A
Country	US
Kind code	B2
Filing date	Sep 9, 2019
Priority date	Apr 12, 2017
Publication date	Mar 3, 2020
Grant date	Mar 3, 2020

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.

First claim

The invention claimed is:

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.

Assignees

• Madisetti Vijay

Inventors

• Madisetti Vijay
• Bahga Arshdeep

Classifications

• H04L2209/56

  Financial cryptography, e.g. electronic payment or e-cash · CPC title

• H04L9/3247

  involving digital signatures · CPC title

• G06Q20/0658

  e-cash managed locally · CPC title

• H04L9/12

  Transmitting and receiving encryption devices synchronised or initially set up in a particular manner · CPC title

• H04L9/3236

  using cryptographic hash functions · CPC title