Implement collaboration effortlessly. Powered by CRDTs.
Built for local-first software.
ReimagineStateManagementwithCRDTs
Loro is a high‑performance CRDT library for local‑first, real‑time collaboration.
High Performance
Optimized for memory, CPU, and loading speed with advanced performance primitives.
Rich CRDT Types Support
Turn JSON-like data into collaborative types effortlessly
Real-Time Collaboration with Version Control
Preserve full version history like Git, even during real-time collaboration
Simple and Intuitive API
Designed with developer experience in mind
Who's Using Loro
Rich Text Editor Demo
Effortless Document Synchronization,
Even in P2P Environments
import { } from "loro-crdt";
const = new ();
const = new ();
.("text").("Hello!");
.("text").("Hi!");
const : = .({ : "update" });
const : = .({ : "update" });
// Exchange bytesA and bytesB via any methods
.();
.();
// The merge result is consistent
// They should both be "Hello!Hi!" or "Hi!Hello!"
.(.("text").());
.(.("text").());What You Can Build
Loro powers the collaborative state layer. You bring UI, auth, storage, and transport.
Collaborative Documents
Design Tools
Multiplayer Games
Rich CRDTs Algorithm Support
Basic Data Structures
Includes support for MovableList for ordered collections, LWW (Last Write Win) Map for key-value pairs, MovableTree for hierarchical data, and Text for rich text manipulation, enabling various of applications.
Text/List Editing with Fugue
Loro integrates Fugue, a novel CRDT algorithm designed to minimize the interleaving anomalies when merging concurrent text/list edits.
Rich Text CRDT
Loro manages rich text CRDTs that excel at merging concurrent rich text style edits, maintaining the original intent of each user's input as much as possible. Please read our blog, Loro's Rich Text CRDT, to learn more.
Hierarchical Data with Moveable Tree
For applications requiring directory-like data manipulation, Loro utilizes the algorithm from A Highly-Available Move Operation for Replicated Trees, simplifying moving and reorganizing hierarchical data structures.










