Facebook, Inc.

Meta Platforms, Inc.

Circle Internet Financial Limited

Dmitri Perelman

Philippe Vincent Ajoux

Daniel Nota Peek

Pol Mauri Ruiz

Lin Xiao

Tianyin Xu

Justin James Meza

Kiryong Ha

Shruti Padmanabha

Andrew John Newell

Kevin Burton Cole

Kaushik Veeraraghavan

David Shu-Hao Chou

Sonia Margulis

Neil Earnest Chao

Benjamin D Maurer

Avery Li Kuang Ching

François Garillot

Mathieu Jp Baudet

Georges Danezis

Zekun Li

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.

Scalable, secure, efficient, and adaptable distributed digital ledger transaction network

A disclosed computer-implemented method may include partitioning, based on a social graph representative of social connections among a plurality of users of a social networking system, the plurality of users into a plurality of user buckets. Each user bucket may include at least one user of the social networking system. The method may further include selecting a set of user buckets from the plurality of user buckets, assigning the set of user buckets to a data center included in a networking infrastructure, and routing data sent from a user device associated with a user included in the set of user buckets to the data center. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for routing network data based on social connections of users

A disclosed computer-implemented method may include receiving, via a monitoring infrastructure that monitors an operational state of a networking infrastructure, data representative of the operational state of the networking infrastructure during a period of time. The networking infrastructure may include (1) a plurality of data centers, and (2) at least one point-of-presence (POP) edge node. The method may also include (1) accessing data representative of a set of predefined policies associated with the networking infrastructure, and (2) based on the data representative of the operational state (a) determining a set of edge load factors associated with the edge node, and (b) generating, via a linear solver and further based the set of edge load factors associated with the edge node and the set of predefined policies associated with the networking infrastructure, a routing table for the POP edge node. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for dynamically generating routing tables for edge nodes in large-scale networking infrastructures

A multi-shard database system receives a transaction including multiple actions directed to different shards of the database system. The database system creates a transaction record including a transaction identifier and a transaction status for the transaction in a transaction database. The database system then executes, in parallel, the multiple actions on the different shards by associating with each data item involved in the transaction a data structure that includes the transaction identifier and new data to be applied to the data item. The database system then updates the transaction status in the transaction record for the transaction from pending to completed when each of the multiple actions is successfully executed on the corresponding shard. Consistency is eventually implemented when the data structures associated with the data items involved in the transaction are evaluated. The evaluation of a data structure can be triggered by a read request or other events.

Providing eventual consistency for multi-shard transactions

Growing community of inventors

San Jose, CA, United States of America

Dmitri Perelman