Tagged: storage
10 projects across the lattice ecosystem.
Videos & Talks
- Convex — Data Lattice and Convergent Storage Deep dive into the Convex data lattice — how content-addressed, convergently-merged storage replicates across peers without central coordination.
- Unpacking the Data Lattice File System (DLFS) Unpacking the Data Lattice File System (DLFS) — a decentralised, content-addressed filesystem built on lattice storage.
- Convex: The dawn of persistence The dawn of persistence — moving from Testnet to durable, decentralised on-chain state ahead of Protonet.
Convex Architecture Documents
- CAD002: CVM Values Mandates that every value on the network is a pure immutable cell in a Merkle DAG — so hashes are stable identities, snapshots are O(1), and untrusted smart contracts can be handed references without defensive copying. This is the data-model prerequisite for everything the lattice does that a mutable-heap blockchain like Ethereum cannot.
- CAD003: Encoding Format Defines the one canonical byte encoding every cell collapses to, so any value hashes to exactly one global ID and peers can deduplicate, stream and merge state without coordination. This is the physics of the lattice — JSON has no canonical form, Protobuf needs schemas, ASN.1 can't bound buffer size; CAD3 solves all three at once.
- CAD006: Memory Accounting Makes on-chain storage an accounted, tradeable resource — users get a memory allowance, pay into a common pool for more, and are refunded for deletions. Directly attacks the state-bloat trap that makes running an Ethereum archive node increasingly impractical.
- CAD024: Data Lattice Specifies the off-chain CRDT substrate — content-addressed, lazily loaded, self-healing, garbage-collectable, structurally shared and JSON-superset typed. This is where Convex solves what IPFS handles clumsily: rich types, efficient deltas, and merges that just work instead of manual pinning and reconciliation.
- CAD028: Data Lattice File System A POSIX-compatible self-sovereign file system on the lattice — CRDT merge means editing the same file on two offline devices reconciles automatically, with Merkle verification and peer-to-peer sync. Dropbox/iCloud with the provider removed and the data still yours.
- CAD036: Lattice Node A lightweight non-consensus server that just replicates CRDT lattice data over the network — no CPoS, no staking, minimal resources. The right tier for CDNs, collaborative apps and hybrid dApps that need lattice sync without the cost of running a full Convex peer.
- CAD037: KV Database A Redis-style per-owner signed KV store on the lattice — multi-writer, offline-first, convergent without leader election because merge is mathematical, not negotiated. Gives hybrid dApps the shared mutable state that a global blockchain cannot afford to host.