@storacha/md-merge 0.1.0

package/LICENSE.md

@@ -0,0 +1,204 @@
+The contents of this repository are Copyright (c) corresponding authors and
+contributors, licensed under the `Permissive License Stack` meaning either of:
+
+- Apache-2.0 Software License: https://www.apache.org/licenses/LICENSE-2.0
+  ([...4tr2kfsq](https://dweb.link/ipfs/bafkreiankqxazcae4onkp436wag2lj3ccso4nawxqkkfckd6cg4tr2kfsq))
+
+- MIT Software License: https://opensource.org/licenses/MIT
+  ([...vljevcba](https://dweb.link/ipfs/bafkreiepofszg4gfe2gzuhojmksgemsub2h4uy2gewdnr35kswvljevcba))
+
+You may not use the contents of this repository except in compliance
+with one of the listed Licenses. For an extended clarification of the
+intent behind the choice of Licensing please refer to
+https://protocol.ai/blog/announcing-the-permissive-license-stack/
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the terms listed in this notice is distributed on
+an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,
+either express or implied. See each License for the specific language
+governing permissions and limitations under that License.
+
+<!--- SPDX-License-Identifier: Apache-2.0 OR MIT -->
+
+`SPDX-License-Identifier: Apache-2.0 OR MIT`
+
+Verbatim copies of both licenses are included below:
+
+<details><summary>Apache-2.0 Software License</summary>
+
+```
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+   1. Definitions.
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+   END OF TERMS AND CONDITIONS
+```
+
+</details>
+
+<details><summary>MIT Software License</summary>
+
+```
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+```
+
+</details>

package/README.md

@@ -0,0 +1,163 @@
+# md-merge
+
+CRDT-based markdown merging using RGA-backed mdast trees.
+
+Every `children` array in a markdown AST is replaced with an [RGA](https://en.wikipedia.org/wiki/Conflict-free_replicated_data_type#Sequence_CRDTs) (Replicated Growable Array), giving deterministic merge semantics at every nesting level — paragraphs, list items, inline formatting, everything.
+
+No three-way merge needed. The RGA *is* the history.
+
+## How it works
+
+1. **Parse** markdown to an [mdast](https://github.com/syntax-tree/mdast) tree
+2. **Convert** to an RGA-backed tree (`RGATree`) — each `children` array becomes an RGA with unique node IDs and causal ordering
+3. **Edit** by generating `RGAChangeSet`s from new markdown — diffs are resolved to RGA node IDs, not array indices
+4. **Merge** by applying each peer's changesets — RGA semantics handle concurrent inserts/deletes deterministically
+5. **Serialize** trees and changesets to DAG-CBOR for storage and exchange
+
+## Install
+
+```
+npm install md-merge
+```
+
+## Usage
+
+### Bootstrap a tree from markdown
+
+```typescript
+import { parse, toRGATree, toMdast, stringify } from 'md-merge'
+import type { RGAEvent, EventComparator } from 'md-merge'
+
+// Define your event type (identifies who made each edit)
+class MyEvent implements RGAEvent {
+  constructor(readonly name: string) {}
+  toString() { return this.name }
+}
+
+const compare: EventComparator<MyEvent> = (a, b) =>
+  a.name < b.name ? -1 : a.name > b.name ? 1 : 0
+
+// Create an RGA tree
+const tree = toRGATree(parse('# Hello\n\nWorld.\n'), new MyEvent('alice'), compare)
+
+// Convert back to markdown
+stringify(toMdast(tree)) // '# Hello\n\nWorld.\n'
+```
+
+### Generate and apply changesets
+
+```typescript
+import { generateRGAChangeSet, applyRGAChangeSet } from 'md-merge'
+
+const aliceEdit = new MyEvent('alice-v2')
+const newDoc = parse('# Hello\n\nWorld.\n\nNew paragraph.\n')
+
+// Generate an RGA-addressed changeset (uses node IDs, not indices)
+const changeset = generateRGAChangeSet(tree, newDoc, aliceEdit)
+
+// Apply it
+const updated = applyRGAChangeSet(tree, changeset, compare)
+stringify(toMdast(updated)) // '# Hello\n\nWorld.\n\nNew paragraph.\n'
+```
+
+### Merge concurrent edits
+
+```typescript
+// Alice and Bob both start from the same tree
+// Alice adds a paragraph, Bob deletes one — each generates a changeset
+
+const aliceCS = generateRGAChangeSet(tree, aliceNewDoc, aliceEvent)
+const bobCS = generateRGAChangeSet(tree, bobNewDoc, bobEvent)
+
+// Apply both — order doesn't matter, result converges
+let merged = applyRGAChangeSet(tree, aliceCS, compare)
+merged = applyRGAChangeSet(merged, bobCS, compare)
+
+// Or the other way — same result
+let merged2 = applyRGAChangeSet(tree, bobCS, compare)
+merged2 = applyRGAChangeSet(merged2, aliceCS, compare)
+```
+
+### Serialize to DAG-CBOR
+
+```typescript
+import { encodeTree, decodeTree, encodeChangeSet, decodeChangeSet } from 'md-merge'
+
+// Encode a tree to a content-addressed block
+const block = await encodeTree(tree)
+block.cid    // CID of the block
+block.bytes  // Uint8Array of DAG-CBOR
+
+// Decode it back (provide event parser + fingerprint fn + comparator)
+const decoded = await decodeTree(
+  { bytes: block.bytes },
+  s => new MyEvent(s),    // parseEvent
+  fingerprintFn,           // node fingerprint function
+  compare,
+)
+
+// Same for changesets
+const csBlock = await encodeChangeSet(changeset)
+const decodedCS = await decodeChangeSet({ bytes: csBlock.bytes }, s => new MyEvent(s))
+```
+
+## Architecture
+
+```
+markdown string
+    ↓ parse()
+  mdast Root
+    ↓ toRGATree(root, event, compare)
+  RGATreeRoot ← every children[] is now an RGA
+    ↓ generateRGAChangeSet(tree, newMdast, event)
+  RGAChangeSet ← ID-addressed ops (no array indices)
+    ↓ applyRGAChangeSet(tree, changeset, compare)
+  RGATreeRoot (updated)
+    ↓ toMdast(tree)
+  mdast Root
+    ↓ stringify()
+markdown string
+```
+
+### Key types
+
+| Type | Description |
+|------|-------------|
+| `RGATreeRoot<E>` | Root node with RGA-backed children |
+| `RGAChangeSet<E>` | Set of ID-addressed changes + the event that produced them |
+| `RGAChange<E>` | Single op: insert/delete/modify with `parentPath`, `targetId`, `afterId` |
+| `RGA<T, E>` | Replicated Growable Array — ordered CRDT sequence |
+| `RGANodeId<E>` | `{ uuid, event }` — unique ID for each node |
+| `RGAEvent` | Interface for event types (just needs `toString()`) |
+
+### Why no three-way merge?
+
+Traditional text merge needs a common ancestor to figure out what changed on each side. With RGA, every node carries its causal history (who inserted it, after which predecessor). Two RGA trees can be merged by applying each other's operations — concurrent inserts land deterministically based on event ordering, and tombstoned deletes are idempotent.
+
+## API Reference
+
+### Parsing
+- `parse(markdown: string): Root` — parse markdown to mdast
+- `stringify(root: Root): string` — serialize mdast to markdown
+- `fingerprint(node: RootContent): string` — content hash of a node
+
+### Diffing (index-based, internal)
+- `diff(oldRoot, newRoot): ChangeSet` — LCS-based mdast diff
+- `applyChangeSet(root, changeset): Root` — apply index-based changes
+
+### RGA Tree
+- `toRGATree(root, event, compare): RGATreeRoot` — convert mdast to RGA tree
+- `toMdast(rgaRoot): Root` — convert RGA tree back to mdast
+- `applyMdastToRGATree(existing, newRoot, event, compare): RGATreeRoot` — shorthand for generate + apply
+- `generateRGAChangeSet(existing, newRoot, event): RGAChangeSet` — diff and resolve to RGA IDs
+- `applyRGAChangeSet(root, changeset, compare): RGATreeRoot` — apply ID-addressed changes
+
+### Codec (DAG-CBOR)
+- `encodeTree(root): Promise<Block>` — serialize RGA tree
+- `decodeTree(block, parseEvent, fpFn, compare): Promise<RGATreeRoot>` — deserialize
+- `encodeChangeSet(cs): Promise<Block>` — serialize changeset
+- `decodeChangeSet(block, parseEvent): Promise<RGAChangeSet>` — deserialize
+
+## License
+
+MIT — see [LICENSE.md](./LICENSE.md)

package/package.json

@@ -0,0 +1,30 @@
+{
+  "name": "@storacha/md-merge",
+  "version": "0.1.0",
+  "type": "module",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "exports": {
+    ".": "./dist/index.js"
+  },
+  "dependencies": {
+    "remark": "^15",
+    "remark-parse": "^11",
+    "remark-stringify": "^11",
+    "unified": "^11",
+    "@storacha/ucn": "1.1.1-rc.3",
+    "multiformats": "^13",
+    "@ipld/dag-cbor": "^9"
+  },
+  "devDependencies": {
+    "typescript": "^5.4",
+    "vitest": "^3",
+    "@types/node": "^22",
+    "@types/mdast": "^4"
+  },
+  "scripts": {
+    "build": "tsc",
+    "check": "tsc --noEmit",
+    "test": "vitest run"
+  }
+}

package/src/codec.ts

@@ -0,0 +1,245 @@
+/**
+ * DAG-CBOR serialization for RGATree and RGAChangeSet.
+ *
+ * Converts RGA class instances (with Maps, nested RGAs) to plain
+ * CBOR-friendly objects and back.
+ */
+
+import { encode, decode } from 'multiformats/block'
+import { sha256 } from 'multiformats/hashes/sha2'
+import * as cbor from '@ipld/dag-cbor'
+import { RGA, type RGANodeId, type RGANode, type RGAEvent, type EventComparator } from './crdt/rga.js'
+import type { RGATreeRoot, RGATreeNode, RGAParentNode } from './types.js'
+import type { RGAChangeSet, RGAChange } from './types.js'
+
+
+/** Recursively strip `undefined` values (not IPLD-compatible). */
+function stripUndefined(obj: unknown): unknown {
+  if (obj === null || obj === undefined) return null
+  if (Array.isArray(obj)) return obj.map(stripUndefined)
+  if (typeof obj === 'object') {
+    const clean: Record<string, unknown> = {}
+    for (const [k, v] of Object.entries(obj as Record<string, unknown>)) {
+      if (v !== undefined) clean[k] = stripUndefined(v)
+    }
+    return clean
+  }
+  return obj
+}
+
+// ---- Serializable shapes (plain objects, no class instances) ----
+
+interface SerializedRGANode {
+  id: { uuid: string; event: string }
+  value: unknown
+  afterId: { uuid: string; event: string } | null
+  tombstone: boolean
+}
+
+interface SerializedRGA {
+  nodes: SerializedRGANode[]
+}
+
+interface SerializedRGATreeRoot {
+  type: 'root'
+  children: SerializedRGA
+}
+
+interface SerializedRGAChangeSet {
+  event: string
+  changes: SerializedRGAChange[]
+}
+
+interface SerializedRGAChange {
+  type: 'insert' | 'delete' | 'modify'
+  parentPath: Array<{ uuid: string; event: string }>
+  targetId?: { uuid: string; event: string } | null
+  afterId?: { uuid: string; event: string } | null
+  nodes?: unknown[]
+  before?: unknown[]
+}
+
+// ---- Helpers ----
+
+function serializeNodeId<E extends RGAEvent>(id: RGANodeId<E>): { uuid: string; event: string } {
+  return { uuid: id.uuid, event: id.event.toString() }
+}
+
+function deserializeNodeId<E extends RGAEvent>(
+  raw: { uuid: string; event: string },
+  parseEvent: (s: string) => E,
+): RGANodeId<E> {
+  return { uuid: raw.uuid, event: parseEvent(raw.event) }
+}
+
+function isRGAParentSerialized(node: unknown): node is { type: string; children: SerializedRGA } {
+  return (
+    node != null &&
+    typeof node === 'object' &&
+    'children' in node &&
+    typeof (node as Record<string, unknown>).children === 'object' &&
+    (node as Record<string, unknown>).children !== null &&
+    'nodes' in ((node as Record<string, unknown>).children as Record<string, unknown>)
+  )
+}
+
+function isRGAParentNode<E extends RGAEvent>(node: RGATreeNode<E>): node is RGAParentNode<E> {
+  return 'children' in node && node.children instanceof RGA
+}
+
+// ---- RGATree serialization ----
+
+function serializeRGA<E extends RGAEvent>(rga: RGA<RGATreeNode<E>, E>): SerializedRGA {
+  const nodes: SerializedRGANode[] = []
+  for (const node of rga.nodes.values()) {
+    nodes.push({
+      id: serializeNodeId(node.id),
+      value: serializeTreeNodeValue(node.value),
+      afterId: node.afterId ? serializeNodeId(node.afterId) : null,
+      tombstone: node.tombstone,
+    })
+  }
+  return { nodes }
+}
+
+function serializeTreeNodeValue<E extends RGAEvent>(node: RGATreeNode<E>): unknown {
+  if (isRGAParentNode(node)) {
+    const { children, ...rest } = node
+    return { ...rest, children: serializeRGA(children) }
+  }
+  return node
+}
+
+function serializeTree<E extends RGAEvent>(root: RGATreeRoot<E>): SerializedRGATreeRoot {
+  return {
+    type: 'root',
+    children: serializeRGA(root.children),
+  }
+}
+
+function deserializeRGA<E extends RGAEvent>(
+  raw: SerializedRGA,
+  parseEvent: (s: string) => E,
+  fingerprintFn: (value: RGATreeNode<E>) => string,
+  compareEvents: EventComparator<E>,
+): RGA<RGATreeNode<E>, E> {
+  const rga = new RGA<RGATreeNode<E>, E>(fingerprintFn, compareEvents)
+  for (const rawNode of raw.nodes) {
+    const id = deserializeNodeId(rawNode.id, parseEvent)
+    const afterId = rawNode.afterId ? deserializeNodeId(rawNode.afterId, parseEvent) : undefined
+    const value = deserializeTreeNodeValue(rawNode.value, parseEvent, fingerprintFn, compareEvents)
+    const key = `${id.uuid}:${id.event.toString()}`
+    rga.nodes.set(key, { id, value, afterId, tombstone: rawNode.tombstone })
+  }
+  return rga
+}
+
+function deserializeTreeNodeValue<E extends RGAEvent>(
+  raw: unknown,
+  parseEvent: (s: string) => E,
+  fingerprintFn: (value: RGATreeNode<E>) => string,
+  compareEvents: EventComparator<E>,
+): RGATreeNode<E> {
+  if (isRGAParentSerialized(raw)) {
+    const { children, ...rest } = raw
+    return {
+      ...rest,
+      children: deserializeRGA(children, parseEvent, fingerprintFn, compareEvents),
+    } as RGAParentNode<E>
+  }
+  return raw as RGATreeNode<E>
+}
+
+function deserializeTree<E extends RGAEvent>(
+  raw: SerializedRGATreeRoot,
+  parseEvent: (s: string) => E,
+  fingerprintFn: (value: RGATreeNode<E>) => string,
+  compareEvents: EventComparator<E>,
+): RGATreeRoot<E> {
+  return {
+    type: 'root',
+    children: deserializeRGA(raw.children, parseEvent, fingerprintFn, compareEvents),
+  }
+}
+
+// ---- RGAChangeSet serialization ----
+
+function serializeChangeSet<E extends RGAEvent>(cs: RGAChangeSet<E>): SerializedRGAChangeSet {
+  return {
+    event: cs.event.toString(),
+    changes: cs.changes.map(c => ({
+      type: c.type,
+      parentPath: c.parentPath.map(serializeNodeId),
+      targetId: c.targetId ? serializeNodeId(c.targetId) : null,
+      afterId: c.afterId ? serializeNodeId(c.afterId) : null,
+      nodes: c.nodes,
+      before: c.before,
+    })),
+  }
+}
+
+function deserializeChangeSet<E extends RGAEvent>(
+  raw: SerializedRGAChangeSet,
+  parseEvent: (s: string) => E,
+): RGAChangeSet<E> {
+  return {
+    event: parseEvent(raw.event),
+    changes: raw.changes.map(c => {
+      const change: RGAChange<E> = {
+        type: c.type,
+        parentPath: c.parentPath.map(id => deserializeNodeId(id, parseEvent)),
+      }
+      if (c.targetId) change.targetId = deserializeNodeId(c.targetId, parseEvent)
+      if (c.afterId) change.afterId = deserializeNodeId(c.afterId, parseEvent)
+      if (c.nodes) change.nodes = c.nodes as any
+      if (c.before) change.before = c.before as any
+      return change
+    }),
+  }
+}
+
+// ---- Public API: encode/decode to DAG-CBOR blocks ----
+
+/**
+ * Encode an RGATree as a DAG-CBOR block.
+ */
+export async function encodeTree<E extends RGAEvent>(
+  root: RGATreeRoot<E>,
+) {
+  const value = stripUndefined(serializeTree(root)) as SerializedRGATreeRoot
+  return encode({ value, codec: cbor, hasher: sha256 })
+}
+
+/**
+ * Decode an RGATree from a DAG-CBOR block.
+ */
+export async function decodeTree<E extends RGAEvent>(
+  block: { bytes: Uint8Array },
+  parseEvent: (s: string) => E,
+  fingerprintFn: (value: RGATreeNode<E>) => string,
+  compareEvents: EventComparator<E>,
+): Promise<RGATreeRoot<E>> {
+  const decoded = await decode({ bytes: block.bytes, codec: cbor, hasher: sha256 })
+  return deserializeTree(decoded.value as SerializedRGATreeRoot, parseEvent, fingerprintFn, compareEvents)
+}
+
+/**
+ * Encode an RGAChangeSet as a DAG-CBOR block.
+ */
+export async function encodeChangeSet<E extends RGAEvent>(
+  cs: RGAChangeSet<E>,
+) {
+  const value = stripUndefined(serializeChangeSet(cs)) as SerializedRGAChangeSet
+  return encode({ value, codec: cbor, hasher: sha256 })
+}
+
+/**
+ * Decode an RGAChangeSet from a DAG-CBOR block.
+ */
+export async function decodeChangeSet<E extends RGAEvent>(
+  block: { bytes: Uint8Array },
+  parseEvent: (s: string) => E,
+): Promise<RGAChangeSet<E>> {
+  const decoded = await decode({ bytes: block.bytes, codec: cbor, hasher: sha256 })
+  return deserializeChangeSet(decoded.value as SerializedRGAChangeSet, parseEvent)
+}