A boundless, self-healing cloud of decentralised data and computing power. Fortified by cryptography and seamless consensus, no single entity controls it.
Mathematics as infrastructure
At its core, the Lattice draws from the mathematical concept of a lattice—a partially ordered set equipped with a merge function. This function combines any two lattice values into a single, consistent result. Through repeated merges, the system naturally converges to a unified value without complex locking mechanisms or heavy consensus protocols.
This design makes the Lattice a Conflict-free Replicated Data Type (CRDT). It guarantees eventual consistency across the network, requiring only occasional gossip between nodes. No continuous connectivity needed—simple, intermittent sharing of lattice values keeps the system in perfect sync.
All data is immutable, content-addressable, and structured as Merkle trees. Digital signatures and cryptographic hashes ensure secure, tamper-proof operation. Conditional acceptance rules thwart malicious actors—invalid values are rejected outright by the network.
A key innovation: the merge process uses three inputs—context, the existing trusted value, and the received value. This ensures merges are intelligent and secure. Only portions that pass cryptographic validation are accepted, with the trusted value always prioritised.
A flexible framework of specialised sub-lattices
Drives a secure, decentralised global state machine using CPoS. Lattice values are Beliefs, shared by peers and merged to achieve Byzantine fault-tolerant consensus. Smart contracts, digital assets, and autonomous actors all operate within this region.
Explore CPoSA decentralised storage network for content-addressable data, owned and managed by its users. Store, read, acquire, and pin arbitrary data. A faster, more efficient evolution of IPFS, built on the Lattice's high-performance architecture.
Read DocsThe Data Lattice File System extends the Data Lattice into a self-sovereign, replicated file system. Snapshot entire drives with a single hash. Structural sharing means only deltas are stored—Dropbox meets BitTorrent meets IPFS.
Read DocsSpecifies compute tasks to be performed on a decentralised basis. Job records define specifications, inputs, outputs, and authorisation. Supports private enclaves, encrypted data, and specialised compute infrastructure.
Read DocsPowers peer-to-peer communication by solving the challenge of locating participants in a decentralised network. Operates like Kademlia—peers store metadata only for nearby peers in cryptographic space, making it highly efficient and fault-tolerant.
Read DocsHow we build a global data structure of unlimited size
Immutable persistent data structures mean changes produce new values that share most data with the original. Storage and processing are proportional only to changes, not total size.
Only deltas are transmitted when new lattice values are communicated. Network requirements are proportional only to changes—not the total data in the system.
Multiple received values are merged into a single outgoing value. This automatically reduces traffic and scales load to what each node can individually handle.
Nodes select whichever subsets of the lattice they need. Peer operators can scale resource usage based on their own requirements, participating only in relevant regions.
Lattice values exist seamlessly in memory or on disk. From a developer perspective, they are identical. Values are efficiently loaded and cached on demand—an in-memory database that can exceed local RAM.
Checking identity of any two values is a single hash comparison: O(1). Computing the common prefix of two vectors of arbitrary length is also O(1)—heavily exploited for CPoS efficiency.
What makes the Lattice unique
Selective attention means nodes only handle what they need. The lattice grows without bound while each participant scales resources independently. No shards, no cross-chain complexity.
No centralised services. No single source of truth for off-chain data. Users have full control over data storage and sharing. Code is also data—programs and AI models can be stored and executed on the lattice alone.
The CRDT design guarantees eventual consistency without complex coordination protocols. Simple, occasional gossip between nodes suffices. The lattice self-heals and self-replicates across the network.
Experiment with lattice technology on the live testnet or explore the consensus layer that powers it.