Abstract: Systems and techniques are described for efficient, general-purpose, and potentially decentralized databases, distributed storage systems, version control systems, and/or other types of data repositories. Data is represented in a database system in such a way that any value is represented by a unique identifier which is derived from the value itself. Any database peer in the system will derive an identical identifier from the same logical value. The identifier for a value may be derived using a variety of mechanisms, including, without limitation, a hash function known to all peers in the system. The values may be organized hierarchically as a tree of nodes. Any two peers storing the same logical value will deterministically represent that value with a graph, such as the described “Prolly” tree, having the same topology and hash value, irrespective of possibly differing sequences of mutations which caused each to arrive at the same final value.

Abstract: Systems and techniques are described for efficient, general-purpose, and potentially decentralized databases, distributed storage systems, version control systems, and/or other types of data repositories. Data is represented in a database system in such a way that any value is represented by a unique identifier which is derived from the value itself. Any database peer in the system will derive an identical identifier from the same logical value. The identifier for a value may be derived using a variety of mechanisms, including, without limitation, a hash function known to all peers in the system. The values may be organized hierarchically as a tree of nodes. Any two peers storing the same logical value will deterministically represent that value with a graph, such as the described “Prolly” tree, having the same topology and hash value, irrespective of possibly differing sequences of mutations which caused each to arrive at the same final value.

Abstract: Systems and techniques are described for efficient, general-purpose, and potentially decentralized databases, distributed storage systems, version control systems, and/or other types of data repositories. Data is represented in a database system in such a way that any value is represented by a unique identifier which is derived from the value itself. Any database peer in the system will derive an identical identifier from the same logical value. The identifier for a value may be derived using a variety of mechanisms, including, without limitation, a hash function known to all peers in the system. The values may be organized hierarchically as a tree of nodes. Any two peers storing the same logical value will deterministically represent that value with a graph, such as the described “Prolly” tree, having the same topology and hash value, irrespective of possibly differing sequences of mutations which caused each to arrive at the same final value.

Abstract: Access is provided to a first tier of limited persistent storage at a server. A first set of data from the first tier is synchronized across devices associated with a user account. Access is provided to a second tier of persistent storage on a local, tangible non-volatile storage medium, and to a third tier of temporary storage on a local, tangible volatile storage medium. A web browser receives a storage request from a web application or browser extension. The request includes a type of a tier of data storage associated with a feature of the web application or browser extension. The type includes at least one of the first tier of remote limited persistent storage, the second tier of local persistent storage, or the third tier of local temporary storage. At least one feature of the web application or browser extension is associated with the tier of data storage.

Abstract: Access is provided to a first tier of limited persistent storage at a server. A first set of data from the first tier is synchronized across devices associated with a user account. Access is provided to a second tier of persistent storage on a local, tangible non-volatile storage medium, and to a third tier of temporary storage on a local, tangible volatile storage medium. A web browser receives a storage request from a web application or browser extension. The request includes a type of a tier of data storage associated with a feature of the web application or browser extension. The type includes at least one of the first tier of remote limited persistent storage, the second tier of local persistent storage, or the third tier of local temporary storage. At least one feature of the web application or browser extension is associated with the tier of data storage.