# US 2020/0394177 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/0394177 A1
- Document ID: US20200394177A1
- Status: Published application
- Kind: A1
- Application number: 16/442,474
- Filed: 2019-06-15
- Published: 2020-12-17
- Earliest claimed: 2019-06-15
- Assignees: Facebook, Inc.
- Applicants: Facebook, Inc.
- Inventors: Benjamin D. Maurer; Samuel Howard Blackshear
- Web page: https://patentgrep.com/patent/US20200394177A1

## CPC

- G06F 16/2379: {Updates performed during online database operations; commit processing}
- G06F 8/31: {Programming languages or programming paradigms}
- G06F 9/45504: {Abstract machines for program code execution, e.g. Java virtual machine [JVM], interpreters or emulators}
- G06F 9/45508: {Runtime interpretation or emulation, e g. emulator loops, bytecode interpretation}
- G06F 16/2246: {Trees, e.g. B+trees}
- G06F 16/2365: {Ensuring data consistency and integrity}
- 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 9/3265: {using certificate chains, trees or paths; Hierarchical trust model}
- H04L 63/12: {Applying verification of the received information (cryptographic mechanisms or cryptographic arrangements for data integrity or data verification H04L9/32)}
- G06F 9/45512: {Command shells}
- 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 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:
generating a state data structure of a distributed digital ledger transaction network, wherein the state data structure comprises account data corresponding to a user account, a transaction event counter corresponding to the user account, and an address of the user account within the state data structure;
in response to execution of a transaction comprising an event corresponding to the user account of the distributed digital ledger transaction network:
modifying a count value of the transaction event counter of the user account within the state data structure; and
generating a transaction event within an event data structure, the transaction event within the event data structure reflecting the address, the count value of the transaction event counter of the user account, and details of the event.

### Claim 2 (depends on 1)

The method of claim 1, wherein the state data structure comprises an additional transaction event counter corresponding to the user account, the transaction event counter corresponds to a first transaction event type, and the additional transaction event counter corresponds to a second transaction event type.

### Claim 3 (depends on 2)

The method of claim 2, wherein modifying the count value of the transaction event counter of the user account comprises:
determining that the transaction event corresponds to the first transaction event type; and
modifying the count value of the transaction event counter based on determining that the transaction event corresponds to the first transaction event type.

### Claim 4 (depends on 2)

The method of claim 2, wherein the transaction comprises an additional event of the second transaction event type and further comprising:
modifying an additional count value of the additional transaction event counter of the user account within the state data structure; and
generating an additional transaction event within the event data structure, the additional transaction event within the event data structure reflecting the address, the additional count value of the additional transaction event counter of the user account, and details of the additional event.

### Claim 5 (depends on 1)

The method of claim 1, wherein the event data structure comprises an event tree reflecting transaction events generated in response to the execution of the transaction.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
determining a root value of the event tree reflecting the transaction events corresponding to the transaction; and
storing the root value of the event tree in a transaction tree of the distributed digital ledger transaction network.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
receiving an event count request from a client device, the event count request comprising a reference to the transaction event counter; and
in response to receiving the event count request from the client device, providing the modified count value of the transaction event counter from the state data structure to the client device.

### Claim 8 (depends on 7)

The method of claim 7, wherein the reference to the transaction event counter comprises an access path that reflects both the address and the transaction event counter.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
receiving a transaction event detail request from a client device, the transaction event detail request comprising the count value of the transaction event counter and an access path comprising the address and the transaction event counter; and
in response to receiving the transaction event detail request, providing details of the event from the event data structure to the client device together with a Merkle proof corresponding to the transaction event.

### Claim 10

A non-transitory computer-readable medium storing instructions thereon that, when executed by at least one processor, cause a computing device to:
generate a state data structure of a distributed digital ledger transaction network, wherein the state data structure comprises account data corresponding to a user account, a transaction event counter corresponding to the user account, and an address of the user account within the state data structure;
in response to execution of a transaction comprising an event corresponding to the user account of the distributed digital ledger transaction network:
modify a count value of the transaction event counter of the user account within the state data structure; and
generate a transaction event within an event data structure, the transaction event within the event data structure reflecting the address, the count value of the transaction event counter of the user account, and details of the event.

