···6161STAR 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).
626263636464+#### CARs
6565+6666+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
6767+6868+6469## format
65706671```
···113118 - `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.
114119 - `L` (bool, optional): "archived": if `true`, the subtree is contained in this archive. must not be present when `l` is not present.
115120 - `e` (array, required): ordered array of entry objects with length of at least one, each containing:
116116- - `p` (integer, required): number of bytes shared with the previous entry (TODO key compression actually)
121121+ - `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)
117122 - `k` (byte string, required): key suffix remaining
118123 - `v` (hash link, optional): reference to the record data for this key.
119124 - for MST nodes at depth=0: