Constant tvix_castore::proto::FILE_DESCRIPTOR_SET

pub const FILE_DESCRIPTOR_SET: &[u8] = b"\n\xad\x1b\n!tvix/castore/protos/castore.proto\x12\x0ftvix.castore.v1\"\xb8\x01\n\tDirectory\x12@\n\x0bdirectories\x18\x01 \x03(\x0b2\x1e.tvix.castore.v1.DirectoryNodeR\x0bdirectories\x12/\n\x05files\x18\x02 \x03(\x0b2\x19.tvix.castore.v1.FileNodeR\x05files\x128\n\x08symlinks\x18\x03 \x03(\x0b2\x1c.tvix.castore.v1.SymlinkNodeR\x08symlinks\"O\n\rDirectoryNode\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\"j\n\x08FileNode\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\"9\n\x0bSymlinkNode\x12\x12\n\x04name\x18\x01 \x01(\x0cR\x04name\x12\x16\n\x06target\x18\x02 \x01(\x0cR\x06target\"\xb9\x01\n\x04Node\x12>\n\tdirectory\x18\x01 \x01(\x0b2\x1e.tvix.castore.v1.DirectoryNodeH\x00R\tdirectory\x12/\n\x04file\x18\x02 \x01(\x0b2\x19.tvix.castore.v1.FileNodeH\x00R\x04file\x128\n\x07symlink\x18\x03 \x01(\x0b2\x1c.tvix.castore.v1.SymlinkNodeH\x00R\x07symlinkB\x06\n\x04nodeB(Z&code.tvl.fyi/tvix/castore-go;castorev1J\xd5\x15\n\x06\x12\x04\x03\x00F\x01\nx\n\x01\x0c\x12\x03\x03\x00\x122n SPDX-FileCopyrightText: edef <edef@unfathomable.blue>\n SPDX-License-Identifier: OSL-3.0 OR MIT OR Apache-2.0\n\n\x08\n\x01\x02\x12\x03\x05\x00\x18\n\x08\n\x01\x08\x12\x03\x07\x00=\n\t\n\x02\x08\x0b\x12\x03\x07\x00=\n\x9a\x03\n\x02\x04\x00\x12\x04\x12\x00\x16\x01\x1a\x8d\x03 A Directory can contain Directory, File or Symlink nodes.\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\x12\x08\x11\n\x0b\n\x04\x04\x00\x02\x00\x12\x03\x13\x02)\n\x0c\n\x05\x04\x00\x02\x00\x04\x12\x03\x13\x02\n\n\x0c\n\x05\x04\x00\x02\x00\x06\x12\x03\x13\x0b\x18\n\x0c\n\x05\x04\x00\x02\x00\x01\x12\x03\x13\x19$\n\x0c\n\x05\x04\x00\x02\x00\x03\x12\x03\x13\'(\n\x0b\n\x04\x04\x00\x02\x01\x12\x03\x14\x02\x1e\n\x0c\n\x05\x04\x00\x02\x01\x04\x12\x03\x14\x02\n\n\x0c\n\x05\x04\x00\x02\x01\x06\x12\x03\x14\x0b\x13\n\x0c\n\x05\x04\x00\x02\x01\x01\x12\x03\x14\x14\x19\n\x0c\n\x05\x04\x00\x02\x01\x03\x12\x03\x14\x1c\x1d\n\x0b\n\x04\x04\x00\x02\x02\x12\x03\x15\x02$\n\x0c\n\x05\x04\x00\x02\x02\x04\x12\x03\x15\x02\n\n\x0c\n\x05\x04\x00\x02\x02\x06\x12\x03\x15\x0b\x16\n\x0c\n\x05\x04\x00\x02\x02\x01\x12\x03\x15\x17\x1f\n\x0c\n\x05\x04\x00\x02\x02\x03\x12\x03\x15\"#\nD\n\x02\x04\x01\x12\x04\x19\x00)\x01\x1a8 A DirectoryNode represents a directory in a Directory.\n\n\n\n\x03\x04\x01\x01\x12\x03\x19\x08\x15\n.\n\x04\x04\x01\x02\x00\x12\x03\x1b\x02\x11\x1a! The (base)name of the directory\n\n\x0c\n\x05\x04\x01\x02\x00\x05\x12\x03\x1b\x02\x07\n\x0c\n\x05\x04\x01\x02\x00\x01\x12\x03\x1b\x08\x0c\n\x0c\n\x05\x04\x01\x02\x00\x03\x12\x03\x1b\x0f\x10\n]\n\x04\x04\x01\x02\x01\x12\x03\x1d\x02\x13\x1aP The blake3 hash of a Directory message, serialized in protobuf canonical form.\n\n\x0c\n\x05\x04\x01\x02\x01\x05\x12\x03\x1d\x02\x07\n\x0c\n\x05\x04\x01\x02\x01\x01\x12\x03\x1d\x08\x0e\n\x0c\n\x05\x04\x01\x02\x01\x03\x12\x03\x1d\x11\x12\n\x85\x05\n\x04\x04\x01\x02\x02\x12\x03(\x02\x12\x1a\xf7\x04 Number of child elements in the Directory referred to by `digest`.\n Calculated by summing up the numbers of `directories`, `files` and\n `symlinks`, and for each directory, its size field. Used for inode number\n 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\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\nP\n\x02\x04\x02\x12\x04,\x005\x01\x1aD A FileNode represents a regular or executable file in a Directory.\n\n\n\n\x03\x04\x02\x01\x12\x03,\x08\x10\n)\n\x04\x04\x02\x02\x00\x12\x03.\x02\x11\x1a\x1c The (base)name of the file\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\x0c\n\x0c\n\x05\x04\x02\x02\x00\x03\x12\x03.\x0f\x10\n5\n\x04\x04\x02\x02\x01\x12\x030\x02\x13\x1a( The blake3 digest of the file contents\n\n\x0c\n\x05\x04\x02\x02\x01\x05\x12\x030\x02\x07\n\x0c\n\x05\x04\x02\x02\x01\x01\x12\x030\x08\x0e\n\x0c\n\x05\x04\x02\x02\x01\x03\x12\x030\x11\x12\n$\n\x04\x04\x02\x02\x02\x12\x032\x02\x12\x1a\x17 The file content size\n\n\x0c\n\x05\x04\x02\x02\x02\x05\x12\x032\x02\x08\n\x0c\n\x05\x04\x02\x02\x02\x01\x12\x032\t\r\n\x0c\n\x05\x04\x02\x02\x02\x03\x12\x032\x10\x11\n-\n\x04\x04\x02\x02\x03\x12\x034\x02\x16\x1a  Whether the file is executable\n\n\x0c\n\x05\x04\x02\x02\x03\x05\x12\x034\x02\x06\n\x0c\n\x05\x04\x02\x02\x03\x01\x12\x034\x07\x11\n\x0c\n\x05\x04\x02\x02\x03\x03\x12\x034\x14\x15\nF\n\x02\x04\x03\x12\x048\x00=\x01\x1a: A SymlinkNode represents a symbolic link in a Directory.\n\n\n\n\x03\x04\x03\x01\x12\x038\x08\x13\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\x03<\x02\x13\x1a\x1c The target of the symlink.\n\n\x0c\n\x05\x04\x03\x02\x01\x05\x12\x03<\x02\x07\n\x0c\n\x05\x04\x03\x02\x01\x01\x12\x03<\x08\x0e\n\x0c\n\x05\x04\x03\x02\x01\x03\x12\x03<\x11\x12\nH\n\x02\x04\x04\x12\x04@\x00F\x01\x1a< A Node is either a DirectoryNode, FileNode or SymlinkNode.\n\n\n\n\x03\x04\x04\x01\x12\x03@\x08\x0c\n\x0c\n\x04\x04\x04\x08\x00\x12\x04A\x02E\x03\n\x0c\n\x05\x04\x04\x08\x00\x01\x12\x03A\x08\x0c\n\x0b\n\x04\x04\x04\x02\x00\x12\x03B\x04 \n\x0c\n\x05\x04\x04\x02\x00\x06\x12\x03B\x04\x11\n\x0c\n\x05\x04\x04\x02\x00\x01\x12\x03B\x12\x1b\n\x0c\n\x05\x04\x04\x02\x00\x03\x12\x03B\x1e\x1f\n\x0b\n\x04\x04\x04\x02\x01\x12\x03C\x04\x16\n\x0c\n\x05\x04\x04\x02\x01\x06\x12\x03C\x04\x0c\n\x0c\n\x05\x04\x04\x02\x01\x01\x12\x03C\r\x11\n\x0c\n\x05\x04\x04\x02\x01\x03\x12\x03C\x14\x15\n\x0b\n\x04\x04\x04\x02\x02\x12\x03D\x04\x1c\n\x0c\n\x05\x04\x04\x02\x02\x06\x12\x03D\x04\x0f\n\x0c\n\x05\x04\x04\x02\x02\x01\x12\x03D\x10\x17\n\x0c\n\x05\x04\x04\x02\x02\x03\x12\x03D\x1a\x1bb\x06proto3\n\xdc\x1d\n\'tvix/castore/protos/rpc_blobstore.proto\x12\x0ftvix.castore.v1\"e\n\x0fStatBlobRequest\x12\x16\n\x06digest\x18\x01 \x01(\x0cR\x06digest\x12\x1f\n\x0bsend_chunks\x18\x02 \x01(\x08R\nsendChunks\x12\x19\n\x08send_bao\x18\x03 \x01(\x08R\x07sendBao\"\xa2\x01\n\x10StatBlobResponse\x12C\n\x06chunks\x18\x02 \x03(\x0b2+.tvix.castore.v1.StatBlobResponse.ChunkMetaR\x06chunks\x12\x10\n\x03bao\x18\x03 \x01(\x0cR\x03bao\x1a7\n\tChunkMeta\x12\x16\n\x06digest\x18\x01 \x01(\x0cR\x06digest\x12\x12\n\x04size\x18\x02 \x01(\x04R\x04size\")\n\x0fReadBlobRequest\x12\x16\n\x06digest\x18\x01 \x01(\x0cR\x06digest\"\x1f\n\tBlobChunk\x12\x12\n\x04data\x18\x01 \x01(\x0cR\x04data\")\n\x0fPutBlobResponse\x12\x16\n\x06digest\x18\x01 \x01(\x0cR\x06digest2\xe9\x01\n\x0bBlobService\x12K\n\x04Stat\x12 .tvix.castore.v1.StatBlobRequest\x1a!.tvix.castore.v1.StatBlobResponse\x12F\n\x04Read\x12 .tvix.castore.v1.ReadBlobRequest\x1a\x1a.tvix.castore.v1.BlobChunk0\x01\x12E\n\x03Put\x12\x1a.tvix.castore.v1.BlobChunk\x1a .tvix.castore.v1.PutBlobResponse(\x01B(Z&code.tvl.fyi/tvix/castore-go;castorev1J\xfe\x17\n\x06\x12\x04\x02\x00T\x01\nL\n\x01\x0c\x12\x03\x02\x00\x12\x1aB SPDX-License-Identifier: MIT\n Copyright \xc2\xa9 2022 The Tvix Authors\n\n\x08\n\x01\x02\x12\x03\x04\x00\x18\n\x08\n\x01\x08\x12\x03\x06\x00=\n\t\n\x02\x08\x0b\x12\x03\x06\x00=\n\xfb\x01\n\x02\x06\x00\x12\x04\x0c\x00&\x01\x1a\xee\x01 BlobService allows reading (or uploading) content-addressed blobs of 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\n\n\n\x03\x06\x00\x01\x12\x03\x0c\x08\x13\n\xd2\x02\n\x04\x06\x00\x02\x00\x12\x03\x13\x027\x1a\xc4\x02 Stat can be used to check for the existence of a blob, as well as\n gathering more data about it, like more granular chunking information\n or baos.\n Server implementations are not required to provide more granular chunking\n information, especially if the digest specified in `StatBlobRequest` is\n already a chunk of a blob.\n\n\x0c\n\x05\x06\x00\x02\x00\x01\x12\x03\x13\x06\n\n\x0c\n\x05\x06\x00\x02\x00\x02\x12\x03\x13\x0b\x1a\n\x0c\n\x05\x06\x00\x02\x00\x03\x12\x03\x13%5\n\xf7\x03\n\x04\x06\x00\x02\x01\x12\x03\x1e\x027\x1a\xe9\x03 Read allows reading (all) data of a blob/chunk by the BLAKE3 digest of\n its contents.\n If the backend communicated more granular chunks in the `Stat` request,\n this can also be used to read chunks.\n This request returns a stream of BlobChunk, which is just a container for\n a stream of bytes.\n The server may decide on whatever chunking it may seem fit as a size for\n the individual BlobChunk sent in the response stream, this is mostly to\n keep individual messages at a manageable size.\n\n\x0c\n\x05\x06\x00\x02\x01\x01\x12\x03\x1e\x06\n\n\x0c\n\x05\x06\x00\x02\x01\x02\x12\x03\x1e\x0b\x1a\n\x0c\n\x05\x06\x00\x02\x01\x06\x12\x03\x1e%+\n\x0c\n\x05\x06\x00\x02\x01\x03\x12\x03\x1e,5\n\xe6\x01\n\x04\x06\x00\x02\x02\x12\x03%\x026\x1a\xd8\x01 Put uploads a Blob, by reading a stream of bytes.\n\n The way the data is chunked up in individual BlobChunk messages sent in\n the stream has no effect on how the server ends up chunking blobs up, if\n it does at all.\n\n\x0c\n\x05\x06\x00\x02\x02\x01\x12\x03%\x06\t\n\x0c\n\x05\x06\x00\x02\x02\x05\x12\x03%\n\x10\n\x0c\n\x05\x06\x00\x02\x02\x02\x12\x03%\x11\x1a\n\x0c\n\x05\x06\x00\x02\x02\x03\x12\x03%%4\n\n\n\x02\x04\x00\x12\x04(\x001\x01\n\n\n\x03\x04\x00\x01\x12\x03(\x08\x17\n6\n\x04\x04\x00\x02\x00\x12\x03*\x02\x13\x1a) The blake3 digest of the blob 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\nS\n\x04\x04\x00\x02\x01\x12\x03-\x02\x17\x1aF Whether the server should reply with a list of more granular chunks.\n\n\x0c\n\x05\x04\x00\x02\x01\x05\x12\x03-\x02\x06\n\x0c\n\x05\x04\x00\x02\x01\x01\x12\x03-\x07\x12\n\x0c\n\x05\x04\x00\x02\x01\x03\x12\x03-\x15\x16\n:\n\x04\x04\x00\x02\x02\x12\x030\x02\x14\x1a- Whether the server should reply with a bao.\n\n\x0c\n\x05\x04\x00\x02\x02\x05\x12\x030\x02\x06\n\x0c\n\x05\x04\x00\x02\x02\x01\x12\x030\x07\x0f\n\x0c\n\x05\x04\x00\x02\x02\x03\x12\x030\x12\x13\n\n\n\x02\x04\x01\x12\x043\x00D\x01\n\n\n\x03\x04\x01\x01\x12\x033\x08\x18\n\x9f\x01\n\x04\x04\x01\x02\x00\x12\x037\x02 \x1a\x91\x01 If `send_chunks` was set to true, this MAY contain a list of more\n granular chunks, which then may be read individually via the `Read`\n method.\n\n\x0c\n\x05\x04\x01\x02\x00\x04\x12\x037\x02\n\n\x0c\n\x05\x04\x01\x02\x00\x06\x12\x037\x0b\x14\n\x0c\n\x05\x04\x01\x02\x00\x01\x12\x037\x15\x1b\n\x0c\n\x05\x04\x01\x02\x00\x03\x12\x037\x1e\x1f\n\x0c\n\x04\x04\x01\x03\x00\x12\x049\x02?\x03\n\x0c\n\x05\x04\x01\x03\x00\x01\x12\x039\n\x13\n.\n\x06\x04\x01\x03\x00\x02\x00\x12\x03;\x04\x15\x1a\x1f Digest of that specific chunk\n\n\x0e\n\x07\x04\x01\x03\x00\x02\x00\x05\x12\x03;\x04\t\n\x0e\n\x07\x04\x01\x03\x00\x02\x00\x01\x12\x03;\n\x10\n\x0e\n\x07\x04\x01\x03\x00\x02\x00\x03\x12\x03;\x13\x14\n0\n\x06\x04\x01\x03\x00\x02\x01\x12\x03>\x04\x14\x1a! Length of that chunk, in bytes.\n\n\x0e\n\x07\x04\x01\x03\x00\x02\x01\x05\x12\x03>\x04\n\n\x0e\n\x07\x04\x01\x03\x00\x02\x01\x01\x12\x03>\x0b\x0f\n\x0e\n\x07\x04\x01\x03\x00\x02\x01\x03\x12\x03>\x12\x13\n\x93\x01\n\x04\x04\x01\x02\x01\x12\x03C\x02\x10\x1a\x85\x01 If `send_bao` was set to true, this MAY contain a outboard bao.\n The exact format and message types here will still be fleshed out.\n\n\x0c\n\x05\x04\x01\x02\x01\x05\x12\x03C\x02\x07\n\x0c\n\x05\x04\x01\x02\x01\x01\x12\x03C\x08\x0b\n\x0c\n\x05\x04\x01\x02\x01\x03\x12\x03C\x0e\x0f\n\n\n\x02\x04\x02\x12\x04F\x00I\x01\n\n\n\x03\x04\x02\x01\x12\x03F\x08\x17\n?\n\x04\x04\x02\x02\x00\x12\x03H\x02\x13\x1a2 The blake3 digest of the blob or chunk requested\n\n\x0c\n\x05\x04\x02\x02\x00\x05\x12\x03H\x02\x07\n\x0c\n\x05\x04\x02\x02\x00\x01\x12\x03H\x08\x0e\n\x0c\n\x05\x04\x02\x02\x00\x03\x12\x03H\x11\x12\nw\n\x02\x04\x03\x12\x04M\x00O\x01\x1ak This represents some bytes of a blob.\n Blobs are sent in smaller chunks to keep message sizes manageable.\n\n\n\n\x03\x04\x03\x01\x12\x03M\x08\x11\n\x0b\n\x04\x04\x03\x02\x00\x12\x03N\x02\x11\n\x0c\n\x05\x04\x03\x02\x00\x05\x12\x03N\x02\x07\n\x0c\n\x05\x04\x03\x02\x00\x01\x12\x03N\x08\x0c\n\x0c\n\x05\x04\x03\x02\x00\x03\x12\x03N\x0f\x10\n\n\n\x02\x04\x04\x12\x04Q\x00T\x01\n\n\n\x03\x04\x04\x01\x12\x03Q\x08\x17\n;\n\x04\x04\x04\x02\x00\x12\x03S\x02\x13\x1a. The blake3 digest of the data that was sent.\n\n\x0c\n\x05\x04\x04\x02\x00\x05\x12\x03S\x02\x07\n\x0c\n\x05\x04\x04\x02\x00\x01\x12\x03S\x08\x0e\n\x0c\n\x05\x04\x04\x02\x00\x03\x12\x03S\x11\x12b\x06proto3\n\xf3\x13\n\'tvix/castore/protos/rpc_directory.proto\x12\x0ftvix.castore.v1\x1a!tvix/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$.tvix.castore.v1.GetDirectoryRequest\x1a\x1a.tvix.castore.v1.Directory0\x01\x12J\n\x03Put\x12\x1a.tvix.castore.v1.Directory\x1a%.tvix.castore.v1.PutDirectoryResponse(\x01B(Z&code.tvl.fyi/tvix/castore-go;castorev1J\xa2\x10\n\x06\x12\x04\x02\x004\x01\nL\n\x01\x0c\x12\x03\x02\x00\x12\x1aB SPDX-License-Identifier: MIT\n Copyright \xc2\xa9 2022 The Tvix Authors\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\x00=\n\t\n\x02\x08\x0b\x12\x03\x08\x00=\n\n\n\x02\x06\x00\x12\x04\n\x00!\x01\n\n\n\x03\x06\x00\x01\x12\x03\n\x08\x18\n\xa5\x04\n\x04\x06\x00\x02\x00\x12\x03\x15\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\x15\x06\t\n\x0c\n\x05\x06\x00\x02\x00\x02\x12\x03\x15\n\x1d\n\x0c\n\x05\x06\x00\x02\x00\x06\x12\x03\x15(.\n\x0c\n\x05\x06\x00\x02\x00\x03\x12\x03\x15/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#\x000\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\x03/\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\x03/\x02\x06\n\x0c\n\x05\x04\x00\x02\x01\x01\x12\x03/\x07\x10\n\x0c\n\x05\x04\x00\x02\x01\x03\x12\x03/\x13\x14\n\n\n\x02\x04\x01\x12\x042\x004\x01\n\n\n\x03\x04\x01\x01\x12\x032\x08\x1c\n\x0b\n\x04\x04\x01\x02\x00\x12\x033\x02\x18\n\x0c\n\x05\x04\x01\x02\x00\x05\x12\x033\x02\x07\n\x0c\n\x05\x04\x01\x02\x00\x01\x12\x033\x08\x13\n\x0c\n\x05\x04\x01\x02\x00\x03\x12\x033\x16\x17b\x06proto3";

Compiled file descriptors for implementing gRPC reflection with e.g. tonic_reflection.