Hermes Server
A high-performance gRPC search server for Hermes indexes.
Features
- Index Management: Create, delete, and manage search indexes
- Document Indexing: Stream or batch index documents
- Search: Text, range, sparse/dense vector, binary vector, and fusion queries
- Document Retrieval: Get documents by stable segment/document address
- Segment Management: Commit changes and force merge segments
Installation
Or build from source:
Usage
Starting the Server
Options:
-a, --addr: Address to bind to (default:0.0.0.0:50051)-d, --data-dir: Directory for storing indexes (default:./data)
Search resource controls
--search-threads sets the width of a bounded Rayon pool shared by CPU-bound
search work across every open index. When omitted, it defaults to one thread per
four detected CPUs (minimum one). Nested parallel work, including fused queries,
segment fan-out, phrase loading, and vector search, stays inside this same pool;
Hermes does not create a pool per index or request.
--max-concurrent-searches bounds expensive search pipelines across all HTTP/2
connections; document lookup and metadata RPCs do not consume these permits.
When omitted, Hermes allows one concurrent search per eight detected CPUs,
clamped to 1..=8 (six searches on a 48-core host). Requests above that
capacity fail promptly with gRPC RESOURCE_EXHAUSTED; clients should retry with
bounded exponential backoff. This keeps overload from accumulating an
unbounded in-process request queue. Completed or cancelled searches release
their permit automatically.
The server also rejects request sizes that could otherwise multiply into large per-segment heaps:
| Request component | Limit |
|---|---|
| Final search results | 10000 |
Pagination window (offset + limit) |
50000 |
| L1 reranker candidates | 50000 |
| Fusion candidates fetched per sub-query | 50000 |
| Fusion sub-queries | 16 |
| Fusion fetch depth x number of sub-queries | 200000 |
| Query nesting depth | 32 |
| Query nodes / aggregate clauses | 256 / 512 |
| Clauses in one Boolean query | 128 |
| Aggregate query text | 64 KiB |
| Aggregate query vector payload | 1 MiB |
| Dense dimensions / sparse input dimensions | 65536 / 4096 |
| Binary query bytes | 256 KiB |
| Stored fields requested | 64 |
| Aggregate requested-field name bytes | 16 KiB |
| Retained response / encoded response (each) | 48 MiB |
Zero-valued defaults remain supported. Derived reranker and fusion defaults are
checked and capped at the corresponding limit; explicit values over a limit
return gRPC INVALID_ARGUMENT.
The structural limits are checked iteratively before query conversion and
before a search permit is acquired. Requested stored fields are resolved and
deduplicated once, and response hydration is charged before field values are
cloned into protobuf objects. A response that would exceed its memory/encoding
budget fails with RESOURCE_EXHAUSTED; request fewer hits or fields.
Background merge and reorder
The server uses one BP CPU pool and one whole-pass gate across all indexes. These are deliberately separate controls:
| Option | Default | Meaning |
|---|---|---|
--optimizer-threads |
0 |
Threads in the shared BP pool. 0 disables periodic optimizer scans; merge-time and manual BP still use the process-wide fallback pool. |
--optimizer-concurrent-passes |
2 |
Maximum simultaneous whole-segment BP passes across optimizer, merge-time, and manual reorder. Values are clamped to 1..=2; automatic merges use at most one slot so fresh-segment optimization retains capacity. |
--optimizer-scan-interval-secs |
60 |
Interval between background scans. |
--optimizer-large-segment-docs |
5000000 |
Document threshold for partial/budgeted first passes. |
--optimizer-time-budget-secs |
600 |
Wall-clock budget for an optimizer pass on a large segment. |
--optimizer-partial-min-partition-docs |
256 |
Initial depth floor for large segments (one default LSP superblock). |
--optimizer-unconverged-cooldown-secs |
600 |
Delay after a rewrite finishes before another deepening pass. |
--optimizer-max-unconverged-passes |
3 |
Optimizer follow-up eligibility limit per truncated lineage, including the initial partial pass. 0 disables follow-up deepening. |
--merge-bp-budget-secs |
600 |
Wall-clock budget for BP performed inside a merge; 0 explicitly selects an unbudgeted pass. |
--bp-memory-budget-mb |
24576 |
Per-pass algorithmic working-set bound; not a reservation or a total-process RSS limit. |
An active BP pass is CPU-bound and is expected to occupy up to
--optimizer-threads cores. Concurrent passes share that same pool, so a
second pass primarily raises simultaneous working sets and outstanding IO; it
does not create another pool per pass or per index. Explicit force merges pause
new background BP admission and reserve foreground capacity after existing
merges drain. With two-pass admission, automatic merge BP uses at most one
slot; the other remains available to retire short fresh-segment optimizer
passes instead of queueing them behind multi-minute merges. For predictable
service latency, start with one pass and a CPU width that leaves capacity for
query and indexing work.
The dominant graph representation is roughly 4 bytes/posting + 32 bytes/document. The limit also accounts for record maps, vocabulary-sized
degree arrays, and record-rewrite grid/encode windows. If the record
representation cannot fit, Hermes performs a valid blockwise rewrite and marks
it unconverged; if only the graph is too large, it retains a bounded set of
low-frequency dimensions. Stored postings are never truncated. At the process
level, still budget for up to concurrent-passes * bp-memory-budget, plus
indexing builders, merge state, mmap/page-cache residency, output buffering,
and open readers.
Merge failures use exponential retry backoff (30 seconds through 30 minutes). A deterministic missing/corrupt source is quarantined for the process lifetime so the same candidate cannot consume all cores in an immediate loop. The metadata entry remains visible—Hermes never silently removes documents. To explicitly remove corrupt entries and their files, stop normal traffic and run:
--doctor is destructive recovery: it validates every metadata-live segment
and removes entries that cannot be opened. Normal startup/writer-open cleanup
only deletes true unowned files and cannot delete metadata-live, actively
written, or reader-retained segments. Standalone reorder failures are also
backed off per source from pass completion, so a pass that outlasts the scan
interval cannot restart continuously. Successful but budget-truncated outputs
carry a retry count across replacement IDs and stop being optimizer candidates
at --optimizer-max-unconverged-passes, so a lineage that never converges
cannot consume the optimizer pool forever. Explicitly configured merge-time BP
still runs when that lineage later participates in a real merge. Details and
invariants are in Segment lifecycle and recovery.
gRPC API
The server exposes two services: SearchService and IndexService.
IndexService
CreateIndex
Create a new index with a schema definition (SDL or JSON format).
rpc CreateIndex(CreateIndexRequest) returns (CreateIndexResponse);
message CreateIndexRequest {
string index_name = 1;
string schema = 2; // SDL or JSON schema
}
SDL Schema Example:
index articles {
field title: text<simple> [indexed, stored]
field body: text<simple> [indexed, stored]
field author: text<simple> [indexed, stored]
field published_at: u64 [indexed, stored]
field tags: text<raw> [indexed, stored<multi>]
}
JSON Schema Example:
BatchIndexDocuments
Index multiple documents in a single request.
rpc BatchIndexDocuments(BatchIndexDocumentsRequest) returns (BatchIndexDocumentsResponse);
message BatchIndexDocumentsRequest {
string index_name = 1;
repeated NamedDocument documents = 2;
}
message NamedDocument {
repeated FieldEntry fields = 1;
}
message FieldEntry {
string name = 1;
FieldValue value = 2;
}
FieldEntry is repeated so callers can send multiple values with the same
field name.
IndexDocuments (Streaming)
Stream documents for indexing.
rpc IndexDocuments(stream IndexDocumentRequest) returns (IndexDocumentsResponse);
Commit
Commit pending changes to make them searchable.
rpc Commit(CommitRequest) returns (CommitResponse);
ForceMerge
Merge all segments into one for optimal search performance.
rpc ForceMerge(ForceMergeRequest) returns (ForceMergeResponse);
RetrainVectorIndex
Train new global IVF-PQ or binary-IVF codebooks from the current corpus and rebuild every ANN segment. The complete segment/codebook generation is published atomically; existing readers keep the previous generation.
Training reads a deterministic corpus-wide sample for one field at a time.
--vector-training-max-samples (default 10,000,000) and
--vector-training-memory-mb (default 4096) are simultaneous per-field
bounds; the smaller limit wins. Unselected corpus vectors are never loaded
into the training sample.
rpc RetrainVectorIndex(RetrainVectorIndexRequest) returns (RetrainVectorIndexResponse);
DeleteIndex
Delete an index and all its data.
rpc DeleteIndex(DeleteIndexRequest) returns (DeleteIndexResponse);
SearchService
Search
Search for documents matching a query.
rpc Search(SearchRequest) returns (SearchResponse);
message SearchRequest {
string index_name = 1;
Query query = 2;
uint32 limit = 3;
uint32 offset = 4;
repeated string fields_to_load = 5;
Reranker reranker = 6;
uint32 candidate_limit = 7;
}
Query Types:
TermQueryandMatchQueryBooleanQuery,BoostQuery,RangeQuery,PrefixQuery, andAllQuerySparseVectorQuery,DenseVectorQuery, andBinaryDenseVectorQuery- top-level
FusionQueryfor hybrid union retrieval
GetDocument
Retrieve a document by the DocAddress returned in a search hit.
rpc GetDocument(GetDocumentRequest) returns (GetDocumentResponse);
GetIndexInfo
Get information about an index (document count, segments, schema).
rpc GetIndexInfo(GetIndexInfoRequest) returns (GetIndexInfoResponse);
Field Types
| Type | Description |
|---|---|
text |
Full-text searchable string |
u64 |
Unsigned 64-bit integer |
i64 |
Signed 64-bit integer |
f64 |
64-bit floating point |
bytes |
Binary data |
json |
JSON object (stored as string) |
sparse_vector |
Sparse vector for semantic search |
dense_vector |
Dense vector for semantic search |
Example: Python client
The maintained client handles protobuf conversion and channel lifecycle:
await
await
await
= await
Docker
Build and run with Docker:
Or pull from GitHub Container Registry:
License
MIT
Development checks