Method and system for tuning blockchain scalability, decentralization, and security for fast and low-cost payment and transaction processing
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 and generating a first hash tree comprising a mapping between the first plurality of account addresses and the account states, defining a world state trie and a root hash thereof. The method further includes receiving a first plurality of transactions associated with the first and second blockchains and generating a second hash tree comprising the first plurality of transactions, defining a transactions trie, and a root hash thereof. The method further includes receiving a first plurality of transaction receipts associated with the plurality of transactions and generating a third hash tree comprising the first plurality of transactions receipts, defining a transaction receipts trie, and a root hash thereof.
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;
generating a root hash of the transactions trie;
receiving a first plurality of transaction receipts associated with the plurality of transactions;
generating a third hash tree comprising the first plurality of transactions receipts, defining a transaction receipts trie; and
generating a root hash of the transaction receipts trie.
2. The method of claim 1 wherein the root hash of each of the world state trie, the transaction trie, and the transactions receipts trie is recorded to each block of the first and second blockchains.
3. The method of claim 1 wherein at least a portion of each of the world state trie, the transactions trie, and the transaction receipts 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 a 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, the transactions trie, and the transaction receipts trie is accessible by the first and second blockchains.
6. The method of claim 1 wherein the entirety of each of the world state trie, the transactions trie, and the transaction receipts 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. The method of claim 1 wherein the entirety of each of the world state trie, the transactions trie, and the transaction receipts trie is accessible by the first and second blockchains.
13. The method of claim 12 wherein the second blockchain is decentralized compared to the first blockchain.
14. The method of claim 13 wherein the first blockchain is fully centralized.
15. The method of claim 13 wherein the second blockchain is fully decentralized.
16. The method of claim 12 wherein account addresses for the first blockchain are within an address space separate from an address space from account addresses for the second blockchain.
17. The method of claim 12 wherein account addresses for the first blockchain are within the same address space as account addresses for the second blockchain.
18. 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;
generating a root hash of the transactions trie; receiving a first plurality of transaction receipts associated with the plurality of transactions;
generating a third hash tree comprising the first plurality of transactions receipts, defining a transaction receipts trie; and
generating a root hash of the transaction receipts trie; wherein the root hash of each of the world state trie, the transactions trie, and the transactions receipts trie is recorded to each block of the first and second blockchains;
wherein at least a portion of each of the world state trie, the transactions trie, and the transaction receipts trie are accessible by the first and second blockchains; and
wherein the first blockchain has a parameter difference from the second blockchain selected from a group consisting of block generation time, transaction throughput, transaction latency, stale block rate, block propagation delay and consensus algorithm used.
19. The method of claim 18 wherein the entirety of at least one of the world state trie, the transactions trie, and the transaction receipts trie is accessible by the first and second blockchains.
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;
generating a root hash of the transactions trie; receiving a first plurality of transaction receipts associated with the plurality of transactions;
generating a third hash tree comprising the first plurality of transactions receipts, defining a transaction receipts trie; and
generating a root hash of the transaction receipts trie; wherein the root hash of each of the world state trie, the transactions trie, and the transactions receipts 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, the transactions trie, and the transaction receipts trie is accessible by the first and second blockchains.