# US 2020/0394176 A1 · Scalable, secure, efficient, and adaptable distributed digital ledger transaction network

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

- Number: US 2020/0394176 A1
- Document ID: US20200394176A1
- Status: Published application
- Kind: A1
- Application number: 16/442,473
- Filed: 2019-06-15
- Published: 2020-12-17
- Earliest claimed: 2019-06-15
- Assignees: Facebook, Inc.
- Applicants: Facebook, Inc.
- Inventors: Qinfan Wu; Benjamin D. Maurer
- Web page: https://patentgrep.com/patent/US20200394176A1

## CPC

- G06F 16/2379: {Updates performed during online database operations; commit processing}
- H04L 9/32: including means for verifying the identity or authority of a user of the system {or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials}
- G06F 16/22: Indexing; Data structures therefor; Storage structures
- G06F 16/27: Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- H04L 63/126: {the source of the received data}
- H04L 9/0891: {Revocation or update of secret information, e.g. encryption key update or rekeying}
- H04L 9/30: Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L 9/3236: {using cryptographic hash functions}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 61/4511: using domain name system [DNS]
- H04L 2101/37: E-mail addresses
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present disclosure relates to systems, methods, and non-transitory computer readable storage media for implementing a scalable, secure, efficient, and adaptable distributed digital ledger transaction network. Indeed, the disclosed systems can reduce storage and processing requirements, improve security of implementing computing devices and underlying digital assets, accommodate a wide variety of different digital programs (or “smart contracts”), and scale to accommodate billions of users and associated digital transactions. For example, the disclosed systems can utilize a host of features that improve storage, account/address management, digital transaction execution, consensus, and synchronization processes. The disclosed systems can also utilize a new programming language that improves efficiency and security of the distributed digital ledger transaction network.

## Claims

### Claim 1

A method comprising:
determining a first state data structure of a distributed digital ledger transaction network, wherein the first state data structure represents account states of a plurality of user accounts of the distributed digital ledger transaction network;
identifying a plurality of transactions comprising transactions associated with user accounts of the plurality of user accounts;
performing a preliminary execution of the transactions in parallel relative to the first state data structure to determine a plurality of transaction results and dependencies of the transactions with regard to the user accounts; and
modifying the first state data structure to a second state data structure by applying the plurality of transaction results based on the dependencies of the transactions.

### Claim 2 (depends on 1)

The method of claim 1, wherein the second state data structure is equivalent to executing the plurality of transactions serially against the first state data structure.

### Claim 3 (depends on 1)

The method of claim 1, wherein the transactions comprise a first transaction and a second transaction, and performing the preliminary execution comprises:
determining a first transaction result reflecting application of the first transaction relative to the first state data structure;
determining a second transaction result reflecting application of the second transaction relative to the first state data structure; and
determining that the second transaction is not dependent upon the first transaction and the first transaction is not dependent upon the second transaction.

### Claim 4 (depends on 3)

The method of claim 3, further comprising based on determining that the second transaction is not dependent upon the first transaction and the first transaction is not dependent upon the second transaction, applying the first transaction result and the second transaction result relative to the first state data structure.

### Claim 5 (depends on 3)

The method of claim 3, further comprising generating an intermediate state data structure by applying the first transaction result to the first state data structure.

### Claim 6 (depends on 5)

The method of claim 5, wherein the transactions comprise a third transaction and
performing the preliminary execution comprises:
determining a third transaction result reflecting application of the third transaction relative to the first state data structure; and
determining that the third transaction depends on the first transaction.

### Claim 7 (depends on 6)

The method of claim 6, further comprising in response to determining that the third transaction depends on the first transaction, executing the third transaction against the intermediate state data structure to generate the second state data structure.

### Claim 8 (depends on 6)

