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

## CPC

- G06F 16/162: {Delete operations (erasing in storage systems G06F3/0652)}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- G06F 16/122: {using management policies (point-in-time backing up or restoration of persistent data G06F11/1446; file migration policies for HSM systems G06F16/185)}
- G06F 16/1824: {implemented using Network-attached Storage [NAS] architecture (distributed or networked storage systems G06F3/067; protocols for distributed storage of data in a network H04L67/1097)}
- G06F 16/185: Hierarchical storage management [HSM] systems, e.g. file migration or policies thereof (details of archiving G06F16/11)
- G06Q 20/065: {using e-cash}
- G06Q 20/0658: {e-cash managed locally}
- G06Q 20/3829: {involving key management}
- G06Q 20/389: {Keeping log of transactions for guaranteeing non-repudiation of a transaction}
- H04L 9/0637: {Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]}
- H04L 9/3247: {involving digital signatures}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 67/104: Peer-to-peer [P2P] networks
- H04L 67/125: involving control of end-device applications over a network
- H04L 67/306: User profiles
- H04L 67/535: {Tracking the activity of the user (network monitoring arrangements H04L43/00; recording of computer activity G06F11/34)}
- 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)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## 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 an authenticated data structure of a distributed digital ledger transaction network, wherein the authenticated data structure comprises a data tree comprising nodes having data representations mapped to entries in a database;
performing lazy deletion of data from the authenticated data structure by:
accessing a data representation from a node of the data tree to determine expiration of an eviction date associated with node; and
in response to determining expiration of the eviction date, deleting one or more entries corresponding to the node from the database while maintaining the data representation within the data tree.

### Claim 2 (depends on 1)

The method of claim 1, further comprising deleting the one or more entries corresponding to the node from the database without a transaction event request on the distributed digital ledger transaction network for deleting the one or more entries.

### Claim 3 (depends on 1)

The method of claim 1, further comprising, prior to deleting the one or more entries corresponding to the node from the database:
receiving a request from a client device, the request requiring use of the one or more entries;
in response to receiving the request from the client device, accessing the data representation from the node of the data tree to determine expiration of the eviction date; and
processing the request as if the one or more entries have been deleted.

### Claim 4 (depends on 1)

The method of claim 1, wherein the database comprises a state database, the one or more entries comprise account data corresponding to a user account, the data tree comprises a state tree, and the node comprises an account state representation corresponding to the account data of the user account.

### Claim 5 (depends on 4)

The method of claim 4, further comprising, in response to receiving a transaction that references the user account:
accessing the account state representation corresponding to the user account from the state tree to determine expiration of the eviction date; and
processing the transaction as if the user account had expired.

### Claim 6 (depends on 4)

The method of claim 4, further comprising:
identifying an account reinstatement request associated with the user account, wherein the account reinstatement request comprises proposed account data for the user account; and
verifying the proposed account data for the user account based on the account state representation within the state tree.

### Claim 7 (depends on 6)

The method of claim 6, further comprising re-caching the proposed account data associated with the user account within the state database of the distributed digital ledger transaction network based on verifying the proposed account data for the user account.

### Claim 8 (depends on 7)

The method of claim 7, further comprising updating the eviction date associated with the node based on re-caching the proposed account data associated with the user account.

### Claim 9 (depends on 4)

The method of claim 4, further comprising generating the account state representation by:
applying a hash function to the account data corresponding to the user account in the state database to generate a hash value for the account data corresponding to the user account; and
combining the hash value for the account data with the eviction date associated with the user account to generate the account state representation corresponding to the user account.

### Claim 10 (depends on 4)

The method of claim 4, further comprising determining expiration of the eviction date based on at least one of: a rent deposit amount, a time of a last user account access, a time of a transaction that transfers digital assets from the user account, or a time of a transaction that transfers digital assets to the user account.

### Claim 11

