memd 1.9.0

Local memory CLI for AI agents with hybrid retrieval
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
use super::*;

pub async fn handle_memory_search<S: Store>(
    store: &S,
    params: SearchParams,
) -> Result<Value, McpError> {
    let tenant_id = resolve_tenant_id(&params.tenant_id)?;
    ProjectId::validate_opt(params.project_id.as_deref())
        .map_err(|e| McpError::InvalidParams(e.to_string()))?;
    validate_search_k(params.k)?;
    if params.ranking_time_ms.is_some_and(|value| value < 0) {
        return Err(McpError::InvalidParams(
            "ranking_time_ms must be non-negative".to_string(),
        ));
    }
    let parsed_filters = parse_search_filters(params.filters.as_ref())?;
    let debug_tiers = params.debug_tiers.unwrap_or(false);
    let mode = params.mode.unwrap_or_default();
    let project_id_filter = params.project_id.as_deref();
    let scope_expansion = scope_expansion_for(&tenant_id, project_id_filter);
    let has_filters = has_active_search_filters(project_id_filter, &parsed_filters);
    let (visibility_policy, oversample_factor) = resolve_visibility_and_oversample(&params);
    let policy_mode = params.ranking_policy.unwrap_or(RankingPolicyMode::Shadow);
    let candidate_multiplier = params.candidate_multiplier.unwrap_or(4).clamp(1, 20);
    let outcome_candidate_cap = params
        .k
        .saturating_mul(candidate_multiplier)
        .clamp(params.k, 200);
    // Pre-visibility trim headroom: `apply_search_filters` takes a cap so
    // pass the larger lifecycle/outcome candidate bound here. The final
    // served list is still trimmed to k after visibility and source dedup.
    let pre_visibility_cap = params
        .k
        .saturating_mul(oversample_factor)
        .max(outcome_candidate_cap)
        .min(200);
    let fetch_k = adaptive_fetch_k(params.k, &params.query, has_filters)
        .max(pre_visibility_cap)
        .min(200);
    let project_scopes = project_scopes_for_project(store, &tenant_id, project_id_filter).await?;

    info!(
        tenant_id = %tenant_id,
        query = %params.query,
        k = params.k,
        fetch_k = fetch_k,
        debug_tiers = debug_tiers,
        "memory.search"
    );

    // Use search_with_tier_info if debug_tiers is requested
    if debug_tiers {
        let (scored_chunks, timing) = search_with_tier_info_for_project_scopes(
            store,
            &project_scopes,
            &params.query,
            fetch_k,
            params.ranking_time_ms,
        )
        .await?;
        let exact_candidates = exact_lexical_candidates_for_project_scopes(
            store,
            &project_scopes,
            &params.query,
            params.k.min(fetch_k),
        )
        .await?;
        let preferred = summary_preferred_results_for_project_scopes(
            store,
            &project_scopes,
            &params.query,
            mode,
            params.k.min(8),
            params.ranking_time_ms,
        )
        .await?;
        let mut merged = merge_preferred_and_raw(
            preferred,
            merge_scored_chunk_lists(vec![exact_candidates, scored_chunks], fetch_k),
            fetch_k,
        );
        if should_run_lexical_overlap_rescue(&merged, &params.query, params.k) {
            let lexical_candidates = lexical_overlap_candidates_for_project_scopes(
                store,
                &project_scopes,
                &params.query,
                params.k.min(fetch_k),
            )
            .await?;
            merged = merge_scored_chunk_lists(vec![lexical_candidates, merged], fetch_k);
        }
        let mut scored_chunks =
            apply_search_filters(merged, None, &parsed_filters, pre_visibility_cap);
        let mut timing = timing;
        let mut repair_info = None;

        if scored_chunks.is_empty() && !params.query.is_empty() {
            if let Some(repaired_query) = normalize_query_for_repair(&params.query) {
                let (repair_scored, repair_timing) = search_with_tier_info_for_project_scopes(
                    store,
                    &project_scopes,
                    &repaired_query,
                    fetch_k,
                    params.ranking_time_ms,
                )
                .await?;
                let repaired_filtered =
                    apply_search_filters(repair_scored, None, &parsed_filters, pre_visibility_cap);
                let repaired = !repaired_filtered.is_empty();
                if repaired {
                    scored_chunks = repaired_filtered;
                    timing = repair_timing;
                }
                repair_info = Some(RepairInfo {
                    attempted: true,
                    repaired,
                    original_query: params.query.clone(),
                    repaired_query: Some(repaired_query),
                });
            }
        }

        if mode == QueryMode::Generic {
            scored_chunks = suppress_generated_digest_projection_chunks(scored_chunks);
        }

        // Resolve lifecycle visibility over the expanded pool. Outcome
        // shadow scoring observes this pool; source dedup and final top-k
        // selection happen afterward so discarded fragments remain auditable.
        let episode_candidates = apply_visibility_filter(
            store,
            scored_chunks,
            &visibility_policy,
            outcome_candidate_cap,
        )
        .await;
        let episode_pool = outcome_rank_candidate_pool(
            store,
            &tenant_id,
            project_id_filter,
            episode_candidates,
            policy_mode,
            params.ranking_time_ms,
        )
        .await?;
        let mut scored_chunks = if params.dedupe_by_source {
            dedupe_scored_chunks_by_source_uri(episode_pool.served.clone())
        } else {
            episode_pool.served.clone()
        };
        scored_chunks.truncate(params.k);
        if params.render_event_time {
            render_observed_time_into_text(&mut scored_chunks);
        }

        debug!(
            results_count = scored_chunks.len(),
            "search completed with tier info"
        );

        // Pre-budget retrieval count: scope_status's wider_scope_hits probe
        // must key on whether the search itself fell short of k, not on how
        // many rows survived token-budget packing in shape_memory_results.
        let retrieved_count = scored_chunks.len();

        // Build tier debug info if timing is available
        let tier_info = timing.map(|t| {
            let source_tier = if t.cache_lookup_ms > 0 && t.hot_tier_ms == 0 && t.warm_tier_ms == 0
            {
                "cache".to_string()
            } else if t.hot_tier_ms > 0 && t.warm_tier_ms == 0 {
                "hot".to_string()
            } else if t.warm_tier_ms > 0 {
                "warm".to_string()
            } else {
                "hybrid".to_string()
            };

            let cache_hit = t.cache_lookup_ms > 0 && t.hot_tier_ms == 0 && t.warm_tier_ms == 0;
            let hot_tier_hit = t.hot_tier_ms > 0 && t.warm_tier_ms == 0;

            TierDebugInfo {
                source_tier,
                cache_hit,
                hot_tier_hit,
                cache_lookup_ms: t.cache_lookup_ms,
                hot_tier_ms: t.hot_tier_ms,
                warm_tier_ms: t.warm_tier_ms,
            }
        });

        // Determine source tier per result based on scoring heuristics
        // If we have tier_info, derive per-result tier from overall timing
        let default_tier = tier_info.as_ref().map(|t| t.source_tier.clone());

        let artifacts = resolve_artifacts_for_ranked_chunks(store, &scored_chunks).await?;
        let mut results = build_chunk_results(
            store,
            &scored_chunks,
            default_tier,
            &artifacts,
            params.expand_event_siblings,
            &visibility_policy,
        )
        .await?;
        annotate_chunk_origins(&mut results, &tenant_id, scope_expansion.as_ref());

        let (results, budget_info) = shape_memory_results(results, &params);
        let (retrieval_episode_id, ranking_policy) = if params.suppress_retrieval_episode
            || params.ranking_time_ms.is_some()
            || store.is_read_only()
        {
            (None, None)
        } else {
            let (episode_id, policy) = record_search_retrieval_episode(
                store,
                &tenant_id,
                project_id_filter,
                &params.query,
                mode,
                params.k,
                policy_mode,
                params.task_id.clone(),
                params.thread_id.clone(),
                &episode_pool,
                &results,
            )
            .await?;
            (Some(episode_id), Some(policy))
        };
        record_search_usage_event(store, &tenant_id, &params, results.len());
        let scope_status = scope_status_for_search(
            store,
            &tenant_id,
            project_id_filter,
            &params.query,
            params.k,
            retrieved_count,
            &parsed_filters,
            &visibility_policy,
            params.ranking_time_ms,
        )
        .await;
        return format_mcp_response(&SearchResult {
            results,
            retrieval_episode_id,
            ranking_policy,
            budget_info,
            scope_expansion,
            tier_info,
            repair_info,
            scope_status: Some(scope_status),
        });
    }

    // Standard path without tier info
    let scored_chunks = search_with_scores_for_project_scopes(
        store,
        &project_scopes,
        &params.query,
        fetch_k,
        params.ranking_time_ms,
    )
    .await?;
    let exact_candidates = exact_lexical_candidates_for_project_scopes(
        store,
        &project_scopes,
        &params.query,
        params.k.min(fetch_k),
    )
    .await?;
    let preferred = summary_preferred_results_for_project_scopes(
        store,
        &project_scopes,
        &params.query,
        mode,
        params.k.min(8),
        params.ranking_time_ms,
    )
    .await?;
    let mut merged = merge_preferred_and_raw(
        preferred,
        merge_scored_chunk_lists(vec![exact_candidates, scored_chunks], fetch_k),
        fetch_k,
    );
    if should_run_lexical_overlap_rescue(&merged, &params.query, params.k) {
        let lexical_candidates = lexical_overlap_candidates_for_project_scopes(
            store,
            &project_scopes,
            &params.query,
            params.k.min(fetch_k),
        )
        .await?;
        merged = merge_scored_chunk_lists(vec![lexical_candidates, merged], fetch_k);
    }
    let mut scored_chunks = apply_search_filters(merged, None, &parsed_filters, pre_visibility_cap);
    let mut repair_info = None;

    if scored_chunks.is_empty() && !params.query.is_empty() {
        if let Some(repaired_query) = normalize_query_for_repair(&params.query) {
            let repair_scored = search_with_scores_for_project_scopes(
                store,
                &project_scopes,
                &repaired_query,
                fetch_k,
                params.ranking_time_ms,
            )
            .await?;
            let repaired_filtered =
                apply_search_filters(repair_scored, None, &parsed_filters, pre_visibility_cap);
            let repaired = !repaired_filtered.is_empty();
            if repaired {
                scored_chunks = repaired_filtered;
            }
            repair_info = Some(RepairInfo {
                attempted: true,
                repaired,
                original_query: params.query.clone(),
                repaired_query: Some(repaired_query),
            });
        }
    }

    if mode == QueryMode::Generic {
        scored_chunks = suppress_generated_digest_projection_chunks(scored_chunks);
    }

    let episode_candidates = apply_visibility_filter(
        store,
        scored_chunks,
        &visibility_policy,
        outcome_candidate_cap,
    )
    .await;
    let episode_pool = outcome_rank_candidate_pool(
        store,
        &tenant_id,
        project_id_filter,
        episode_candidates,
        policy_mode,
        params.ranking_time_ms,
    )
    .await?;
    let mut scored_chunks = if params.dedupe_by_source {
        dedupe_scored_chunks_by_source_uri(episode_pool.served.clone())
    } else {
        episode_pool.served.clone()
    };
    scored_chunks.truncate(params.k);
    if params.render_event_time {
        render_observed_time_into_text(&mut scored_chunks);
    }

    debug!(results_count = scored_chunks.len(), "search completed");

    // Pre-budget retrieval count for scope_status (see the tier-debug
    // branch above): the wider_scope_hits probe keys on search shortage,
    // not on token-budget packing.
    let retrieved_count = scored_chunks.len();

    let artifacts = resolve_artifacts_for_ranked_chunks(store, &scored_chunks).await?;
    let mut results = build_chunk_results(
        store,
        &scored_chunks,
        None,
        &artifacts,
        params.expand_event_siblings,
        &visibility_policy,
    )
    .await?;
    annotate_chunk_origins(&mut results, &tenant_id, scope_expansion.as_ref());

    let (results, budget_info) = shape_memory_results(results, &params);
    let (retrieval_episode_id, ranking_policy) = if params.suppress_retrieval_episode
        || params.ranking_time_ms.is_some()
        || store.is_read_only()
    {
        (None, None)
    } else {
        let (episode_id, policy) = record_search_retrieval_episode(
            store,
            &tenant_id,
            project_id_filter,
            &params.query,
            mode,
            params.k,
            policy_mode,
            params.task_id.clone(),
            params.thread_id.clone(),
            &episode_pool,
            &results,
        )
        .await?;
        (Some(episode_id), Some(policy))
    };
    record_search_usage_event(store, &tenant_id, &params, results.len());
    let scope_status = scope_status_for_search(
        store,
        &tenant_id,
        project_id_filter,
        &params.query,
        params.k,
        retrieved_count,
        &parsed_filters,
        &visibility_policy,
        params.ranking_time_ms,
    )
    .await;
    format_mcp_response(&SearchResult {
        results,
        retrieval_episode_id,
        ranking_policy,
        budget_info,
        scope_expansion,
        tier_info: None,
        repair_info,
        scope_status: Some(scope_status),
    })
}