a sharded store to hold large IPLD graphs efficiently, packaged as location-transparent attachable CAR files, with mechanical sympathy - filecoin-project/dagstore
Filecoin | World's Largest Decentralized Storage Network for Humanity's Data
Preserve humanity's most important information on Filecoin, the decentralized storage network with verifiable integrity, global redundancy, and no centralized control. Build apps, store data securely, or become a storage provider today.
JuiceFS - Open Source Distributed POSIX File System for Cloud
JuiceFS is a cloud-based high-performance distributed file system, based on object storage and database to achieve data and metadata separation architecture, easily carrying tens of billions of file storage, to meet the random read performance requirements of big data, AI, autonomous driving, gene sequencing and other massive data.
Fil One Object Storage
S3-compatible object storage on Filecoin with no egress fees and verifiable data integrity, proven daily.
GitHub - ipld/go-car: A content addressible archive utility
A content addressible archive utility. Contribute to ipld/go-car development by creating an account on GitHub.
candystore - Rust
A fast (blazingly, of course), persistent, in-process key-value store that relies on a novel sharding algorithm. Since Candy does not rely on log-structured merge (LSM) trees or B-Trees, no journal/WAL is needed and IOs go directly to file.
Home
Filecoin is a distributed storage network based on a blockchain mechanism. Filecoin miners can elect to provide storage capacity for the network, and thereby earn units of the Filecoin cryptocurrency (FIL) by periodically producing cryptographic proofs that certify that they are providing the capacity specified. In addition, Filecoin enables parties to exchange FIL currency through transactions recorded in a shared ledger on the Filecoin blockchain. Rather than using Nakamoto-style proof of work to maintain consensus on the chain, however, Filecoin uses proof of storage itself: a miner’s power in the consensus protocol is proportional to the amount of storage it provides.
TigerFS
A filesystem backed by PostgreSQL, and a filesystem interface to PostgreSQL. TigerFS mounts a database as a directory. Every file is a real row. Writes are transactions. Multiple agents and humans can read and write concurrently with full ACID guarantees, locally or across machines. Any tool that works with files works out of the box.
Three schemes for shared-private storage - Paul's Leaflets
jdefrancesco/dskDitto
Ultra fast and easy duplicate file finder. Awesome TUI/GUI to manage results.
The KD Files - Case File Tracker
File storage and Library in ChatGPT | OpenAI Help Center
Library is available to ChatGPT Free, Go, Plus, Pro, and Business users, and is rolling out to Enterprise, Edu, and Healthcare workspaces, including those in the European Economic Area, Switzerland, and the United Kingdom.
A Categorical Theory of Patches
When working with distant collaborators on the same documents, one often uses a version control system, which is a program tracking the history of files and helping importing modifications brought by others as patches. The implementation of such a system requires to handle lots of situations depending on the operations performed by users on files, and it is thus difficult to ensure that all the corner cases have been correctly addressed. Here, instead of verifying the implementation of such a system, we adopt a complementary approach: we introduce a theoretical model, which is defined abstractly by the universal property that it should satisfy, and work out a concrete description of it. We begin by defining a category of files and patches, where the operation of merging the effect of two coinitial patches is defined by pushout. Since two patches can be incompatible, such a pushout does not necessarily exist in the category, which raises the question of which is the correct category to represent and manipulate files in conflicting state. We provide an answer by investigating the free completion of the category of files under finite colimits, and give an explicit description of this category: its objects are finite sets labeled by lines equipped with a transitive relation and morphisms are partial functions respecting labeling and relations.