A non-transitory computer-readable medium storing instructions thereon that, when executed by at least one processor, cause a computing device to:
generate an authenticated data structure of a distributed digital ledger transaction network, wherein the authenticated data structure comprises a data tree comprising nodes having data representations mapped to entries in a database;
perform lazy deletion of data from the authenticated data structure by:
accessing a data representation from a node of the data tree to determine expiration of an eviction date associated with node; and
in response to determining expiration of the eviction date, deleting one or more entries corresponding to the node from the database while maintaining the data representation within the data tree.

### Claim 12 (depends on 11)

The non-transitory computer-readable medium of claim 11, further comprising instructions that, when executed by the at least one processor, cause the computing device to delete the one or more entries corresponding to the node from the database without a transaction event request on the distributed digital ledger transaction network for deleting the one or more entries.

### Claim 13 (depends on 11)

The non-transitory computer-readable medium of claim 11, further comprising instructions that, when executed by the at least one processor, cause the computing device to:
prior to deleting the one or more entries corresponding to the node from the database:
receive a request from a client device, the request requiring use of the one or more entries;
in response to receiving the request from the client device, access the data representation from the node of the data tree to determine expiration of the eviction date; and
process the request as if the one or more entries have been deleted.

### Claim 14 (depends on 11)

The non-transitory computer-readable medium of claim 11, wherein the database comprises a state database, the one or more entries comprise account data corresponding to a user account, the data tree comprises a state tree, and the node comprises an account state representation corresponding to the account data of the user account.

### Claim 15 (depends on 14)

The non-transitory computer-readable medium of claim 14, further comprising instructions that, when executed by the at least one processor, cause the computing device to:
identify an account reinstatement request associated with the user account, wherein the account reinstatement request comprises proposed account data for the user account; and
verify the proposed account data for the user account based on the account state representation within the state tree;
re-cache the proposed account data associated with the user account within the state database of the distributed digital ledger transaction network based on verifying the proposed account data for the user account; and
update the eviction date associated with the node based on re-caching the proposed account data associated with the user account.

### Claim 16 (depends on 14)

The non-transitory computer-readable medium of claim 14, further comprising instructions that, when executed by the at least one processor, cause the computing device to generate the account state representation by:
applying a hash function to the account data corresponding to the user account in the state database to generate a hash value for the account data corresponding to the user account; and
combining the hash value for the account data with the eviction date associated with the user account to generate the account state representation corresponding to the user account.

### 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 an authenticated data structure of a distributed digital ledger transaction network, wherein the authenticated data structure comprises a data tree comprising nodes having data representations mapped to entries in a database;
perform lazy deletion of data from the authenticated data structure by:
accessing a data representation from a node of the data tree to determine expiration of an eviction date associated with node; and
in response to determining expiration of the eviction date, deleting one or more entries corresponding to the node from the database while maintaining the data representation within the data tree.

### Claim 18 (depends on 17)

The system of claim 17, further comprising instructions that, when executed by the at least one processor, cause the system to delete the one or more entries corresponding to the node from the database without a transaction event request on the distributed digital ledger transaction network for deleting the one or more entries.

### Claim 19 (depends on 11)

The system of claim 11, further comprising instructions that, when executed by the at least one processor, cause the system to:
prior to deleting the one or more entries corresponding to the node from the database:
receive a request from a client device, the request requiring use of the one or more entries;
in response to receiving the request from the client device, access the data representation from the node of the data tree to determine expiration of the eviction date; and
process the request as if the one or more entries have been deleted.

### Claim 20 (depends on 17)

The system of claim 17,
wherein the database comprises a state database, the one or more entries comprise account data corresponding to a user account, the data tree comprises a state tree, and the node comprises an account state representation corresponding to the account data of the user account; and
further comprising instructions that, when executed by the at least one processor, cause the system to:
identify an account reinstatement request associated with the user account, wherein the account reinstatement request comprises proposed account data for the user account; and
verify the proposed account data for the user account based on the account state representation within the state tree;
re-cache the proposed account data associated with the user account within the state database of the distributed digital ledger transaction network based on verifying the proposed account data for the user account; and
update the eviction date associated with the node based on re-caching the proposed account data associated with the user account.
