pub const FILE_DESCRIPTOR_SET: &[u8] = b"\n\xbc\x06\n#snix/castore/protos/blobstore.proto\x12\x0fsnix.castore.v1\"\x80\x01\n\x08BlobMeta\x12;\n\x06chunks\x18\x02 \x03(\x0b2#.snix.castore.v1.BlobMeta.ChunkMetaR\x06chunks\x1a7\n\tChunkMeta\x12\x16\n\x06digest\x18\x01 \x01(\x0cR\x06digest\x12\x12\n\x04size\x18\x02 \x01(\x04R\x04sizeB\"Z snix.dev/castore/proto;castorev1J\xd4\x04\n\x06\x12\x04\x02\x00\x15\x01\nL\n\x01\x0c\x12\x03\x02\x00\x12\x1aB SPDX-License-Identifier: MIT\n Copyright \xc2\xa9 2026 The Snix Project\n\n\x08\n\x01\x02\x12\x03\x04\x00\x18\n\x08\n\x01\x08\x12\x03\x06\x007\n\t\n\x02\x08\x0b\x12\x03\x06\x007\nE\n\x02\x04\x00\x12\x04\t\x00\x15\x01\x1a9 Describes more granular chunking information of a blob.\n\n\n\n\x03\x04\x00\x01\x12\x03\t\x08\x10\nt\n\x04\x04\x00\x02\x00\x12\x03\x0c\x02 \x1ag Contains a list of more granular chunks.\n An empty list is only allowed if describing the empty blob.\n\n\x0c\n\x05\x04\x00\x02\x00\x04\x12\x03\x0c\x02\n\n\x0c\n\x05\x04\x00\x02\x00\x06\x12\x03\x0c\x0b\x14\n\x0c\n\x05\x04\x00\x02\x00\x01\x12\x03\x0c\x15\x1b\n\x0c\n\x05\x04\x00\x02\x00\x03\x12\x03\x0c\x1e\x1f\n\x0c\n\x04\x04\x00\x03\x00\x12\x04\x0e\x02\x14\x03\n\x0c\n\x05\x04\x00\x03\x00\x01\x12\x03\x0e\n\x13\n.\n\x06\x04\x00\x03\x00\x02\x00\x12\x03\x10\x04\x15\x1a\x1f Digest of that specific chunk\n\n\x0e\n\x07\x04\x00\x03\x00\x02\x00\x05\x12\x03\x10\x04\t\n\x0e\n\x07\x04\x00\x03\x00\x02\x00\x01\x12\x03\x10\n\x10\n\x0e\n\x07\x04\x00\x03\x00\x02\x00\x03\x12\x03\x10\x13\x14\n0\n\x06\x04\x00\x03\x00\x02\x01\x12\x03\x13\x04\x14\x1a! Length of that chunk, in bytes.\n\n\x0e\n\x07\x04\x00\x03\x00\x02\x01\x05\x12\x03\x13\x04\n\n\x0e\n\x07\x04\x00\x03\x00\x02\x01\x01\x12\x03\x13\x0b\x0f\n\x0e\n\x07\x04\x00\x03\x00\x02\x01\x03\x12\x03\x13\x12\x13b\x06proto3\n\xa6\x1d\n!snix/castore/protos/castore.proto\x12\x0fsnix.castore.v1\"\xbb\x01\n\tDirectory\x12A\n\x0bdirectories\x18\x01 \x03(\x0b2\x1f.snix.castore.v1.DirectoryEntryR\x0bdirectories\x120\n\x05files\x18\x02 \x03(\x0b2\x1a.snix.castore.v1.FileEntryR\x05files\x129\n\x08symlinks\x18\x03 \x03(\x0b2\x1d.snix.castore.v1.SymlinkEntryR\x08symlinks\"P\n\x0eDirectoryEntry\x12\x12\n\x04name\x18\x01 \x01(\x0cR\x04name\x12\x16\n\x06digest\x18\x02 \x01(\x0cR\x06digest\x12\x12\n\x04size\x18\x03 \x01(\x04R\x04size\"k\n\tFileEntry\x12\x12\n\x04name\x18\x01 \x01(\x0cR\x04name\x12\x16\n\x06digest\x18\x02 \x01(\x0cR\x06digest\x12\x12\n\x04size\x18\x03 \x01(\x04R\x04size\x12\x1e\n\nexecutable\x18\x04 \x01(\x08R\nexecutable\":\n\x0cSymlinkEntry\x12\x12\n\x04name\x18\x01 \x01(\x0cR\x04name\x12\x16\n\x06target\x18\x02 \x01(\x0cR\x06target\"\xbe\x01\n\x05Entry\x12?\n\tdirectory\x18\x01 \x01(\x0b2\x1f.snix.castore.v1.DirectoryEntryH\x00R\tdirectory\x120\n\x04file\x18\x02 \x01(\x0b2\x1a.snix.castore.v1.FileEntryH\x00R\x04file\x129\n\x07symlink\x18\x03 \x01(\x0b2\x1d.snix.castore.v1.SymlinkEntryH\x00R\x07symlinkB\x07\n\x05entryB\"Z snix.dev/castore/proto;castorev1J\xc9\x17\n\x06\x12\x04\x04\x00K\x01\n\x9d\x01\n\x01\x0c\x12\x03\x04\x00\x122\x92\x01 SPDX-FileCopyrightText: edef <edef@unfathomable.blue>\n SPDX-License-Identifier: OSL-3.0 OR MIT OR Apache-2.0\n Copyright \xc2\xa9 2025 The Snix Project\n\n\x08\n\x01\x02\x12\x03\x06\x00\x18\n\x08\n\x01\x08\x12\x03\x08\x007\n\t\n\x02\x08\x0b\x12\x03\x08\x007\n\x9c\x03\n\x02\x04\x00\x12\x04\x13\x00\x17\x01\x1a\x8f\x03 A Directory can contain Directory, File or Symlink entries.\n Each of these nodes have a name attribute, which is the basename in that\n directory and node type specific attributes.\n The name attribute:\n - MUST not contain slashes or null bytes\n - MUST not be \'.\' or \'..\'\n - MUST be unique across all three lists\n Elements in each list need to be lexicographically ordered by the name\n attribute.\n\n\n\n\x03\x04\x00\x01\x12\x03\x13\x08\x11\n\x0b\n\x04\x04\x00\x02\x00\x12\x03\x14\x02*\n\x0c\n\x05\x04\x00\x02\x00\x04\x12\x03\x14\x02\n\n\x0c\n\x05\x04\x00\x02\x00\x06\x12\x03\x14\x0b\x19\n\x0c\n\x05\x04\x00\x02\x00\x01\x12\x03\x14\x1a%\n\x0c\n\x05\x04\x00\x02\x00\x03\x12\x03\x14()\n\x0b\n\x04\x04\x00\x02\x01\x12\x03\x15\x02\x1f\n\x0c\n\x05\x04\x00\x02\x01\x04\x12\x03\x15\x02\n\n\x0c\n\x05\x04\x00\x02\x01\x06\x12\x03\x15\x0b\x14\n\x0c\n\x05\x04\x00\x02\x01\x01\x12\x03\x15\x15\x1a\n\x0c\n\x05\x04\x00\x02\x01\x03\x12\x03\x15\x1d\x1e\n\x0b\n\x04\x04\x00\x02\x02\x12\x03\x16\x02%\n\x0c\n\x05\x04\x00\x02\x02\x04\x12\x03\x16\x02\n\n\x0c\n\x05\x04\x00\x02\x02\x06\x12\x03\x16\x0b\x17\n\x0c\n\x05\x04\x00\x02\x02\x01\x12\x03\x16\x18 \n\x0c\n\x05\x04\x00\x02\x02\x03\x12\x03\x16#$\n6\n\x02\x04\x01\x12\x04\x1a\x00.\x01\x1a* A DirectoryEntry represents a directory.\n\n\n\n\x03\x04\x01\x01\x12\x03\x1a\x08\x16\n.\n\x04\x04\x01\x02\x00\x12\x03\x1c\x02\x11\x1a! The (base)name of the directory\n\n\x0c\n\x05\x04\x01\x02\x00\x05\x12\x03\x1c\x02\x07\n\x0c\n\x05\x04\x01\x02\x00\x01\x12\x03\x1c\x08\x0c\n\x0c\n\x05\x04\x01\x02\x00\x03\x12\x03\x1c\x0f\x10\n8\n\x04\x04\x01\x02\x01\x12\x03\x1e\x02\x13\x1a+ The blake3 digest of a Directory message.\n\n\x0c\n\x05\x04\x01\x02\x01\x05\x12\x03\x1e\x02\x07\n\x0c\n\x05\x04\x01\x02\x01\x01\x12\x03\x1e\x08\x0e\n\x0c\n\x05\x04\x01\x02\x01\x03\x12\x03\x1e\x11\x12\n\x9c\x07\n\x04\x04\x01\x02\x02\x12\x03-\x02\x12\x1a\x8e\x07 Number of child elements in the Directory referred to by `digest`.\n Child directory elements are calculated by summing up the numbers of\n `directories`, `files` and `symlinks`, and for each directory, its size field.\n Can be used for inode number calculation.\n This field is precisely as verifiable as any other Merkle tree edge.\n Resolve `digest`, and you can compute it incrementally. Resolve the entire\n tree, and you can fully compute it from scratch.\n A credulous implementation won\'t reject an excessive size, but this is\n harmless: you\'ll have some ordinals without nodes. Undersizing is obvious\n and easy to reject: you won\'t have an ordinal for some nodes.\n Historically there were implementations which calculated up to\n `(2*number of elements) + (sizes of each directory element)`,\n so implementations verifying this field should accept up to this\n if they still expect data produced by this code.\n\n\x0c\n\x05\x04\x01\x02\x02\x05\x12\x03-\x02\x08\n\x0c\n\x05\x04\x01\x02\x02\x01\x12\x03-\t\r\n\x0c\n\x05\x04\x01\x02\x02\x03\x12\x03-\x10\x11\nB\n\x02\x04\x02\x12\x041\x00:\x01\x1a6 A FileEntry represents a regular or executable file.\n\n\n\n\x03\x04\x02\x01\x12\x031\x08\x11\n)\n\x04\x04\x02\x02\x00\x12\x033\x02\x11\x1a\x1c The (base)name of the file\n\n\x0c\n\x05\x04\x02\x02\x00\x05\x12\x033\x02\x07\n\x0c\n\x05\x04\x02\x02\x00\x01\x12\x033\x08\x0c\n\x0c\n\x05\x04\x02\x02\x00\x03\x12\x033\x0f\x10\n5\n\x04\x04\x02\x02\x01\x12\x035\x02\x13\x1a( The blake3 digest of the file contents\n\n\x0c\n\x05\x04\x02\x02\x01\x05\x12\x035\x02\x07\n\x0c\n\x05\x04\x02\x02\x01\x01\x12\x035\x08\x0e\n\x0c\n\x05\x04\x02\x02\x01\x03\x12\x035\x11\x12\n$\n\x04\x04\x02\x02\x02\x12\x037\x02\x12\x1a\x17 The file content size\n\n\x0c\n\x05\x04\x02\x02\x02\x05\x12\x037\x02\x08\n\x0c\n\x05\x04\x02\x02\x02\x01\x12\x037\t\r\n\x0c\n\x05\x04\x02\x02\x02\x03\x12\x037\x10\x11\n-\n\x04\x04\x02\x02\x03\x12\x039\x02\x16\x1a Whether the file is executable\n\n\x0c\n\x05\x04\x02\x02\x03\x05\x12\x039\x02\x06\n\x0c\n\x05\x04\x02\x02\x03\x01\x12\x039\x07\x11\n\x0c\n\x05\x04\x02\x02\x03\x03\x12\x039\x14\x15\n8\n\x02\x04\x03\x12\x04=\x00B\x01\x1a, A SymlinkEntry represents a symbolic link.\n\n\n\n\x03\x04\x03\x01\x12\x03=\x08\x14\n,\n\x04\x04\x03\x02\x00\x12\x03?\x02\x11\x1a\x1f The (base)name of the symlink\n\n\x0c\n\x05\x04\x03\x02\x00\x05\x12\x03?\x02\x07\n\x0c\n\x05\x04\x03\x02\x00\x01\x12\x03?\x08\x0c\n\x0c\n\x05\x04\x03\x02\x00\x03\x12\x03?\x0f\x10\n)\n\x04\x04\x03\x02\x01\x12\x03A\x02\x13\x1a\x1c The target of the symlink.\n\n\x0c\n\x05\x04\x03\x02\x01\x05\x12\x03A\x02\x07\n\x0c\n\x05\x04\x03\x02\x01\x01\x12\x03A\x08\x0e\n\x0c\n\x05\x04\x03\x02\x01\x03\x12\x03A\x11\x12\nL\n\x02\x04\x04\x12\x04E\x00K\x01\x1a@ A Entry is either a DirectoryEntry, FileEntry or SymlinkEntry.\n\n\n\n\x03\x04\x04\x01\x12\x03E\x08\r\n\x0c\n\x04\x04\x04\x08\x00\x12\x04F\x02J\x03\n\x0c\n\x05\x04\x04\x08\x00\x01\x12\x03F\x08\r\n\x0b\n\x04\x04\x04\x02\x00\x12\x03G\x04!\n\x0c\n\x05\x04\x04\x02\x00\x06\x12\x03G\x04\x12\n\x0c\n\x05\x04\x04\x02\x00\x01\x12\x03G\x13\x1c\n\x0c\n\x05\x04\x04\x02\x00\x03\x12\x03G\x1f \n\x0b\n\x04\x04\x04\x02\x01\x12\x03H\x04\x17\n\x0c\n\x05\x04\x04\x02\x01\x06\x12\x03H\x04\r\n\x0c\n\x05\x04\x04\x02\x01\x01\x12\x03H\x0e\x12\n\x0c\n\x05\x04\x04\x02\x01\x03\x12\x03H\x15\x16\n\x0b\n\x04\x04\x04\x02\x02\x12\x03I\x04\x1d\n\x0c\n\x05\x04\x04\x02\x02\x06\x12\x03I\x04\x10\n\x0c\n\x05\x04\x04\x02\x02\x01\x12\x03I\x11\x18\n\x0c\n\x05\x04\x04\x02\x02\x03\x12\x03I\x1b\x1cb\x06proto3\n\xd8\x0f\n\'snix/castore/protos/rpc_blobstore.proto\x12\x0fsnix.castore.v1\x1a#snix/castore/protos/blobstore.proto\")\n\x0fStatBlobRequest\x12\x16\n\x06digest\x18\x01 \x01(\x0cR\x06digest\"\x12\n\x10StatBlobResponse\"(\n\x0eGetBlobRequest\x12\x16\n\x06digest\x18\x01 \x01(\x0cR\x06digest\"I\n\x0fGetBlobResponse\x126\n\tblob_meta\x18\x01 \x01(\x0b2\x19.snix.castore.v1.BlobMetaR\x08blobMeta\"`\n\x0ePutBlobRequest\x12\x16\n\x06digest\x18\x01 \x01(\x0cR\x06digest\x126\n\tblob_meta\x18\x02 \x01(\x0b2\x19.snix.castore.v1.BlobMetaR\x08blobMeta\"\x11\n\x0fPutBlobResponse2\xff\x01\n\x10BlobStoreService\x12O\n\x08StatBlob\x12 .snix.castore.v1.StatBlobRequest\x1a!.snix.castore.v1.StatBlobResponse\x12L\n\x07GetBlob\x12\x1f.snix.castore.v1.GetBlobRequest\x1a .snix.castore.v1.GetBlobResponse\x12L\n\x07PutBlob\x12\x1f.snix.castore.v1.PutBlobRequest\x1a .snix.castore.v1.PutBlobResponseB\"Z snix.dev/castore/proto;castorev1J\x9f\n\n\x06\x12\x04\x02\x002\x1a\nL\n\x01\x0c\x12\x03\x02\x00\x12\x1aB SPDX-License-Identifier: MIT\n Copyright \xc2\xa9 2026 The Snix Project\n\n\x08\n\x01\x02\x12\x03\x04\x00\x18\n\t\n\x02\x03\x00\x12\x03\x06\x00-\n\x08\n\x01\x08\x12\x03\x08\x007\n\t\n\x02\x08\x0b\x12\x03\x08\x007\n\x93\x02\n\x02\x06\x00\x12\x04\x0f\x00\x18\x01\x1a\x86\x02 BlobStoreService retrieves and stores metadata about blobs.\n Blobs can consist of multiple chunks.\n The stored metadata describes which chunks need to be assembled\n to produce the entire blob contents.\n Blobs are keyed by the BLAKE3 digest of their entire data\n\n\n\n\x03\x06\x00\x01\x12\x03\x0f\x08\x18\nC\n\x04\x06\x00\x02\x00\x12\x03\x11\x02;\x1a6 Stat checks if a [BlobMeta] for a given blob exists.\n\n\x0c\n\x05\x06\x00\x02\x00\x01\x12\x03\x11\x06\x0e\n\x0c\n\x05\x06\x00\x02\x00\x02\x12\x03\x11\x0f\x1e\n\x0c\n\x05\x06\x00\x02\x00\x03\x12\x03\x11)9\nB\n\x04\x06\x00\x02\x01\x12\x03\x14\x028\x1a5 Get retrieves a [BlobMeta] for a given blob digest.\n\n\x0c\n\x05\x06\x00\x02\x01\x01\x12\x03\x14\x06\r\n\x0c\n\x05\x06\x00\x02\x01\x02\x12\x03\x14\x0e\x1c\n\x0c\n\x05\x06\x00\x02\x01\x03\x12\x03\x14\'6\nC\n\x04\x06\x00\x02\x02\x12\x03\x17\x028\x1a6 Put persists a [BlobMeta] for the given blob digest.\n\n\x0c\n\x05\x06\x00\x02\x02\x01\x12\x03\x17\x06\r\n\x0c\n\x05\x06\x00\x02\x02\x02\x12\x03\x17\x0e\x1c\n\x0c\n\x05\x06\x00\x02\x02\x03\x12\x03\x17\'6\n\n\n\x02\x04\x00\x12\x04\x1a\x00\x1d\x01\n\n\n\x03\x04\x00\x01\x12\x03\x1a\x08\x17\n6\n\x04\x04\x00\x02\x00\x12\x03\x1c\x02\x13\x1a) The blake3 digest of the blob requested\n\n\x0c\n\x05\x04\x00\x02\x00\x05\x12\x03\x1c\x02\x07\n\x0c\n\x05\x04\x00\x02\x00\x01\x12\x03\x1c\x08\x0e\n\x0c\n\x05\x04\x00\x02\x00\x03\x12\x03\x1c\x11\x12\n\t\n\x02\x04\x01\x12\x03\x1f\x00\x1b\n\n\n\x03\x04\x01\x01\x12\x03\x1f\x08\x18\n\n\n\x02\x04\x02\x12\x04!\x00$\x01\n\n\n\x03\x04\x02\x01\x12\x03!\x08\x16\n6\n\x04\x04\x02\x02\x00\x12\x03#\x02\x13\x1a) The blake3 digest of the blob requested\n\n\x0c\n\x05\x04\x02\x02\x00\x05\x12\x03#\x02\x07\n\x0c\n\x05\x04\x02\x02\x00\x01\x12\x03#\x08\x0e\n\x0c\n\x05\x04\x02\x02\x00\x03\x12\x03#\x11\x12\n\n\n\x02\x04\x03\x12\x04&\x00(\x01\n\n\n\x03\x04\x03\x01\x12\x03&\x08\x17\n\x0b\n\x04\x04\x03\x02\x00\x12\x03\'\x02\x19\n\x0c\n\x05\x04\x03\x02\x00\x06\x12\x03\'\x02\n\n\x0c\n\x05\x04\x03\x02\x00\x01\x12\x03\'\x0b\x14\n\x0c\n\x05\x04\x03\x02\x00\x03\x12\x03\'\x17\x18\n\n\n\x02\x04\x04\x12\x04*\x000\x01\n\n\n\x03\x04\x04\x01\x12\x03*\x08\x16\n5\n\x04\x04\x04\x02\x00\x12\x03,\x02\x13\x1a( The blake3 digest of the blob uploaded\n\n\x0c\n\x05\x04\x04\x02\x00\x05\x12\x03,\x02\x07\n\x0c\n\x05\x04\x04\x02\x00\x01\x12\x03,\x08\x0e\n\x0c\n\x05\x04\x04\x02\x00\x03\x12\x03,\x11\x12\n\x1b\n\x04\x04\x04\x02\x01\x12\x03/\x02\x19\x1a\x0e Its BlobMeta\n\n\x0c\n\x05\x04\x04\x02\x01\x06\x12\x03/\x02\n\n\x0c\n\x05\x04\x04\x02\x01\x01\x12\x03/\x0b\x14\n\x0c\n\x05\x04\x04\x02\x01\x03\x12\x03/\x17\x18\n\t\n\x02\x04\x05\x12\x032\x00\x1a\n\n\n\x03\x04\x05\x01\x12\x032\x08\x17b\x06proto3\n\xd4\x12\n(snix/castore/protos/rpc_chunkstore.proto\x12\x0fsnix.castore.v1\"*\n\x10StatChunkRequest\x12\x16\n\x06digest\x18\x01 \x01(\x0cR\x06digest\"\x13\n\x11StatChunkResponse\")\n\x0fGetChunkRequest\x12\x16\n\x06digest\x18\x01 \x01(\x0cR\x06digest\"&\n\x10GetChunkResponse\x12\x12\n\x04data\x18\x01 \x01(\x0cR\x04data\"%\n\x0fPutChunkRequest\x12\x12\n\x04data\x18\x01 \x01(\x0cR\x04data\"*\n\x10PutChunkResponse\x12\x16\n\x06digest\x18\x01 \x01(\x0cR\x06digest2\x8d\x02\n\x11ChunkStoreService\x12R\n\tStatChunk\x12!.snix.castore.v1.StatChunkRequest\x1a\".snix.castore.v1.StatChunkResponse\x12Q\n\x08GetChunk\x12 .snix.castore.v1.GetChunkRequest\x1a!.snix.castore.v1.GetChunkResponse0\x01\x12Q\n\x08PutChunk\x12 .snix.castore.v1.PutChunkRequest\x1a!.snix.castore.v1.PutChunkResponse(\x01B\"Z snix.dev/castore/proto;castorev1J\xf3\r\n\x06\x12\x04\x02\x007\x01\nL\n\x01\x0c\x12\x03\x02\x00\x12\x1aB SPDX-License-Identifier: MIT\n Copyright \xc2\xa9 2026 The Snix Project\n\n\x08\n\x01\x02\x12\x03\x04\x00\x18\n\x08\n\x01\x08\x12\x03\x06\x007\n\t\n\x02\x08\x0b\x12\x03\x06\x007\n\xbd\x03\n\x02\x06\x00\x12\x04\x0f\x00\x1c\x01\x1a\xb0\x03 ChunkStoreService allows reading (or uploading) content-addressed chunks of raw data.\n BLAKE3 is used as a hashing function for the data. Uploading a blob will\n return the BLAKE3 digest of it, and that\'s the identifier used to Read/Stat\n them too.\n Chunks are considered small enough to not require any further chunking,\n but may be broken down into smaller messages when sent as proto messages,\n due to message size restrictions.\n\n\n\n\x03\x06\x00\x01\x12\x03\x0f\x08\x19\nF\n\x04\x06\x00\x02\x00\x12\x03\x11\x02>\x1a9 Stat can be used to check for the existence of a chunk.\n\n\x0c\n\x05\x06\x00\x02\x00\x01\x12\x03\x11\x06\x0f\n\x0c\n\x05\x06\x00\x02\x00\x02\x12\x03\x11\x10 \n\x0c\n\x05\x06\x00\x02\x00\x03\x12\x03\x11+<\n\xbc\x01\n\x04\x06\x00\x02\x01\x12\x03\x16\x02B\x1a\xae\x01 Get can be used to retrieve a chunk.\n The server may break down the response into a stream of smaller messages,\n to keep proto messages smaller than its maximum chunk size.\n\n\x0c\n\x05\x06\x00\x02\x01\x01\x12\x03\x16\x06\x0e\n\x0c\n\x05\x06\x00\x02\x01\x02\x12\x03\x16\x0f\x1e\n\x0c\n\x05\x06\x00\x02\x01\x06\x12\x03\x16)/\n\x0c\n\x05\x06\x00\x02\x01\x03\x12\x03\x160@\n\xbf\x01\n\x04\x06\x00\x02\x02\x12\x03\x1b\x02B\x1a\xb1\x01 PutChunk can be used to upload a chunk.\n The client may break down the response into a stream of smaller messages,\n to keep proto messages smaller than its maximum chunk size.\n\n\x0c\n\x05\x06\x00\x02\x02\x01\x12\x03\x1b\x06\x0e\n\x0c\n\x05\x06\x00\x02\x02\x05\x12\x03\x1b\x0f\x15\n\x0c\n\x05\x06\x00\x02\x02\x02\x12\x03\x1b\x16%\n\x0c\n\x05\x06\x00\x02\x02\x03\x12\x03\x1b0@\n\n\n\x02\x04\x00\x12\x04\x1e\x00!\x01\n\n\n\x03\x04\x00\x01\x12\x03\x1e\x08\x18\n7\n\x04\x04\x00\x02\x00\x12\x03 \x02\x13\x1a* The blake3 digest of the chunk requested\n\n\x0c\n\x05\x04\x00\x02\x00\x05\x12\x03 \x02\x07\n\x0c\n\x05\x04\x00\x02\x00\x01\x12\x03 \x08\x0e\n\x0c\n\x05\x04\x00\x02\x00\x03\x12\x03 \x11\x12\n\t\n\x02\x04\x01\x12\x03#\x00\x1c\n\n\n\x03\x04\x01\x01\x12\x03#\x08\x19\n\n\n\x02\x04\x02\x12\x04%\x00(\x01\n\n\n\x03\x04\x02\x01\x12\x03%\x08\x17\n7\n\x04\x04\x02\x02\x00\x12\x03\'\x02\x13\x1a* The blake3 digest of the chunk requested\n\n\x0c\n\x05\x04\x02\x02\x00\x05\x12\x03\'\x02\x07\n\x0c\n\x05\x04\x02\x02\x00\x01\x12\x03\'\x08\x0e\n\x0c\n\x05\x04\x02\x02\x00\x03\x12\x03\'\x11\x12\n\n\n\x02\x04\x03\x12\x04*\x00-\x01\n\n\n\x03\x04\x03\x01\x12\x03*\x08\x18\n \n\x04\x04\x03\x02\x00\x12\x03,\x02\x11\x1a\x13 Raw chunk payload\n\n\x0c\n\x05\x04\x03\x02\x00\x05\x12\x03,\x02\x07\n\x0c\n\x05\x04\x03\x02\x00\x01\x12\x03,\x08\x0c\n\x0c\n\x05\x04\x03\x02\x00\x03\x12\x03,\x0f\x10\n\n\n\x02\x04\x04\x12\x04/\x002\x01\n\n\n\x03\x04\x04\x01\x12\x03/\x08\x17\n \n\x04\x04\x04\x02\x00\x12\x031\x02\x11\x1a\x13 Raw chunk payload\n\n\x0c\n\x05\x04\x04\x02\x00\x05\x12\x031\x02\x07\n\x0c\n\x05\x04\x04\x02\x00\x01\x12\x031\x08\x0c\n\x0c\n\x05\x04\x04\x02\x00\x03\x12\x031\x0f\x10\n\n\n\x02\x04\x05\x12\x044\x007\x01\n\n\n\x03\x04\x05\x01\x12\x034\x08\x18\n6\n\x04\x04\x05\x02\x00\x12\x036\x02\x13\x1a) The blake3 digest of the chunk received\n\n\x0c\n\x05\x04\x05\x02\x00\x05\x12\x036\x02\x07\n\x0c\n\x05\x04\x05\x02\x00\x01\x12\x036\x08\x0e\n\x0c\n\x05\x04\x05\x02\x00\x03\x12\x036\x11\x12b\x06proto3\n\x91\x14\n\'snix/castore/protos/rpc_directory.proto\x12\x0fsnix.castore.v1\x1a!snix/castore/protos/castore.proto\"X\n\x13GetDirectoryRequest\x12\x18\n\x06digest\x18\x01 \x01(\x0cH\x00R\x06digest\x12\x1c\n\trecursive\x18\x02 \x01(\x08R\trecursiveB\t\n\x07by_what\"7\n\x14PutDirectoryResponse\x12\x1f\n\x0broot_digest\x18\x01 \x01(\x0cR\nrootDigest2\xa9\x01\n\x10DirectoryService\x12I\n\x03Get\x12$.snix.castore.v1.GetDirectoryRequest\x1a\x1a.snix.castore.v1.Directory0\x01\x12J\n\x03Put\x12\x1a.snix.castore.v1.Directory\x1a%.snix.castore.v1.PutDirectoryResponse(\x01B\"Z snix.dev/castore/proto;castorev1J\xc6\x10\n\x06\x12\x04\x03\x005\x01\np\n\x01\x0c\x12\x03\x03\x00\x12\x1af SPDX-License-Identifier: MIT\n Copyright \xc2\xa9 2022 The Tvix Authors\n Copyright \xc2\xa9 2025 The Snix Project\n\n\x08\n\x01\x02\x12\x03\x05\x00\x18\n\t\n\x02\x03\x00\x12\x03\x07\x00+\n\x08\n\x01\x08\x12\x03\t\x007\n\t\n\x02\x08\x0b\x12\x03\t\x007\n\n\n\x02\x06\x00\x12\x04\x0b\x00\"\x01\n\n\n\x03\x06\x00\x01\x12\x03\x0b\x08\x18\n\xa5\x04\n\x04\x06\x00\x02\x00\x12\x03\x16\x02:\x1a\x97\x04 Get retrieves a stream of Directory messages, by using the lookup\n parameters in GetDirectoryRequest.\n Keep in mind multiple DirectoryNodes in different parts of the graph might\n have the same digest if they have the same underlying contents,\n so sending subsequent ones can be omitted.\n\n It is okay for certain implementations to only allow retrieval of\n Directory digests that are at the \"root\", aka the last element that\'s\n sent in a Put. This makes sense for implementations bundling closures of\n directories together in batches.\n\n\x0c\n\x05\x06\x00\x02\x00\x01\x12\x03\x16\x06\t\n\x0c\n\x05\x06\x00\x02\x00\x02\x12\x03\x16\n\x1d\n\x0c\n\x05\x06\x00\x02\x00\x06\x12\x03\x16(.\n\x0c\n\x05\x06\x00\x02\x00\x03\x12\x03\x16/8\n\xc8\x04\n\x04\x06\x00\x02\x01\x12\x03!\x02;\x1a\xba\x04 Put uploads a graph of Directory messages.\n Individual Directory messages need to be send in an order walking up\n from the leaves to the root - a Directory message can only refer to\n Directory messages previously sent in the same stream.\n Keep in mind multiple DirectoryNodes in different parts of the graph might\n have the same digest if they have the same underlying contents,\n so sending subsequent ones can be omitted.\n We might add a separate method, allowing to send partial graphs at a later\n time, if requiring to send the full graph turns out to be a problem.\n\n\x0c\n\x05\x06\x00\x02\x01\x01\x12\x03!\x06\t\n\x0c\n\x05\x06\x00\x02\x01\x05\x12\x03!\n\x10\n\x0c\n\x05\x06\x00\x02\x01\x02\x12\x03!\x11\x1a\n\x0c\n\x05\x06\x00\x02\x01\x03\x12\x03!%9\n\n\n\x02\x04\x00\x12\x04$\x001\x01\n\n\n\x03\x04\x00\x01\x12\x03$\x08\x1b\n\x0c\n\x04\x04\x00\x08\x00\x12\x04%\x02*\x03\n\x0c\n\x05\x04\x00\x08\x00\x01\x12\x03%\x08\x0f\n\x9d\x01\n\x04\x04\x00\x02\x00\x12\x03)\x04\x15\x1a\x8f\x01 The blake3 hash of the (root) Directory message, serialized in\n protobuf canonical form.\n Keep in mind this can be a subtree of another root.\n\n\x0c\n\x05\x04\x00\x02\x00\x05\x12\x03)\x04\t\n\x0c\n\x05\x04\x00\x02\x00\x01\x12\x03)\n\x10\n\x0c\n\x05\x04\x00\x02\x00\x03\x12\x03)\x13\x14\n\xad\x02\n\x04\x04\x00\x02\x01\x12\x030\x02\x15\x1a\x9f\x02 If set to true, recursively resolve all child Directory messages.\n Directory messages SHOULD be streamed in a recursive breadth-first walk,\n but other orders are also fine, as long as Directory messages are only\n sent after they are referred to from previously sent Directory messages.\n\n\x0c\n\x05\x04\x00\x02\x01\x05\x12\x030\x02\x06\n\x0c\n\x05\x04\x00\x02\x01\x01\x12\x030\x07\x10\n\x0c\n\x05\x04\x00\x02\x01\x03\x12\x030\x13\x14\n\n\n\x02\x04\x01\x12\x043\x005\x01\n\n\n\x03\x04\x01\x01\x12\x033\x08\x1c\n\x0b\n\x04\x04\x01\x02\x00\x12\x034\x02\x18\n\x0c\n\x05\x04\x01\x02\x00\x05\x12\x034\x02\x07\n\x0c\n\x05\x04\x01\x02\x00\x01\x12\x034\x08\x13\n\x0c\n\x05\x04\x01\x02\x00\x03\x12\x034\x16\x17b\x06proto3";Expand description
Compiled file descriptors for implementing gRPC
reflection with e.g.
tonic_reflection.