@avantf/dsh-mem 0.8.1 → 0.10.0

package/lib/engine/graph-recall/index.d.ts

@@ -4,8 +4,8 @@
  * The package owns the algorithms that memory and knowledge share: one-hop, reverse, two-hop, AND
  * and neighbour walks over a {@link GraphReader}, returning {@link RelationPath}s that keep their
  * evidence. It deliberately does NOT own storage, filtering policy, extraction, planning, answer
- * generation, or anything DSH/Cordis/SQLite-specific — see `docs/GRAPH_RECALL_LIBRARY.md` in the
- * mem repository for the boundary and its rationale.
+ * generation, or anything DSH/Cordis/SQLite-specific — the boundary and its rationale are in this
+ * package's README.
  *
  * @example
  * ```ts

package/lib/engine/graph-recall/traverse.d.ts

@@ -2,7 +2,7 @@
  * The traversal half of `@avantf/graph-recall`: five explicit, bounded operators over a
  * {@link GraphReader}, plus a thin {@link query} dispatcher.
  *
- * Design constraints (docs/GRAPH_RECALL_LIBRARY.md §5), enforced here rather than left to callers:
+ * Design constraints (documented in the package README), enforced here rather than left to callers:
  *
  *  - **Two hops at most.** There is no recursive walk and no depth parameter beyond `1 | 2`.
  *  - **Every operator is bounded.** Reader calls are over-fetched to `limit × 5` (capped at
@@ -21,7 +21,7 @@
  *    back to fuzzy retrieval.
  */
 import type { AndOptions, GraphNode, GraphQuery, GraphReader, GraphResult, NeighborOptions, PathOptions, RelationPath } from './types.js';
-/** Default page size of every operator (§5 "每个算子有 limit，默认 10"). */
+/** Default page size of every operator ("每个算子有 limit，默认 10"). */
 export declare const DEFAULT_LIMIT = 10;
 /**
  * Hard page-size ceiling. A larger `limit` is clamped instead of honored: the package's contract is

package/lib/engine/graph-recall/types.d.ts

@@ -47,7 +47,7 @@ export interface GraphEdge {
     /**
      * When the evidence was recorded: an ISO-8601 timestamp or epoch milliseconds. Optional because
      * the design's `GraphEdge` does not require it; when present it drives the recency tiebreak
-     * (§5 "证据时间 DESC"). An adapter maps `edges.created_at` / `facts.created_at` here.
+     * ("证据时间 DESC"). An adapter maps `edges.created_at` / `facts.created_at` here.
      */
     observedAt?: string | number;
 }

package/lib/engine/mem/config/config_files.d.ts

@@ -15,7 +15,7 @@ import type { AvantfLogger } from '../../mem-contract/index.js';
  * UNCOMMENTED line is warned about by the loader, so a wrong name here would be a trap rather than a
  * hint. `config_files.spec.ts` pins the ones this template names.
  */
-export declare const DEFAULT_COMMON_CONFIG = "# avantf-mem \u516C\u5171\u914D\u7F6E\uFF08\u5206\u5C42\u7B2C\u2461\u5C42\uFF09\u3002\u8FD9\u91CC\u5168\u662F\u6CE8\u91CA\uFF1A\u5220\u6389/\u7559\u7A7A = \u7528\u5185\u5EFA\u9ED8\u8BA4\uFF0C\u53D6\u6D88\u6CE8\u91CA\u5373\u751F\u6548\u3002\n# \u5206\u5C42\uFF08\u4F4E\u2192\u9AD8\uFF09\uFF1A\u2460 \u5185\u5EFA\u9ED8\u8BA4 \u2192 \u2461 \u672C\u6587\u4EF6 \u2192 \u2462 \u540C\u76EE\u5F55\u7684 memory.yaml\uFF08\u7F3A\u5931=\u4E0D\u8986\u76D6\uFF09\n#               \u2192 \u2463 \u73AF\u5883\u53D8\u91CF \u2192 \u2464 \u63D2\u4EF6/CLI \u663E\u5F0F\u4F20\u53C2\n# \u6240\u6709\u53EF\u7F16\u8F91\u6587\u672C\u90FD\u5728 ~/.avantf \u4E0B\uFF1Aconfigs/*.yaml\uFF08\u672C\u76EE\u5F55\uFF09\u4E0E prompts/*.md\uFF08\u6A21\u578B\u63D0\u793A\u8BCD\uFF09\u3002\n\n# \u6570\u636E\u6839\u4E0D\u5728\u8FD9\u91CC\u914D\uFF1A\u5B83\u7531 \u2463 AVANTF_HOME\uFF08\u5BB6\u65CF\u6839\uFF1A\u540C\u65F6\u51B3\u5B9A\u6570\u636E\u6839\u4E0E models/tools\uFF09\u51B3\u5B9A \u2014\u2014\n# \u53EA\u60F3\u6362\u6570\u636E\u6839\u3001\u4E0D\u642C\u6A21\u578B\u7F13\u5B58\u65F6\u7528 CLI \u7684 \u2464 \u663E\u5F0F\u53C2\u6570 avantf-mem --data-home <path>\uFF08\u63D2\u4EF6\u5219\u662F profile \u7684\n# dataHome\uFF0C\u5C5E \u2461\uFF09\u3002\u672C\u6587\u4EF6\u5C31\u5728\u6570\u636E\u6839\u91CC\u9762\uFF0C\u89E3\u6790\u6839\u65F6\u8FD8\u6CA1\u8BFB\u5230\u5B83\uFF0C\u6240\u4EE5\u5199\u5728\u8FD9\u91CC\u7684 dataHome \u5BF9\u6570\u636E\u6839\u65E0\u6548\uFF08DESIGN \u00A73\uFF09\u3002\n\n# semantic:                           # \u5D4C\u5165\u540E\u7AEF\uFF08\u8BB0\u5FC6\u4E0E\u77E5\u8BC6\u5171\u7528\uFF0C\u8DE8\u5E93\u5206\u6570\u624D\u53EF\u6BD4\uFF09\n#   backend: local_bge\n#   local_model: Xenova/bge-base-zh-v1.5    # \u5FC5\u987B\u662F ONNX \u4ED3\u5E93\n#   dim: 768\n#   auto_download: true\n#   auto_migrate: true                # \u6362\u6A21\u578B/\u5BBD\u5EA6\u540E\u81EA\u52A8\u5206\u6279\u91CD\u7B97\u65E7\u7A7A\u95F4\u7684\u5411\u91CF\uFF08\u9ED8\u8BA4\u5F00\uFF09\uFF1B\u5173\u6389\u53EA\u5269\u542F\u52A8\u544A\u8B66 + vectors --fix\n#   \u26A0\uFE0F cache_dir / mirror \u7531\u5BB6\u65CF\u5E95\u5EA7 @avantf/dsh-plugin-base \u7BA1\u7406\uFF1A\u5199\u5728\u8FD9\u91CC\u4F1A\u88AB\u5FFD\u7565\u5E76\u544A\u8B66\u3002\n#      \u7F13\u5B58\u76EE\u5F55\u7528\u73AF\u5883\u53D8\u91CF AVANTF_MEM_MODEL_CACHE\uFF0C\u955C\u50CF\u7528 AVANTF_MEM_MODEL_MIRROR\uFF08\u6216 HF_ENDPOINT\uFF09\u3002\n\n# vectorStore:\n#   backend: auto                     # auto = \u8D8A\u8FC7\u9608\u503C\u81EA\u52A8\u4ECE local_numpy \u8FC1\u5230 hnswlib\n#   auto_thresholds:\n#     hnswlib: 2000\n#   hnswlib_ef_search: 256            # ANN \u7684\u53EC\u56DE/\u901F\u5EA6\u65CB\u94AE\uFF0C\u8BED\u6599\u53D8\u5927\u5148\u8C03\u5B83\n\n# retriever:                          # \u4E09\u6761\u68C0\u7D22\u817F\u5728\u878D\u5408\u91CC\u7684\u6743\u91CD\u4E0E\"\u76F8\u5173\u6027\u95E8\u69DB\"\n#   weight_semantic: 0.55\n#   weight_fts: 0.30\n#   weight_jaccard: 0.15\n#   # \u817F\u95E8\u69DB\u662F\u7EDD\u5BF9\u95E8\u69DB\uFF0C\u6253\u5728\u6BCF\u6761\u817F\u7684\u539F\u59CB\u5206\u4E0A\u3001fuse() \u4E4B\u524D\uFF1B0 = \u5173\u95ED\u8BE5\u95E8\u69DB\uFF0C\u5206\u6570\u7B49\u4E8E\u95E8\u69DB\u4FDD\u7559\u3002\n#   # \u8BED\u4E49\u540E\u7AEF\u4E0D\u53EF\u7528\u65F6 min_fts_terms \u7684\u751F\u6548\u503C\u653E\u5BBD\u5230 1\u3002\n#   min_semantic_similarity: 0.5      # \u8BED\u4E49\u817F\u4F59\u5F26\uFF1B0.5 \u53EA\u5BF9 bge-base-zh-v1.5/768\uFF08mean pooling\uFF09\u6807\u5B9A\u8FC7\uFF0C\u6362\u6A21\u578B\u8981\u91CD\u6807\n#   min_fts_terms: 2                  # FTS \u817F\uFF1A\u8FD9\u4E00\u884C\u547D\u4E2D\u51E0\u4E2A\u4E0D\u540C\u7684\u67E5\u8BE2\u8BCD\u5143\uFF08\u62C9\u4E01\u8BCD\u22655\u5B57\u7B26 + CJK 3-gram\uFF09\n#   min_jaccard: 0.2                  # \u5B9E\u4F53\u817F\uFF1A\u951A\u70B9 Jaccard \u7684**\u4E0B\u754C**\uFF1B\u5B9E\u9645\u8BC1\u636E\u95E8\u69DB\u518D\u6309\u951A\u70B9\u7A00\u6709\u5EA6\u52A0\u6743\uFF08\u00A720.19 \u7EED\uFF09\n#   # min_score \u662F\u552F\u4E00\u7684**\u663E\u793A\u5206**\u95E8\u69DB\uFF0C\u4E5F\u662F UI \u663E\u793A\u7684\u90A3\u4E2A score\uFF1A\u5408\u5E76\u6C60\u6309\u6700\u5927\u878D\u5408\u5206\u5F52\u4E00\u5316\u540E\u7684\u503C\uFF0C\n#   # \u662F**\u76F8\u5BF9\u91CF**\u2014\u2014\u540C\u4E00\u4E8B\u5B9E\u5728\u4E0D\u540C\u67E5\u8BE2\u91CC\u53EF\u80FD\u901A\u8FC7\u3001\u4E5F\u53EF\u80FD\u4E0D\u901A\u8FC7\uFF08\u53D6\u51B3\u4E8E\u540C\u4E00\u67E5\u8BE2\u91CC\u6709\u6CA1\u6709\u66F4\u5F3A\u7684\u5019\u9009\uFF09\u3002\n#   # \u5B83\u53EA\u5E94\u7528\u4E00\u6B21\uFF1A\u5728\u5408\u5E76\u540E\u7684\u5019\u9009\u6C60\u4E0A\u3001\u6309 kind/source \u8FC7\u6EE4\u4E0E slice \u4E4B\u524D\uFF08mem_recall \u4E0E UI\n#   # \u56E0\u6B64\u662F\u540C\u4E00\u4E2A\u523B\u5EA6\uFF09\uFF1B0 = \u5173\u95ED\uFF0C\u5206\u6570\u7B49\u4E8E\u95E8\u69DB\u4FDD\u7559\uFF1B\u653E\u5BBD\u6863\u53EA\u964D\u817F\u95E8\u69DB\uFF0C\u4E0D\u964D\u5B83\u3002\n#   # \u26A0\uFE0F \u88AB\u5B83\u4E22\u5F03\u7684\u6761\u76EE\u4E0D\u8FDB `dropped_by_floor`\uFF0C\u56E0\u6B64 UI \u7684\u300C\u4E25\u683C\u95E8\u69DB\u4E22\u5F03\u4E86 N \u6761\u300D**\u4E0D\u542B**\u8FD9\u4E00\u7C7B\n#   #    \uFF08\u4FE1\u5C01\u91CC\u5355\u72EC\u6709 dropped_by_score\uFF1B\u9762\u677F\u8FD9\u4E00\u7248\u8FD8\u6CA1\u6E32\u67D3\u5B83\uFF09\u3002\n#   min_score: 0.5\n#   # P-11 \u4E2D\u6587\u65F6\u95F4\u7A97\u817F\uFF08\u9ED8\u8BA4\u5173\uFF09\uFF1A\u5F00\u542F\u540E\uFF0C\u5E26\u4E2D\u6587\u65F6\u95F4\u8868\u8FBE\u7684\u67E5\u8BE2\uFF08\u4E0A\u4E2A\u6708 / \u6700\u8FD1\u4E09\u5929 / 2026\u5E749\u6708 \u2026\uFF09\n#   # \u4F1A\u989D\u5916\u628A\"\u4E8B\u4EF6\u65F6\u95F4 valid_from \u843D\u5728\u8BE5\u7A97\u53E3\"\u7684\u6D3B\u8DC3\u4E8B\u5B9E\u4F5C\u4E3A\u4E00\u6761\u817F\u53C2\u4E0E\u878D\u5408\u3002\u5B83\u662F**\u52A0\u4E00\u6761\u817F\u3001\u4E0D\u662F\u8FC7\u6EE4\u5668**\uFF1A\n#   # \u53EA\u589E\u52A0\u5019\u9009\uFF0C\u7EDD\u4E0D\u5220\u6389\u8BED\u4E49 / FTS / \u5B9E\u4F53\u817F\u5DF2\u7ECF\u627E\u5230\u7684\u4E8B\u5B9E\uFF1B\u6CA1\u6709\u4E8B\u4EF6\u65F6\u95F4\u7684\u4E8B\u5B9E\u4E0D\u4F5C\u4E3A\u8BE5\u817F\u5019\u9009\uFF0C\n#   # \u4E5F**\u4E0D\u56DE\u9000\u5230\u5199\u5165\u65F6\u95F4 created_at**\u3002\u5B83\u5171\u7528 jaccard \u6743\u91CD\u4F4D\uFF08\u5BF9\u5916\u7684\u4E09\u952E\u6743\u91CD\u4E0D\u53D8\uFF09\u3002\n#   # \u4EC0\u4E48\u65F6\u5019\u8BE5\u5F00\uFF1A\u5148\u7528 mem_admin stats \u770B validity.coverage\uFF08\u6709\u591A\u5C11\u6D3B\u8DC3\u4E8B\u5B9E\u5E26\u4E8B\u4EF6\u65F6\u95F4\uFF09\uFF0C\n#   # \u518D\u7528\u56DE\u5F52\u7F51\u786E\u8BA4\u5B83\u786E\u5B9E\u6539\u5584\u65F6\u95F4\u7C7B\u67E5\u8BE2\u2014\u2014\u8986\u76D6\u7387\u22480 \u65F6\u5B83\u7B49\u4E8E\u6CA1\u5F00\u3002\u5199\u5165\u4E8B\u4EF6\u65F6\u95F4\u7528 mem_remember \u7684 event_date\u3002\n#   time_window: false\n\n# lifecycle:\n#   purge_after_archived_days: 365    # \u5F52\u6863\u4E8B\u5B9E\u7684\u7269\u7406\u6E05\u7406\u7A97\u53E3\uFF08\u6D3B\u8DC3\u65E5\uFF09\n#   contradiction_threshold: 0.6\n\n# trust:\n#   decay_per_day: 0.0055\u2026\n#   presence:\n#     heartbeat_minutes: 60           # \u5E38\u9A7B\u8FDB\u7A0B\u7684\u5FC3\u8DF3\uFF08\u6D3B\u8DC3\u65E5\u65F6\u949F\u4E0E\u751F\u547D\u5468\u671F\u626B\u63CF\uFF09\n\n# tools:                              # \u5916\u90E8\u4E8C\u8FDB\u5236\uFF08pandoc\uFF09\u7684\u53D7\u7BA1\u76EE\u5F55\n#   dir: ''                           # \u7559\u7A7A = \u5BB6\u65CF\u6839 tools\uFF08~/.avantf/env/tools\uFF09\uFF1BAVANTF_TOOLS_DIR \u53EF\u8986\u76D6\n#   auto_install: true\n";
+export declare const DEFAULT_COMMON_CONFIG = "# avantf-mem \u516C\u5171\u914D\u7F6E\uFF08\u5206\u5C42\u7B2C\u2461\u5C42\uFF09\u3002\u8FD9\u91CC\u5168\u662F\u6CE8\u91CA\uFF1A\u5220\u6389/\u7559\u7A7A = \u7528\u5185\u5EFA\u9ED8\u8BA4\uFF0C\u53D6\u6D88\u6CE8\u91CA\u5373\u751F\u6548\u3002\n# \u5206\u5C42\uFF08\u4F4E\u2192\u9AD8\uFF09\uFF1A\u2460 \u5185\u5EFA\u9ED8\u8BA4 \u2192 \u2461 \u672C\u6587\u4EF6 \u2192 \u2462 \u540C\u76EE\u5F55\u7684 memory.yaml\uFF08\u7F3A\u5931=\u4E0D\u8986\u76D6\uFF09\n#               \u2192 \u2463 \u73AF\u5883\u53D8\u91CF \u2192 \u2464 \u63D2\u4EF6/CLI \u663E\u5F0F\u4F20\u53C2\n# \u6240\u6709\u53EF\u7F16\u8F91\u6587\u672C\u90FD\u5728 ~/.avantf \u4E0B\uFF1Aconfigs/*.yaml\uFF08\u672C\u76EE\u5F55\uFF09\u4E0E prompts/*.md\uFF08\u6A21\u578B\u63D0\u793A\u8BCD\uFF09\u3002\n\n# \u6570\u636E\u6839\u4E0D\u5728\u8FD9\u91CC\u914D\uFF1A\u5B83\u7531 \u2463 AVANTF_HOME\uFF08\u5BB6\u65CF\u6839\uFF1A\u540C\u65F6\u51B3\u5B9A\u6570\u636E\u6839\u4E0E models/tools\uFF09\u51B3\u5B9A \u2014\u2014\n# \u53EA\u60F3\u6362\u6570\u636E\u6839\u3001\u4E0D\u642C\u6A21\u578B\u7F13\u5B58\u65F6\u7528 CLI \u7684 \u2464 \u663E\u5F0F\u53C2\u6570 avantf-mem --data-home <path>\uFF08\u63D2\u4EF6\u5219\u662F profile \u7684\n# dataHome\uFF0C\u5C5E \u2461\uFF09\u3002\u672C\u6587\u4EF6\u5C31\u5728\u6570\u636E\u6839\u91CC\u9762\uFF0C\u89E3\u6790\u6839\u65F6\u8FD8\u6CA1\u8BFB\u5230\u5B83\uFF0C\u6240\u4EE5\u5199\u5728\u8FD9\u91CC\u7684 dataHome \u5BF9\u6570\u636E\u6839\u65E0\u6548\uFF08DESIGN \u00A73\uFF09\u3002\n\n# semantic:                           # \u5D4C\u5165\u540E\u7AEF\uFF08\u8BB0\u5FC6\u4E0E\u77E5\u8BC6\u5171\u7528\uFF0C\u8DE8\u5E93\u5206\u6570\u624D\u53EF\u6BD4\uFF09\n#   backend: local_bge\n#   local_model: Xenova/bge-base-zh-v1.5    # \u5FC5\u987B\u662F ONNX \u4ED3\u5E93\n#   dim: 768\n#   auto_download: true\n#   auto_migrate: true                # \u6362\u6A21\u578B/\u5BBD\u5EA6\u540E\u81EA\u52A8\u5206\u6279\u91CD\u7B97\u65E7\u7A7A\u95F4\u7684\u5411\u91CF\uFF08\u9ED8\u8BA4\u5F00\uFF09\uFF1B\u5173\u6389\u53EA\u5269\u542F\u52A8\u544A\u8B66 + vectors --fix\n#   self_heal:                        # \u8BED\u4E49\u4F9D\u8D56\u81EA\u6108\uFF08\u9ED8\u8BA4\u5173\uFF09\uFF1A\u5141\u8BB8\u542F\u52A8\u671F\u5B89\u88C5\u7F3A\u5931\u7684 @huggingface/transformers\n#     enabled: false                  # \u6253\u5F00\u540E\u8D70\u5E95\u5EA7 runtime-deps \u5171\u4EAB\u6839\uFF08base \u2265 0.7.0 / interface v6\uFF09\uFF1B\u5931\u8D25\u53EA\u964D\u7EA7\u5230 FTS+\u5B9E\u4F53\n#                                     # \u88C5\u54EA\u4E2A\u5305 / \u4ECE\u54EA\u88C5 / \u63D0\u793A\u8BF4\u4EC0\u4E48\uFF1A\u89C1\u63D2\u4EF6\u81EA\u5E26\u7684 res/runtime-deps.yaml\uFF08\u968F\u5305\u53D1\u5E03\uFF09\n#   native_self_heal:                 # \u539F\u751F\u53EF\u9009\u4F9D\u8D56\u81EA\u6108\uFF1Anodejieba / hnswlib-node\uFF08\u9ED8\u8BA4\u5173\uFF09\n#     enabled: false                  # \u88C5\u54EA\u4E2A\u5305\u3001\u4ECE\u54EA\u88C5\u3001\u63D0\u793A\u8BF4\u4EC0\u4E48\uFF0C\u90FD\u7531\u63D2\u4EF6\u81EA\u5E26\u7684 res/runtime-deps.yaml \u51B3\u5B9A\n#   \u26A0\uFE0F cache_dir / mirror \u7531\u5BB6\u65CF\u5E95\u5EA7 @avantf/dsh-plugin-base \u7BA1\u7406\uFF1A\u5199\u5728\u8FD9\u91CC\u4F1A\u88AB\u5FFD\u7565\u5E76\u544A\u8B66\u3002\n#      \u7F13\u5B58\u76EE\u5F55\u7528\u73AF\u5883\u53D8\u91CF AVANTF_MEM_MODEL_CACHE\uFF0C\u955C\u50CF\u7528 AVANTF_MEM_MODEL_MIRROR\uFF08\u6216 HF_ENDPOINT\uFF09\u3002\n\n# vectorStore:\n#   backend: auto                     # auto = \u8D8A\u8FC7\u9608\u503C\u81EA\u52A8\u4ECE local_numpy \u8FC1\u5230 hnswlib\n#   auto_thresholds:\n#     hnswlib: 2000\n#   hnswlib_ef_search: 256            # ANN \u7684\u53EC\u56DE/\u901F\u5EA6\u65CB\u94AE\uFF0C\u8BED\u6599\u53D8\u5927\u5148\u8C03\u5B83\n\n# retriever:                          # \u4E09\u6761\u68C0\u7D22\u817F\u5728\u878D\u5408\u91CC\u7684\u6743\u91CD\u4E0E\"\u76F8\u5173\u6027\u95E8\u69DB\"\n#   weight_semantic: 0.55\n#   weight_fts: 0.30\n#   weight_jaccard: 0.15\n#   # \u817F\u95E8\u69DB\u662F\u7EDD\u5BF9\u95E8\u69DB\uFF0C\u6253\u5728\u6BCF\u6761\u817F\u7684\u539F\u59CB\u5206\u4E0A\u3001fuse() \u4E4B\u524D\uFF1B0 = \u5173\u95ED\u8BE5\u95E8\u69DB\uFF0C\u5206\u6570\u7B49\u4E8E\u95E8\u69DB\u4FDD\u7559\u3002\n#   # \u8BED\u4E49\u540E\u7AEF\u4E0D\u53EF\u7528\u65F6 min_fts_terms \u7684\u751F\u6548\u503C\u653E\u5BBD\u5230 1\u3002\n#   min_semantic_similarity: 0.5      # \u8BED\u4E49\u817F\u4F59\u5F26\uFF1B0.5 \u53EA\u5BF9 bge-base-zh-v1.5/768\uFF08mean pooling\uFF09\u6807\u5B9A\u8FC7\uFF0C\u6362\u6A21\u578B\u8981\u91CD\u6807\n#   min_fts_terms: 2                  # FTS \u817F\uFF1A\u8FD9\u4E00\u884C\u547D\u4E2D\u51E0\u4E2A\u4E0D\u540C\u7684\u67E5\u8BE2\u8BCD\u5143\uFF08\u62C9\u4E01\u8BCD\u22655\u5B57\u7B26 + CJK 3-gram\uFF09\n#   min_jaccard: 0.2                  # \u5B9E\u4F53\u817F\uFF1A\u951A\u70B9 Jaccard \u7684**\u4E0B\u754C**\uFF1B\u5B9E\u9645\u8BC1\u636E\u95E8\u69DB\u518D\u6309\u951A\u70B9\u7A00\u6709\u5EA6\u52A0\u6743\uFF08\u00A720.19 \u7EED\uFF09\n#   # min_score \u662F\u552F\u4E00\u7684**\u663E\u793A\u5206**\u95E8\u69DB\uFF0C\u4E5F\u662F UI \u663E\u793A\u7684\u90A3\u4E2A score\uFF1A\u5408\u5E76\u6C60\u6309\u6700\u5927\u878D\u5408\u5206\u5F52\u4E00\u5316\u540E\u7684\u503C\uFF0C\n#   # \u662F**\u76F8\u5BF9\u91CF**\u2014\u2014\u540C\u4E00\u4E8B\u5B9E\u5728\u4E0D\u540C\u67E5\u8BE2\u91CC\u53EF\u80FD\u901A\u8FC7\u3001\u4E5F\u53EF\u80FD\u4E0D\u901A\u8FC7\uFF08\u53D6\u51B3\u4E8E\u540C\u4E00\u67E5\u8BE2\u91CC\u6709\u6CA1\u6709\u66F4\u5F3A\u7684\u5019\u9009\uFF09\u3002\n#   # \u5B83\u53EA\u5E94\u7528\u4E00\u6B21\uFF1A\u5728\u5408\u5E76\u540E\u7684\u5019\u9009\u6C60\u4E0A\u3001\u6309 kind/source \u8FC7\u6EE4\u4E0E slice \u4E4B\u524D\uFF08mem_recall \u4E0E UI\n#   # \u56E0\u6B64\u662F\u540C\u4E00\u4E2A\u523B\u5EA6\uFF09\uFF1B0 = \u5173\u95ED\uFF0C\u5206\u6570\u7B49\u4E8E\u95E8\u69DB\u4FDD\u7559\uFF1B\u653E\u5BBD\u6863\u53EA\u964D\u817F\u95E8\u69DB\uFF0C\u4E0D\u964D\u5B83\u3002\n#   # \u26A0\uFE0F \u88AB\u5B83\u4E22\u5F03\u7684\u6761\u76EE\u4E0D\u8FDB `dropped_by_floor`\uFF0C\u56E0\u6B64 UI \u7684\u300C\u4E25\u683C\u95E8\u69DB\u4E22\u5F03\u4E86 N \u6761\u300D**\u4E0D\u542B**\u8FD9\u4E00\u7C7B\n#   #    \uFF08\u4FE1\u5C01\u91CC\u5355\u72EC\u6709 dropped_by_score\uFF1B\u9762\u677F\u8FD9\u4E00\u7248\u8FD8\u6CA1\u6E32\u67D3\u5B83\uFF09\u3002\n#   min_score: 0.5\n#   # P-11 \u4E2D\u6587\u65F6\u95F4\u7A97\u817F\uFF08\u9ED8\u8BA4\u5173\uFF09\uFF1A\u5F00\u542F\u540E\uFF0C\u5E26\u4E2D\u6587\u65F6\u95F4\u8868\u8FBE\u7684\u67E5\u8BE2\uFF08\u4E0A\u4E2A\u6708 / \u6700\u8FD1\u4E09\u5929 / 2026\u5E749\u6708 \u2026\uFF09\n#   # \u4F1A\u989D\u5916\u628A\"\u4E8B\u4EF6\u65F6\u95F4 valid_from \u843D\u5728\u8BE5\u7A97\u53E3\"\u7684\u6D3B\u8DC3\u4E8B\u5B9E\u4F5C\u4E3A\u4E00\u6761\u817F\u53C2\u4E0E\u878D\u5408\u3002\u5B83\u662F**\u52A0\u4E00\u6761\u817F\u3001\u4E0D\u662F\u8FC7\u6EE4\u5668**\uFF1A\n#   # \u53EA\u589E\u52A0\u5019\u9009\uFF0C\u7EDD\u4E0D\u5220\u6389\u8BED\u4E49 / FTS / \u5B9E\u4F53\u817F\u5DF2\u7ECF\u627E\u5230\u7684\u4E8B\u5B9E\uFF1B\u6CA1\u6709\u4E8B\u4EF6\u65F6\u95F4\u7684\u4E8B\u5B9E\u4E0D\u4F5C\u4E3A\u8BE5\u817F\u5019\u9009\uFF0C\n#   # \u4E5F**\u4E0D\u56DE\u9000\u5230\u5199\u5165\u65F6\u95F4 created_at**\u3002\u5B83\u5171\u7528 jaccard \u6743\u91CD\u4F4D\uFF08\u5BF9\u5916\u7684\u4E09\u952E\u6743\u91CD\u4E0D\u53D8\uFF09\u3002\n#   # \u4EC0\u4E48\u65F6\u5019\u8BE5\u5F00\uFF1A\u5148\u7528 mem_admin stats \u770B validity.coverage\uFF08\u6709\u591A\u5C11\u6D3B\u8DC3\u4E8B\u5B9E\u5E26\u4E8B\u4EF6\u65F6\u95F4\uFF09\uFF0C\n#   # \u518D\u7528\u56DE\u5F52\u7F51\u786E\u8BA4\u5B83\u786E\u5B9E\u6539\u5584\u65F6\u95F4\u7C7B\u67E5\u8BE2\u2014\u2014\u8986\u76D6\u7387\u22480 \u65F6\u5B83\u7B49\u4E8E\u6CA1\u5F00\u3002\u5199\u5165\u4E8B\u4EF6\u65F6\u95F4\u7528 mem_remember \u7684 event_date\u3002\n#   time_window: false\n\n# lifecycle:\n#   purge_after_archived_days: 365    # \u5F52\u6863\u4E8B\u5B9E\u7684\u7269\u7406\u6E05\u7406\u7A97\u53E3\uFF08\u6D3B\u8DC3\u65E5\uFF09\n#   contradiction_threshold: 0.6\n\n# trust:                              # \u4FE1\u4EFB\u4E0E\u9057\u5FD8\uFF1A\u65CB\u94AE\u662F\u300C\u5929\u6570 + \u5F62\u72B6\u300D\uFF0C\u4E0D\u662F\u659C\u7387\n#   base_lifetime_days: 90            # \u951A\u70B9\uFF1A0.5 \u8D77\u70B9 \u2192 0 \u7684\u6D3B\u8DC3\u65E5\u6570\uFF08\u65B0\u4E8B\u5B9E\u4E0D\u88AB\u53EC\u56DE\u65F6\u7684\u5BFF\u547D\uFF09\n#   max_retention_days: 174           # \u53EC\u56DE\u52A0\u5F3A\u6700\u591A\u80FD\u6362\u6765\u7684\u6D3B\u8DC3\u65E5\u6570\uFF1Bceiling \u7531\u5B83\u53CD\u89E3\uFF08accelerating \u4E0B \u2248 0.7492\uFF09\n#   decay_shape: accelerating         # accelerating\uFF08\u9ED8\u8BA4\uFF09| linear\uFF08\u56DE\u6EDA\u6863\uFF1A\u914D 153 \u65F6 ceiling \u56DE\u5230 0.85\uFF09\n#   decay_curvature: 0.05             # accelerating \u7684\u4E0B\u9650\u9879 a\uFF0C\u5408\u6CD5\u533A\u95F4 (0, 0.5]\uFF1Blinear \u4E0B\u4E0D\u53C2\u4E0E\n#   recall_gain_below_base: 0.1       # \u4F4E\u4E8E\u57FA\u51C6 0.5 \u65F6\u6BCF\u6B21\u53EC\u56DE\u52A0\u591A\u5C11\uFF08\u5C01\u9876\u57FA\u51C6\uFF1A0.05 \u8D77 5 \u6B21\u5230 0.5\uFF09\n#   recall_gain_above_base: 0.01      # \u9AD8\u4E8E\u57FA\u51C6 0.5 \u65F6\u6BCF\u6B21\u53EC\u56DE\u52A0\u591A\u5C11\uFF08\u5C01\u9876\u4E0A\u9762\u53CD\u89E3\u51FA\u7684 ceiling\uFF09\n#   presence:\n#     heartbeat_minutes: 60           # \u5E38\u9A7B\u8FDB\u7A0B\u7684\u5FC3\u8DF3\uFF08\u6D3B\u8DC3\u65E5\u65F6\u949F\u4E0E\u751F\u547D\u5468\u671F\u626B\u63CF\uFF09\n\n# tools:                              # \u5916\u90E8\u4E8C\u8FDB\u5236\uFF08pandoc\uFF09\u7684\u53D7\u7BA1\u76EE\u5F55\n#   dir: ''                           # \u7559\u7A7A = \u5BB6\u65CF\u6839 tools\uFF08~/.avantf/env/tools\uFF09\uFF1BAVANTF_TOOLS_DIR \u53EF\u8986\u76D6\n#   auto_install: true\n";
 /**
  * Ensure the common config exists with content, and hand back the path either way.
  *

package/lib/engine/mem/db/dao/facts.d.ts

@@ -2,12 +2,13 @@
  * `facts` — the memory store's main table.
  *
  * Started with the READ paths the detector, the diagnostics and the clock self-heal need;
- * the write path (`persistFact`, archive/restore/feedback, vector repair) moves here next, so
+ * the write path (`persistFact`, archive/restore, vector repair) moves here next, so
  * the store ends up holding business rules only and no SQL. See DESIGN §19.
  */
 import type { Db } from '../port.js';
 import { type TimeRange, type TimeSql } from '../../store/time_filter.js';
 import type { MemoryKind } from '../../../mem-contract/index.js';
+import { type TrustCurve } from '../../../mem-contract/index.js';
 /**
  * Every `facts` column EXCEPT the two BLOBs (`hrr_vector` ~8 KB, `semantic_vector` ~2 KB per row)
  * and the two DEPRECATED provenance columns (`mirror_source` / `mirror_target`, see below).
@@ -28,7 +29,7 @@ import type { MemoryKind } from '../../../mem-contract/index.js';
  * `test/db_lifecycle.spec.ts` asserts this list against `PRAGMA table_info(facts)` MINUS those
  * two deprecations, so a new column fails a test instead of silently vanishing from these reads.
  */
-export declare const FACT_COLUMNS_NO_BLOB = "fact_id, content, kind, title, tags, trust_score, settle_clock,\n    pinned, pinned_at, bonus_count, bonus_window_at, last_reinforced_at, archived_clock,\n    retrieval_count, helpful_count, last_retrieved_at, embedding_model, vector_store, status,\n    supersedes_id, entities_version, conflict_checked, archived_at, archive_reason, ttl_days,\n    valid_from, valid_to, valid_from_ms, valid_to_ms, assert_count, created_at, updated_at";
+export declare const FACT_COLUMNS_NO_BLOB = "fact_id, content, kind, title, tags, trust_score, settle_clock,\n    pinned, pinned_at, bonus_count, bonus_window_at, last_reinforced_at, archived_clock,\n    retrieval_count, helpful_count, last_retrieved_at, embedding_model, vector_store, status,\n    supersedes_id, entities_version, conflict_checked, archived_at, archive_reason, ttl_days,\n    valid_from, valid_from_ms, assert_count, created_at, updated_at";
 export declare const FTS_SEARCH_SQL: string;
 /**
  * {@link FTS_SEARCH_SQL} with the P-08 source predicate, as a SEPARATE statement rather than one
@@ -191,7 +192,6 @@ export declare class FactsDao {
         created_at: string;
         updated_at: string | null;
         valid_from: string | null;
-        valid_to: string | null;
         title: string | null;
     }>;
     /** Active rows that carry a persisted vector (index classification). */
@@ -233,14 +233,16 @@ export declare class FactsDao {
      * `createdAt` is named EXPLICITLY rather than left to the column DEFAULT, because a
      * superseding revision must INHERIT the archived row's `created_at` (the memory's first
      * assertion date, distinct from when its text was rewritten). `updated_at` and
-     * `last_retrieved_at` are stamped `CURRENT_TIMESTAMP` in the same statement: a revision
-     * whose `created_at` is old must not be judged idle by the next tick, where "idle" reads
-     * `COALESCE(last_retrieved_at, created_at)`.
+     * `last_retrieved_at` are stamped `CURRENT_TIMESTAMP` in the same statement, so a revision
+     * carries a fresh "last used" observation like the row it replaces (that column no longer
+     * feeds any decision — see TRUST_MODEL.md §2.6).
+     *
+     * `ttl_days` is NOT named: TTL is gone (v2), the column keeps its DEFAULT 0 and nothing
+     * reads or writes it any more.
      */
     insertRevision(v: {
         content: string;
         kind: MemoryKind;
-        ttlDays: number;
         supersedesId: number | null;
         hrr: Uint8Array;
         trust: number;
@@ -256,37 +258,32 @@ export declare class FactsDao {
          */
         title?: string | null;
         /**
-         * P-13: the caller's event time / known end, written straight onto the new row. `null` means
-         * "unknown" and is what an omitted argument leaves (the column has no default on purpose).
+         * P-13: the caller's event time, written straight onto the new row. `null` means "unknown" and
+         * is what an omitted argument leaves (the column has no default on purpose).
          * `assert_count` is deliberately NOT named: the column default (1) is the semantics — "this
          * content has been asserted once" — and naming it here would be a second place to keep in step.
          */
         validFrom?: string | null;
-        validTo?: string | null;
         /**
-         * The INSTANTS the two text bounds name (`valid_from_ms`/`valid_to_ms`).
+         * The INSTANT the text bound names (`valid_from_ms`).
          *
          * Written in the same statement as the text, never computed later: the text is what a reader
          * displays and the epoch is what an `event` window compares, so writing them apart would let the
          * two describe different times. `null` = "no event time" (the axis then excludes the row, D5).
          */
         validFromMs?: number | null;
-        validToMs?: number | null;
     }): {
         changes: number;
         lastInsertRowid: number | bigint;
     };
     /**
-     * P-10: land an explicitly given validity on a row that already exists (a duplicate `add` whose
-     * caller named `event_date` / `valid_until`). Omitted arguments keep what the row has, exactly
-     * like `kind`/`ttl_days` (see `add`'s doc).
+     * P-10: land an explicitly given event time on a row that already exists (a duplicate `add`
+     * whose caller named `event_date`). An omitted argument keeps what the row has, exactly like
+     * `kind` (see `add`'s doc).
      */
     applyValidity(factId: number, validFrom: {
         text: string;
         ms: number;
-    } | undefined, validTo: {
-        text: string;
-        ms: number;
     } | undefined): void;
     /** P-10: the row's assertion counter (`1` when the column is somehow NULL on a legacy row). */
     assertCount(factId: number): number;
@@ -299,12 +296,6 @@ export declare class FactsDao {
      * two processes cannot interleave between them.
      */
     incrementAssertCount(factId: number): number;
-    /**
-     * P-07 audit: stamp `valid_to` on a row that is leaving the active corpus (supersede / a
-     * contradiction verdict). `COALESCE` keeps an end the caller already declared (`valid_until`):
-     * overwriting it with the archival instant would replace a real answer with an administrative one.
-     */
-    markValidTo(factId: number, at: string, atMs?: number | null): void;
     /**
      * P-07: "who superseded this fact", derived from the existing `supersedes_id` link — no
      * redundant column. `MIN` is deterministic when several revisions named the same predecessor
@@ -418,10 +409,15 @@ export declare class FactsDao {
      * reported zero behind. Same rule as {@link setSemanticVector}: what the check SAW changed.
      */
     requeueConflictCheck(ids: readonly number[]): number;
-    /** Revive an archived row (R18/R19: refresh the idle clock, clear the archive bookkeeping). */
-    revive(factId: number, kind: MemoryKind, ttlDays: number, trust: number, clock: number): number;
-    /** Land explicit kind/TTL on a row that already exists (pure duplicate). */
-    applyValues(factId: number, kind: MemoryKind, ttlDays: number): void;
+    /**
+     * Revive an archived row (R19: clear the archive bookkeeping / refresh `last_retrieved_at`).
+     *
+     * `ttl_days` is deliberately NOT named any more: an omitted column keeps whatever the row has
+     * (the old writing value is preserved as data), and there is no TTL left to inherit.
+     */
+    revive(factId: number, kind: MemoryKind, trust: number, clock: number): number;
+    /** Land an explicit kind on a row that already exists (pure duplicate). */
+    applyValues(factId: number, kind: MemoryKind): void;
     /**
      * Land a title on a row that already exists — the ONE write behind every "backfill" path
      * (JOURNAL_TITLE_SEARCH §11.2/§11.3): a duplicate `add` that names a title for an existing
@@ -478,22 +474,14 @@ export declare class FactsDao {
     archiveSuperseded(factId: number, clock: number): number;
     linkSupersede(factId: number, supersedesId: number): void;
     /**
-     * Restore an archived fact, settling its trust and refreshing the idle clock (spec §2.6).
+     * Restore an archived fact, settling its trust and refreshing `last_retrieved_at` (spec §2.6).
      *
      * `AND status = 'archived'` is load-bearing, like the guard on every sibling above: this UPDATE
      * clears the archive bookkeeping and refreshes `last_retrieved_at`, so ungated it would take an
-     * ACTIVE row and (a) push its idle clock forward — silently extending the life of a fact the next
-     * tick was about to re-archive — and (b) reset `trust_score` to the settled value it computed. It
-     * returned `1` either way, so the caller could not tell that a row it never asked about had moved.
+     * ACTIVE row and reset `trust_score` to the settled value it computed. It returned `1` either
+     * way, so the caller could not tell that a row it never asked about had moved.
      */
     restore(factId: number, trust: number, clock: number): number;
-    bumpHelpful(factId: number, delta: number): void;
-    /** Feedback outcome: pin at the permanent threshold (trust snaps to 1). */
-    pinOutcome(factId: number, clock: number, bonusCount: number, windowAt: string): void;
-    /** Feedback outcome: the forget line was reached — archive in the same statement. */
-    forgetOutcome(factId: number, trust: number, clock: number, bonusCount: number, windowAt: string): void;
-    /** Feedback outcome: reinforced (or decayed) but still active. */
-    reinforceOutcome(factId: number, trust: number, clock: number, bonusCount: number, windowAt: string): void;
     pin(factId: number, clock: number): number;
     unpin(factId: number, clock: number): number;
     /**
@@ -534,13 +522,24 @@ export declare class FactsDao {
     /** ACTIVE and permanent — pinned facts are exempt from decay (the report's `pinned`). */
     countPinnedActive(): number;
     /**
-     * ACTIVE facts whose decayed trust would reach zero within `withinDays` ACTIVE days —
-     * i.e. `trust_score - step × (clock - settle_clock) <= step × withinDays`.
+     * ACTIVE, unpinned facts whose decayed trust reaches zero within `withinDays` ACTIVE days.
+     *
+     * EXACT for every shape, not a linear approximation: the predicate is
+     * `trustAfterDays(eff(now), withinDays, curve) <= 0`, which is the same question the tick asks
+     * when it archives a row. The caller passes the THRESHOLD (`ceilingForDays(withinDays, curve)`)
+     * because "days until zero" is no longer `trust ÷ slope` under `decay_shape: 'accelerating'`;
+     * a slope-based SQL predicate under-reported every fact in `(slope × 7, ceilingForDays(7)]`
+     * (0.0277 … 0.0515 at the shipped defaults) once accelerating became the default.
+     *
+     * COST: one row per active unpinned fact, evaluated in JS — the predicate needs `exp`, which the
+     * SQL layer cannot express portably. `trust_diagnose` is an operator-only diagnostic and the
+     * active set is what `mem_admin list` already walks; if it ever shows up in a profile, prefilter
+     * with an index-friendly bound rather than going back to a slope approximation.
      */
     countForgettingWithin(p: {
-        step: number;
+        threshold: number;
         clock: number;
-        withinDays: number;
+        curve: TrustCurve;
     }): number;
     /** Facts with a still-live (calendar 24h) reinforcement window — the per-fact quota. */
     /**
@@ -555,18 +554,15 @@ export declare class FactsDao {
         count: number;
         granted: number;
     };
-    /** ACTIVE, unpinned facts unused for `days` CALENDAR days (the idle-archival fallback). */
-    countIdleCandidates(days: number): number;
     /**
-     * Rows still due for ②③④ after a budgeted tick — what the NEXT pass will archive.
+     * Rows still due for ② after a budgeted tick — what the NEXT pass will archive.
      *
-     * One statement over the three predicates (they are alternatives, and the sets are disjoint:
-     * a row has either a TTL, a forgotten trust score, or an idle clock). Only called when a step
-     * actually filled its budget, so the common tick pays nothing for it.
+     * The same predicate the archival statement runs (`FORGET_PREDICATE`), so "backlog" and "what
+     * `archiveForgotten` will do next" cannot disagree. Only called when ② actually filled its
+     * budget, so the common tick pays nothing for it.
      */
     countArchiveBacklog(p: {
         forgetThreshold: number;
-        idleCalendarDays: number;
     }): number;
     /**
      * Drop unusable (stale-dim) vectors so a re-encode can replace them — and re-queue the same
@@ -753,35 +749,50 @@ export declare class FactsDao {
      * row, and `settle_clock < c` is a seek + range scan of exactly the pending rows.
      */
     private static readonly SETTLE_PREDICATE;
-    /** ① materialize decay, bounded to `budget` rows. */
+    /**
+     * The ONE forgetting predicate, shared by the archival statement and its backlog count.
+     *
+     * Kept as a constant for the same reason as {@link SETTLE_PREDICATE}: the count answers "how many
+     * will the next pass archive", so it must be the same WHERE body the archival itself runs —
+     * otherwise `archived_deferred` and the actual sweep would drift apart.
+     */
+    private static readonly FORGET_PREDICATE;
+    /**
+     * ① materialize decay, bounded to `budget` rows.
+     *
+     * PER ROW, through `trustAfterDays` — not one UPDATE with an inline `trust_score − step·Δ`. The
+     * formula lives in `contract/src/trust_curve.ts` and nowhere else; the `linear` branch of that
+     * function is bit-identical to the statement this replaced (`T − days·slope`, the same two
+     * operations in the same order), so P3's equivalent tier materializes exactly the same numbers.
+     *
+     * The SELECT is the old UPDATE's WHERE body with the old subquery's ORDER/LIMIT, so the row SET is
+     * the same one the statement would have touched (and `settled` still counts rows matched, not rows
+     * whose value happened to move).
+     *
+     * COST: one `UPDATE` PER ROW inside the tick's single `IMMEDIATE` transaction (the accelerating
+     * formula needs `exp`, which SQL cannot express here, and a second SQL implementation would
+     * drift). That is why every caller is budgeted by `trust.tick_max_facts` (5000 by default) and
+     * `admin maintenance` is the only unbudgeted pass — measured ~22 ms per 5000 rows, inside the
+     * tick's budget; it is a deliberate trade, not a regression.
+     */
     settleBudgeted(p: {
-        step: number;
+        curve: TrustCurve;
         clock: number;
         budget: number;
     }): number;
     /** ① materialize decay for every pending row (no budget). */
     settleAll(p: {
-        step: number;
+        curve: TrustCurve;
         clock: number;
     }): number;
+    /** The shared per-row write of ①: settle the curve at `clock`, then stamp `settle_clock`. */
+    private settleRows;
     /** Rows still awaiting ① (the budget ran out). */
     countPendingSettle(p: {
         clock: number;
     }): number;
     /**
-     * ② calendar TTL — explicit instruction, so `pinned` is NOT exempt.
-     *
-     * `budget` (0 = none) caps how many rows ONE tick may archive: the tick is a single IMMEDIATE
-     * transaction shared by several processes, so an unbudgeted pass over a large backlog held the
-     * write lock for as long as it took (measured 14400 rows in one tick). The remainder stays due
-     * and is reported as a deferred count, then archived by the next tick.
-     */
-    archiveExpiredByTtl(p: {
-        clock: number;
-        budget?: number;
-    }): number[];
-    /**
-     * ③ trust-driven forgetting (① already clamped trust to the threshold).
+     * ② trust-driven forgetting (① already clamped trust to the threshold).
      *
      * Sargable as written (`status`/`pinned` equality + `trust_score <= ?`), and served by
      * `idx_facts_forget(status, pinned, trust_score)`: before that index this statement read every
@@ -793,20 +804,7 @@ export declare class FactsDao {
         budget?: number;
     }): number[];
     /**
-     * ④ calendar fallback: never touched for `idle_calendar_days`.
-     *
-     * The comparison is written as `<expression> < julianday('now', :modifier)` — the same
-     * expression `idx_facts_idle_cutoff` indexes — so it is a range seek. The old form
-     * (`julianday('now') - <expression> > :days`) called `julianday` on EVERY active row and could
-     * not use any index (measured 33–212 ms at 180k).
-     */
-    archiveIdle(p: {
-        clock: number;
-        idleCalendarDays: number;
-        budget?: number;
-    }): number[];
-    /**
-     * ⑤ physical delete of archived rows past the retention window.
+     * ③ physical delete of archived rows past the retention window.
      *
      * TWO statements in this order, sharing one predicate:
      *
@@ -815,7 +813,7 @@ export declare class FactsDao {
      *      DELETE below failed with `SQLITE_CONSTRAINT_FOREIGNKEY` whenever a revision chain
      *      crossed `purge_after_archived_days`. Because the whole tick is ONE transaction and it
      *      runs from the store's constructor, that failure did not merely skip the purge: it rolled
-     *      back settle/TTL/idle with it and left the process unable to start, permanently.
+     *      back settle/forget with it and left the process unable to start, permanently.
      *   2. delete them.
      *
      * The predicate is built once and interpolated into both statements, so "which rows are
@@ -832,7 +830,7 @@ export declare class FactsDao {
     /** The two mutually exclusive purge branches (see `purgeArchived` for why they are split). */
     private static purgeBranches;
     private static purgeParams;
-    /** Archived rows still due for ⑤ after a budgeted pass (0 when the pass finished them). */
+    /** Archived rows still due for ③ after a budgeted pass (0 when the pass finished them). */
     countPurgeBacklog(p: {
         clock: number;
         enabled: number;

package/lib/engine/mem/dbdrivers/sqlite/facts.d.ts

@@ -8,7 +8,7 @@
  *
  * @module dbdrivers/sqlite/facts
  */
-import type { MemoryKind } from '../../../mem-contract/index.js';
+import type { MemoryKind, TrustCurve } from '../../../mem-contract/index.js';
 import { type TimeRange } from '../../store/time_filter.js';
 import type { FactHitMeta, FactRow, FactVectorRow, FactVectorSpaceRow, HrrVectorRow, InsertRevisionOutcome, MemoryRepository } from '../../interfaces/repositories.js';
 import type { FactsDao } from './dao/index.js';
@@ -31,14 +31,12 @@ export declare class SqliteMemoryRepository implements MemoryRepository {
     countInStatus(status: string, kind?: MemoryKind, source?: string): number;
     countActiveWithValidFrom(): number;
     countForgettingWithin(p: {
-        step: number;
+        threshold: number;
         clock: number;
-        withinDays: number;
+        curve: TrustCurve;
     }): number;
-    countIdleCandidates(days: number): number;
     countArchiveBacklog(p: {
         forgetThreshold: number;
-        idleCalendarDays: number;
     }): number;
     countPendingConflicts(): number;
     countStaleEntities(version: number): number;
@@ -86,25 +84,20 @@ export declare class SqliteMemoryRepository implements MemoryRepository {
     hrrRowsForFacts(ids: readonly number[], kind?: MemoryKind, source?: string): HrrVectorRow[];
     activeIdsIn(ids: readonly number[], kind?: MemoryKind, source?: string, time?: TimeRange): number[];
     insertRevision(v: Parameters<FactsDao['insertRevision']>[0]): InsertRevisionOutcome;
-    applyValidity(factId: number, validFrom: Parameters<FactsDao['applyValidity']>[1], validTo: Parameters<FactsDao['applyValidity']>[2]): void;
-    applyValues(factId: number, kind: MemoryKind, ttlDays: number): void;
+    applyValidity(factId: number, validFrom: Parameters<FactsDao['applyValidity']>[1]): void;
+    applyValues(factId: number, kind: MemoryKind): void;
     setTitle(factId: number, title: string): void;
     insertTitleAlias(factId: number, title: string): void;
     copyTitleAliases(fromFactId: number, toFactId: number, currentTitle: string): void;
     dropTitleAlias(factId: number, title: string): void;
     incrementAssertCount(factId: number): number;
-    markValidTo(factId: number, at: string, atMs?: number | null): void;
     linkSupersede(factId: number, supersedesId: number): void;
     archiveSuperseded(factId: number, clock: number): number;
-    revive(factId: number, kind: MemoryKind, ttlDays: number, trust: number, clock: number): number;
+    revive(factId: number, kind: MemoryKind, trust: number, clock: number): number;
     archive(factId: number, clock: number, reason: string): number;
     restore(factId: number, trust: number, clock: number): number;
-    bumpHelpful(factId: number, delta: number): void;
     pin(factId: number, clock: number): number;
     unpin(factId: number, clock: number): number;
-    pinOutcome(factId: number, clock: number, bonusCount: number, windowAt: string): void;
-    forgetOutcome(factId: number, trust: number, clock: number, bonusCount: number, windowAt: string): void;
-    reinforceOutcome(factId: number, trust: number, clock: number, bonusCount: number, windowAt: string): void;
     touchUsage(ids: readonly number[]): void;
     settleTrust(factId: number, trust: number, clock: number): void;
     reinforce(factId: number, trust: number, clock: number, bonusCount: number, windowAt: string): void;

package/lib/engine/mem/defaults.d.ts

@@ -5,7 +5,10 @@
  * They are the ENGINE's consumption points of numbers the CONTRACT documents:
  *
  *   - `DEFAULT_SEARCH_LIMIT` — `query`'s own input schema carries `.default(10)`
- *     (`contract/src/tools.ts`), and the recall actions' descriptions say "默认 10"; the recall union
+ *     (`contract/src/tools.ts`), and the recall actions' descriptions say "默认 10" for the
+ *     exact/facts pages and "默认 50" for a pure time window — the window's page is
+ *     `TIME_DEFAULT_LIMIT`, which `timePage` applies itself instead of this fallback (see
+ *     `store/recall_policy.ts`); the recall union
  *     itself is `.optional()`, so the engine is what applies it. It reaches `hybridSearch` (a
  *     non-finite limit).
  *   - `DEFAULT_LIST_LIMIT` — the documented page for `admin list` ("默认 50").

package/lib/engine/mem/entities/extract.d.ts

@@ -1,17 +1,3 @@
-/**
- * Entity extraction: POS tagging and the noun-ish names that become `entities` rows.
- *
- * Uses nodejieba (optional dependency) for POS; degrades gracefully to a character/regex fallback
- * when unavailable, exactly like the `jieba_available()` guard.
- *
- * Note: nodejieba's `tag()` returns `{ word, tag }` objects, and its POS flag set
- * differs from Python jieba (e.g. proper nouns → `nr`, 名动词 → `vn`).
- *
- * WHAT THIS MODULE IS NOT. It owns what is an entity NAME — nothing about relations. The relation
- * half (SVO candidate triples, explicit patterns, the name/statement/confidence gates and the
- * predicate vocabulary) lives in `relations/`; the two halves share exactly one thing, the tagging
- * pass ({@link tagText}), so a write pays for the dictionary once and drives both.
- */
 export interface ExtractedEntity {
     name: string;
     type: string;
@@ -22,6 +8,16 @@ export interface PosToken {
     word: string;
     tag: string;
 }
+/**
+ * Point the optional tokenizer at a shared module root (the base `runtime-deps` handle's directory).
+ *
+ * The memo follows the ROOT: changing it forgets whatever the previous root produced, so the next
+ * load resolves from the new one — that is the whole point of setting a root. The cost is at most one
+ * extra dictionary parse (~1 s, once) when a root arrives after a lazily loaded copy from this tree;
+ * Node's own module cache keeps the import itself cheap. The plugin only sets this once, when its
+ * native self-heal item settles.
+ */
+export declare function useTokenizerModuleDir(dir: string | undefined): void;
 /**
  * Attempts made so far — the mechanism, not the wall time.
  *
@@ -32,6 +28,30 @@ export interface PosToken {
  */
 export declare function jiebaLoadAttempts(): number;
 export declare function jiebaAvailable(): Promise<boolean>;
+/**
+ * What the tokenizer's load can answer, including WHY it is unavailable — the observation a startup
+ * warm reports (`modelBootstrap.ts`).
+ *
+ * `attemptedRoot` vs `root` is the part that makes a failure readable: a probe that ran with no
+ * provisioned root in force (`attemptedRoot === undefined`) reports "this tree has no loadable copy",
+ * while a root that arrived afterwards (`root !== undefined`) is exactly the recovery
+ * {@link useTokenizerModuleDir} promises — and the two produce a different log line, instead of one
+ * "unavailable" that a later "ready" would contradict.
+ */
+export interface JiebaStatus {
+    /** Whether `tag()` is usable now (the memoized load succeeded). */
+    readonly available: boolean;
+    /** Parses actually run in this process. */
+    readonly attempts: number;
+    /** The root the last attempt resolved from (`undefined` = this tree). */
+    readonly attemptedRoot: string | undefined;
+    /** The provisioned root in force NOW (it may have arrived after the attempt). */
+    readonly root: string | undefined;
+    /** Why the last attempt failed (`undefined` when it succeeded, or when nothing was attempted). */
+    readonly error: string | undefined;
+}
+/** The status of the memoized load, starting one only when none has run yet. */
+export declare function jiebaProbe(): Promise<JiebaStatus>;
 /**
  * Version of the ENTITY extraction rules below (accepted tags, the regex fallback).
  *

package/lib/engine/mem/facts_io.d.ts

@@ -181,6 +181,10 @@ export interface MetadataDropped {
     helpful_count: number;
     pinned: number;
     supersedes: number;
+    /** v2: the imported row carried a `ttl_days` value; TTL is gone, so it is not written back. */
+    ttl_days: number;
+    /** v2: the imported row carried a `valid_to` value; the known end is gone. */
+    valid_to: number;
 }
 /** The single JSON object `import` prints (`file` is added by the CLI, which knows the argument). */
 export interface ImportReport {

package/lib/engine/mem/index.d.ts

@@ -35,3 +35,4 @@ export * from './store/floors.js';
 export { registerSemanticBackend, registerVectorStore, type SemanticBackend, type VectorStore, } from '../mem-retrieval/index.js';
 export * from './store/relation_backfill.js';
 export { extractRelationCandidates, normalizeRelation, evaluateRelation, type RelationCandidate, type RelationEvaluation, type RelationExtractor, } from './relations/index.js';
+export { useTokenizerModuleDir } from './entities/extract.js';

package/lib/engine/mem/interfaces/repositories.d.ts

@@ -14,7 +14,7 @@
  *
  * @module interfaces/repositories
  */
-import type { ContradictionRecord, FactSourceView, MemoryKind, RelationInput } from '../../mem-contract/index.js';
+import type { ContradictionRecord, FactSourceView, MemoryKind, RelationInput, TrustCurve } from '../../mem-contract/index.js';
 import type { GraphReader } from '../../graph-recall/index.js';
 import type { RelationVocabulary, SurfaceMatch } from '../store/relation_planner.js';
 import type { ExtractedEntity } from '../entities/extract.js';
@@ -36,7 +36,6 @@ export interface FactHitMeta {
     created_at: string;
     updated_at: string | null;
     valid_from: string | null;
-    valid_to: string | null;
     title: string | null;
 }
 /** One persisted semantic vector, as the reload/repair flows read it. */
@@ -87,14 +86,12 @@ export interface MemoryRepository {
     countInStatus(status: string, kind?: MemoryKind, source?: string): Awaitable<number>;
     countActiveWithValidFrom(): Awaitable<number>;
     countForgettingWithin(p: {
-        step: number;
+        threshold: number;
         clock: number;
-        withinDays: number;
+        curve: TrustCurve;
     }): Awaitable<number>;
-    countIdleCandidates(days: number): Awaitable<number>;
     countArchiveBacklog(p: {
         forgetThreshold: number;
-        idleCalendarDays: number;
     }): Awaitable<number>;
     countPendingConflicts(): Awaitable<number>;
     countStaleEntities(version: number): Awaitable<number>;
@@ -146,7 +143,6 @@ export interface MemoryRepository {
     insertRevision(v: {
         content: string;
         kind: MemoryKind;
-        ttlDays: number;
         supersedesId: number | null;
         hrr: Uint8Array;
         trust: number;
@@ -157,18 +153,13 @@ export interface MemoryRepository {
         createdAt: string;
         title?: string | null;
         validFrom?: string | null;
-        validTo?: string | null;
         validFromMs?: number | null;
-        validToMs?: number | null;
     }): Awaitable<InsertRevisionOutcome>;
     applyValidity(factId: number, validFrom: {
         text: string;
         ms: number;
-    } | undefined, validTo: {
-        text: string;
-        ms: number;
     } | undefined): Awaitable<void>;
-    applyValues(factId: number, kind: MemoryKind, ttlDays: number): Awaitable<void>;
+    applyValues(factId: number, kind: MemoryKind): Awaitable<void>;
     setTitle(factId: number, title: string): Awaitable<void>;
     /** v17: record a handle this fact used to carry, so an old title search still finds it. */
     insertTitleAlias(factId: number, title: string): Awaitable<void>;
@@ -177,18 +168,13 @@ export interface MemoryRepository {
     /** v17: drop an alias that has become the row's current title (a correction back to it). */
     dropTitleAlias(factId: number, title: string): Awaitable<void>;
     incrementAssertCount(factId: number): Awaitable<number>;
-    markValidTo(factId: number, at: string, atMs?: number | null): Awaitable<void>;
     linkSupersede(factId: number, supersedesId: number): Awaitable<void>;
     archiveSuperseded(factId: number, clock: number): Awaitable<number>;
-    revive(factId: number, kind: MemoryKind, ttlDays: number, trust: number, clock: number): Awaitable<number>;
+    revive(factId: number, kind: MemoryKind, trust: number, clock: number): Awaitable<number>;
     archive(factId: number, clock: number, reason: string): Awaitable<number>;
     restore(factId: number, trust: number, clock: number): Awaitable<number>;
-    bumpHelpful(factId: number, delta: number): Awaitable<void>;
     pin(factId: number, clock: number): Awaitable<number>;
     unpin(factId: number, clock: number): Awaitable<number>;
-    pinOutcome(factId: number, clock: number, bonusCount: number, windowAt: string): Awaitable<void>;
-    forgetOutcome(factId: number, trust: number, clock: number, bonusCount: number, windowAt: string): Awaitable<void>;
-    reinforceOutcome(factId: number, trust: number, clock: number, bonusCount: number, windowAt: string): Awaitable<void>;
     touchUsage(ids: readonly number[]): Awaitable<void>;
     settleTrust(factId: number, trust: number, clock: number): Awaitable<void>;
     reinforce(factId: number, trust: number, clock: number, bonusCount: number, windowAt: string): Awaitable<void>;