From 3c6ebc8a1e4ccfae7d1dcb37039fee9aac531b7d Mon Sep 17 00:00:00 2001 From: phil Date: Thu, 22 Jan 2026 09:54:52 -0500 Subject: [PATCH] link to the atproto repo spec --- readme.md | 7 ++++++- 1 file changed, 6 insertions(+), 1 deletion(-) diff --git a/readme.md b/readme.md index 37e5156..badb908 100644 --- a/readme.md +++ b/readme.md @@ -61,6 +61,11 @@ STAR is specialized for atproto MST storage, and best-suited for serializing com STAR format does not aim to provide efficient access to random nodes or through other tree iteration patterns. Almost any kind of inspection requires a linear scan through the archive (especially if global key compression happens). +#### CARs + +The IETF draft for AT repositories (referred to as "repo spec" in this document) can be found at https://github.com/bluesky-social/ietf-drafts/blob/main/draft-holmgren-at-repository.md or https://www.ietf.org/archive/id/draft-holmgren-at-repository-00.html + + ## format ``` @@ -113,7 +118,7 @@ There are two kinds of blocks in the tree: `node` blocks and `record` blocks. If - `l` (hash link, optional): reference to a subtree at a lower depth containing only keys to the left of this node. if absent, there is no left subtree. - `L` (bool, optional): "archived": if `true`, the subtree is contained in this archive. must not be present when `l` is not present. - `e` (array, required): ordered array of entry objects with length of at least one, each containing: - - `p` (integer, required): number of bytes shared with the previous entry (TODO key compression actually) + - `p` (integer, required): number of bytes shared with the previous entry (TODO [key compression](https://www.ietf.org/archive/id/draft-holmgren-at-repository-00.html#name-mst-node-schema) actually) - `k` (byte string, required): key suffix remaining - `v` (hash link, optional): reference to the record data for this key. - for MST nodes at depth=0: -- 2.51.2