A method for confirming configuration of a new current genesis block in a blockchain configured to enable pruning before the new current genesis block includes: receiving, by a blockchain node in a blockchain network, a genesis response message from another node in the network, the message including a configuration value and an ordinal value; identifying a plurality of standard blocks in the blockchain added subsequent to an earlier genesis block that includes a number preceding the ordinal value; aggregating smart contract state changes from each of the identified plurality of standard blocks; and validating the configuration value included in the received genesis response message based on the aggregated smart contract state changes. The aggregating of smart contract states can be done by the processor of the blockchain node configuring the new current genesis block, or by another blockchain node.

Disclosed in some examples are improved storage, replication, and distribution of data related to network-based meetings (e.g., media) in hierarchical records. Data for one or more components of the meeting (e.g., media) may be stored in a child record (called a component record). The network-based meeting may be described by a parent record with links to, and in some examples descriptions of, the meeting component records (the child records). The meeting object may point to local, and/or replicated copies of the child records. As noted, the child records may be or include media objects and, in some examples, the child records may be replicated to one or more locations based upon a demand for the media object. By replicating the media to a location that is close to demand for the media, this provides for more efficient delivery of media of the meeting.

A system according to certain aspects may include a client computing device including: a database application configured to output a database file in a primary storage device(s), the database application outputting the database file as a series of application-level blocks; and a data agent configured to divide the database file into a plurality of first blocks having a first granularity larger than a second granularity of the application-level blocks such that each of the first blocks spans a plurality of the application-level blocks. The system may include a secondary storage controller computer(s) configured to: in response to instructions to create a secondary copy of the database file: copy the plurality of first blocks to a secondary storage device(s) to create a secondary copy of the database file; and create a table that provides a mapping between the copied plurality of first blocks and corresponding locations on the secondary storage device(s).

The present technology pertains to a organization directory hosted by a synchronized content management system. The corporate directory can provide access to user accounts for all members of the organization to all content items in the organization directory on the respective file systems of the members' client devices. Members can reach any content item at the same path as other members relative to the organization directory root on their respective client device. In some embodiments novel access permissions are granted to maintain path consistency.

A distributed computer system for delivering data to client-side application(s) is provided. The system includes a database configured to store immutable data blocks, a data distribution entity configured to split source-data into immutable data blocks and metadata. The data distribution entity is configured to replicate and store the data blocks on different storage nodes(s) of the database. The metadata comprises values referencing the data blocks for a key-value database call. The system further comprises a data fetching/delivering entity with a fuse-daemon configured to form a quorum read request for data block(s) out of a client-side request for a certain data range. The quorum-read request is a bundle of parallel requests to different storage nodes. The fuse-daemon is configured to fetch the data blocks delivered in the fastest response and to discard the rest. The fuse-daemon generates a virtual file comprising the corresponding range of data from the fetched data blocks.

Methods, systems, and computer-readable media for orchestration of computations using a remote repository are disclosed. A representation of one or more inputs to a computation is stored in a repository. The computation is assigned to one or more hosts of a plurality of hosts. A representation of program code executable to perform the computation is stored in the repository. A local copy of the one or more inputs is stored on the one or more hosts. The computation is initiated on the one or more hosts using the program code and the local copy of the one or more inputs. The computation is initiated for a plurality of keys. The computation succeeds for one or more keys after the computation has failed for one or more other keys. A representation of one or more outputs of the computation is stored in the repository.

Methods, systems, and computer-readable media for orchestration of computations using a remote repository are disclosed. A representation of one or more inputs to a computation is stored in a repository. The computation is assigned to one or more hosts of a plurality of hosts. A representation of program code executable to perform the computation is stored in the repository. A local copy of the one or more inputs is stored on the one or more hosts. The computation is initiated on the one or more hosts using the program code and the local copy of the one or more inputs. The computation is initiated for a plurality of keys. The computation succeeds for one or more keys after the computation has failed for one or more other keys. A representation of one or more outputs of the computation is stored in the repository.

One example method includes receiving a write request that includes a data structure version to be written, wherein the data structure version is associated with a unique identifier, storing the data structure version in association with the unique identifier, receiving a read request for a most recent version of the data structure and, when the stored data structure version is not the most recent version of the data structure, examining respective unique identifiers of each of a group of other stored data structure versions to determine which stored data structure version is the most recent. Finally, the example method includes returning the most recent data structure version, notwithstanding that one or more other data structure versions existed at the time that the read request was received.

The disclosed technology relates to a system configured to receive operations data from a content management system, wherein the operations data comprises a log of operations, execute the log of operations, and update, based on execution of the log of operations, a remote tree representing a server state for content items stored on the content management system.

A method comprises storing an electronic configuration document that identifies configurations of users, groups, and/or permissions relating to access to computer program artifacts in a first repository of an artifact repository system that is geographically distributed. The users and groups include external user groups who do not have explicit user-based permissions to view contents of a repository of the artifact repository system. The artifact repository system comprise second repositories that respectively replicate third repositories and have associated sets of properties, the third repositories including a repository external to the artifact repository system and associated with an external user group. The configurations comprise at least one configuration for configuring external visibility of computer program artifacts for one or more external user groups. The method further comprises deriving from the electronic configuration document, a plurality of regional repository settings values for each second repository based on the associated set of properties.