### Claim 11 (depends on 10)

The non-transitory computer-readable medium of claim 10, wherein the state data structure comprises an additional transaction event counter corresponding to the user account, the transaction event counter corresponds to a first transaction event type, and the additional transaction event counter corresponds to a second transaction event type.

### Claim 12 (depends on 11)

The non-transitory computer-readable medium of claim 11, wherein the instructions, when executed by the at least one processor, cause the computing device to modify the count value of the transaction event counter of the user account by:
determining that the transaction event corresponds to the first transaction event type; and
modifying the count value of the transaction event counter based on determining that the transaction event corresponds to the first transaction event type.

### Claim 13 (depends on 11)

The non-transitory computer-readable medium of claim 11, wherein the transaction comprises an additional event of the second transaction event type and further comprising instructions that, when executed by the at least one processor, cause the computing device to:
modify an additional count value of the additional transaction event counter of the user account within the state data structure; and
generate an additional transaction event within the event data structure, the additional transaction event within the event data structure reflecting the address, the additional count value of the additional transaction event counter of the user account, and details of the additional event.

### Claim 14 (depends on 10)

The non-transitory computer-readable medium of claim 10, wherein the event data structure comprises an event tree reflecting transaction events generated in response to the execution of the transaction and further comprising instructions that, when executed by the at least one processor, cause the computing device to:
determine a root value of the event tree reflecting the transaction events corresponding to the transaction; and
store the root value of the event tree in a transaction tree of the distributed digital ledger transaction network.

### Claim 15 (depends on 10)

The non-transitory computer-readable medium of claim 10, further comprising instructions that, when executed by the at least one processor, cause the computing device to:
receive an event count request from a client device, the event count request comprising a reference to the transaction event counter; and
in response to receiving the event count request from the client device, provide the modified count value of the transaction event counter from the state data structure to the client device.

### Claim 16 (depends on 10)

The non-transitory computer-readable medium of claim 10, further comprising instructions that, when executed by the at least one processor, cause the computing device to:
receive a transaction event detail request from a client device, the transaction event detail request comprising the count value of the transaction event counter and an access path comprising the address and the transaction event counter; and
in response to receiving the transaction event detail request, provide details of the event from the event data structure to the client device together with a Merkle proof corresponding to the transaction event.

### 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:
generate a state data structure of a distributed digital ledger transaction network, wherein the state data structure comprises account data corresponding to a user account, a transaction event counter corresponding to the user account, and an address of the user account within the state data structure;
in response to execution of a transaction comprising an event corresponding to the user account of the distributed digital ledger transaction network:
modify a count value of the transaction event counter of the user account within the state data structure; and
generate a transaction event within an event data structure, the transaction event within the event data structure reflecting the address, the count value of the transaction event counter of the user account, and details of the event.

### Claim 18 (depends on 17)

The system of claim 17,
wherein the state data structure comprises an additional transaction event counter corresponding to the user account, the transaction event counter corresponds to a first transaction event type, and the additional transaction event counter corresponds to a second transaction event type; and
wherein the instructions, when executed by the at least one processor, cause the system to modify the count value of the transaction event counter of the user account by:
determining that the transaction event corresponds to the first transaction event type; and
modifying the count value of the transaction event counter based on determining that the transaction event corresponds to the first transaction event type.

### 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 an event count request from a client device, the event count request comprising a reference to the transaction event counter; and
in response to receiving the event count request from the client device, provide the modified count value of the transaction event counter from the state data structure to the client device.

### Claim 20 (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 transaction event detail request from a client device, the transaction event detail request comprising the count value of the transaction event counter and an access path comprising the address and the transaction event counter; and
in response to receiving the transaction event detail request, provide details of the event from the event data structure to the client device together with a Merkle proof corresponding to the transaction event.