The method of claim 6, wherein determining that the third transaction depends on the first transaction comprises determining that the third transaction and the first transaction are associated with a same user account from the user accounts.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
receiving a dependency indicator for the plurality of transactions from a validator node; and
identifying a first subset of the plurality of transactions and a second subset of the plurality of transactions based on the dependency indicator, and
wherein performing the preliminary execution of the transactions comprises performing a preliminary execution of the first subset of the plurality of transactions based on the dependency indicator.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
generating an intermediate state data structure based on transaction results from performing the preliminary execution of the first subset of the plurality of transactions; and
generating the second state data structure by executing the second subset of the plurality of transactions relative to the intermediate state data structure.

### Claim 11

A non-transitory computer-readable medium storing instructions thereon that, when executed by at least one processor, cause a computing device to:
determine a first state data structure of a distributed digital ledger transaction network, wherein the first state data structure represents account states of a plurality of user accounts of the distributed digital ledger transaction network;
identify a plurality of transactions comprising transactions associated with user accounts of the plurality of user accounts;
perform a preliminary execution of the transactions in parallel relative to the first state data structure to determine a plurality of transaction results and dependencies of the transactions with regard to the user accounts; and
modify the first state data structure to a second state data structure by applying the plurality of transaction results based on the dependencies of the transactions.

### Claim 12 (depends on 11)

The non-transitory computer-readable medium of claim 11, wherein the second state data structure is equivalent to executing the plurality of transactions serially against the first state data structure.

### Claim 13 (depends on 11)

The non-transitory computer-readable medium of claim 11, wherein:
the transactions comprise a first transaction and a second transaction; and
the instructions, when executed by the at least one processor, cause the computing device to perform the preliminary execution by:
determining a first transaction result reflecting application of the first transaction relative to the first state data structure;
determining a second transaction result reflecting application of the second transaction relative to the first state data structure; and
determining that the second transaction is not dependent upon the first transaction and the first transaction is not dependent upon the second transaction.

### Claim 14 (depends on 13)

The non-transitory computer-readable medium of claim 13, further comprising instructions that, when executed by the at least one processor, cause the computing device to, based on determining that the second transaction is not dependent upon the first transaction and the first transaction is not dependent upon the second transaction, apply the first transaction result and the second transaction result relative to the first state data structure.

### Claim 15 (depends on 13)

The non-transitory computer-readable medium of claim 13, further comprising instructions that, when executed by the at least one processor, cause the computing device to generate an intermediate state data structure by applying the first transaction result to the first state data structure.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein:
the transactions comprise a third transaction; and
the instructions, when executed by the at least one processor, cause the computing device to perform the preliminary execution by:
determining a third transaction result reflecting application of the third transaction relative to the first state data structure; and
determining that the third transaction depends on the first transaction.

### Claim 17

A system comprising:
at least one processor; and
at least one non-transitory computer-readable medium storing instructions thereon that, when executed by the at least one processor, cause the system to:
determine a first state data structure of a distributed digital ledger transaction network, wherein the first state data structure represents account states of a plurality of user accounts of the distributed digital ledger transaction network;
identify a plurality of transactions comprising transactions associated with user accounts of the plurality of user accounts;
perform a preliminary execution of the transactions in parallel relative to the first state data structure to determine a plurality of transaction results and dependencies of the transactions with regard to the user accounts; and
modify the first state data structure to a second state data structure by applying the plurality of transaction results based on the dependencies of the transactions.

### Claim 18 (depends on 17)

The system of claim 17, wherein the second state data structure is equivalent to executing the plurality of transactions serially against the first state data structure.

### Claim 19 (depends on 17)

The system of claim 17, further comprising instructions that, when executed by the at least one processor, cause the system to:
receive a dependency indicator for the plurality of transactions from a validator node; and
identify a first subset of the plurality of transactions and a second subset of the plurality of transactions based on the dependency indicator, and
wherein the instructions, when executed by the at least one processor, cause the computing device to perform the preliminary execution of the transactions by performing a preliminary execution of the first subset of the plurality of transactions based on the dependency indicator.

### Claim 20 (depends on 19)

The system of claim 19, further comprising instructions that, when executed by the at least one processor, cause the system to:
generate an intermediate state data structure based on transaction results from performing the preliminary execution of the first subset of the plurality of transactions; and
generate the second state data structure by executing the second subset of the plurality of transactions relative to the intermediate state data structure.
