Compare commits
155
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
7360c809f6 | ||
|
|
71bddf3feb | ||
|
|
ce7a06f599 | ||
|
|
7be39288e8 | ||
|
|
754437b5bf | ||
|
|
c5ff3b8937 | ||
|
|
eb93983225 | ||
|
|
978d633e10 | ||
|
|
07599f0a22 | ||
|
|
88bdb010cf | ||
|
|
fba425af80 | ||
|
|
3f4e00dac7 | ||
|
|
15a224f1c6 | ||
|
|
58b196ae25 | ||
|
|
d95245f45c | ||
|
|
185c0aff87 | ||
|
|
a430a2b602 | ||
|
|
714df5d2a8 | ||
|
|
6cbc49ca0e | ||
|
|
b5a6f4536e | ||
|
|
199608a7d3 | ||
|
|
d5b82d5b19 | ||
|
|
0a05014a35 | ||
|
|
02bdfb572e | ||
|
|
dc2b9db683 | ||
|
|
8cd3793336 | ||
|
|
d8c525b544 | ||
|
|
93a11c2fb7 | ||
|
|
1774c310b1 | ||
|
|
75abce7cca | ||
|
|
826272f981 | ||
|
|
3102be6f65 | ||
|
|
7870b849cc | ||
|
|
afdab8fb6b | ||
|
|
3964f0332c | ||
|
|
7562714819 | ||
|
|
99cb22ba93 | ||
|
|
5709af0bfa | ||
|
|
f178594402 | ||
|
|
ca6be0063b | ||
|
|
40c27f4a95 | ||
|
|
ff92b0578a | ||
|
|
7f7171ac14 | ||
|
|
0b2b4f01d8 | ||
|
|
37dcebfce4 | ||
|
|
d7a73d7e6c | ||
|
|
9a4a734c19 | ||
|
|
38d7ef147d | ||
|
|
ab1452d06b | ||
|
|
1c7882ce34 | ||
|
|
3cf3858f09 | ||
|
|
33e16c1a61 | ||
|
|
c84d968b02 | ||
|
|
f4417c2f4d | ||
|
|
03cac702a8 | ||
|
|
0499c82965 | ||
|
|
d117102088 | ||
|
|
1aaab764ba | ||
|
|
2ac7c9d5a1 | ||
|
|
66d5049151 | ||
|
|
f979bd6ffc | ||
|
|
8ea82fbec3 | ||
|
|
2862f68631 | ||
|
|
b8d77547de | ||
|
|
79019bfc40 | ||
|
|
a5bc27c3a4 | ||
|
|
83c41963cf | ||
|
|
3533e55801 | ||
|
|
a293f7b784 | ||
|
|
754976db52 | ||
|
|
c954aa2917 | ||
|
|
772a597a53 | ||
|
|
1f30474cf3 | ||
|
|
a1021bb70a | ||
|
|
e0412747f0 | ||
|
|
5f63b35602 | ||
|
|
3e29617cbe | ||
|
|
941b7eec32 | ||
|
|
71d5f2a7cd | ||
|
|
f6c373ea94 | ||
|
|
978f27a164 | ||
|
|
0bfa7a4bc1 | ||
|
|
25f68831fd | ||
|
|
42fafc495f | ||
|
|
d4b8688148 | ||
|
|
bd399dd007 | ||
|
|
ffc5b108c6 | ||
|
|
45726d26a7 | ||
|
|
c015febb49 | ||
|
|
44fd0e95b4 | ||
|
|
b2a016e90f | ||
|
|
cee68592e3 | ||
|
|
c3747755b6 | ||
|
|
4bbf59dabe | ||
|
|
0c0494dabd | ||
|
|
a214cf4a0e | ||
|
|
a2f355a994 | ||
|
|
fa3490e794 | ||
|
|
05100339f8 | ||
|
|
00747be2db | ||
|
|
08a649792e | ||
|
|
584fe37c35 | ||
|
|
525f11f531 | ||
|
|
8f57bd0fae | ||
|
|
211d516e5f | ||
|
|
284584c578 | ||
|
|
bdc18f6177 | ||
|
|
b017c35d37 | ||
|
|
c12f55ef71 | ||
|
|
e52f335998 | ||
|
|
24d6c46065 | ||
|
|
e42d19cfd9 | ||
|
|
e5bd7c7576 | ||
|
|
3594456df3 | ||
|
|
3fa7850f01 | ||
|
|
827de4f65a | ||
|
|
808b9862c9 | ||
|
|
b69cc01d52 | ||
|
|
80d0a37116 | ||
|
|
793bfefc61 | ||
|
|
db6ab564dc | ||
|
|
339642b2c8 | ||
|
|
c2683fd6a9 | ||
|
|
1cdeb4a54b | ||
|
|
9236d8d4b4 | ||
|
|
43a9cc8751 | ||
|
|
4565026b09 | ||
|
|
b13cdea910 | ||
|
|
88d466d156 | ||
|
|
faf71cbe99 | ||
|
|
113e6e8274 | ||
|
|
de0ddf4b8b | ||
|
|
d0558e1fd5 | ||
|
|
12f808d0e1 | ||
|
|
44ccb69ca5 | ||
|
|
95cc81db4b | ||
|
|
f8ffcde0f4 | ||
|
|
0afff5734e | ||
|
|
ef4f379736 | ||
|
|
aab877a13c | ||
|
|
1cfb17ac5e | ||
|
|
8364ff1b36 | ||
|
|
57bdf7fa03 | ||
|
|
d2348eda43 | ||
|
|
467d9b4ac1 | ||
|
|
ef64da6df2 | ||
|
|
ae39e1ce8a | ||
|
|
a1c9fc1631 | ||
|
|
f37f5e744e | ||
|
|
0bdcae2b91 | ||
|
|
1b6920e8e1 | ||
|
|
a377a7f667 | ||
|
|
e282a41bab | ||
|
|
0959af388b | ||
|
|
6d724dc937 |
+11
@@ -38,3 +38,14 @@ go/zhiyid
|
||||
|
||||
# 临时工件(cron list dump,随时可 `hermes cron list` 重现,不入库)
|
||||
cron_raw.txt
|
||||
|
||||
# 改动前备份快照不进 git(git 本身就是版本历史)
|
||||
*.bak.*
|
||||
|
||||
# 探针/临时构建产物(2026-10-14 t_3e98b65a 调查时发现 17MB 残留未清)
|
||||
/go/*-probe
|
||||
/go/rulefirst-probe
|
||||
|
||||
# 临时构建/验证工件(t_5f822020 清理:quantify/test_one 二进制 + verify.go 探针)
|
||||
/go/tmp/
|
||||
/verify.go
|
||||
|
||||
@@ -197,7 +197,6 @@ def stats(stat_type, json_flag):
|
||||
if "metrics" in data:
|
||||
m = data["metrics"]
|
||||
click.echo(f"\n📊 自优化指标:")
|
||||
click.echo(f" 召回命中率: {m.get('recall_hit_rate', '?'):.1%}")
|
||||
click.echo(f" 召回有用率: {m.get('recall_usefulness_rate', '?'):.1%}")
|
||||
click.echo(f" 记忆总数: {m.get('total_memories', '?')}")
|
||||
|
||||
@@ -429,7 +428,7 @@ def _repl_with_skin(c: ZhiYiClient, skin):
|
||||
["记忆数", str(s.get("total_memories", "?"))],
|
||||
["图谱节点", str(g.get("node_count", "?"))],
|
||||
["图谱边", str(g.get("edge_count", "?"))],
|
||||
["召回命中率", f"{m.get('recall_hit_rate', '?'):.1%}"],
|
||||
["召回有用率", f"{m.get('recall_usefulness_rate', '?'):.1%}"],
|
||||
],
|
||||
)
|
||||
elif cmd == "graph" and args and args[0] == "navigate":
|
||||
|
||||
@@ -0,0 +1,13 @@
|
||||
[152] /home/muc/.hermes/kanban/workspaces/t_492e3f22/ac-evidence/t492-DEF-152-20261016-184003.json total=152 PASS=74 id_hits=7 fp=2318948a910f6d70de6be063216c78089c4315bd p95=2630ms errs=0
|
||||
[golden] /home/muc/.hermes/kanban/workspaces/t_492e3f22/ac-evidence/t492-DEF-golden-20261016-184003.json pass=14/14 fail=0
|
||||
[probe10] 牧尘工作所在的县是哪个: n=20 v>0=0 -> []
|
||||
[probe10] 淇县: n=20 v>0=1 -> ['mem_1792088552819293505']
|
||||
[probe10] 招商项目台账: n=20 v>0=0 -> []
|
||||
[probe10] 生物制造产业专班: n=20 v>0=0 -> []
|
||||
[probe10] 小怡的工作笔记在哪: n=15 v>0=0 -> []
|
||||
[probe10] 昨天做了什么: n=20 v>0=0 -> []
|
||||
[probe10] 飞书怎么发语音: n=20 v>0=0 -> []
|
||||
[probe10] 家服怎么连: n=20 v>0=0 -> []
|
||||
[probe10] 织忆怎么部署: n=20 v>0=1 -> ['mem_1791740271337572997']
|
||||
[probe10] 记忆保护名单: n=20 v>0=0 -> []
|
||||
DONE DEF at 20261016-184003
|
||||
@@ -0,0 +1,13 @@
|
||||
[152] /home/muc/.hermes/kanban/workspaces/t_492e3f22/ac-evidence/t492-NOV-152-20261016-184835.json total=152 PASS=74 id_hits=7 fp=2318948a910f6d70de6be063216c78089c4315bd p95=812ms errs=0
|
||||
[golden] /home/muc/.hermes/kanban/workspaces/t_492e3f22/ac-evidence/t492-NOV-golden-20261016-184835.json pass=14/14 fail=0
|
||||
[probe10] 牧尘工作所在的县是哪个: n=20 v>0=0 -> []
|
||||
[probe10] 淇县: n=20 v>0=1 -> ['mem_1792088552819293505']
|
||||
[probe10] 招商项目台账: n=20 v>0=0 -> []
|
||||
[probe10] 生物制造产业专班: n=20 v>0=0 -> []
|
||||
[probe10] 小怡的工作笔记在哪: n=15 v>0=0 -> []
|
||||
[probe10] 昨天做了什么: n=20 v>0=0 -> []
|
||||
[probe10] 飞书怎么发语音: n=20 v>0=0 -> []
|
||||
[probe10] 家服怎么连: n=20 v>0=0 -> []
|
||||
[probe10] 织忆怎么部署: n=20 v>0=1 -> ['mem_1791740271337572997']
|
||||
[probe10] 记忆保护名单: n=20 v>0=0 -> []
|
||||
DONE NOV at 20261016-184835
|
||||
@@ -0,0 +1,13 @@
|
||||
[152] /home/muc/.hermes/kanban/workspaces/t_492e3f22/ac-evidence/t492-PRE-152-20261016-183449.json total=152 PASS=74 id_hits=7 fp=2318948a910f6d70de6be063216c78089c4315bd p95=809ms errs=0
|
||||
[golden] /home/muc/.hermes/kanban/workspaces/t_492e3f22/ac-evidence/t492-PRE-golden-20261016-183449.json pass=14/14 fail=0
|
||||
[probe10] 牧尘工作所在的县是哪个: n=20 v>0=0 -> []
|
||||
[probe10] 淇县: n=20 v>0=1 -> ['mem_1792088552819293505']
|
||||
[probe10] 招商项目台账: n=20 v>0=0 -> []
|
||||
[probe10] 生物制造产业专班: n=20 v>0=0 -> []
|
||||
[probe10] 小怡的工作笔记在哪: n=15 v>0=0 -> []
|
||||
[probe10] 昨天做了什么: n=20 v>0=0 -> []
|
||||
[probe10] 飞书怎么发语音: n=20 v>0=0 -> []
|
||||
[probe10] 家服怎么连: n=20 v>0=0 -> []
|
||||
[probe10] 织忆怎么部署: n=20 v>0=1 -> ['mem_1791740271337572997']
|
||||
[probe10] 记忆保护名单: n=20 v>0=0 -> []
|
||||
DONE PRE at 20261016-183449
|
||||
@@ -0,0 +1,13 @@
|
||||
[152] /home/muc/.hermes/kanban/workspaces/t_492e3f22/ac-evidence/t492-RBK-152-20261016-190913.json total=152 PASS=74 id_hits=7 fp=2318948a910f6d70de6be063216c78089c4315bd p95=931ms errs=0
|
||||
[golden] /home/muc/.hermes/kanban/workspaces/t_492e3f22/ac-evidence/t492-RBK-golden-20261016-190913.json pass=14/14 fail=0
|
||||
[probe10] 牧尘工作所在的县是哪个: n=20 v>0=0 -> []
|
||||
[probe10] 淇县: n=20 v>0=1 -> ['mem_1792088552819293505']
|
||||
[probe10] 招商项目台账: n=20 v>0=0 -> []
|
||||
[probe10] 生物制造产业专班: n=20 v>0=0 -> []
|
||||
[probe10] 小怡的工作笔记在哪: n=15 v>0=0 -> []
|
||||
[probe10] 昨天做了什么: n=20 v>0=0 -> []
|
||||
[probe10] 飞书怎么发语音: n=20 v>0=0 -> []
|
||||
[probe10] 家服怎么连: n=20 v>0=0 -> []
|
||||
[probe10] 织忆怎么部署: n=20 v>0=1 -> ['mem_1791740271337572997']
|
||||
[probe10] 记忆保护名单: n=20 v>0=0 -> []
|
||||
DONE RBK at 20261016-190913
|
||||
@@ -0,0 +1,87 @@
|
||||
# t_492e3f22 · fuseQuality V 值分支 env 门(ZHIYI_V_FUSE_ENABLE)— A/B 证据包
|
||||
|
||||
次症 C:给 Go 端 fuseQuality 的 V 值分支加 env 门。**默认行为逐位保持现状**;`ZHIYI_V_FUSE_ENABLE=1`
|
||||
关闭 V 分支(v>0 时不再用 0.5v+0.5imp / 0.3v+0.3imp+0.4raw 加权,退化为 untrusted→min(imp,1)、
|
||||
trusted→min(0.4imp+0.6raw,1))。本包 = 代码 + 测试 + 双口径 A/B 证据。
|
||||
|
||||
## 结论(2026-10-16 实测)
|
||||
|
||||
| AC | 判据 | 结果 |
|
||||
|---|---|---|
|
||||
| AC1 默认不碰 | PRE(旧二进制) ≡ DEF(新二进制默认):152 集 verdict 指纹、top5 顺序、probe10 top20、golden | ✅ 全同(指纹 2318948a…;golden 14/14) |
|
||||
| AC2 翻转证据 | DEF vs NOV(env=1):verdict 指纹同;probe10 10 条 affected=0;两条受影响 query top50 顺序逐位全同(fp 47e228e8 / 9dd57897 各两边一致);v>0 条目 rank 零移动 | ✅(排名变化 = 0,见「解读」) |
|
||||
| AC4 受影响条数 | v>0 条数独立复算(4 个 tag 集合完全一致):152×top5 = 2/760 (0.26%);probe10×top20 = 2/195 (1.03%) | ✅ 实测 2 条,任务表预期 2–3(≈1.5%,V 按 0.01/天衰减) |
|
||||
| AC5 回滚复核 | RBK(新二进制重启·默认) == DEF 指纹(verdict 层 2318948a + probe10 全同 + golden 14/14) | ✅(仅 2 条 v=0 Gitea top1 互漂,跨跑 usage_track 漂移,见「已知噪声」) |
|
||||
| AC6 异源复算 | 第二张口径(independent_recheck.py,sha256 顺序指纹 + 逐条 v>0 集合复算)与主口径一致,无矛盾 | ✅ PASS |
|
||||
|
||||
## 改动文件
|
||||
|
||||
- `go/internal/storage/quality_fusion.go` — `vFuseUseV = os.Getenv("ZHIYI_V_FUSE_ENABLE") != "1"`(进程级,同 ZHIYI_PROOF_FALLBACK 模式),V 分支条件 `if vFuseUseV && vValue > 0`
|
||||
- `go/internal/storage/quality_fusion_test.go` — `TestFuseQuality_VGateOn`(门开:v>0 条 fused 0.85 vs v=0 条 0.725,排序保持)+ `TestFuseQuality_VGateOff`(门关:两者同值)
|
||||
- 单测:`cd go && go test ./internal/storage/ -run 'TestFuseQuality' -v` → 3/3 PASS(2026-10-16 19:35 复跑)
|
||||
|
||||
## 实例配置(隔离:独立数据副本,不碰主库)
|
||||
|
||||
- 数据:`/tmp/zyvfuse-t492e3f22/data`(/var/lib/memoryweave 全量副本,symbolic link 已解)
|
||||
- sidecar:`zhiyi-consolidate --mode socket --socket /tmp/zyvfuse-t492e3f22/cons.sock`
|
||||
- 4 实例:PRE :7891(旧二进制) / DEF :7892(新·默认) / NOV :7893(新·env=1,/proc environ 实证) / RBK :7892 重启(新·默认)
|
||||
- 评测集:152 条(zhiyi-loop-runner 池)+ golden 14 + probe10(淇县/织忆怎么部署/记忆保护名单 等卡表同源)
|
||||
|
||||
## 受影响 3 样本表(AC2,卡表口径)
|
||||
|
||||
| query | v>0(任务表→实测) | v>0 条目 | DEF→NOV 排名变化 |
|
||||
|---|---|---|---|
|
||||
| 淇县 | 0 → 1 | mem_1792088552819293505 (v=1.0, rank1) | 0(top50 逐位全同) |
|
||||
| 织忆怎么部署 | 2 → 1 | mem_1791740271337572997 (v=1.0) | 0(top50 逐位全同) |
|
||||
| 记忆保护名单 | 1 → 0 | (本次 top20 内无 v>0) | — |
|
||||
|
||||
**解读(为什么排名变化=0)**:recall 排序 base = 0.7×cosine + 0.3×fusedQuality。V 门控只改 v>0 条的
|
||||
fused 分(untrusted 时 0.5v+0.5imp → min(imp,1)),Δbase 上限 0.3×Δfused≈0.15;本数据分布下
|
||||
cosine 主导的条间 margin > Δbase ⇒ 无换位。门控在**融合分轴**生效(单测证明公式差),
|
||||
**排序轴**在本数据规模上实测零扰动 —— 这正是「默认不碰、关也不破」的安全证据。
|
||||
v>0 条数随时间漂(V 衰减 0.01/天 + seen-count 变化):任务表 3 → 实测 2。
|
||||
|
||||
## 已知噪声(与门控无关,如实记录)
|
||||
|
||||
- 152 集中 2 条 Gitea query 的 top1 在跨跑间互换(mem_1792088552817004309 ↔ mem_1792088552816998158,
|
||||
两侧 v=0、raw=0):DEF 跑 / NOV 跑 / RBK 跑各自写 usage_track(seen-count +1、last_recalled_at 刷新),
|
||||
imp 微漂 ⇒ 同分对 tie 换位。verdict/指纹层不受影响(4 tag verdict 指纹全同 2318948a)。
|
||||
- 152 集 P95:PRE=809ms / DEF=2630ms(冷启动+首轮 warmup)/ NOV≈951 / RBK=931 —— AC 判据为 ±20% 口径
|
||||
以稳态(RBK/NOV)为准,DEF 高值系冷启动,非门控效应。
|
||||
|
||||
## 复算命令
|
||||
|
||||
```bash
|
||||
# 单测
|
||||
cd /home/muc/src/memoryweave/go && go test ./internal/storage/ -run 'TestFuseQuality' -v
|
||||
# 异源复算(本目录 raw/*.json)
|
||||
python3 <kanban-workspace>/harness/independent_recheck.py # 输出 independent_recheck_out.json
|
||||
python3 <kanban-workspace>/harness/diffrun.py DEF NOV # 主口径 diff
|
||||
```
|
||||
|
||||
## 部署提示(本卡不含生产动作)
|
||||
|
||||
- 生产 zhiyid(systemd, :7821)与 zhiyi-consolidate 不动;本卡只验证行为等价 + 门控生效。
|
||||
- 真要关 V 分支:`Environment=ZHIYI_V_FUSE_ENABLE=1` 加进 deploy/zhiyid.service + 重启(需另行提卡审批)。
|
||||
- 回滚 = 删该行/置 0,重启即恢复现状(RBK 证据)。
|
||||
|
||||
## teardown + 零残留判据(19:44 补,跨卡通知 t_004cc147 内存告警处置要求)
|
||||
|
||||
测试栈(27G:data/ 副本 + graph.db 447M + 双 zhiyid 守护 + sidecar)已全部下线:
|
||||
|
||||
- 双孤儿 zhiyid(PID 347191 :7893 / 367265 :7892)已由 prof-cloud SIGTERM(19:15 内存告警处置)
|
||||
- 本侧:sidecar(cons.sock,data 副本)停掉;`/tmp/zyvfuse-t492e3f22` 整目录删除
|
||||
(evidence 先全量落盘 `ac-evidence/` 与本目录 raw/,再删)
|
||||
- 顺带清:`/tmp/dryrun-dir`(2.6G) `/tmp/mem-copy.lance`(604M) `spike*`(441M×2+小文件)
|
||||
—— 删前确认:lsof 无占用、无看板卡引用、mtime 10-11/10-12
|
||||
|
||||
终验输出(19:44):
|
||||
```
|
||||
ps -C zhiyid -o pid,args → 仅表头,无进程(exit 1)
|
||||
du -sh /tmp/zyvfuse-* → No such file or directory
|
||||
du -sh /tmp/dryrun-dir /tmp/mem-copy.lance /tmp/spike* → 全部 No such file
|
||||
free -h → available 5.3Gi(告警前 <1G)
|
||||
```
|
||||
|
||||
**判据补录(本卡验收新增)**:`ps -C zhiyid -o pid,args` 为空(测试栈守护零残留)+
|
||||
`du -sh /tmp/zyvfuse-*` 无残留 —— 已通过。
|
||||
@@ -0,0 +1,230 @@
|
||||
{
|
||||
"a": "DEF",
|
||||
"b": "NOV",
|
||||
"files": {
|
||||
"a": {
|
||||
"152": [
|
||||
"at",
|
||||
"tag",
|
||||
"base",
|
||||
"total",
|
||||
"pass",
|
||||
"fail",
|
||||
"metrics",
|
||||
"latency_ms",
|
||||
"fail_mode",
|
||||
"recall_errors",
|
||||
"fingerprint",
|
||||
"namespace",
|
||||
"top_k",
|
||||
"results"
|
||||
],
|
||||
"probe10": [
|
||||
"at",
|
||||
"tag",
|
||||
"base",
|
||||
"top_k",
|
||||
"rows"
|
||||
],
|
||||
"golden": [
|
||||
"at",
|
||||
"tag",
|
||||
"base",
|
||||
"keyword_pass",
|
||||
"keyword_fail",
|
||||
"keyword_total",
|
||||
"recall_at_5",
|
||||
"mrr",
|
||||
"items"
|
||||
]
|
||||
},
|
||||
"b": [
|
||||
"152",
|
||||
"probe10",
|
||||
"golden"
|
||||
]
|
||||
},
|
||||
"152": {
|
||||
"fp_a": "2318948a910f6d70de6be063216c78089c4315bd",
|
||||
"fp_b": "2318948a910f6d70de6be063216c78089c4315bd",
|
||||
"fp_same": true,
|
||||
"pass_a": 74,
|
||||
"pass_b": 74,
|
||||
"id_hits_a": 7,
|
||||
"id_hits_b": 7,
|
||||
"p95_a_ms": 2630,
|
||||
"p95_b_ms": 812,
|
||||
"changed_queries": 1,
|
||||
"changed_detail": {
|
||||
"局域网里访问 Gitea 家服连哪个 IP": {
|
||||
"kind": "probe",
|
||||
"changed": [
|
||||
"top5"
|
||||
],
|
||||
"a_top5": [
|
||||
"mem_1792088552817004309",
|
||||
"mem_1789136383983279469",
|
||||
"ep_1786521524260755589",
|
||||
"mem_1789150776299341327",
|
||||
"mem_1789737118121867083"
|
||||
],
|
||||
"b_top5": [
|
||||
"mem_1792088552816998158",
|
||||
"mem_1789136383983279469",
|
||||
"ep_1786521524260755589",
|
||||
"mem_1789150776299341327",
|
||||
"mem_1789737118121867083"
|
||||
]
|
||||
}
|
||||
},
|
||||
"v0_rank_shifts": []
|
||||
},
|
||||
"probe10": {
|
||||
"rows": [
|
||||
{
|
||||
"query": "牧尘工作所在的县是哪个",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "淇县",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 1,
|
||||
"v_pos_b": 1,
|
||||
"v_pos_ids_a": [
|
||||
"mem_1792088552819293505"
|
||||
],
|
||||
"v_pos_ids_b": [
|
||||
"mem_1792088552819293505"
|
||||
],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "招商项目台账",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "生物制造产业专班",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "小怡的工作笔记在哪",
|
||||
"n_a": 15,
|
||||
"n_b": 15,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "昨天做了什么",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "飞书怎么发语音",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "家服怎么连",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "织忆怎么部署",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 1,
|
||||
"v_pos_b": 1,
|
||||
"v_pos_ids_a": [
|
||||
"mem_1791740271337572997"
|
||||
],
|
||||
"v_pos_ids_b": [
|
||||
"mem_1791740271337572997"
|
||||
],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "记忆保护名单",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
}
|
||||
],
|
||||
"affected_queries": [],
|
||||
"n_affected_queries": 0
|
||||
},
|
||||
"golden": {
|
||||
"a": "14/14",
|
||||
"b": "14/14"
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,250 @@
|
||||
{
|
||||
"a": "DEF",
|
||||
"b": "RBK",
|
||||
"files": {
|
||||
"a": {
|
||||
"152": [
|
||||
"at",
|
||||
"tag",
|
||||
"base",
|
||||
"total",
|
||||
"pass",
|
||||
"fail",
|
||||
"metrics",
|
||||
"latency_ms",
|
||||
"fail_mode",
|
||||
"recall_errors",
|
||||
"fingerprint",
|
||||
"namespace",
|
||||
"top_k",
|
||||
"results"
|
||||
],
|
||||
"probe10": [
|
||||
"at",
|
||||
"tag",
|
||||
"base",
|
||||
"top_k",
|
||||
"rows"
|
||||
],
|
||||
"golden": [
|
||||
"at",
|
||||
"tag",
|
||||
"base",
|
||||
"keyword_pass",
|
||||
"keyword_fail",
|
||||
"keyword_total",
|
||||
"recall_at_5",
|
||||
"mrr",
|
||||
"items"
|
||||
]
|
||||
},
|
||||
"b": [
|
||||
"152",
|
||||
"probe10",
|
||||
"golden"
|
||||
]
|
||||
},
|
||||
"152": {
|
||||
"fp_a": "2318948a910f6d70de6be063216c78089c4315bd",
|
||||
"fp_b": "2318948a910f6d70de6be063216c78089c4315bd",
|
||||
"fp_same": true,
|
||||
"pass_a": 74,
|
||||
"pass_b": 74,
|
||||
"id_hits_a": 7,
|
||||
"id_hits_b": 7,
|
||||
"p95_a_ms": 2630,
|
||||
"p95_b_ms": 931,
|
||||
"changed_queries": 2,
|
||||
"changed_detail": {
|
||||
"家庭服务器(跑 Gitea)在局域网里的地址是哪个": {
|
||||
"kind": "probe",
|
||||
"changed": [
|
||||
"top5"
|
||||
],
|
||||
"a_top5": [
|
||||
"mem_1792088552816998158",
|
||||
"mem_1789136383983279469",
|
||||
"ep_1785695216419714474",
|
||||
"ep_1786336919812827426",
|
||||
"ep_1786452727331645773"
|
||||
],
|
||||
"b_top5": [
|
||||
"mem_1792088552817004309",
|
||||
"mem_1789136383983279469",
|
||||
"ep_1785695216419714474",
|
||||
"ep_1786336919812827426",
|
||||
"ep_1786452727331645773"
|
||||
]
|
||||
},
|
||||
"局域网里访问 Gitea 家服连哪个 IP": {
|
||||
"kind": "probe",
|
||||
"changed": [
|
||||
"top5"
|
||||
],
|
||||
"a_top5": [
|
||||
"mem_1792088552817004309",
|
||||
"mem_1789136383983279469",
|
||||
"ep_1786521524260755589",
|
||||
"mem_1789150776299341327",
|
||||
"mem_1789737118121867083"
|
||||
],
|
||||
"b_top5": [
|
||||
"mem_1792088552816998158",
|
||||
"mem_1789136383983279469",
|
||||
"ep_1786521524260755589",
|
||||
"mem_1789150776299341327",
|
||||
"mem_1789737118121867083"
|
||||
]
|
||||
}
|
||||
},
|
||||
"v0_rank_shifts": []
|
||||
},
|
||||
"probe10": {
|
||||
"rows": [
|
||||
{
|
||||
"query": "牧尘工作所在的县是哪个",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "淇县",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 1,
|
||||
"v_pos_b": 1,
|
||||
"v_pos_ids_a": [
|
||||
"mem_1792088552819293505"
|
||||
],
|
||||
"v_pos_ids_b": [
|
||||
"mem_1792088552819293505"
|
||||
],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "招商项目台账",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "生物制造产业专班",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "小怡的工作笔记在哪",
|
||||
"n_a": 15,
|
||||
"n_b": 15,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "昨天做了什么",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "飞书怎么发语音",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "家服怎么连",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "织忆怎么部署",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 1,
|
||||
"v_pos_b": 1,
|
||||
"v_pos_ids_a": [
|
||||
"mem_1791740271337572997"
|
||||
],
|
||||
"v_pos_ids_b": [
|
||||
"mem_1791740271337572997"
|
||||
],
|
||||
"v_rank_moved": []
|
||||
},
|
||||
{
|
||||
"query": "记忆保护名单",
|
||||
"n_a": 20,
|
||||
"n_b": 20,
|
||||
"set_added": [],
|
||||
"set_removed": [],
|
||||
"order_diff_positions": 0,
|
||||
"v_pos_a": 0,
|
||||
"v_pos_b": 0,
|
||||
"v_pos_ids_a": [],
|
||||
"v_pos_ids_b": [],
|
||||
"v_rank_moved": []
|
||||
}
|
||||
],
|
||||
"affected_queries": [],
|
||||
"n_affected_queries": 0
|
||||
},
|
||||
"golden": {
|
||||
"a": "14/14",
|
||||
"b": "14/14"
|
||||
}
|
||||
}
|
||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,82 @@
|
||||
{
|
||||
"at": "20261016-184343",
|
||||
"tag": "DEF",
|
||||
"base": "http://127.0.0.1:7892",
|
||||
"keyword_pass": 14,
|
||||
"keyword_fail": 0,
|
||||
"keyword_total": 14,
|
||||
"recall_at_5": 0.42857142857142855,
|
||||
"mrr": 0.2380952380952381,
|
||||
"items": [
|
||||
{
|
||||
"query": "织忆是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆的图谱扩展机制是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "织忆如何通过 E1 提取和 MMR 实现多样去重",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "牧尘的偏好是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "牧尘喜欢什么样的工作方式",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "如何根据牧尘的偏好调整记忆检索策略",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "当前项目的技术栈是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "织忆项目有哪些核心组件",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆和其他记忆系统相比有什么架构优势",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "如何使用 recall 接口",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆有哪些管理工具",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "如何通过 API 扩展织忆功能",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "本地 llama 服务 8080 端口",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "session-to-zhiyi.py 脚本名",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
}
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,932 @@
|
||||
{
|
||||
"at": "20261016-184350",
|
||||
"tag": "DEF",
|
||||
"base": "http://127.0.0.1:7892",
|
||||
"top_k": 20,
|
||||
"rows": [
|
||||
{
|
||||
"query": "牧尘工作所在的县是哪个",
|
||||
"latency_ms": 689,
|
||||
"top_ids": [
|
||||
"mem_1792088552818864597",
|
||||
"mem_1792144084503554069",
|
||||
"mem_1792144084726385461",
|
||||
"mem_1790349546889496890",
|
||||
"mem_1787450890745924038",
|
||||
"mem_1790448247125520424",
|
||||
"mem_1789063252280657787",
|
||||
"mem_1792088552817383356",
|
||||
"ep_1786293372952742428",
|
||||
"mem_1792144084989342595",
|
||||
"mem_1789815923678472264",
|
||||
"mem_1788006341389931001",
|
||||
"mem_1790425119425241515",
|
||||
"mem_1791556228356038757",
|
||||
"mem_1789230281180128695",
|
||||
"mem_1792088552824873585",
|
||||
"mem_1792088552817930263",
|
||||
"mem_1790424260127845812",
|
||||
"mem_1789737493969591957",
|
||||
"mem_1787926246493058856"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.5,
|
||||
0.59,
|
||||
0.59,
|
||||
0.755,
|
||||
0.255,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0,
|
||||
0.59,
|
||||
0.83,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.753,
|
||||
0.755,
|
||||
0.775
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "淇县",
|
||||
"latency_ms": 717,
|
||||
"top_ids": [
|
||||
"mem_1792144084726385461",
|
||||
"mem_1792088552818354175",
|
||||
"mem_1792088552818868548",
|
||||
"mem_1792088552818381759",
|
||||
"mem_1792144084503554069",
|
||||
"mem_1790938090098284542",
|
||||
"mem_1790938089297531705",
|
||||
"mem_1790603669933523968",
|
||||
"mem_1792088552818672993",
|
||||
"mem_1790425189400296970",
|
||||
"mem_1791564884666490485",
|
||||
"mem_1790848976254029727",
|
||||
"mem_1792088552819307750",
|
||||
"mem_1790657384251944657",
|
||||
"mem_1789328667925309581",
|
||||
"mem_1792116219795602288",
|
||||
"mem_1790425213354467843",
|
||||
"mem_1791395173327211388",
|
||||
"mem_1792141689103478828",
|
||||
"mem_1792088552819293505"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
1
|
||||
],
|
||||
"quality_scores": [
|
||||
0.59,
|
||||
0.5,
|
||||
0.5,
|
||||
0.5,
|
||||
0.59,
|
||||
0.83,
|
||||
0.83,
|
||||
0,
|
||||
0.5,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755,
|
||||
0.83,
|
||||
0.63,
|
||||
0.755,
|
||||
0.675,
|
||||
0.525,
|
||||
0.99
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 1,
|
||||
"v_pos_ids": [
|
||||
"mem_1792088552819293505"
|
||||
]
|
||||
},
|
||||
{
|
||||
"query": "招商项目台账",
|
||||
"latency_ms": 751,
|
||||
"top_ids": [
|
||||
"mem_1790657711315786810",
|
||||
"mem_1790425023223201421",
|
||||
"mem_1792088552819227083",
|
||||
"mem_1792088552817389514",
|
||||
"mem_1791194371133842796",
|
||||
"mem_1790565541250175254",
|
||||
"mem_1791387362920806120",
|
||||
"mem_1791899910885939521",
|
||||
"mem_1789694252600441660",
|
||||
"mem_1791665519266094329",
|
||||
"mem_1790309303666562764",
|
||||
"mem_1790581054400784704",
|
||||
"mem_1792088552818016699",
|
||||
"mem_1792088552818037737",
|
||||
"mem_1790590528061314469",
|
||||
"mem_1790187043969918230",
|
||||
"mem_1790448247323881504",
|
||||
"mem_1790329285912241710",
|
||||
"mem_1792088552817184125",
|
||||
"mem_1789327284892773149"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.755,
|
||||
0.853,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.765,
|
||||
0.59,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "生物制造产业专班",
|
||||
"latency_ms": 722,
|
||||
"top_ids": [
|
||||
"mem_1792144084989342595",
|
||||
"mem_1792107514588524675",
|
||||
"mem_1791567307185364992",
|
||||
"mem_1790051867711758989",
|
||||
"mem_1789983973135821157",
|
||||
"mem_1792088552816455607",
|
||||
"mem_1791380468697720355",
|
||||
"mem_1792088552817215072",
|
||||
"mem_1790658098063956127",
|
||||
"mem_1792088552825118896",
|
||||
"mem_1790656401441522455",
|
||||
"mem_1789755524758238574",
|
||||
"mem_1789741519238314161",
|
||||
"mem_1789736468534024216",
|
||||
"mem_1789731934167097953",
|
||||
"mem_1791916787313401423",
|
||||
"mem_1787336595731500272",
|
||||
"mem_1791794756620086535",
|
||||
"mem_1791811143462384371",
|
||||
"mem_1791735819718797684"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.59,
|
||||
0.63,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.78,
|
||||
0.5,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.798,
|
||||
0.395,
|
||||
0.695,
|
||||
0.63,
|
||||
0.315,
|
||||
0.6
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "小怡的工作笔记在哪",
|
||||
"latency_ms": 614,
|
||||
"top_ids": [
|
||||
"mem_1791365211038188118",
|
||||
"mem_1792088552817459951",
|
||||
"mem_1789155186005621317",
|
||||
"mem_1790441160106001927",
|
||||
"mem_1791736002933120377",
|
||||
"mem_1792118701572499829",
|
||||
"mem_1792088552818645685",
|
||||
"mem_1791915848530338805",
|
||||
"mem_1791383333319512288",
|
||||
"mem_1792088552818535755",
|
||||
"mem_1790187044046223493",
|
||||
"mem_1792088552824837822",
|
||||
"mem_1792088552817461960",
|
||||
"mem_1791423103974079882",
|
||||
"mem_1792088552825338800"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.8,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.39,
|
||||
0.63,
|
||||
0.5,
|
||||
0.5,
|
||||
0.8,
|
||||
0.5,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.6,
|
||||
0.5
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "昨天做了什么",
|
||||
"latency_ms": 692,
|
||||
"top_ids": [
|
||||
"mem_1788341686813816985",
|
||||
"mem_1790425119425241515",
|
||||
"mem_1791633893565216844",
|
||||
"mem_1790455525438011532",
|
||||
"mem_1792083942223793654",
|
||||
"mem_1792088770119950733",
|
||||
"mem_1790805789157124891",
|
||||
"mem_1792107513668237224",
|
||||
"mem_1789431180512315186",
|
||||
"mem_1790425238816494139",
|
||||
"mem_1790424256264891954",
|
||||
"mem_1787926246433496550",
|
||||
"mem_1790425017614420145",
|
||||
"mem_1790581068974704280",
|
||||
"mem_1789327284892773149",
|
||||
"mem_1790226520252986178",
|
||||
"mem_1790269130144600786",
|
||||
"mem_1791819411153164256",
|
||||
"mem_1789827897771148953",
|
||||
"mem_1788166192802637740"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.395,
|
||||
0.63,
|
||||
0.755,
|
||||
0.63,
|
||||
0.515,
|
||||
0.755,
|
||||
0.755,
|
||||
0.775,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.395,
|
||||
0.755,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "飞书怎么发语音",
|
||||
"latency_ms": 783,
|
||||
"top_ids": [
|
||||
"mem_1790345721671326922",
|
||||
"mem_1790350480105660984",
|
||||
"mem_1790425022831993728",
|
||||
"mem_1791118583544396904",
|
||||
"mem_1791533226241026355",
|
||||
"mem_1790455570122981543",
|
||||
"mem_1791445601992763027",
|
||||
"mem_1790496848751501955",
|
||||
"mem_1789273123503223085",
|
||||
"mem_1791666641349257940",
|
||||
"mem_1791666631693960928",
|
||||
"mem_1792088552825510526",
|
||||
"mem_1791666639652621391",
|
||||
"mem_1790265788637717626",
|
||||
"mem_1790428068416795396",
|
||||
"mem_1791118583617248844",
|
||||
"mem_1791666711653684211",
|
||||
"mem_1789557079608816710",
|
||||
"mem_1789327693618007907",
|
||||
"mem_1789273123339483168"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.803,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.803,
|
||||
0,
|
||||
0.83,
|
||||
0.755,
|
||||
0,
|
||||
0.789,
|
||||
0.5,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.805,
|
||||
0.755,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "家服怎么连",
|
||||
"latency_ms": 700,
|
||||
"top_ids": [
|
||||
"mem_1791556229473565240",
|
||||
"mem_1792084245285474959",
|
||||
"mem_1792088552818289574",
|
||||
"mem_1790180705032672204",
|
||||
"mem_1792100307763093595",
|
||||
"mem_1791665516356975992",
|
||||
"mem_1792084245095017393",
|
||||
"mem_1792082720405068478",
|
||||
"mem_1791440639711180469",
|
||||
"mem_1792114886051333715",
|
||||
"mem_1792088552825127031",
|
||||
"mem_1791642436962837771",
|
||||
"mem_1792088552819438066",
|
||||
"mem_1792088552816808997",
|
||||
"mem_1790187091203506519",
|
||||
"mem_1792126203805297968",
|
||||
"mem_1792088552819539001",
|
||||
"mem_1791904832104972267",
|
||||
"mem_1792088552818662517",
|
||||
"mem_1792088552824945417"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0,
|
||||
0.63,
|
||||
0.5,
|
||||
0.755,
|
||||
0.63,
|
||||
0.8,
|
||||
0.63,
|
||||
0.63,
|
||||
0,
|
||||
0.63,
|
||||
0.5,
|
||||
0.65,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.395,
|
||||
0.5,
|
||||
0.43,
|
||||
0.5,
|
||||
0.5
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "织忆怎么部署",
|
||||
"latency_ms": 724,
|
||||
"top_ids": [
|
||||
"mem_1788623666023332134",
|
||||
"mem_1789793765940732350",
|
||||
"mem_1791479003228249623",
|
||||
"mem_1789149704491770048",
|
||||
"mem_1789154058288011112",
|
||||
"mem_1791818814047111008",
|
||||
"mem_1792144557208382006",
|
||||
"mem_1791402157932171759",
|
||||
"mem_1791899478077693848",
|
||||
"mem_1789411888019473186",
|
||||
"mem_1792088552825130331",
|
||||
"mem_1792088552817959556",
|
||||
"mem_1791912042293867384",
|
||||
"mem_1788657176712786530",
|
||||
"mem_1790424244350350337",
|
||||
"mem_1791740271337572997",
|
||||
"mem_1792088552818065436",
|
||||
"mem_1789132107404617336",
|
||||
"mem_1788340352324421455",
|
||||
"mem_1791431677583759030"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
1,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.911,
|
||||
0.755,
|
||||
0,
|
||||
0.99,
|
||||
0.695,
|
||||
0.63,
|
||||
0.565,
|
||||
0.99,
|
||||
0.644,
|
||||
0.865,
|
||||
0.5,
|
||||
0.5,
|
||||
0.59,
|
||||
0.755,
|
||||
0.99,
|
||||
0,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.675
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 1,
|
||||
"v_pos_ids": [
|
||||
"mem_1791740271337572997"
|
||||
]
|
||||
},
|
||||
{
|
||||
"query": "记忆保护名单",
|
||||
"latency_ms": 708,
|
||||
"top_ids": [
|
||||
"mem_1790424365997011289",
|
||||
"mem_1792126499467223243",
|
||||
"mem_1788602693814224919",
|
||||
"mem_1791725846574107784",
|
||||
"mem_1789222925018439889",
|
||||
"mem_1791666995981185275",
|
||||
"mem_1792088552818471375",
|
||||
"mem_1791686097363885894",
|
||||
"mem_1789554588799449124",
|
||||
"mem_1791420422726554280",
|
||||
"mem_1791686088996261165",
|
||||
"mem_1789760781378060592",
|
||||
"mem_1790427668905832166",
|
||||
"mem_1791111607517908194",
|
||||
"mem_1791818212646773755",
|
||||
"mem_1790051973384869549",
|
||||
"mem_1790564623527240562",
|
||||
"mem_1789992010025213786",
|
||||
"mem_1792088552819583406",
|
||||
"mem_1791685772880116219"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.99,
|
||||
0.5,
|
||||
0.285,
|
||||
0,
|
||||
0.755,
|
||||
0,
|
||||
0.5,
|
||||
0,
|
||||
0.755,
|
||||
0.914629,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.63,
|
||||
0.755,
|
||||
0.755,
|
||||
0.99,
|
||||
0.5,
|
||||
0
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
}
|
||||
]
|
||||
}
|
||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,82 @@
|
||||
{
|
||||
"at": "20261016-185023",
|
||||
"tag": "NOV",
|
||||
"base": "http://127.0.0.1:7893",
|
||||
"keyword_pass": 14,
|
||||
"keyword_fail": 0,
|
||||
"keyword_total": 14,
|
||||
"recall_at_5": 0.42857142857142855,
|
||||
"mrr": 0.2380952380952381,
|
||||
"items": [
|
||||
{
|
||||
"query": "织忆是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆的图谱扩展机制是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "织忆如何通过 E1 提取和 MMR 实现多样去重",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "牧尘的偏好是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "牧尘喜欢什么样的工作方式",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "如何根据牧尘的偏好调整记忆检索策略",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "当前项目的技术栈是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "织忆项目有哪些核心组件",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆和其他记忆系统相比有什么架构优势",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "如何使用 recall 接口",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆有哪些管理工具",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "如何通过 API 扩展织忆功能",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "本地 llama 服务 8080 端口",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "session-to-zhiyi.py 脚本名",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
}
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,932 @@
|
||||
{
|
||||
"at": "20261016-185030",
|
||||
"tag": "NOV",
|
||||
"base": "http://127.0.0.1:7893",
|
||||
"top_k": 20,
|
||||
"rows": [
|
||||
{
|
||||
"query": "牧尘工作所在的县是哪个",
|
||||
"latency_ms": 828,
|
||||
"top_ids": [
|
||||
"mem_1792088552818864597",
|
||||
"mem_1792144084503554069",
|
||||
"mem_1792144084726385461",
|
||||
"mem_1790349546889496890",
|
||||
"mem_1787450890745924038",
|
||||
"mem_1790448247125520424",
|
||||
"mem_1789063252280657787",
|
||||
"mem_1792088552817383356",
|
||||
"ep_1786293372952742428",
|
||||
"mem_1792144084989342595",
|
||||
"mem_1789815923678472264",
|
||||
"mem_1788006341389931001",
|
||||
"mem_1790425119425241515",
|
||||
"mem_1791556228356038757",
|
||||
"mem_1789230281180128695",
|
||||
"mem_1792088552824873585",
|
||||
"mem_1792088552817930263",
|
||||
"mem_1790424260127845812",
|
||||
"mem_1789737493969591957",
|
||||
"mem_1787926246493058856"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.5,
|
||||
0.59,
|
||||
0.59,
|
||||
0.755,
|
||||
0.255,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0,
|
||||
0.59,
|
||||
0.83,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.753,
|
||||
0.755,
|
||||
0.775
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "淇县",
|
||||
"latency_ms": 748,
|
||||
"top_ids": [
|
||||
"mem_1792144084726385461",
|
||||
"mem_1792088552818354175",
|
||||
"mem_1792088552818868548",
|
||||
"mem_1792088552818381759",
|
||||
"mem_1792144084503554069",
|
||||
"mem_1790938090098284542",
|
||||
"mem_1790938089297531705",
|
||||
"mem_1790603669933523968",
|
||||
"mem_1792088552818672993",
|
||||
"mem_1790425189400296970",
|
||||
"mem_1791564884666490485",
|
||||
"mem_1790848976254029727",
|
||||
"mem_1792088552819307750",
|
||||
"mem_1790657384251944657",
|
||||
"mem_1789328667925309581",
|
||||
"mem_1792116219795602288",
|
||||
"mem_1790425213354467843",
|
||||
"mem_1791395173327211388",
|
||||
"mem_1792141689103478828",
|
||||
"mem_1792088552819293505"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
1
|
||||
],
|
||||
"quality_scores": [
|
||||
0.59,
|
||||
0.5,
|
||||
0.5,
|
||||
0.5,
|
||||
0.59,
|
||||
0.83,
|
||||
0.83,
|
||||
0,
|
||||
0.5,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755,
|
||||
0.83,
|
||||
0.63,
|
||||
0.755,
|
||||
0.675,
|
||||
0.525,
|
||||
0.99
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 1,
|
||||
"v_pos_ids": [
|
||||
"mem_1792088552819293505"
|
||||
]
|
||||
},
|
||||
{
|
||||
"query": "招商项目台账",
|
||||
"latency_ms": 692,
|
||||
"top_ids": [
|
||||
"mem_1790657711315786810",
|
||||
"mem_1790425023223201421",
|
||||
"mem_1792088552819227083",
|
||||
"mem_1792088552817389514",
|
||||
"mem_1791194371133842796",
|
||||
"mem_1790565541250175254",
|
||||
"mem_1791387362920806120",
|
||||
"mem_1791899910885939521",
|
||||
"mem_1789694252600441660",
|
||||
"mem_1791665519266094329",
|
||||
"mem_1790309303666562764",
|
||||
"mem_1790581054400784704",
|
||||
"mem_1792088552818016699",
|
||||
"mem_1792088552818037737",
|
||||
"mem_1790590528061314469",
|
||||
"mem_1790187043969918230",
|
||||
"mem_1790448247323881504",
|
||||
"mem_1790329285912241710",
|
||||
"mem_1792088552817184125",
|
||||
"mem_1789327284892773149"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.755,
|
||||
0.853,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.765,
|
||||
0.59,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "生物制造产业专班",
|
||||
"latency_ms": 708,
|
||||
"top_ids": [
|
||||
"mem_1792144084989342595",
|
||||
"mem_1792107514588524675",
|
||||
"mem_1791567307185364992",
|
||||
"mem_1790051867711758989",
|
||||
"mem_1789983973135821157",
|
||||
"mem_1792088552816455607",
|
||||
"mem_1791380468697720355",
|
||||
"mem_1792088552817215072",
|
||||
"mem_1790658098063956127",
|
||||
"mem_1792088552825118896",
|
||||
"mem_1790656401441522455",
|
||||
"mem_1789755524758238574",
|
||||
"mem_1789741519238314161",
|
||||
"mem_1789736468534024216",
|
||||
"mem_1789731934167097953",
|
||||
"mem_1791916787313401423",
|
||||
"mem_1787336595731500272",
|
||||
"mem_1791794756620086535",
|
||||
"mem_1791811143462384371",
|
||||
"mem_1791735819718797684"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.59,
|
||||
0.63,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.78,
|
||||
0.5,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.798,
|
||||
0.395,
|
||||
0.695,
|
||||
0.63,
|
||||
0.315,
|
||||
0.6
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "小怡的工作笔记在哪",
|
||||
"latency_ms": 736,
|
||||
"top_ids": [
|
||||
"mem_1791365211038188118",
|
||||
"mem_1792088552817459951",
|
||||
"mem_1789155186005621317",
|
||||
"mem_1790441160106001927",
|
||||
"mem_1791736002933120377",
|
||||
"mem_1792118701572499829",
|
||||
"mem_1792088552818645685",
|
||||
"mem_1791915848530338805",
|
||||
"mem_1791383333319512288",
|
||||
"mem_1792088552818535755",
|
||||
"mem_1790187044046223493",
|
||||
"mem_1792088552824837822",
|
||||
"mem_1792088552817461960",
|
||||
"mem_1791423103974079882",
|
||||
"mem_1792088552825338800"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.8,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.39,
|
||||
0.63,
|
||||
0.5,
|
||||
0.5,
|
||||
0.8,
|
||||
0.5,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.6,
|
||||
0.5
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "昨天做了什么",
|
||||
"latency_ms": 791,
|
||||
"top_ids": [
|
||||
"mem_1788341686813816985",
|
||||
"mem_1790425119425241515",
|
||||
"mem_1791633893565216844",
|
||||
"mem_1790455525438011532",
|
||||
"mem_1792083942223793654",
|
||||
"mem_1792088770119950733",
|
||||
"mem_1790805789157124891",
|
||||
"mem_1792107513668237224",
|
||||
"mem_1789431180512315186",
|
||||
"mem_1790425238816494139",
|
||||
"mem_1790424256264891954",
|
||||
"mem_1787926246433496550",
|
||||
"mem_1790425017614420145",
|
||||
"mem_1790581068974704280",
|
||||
"mem_1789327284892773149",
|
||||
"mem_1790226520252986178",
|
||||
"mem_1790269130144600786",
|
||||
"mem_1791819411153164256",
|
||||
"mem_1789827897771148953",
|
||||
"mem_1788166192802637740"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.395,
|
||||
0.63,
|
||||
0.755,
|
||||
0.63,
|
||||
0.515,
|
||||
0.755,
|
||||
0.755,
|
||||
0.775,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.395,
|
||||
0.755,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "飞书怎么发语音",
|
||||
"latency_ms": 723,
|
||||
"top_ids": [
|
||||
"mem_1790345721671326922",
|
||||
"mem_1790350480105660984",
|
||||
"mem_1790425022831993728",
|
||||
"mem_1791118583544396904",
|
||||
"mem_1791533226241026355",
|
||||
"mem_1790455570122981543",
|
||||
"mem_1791445601992763027",
|
||||
"mem_1790496848751501955",
|
||||
"mem_1789273123503223085",
|
||||
"mem_1791666641349257940",
|
||||
"mem_1791666631693960928",
|
||||
"mem_1792088552825510526",
|
||||
"mem_1791666639652621391",
|
||||
"mem_1790265788637717626",
|
||||
"mem_1790428068416795396",
|
||||
"mem_1791118583617248844",
|
||||
"mem_1791666711653684211",
|
||||
"mem_1789557079608816710",
|
||||
"mem_1789327693618007907",
|
||||
"mem_1789273123339483168"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.803,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.803,
|
||||
0,
|
||||
0.83,
|
||||
0.755,
|
||||
0,
|
||||
0.789,
|
||||
0.5,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.805,
|
||||
0.755,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "家服怎么连",
|
||||
"latency_ms": 722,
|
||||
"top_ids": [
|
||||
"mem_1791556229473565240",
|
||||
"mem_1792084245285474959",
|
||||
"mem_1792088552818289574",
|
||||
"mem_1790180705032672204",
|
||||
"mem_1792100307763093595",
|
||||
"mem_1791665516356975992",
|
||||
"mem_1792084245095017393",
|
||||
"mem_1792082720405068478",
|
||||
"mem_1791440639711180469",
|
||||
"mem_1792114886051333715",
|
||||
"mem_1792088552825127031",
|
||||
"mem_1791642436962837771",
|
||||
"mem_1792088552819438066",
|
||||
"mem_1792088552816808997",
|
||||
"mem_1790187091203506519",
|
||||
"mem_1792126203805297968",
|
||||
"mem_1792088552819539001",
|
||||
"mem_1791904832104972267",
|
||||
"mem_1792088552818662517",
|
||||
"mem_1792088552824945417"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0,
|
||||
0.63,
|
||||
0.5,
|
||||
0.755,
|
||||
0.63,
|
||||
0.8,
|
||||
0.63,
|
||||
0.63,
|
||||
0,
|
||||
0.63,
|
||||
0.5,
|
||||
0.65,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.395,
|
||||
0.5,
|
||||
0.43,
|
||||
0.5,
|
||||
0.5
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "织忆怎么部署",
|
||||
"latency_ms": 682,
|
||||
"top_ids": [
|
||||
"mem_1788623666023332134",
|
||||
"mem_1789793765940732350",
|
||||
"mem_1791479003228249623",
|
||||
"mem_1789149704491770048",
|
||||
"mem_1789154058288011112",
|
||||
"mem_1791818814047111008",
|
||||
"mem_1792144557208382006",
|
||||
"mem_1791402157932171759",
|
||||
"mem_1791899478077693848",
|
||||
"mem_1789411888019473186",
|
||||
"mem_1792088552825130331",
|
||||
"mem_1792088552817959556",
|
||||
"mem_1791912042293867384",
|
||||
"mem_1788657176712786530",
|
||||
"mem_1790424244350350337",
|
||||
"mem_1791740271337572997",
|
||||
"mem_1792088552818065436",
|
||||
"mem_1789132107404617336",
|
||||
"mem_1788340352324421455",
|
||||
"mem_1791431677583759030"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
1,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.911,
|
||||
0.755,
|
||||
0,
|
||||
0.99,
|
||||
0.695,
|
||||
0.63,
|
||||
0.565,
|
||||
0.99,
|
||||
0.644,
|
||||
0.865,
|
||||
0.5,
|
||||
0.5,
|
||||
0.59,
|
||||
0.755,
|
||||
0.99,
|
||||
0,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.675
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 1,
|
||||
"v_pos_ids": [
|
||||
"mem_1791740271337572997"
|
||||
]
|
||||
},
|
||||
{
|
||||
"query": "记忆保护名单",
|
||||
"latency_ms": 664,
|
||||
"top_ids": [
|
||||
"mem_1790424365997011289",
|
||||
"mem_1792126499467223243",
|
||||
"mem_1788602693814224919",
|
||||
"mem_1791725846574107784",
|
||||
"mem_1789222925018439889",
|
||||
"mem_1791666995981185275",
|
||||
"mem_1792088552818471375",
|
||||
"mem_1791686097363885894",
|
||||
"mem_1789554588799449124",
|
||||
"mem_1791420422726554280",
|
||||
"mem_1791686088996261165",
|
||||
"mem_1789760781378060592",
|
||||
"mem_1790427668905832166",
|
||||
"mem_1791111607517908194",
|
||||
"mem_1791818212646773755",
|
||||
"mem_1790051973384869549",
|
||||
"mem_1790564623527240562",
|
||||
"mem_1789992010025213786",
|
||||
"mem_1792088552819583406",
|
||||
"mem_1791685772880116219"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.99,
|
||||
0.5,
|
||||
0.285,
|
||||
0,
|
||||
0.755,
|
||||
0,
|
||||
0.5,
|
||||
0,
|
||||
0.755,
|
||||
0.914629,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.63,
|
||||
0.755,
|
||||
0.755,
|
||||
0.99,
|
||||
0.5,
|
||||
0
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
}
|
||||
]
|
||||
}
|
||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,82 @@
|
||||
{
|
||||
"at": "20261016-183633",
|
||||
"tag": "PRE",
|
||||
"base": "http://127.0.0.1:7891",
|
||||
"keyword_pass": 14,
|
||||
"keyword_fail": 0,
|
||||
"keyword_total": 14,
|
||||
"recall_at_5": 0.42857142857142855,
|
||||
"mrr": 0.2380952380952381,
|
||||
"items": [
|
||||
{
|
||||
"query": "织忆是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆的图谱扩展机制是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "织忆如何通过 E1 提取和 MMR 实现多样去重",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "牧尘的偏好是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "牧尘喜欢什么样的工作方式",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "如何根据牧尘的偏好调整记忆检索策略",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "当前项目的技术栈是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "织忆项目有哪些核心组件",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆和其他记忆系统相比有什么架构优势",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "如何使用 recall 接口",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆有哪些管理工具",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "如何通过 API 扩展织忆功能",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "本地 llama 服务 8080 端口",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "session-to-zhiyi.py 脚本名",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
}
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,932 @@
|
||||
{
|
||||
"at": "20261016-183639",
|
||||
"tag": "PRE",
|
||||
"base": "http://127.0.0.1:7891",
|
||||
"top_k": 20,
|
||||
"rows": [
|
||||
{
|
||||
"query": "牧尘工作所在的县是哪个",
|
||||
"latency_ms": 670,
|
||||
"top_ids": [
|
||||
"mem_1792088552818864597",
|
||||
"mem_1792144084503554069",
|
||||
"mem_1792144084726385461",
|
||||
"mem_1790349546889496890",
|
||||
"mem_1787450890745924038",
|
||||
"mem_1790448247125520424",
|
||||
"mem_1789063252280657787",
|
||||
"mem_1792088552817383356",
|
||||
"ep_1786293372952742428",
|
||||
"mem_1792144084989342595",
|
||||
"mem_1789815923678472264",
|
||||
"mem_1788006341389931001",
|
||||
"mem_1790425119425241515",
|
||||
"mem_1791556228356038757",
|
||||
"mem_1789230281180128695",
|
||||
"mem_1792088552824873585",
|
||||
"mem_1792088552817930263",
|
||||
"mem_1790424260127845812",
|
||||
"mem_1789737493969591957",
|
||||
"mem_1787926246493058856"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.5,
|
||||
0.59,
|
||||
0.59,
|
||||
0.755,
|
||||
0.255,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0,
|
||||
0.59,
|
||||
0.83,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.753,
|
||||
0.755,
|
||||
0.775
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "淇县",
|
||||
"latency_ms": 699,
|
||||
"top_ids": [
|
||||
"mem_1792144084726385461",
|
||||
"mem_1792088552818354175",
|
||||
"mem_1792088552818868548",
|
||||
"mem_1792088552818381759",
|
||||
"mem_1792144084503554069",
|
||||
"mem_1790938090098284542",
|
||||
"mem_1790938089297531705",
|
||||
"mem_1790603669933523968",
|
||||
"mem_1792088552818672993",
|
||||
"mem_1790425189400296970",
|
||||
"mem_1791564884666490485",
|
||||
"mem_1790848976254029727",
|
||||
"mem_1792088552819307750",
|
||||
"mem_1790657384251944657",
|
||||
"mem_1789328667925309581",
|
||||
"mem_1792116219795602288",
|
||||
"mem_1790425213354467843",
|
||||
"mem_1791395173327211388",
|
||||
"mem_1792141689103478828",
|
||||
"mem_1792088552819293505"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
1
|
||||
],
|
||||
"quality_scores": [
|
||||
0.59,
|
||||
0.5,
|
||||
0.5,
|
||||
0.5,
|
||||
0.59,
|
||||
0.83,
|
||||
0.83,
|
||||
0,
|
||||
0.5,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755,
|
||||
0.83,
|
||||
0.63,
|
||||
0.755,
|
||||
0.675,
|
||||
0.525,
|
||||
0.99
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 1,
|
||||
"v_pos_ids": [
|
||||
"mem_1792088552819293505"
|
||||
]
|
||||
},
|
||||
{
|
||||
"query": "招商项目台账",
|
||||
"latency_ms": 682,
|
||||
"top_ids": [
|
||||
"mem_1790657711315786810",
|
||||
"mem_1790425023223201421",
|
||||
"mem_1792088552819227083",
|
||||
"mem_1792088552817389514",
|
||||
"mem_1791194371133842796",
|
||||
"mem_1790565541250175254",
|
||||
"mem_1791387362920806120",
|
||||
"mem_1791899910885939521",
|
||||
"mem_1789694252600441660",
|
||||
"mem_1791665519266094329",
|
||||
"mem_1790309303666562764",
|
||||
"mem_1790581054400784704",
|
||||
"mem_1792088552818016699",
|
||||
"mem_1792088552818037737",
|
||||
"mem_1790590528061314469",
|
||||
"mem_1790187043969918230",
|
||||
"mem_1790448247323881504",
|
||||
"mem_1790329285912241710",
|
||||
"mem_1792088552817184125",
|
||||
"mem_1789327284892773149"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.755,
|
||||
0.853,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.765,
|
||||
0.59,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "生物制造产业专班",
|
||||
"latency_ms": 675,
|
||||
"top_ids": [
|
||||
"mem_1792144084989342595",
|
||||
"mem_1792107514588524675",
|
||||
"mem_1791567307185364992",
|
||||
"mem_1790051867711758989",
|
||||
"mem_1789983973135821157",
|
||||
"mem_1792088552816455607",
|
||||
"mem_1791380468697720355",
|
||||
"mem_1792088552817215072",
|
||||
"mem_1790658098063956127",
|
||||
"mem_1792088552825118896",
|
||||
"mem_1790656401441522455",
|
||||
"mem_1789755524758238574",
|
||||
"mem_1789741519238314161",
|
||||
"mem_1789736468534024216",
|
||||
"mem_1789731934167097953",
|
||||
"mem_1791916787313401423",
|
||||
"mem_1787336595731500272",
|
||||
"mem_1791794756620086535",
|
||||
"mem_1791811143462384371",
|
||||
"mem_1791735819718797684"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.59,
|
||||
0.63,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.78,
|
||||
0.5,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.798,
|
||||
0.395,
|
||||
0.695,
|
||||
0.63,
|
||||
0.315,
|
||||
0.6
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "小怡的工作笔记在哪",
|
||||
"latency_ms": 583,
|
||||
"top_ids": [
|
||||
"mem_1791365211038188118",
|
||||
"mem_1792088552817459951",
|
||||
"mem_1789155186005621317",
|
||||
"mem_1790441160106001927",
|
||||
"mem_1791736002933120377",
|
||||
"mem_1792118701572499829",
|
||||
"mem_1792088552818645685",
|
||||
"mem_1791915848530338805",
|
||||
"mem_1791383333319512288",
|
||||
"mem_1792088552818535755",
|
||||
"mem_1790187044046223493",
|
||||
"mem_1792088552824837822",
|
||||
"mem_1792088552817461960",
|
||||
"mem_1791423103974079882",
|
||||
"mem_1792088552825338800"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.8,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.39,
|
||||
0.63,
|
||||
0.5,
|
||||
0.5,
|
||||
0.8,
|
||||
0.5,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.6,
|
||||
0.5
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "昨天做了什么",
|
||||
"latency_ms": 737,
|
||||
"top_ids": [
|
||||
"mem_1788341686813816985",
|
||||
"mem_1790425119425241515",
|
||||
"mem_1791633893565216844",
|
||||
"mem_1790455525438011532",
|
||||
"mem_1792083942223793654",
|
||||
"mem_1792088770119950733",
|
||||
"mem_1790805789157124891",
|
||||
"mem_1792107513668237224",
|
||||
"mem_1789431180512315186",
|
||||
"mem_1790425238816494139",
|
||||
"mem_1790424256264891954",
|
||||
"mem_1787926246433496550",
|
||||
"mem_1790425017614420145",
|
||||
"mem_1790581068974704280",
|
||||
"mem_1789327284892773149",
|
||||
"mem_1790226520252986178",
|
||||
"mem_1790269130144600786",
|
||||
"mem_1791819411153164256",
|
||||
"mem_1789827897771148953",
|
||||
"mem_1788166192802637740"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.395,
|
||||
0.63,
|
||||
0.755,
|
||||
0.63,
|
||||
0.515,
|
||||
0.755,
|
||||
0.755,
|
||||
0.775,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.395,
|
||||
0.755,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "飞书怎么发语音",
|
||||
"latency_ms": 710,
|
||||
"top_ids": [
|
||||
"mem_1790345721671326922",
|
||||
"mem_1790350480105660984",
|
||||
"mem_1790425022831993728",
|
||||
"mem_1791118583544396904",
|
||||
"mem_1791533226241026355",
|
||||
"mem_1790455570122981543",
|
||||
"mem_1791445601992763027",
|
||||
"mem_1790496848751501955",
|
||||
"mem_1789273123503223085",
|
||||
"mem_1791666641349257940",
|
||||
"mem_1791666631693960928",
|
||||
"mem_1792088552825510526",
|
||||
"mem_1791666639652621391",
|
||||
"mem_1790265788637717626",
|
||||
"mem_1790428068416795396",
|
||||
"mem_1791118583617248844",
|
||||
"mem_1791666711653684211",
|
||||
"mem_1789557079608816710",
|
||||
"mem_1789327693618007907",
|
||||
"mem_1789273123339483168"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.803,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.803,
|
||||
0,
|
||||
0.83,
|
||||
0.755,
|
||||
0,
|
||||
0.789,
|
||||
0.5,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.805,
|
||||
0.755,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "家服怎么连",
|
||||
"latency_ms": 718,
|
||||
"top_ids": [
|
||||
"mem_1791556229473565240",
|
||||
"mem_1792084245285474959",
|
||||
"mem_1792088552818289574",
|
||||
"mem_1790180705032672204",
|
||||
"mem_1792100307763093595",
|
||||
"mem_1791665516356975992",
|
||||
"mem_1792084245095017393",
|
||||
"mem_1792082720405068478",
|
||||
"mem_1791440639711180469",
|
||||
"mem_1792114886051333715",
|
||||
"mem_1792088552825127031",
|
||||
"mem_1791642436962837771",
|
||||
"mem_1792088552819438066",
|
||||
"mem_1792088552816808997",
|
||||
"mem_1790187091203506519",
|
||||
"mem_1792126203805297968",
|
||||
"mem_1792088552819539001",
|
||||
"mem_1791904832104972267",
|
||||
"mem_1792088552818662517",
|
||||
"mem_1792088552824945417"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0,
|
||||
0.63,
|
||||
0.5,
|
||||
0.755,
|
||||
0.63,
|
||||
0.8,
|
||||
0.63,
|
||||
0.63,
|
||||
0,
|
||||
0.63,
|
||||
0.5,
|
||||
0.65,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.395,
|
||||
0.5,
|
||||
0.43,
|
||||
0.5,
|
||||
0.5
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "织忆怎么部署",
|
||||
"latency_ms": 732,
|
||||
"top_ids": [
|
||||
"mem_1788623666023332134",
|
||||
"mem_1789793765940732350",
|
||||
"mem_1791479003228249623",
|
||||
"mem_1789149704491770048",
|
||||
"mem_1789154058288011112",
|
||||
"mem_1791818814047111008",
|
||||
"mem_1792144557208382006",
|
||||
"mem_1791402157932171759",
|
||||
"mem_1791899478077693848",
|
||||
"mem_1789411888019473186",
|
||||
"mem_1792088552825130331",
|
||||
"mem_1792088552817959556",
|
||||
"mem_1791912042293867384",
|
||||
"mem_1788657176712786530",
|
||||
"mem_1790424244350350337",
|
||||
"mem_1791740271337572997",
|
||||
"mem_1792088552818065436",
|
||||
"mem_1789132107404617336",
|
||||
"mem_1788340352324421455",
|
||||
"mem_1791431677583759030"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
1,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.911,
|
||||
0.755,
|
||||
0,
|
||||
0.99,
|
||||
0.695,
|
||||
0.63,
|
||||
0.565,
|
||||
0.99,
|
||||
0.644,
|
||||
0.865,
|
||||
0.5,
|
||||
0.5,
|
||||
0.59,
|
||||
0.755,
|
||||
0.99,
|
||||
0,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.675
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 1,
|
||||
"v_pos_ids": [
|
||||
"mem_1791740271337572997"
|
||||
]
|
||||
},
|
||||
{
|
||||
"query": "记忆保护名单",
|
||||
"latency_ms": 694,
|
||||
"top_ids": [
|
||||
"mem_1790424365997011289",
|
||||
"mem_1792126499467223243",
|
||||
"mem_1788602693814224919",
|
||||
"mem_1791725846574107784",
|
||||
"mem_1789222925018439889",
|
||||
"mem_1791666995981185275",
|
||||
"mem_1792088552818471375",
|
||||
"mem_1791686097363885894",
|
||||
"mem_1789554588799449124",
|
||||
"mem_1791420422726554280",
|
||||
"mem_1791686088996261165",
|
||||
"mem_1789760781378060592",
|
||||
"mem_1790427668905832166",
|
||||
"mem_1791111607517908194",
|
||||
"mem_1791818212646773755",
|
||||
"mem_1790051973384869549",
|
||||
"mem_1790564623527240562",
|
||||
"mem_1789992010025213786",
|
||||
"mem_1792088552819583406",
|
||||
"mem_1791685772880116219"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.99,
|
||||
0.5,
|
||||
0.285,
|
||||
0,
|
||||
0.755,
|
||||
0,
|
||||
0.5,
|
||||
0,
|
||||
0.755,
|
||||
0.914629,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.63,
|
||||
0.755,
|
||||
0.755,
|
||||
0.99,
|
||||
0.5,
|
||||
0
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
}
|
||||
]
|
||||
}
|
||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,82 @@
|
||||
{
|
||||
"at": "20261016-191108",
|
||||
"tag": "RBK",
|
||||
"base": "http://127.0.0.1:7892",
|
||||
"keyword_pass": 14,
|
||||
"keyword_fail": 0,
|
||||
"keyword_total": 14,
|
||||
"recall_at_5": 0.42857142857142855,
|
||||
"mrr": 0.2380952380952381,
|
||||
"items": [
|
||||
{
|
||||
"query": "织忆是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆的图谱扩展机制是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "织忆如何通过 E1 提取和 MMR 实现多样去重",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "牧尘的偏好是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "牧尘喜欢什么样的工作方式",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "如何根据牧尘的偏好调整记忆检索策略",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "当前项目的技术栈是什么",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "织忆项目有哪些核心组件",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆和其他记忆系统相比有什么架构优势",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
},
|
||||
{
|
||||
"query": "如何使用 recall 接口",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "织忆有哪些管理工具",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "如何通过 API 扩展织忆功能",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "本地 llama 服务 8080 端口",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 0
|
||||
},
|
||||
{
|
||||
"query": "session-to-zhiyi.py 脚本名",
|
||||
"keyword_ok": true,
|
||||
"id_recall": 1
|
||||
}
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,932 @@
|
||||
{
|
||||
"at": "20261016-191116",
|
||||
"tag": "RBK",
|
||||
"base": "http://127.0.0.1:7892",
|
||||
"top_k": 20,
|
||||
"rows": [
|
||||
{
|
||||
"query": "牧尘工作所在的县是哪个",
|
||||
"latency_ms": 836,
|
||||
"top_ids": [
|
||||
"mem_1792088552818864597",
|
||||
"mem_1792144084503554069",
|
||||
"mem_1792144084726385461",
|
||||
"mem_1790349546889496890",
|
||||
"mem_1787450890745924038",
|
||||
"mem_1790448247125520424",
|
||||
"mem_1789063252280657787",
|
||||
"mem_1792088552817383356",
|
||||
"ep_1786293372952742428",
|
||||
"mem_1792144084989342595",
|
||||
"mem_1789815923678472264",
|
||||
"mem_1788006341389931001",
|
||||
"mem_1790425119425241515",
|
||||
"mem_1791556228356038757",
|
||||
"mem_1789230281180128695",
|
||||
"mem_1792088552824873585",
|
||||
"mem_1792088552817930263",
|
||||
"mem_1790424260127845812",
|
||||
"mem_1789737493969591957",
|
||||
"mem_1787926246493058856"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.5,
|
||||
0.59,
|
||||
0.59,
|
||||
0.755,
|
||||
0.255,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0,
|
||||
0.59,
|
||||
0.83,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.753,
|
||||
0.755,
|
||||
0.775
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "淇县",
|
||||
"latency_ms": 789,
|
||||
"top_ids": [
|
||||
"mem_1792144084726385461",
|
||||
"mem_1792088552818354175",
|
||||
"mem_1792088552818868548",
|
||||
"mem_1792088552818381759",
|
||||
"mem_1792144084503554069",
|
||||
"mem_1790938090098284542",
|
||||
"mem_1790938089297531705",
|
||||
"mem_1790603669933523968",
|
||||
"mem_1792088552818672993",
|
||||
"mem_1790425189400296970",
|
||||
"mem_1791564884666490485",
|
||||
"mem_1790848976254029727",
|
||||
"mem_1792088552819307750",
|
||||
"mem_1790657384251944657",
|
||||
"mem_1789328667925309581",
|
||||
"mem_1792116219795602288",
|
||||
"mem_1790425213354467843",
|
||||
"mem_1791395173327211388",
|
||||
"mem_1792141689103478828",
|
||||
"mem_1792088552819293505"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
1
|
||||
],
|
||||
"quality_scores": [
|
||||
0.59,
|
||||
0.5,
|
||||
0.5,
|
||||
0.5,
|
||||
0.59,
|
||||
0.83,
|
||||
0.83,
|
||||
0,
|
||||
0.5,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755,
|
||||
0.83,
|
||||
0.63,
|
||||
0.755,
|
||||
0.675,
|
||||
0.525,
|
||||
0.99
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 1,
|
||||
"v_pos_ids": [
|
||||
"mem_1792088552819293505"
|
||||
]
|
||||
},
|
||||
{
|
||||
"query": "招商项目台账",
|
||||
"latency_ms": 730,
|
||||
"top_ids": [
|
||||
"mem_1790657711315786810",
|
||||
"mem_1790425023223201421",
|
||||
"mem_1792088552819227083",
|
||||
"mem_1792088552817389514",
|
||||
"mem_1791194371133842796",
|
||||
"mem_1790565541250175254",
|
||||
"mem_1791387362920806120",
|
||||
"mem_1791899910885939521",
|
||||
"mem_1789694252600441660",
|
||||
"mem_1791665519266094329",
|
||||
"mem_1790309303666562764",
|
||||
"mem_1790581054400784704",
|
||||
"mem_1792088552818016699",
|
||||
"mem_1792088552818037737",
|
||||
"mem_1790590528061314469",
|
||||
"mem_1790187043969918230",
|
||||
"mem_1790448247323881504",
|
||||
"mem_1790329285912241710",
|
||||
"mem_1792088552817184125",
|
||||
"mem_1789327284892773149"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.755,
|
||||
0.853,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.765,
|
||||
0.59,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "生物制造产业专班",
|
||||
"latency_ms": 753,
|
||||
"top_ids": [
|
||||
"mem_1792144084989342595",
|
||||
"mem_1792107514588524675",
|
||||
"mem_1791567307185364992",
|
||||
"mem_1790051867711758989",
|
||||
"mem_1789983973135821157",
|
||||
"mem_1792088552816455607",
|
||||
"mem_1791380468697720355",
|
||||
"mem_1792088552817215072",
|
||||
"mem_1790658098063956127",
|
||||
"mem_1792088552825118896",
|
||||
"mem_1790656401441522455",
|
||||
"mem_1789755524758238574",
|
||||
"mem_1789741519238314161",
|
||||
"mem_1789736468534024216",
|
||||
"mem_1789731934167097953",
|
||||
"mem_1791916787313401423",
|
||||
"mem_1787336595731500272",
|
||||
"mem_1791794756620086535",
|
||||
"mem_1791811143462384371",
|
||||
"mem_1791735819718797684"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.59,
|
||||
0.63,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.5,
|
||||
0.78,
|
||||
0.5,
|
||||
0.755,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.798,
|
||||
0.395,
|
||||
0.695,
|
||||
0.63,
|
||||
0.315,
|
||||
0.6
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "小怡的工作笔记在哪",
|
||||
"latency_ms": 653,
|
||||
"top_ids": [
|
||||
"mem_1791365211038188118",
|
||||
"mem_1792088552817459951",
|
||||
"mem_1789155186005621317",
|
||||
"mem_1790441160106001927",
|
||||
"mem_1791736002933120377",
|
||||
"mem_1792118701572499829",
|
||||
"mem_1792088552818645685",
|
||||
"mem_1791915848530338805",
|
||||
"mem_1791383333319512288",
|
||||
"mem_1792088552818535755",
|
||||
"mem_1790187044046223493",
|
||||
"mem_1792088552824837822",
|
||||
"mem_1792088552817461960",
|
||||
"mem_1791423103974079882",
|
||||
"mem_1792088552825338800"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.8,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.39,
|
||||
0.63,
|
||||
0.5,
|
||||
0.5,
|
||||
0.8,
|
||||
0.5,
|
||||
0.755,
|
||||
0.5,
|
||||
0.5,
|
||||
0.6,
|
||||
0.5
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "昨天做了什么",
|
||||
"latency_ms": 739,
|
||||
"top_ids": [
|
||||
"mem_1788341686813816985",
|
||||
"mem_1790425119425241515",
|
||||
"mem_1791633893565216844",
|
||||
"mem_1790455525438011532",
|
||||
"mem_1792083942223793654",
|
||||
"mem_1792088770119950733",
|
||||
"mem_1790805789157124891",
|
||||
"mem_1792107513668237224",
|
||||
"mem_1789431180512315186",
|
||||
"mem_1790425238816494139",
|
||||
"mem_1790424256264891954",
|
||||
"mem_1787926246433496550",
|
||||
"mem_1790425017614420145",
|
||||
"mem_1790581068974704280",
|
||||
"mem_1789327284892773149",
|
||||
"mem_1790226520252986178",
|
||||
"mem_1790269130144600786",
|
||||
"mem_1791819411153164256",
|
||||
"mem_1789827897771148953",
|
||||
"mem_1788166192802637740"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.395,
|
||||
0.63,
|
||||
0.755,
|
||||
0.63,
|
||||
0.515,
|
||||
0.755,
|
||||
0.755,
|
||||
0.775,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.755,
|
||||
0.395,
|
||||
0.755,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "飞书怎么发语音",
|
||||
"latency_ms": 810,
|
||||
"top_ids": [
|
||||
"mem_1790345721671326922",
|
||||
"mem_1790350480105660984",
|
||||
"mem_1790425022831993728",
|
||||
"mem_1791118583544396904",
|
||||
"mem_1791533226241026355",
|
||||
"mem_1790455570122981543",
|
||||
"mem_1791445601992763027",
|
||||
"mem_1790496848751501955",
|
||||
"mem_1789273123503223085",
|
||||
"mem_1791666641349257940",
|
||||
"mem_1791666631693960928",
|
||||
"mem_1792088552825510526",
|
||||
"mem_1791666639652621391",
|
||||
"mem_1790265788637717626",
|
||||
"mem_1790428068416795396",
|
||||
"mem_1791118583617248844",
|
||||
"mem_1791666711653684211",
|
||||
"mem_1789557079608816710",
|
||||
"mem_1789327693618007907",
|
||||
"mem_1789273123339483168"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.803,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.803,
|
||||
0,
|
||||
0.83,
|
||||
0.755,
|
||||
0,
|
||||
0.789,
|
||||
0.5,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0,
|
||||
0.805,
|
||||
0.755,
|
||||
0.755
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "家服怎么连",
|
||||
"latency_ms": 787,
|
||||
"top_ids": [
|
||||
"mem_1791556229473565240",
|
||||
"mem_1792084245285474959",
|
||||
"mem_1792088552818289574",
|
||||
"mem_1790180705032672204",
|
||||
"mem_1792100307763093595",
|
||||
"mem_1791665516356975992",
|
||||
"mem_1792084245095017393",
|
||||
"mem_1792082720405068478",
|
||||
"mem_1791440639711180469",
|
||||
"mem_1792114886051333715",
|
||||
"mem_1792088552825127031",
|
||||
"mem_1791642436962837771",
|
||||
"mem_1792088552819438066",
|
||||
"mem_1792088552816808997",
|
||||
"mem_1790187091203506519",
|
||||
"mem_1792126203805297968",
|
||||
"mem_1792088552819539001",
|
||||
"mem_1791904832104972267",
|
||||
"mem_1792088552818662517",
|
||||
"mem_1792088552824945417"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0,
|
||||
0.63,
|
||||
0.5,
|
||||
0.755,
|
||||
0.63,
|
||||
0.8,
|
||||
0.63,
|
||||
0.63,
|
||||
0,
|
||||
0.63,
|
||||
0.5,
|
||||
0.65,
|
||||
0.5,
|
||||
0.5,
|
||||
0.755,
|
||||
0.395,
|
||||
0.5,
|
||||
0.43,
|
||||
0.5,
|
||||
0.5
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
},
|
||||
{
|
||||
"query": "织忆怎么部署",
|
||||
"latency_ms": 936,
|
||||
"top_ids": [
|
||||
"mem_1788623666023332134",
|
||||
"mem_1789793765940732350",
|
||||
"mem_1791479003228249623",
|
||||
"mem_1789149704491770048",
|
||||
"mem_1789154058288011112",
|
||||
"mem_1791818814047111008",
|
||||
"mem_1792144557208382006",
|
||||
"mem_1791402157932171759",
|
||||
"mem_1791899478077693848",
|
||||
"mem_1789411888019473186",
|
||||
"mem_1792088552825130331",
|
||||
"mem_1792088552817959556",
|
||||
"mem_1791912042293867384",
|
||||
"mem_1788657176712786530",
|
||||
"mem_1790424244350350337",
|
||||
"mem_1791740271337572997",
|
||||
"mem_1792088552818065436",
|
||||
"mem_1789132107404617336",
|
||||
"mem_1788340352324421455",
|
||||
"mem_1791431677583759030"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
1,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.911,
|
||||
0.755,
|
||||
0,
|
||||
0.99,
|
||||
0.695,
|
||||
0.63,
|
||||
0.565,
|
||||
0.99,
|
||||
0.644,
|
||||
0.865,
|
||||
0.5,
|
||||
0.5,
|
||||
0.59,
|
||||
0.755,
|
||||
0.99,
|
||||
0,
|
||||
0.5,
|
||||
0.755,
|
||||
0.755,
|
||||
0.675
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 1,
|
||||
"v_pos_ids": [
|
||||
"mem_1791740271337572997"
|
||||
]
|
||||
},
|
||||
{
|
||||
"query": "记忆保护名单",
|
||||
"latency_ms": 968,
|
||||
"top_ids": [
|
||||
"mem_1790424365997011289",
|
||||
"mem_1792126499467223243",
|
||||
"mem_1788602693814224919",
|
||||
"mem_1791725846574107784",
|
||||
"mem_1789222925018439889",
|
||||
"mem_1791666995981185275",
|
||||
"mem_1792088552818471375",
|
||||
"mem_1791686097363885894",
|
||||
"mem_1789554588799449124",
|
||||
"mem_1791420422726554280",
|
||||
"mem_1791686088996261165",
|
||||
"mem_1789760781378060592",
|
||||
"mem_1790427668905832166",
|
||||
"mem_1791111607517908194",
|
||||
"mem_1791818212646773755",
|
||||
"mem_1790051973384869549",
|
||||
"mem_1790564623527240562",
|
||||
"mem_1789992010025213786",
|
||||
"mem_1792088552819583406",
|
||||
"mem_1791685772880116219"
|
||||
],
|
||||
"v_values": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"quality_scores": [
|
||||
0.99,
|
||||
0.5,
|
||||
0.285,
|
||||
0,
|
||||
0.755,
|
||||
0,
|
||||
0.5,
|
||||
0,
|
||||
0.755,
|
||||
0.914629,
|
||||
0,
|
||||
0.755,
|
||||
0.755,
|
||||
0.755,
|
||||
0.63,
|
||||
0.755,
|
||||
0.755,
|
||||
0.99,
|
||||
0.5,
|
||||
0
|
||||
],
|
||||
"raw_quality_scores": [
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0,
|
||||
0
|
||||
],
|
||||
"v_pos": 0,
|
||||
"v_pos_ids": []
|
||||
}
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,116 @@
|
||||
# 交付说明 · t_5ad3f843【织忆·主症B 返修】元笔记分类器 + 咽喉点收口
|
||||
|
||||
- **卡号**:`t_5ad3f843` | **执行者**:prof-dev(2 次 run 均 `rc=1` 崩于"写交付说明"步骤)
|
||||
- **终审收口**:小怡(default)—— 逐条**亲跑**验证,不采信 worker 自报
|
||||
- **日期**:2026-10-16 | **commit**:`e85c9db`(代码)+ 本文件(证据)
|
||||
- **结论**:AC1–AC8 **全绿**;**生产未部署**(源码级交付)⇒ **可申请激活**(需另提卡 + 牧尘放行)
|
||||
|
||||
---
|
||||
|
||||
## ① 判据脚本原始输出(AC1 · exit 0)
|
||||
|
||||
```
|
||||
$ python3 ~/.hermes/scripts/verify-meta-filter.py
|
||||
正例 14 条 / 负例 11 条;不符 0 条
|
||||
|
||||
[PASS] 分类器达标
|
||||
$ echo $?
|
||||
0
|
||||
```
|
||||
|
||||
> 基线(返修前):exit=1,**10 条不符(7 漏拦 + 3 误拦)**。
|
||||
|
||||
## ② 逐条 before / after(AC7 要求)
|
||||
|
||||
### 病根一 · 漏拦(7 条):判据只认"写下来的那几种写法"
|
||||
|
||||
| 案例(生产原文) | before | after | 命中规则 |
|
||||
|---|---|---|---|
|
||||
| `实测 淇县 ANN 731→15、鹤壁 6536→18(都进池50)` | **放行 ✗** | 拦 ✓ | `pool_in+rank_num+num_arrow+pool` |
|
||||
| `实测 淇县 ANN 731→15(都进池50)` | **放行 ✗** | 拦 ✓ | `pool_in+rank_num+num_arrow+pool` |
|
||||
| `短问法 MISS 复现:牧尘工作所在的县是哪个` | 放行 ✗ | 拦 ✓ | `repro` |
|
||||
| `淇县库里 21 条、鹤壁 10 条、河南 15 条语料可用。` | 放行 ✗ | 拦 ✓ | `data_inv` |
|
||||
| `实测(只读,未改任何库/代码):目标「用户在招商局工作」在 query…` | 放行 ✗ | 拦 ✓ | `data_inv+pool+rank` |
|
||||
| `memory_write 落 episodes 表 + vector 全 0 —— 写入…` | 放行 ✗ | 拦 ✓ | `write_bug` |
|
||||
| `织忆 golden 14/14 不退化,recall@5 = 0.4286` | 放行 ✗ | 拦 ✓ | `eval_metric` |
|
||||
|
||||
**新增规则原文**(形态匹配,非加字面词 —— 满足 AC3):
|
||||
```
|
||||
_RANK_NUM = \bANN\s*\d+\s*→\s*\d+
|
||||
_NUM_ARROW = \d+\s*→\s*\d+
|
||||
_POOL_IN = 进\s*池\s*\d+
|
||||
_REPRO = (MISS\s*复现|复现[::((]|复现\s*(步骤|方法|过程|流程|记录)\s*[::((])
|
||||
_DATA_INV = (语料盘点:N 条…可用)
|
||||
_EVAL_METRIC= (golden \d+/\d+|recall@\d+)
|
||||
_DEBUG_MARK = (\bDEBUG\b|探针|自报|脚本输出)
|
||||
_WRITE_BUG = (写入类故障记录)
|
||||
```
|
||||
|
||||
### 病根二 · 误拦(3 条):把"关于系统的事实"当调查记录拦了
|
||||
|
||||
| 案例(事实句,金标同族题面) | before | after | 理由 |
|
||||
|---|---|---|---|
|
||||
| `织忆召回接口 POST /api/v1/recall 接受 top_k 参数。` | **拦 ✗** | 放 ✓ | `_FACT_DECL` 事实声明形豁免 |
|
||||
| `召回缓存 recall-cache 每 6 小时刷新一次。` | **拦 ✗** | 放 ✓ | `_FACT_DECL`(周期形) |
|
||||
| `织忆主服务进程名是 zhiyid-new,合并服务是 zhiyi-consolidate。` | **拦 ✗** | 放 ✓ | `_FACT_DECL`(进程名形) |
|
||||
|
||||
**AC4 区分判据**:`svc_core` 由 STRONG 降级为 **cue 计数**;通用功能词(召回|蒸馏)各计 1 个 cue,需叠加才判;**事实声明形**(`_FACT_DECL`:接受X参数/监听N端口/每N小时…一次/进程名是/地址是/模型是/字体/行距)⇒ **判事实放行**;带 实测/复现/诊断/命中/命名空间/限流/退避/碎片化/FALLBACK 等概念词的调查记录**不受豁免** ⇒ 既放行 3 条误拦,又**不漏原有 16 条自检正例**(两套用例同时绿)。
|
||||
|
||||
### 负例 11 条全放行(`[放✓]`)
|
||||
牧尘在河南省鹤壁市淇县工作。· 淇县招商项目台账(09-27阅读版).md 已发布。· 织忆服务的健康检查接口监听 7821 端口。· 织忆召回接口 POST /api/v1/recall 接受 top_k 参数。· 召回缓存 recall-cache 每 6 小时刷新一次。· 织忆主服务进程名是 zhiyid-new,合并服务是 zhiyi-consolidate · 公文排版正文用仿宋_GB2312 字体,行距 28 磅。· 家庭服务器(跑 Gitea)在局域网里的地址是 192.168.123.11。· 本地 2B 模型服务监听 8080 端口。· 牧尘负责生物制造产业专班 + 卫都街道安全管理。· 小怡日常主链模型是 deepseek-v4-flash(官方直连)。
|
||||
|
||||
## ③ AC8 咽喉点收口(本卡新增,最关键)
|
||||
|
||||
**问题**:B 卡只接了 3 条管线,而污染样本 **5/6 来自未覆盖路径**(27 个写者只有 3 个被覆盖)。
|
||||
|
||||
**修法**:接在**唯一共享入口**上 —— 所有 27 个写者都走 `POST /api/v1/commit`:
|
||||
|
||||
```go
|
||||
// go/internal/api/routes/core.go:108(/commit 处理器,AutoDistillTrigger 之前)
|
||||
if skip, reason := metanote.ShouldSkip(req.Content); skip {
|
||||
log.Printf("[metanote] commit rejected (gate ON, meta-note): ...")
|
||||
respondError(w, 422, "meta-note rejected: "+reason)
|
||||
return // ← 真拒写:不落 episode、不进蒸馏
|
||||
}
|
||||
// core.go:322(write_memory 处理器)同样接线
|
||||
```
|
||||
⇒ 覆盖 **27/27 写者**(对比修前 3/27)。
|
||||
|
||||
**Python↔Go 同源锁死**:`internal/metanote`(patterns.go / classify.go)与 `~/.hermes/scripts/lib/meta_note_filter.py` 口径同源,由 parity + 差分测试锁死:
|
||||
- `TestParity_PythonLive`(Live parity,0.03s)
|
||||
- `TestParity_MutatedCopyFails` —— **变异必 FAIL**(负控,0.03s)
|
||||
- `TestDifferential_PythonReference` / `TestDifferential_ExpectedSpotChecks`
|
||||
|
||||
## ④ 小怡终审亲跑证据(非自报)
|
||||
|
||||
| 项 | 命令 | 结果 |
|
||||
|---|---|---|
|
||||
| 构建 | `go build ./...` | **exit 0** |
|
||||
| 测试 | `go test ./internal/metanote/` | **ok 0.130s**(8 项含 parity/mutation) |
|
||||
| 判据 | `verify-meta-filter.py` | **exit 0**(正14/负11/不符0) |
|
||||
| 判据未被改(AC2) | `verify-meta-filter.py` mtime **20:08:22** 早于 worker 首启 **20:09:36** | ✓ 正/负例逐字未动 |
|
||||
| 门默认关(AC6) | gateway env / zhiyid env | **各 0 处** `ZHIYI_META_FILTER` |
|
||||
| **未部署** | 生产二进制 mtime `19:02:50` **早于** 提交 `21:59:28`;md5 `95286f63789c7ecd` 未变;`strings` 内 `metanote` **0 处** | ✓ 源码级 |
|
||||
| 零行为变化 | `classify.go:91 ShouldSkip` → `if !GateEnabled() { return false, "" }` | ✓ 门关即不参与 |
|
||||
|
||||
## ⑤ 改动文件清单
|
||||
|
||||
| 文件 | 说明 |
|
||||
|---|---|
|
||||
| `go/internal/metanote/patterns.go` | 新增(规则表,Python 口径同源) |
|
||||
| `go/internal/metanote/classify.go` | 新增(分类 + `GateEnabled`/`ShouldSkip`) |
|
||||
| `go/internal/metanote/metanote_parity_test.go` | 新增(parity) |
|
||||
| `go/internal/metanote/metanote_live_test.go` | 新增(Live parity + 变异负控) |
|
||||
| `go/internal/metanote/metanote_diff_test.go` | 新增(差分对照) |
|
||||
| `go/internal/api/routes/core.go` | 咽喉点接线(:108 / :322) |
|
||||
| `~/.hermes/scripts/lib/meta_note_filter.py` | 分类器 193 → 326 行(仓库外,`.hermes` 侧) |
|
||||
|
||||
## ⑥ 激活状态
|
||||
|
||||
**可申请激活**(分类器绿 + 咽喉点覆盖 27/27 + parity/变异测试在 + 默认关 + 未部署)。
|
||||
**但激活不在本卡范围**:需 ① 另提卡 ② 重建二进制并部署 ③ 牧尘放行(`prod-write-gate.py` 会拦,别绕)。
|
||||
|
||||
## ⑦ 遗留(诚实记录)
|
||||
|
||||
1. **两次 run 均 `rc=1` 崩于"写交付说明"步骤**,日志**无任何错误行**(裸退);代码工作在两轮内已完成并提交 ⇒ 未放行第三次盲跑。**真因未定**(疑与同 profile 并发 worker / 会话结束路径有关,待查)。
|
||||
2. **AC8.1 覆盖表**:本文件 ③ 已给出结构性论证(单一入口 ⇒ 27/27),worker 原计划的逐写者分布表未落盘(随交付说明一起丢)。
|
||||
@@ -0,0 +1,147 @@
|
||||
# 【织忆·门控复核】PATTERN/PEER 影子 diff 量化 — 对照表与原始证据
|
||||
|
||||
卡: t_bd63b641 · 执行人: prof-dev · 2026-10-17 21:0x CST
|
||||
方法: 不碰生产 env/二进制/服务(AC 硬边界)。开态用「独立离线评测」——
|
||||
真实 PatternProvider/PeerAPI + 生产 graph.db(只读) + 实时 bge embedder(:8000),
|
||||
等价于活服务开态注入路径;关态取活服务(:7821, PID 812251)实测。
|
||||
|
||||
────────────────────────────────────────────────────────────
|
||||
## 结论
|
||||
关态 vs 开态 diff = **空(当前态)**,且开态即使修 bug 也**无净收益/伤主路径**。
|
||||
两个通道本卡判定 **「不开闸」**,如实回卡。理由:
|
||||
- PEER: 无 peers 表(0 行),开态物理零注入,无产出。
|
||||
- PATTERN: 当前 NULL-id bug 使 `ListPatterns` 恒报错 → 零注入;**即使修好 bug**,
|
||||
85 行全是「图聚类摘要节点」(无 data/tools 内容,只有聚类键名),对金标余弦
|
||||
0.675–0.715(≥0.6 阈值)会注入 ≤3 条**无召回价值的聚类键噪声/金标**,外加每
|
||||
query ~85 次 embed(冷 ~1.4s)拉高 P95 + 稀释 top-5 ⇒ 伤主路径、无净收益。
|
||||
- 原始阻塞理由(上游未落地)小怡已复核失效(t_3e98b65a/t_fcadee04 done),
|
||||
但「上游 done ≠ 该开」—— 实测证明开了也净负收益(比图谱路「接线已证、收益未证」
|
||||
更明确: PATTERN 有 NULL-id 读库 bug + 数据源本身不是行为 pattern)。
|
||||
|
||||
────────────────────────────────────────────────────────────
|
||||
## 一、门控现状(关态坐实,双源独立)
|
||||
- systemd unit 权威配置: `systemctl --user cat zhiyid | grep ZHIYI_` → 无
|
||||
ZHIYI_PATTERN_RECALL / 无 ZHIYI_PEER_RECALL
|
||||
- 运行进程 env: `/proc/812251/environ` → 无此二键(与 prof-cloud 异源复核一致)
|
||||
- 结论: 两通道 env 均「未设/≠1」⇒ server.go 启动期 `if os.Getenv(...)=="1"` 不成立
|
||||
⇒ `storage.PatternRecallProvider` / `storage.PeerRecallProvider` 均未注册 ⇒ 关态
|
||||
|
||||
## 二、影子 diff(关态 vs 开态,逐条对照)
|
||||
固定 query 集: 14 金标(golden-set.json)+ 69 条真实 content-recall(usage_recall 表)
|
||||
|
||||
### PATTERN 通道(ZHIYI_PATTERN_RECALL)
|
||||
开态注入结果: 当前 **0 条 / 14 金标**(`shadow-on-pattern-inject.json` = 空 `{}`)
|
||||
根因(不是「没命中」而是「读不出来」):
|
||||
- 生产 graph_nodes(type='pattern') 共 85 行,**id 列 85/85 全为 NULL**
|
||||
(`sqlite3: sum(id IS NULL)=85`)
|
||||
- `PatternProvider.Match` → `GraphPatternStore.ListPatterns` 读 `SELECT id,...`
|
||||
为 string,遇 NULL 恒报 `sql: Scan error: converting NULL to string`
|
||||
(影子测试实测抓到原文: `PATTERN_LISTERROR="sql: Scan error on column index 0,
|
||||
name \"id\": converting NULL to string is unsupported"`,`PATTERNS_LOADED=0`)
|
||||
- ⇒ `Match` 直接 return nil ⇒ **当前开态无任何 pattern 注入**
|
||||
|
||||
深层(修 bug 后会怎样 —— 已量化,证明「修了也不该开」):
|
||||
- 这 85 行 properties **0 行有 `data` 键、0 行有 `tools` 键**(只有 20 行有
|
||||
`description`),全是「图聚类摘要节点」(如 `hermes-main/entity 共 3867 节点…`),
|
||||
**不是 L2 行为 pattern**。`Match` 里 `p.Data` 恒空 → 回退 `p.Name`(聚类键,
|
||||
如 `topic:memory` / `pattern:default-main:entity`)。
|
||||
- 余弦探针(绕过 NULL-id 直接 embed 85 个 pattern 名 + 金标,bge-m3:8000 实测):
|
||||
5 条金标 maxcos = 0.6752 / 0.6891 / 0.6975 / 0.7038 / 0.7148,**全 ≥ 0.6 阈值
|
||||
⇒ 若修好 NULL-id,开态会对每条金标注入 ≤3 条聚类键条目**(`offset-cosine-probe.txt`)。
|
||||
- 注入内容 = 裸聚类键名(`topic:memory`、`pattern:learner-main:concept`),
|
||||
**对「织忆是什么」这类 query 无召回价值,只会稀释 top-5**。
|
||||
- 额外成本: 每 query 需 embed 85 个 pattern 名(冷调用 ~85×16.5ms≈1.4s,
|
||||
探针 430 embed/7.12s 实测)⇒ **P95 主路径显著上升**(OFF p95=3177ms → 开态
|
||||
叠加 ~1.4s)。
|
||||
- 判读: 0.6 阈值对 bge-m3 余弦分布偏低(无关文本基线 0.67+),开态注入的多是
|
||||
**假阳性噪声**。
|
||||
- ⇒ 修 bug 后开态 = 「伤主路径 + 无净收益」,仍 **不开**。
|
||||
|
||||
### PEER 通道(ZHIYI_PEER_RECALL)
|
||||
开态注入结果: **0 条 / 14 金标**
|
||||
根因: 生产 graph.db **无 peers 表**(`SELECT count(*) FROM sqlite_master WHERE
|
||||
name='peers'` = 0)。`PeerAPI.GetRecallResults` → `Store.List(200)` → 0 行 →
|
||||
return nil(peer.go:305-308 源码)。⇒ **开态也无任何 peer 注入**。
|
||||
|
||||
### 对照表
|
||||
| 维度 | 关态(活服务) | 开态(影子/离线) | diff |
|
||||
|---|---|---|---|
|
||||
| PATTERN 注入条数 | 0(未注册) | 当前 0(NULL-id bug);修 bug 后 ≤3 聚类键/金标 | **0(当前)/ 噪声(修后)** |
|
||||
| PEER 注入条数 | 0(未注册) | 0(无 peers 表) | **0** |
|
||||
| 召回结果 top5 id | 见 off-recall-14golden-live.json | 当前与关态逐条相同(无注入项可加) | **空(当前)** |
|
||||
| /eval/golden keyword_pass | 14/14 | =关态(当前注入 0 不动);修后注入聚类键不改关键词判据 | **0(当前)** |
|
||||
| /eval/golden recall@5 | 0.643 | =关态 | **0(当前)** |
|
||||
| 开态额外成本 | — | 修 bug 后每 query ~85 embed(冷 ~1.4s)+ top-5 稀释 | 伤主路径 |
|
||||
| 新增条目位置 | — | 追加在结果尾部(recall.go:901-932 append 到 deduped 之后) | — |
|
||||
|
||||
## 三、延迟 P50/P95(阈值从实测读,非拍脑袋)
|
||||
关态(活服务 :7821):
|
||||
- 69 真实 query(本卡 AC 要求的「≥50 query」集): **p50=1383.7ms, p95=3177.2ms**
|
||||
(`off-69-queries-lat-ms.json`,一致单次 run 采集)
|
||||
- 14 金标: 空载热态 p50=949.9/p95=2288.5ms;我在并发 69-query 压测后重跑
|
||||
p50=3936.9/p95=5255.5ms(`off-recall-14golden-live.json` = 并发态)——
|
||||
**绝对值随负载/缓存/8081 LLM 队列代理波动**(非本卡判据,不追服务性能)。
|
||||
开态:
|
||||
- **当前态(NULL-id bug 在)**: 注入 0 条,代码块 `if patternRecallEnabled() &&
|
||||
Provider!=nil` 即便走进去也只 `for _, pr := range nil` ⇒ **开态延迟 = 关态延迟
|
||||
(逐条相同,无新增 embed)**。
|
||||
- **修 bug 后态**: 每 query 额外 embed 85 个 pattern 名(探针实测 430 embed/7.12s
|
||||
≈16.5ms/embed,冷调用 ~1.4s),追加在结果尾部 ⇒ **P95 主路径上叠加 ~1.4s 冷成本
|
||||
(冷 ≈ 关态 p95 翻倍量级)** ⇒ 伤主路径(超 AC 判据「P95 涨幅>20%」)。
|
||||
|
||||
判读: 延迟上「开 vs 关」的**决策相关量 = 修 bug 后每次召回 +~1.4s 冷成本**;
|
||||
当前态(bug 在)开=关=0 差异。绝对基线随负载波动,不作为开闸判据。
|
||||
|
||||
## 四、AC#2: 开门是否需重启才注册 Provider?
|
||||
**答案: 是,必须重启。**
|
||||
- 源码证据: `go/internal/api/server.go:189-202` ——
|
||||
`if os.Getenv("ZHIYI_PATTERN_RECALL")=="1" { storage.PatternRecallProvider =
|
||||
patternProvider.Match }` / `if os.Getenv("ZHIYI_PEER_RECALL")=="1"
|
||||
{ storage.PeerRecallProvider = peerAPI.GetRecallResults }`,均在 `NewServer()`
|
||||
启动期执行;`storage.PatternRecallProvider` 是包级变量,仅在这两处赋值。
|
||||
改运行中 env(不重启)无法注册 Provider。
|
||||
- 实测证据: PID 812251 运行二进制 mtime=2026-10-17 01:18,其 /proc environ 无
|
||||
此二键,当前 Provider 未注册(关态)。要开态只能: 在 systemd unit 加
|
||||
`Environment=ZHIYI_*_RECALL=1` + `daemon-reload` + `restart zhiyid`。
|
||||
- 开闸成本 = 一次重启(低)。但本卡结论「不开」基于净收益为负(见二),
|
||||
重启成本本身不是拦路项——拦路的是「开了也伤主路径 + 无净收益」。
|
||||
|
||||
## 五、判据(按卡 AC)
|
||||
- 当前态 diff 为空(PATTERN NULL-id bug → 0 注入;PEER 无表 → 0 注入)
|
||||
⇒ 「开态无产出」判据满足 ⇒ **不开闸**。
|
||||
- 修 bug 后态: 注入聚类键噪声 + P95 主路径涨幅 >20% ⇒ 「有产出但伤主路径」判据
|
||||
也满足 ⇒ **仍不开**。两条判据各自独立支撑「不开」。
|
||||
- 主路径未退化(关态 /eval/golden kw 14/14、recall@5=0.643;开态当前态=关态)。
|
||||
|
||||
────────────────────────────────────────────────────────────
|
||||
## 原始 JSON(改前/改后,禁只贴结论)
|
||||
- 关态活服务 14 金标逐条: `off-recall-14golden-live.json`
|
||||
- 关态活服务 /eval/golden 汇总: `off-eval-golden-raw.json`
|
||||
- 关态 69 真实 query 延迟: `off-69-queries-lat-ms.json`
|
||||
- 开态影子 pattern 注入(当前态 = 空 `{}`): `shadow-on-pattern-inject.json`
|
||||
- 开态影子 peer 表存在性: 0(`SHADOW_PEER_TABLE_EXISTS=0`,见 shadow_diff_test.go)
|
||||
- 修 bug 后余弦探针(85 聚类键 vs 金标 maxcos): `offset-cosine-probe.txt`
|
||||
+ 复现 `TestShadowPattern_CosineIfIDFixed`(`PATTERN_ROWS_LOADABLE_BYPASS_ID=85`)
|
||||
|
||||
复跑命令:
|
||||
# 关态金标召回(活服务)
|
||||
cd <ws> && python3 eval_off.py
|
||||
# 关态 69 真实 query 延迟
|
||||
cd <ws> && python3 latency_off.py # 注: stdout 混进度行,JSON 在尾部
|
||||
# 开态影子注入 + peer 表 + 修 bug 后余弦探针(只读 graph.db + :8000 embedder,不改生产)
|
||||
cd /home/muc/src/memoryweave/go && go test ./internal/pattern/ \
|
||||
-run 'TestShadowPattern_Diff|TestShadowPeer_NoTable|TestShadowPattern_CosineIfIDFixed' \
|
||||
-v -count=1
|
||||
|
||||
## 给审计脚本的「已明确决策」标记(消音用)
|
||||
本卡对 PATTERN/PEER 门控的终态 = **已明确决策: 暂不开闸(证据: 开态零产出,见上)**。
|
||||
若审计脚本下次再报「门控到期/上游 done 但门关」,应据此识别为「已决策不开」而非
|
||||
「没人复核」。建议: 门控台账加 `decision` 字段(values: open/no-open/unknown),
|
||||
本卡结论落 `no-open` + 证据指针,脚本对 no-open 态静默。
|
||||
|
||||
────────────────────────────────────────────────────────────
|
||||
## 未决(需人拍板,本卡不越界执行)
|
||||
1. PATTERN NULL-id 读库 bug: `GraphPatternStore.ListPatterns` 扫 NULL id 报错。
|
||||
85 存量 pattern 行全是聚类摘要节点且 id=NULL——**这套数据本身可能就不该作为
|
||||
L2 行为 pattern 召回源**。属「修数据还是修代码」的决策,交 hub/ops,不在本卡。
|
||||
2. 开闸动作: 小怡终审 + 牧尘放行(本卡只出证据,AC 明令不开门)。
|
||||
@@ -0,0 +1 @@
|
||||
[-1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, 825.0, 952.6, 1123.0, 1376.9, 1383.7, 1544.4, 1583.8, 1592.2, 1635.1, 1680.3, 1685.1, 1691.0, 1726.0, 1754.9, 1794.7, 1851.8, 1874.3, 1878.2, 1901.0, 1909.9, 1924.8, 1937.8, 1954.0, 2037.1, 2053.7, 2058.2, 2154.6, 2174.1, 2287.7, 2355.2, 2718.2, 2789.6, 2791.9, 2832.9, 3109.5, 3222.3, 3507.6, 3534.9, 3906.4]
|
||||
@@ -0,0 +1 @@
|
||||
{"id":"20261017-205654","model":"golden-set","recall_at_5":0.6428571428571429,"precision_at_5":0.12857142857142856,"mean_reciprocal_rank":0.47619047619047616,"ndcg":0.5238095238095238,"query_details":[{"query":"织忆是什么","expected_ids":["mem_1791666702950691634"],"must_include_keywords":["织忆"],"hits":null,"misses":["mem_1791666702950691634"],"recall_at_5":0,"precision_at_5":0,"keyword_ok":true},{"query":"织忆的图谱扩展机制是什么","expected_ids":["mem_1791899478673190284"],"must_include_keywords":["图谱"],"hits":["mem_1791899478673190284"],"misses":null,"recall_at_5":1,"precision_at_5":0.2,"keyword_ok":true},{"query":"织忆如何通过 E1 提取和 MMR 实现多样去重","expected_ids":["mem_1791666890486125605"],"must_include_keywords":["MMR"],"hits":null,"misses":["mem_1791666890486125605"],"recall_at_5":0,"precision_at_5":0,"keyword_ok":true},{"query":"牧尘的偏好是什么","expected_ids":["mem_1790448247125520424"],"must_include_keywords":["牧尘"],"hits":["mem_1790448247125520424"],"misses":null,"recall_at_5":1,"precision_at_5":0.2,"keyword_ok":true},{"query":"牧尘喜欢什么样的工作方式","expected_ids":["mem_1790448247125520424"],"must_include_keywords":["牧尘"],"hits":["mem_1790448247125520424"],"misses":null,"recall_at_5":1,"precision_at_5":0.2,"keyword_ok":true},{"query":"如何根据牧尘的偏好调整记忆检索策略","expected_ids":["mem_1791747597032219499"],"must_include_keywords":["记忆"],"hits":["mem_1791747597032219499"],"misses":null,"recall_at_5":1,"precision_at_5":0.2,"keyword_ok":true},{"query":"当前项目的技术栈是什么","expected_ids":["mem_1790455676397796671"],"must_include_keywords":["技术栈"],"hits":["mem_1790455676397796671"],"misses":null,"recall_at_5":1,"precision_at_5":0.2,"keyword_ok":true},{"query":"织忆项目有哪些核心组件","expected_ids":["mem_1791906354849281414"],"must_include_keywords":["织忆"],"hits":null,"misses":["mem_1791906354849281414"],"recall_at_5":0,"precision_at_5":0,"keyword_ok":true},{"query":"织忆和其他记忆系统相比有什么架构优势","expected_ids":["mem_1791666702950691634"],"must_include_keywords":["织忆"],"hits":["mem_1791666702950691634"],"misses":null,"recall_at_5":1,"precision_at_5":0.2,"keyword_ok":true},{"query":"如何使用 recall 接口","expected_ids":["mem_1791796178328736793"],"must_include_keywords":["recall"],"hits":null,"misses":["mem_1791796178328736793"],"recall_at_5":0,"precision_at_5":0,"keyword_ok":true},{"query":"织忆有哪些管理工具","expected_ids":["mem_1791666702950691634"],"must_include_keywords":["织忆"],"hits":null,"misses":["mem_1791666702950691634"],"recall_at_5":0,"precision_at_5":0,"keyword_ok":true},{"query":"如何通过 API 扩展织忆功能","expected_ids":["mem_1791666188168772049"],"must_include_keywords":["织忆"],"hits":["mem_1791666188168772049"],"misses":null,"recall_at_5":1,"precision_at_5":0.2,"keyword_ok":true},{"query":"本地 llama 服务 8080 端口","expected_ids":["mem_1791423503359721152"],"must_include_keywords":["8080"],"hits":["mem_1791423503359721152"],"misses":null,"recall_at_5":1,"precision_at_5":0.2,"keyword_ok":true},{"query":"session-to-zhiyi.py 脚本名","expected_ids":["mem_1791688470278719760"],"must_include_keywords":["session-to-zhiyi"],"hits":["mem_1791688470278719760"],"misses":null,"recall_at_5":1,"precision_at_5":0.2,"keyword_ok":true}],"queries":14,"ran_at":"2026-10-17T20:56:54.195909811+08:00","keyword_pass":14,"keyword_fail":0,"keyword_total":14}
|
||||
@@ -0,0 +1,319 @@
|
||||
{
|
||||
"state": "OFF",
|
||||
"results": [
|
||||
{
|
||||
"i": 0,
|
||||
"q": "织忆是什么",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1791899478673190284",
|
||||
"mem_1792154287491185572",
|
||||
"mem_1791912043093092663",
|
||||
"mem_1792154287177190000",
|
||||
"mem_1792154288142808071"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 3936.9
|
||||
},
|
||||
{
|
||||
"i": 1,
|
||||
"q": "织忆的图谱扩展机制是什么",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1791899478673190284",
|
||||
"mem_1791725847707296273",
|
||||
"mem_1792154287491185572",
|
||||
"mem_1791770032575826407",
|
||||
"mem_1792088552819764989"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 4225.2
|
||||
},
|
||||
{
|
||||
"i": 2,
|
||||
"q": "织忆如何通过 E1 提取和 MMR 实现多样去重",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1792088552818081545",
|
||||
"mem_1791666890486125605",
|
||||
"mem_1791520496931190142",
|
||||
"mem_1791422985447662675",
|
||||
"mem_1791498226924653975"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 3643.6
|
||||
},
|
||||
{
|
||||
"i": 3,
|
||||
"q": "牧尘的偏好是什么",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1791556229473565240",
|
||||
"mem_1791376118421773238",
|
||||
"mem_1790448247125520424",
|
||||
"mem_1792088552818232071",
|
||||
"mem_1792086639900350664"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 3367.5
|
||||
},
|
||||
{
|
||||
"i": 4,
|
||||
"q": "牧尘喜欢什么样的工作方式",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1790448247125520424",
|
||||
"mem_1792086639900350664",
|
||||
"mem_1791482493617981202",
|
||||
"mem_1789063252280657787",
|
||||
"mem_1792086640133724836"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 3511.3
|
||||
},
|
||||
{
|
||||
"i": 5,
|
||||
"q": "如何根据牧尘的偏好调整记忆检索策略",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1792091916993248722",
|
||||
"mem_1791747597032219499",
|
||||
"mem_1792088552824810016",
|
||||
"mem_1792153987878359340",
|
||||
"mem_1790137162828579293"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 3544.6
|
||||
},
|
||||
{
|
||||
"i": 6,
|
||||
"q": "当前项目的技术栈是什么",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1792088552817810427",
|
||||
"mem_1790455676397796671",
|
||||
"mem_1791665641471849057",
|
||||
"mem_1790317738849661043",
|
||||
"mem_1790425023223201421"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 4874.5
|
||||
},
|
||||
{
|
||||
"i": 7,
|
||||
"q": "织忆项目有哪些核心组件",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1792154287491185572",
|
||||
"mem_1792154287177190000",
|
||||
"mem_1791770032575826407",
|
||||
"mem_1792154288142808071",
|
||||
"mem_1791666702950691634"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 3811.5
|
||||
},
|
||||
{
|
||||
"i": 8,
|
||||
"q": "织忆和其他记忆系统相比有什么架构优势",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1791899478077693848",
|
||||
"mem_1791666702950691634",
|
||||
"mem_1792088552819764989",
|
||||
"mem_1791770032575826407",
|
||||
"mem_1792154287491185572"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 3254.5
|
||||
},
|
||||
{
|
||||
"i": 9,
|
||||
"q": "如何使用 recall 接口",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1791482321288100863",
|
||||
"mem_1792153988391999660",
|
||||
"ep_1785686577666177306",
|
||||
"ep_1786452727331645773",
|
||||
"mem_1788717420755520289"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 4110.9
|
||||
},
|
||||
{
|
||||
"i": 10,
|
||||
"q": "织忆有哪些管理工具",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1792154287491185572",
|
||||
"mem_1791666855166846631",
|
||||
"mem_1792144557208382006",
|
||||
"mem_1792116217448228684",
|
||||
"mem_1792154288142808071"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 5963.1
|
||||
},
|
||||
{
|
||||
"i": 11,
|
||||
"q": "如何通过 API 扩展织忆功能",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1791666188168772049",
|
||||
"mem_1791818814047111008",
|
||||
"ep_1785695216419714474",
|
||||
"ep_1785702789193047009",
|
||||
"ep_1786336919812827426"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 4222.9
|
||||
},
|
||||
{
|
||||
"i": 12,
|
||||
"q": "本地 llama 服务 8080 端口",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1791423503359721152",
|
||||
"mem_1791440673318711992",
|
||||
"mem_1788594533802527918",
|
||||
"mem_1788620335517621905",
|
||||
"mem_1788700944516696452"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": false,
|
||||
"lat_ms": 3803.5
|
||||
},
|
||||
{
|
||||
"i": 13,
|
||||
"q": "session-to-zhiyi.py 脚本名",
|
||||
"count": 5,
|
||||
"top5_ids": [
|
||||
"mem_1791688470278719760",
|
||||
"mem_1789152643785440562",
|
||||
"mem_1790154887033667954",
|
||||
"mem_1790001291060572107",
|
||||
"mem_1789896720973833628"
|
||||
],
|
||||
"top5_cats": [
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled",
|
||||
"distilled"
|
||||
],
|
||||
"kw_ok": true,
|
||||
"lat_ms": 4078.1
|
||||
}
|
||||
],
|
||||
"kw_pass": 13,
|
||||
"kw_total": 14,
|
||||
"p50_ms": 3936.9,
|
||||
"p95_ms": 5255.5,
|
||||
"all_lat_ms": [
|
||||
3254.5,
|
||||
3367.5,
|
||||
3511.3,
|
||||
3544.6,
|
||||
3643.6,
|
||||
3803.5,
|
||||
3811.5,
|
||||
3936.9,
|
||||
4078.1,
|
||||
4110.9,
|
||||
4222.9,
|
||||
4225.2,
|
||||
4874.5,
|
||||
5963.1
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,6 @@
|
||||
shadow_diff_test.go:200: PATTERN_ROWS_LOADABLE_BYPASS_ID=85
|
||||
shadow_diff_test.go:224: COSINE_PROBE "织忆是什么" maxcos=0.7038 hit=true (thr=0.6) best=topic:memory
|
||||
shadow_diff_test.go:224: COSINE_PROBE "牧尘的偏好是什么" maxcos=0.6975 hit=true (thr=0.6) best=pattern:default-main:entity
|
||||
shadow_diff_test.go:224: COSINE_PROBE "如何使用 recall 接口" maxcos=0.6891 hit=true (thr=0.6) best=topic:replying
|
||||
shadow_diff_test.go:224: COSINE_PROBE "本地 llama 服务 8080 端口" maxcos=0.6752 hit=true (thr=0.6) best=pattern:test-llm:entity
|
||||
shadow_diff_test.go:224: COSINE_PROBE "织忆项目有哪些核心组件" maxcos=0.7148 hit=true (thr=0.6) best=pattern:learner-main:concept
|
||||
@@ -0,0 +1,229 @@
|
||||
package pattern
|
||||
|
||||
import (
|
||||
"database/sql"
|
||||
"encoding/json"
|
||||
"os"
|
||||
"testing"
|
||||
|
||||
_ "modernc.org/sqlite"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// ── t_bd63b641 影-复:PATTERN/PEER 开门量具(不碰生产;只读 graph.db + 实时 embedder)──
|
||||
// 量化「开 ZHIYI_PATTERN_RECALL / ZHIYI_PEER_RECALL」对 14 金标会注入什么。
|
||||
// Provider 装配在 server.go 启动期由 env 决定 ⇒ 不重启无法在活服务上测开态;
|
||||
// 故本测试直接构造真实 Provider + 生产 graph.db(只读)+ 实时 bge embedder,
|
||||
// 跑出「开态会注入的条目」,与关态(=主召回原样)对比。
|
||||
//
|
||||
// 本测试只读、不落盘、不改库(AC:不碰生产二进制/不重启)。
|
||||
|
||||
type logRecord struct {
|
||||
ID string
|
||||
Category string
|
||||
Content string
|
||||
}
|
||||
|
||||
// runShadowWithDiag 返回:注入结果 + 诊断(pattern 装载数 / query 是否编码成功 / 各 query 最高余弦)。
|
||||
// ⚠️ 关键发现:生产 graph_nodes(type='pattern') 的 id 全为 NULL(85/85),ListPatterns 读 id 为 string
|
||||
// ⇒ 恒报 sql: Scan error (converting NULL to string),Match 直接 return nil。
|
||||
// 故 runShadow 不把 ListPatterns 错误当失败 —— 它本身就是「开态也无法注入」的根因证据。
|
||||
func runShadowWithDiag() (map[string][]logRecord, int, string, map[string]float64) {
|
||||
endpoint := os.Getenv("VLLM_ENDPOINT")
|
||||
if endpoint == "" {
|
||||
endpoint = "http://localhost:8000/v1/embeddings"
|
||||
}
|
||||
emb := storage.NewEmbedder(endpoint)
|
||||
store := NewGraphPatternStore("/var/lib/memoryweave/graph.db")
|
||||
pp := NewPatternProvider(store, NewEmbedderProvider(emb))
|
||||
|
||||
// 装载 pattern 数(防「store 空 → 注入恒 0」的假阴性);记录 ListPatterns 错误原文
|
||||
pats, _, lerr := store.ListPatterns(1000)
|
||||
loaded := 0
|
||||
listErr := ""
|
||||
if lerr != nil {
|
||||
listErr = lerr.Error() // 根因:id 全 NULL → Scan error
|
||||
} else {
|
||||
loaded = len(pats)
|
||||
}
|
||||
|
||||
golden := []string{
|
||||
"织忆是什么", "织忆的图谱扩展机制是什么",
|
||||
"织忆如何通过 E1 提取和 MMR 实现多样去重", "牧尘的偏好是什么",
|
||||
"牧尘喜欢什么样的工作方式", "如何根据牧尘的偏好调整记忆检索策略",
|
||||
"当前项目的技术栈是什么", "织忆项目有哪些核心组件",
|
||||
"织忆和其他记忆系统相比有什么架构优势", "如何使用 recall 接口",
|
||||
"织忆有哪些管理工具", "如何通过 API 扩展织忆功能",
|
||||
"本地 llama 服务 8080 端口", "session-to-zhiyi.py 脚本名",
|
||||
}
|
||||
out := make(map[string][]logRecord)
|
||||
maxCos := make(map[string]float64)
|
||||
|
||||
// 预编码 14 query(若编码失败会记 0,便于区分「没命中」vs「编码挂了」)
|
||||
for _, q := range golden {
|
||||
qv, eerr := emb.EncodeSingle(q)
|
||||
if eerr != nil || len(qv) == 0 {
|
||||
maxCos[q] = -1 // 编码失败标记
|
||||
continue
|
||||
}
|
||||
// 逐个 pattern 算余弦,取最高(复现 Provider.Match 内部逻辑)
|
||||
best := -1.0
|
||||
for _, p := range pats {
|
||||
rep := p.Data
|
||||
if rep == "" {
|
||||
rep = p.Name
|
||||
}
|
||||
text := rep
|
||||
for _, tl := range p.Tools {
|
||||
if tl != "" {
|
||||
text += " " + tl
|
||||
}
|
||||
}
|
||||
pv, perr := emb.EncodeSingle(text)
|
||||
if perr != nil || len(pv) == 0 {
|
||||
continue
|
||||
}
|
||||
s := cosineF32(qv, pv)
|
||||
if s > best {
|
||||
best = s
|
||||
}
|
||||
}
|
||||
maxCos[q] = best
|
||||
}
|
||||
|
||||
// 真注入(走 Provider.Match,同 server 路径)
|
||||
for _, g := range golden {
|
||||
pat := pp.Match(g, "hermes-main", 3) // server.go:902 topK=3
|
||||
for _, r := range pat {
|
||||
out[g] = append(out[g], logRecord{ID: r.ID, Category: r.Category, Content: r.Content})
|
||||
}
|
||||
}
|
||||
return out, loaded, listErr, maxCos
|
||||
}
|
||||
|
||||
// TestShadowPattern_Diff —— 开态 pattern 注入量化(只读生产库)
|
||||
func TestShadowPattern_Diff(t *testing.T) {
|
||||
out, loaded, listErr, maxCos := runShadowWithDiag()
|
||||
t.Logf("PATTERNS_LOADED=%d (防假阴性:store 有货才会注入)", loaded)
|
||||
if listErr != "" {
|
||||
t.Logf("PATTERN_LISTERROR=%q — 根因:pattern 行 id 全 NULL ⇒ Provider.Match 恒 return nil", listErr)
|
||||
}
|
||||
|
||||
queries := []string{
|
||||
"织忆是什么", "织忆的图谱扩展机制是什么",
|
||||
"织忆如何通过 E1 提取和 MMR 实现多样去重", "牧尘的偏好是什么",
|
||||
"牧尘喜欢什么样的工作方式", "如何根据牧尘的偏好调整记忆检索策略",
|
||||
"当前项目的技术栈是什么", "织忆项目有哪些核心组件",
|
||||
"织忆和其他记忆系统相比有什么架构优势", "如何使用 recall 接口",
|
||||
"织忆有哪些管理工具", "如何通过 API 扩展织忆功能",
|
||||
"本地 llama 服务 8080 端口", "session-to-zhiyi.py 脚本名",
|
||||
}
|
||||
totalInjected := 0
|
||||
for _, q := range queries {
|
||||
mc := maxCos[q]
|
||||
if mc < 0 {
|
||||
t.Logf("[EMB-FAIL] %q → 编码失败(不计命中)", q)
|
||||
}
|
||||
if n := len(out[q]); n > 0 {
|
||||
totalInjected += n
|
||||
t.Logf("[INJECT] %q → %d pattern (maxcos=%.3f)", q, n, mc)
|
||||
for _, r := range out[q] {
|
||||
t.Logf(" id=%s cat=%s content=%s", r.ID, r.Category, trunc(r.Content, 60))
|
||||
}
|
||||
} else {
|
||||
t.Logf("[NO-INJECT] %q → 0 pattern (maxcos=%.3f, 阈值=0.6)", q, mc)
|
||||
}
|
||||
}
|
||||
b, _ := json.MarshalIndent(out, "", " ")
|
||||
t.Logf("SHADOW_PATTERN_TOTAL_INJECTED=%d", totalInjected)
|
||||
os.WriteFile("/tmp/shadow-pattern-inject.json", b, 0644)
|
||||
t.Logf("raw json → /tmp/shadow-pattern-inject.json (%d bytes)", len(b))
|
||||
}
|
||||
|
||||
func trunc(s string, n int) string {
|
||||
if len(s) <= n {
|
||||
return s
|
||||
}
|
||||
return s[:n] + "…"
|
||||
}
|
||||
|
||||
// ── peer 侧:生产 graph.db 无 peers 表 ⇒ 开态无数据可注入 ──
|
||||
func TestShadowPeer_NoTable(t *testing.T) {
|
||||
db, err := peerOpenReadOnly("/var/lib/memoryweave/graph.db")
|
||||
if err != nil {
|
||||
t.Fatalf("open graph.db: %v", err)
|
||||
}
|
||||
defer db.Close()
|
||||
var cnt int
|
||||
err = db.QueryRow("SELECT count(*) FROM sqlite_master WHERE type='table' AND name='peers'").Scan(&cnt)
|
||||
if err != nil {
|
||||
t.Fatalf("query peers table existence: %v", err)
|
||||
}
|
||||
t.Logf("SHADOW_PEER_TABLE_EXISTS=%d (0 ⇒ 开态 peer 无数据可注入)", cnt)
|
||||
}
|
||||
|
||||
// peerOpenReadOnly 只读开 sqlite(WAL 兼容),避免 peer.Store 的写路径。
|
||||
func peerOpenReadOnly(path string) (*sql.DB, error) {
|
||||
return sql.Open("sqlite", "file:"+path+"?mode=ro&_pragma=busy_timeout(5000)")
|
||||
}
|
||||
|
||||
// ── 深度根因:即使修好 NULL-id,85 行 pattern 无 data/tools 键(只有 description),
|
||||
// Match 只能 embed 命名键(如 "pattern:hermes-main:entity")⇒ 对金标余弦 < 0.6 阈值。
|
||||
// 本测试量化「修好 NULL-id 后开态到底能注入几类金标」—— 证明开态收益仍≈0。
|
||||
func TestShadowPattern_CosineIfIDFixed(t *testing.T) {
|
||||
endpoint := os.Getenv("VLLM_ENDPOINT")
|
||||
if endpoint == "" {
|
||||
endpoint = "http://localhost:8000/v1/embeddings"
|
||||
}
|
||||
emb := storage.NewEmbedder(endpoint)
|
||||
// 绕过 NULL-id 的 ListPatterns:只读 name + properties(非 NULL 列)
|
||||
db, err := peerOpenReadOnly("/var/lib/memoryweave/graph.db")
|
||||
if err != nil {
|
||||
t.Fatalf("open: %v", err)
|
||||
}
|
||||
defer db.Close()
|
||||
rows, _ := db.Query(`SELECT name, properties FROM graph_nodes WHERE type='pattern'`)
|
||||
type patText struct{ name, text string }
|
||||
var pats []patText
|
||||
for rows.Next() {
|
||||
var name, props string
|
||||
if serr := rows.Scan(&name, &props); serr != nil {
|
||||
continue
|
||||
}
|
||||
// 复现 Match 的 text 构造:rep=data(无→空) 回退 name;无 tools
|
||||
text := name
|
||||
pats = append(pats, patText{name, text})
|
||||
}
|
||||
rows.Close()
|
||||
t.Logf("PATTERN_ROWS_LOADABLE_BYPASS_ID=%d", len(pats))
|
||||
if len(pats) == 0 {
|
||||
t.Skip("无 pattern 行可载(NULL-id 未修前本就 0 注入,已在 TestShadowPattern_Diff 覆盖)")
|
||||
}
|
||||
golden := []string{"织忆是什么", "牧尘的偏好是什么", "如何使用 recall 接口",
|
||||
"本地 llama 服务 8080 端口", "织忆项目有哪些核心组件"}
|
||||
for _, q := range golden {
|
||||
qv, qerr := emb.EncodeSingle(q)
|
||||
if qerr != nil || len(qv) == 0 {
|
||||
t.Logf("[EMBFAIL] %q → %v", q, qerr)
|
||||
continue
|
||||
}
|
||||
best, bestName := -1.0, ""
|
||||
for _, p := range pats {
|
||||
pv, perr := emb.EncodeSingle(p.text)
|
||||
if perr != nil || len(pv) == 0 {
|
||||
continue
|
||||
}
|
||||
s := cosineF32(qv, pv)
|
||||
if s > best {
|
||||
best, bestName = s, p.name
|
||||
}
|
||||
}
|
||||
hit := best >= 0.6
|
||||
t.Logf("COSINE_PROBE %q maxcos=%.4f hit=%v (thr=0.6) best=%s", q, best, hit, bestName)
|
||||
}
|
||||
}
|
||||
|
||||
// 防 unused 误报
|
||||
var _ = models.RecallResult{}
|
||||
@@ -0,0 +1 @@
|
||||
{}
|
||||
@@ -0,0 +1,30 @@
|
||||
# 织忆指标语义:counter / rate / mean(`/api/v1/metrics`)
|
||||
|
||||
> 2026-10-26 建立。起因:有效性审计把 `deprecated_per_day`(计数器)当成率指标,
|
||||
> 报出「0 样本却判 valid=None ⇒ 缺最小样本门」。计数器没有分母,「样本门」对它无定义
|
||||
> —— 属**探针模型错配**,不是指标缺陷。本文件是给下游(审计脚本 / 看板 / 人)的唯一口径。
|
||||
|
||||
## 三类指标,三种读法
|
||||
|
||||
| 类型 | 命名特征 | 自带字段 | 怎么用 | 例子 |
|
||||
|---|---|---|---|---|
|
||||
| **counter 计数器** | `*_per_day` / `*_total` / `*_count` | **无** `_samples` / `_valid` | 直接读绝对值,跨时间比大小;不要算比率、不要报「样本不足」 | `deprecated_per_day`、`deprecated_total`、`distill_success_count` |
|
||||
| **rate 比率** | `*_rate` | `_samples`(分母)+ `_valid`(1=可判 / 0=不可判 / -1=N/A) | `_valid != 1` 时**不得**当结论;`_samples` 小于门槛时只报「待积累」 | `auto_resolve_rate`、`recall_usefulness_rate` |
|
||||
| **mean 均值** | `avg_*` | `_samples` + `_valid` | 同上:无分母就不下判断 | `avg_distill_loss` |
|
||||
|
||||
**铁律**:`0` 永远有两种含义 —— 「今天确实没有」和「根本没在统计」。
|
||||
- 计数器必须配一个累计值来区分:`deprecated_per_day=0` + `deprecated_total=0` ⇒ 从未统计过;
|
||||
`per_day=0` + `total=137` ⇒ 统计活着,只是今天没发生。
|
||||
- 率指标必须配 `_valid`/`_samples`,分母退化时返回 `metricNA(-1)`,不给 1(给 1 会被读成满分)。
|
||||
|
||||
## 触发器阈值也用同一套语义
|
||||
|
||||
`internal/selfoptimize/executor.go` 的 `t8`(`TDecayCritical` → `archive_or_boost`):
|
||||
- 判据读的是**计数器** `deprecated_per_day`(条/天),阈值由 `t8.Condition` 承载,**默认 5 条/天**。
|
||||
- 2026-10-26 修正:原先 `Condition: 0.1` 但判据函数里硬编码 `> 5`,配置写了从不生效。
|
||||
现改为 `Condition: 5.0` + 判据读 `t.Condition`(行为不变,但配置真的能被改)。
|
||||
- 若要改成「率」语义,需要先有分母(当日活跃写入量),否则别动 —— 那会变成另一个探针错配。
|
||||
|
||||
## 已知遗留
|
||||
|
||||
- 审计脚本侧对计数器发「样本不足」告警的白名单修复,归 `t_44c07eca`(脚本侧统一处理,避免多处各改一遍)。
|
||||
@@ -0,0 +1,68 @@
|
||||
// evtrace-allcheck — 对所有 conf>=0.85 的 pattern 逐条跑:取证据→生成草稿→溯源校验
|
||||
// 只读验证(不写 skills 表、不落盘),证明反幻觉闸门对每条 pattern 都生效。
|
||||
package main
|
||||
|
||||
import (
|
||||
"flag"
|
||||
"fmt"
|
||||
"os"
|
||||
"sort"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/pattern"
|
||||
"github.com/xiaoxue/memoryweave/internal/skillgen"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
func main() {
|
||||
flag.Parse()
|
||||
sock := os.Getenv("LANCEDB_SOCKET")
|
||||
if sock == "" {
|
||||
sock = "/tmp/zhiyi-ipc.sock"
|
||||
}
|
||||
rc := storage.NewRustLanceDBClient(sock, nil)
|
||||
recs, err := rc.ScanAll()
|
||||
if err != nil {
|
||||
fmt.Println("scan_all error:", err)
|
||||
os.Exit(1)
|
||||
}
|
||||
dist := []models.MemoryRecord{}
|
||||
for _, r := range recs {
|
||||
if r.Category == "distilled" || r.Category == "" {
|
||||
dist = append(dist, r)
|
||||
}
|
||||
}
|
||||
cfg := pattern.DefaultConfig()
|
||||
cfg.MaxRecords = len(dist)
|
||||
pats := pattern.DetectFromRecords(dist, cfg)
|
||||
sort.SliceStable(pats, func(i, j int) bool { return len(pats[i].SourceTasks) > len(pats[j].SourceTasks) })
|
||||
|
||||
prov := skillgen.NewLanceEvidenceProvider(rc)
|
||||
gen := skillgen.NewLocal2BGenerator()
|
||||
pass, fail := 0, 0
|
||||
fmt.Printf("distilled=%d total_patterns=%d\n", len(dist), len(pats))
|
||||
for _, p := range pats {
|
||||
if p.Confidence < skillgen.DraftThreshold {
|
||||
continue // 只验证过闸项(阈值 0.85 不动)
|
||||
}
|
||||
ev, _ := prov.FetchEvidence(p.SourceTasks)
|
||||
body, gerr := gen.Generate(p, ev)
|
||||
if gerr != nil {
|
||||
fmt.Printf("[%s] conf=%.2f GEN_FAIL=%v\n", p.Name, p.Confidence, gerr)
|
||||
fail++
|
||||
continue
|
||||
}
|
||||
rate, missing := skillgen.VerifyEvidenceTrace(body, ev)
|
||||
if rate >= 1.0 {
|
||||
pass++
|
||||
} else {
|
||||
fail++
|
||||
}
|
||||
fmt.Printf("[%s] conf=%.2f nsrc=%d nev=%d trace=%.0f%% missing=%d\n",
|
||||
p.Name, p.Confidence, len(p.SourceTasks), len(ev), rate*100, len(missing))
|
||||
}
|
||||
fmt.Printf("draftable(>=0.85)=%d trace_pass=%d trace_fail=%d\n", pass+fail, pass, fail)
|
||||
if fail > 0 {
|
||||
os.Exit(1)
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,98 @@
|
||||
// evtrace-check — 验证技能草稿的命令可溯率(t_9ccbca15 AC3:<100% 即不合格)。
|
||||
// 用法:evtrace-check <pattern-id> [draft-file]
|
||||
// 读 graph_nodes.properties.source_tasks → sidecar 取原文 → VerifyEvidenceTrace(draft, ev)
|
||||
package main
|
||||
|
||||
import (
|
||||
"database/sql"
|
||||
"encoding/json"
|
||||
"fmt"
|
||||
"os"
|
||||
"strings"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/skillgen"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
_ "modernc.org/sqlite"
|
||||
)
|
||||
|
||||
func main() {
|
||||
if len(os.Args) < 2 {
|
||||
fmt.Println("usage: evtrace-check <source_pattern> [draft-file]")
|
||||
os.Exit(2)
|
||||
}
|
||||
pid := os.Args[1]
|
||||
graphPath := "/var/lib/memoryweave/graph.db"
|
||||
if v := os.Getenv("GRAPH_PATH"); v != "" {
|
||||
graphPath = v
|
||||
}
|
||||
// 1. 读 pattern 节点 source_tasks
|
||||
db, err := sql.Open("sqlite", "file:"+graphPath+"?_pragma=busy_timeout(5000)")
|
||||
if err != nil {
|
||||
fmt.Println("open graph:", err)
|
||||
os.Exit(1)
|
||||
}
|
||||
defer db.Close()
|
||||
var propsRaw, name string
|
||||
if err := db.QueryRow(`SELECT name,properties FROM graph_nodes WHERE id=? AND type='pattern'`, pid).Scan(&name, &propsRaw); err != nil {
|
||||
fmt.Println("pattern not found:", err)
|
||||
os.Exit(1)
|
||||
}
|
||||
var props map[string]interface{}
|
||||
_ = json.Unmarshal([]byte(propsRaw), &props)
|
||||
var ids []string
|
||||
if ts, ok := props["source_tasks"].([]interface{}); ok {
|
||||
for _, v := range ts {
|
||||
if s2, ok := v.(string); ok {
|
||||
ids = append(ids, s2)
|
||||
}
|
||||
}
|
||||
}
|
||||
fmt.Printf("pattern id=%s name=%s nsrc=%d\n", pid, name, len(ids))
|
||||
|
||||
// 2. sidecar 取证据原文
|
||||
sock := os.Getenv("LANCEDB_SOCKET")
|
||||
if sock == "" {
|
||||
sock = "/tmp/zhiyi-ipc.sock"
|
||||
}
|
||||
rc := storage.NewRustLanceDBClient(sock, nil)
|
||||
prov := skillgen.NewLanceEvidenceProvider(rc)
|
||||
ev, err := prov.FetchEvidence(ids)
|
||||
if err != nil {
|
||||
fmt.Println("fetch evidence:", err)
|
||||
os.Exit(1)
|
||||
}
|
||||
fmt.Printf("evidence fetched=%d\n", len(ev))
|
||||
|
||||
// 3. 读草稿(draft-file 或从 skills 表 content 去头)
|
||||
var draft string
|
||||
if len(os.Args) >= 3 {
|
||||
b, _ := os.ReadFile(os.Args[2])
|
||||
draft = string(b)
|
||||
} else {
|
||||
var content string
|
||||
if err := db.QueryRow(`SELECT content FROM skills WHERE source_pattern=?`, pid).Scan(&content); err != nil {
|
||||
fmt.Println("read skill:", err)
|
||||
os.Exit(1)
|
||||
}
|
||||
draft = content
|
||||
}
|
||||
// 去 [AUTO-DRAFT] 头(含溯源快照元数据),只校验模型生成的正文命令 token。
|
||||
// 头里有 pattern id / mem_ ids / created_at —— 是元数据不是草稿正文,不参与溯源校验。
|
||||
body := draft
|
||||
if i := strings.Index(draft, "<!-- pattern-snapshot:"); i >= 0 {
|
||||
if j := strings.Index(draft[i:], "\n"); j >= 0 {
|
||||
body = draft[i+j+1:]
|
||||
}
|
||||
}
|
||||
|
||||
rate, missing := skillgen.VerifyEvidenceTrace(body, ev)
|
||||
fmt.Printf("draft_len=%d trace_rate=%.2f%%\n", len(draft), rate*100)
|
||||
if len(missing) > 0 {
|
||||
fmt.Printf("MISSING tokens (%d):\n", len(missing))
|
||||
for _, m := range missing {
|
||||
fmt.Printf(" - %q\n", m)
|
||||
}
|
||||
os.Exit(1)
|
||||
}
|
||||
fmt.Println("TRACE_OK: 命令可溯率 100%")
|
||||
}
|
||||
@@ -0,0 +1,190 @@
|
||||
// pattern-fullscan-probe — 全表 L2 检测探针(t_d8830204)
|
||||
// 读:经 sidecar IPC lancedb_scan_all 取全量存活行(detect 端点被硬限 5000,物理序前 N 条
|
||||
//
|
||||
// 是"不幸窗口"→ 检不到;本探针无上限,覆盖全表)。
|
||||
//
|
||||
// 检:真实 pattern.DetectFromRecords(与生产同一份代码,不改判据、不降阈值)。
|
||||
// 写(仅 -write,且仅 conf≥0.85 的诚实过闸项):
|
||||
// - L2:pattern.GraphPatternStore.UpsertPatterns → graph_nodes(type='pattern')
|
||||
// - L3:skillgen.DraftSkill → skills(status=draft) + attachments/<pattern>/skill-draft.md
|
||||
//
|
||||
// 红线:L3 草稿绝不自动 promote;不自动进 skills/ 技能库。
|
||||
package main
|
||||
|
||||
import (
|
||||
"flag"
|
||||
"fmt"
|
||||
"os"
|
||||
"sort"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/pattern"
|
||||
"github.com/xiaoxue/memoryweave/internal/skillgen"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
func joinPlus(tools []string) string {
|
||||
out := ""
|
||||
for i, t := range tools {
|
||||
if i > 0 {
|
||||
out += "+"
|
||||
}
|
||||
out += t
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
func main() {
|
||||
write := flag.Bool("write", false, "write L2 patterns (conf>=0.5) + L3 drafts (conf>=0.85); default dry-run")
|
||||
attRoot := flag.String("attach", "", "attachments root for L3 drafts (default skillgen.DefaultAttachmentsRoot)")
|
||||
flag.Parse()
|
||||
|
||||
sock := os.Getenv("LANCEDB_SOCKET")
|
||||
if sock == "" {
|
||||
sock = "/tmp/zhiyi-ipc.sock"
|
||||
}
|
||||
rc := storage.NewRustLanceDBClient(sock, nil)
|
||||
recs, err := rc.ScanAll()
|
||||
if err != nil {
|
||||
fmt.Println("scan_all error:", err)
|
||||
os.Exit(1)
|
||||
}
|
||||
dist := make([]models.MemoryRecord, 0, len(recs))
|
||||
for _, r := range recs {
|
||||
if r.Category == "distilled" || r.Category == "" {
|
||||
dist = append(dist, r)
|
||||
}
|
||||
}
|
||||
fmt.Printf("scan_all live=%d distilled_scanned=%d\n", len(recs), len(dist))
|
||||
|
||||
// debug: 抽样看 content 是否非空 + 工具命中
|
||||
nonEmpty := 0
|
||||
samples := 0
|
||||
for _, r := range dist {
|
||||
if r.Content != "" {
|
||||
nonEmpty++
|
||||
}
|
||||
if samples < 3 && r.Content != "" {
|
||||
fmt.Printf(" sample id=%s len=%d tools=%v content=%.80s\n",
|
||||
r.ID, len(r.Content), pattern.ExtractTools(r.Content), r.Content)
|
||||
samples++
|
||||
}
|
||||
}
|
||||
fmt.Printf("non_empty_content=%d/%d\n", nonEmpty, len(dist))
|
||||
|
||||
// debug: ID 是否非空(DetectFromRecords 要求非空 ID 去重计源)
|
||||
emptyID := 0
|
||||
for _, r := range dist {
|
||||
if r.ID == "" {
|
||||
emptyID++
|
||||
}
|
||||
}
|
||||
fmt.Printf("empty_ID=%d/%d\n", emptyID, len(dist))
|
||||
|
||||
// debug: 工具命中统计(复刻 combo 计数)
|
||||
toolRecs := 0
|
||||
comboN := map[string]int{}
|
||||
for _, r := range dist {
|
||||
tools := pattern.ExtractTools(r.Content)
|
||||
if len(tools) >= 2 {
|
||||
toolRecs++
|
||||
comboN["tool_combo:"+joinPlus(tools)]++
|
||||
}
|
||||
}
|
||||
fmt.Printf("records_with_>=2_tools=%d\n--- top combos (records, not dedup src) ---\n", toolRecs)
|
||||
type kv struct {
|
||||
k string
|
||||
v int
|
||||
}
|
||||
var arr []kv
|
||||
for k, v := range comboN {
|
||||
arr = append(arr, kv{k, v})
|
||||
}
|
||||
sort.Slice(arr, func(i, j int) bool { return arr[i].v > arr[j].v })
|
||||
for i, e := range arr {
|
||||
if i >= 15 {
|
||||
break
|
||||
}
|
||||
fmt.Printf(" %-45s %d\n", e.k, e.v)
|
||||
}
|
||||
|
||||
cfg := pattern.DefaultConfig() // 不改任何阈值(MinWriteConfidence=0.5, DraftThreshold=0.85)
|
||||
cfg.MaxRecords = len(dist) // 覆盖全表(DefaultConfig 仅 500;API 端点又硬限 5000)
|
||||
pats := pattern.DetectFromRecords(dist, cfg)
|
||||
fmt.Printf("detected=%d\n", len(pats))
|
||||
// debug: 打印前 3 个 pattern 的 ID/name/conf/src
|
||||
for i, p := range pats {
|
||||
if i >= 3 {
|
||||
break
|
||||
}
|
||||
fmt.Printf(" pat[%d] id=%q name=%q conf=%.2f nsrc=%d\n", i, p.ID, p.Name, p.Confidence, len(p.SourceTasks))
|
||||
}
|
||||
sort.SliceStable(pats, func(i, j int) bool { return len(pats[i].SourceTasks) > len(pats[j].SourceTasks) })
|
||||
for _, p := range pats {
|
||||
fmt.Printf(" %-45s type=%s conf=%.2f nsrc=%d\n", p.Name, p.Type, p.Confidence, len(p.SourceTasks))
|
||||
}
|
||||
|
||||
writeOK, draftOK := []pattern.Pattern{}, []pattern.Pattern{}
|
||||
for _, p := range pats {
|
||||
if p.Confidence >= pattern.MinWriteConfidence {
|
||||
writeOK = append(writeOK, p)
|
||||
}
|
||||
if p.Confidence >= skillgen.DraftThreshold {
|
||||
draftOK = append(draftOK, p)
|
||||
}
|
||||
}
|
||||
fmt.Printf("pass write-gate(>=%.1f)=%d pass L3(>=%.2f)=%d\n",
|
||||
pattern.MinWriteConfidence, len(writeOK), skillgen.DraftThreshold, len(draftOK))
|
||||
|
||||
if !*write {
|
||||
fmt.Println("DRY-RUN: 不写库、不落盘(加 -write 才落库)")
|
||||
return
|
||||
}
|
||||
|
||||
graphPath := os.Getenv("GRAPH_PATH")
|
||||
if graphPath == "" {
|
||||
graphPath = "/var/lib/memoryweave/graph.db"
|
||||
}
|
||||
// L2 写入(conf>=0.5,生产同一 UpsertPatterns 含 IsValidPatternName 写闸)
|
||||
pstore := pattern.NewGraphPatternStore(graphPath)
|
||||
defer pstore.Close()
|
||||
c, u, e := pstore.UpsertPatterns(writeOK)
|
||||
if e != nil {
|
||||
fmt.Println("UpsertPatterns error:", e)
|
||||
}
|
||||
fmt.Printf("L2 upsert: created=%d updated=%d\n", c, u)
|
||||
|
||||
// L3 草稿(仅 conf>=0.85;本地 2B;绝不 promote)
|
||||
if len(draftOK) > 0 {
|
||||
sstore := skillgen.NewStore(graphPath)
|
||||
defer sstore.Close()
|
||||
// 返修 #5:重生成前把现存 draft 全部作废(stale),防止人 promote 到上一版拼接怪。
|
||||
// 本轮重新过闸的 pattern 会在 PutDraft 里把对应行从 stale 复位成 draft。
|
||||
if n, serr := sstore.MarkAllStale(); serr == nil && n > 0 {
|
||||
fmt.Printf("L3 stale-marked 旧草稿 %d 条(重生成前作废)\n", n)
|
||||
}
|
||||
gen := skillgen.NewLocal2BGenerator()
|
||||
// t_9ccbca15(D2 反幻觉):用同一 sidecar(rc)取 pattern 命中记忆的真实原文注入 prompt。
|
||||
prov := skillgen.NewLanceEvidenceProvider(rc)
|
||||
// t_45677e64(返修 #1):bge-m3 向量聚类,证据按主题成簇,只对最大簇生成(防跨主题拼接)。
|
||||
// 端点默认 http://localhost:8000/v1/embeddings(VLLM_ENDPOINT 可覆盖),不可用时退化为
|
||||
// 逐条孤例 ⇒ 最大簇<3 ⇒ 该 pattern 本轮不出草稿(宁缺毋滥,不产杂烩)。
|
||||
emb := storage.NewEmbedder("")
|
||||
clusterer := skillgen.NewBGEClusterer(emb.Encode)
|
||||
root := *attRoot
|
||||
if root == "" {
|
||||
root = skillgen.DefaultAttachmentsRoot()
|
||||
}
|
||||
for _, p := range draftOK {
|
||||
sk, path, derr := skillgen.DraftSkillClustered(sstore, gen, prov, clusterer, p, root)
|
||||
if derr != nil {
|
||||
fmt.Printf(" L3 draft FAIL %s: %v\n", p.Name, derr)
|
||||
continue
|
||||
}
|
||||
fmt.Printf(" L3 draft OK %s -> status=%s file=%s\n", p.Name, sk.Status, path)
|
||||
}
|
||||
n, _ := sstore.Count("draft")
|
||||
s, _ := sstore.Count("stale")
|
||||
fmt.Printf("skills draft count=%d stale count=%d\n", n, s)
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,137 @@
|
||||
// impact-probe — 候选池规则过滤影响面实测(t_4594b632 第二步)
|
||||
// 读:sidecar IPC lancedb_scan_all 全量存活行(与 pattern-fullscan-probe 同通道)。
|
||||
// 算:对每条 content 逐条跑候选规则,统计每条规则会拦掉多少条 / 占比 / 前10条样本。
|
||||
// 规则纯函数、零 LLM、零写库。用于决定「真缺才写 / 已覆盖 / 不该有」。
|
||||
package main
|
||||
|
||||
import (
|
||||
"flag"
|
||||
"fmt"
|
||||
"os"
|
||||
"regexp"
|
||||
"sort"
|
||||
"strings"
|
||||
"unicode"
|
||||
"unicode/utf8"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
type ruleResult struct {
|
||||
name string
|
||||
hit []string // 样本(content 前 80 字)
|
||||
}
|
||||
|
||||
func main() {
|
||||
sock := flag.String("sock", "", "LANCEDB socket")
|
||||
flag.Parse()
|
||||
s := *sock
|
||||
if s == "" {
|
||||
if env := os.Getenv("LANCEDB_SOCKET"); env != "" {
|
||||
s = env
|
||||
} else {
|
||||
s = "/tmp/zhiyi-ipc.sock"
|
||||
}
|
||||
}
|
||||
rc := storage.NewRustLanceDBClient(s, nil)
|
||||
recs, err := rc.ScanAll()
|
||||
if err != nil {
|
||||
fmt.Println("scan_all error:", err)
|
||||
return
|
||||
}
|
||||
// 两个池都统计:mem_(L2 pattern 候选)+ ep_(原始 episode)
|
||||
var cand, ep []models.MemoryRecord
|
||||
for _, r := range recs {
|
||||
if strings.HasPrefix(r.ID, "mem_") {
|
||||
cand = append(cand, r)
|
||||
} else if strings.HasPrefix(r.ID, "ep_") {
|
||||
ep = append(ep, r)
|
||||
}
|
||||
}
|
||||
fmt.Printf("scan_all=%d candidate_pool(mem_)=%d episodes(ep_)=%d\n", len(recs), len(cand), len(ep))
|
||||
|
||||
rules := []struct {
|
||||
name string
|
||||
fn func(string) bool
|
||||
}{
|
||||
{"纯数字(全数字)", isPureDigits},
|
||||
{"散列(长hex>24)", isLongHex},
|
||||
{"散列(长base64/字母数字>24)", isLongAlnum},
|
||||
{"超长无空格(>80,日志/粘贴)", isLongNoSpace},
|
||||
}
|
||||
|
||||
for _, pool := range []struct {
|
||||
name string
|
||||
recs []models.MemoryRecord
|
||||
}{{"mem_", cand}, {"ep_", ep}} {
|
||||
fmt.Printf("\n########## POOL=%s (%d) ##########\n", pool.name, len(pool.recs))
|
||||
for _, r := range rules {
|
||||
hits := []string{}
|
||||
for _, rec := range pool.recs {
|
||||
if r.fn(rec.Content) {
|
||||
hits = append(hits, rec.Content)
|
||||
}
|
||||
}
|
||||
pct := 100.0 * float64(len(hits)) / float64(len(pool.recs))
|
||||
sort.Slice(hits, func(i, j int) bool { return len(hits[i]) > len(hits[j]) })
|
||||
fmt.Printf("\n=== rule %q → 拦截 %d/%d (%.2f%%) ===\n", r.name, len(hits), len(pool.recs), pct)
|
||||
for i, h := range hits {
|
||||
if i >= 10 {
|
||||
break
|
||||
}
|
||||
fmt.Printf(" [%d] len=%d %.80s\n", i, len(h), h)
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// 纯数字:整串只含 0-9(允许 . : - 空格 分隔,如 IP/端口/日期;纯数字才算)
|
||||
func isPureDigits(s string) bool {
|
||||
t := strings.TrimSpace(s)
|
||||
if t == "" || utf8.RuneCountInString(t) < 8 {
|
||||
return false // 太短不算
|
||||
}
|
||||
for _, r := range t {
|
||||
if (r < '0' || r > '9') && r != '.' && r != ':' && r != '-' && r != ' ' && r != '/' && r != '#' {
|
||||
return false
|
||||
}
|
||||
}
|
||||
return true
|
||||
}
|
||||
|
||||
// 长 hex:≥24 字符,全部 0-9a-fA-F(无空格)
|
||||
var hexRe = regexp.MustCompile(`^[0-9a-fA-F]+$`)
|
||||
|
||||
func isLongHex(s string) bool {
|
||||
t := strings.TrimSpace(s)
|
||||
if len(t) < 24 {
|
||||
return false
|
||||
}
|
||||
return hexRe.MatchString(t)
|
||||
}
|
||||
|
||||
// 长字母数字:≥24 字符,无空格,且不含中文
|
||||
var alnumRe = regexp.MustCompile(`^[0-9A-Za-z_\-+/=]+$`)
|
||||
|
||||
func isLongAlnum(s string) bool {
|
||||
t := strings.TrimSpace(s)
|
||||
if len(t) < 24 {
|
||||
return false
|
||||
}
|
||||
return alnumRe.MatchString(t)
|
||||
}
|
||||
|
||||
// 超长无空格:≥80 字符且不含空格(日志/粘贴/路径粘连)
|
||||
func isLongNoSpace(s string) bool {
|
||||
t := strings.TrimSpace(s)
|
||||
if len(t) < 80 {
|
||||
return false
|
||||
}
|
||||
for _, r := range t {
|
||||
if unicode.IsSpace(r) {
|
||||
return false
|
||||
}
|
||||
}
|
||||
return true
|
||||
}
|
||||
@@ -0,0 +1,174 @@
|
||||
// 织忆·确定性判据强化 影子探针(t_2515307a)—— 只记录,不施加
|
||||
//
|
||||
// 职责:从线上 zhiyid 拉真实召回候选(top_k=50),对每条内容跑
|
||||
// distill.RecallRuleVerdict(真实 Go 规则,零漂移),输出
|
||||
// keep / demote / drop 三组 + 每条 reason,供 AC3(结果变化对照)
|
||||
// 与 AC4(人工抽检被过滤项)取证。不改生产行为、不写库。
|
||||
//
|
||||
// 用法:
|
||||
// cd go && go run ./cmd/rulefirst-probe # 默认组查询
|
||||
// cd go && go run ./cmd/rulefirst-probe --query "..." # 单条指定
|
||||
// cd go && go run ./cmd/rulefirst-probe --out /tmp/rf.json # 落盘供 AC4 抽检
|
||||
package main
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"flag"
|
||||
"fmt"
|
||||
"io"
|
||||
"net/http"
|
||||
"os"
|
||||
"strings"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/distill"
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
)
|
||||
|
||||
var defaultQueries = []string{
|
||||
"家庭服务器 IP 星空组网 VPN",
|
||||
"gateway 模型 配置 端口",
|
||||
"看板 任务 派发 验收 回写",
|
||||
"记忆 召回 反馈 闭环 使用",
|
||||
"脚本 审批 登记 门禁",
|
||||
"织忆 LanceDB 遗忘 窗口",
|
||||
"小唯 工作笔记 待并入 经验",
|
||||
"配置文件 备份 恢复 路径",
|
||||
"本地模型 2B 双槽 队列代理",
|
||||
"牧尘 偏好 咖啡 习惯",
|
||||
}
|
||||
|
||||
func apiKey() string {
|
||||
b, err := os.ReadFile("/var/lib/memoryweave/.api-key")
|
||||
if err == nil {
|
||||
for _, line := range strings.Split(string(b), "\n") {
|
||||
s := strings.TrimSpace(line)
|
||||
if s != "" && !strings.HasPrefix(s, "#") && !strings.Contains(s, "legacy") {
|
||||
return strings.Fields(s)[0]
|
||||
}
|
||||
}
|
||||
}
|
||||
return os.Getenv("ZHIYI_API_KEY")
|
||||
}
|
||||
|
||||
func recall(query string, topK int) ([]models.RecallResult, error) {
|
||||
body, _ := json.Marshal(map[string]any{"query": query, "top_k": topK, "namespace": ""})
|
||||
req, err := http.NewRequest("POST", "http://127.0.0.1:7821/api/v1/recall", strings.NewReader(string(body)))
|
||||
if err != nil {
|
||||
return nil, err
|
||||
}
|
||||
req.Header.Set("Content-Type", "application/json")
|
||||
req.Header.Set("X-API-Key", apiKey())
|
||||
resp, err := http.DefaultClient.Do(req)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
}
|
||||
defer resp.Body.Close()
|
||||
raw, _ := io.ReadAll(io.LimitReader(resp.Body, 1<<20))
|
||||
var d struct {
|
||||
Results []models.RecallResult `json:"results"`
|
||||
}
|
||||
if err := json.Unmarshal(raw, &d); err != nil {
|
||||
return nil, fmt.Errorf("unmarshal: %w", err)
|
||||
}
|
||||
return d.Results, nil
|
||||
}
|
||||
|
||||
func main() {
|
||||
var q, out string
|
||||
flag.StringVar(&q, "query", "", "指定单条 query(默认跑内置 10 条)")
|
||||
flag.StringVar(&out, "out", "", "落盘 JSON 路径(供 AC4 抽检)")
|
||||
flag.Parse()
|
||||
|
||||
queries := defaultQueries
|
||||
if q != "" {
|
||||
queries = []string{q}
|
||||
}
|
||||
|
||||
type item struct {
|
||||
Query string `json:"query"`
|
||||
ID string `json:"id"`
|
||||
Content string `json:"content"`
|
||||
Verdict string `json:"verdict"`
|
||||
Reason string `json:"reason"`
|
||||
}
|
||||
var all []item
|
||||
var keep, demote, drop []item
|
||||
byQ := map[string][3][]item{}
|
||||
|
||||
for _, query := range queries {
|
||||
res, err := recall(query, 50)
|
||||
if err != nil {
|
||||
fmt.Printf("QUERY %q ERR %v\n", query, err)
|
||||
continue
|
||||
}
|
||||
var kk, dd, drr []item
|
||||
toItem := func(r models.RecallResult, v distill.RecallVerdict, why string) item {
|
||||
return item{Query: query, ID: r.ID, Content: r.Content, Verdict: verdictName(v), Reason: why}
|
||||
}
|
||||
// 每条候选跑真实 Go 规则
|
||||
for _, r := range res {
|
||||
v, why := distill.RecallRuleVerdict(r.Content)
|
||||
it := toItem(r, v, why)
|
||||
all = append(all, it)
|
||||
switch v {
|
||||
case distill.RecallKeep:
|
||||
kk = append(kk, it)
|
||||
case distill.RecallDemote:
|
||||
dd = append(dd, it)
|
||||
case distill.RecallDrop:
|
||||
drr = append(drr, it)
|
||||
}
|
||||
}
|
||||
keep = append(keep, kk...)
|
||||
demote = append(demote, dd...)
|
||||
drop = append(drop, drr...)
|
||||
byQ[query] = [3][]item{kk, dd, drr}
|
||||
fmt.Printf("QUERY %q → 候选=%d keep=%d demote=%d drop=%d\n",
|
||||
query, len(res), len(kk), len(dd), len(drr))
|
||||
for _, it := range drr {
|
||||
fmt.Printf(" [DROP] %-30s %s | %s\n", it.ID, it.Reason, truncate(it.Content, 42))
|
||||
}
|
||||
for _, it := range dd {
|
||||
fmt.Printf(" [DEMOTE] %-30s %s | %s\n", it.ID, it.Reason, truncate(it.Content, 42))
|
||||
}
|
||||
}
|
||||
|
||||
fmt.Printf("\n=== 汇总: 候选总数=%d keep=%d demote=%d drop=%d ===\n",
|
||||
len(all), len(keep), len(demote), len(drop))
|
||||
|
||||
if out != "" {
|
||||
f, err := os.Create(out)
|
||||
if err == nil {
|
||||
enc := json.NewEncoder(f)
|
||||
enc.SetIndent("", " ")
|
||||
_ = enc.Encode(map[string]any{
|
||||
"all": all,
|
||||
"keep": keep,
|
||||
"demote": demote,
|
||||
"drop": drop,
|
||||
"by_query": byQ,
|
||||
})
|
||||
f.Close()
|
||||
fmt.Printf("已落盘 %s\n", out)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func verdictName(v distill.RecallVerdict) string {
|
||||
switch v {
|
||||
case distill.RecallKeep:
|
||||
return "keep"
|
||||
case distill.RecallDemote:
|
||||
return "demote"
|
||||
default:
|
||||
return "drop"
|
||||
}
|
||||
}
|
||||
|
||||
func truncate(s string, n int) string {
|
||||
r := []rune(s)
|
||||
if len(r) <= n {
|
||||
return s
|
||||
}
|
||||
return string(r[:n]) + "…"
|
||||
}
|
||||
@@ -0,0 +1,109 @@
|
||||
// 织忆·确定性判据扫描(t_2515307a 取证)——按 namespace 分批扫全表,输出 drop/demote 明细供 AC4
|
||||
package main
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"fmt"
|
||||
"io"
|
||||
"net/http"
|
||||
"os"
|
||||
"strings"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/distill"
|
||||
)
|
||||
|
||||
func apikey() string {
|
||||
b, _ := os.ReadFile("/var/lib/memoryweave/.api-key")
|
||||
for _, l := range strings.Split(string(b), "\n") {
|
||||
s := strings.TrimSpace(l)
|
||||
if s != "" && !strings.HasPrefix(s, "#") && !strings.Contains(s, "legacy") {
|
||||
return strings.Fields(s)[0]
|
||||
}
|
||||
}
|
||||
return ""
|
||||
}
|
||||
|
||||
func list(ns string, limit int) ([]struct {
|
||||
ID string `json:"id"`
|
||||
Content string `json:"content"`
|
||||
}, error) {
|
||||
u := fmt.Sprintf("http://127.0.0.1:7821/api/v1/memories?limit=%d", limit)
|
||||
if ns != "" {
|
||||
u += "&namespace=" + ns
|
||||
}
|
||||
req, _ := http.NewRequest("GET", u, nil)
|
||||
req.Header.Set("X-API-Key", apikey())
|
||||
resp, err := http.DefaultClient.Do(req)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
}
|
||||
defer resp.Body.Close()
|
||||
raw, _ := io.ReadAll(io.LimitReader(resp.Body, 1<<26))
|
||||
var d struct {
|
||||
Memories []struct {
|
||||
ID string `json:"id"`
|
||||
Content string `json:"content"`
|
||||
} `json:"memories"`
|
||||
}
|
||||
if err := json.Unmarshal(raw, &d); err != nil {
|
||||
return nil, err
|
||||
}
|
||||
return d.Memories, nil
|
||||
}
|
||||
|
||||
func main() {
|
||||
namespaces := []string{
|
||||
"", "hermes-main", "shared", "wiki-curator-main", "wiki", "soulful-xiaowei",
|
||||
"a06-main", "domain:dev", "default-main", "hermes", "wiki:decision",
|
||||
}
|
||||
seen := map[string]bool{}
|
||||
var all []struct {
|
||||
ID string `json:"id"`
|
||||
Content string `json:"content"`
|
||||
}
|
||||
for _, ns := range namespaces {
|
||||
ms, err := list(ns, 1000)
|
||||
if err != nil {
|
||||
continue
|
||||
}
|
||||
for _, m := range ms {
|
||||
if !seen[m.ID] {
|
||||
seen[m.ID] = true
|
||||
all = append(all, m)
|
||||
}
|
||||
}
|
||||
}
|
||||
type rec struct {
|
||||
ID string
|
||||
Content string
|
||||
Why string
|
||||
}
|
||||
var drops, demotes []rec
|
||||
for _, m := range all {
|
||||
v, why := distill.RecallRuleVerdict(m.Content)
|
||||
if v == distill.RecallDrop {
|
||||
drops = append(drops, rec{m.ID, m.Content, why})
|
||||
} else if v == distill.RecallDemote {
|
||||
demotes = append(demotes, rec{m.ID, m.Content, why})
|
||||
}
|
||||
}
|
||||
fmt.Printf("unique_total=%d drops=%d demotes=%d\n\n", len(all), len(drops), len(demotes))
|
||||
fmt.Println("===== DROPS (进不了 top-N) =====")
|
||||
for i, d := range drops {
|
||||
rc := []rune(d.Content)
|
||||
c := d.Content
|
||||
if len(rc) > 55 {
|
||||
c = string(rc[:55]) + "…"
|
||||
}
|
||||
fmt.Printf("%2d. [%s] %s\n", i+1, d.Why, c)
|
||||
}
|
||||
fmt.Println("\n===== DEMOTES (降权) =====")
|
||||
for i, d := range demotes {
|
||||
rc := []rune(d.Content)
|
||||
c := d.Content
|
||||
if len(rc) > 55 {
|
||||
c = string(rc[:55]) + "…"
|
||||
}
|
||||
fmt.Printf("%2d. [%s] %s\n", i+1, d.Why, c)
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,33 @@
|
||||
// skilleval-live — 验证 LLMEvaluator 调本地 2B(8081) 重写理由 + 确定性兜底(t_4594b632)
|
||||
// 只读草稿 + 调 2B,零写库。单发手动验证。
|
||||
package main
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"fmt"
|
||||
"os"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/pattern"
|
||||
"github.com/xiaoxue/memoryweave/internal/skillgen"
|
||||
)
|
||||
|
||||
func main() {
|
||||
path := os.Args[1]
|
||||
content, err := os.ReadFile(path)
|
||||
if err != nil {
|
||||
fmt.Println("read error:", err)
|
||||
os.Exit(1)
|
||||
}
|
||||
p := pattern.Pattern{ID: "pat_x", Type: "tool_combo", Name: "tool_combo:hermes+python", Confidence: 1.0, Tools: []string{"hermes", "python"}}
|
||||
ev := skillgen.NewLLMEvaluator()
|
||||
start := time.Now()
|
||||
r, err := ev.Evaluate(string(content), p)
|
||||
if err != nil {
|
||||
fmt.Println("eval error:", err)
|
||||
os.Exit(1)
|
||||
}
|
||||
b, _ := json.MarshalIndent(r, "", " ")
|
||||
fmt.Println(string(b))
|
||||
fmt.Println("elapsed:", time.Since(start).Round(time.Millisecond))
|
||||
}
|
||||
@@ -0,0 +1,34 @@
|
||||
// skilleval-probe — 对 t_d8830204 产出的 skill 草稿跑 SkillEvaluator 打分(t_4594b632 AC4)
|
||||
// 只读草稿文件 + 评分,零写库。输出固定 JSON。
|
||||
package main
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"fmt"
|
||||
"os"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/pattern"
|
||||
"github.com/xiaoxue/memoryweave/internal/skillgen"
|
||||
)
|
||||
|
||||
func main() {
|
||||
path := os.Args[1]
|
||||
content, err := os.ReadFile(path)
|
||||
if err != nil {
|
||||
fmt.Println("read error:", err)
|
||||
os.Exit(1)
|
||||
}
|
||||
// 来源 pattern:tool_combo:hermes+python(与 t_d8830204 实测一致)
|
||||
p := pattern.Pattern{
|
||||
ID: "pat_tool_combo:hermes+python", Type: "tool_combo",
|
||||
Name: "tool_combo:hermes+python", Confidence: 1.0, Tools: []string{"hermes", "python"},
|
||||
}
|
||||
ev := skillgen.NewRuleEvaluator()
|
||||
r, err := ev.Evaluate(string(content), p)
|
||||
if err != nil {
|
||||
fmt.Println("eval error:", err)
|
||||
os.Exit(1)
|
||||
}
|
||||
b, _ := json.MarshalIndent(r, "", " ")
|
||||
fmt.Println(string(b))
|
||||
}
|
||||
@@ -10,6 +10,7 @@ import (
|
||||
"net/http"
|
||||
"os"
|
||||
"sort"
|
||||
"strconv"
|
||||
"strings"
|
||||
"unicode/utf8"
|
||||
)
|
||||
@@ -92,6 +93,8 @@ func main() {
|
||||
runErr = runStats(apiKeyVal)
|
||||
case "entity":
|
||||
runErr = runEntity(args, apiKeyVal)
|
||||
case "pattern":
|
||||
runErr = runPattern(args, apiKeyVal)
|
||||
case "help", "--help", "-h":
|
||||
flag.Usage()
|
||||
os.Exit(0)
|
||||
@@ -130,6 +133,7 @@ func usage() {
|
||||
recall <query> 语义搜索,返回 top-10 结果
|
||||
stats 显示系统统计(记忆数、蒸馏状态等)
|
||||
entity <name> 查询实体详情(出现次数、关联记忆)
|
||||
pattern <detect|list> L2 模式检测/列出(detect=手动触发检测,list=列出已检测)
|
||||
|
||||
示例:
|
||||
zhiyi tree
|
||||
@@ -461,6 +465,85 @@ func runStats(apiKey string) error {
|
||||
return nil
|
||||
}
|
||||
|
||||
// runPattern L2 模式检测 CLI 子命令(t_d32e5f8a,cron 单发)。
|
||||
// 子命令:
|
||||
// zhiyi pattern detect [--limit N] 触发检测(扫 L1 蒸馏记忆 → 工具组合/路径聚类 → 写 graph_nodes)
|
||||
// zhiyi pattern list [N] 列出已检测的 pattern(默认 20)
|
||||
func runPattern(args []string, apiKey string) error {
|
||||
// 子命令(默认 detect)
|
||||
sub := "detect"
|
||||
rest := []string{}
|
||||
if len(args) > 0 {
|
||||
// 允许 "detect" / "list" 显式指定,或把第一个参数当 limit(list N)
|
||||
switch args[0] {
|
||||
case "detect", "list":
|
||||
sub = args[0]
|
||||
rest = args[1:]
|
||||
default:
|
||||
// 数字参数 = list 的 limit
|
||||
if n, err := strconv.Atoi(args[0]); err == nil && n > 0 {
|
||||
sub = "list"
|
||||
rest = []string{args[0]}
|
||||
} else {
|
||||
rest = args
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if sub == "list" {
|
||||
limit := "20"
|
||||
if len(rest) > 0 {
|
||||
limit = rest[0]
|
||||
}
|
||||
var resp struct {
|
||||
Patterns []struct {
|
||||
ID string `json:"id"`
|
||||
Type string `json:"type"`
|
||||
Name string `json:"name"`
|
||||
Confidence float64 `json:"confidence"`
|
||||
Tools []string `json:"tools"`
|
||||
} `json:"patterns"`
|
||||
Count int `json:"count"`
|
||||
}
|
||||
if err := apiGet("/api/v1/patterns?limit="+limit, &resp, apiKey); err != nil {
|
||||
return err
|
||||
}
|
||||
fmt.Printf("📐 已检测模式 [%s] (%d)\n", *ns, resp.Count)
|
||||
fmt.Println(strings.Repeat("─", 50))
|
||||
for i, p := range resp.Patterns {
|
||||
if i >= 30 {
|
||||
fmt.Printf(" … 还有 %d 个\n", len(resp.Patterns)-30)
|
||||
break
|
||||
}
|
||||
tools := ""
|
||||
if len(p.Tools) > 0 {
|
||||
tools = strings.Join(p.Tools, ",")
|
||||
}
|
||||
fmt.Printf(" [%s] %s conf=%.2f %s\n", p.Type, p.Name, p.Confidence, tools)
|
||||
}
|
||||
if resp.Count == 0 {
|
||||
fmt.Println(" (暂无已检测模式)")
|
||||
}
|
||||
return nil
|
||||
}
|
||||
|
||||
// detect
|
||||
var resp struct {
|
||||
Scanned int `json:"scanned"`
|
||||
Created int `json:"created"`
|
||||
Updated int `json:"updated"`
|
||||
Detected int `json:"detected"`
|
||||
}
|
||||
if err := apiPost("/api/v1/patterns/detect", map[string]interface{}{
|
||||
"namespace": *ns,
|
||||
}, &resp, apiKey); err != nil {
|
||||
return err
|
||||
}
|
||||
fmt.Printf("🔬 L2 模式检测 [%s] 扫描 %d 条 → 命中 %d(新建 %d / 更新 %d)\n",
|
||||
*ns, resp.Scanned, resp.Detected, resp.Created, resp.Updated)
|
||||
return nil
|
||||
}
|
||||
|
||||
func runEntity(args []string, apiKey string) error {
|
||||
if len(args) == 0 {
|
||||
return fmt.Errorf("用法: zhiyi entity <name>")
|
||||
|
||||
@@ -14,6 +14,7 @@ import (
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/memprotect"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
@@ -67,6 +68,10 @@ func (aa *AdminAPI) Forget(w http.ResponseWriter, r *http.Request) {
|
||||
}
|
||||
|
||||
forgotten := 0
|
||||
// 2026-10-16 (t_944344b5) 遗忘保护守卫:本批加载一次保护状态(Redis vprop + protected_ids),
|
||||
// 命中任一保护规则的候选永不自动软删(fragment 与 ShouldForget 两条道都拦截)。
|
||||
protState := memprotect.LoadState()
|
||||
protected := 0
|
||||
for _, mem := range results {
|
||||
lastAccess := parseTimeStr(mem["last_recalled_at"])
|
||||
// GA-P0-2 (t_c6d41ac6):衰减/遗忘只认 recall_verified_count(正反馈才是 V 值)。
|
||||
@@ -83,6 +88,15 @@ func (aa *AdminAPI) Forget(w http.ResponseWriter, r *http.Request) {
|
||||
if len([]rune(content)) > 200 {
|
||||
continue
|
||||
}
|
||||
// 🔒 2026-10-16 (t_944344b5) 遗忘保护守卫: 命中任一保护规则的候选
|
||||
// (category∈{decision,preference,pref} / V≥2.0 / freshness=verified /
|
||||
// protected_ids 名单 / distilled 且内容命中 10 个决策·偏好关键词) 永不自动软删。
|
||||
// 拦截 point 放在 fragment + ShouldForget 两条 SoftDelete 道之前。
|
||||
if isProt, protRule := memprotect.IsProtected(mem, protState); isProt {
|
||||
protected++
|
||||
log.Printf("[forget] protected skip id=%q rule=%s (遗忘保护守卫命中, 跳过自动遗忘)", strVal(mem["id"]), protRule)
|
||||
continue
|
||||
}
|
||||
// 2026-09-07 方案A 碎片快速道(与 server.go decay trigger 一致):
|
||||
// <30 字且 >20 天未访问 → 直接遗忘(碎片 recall_count 可能虚高, 绕过保命)
|
||||
if len([]rune(content)) < 30 && time.Since(lastAccess).Hours()/24 > 20 {
|
||||
@@ -117,6 +131,8 @@ func (aa *AdminAPI) Forget(w http.ResponseWriter, r *http.Request) {
|
||||
}
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"status": "ok", "scanned": len(results), "forgotten": forgotten,
|
||||
// 2026-10-16 (t_944344b5):protected = 被遗忘保护守卫拦截、未软删的候选数
|
||||
"protected": protected,
|
||||
})
|
||||
}
|
||||
|
||||
|
||||
@@ -77,6 +77,11 @@ func (m *forgetMockLance) Update(table, id string, fields map[string]any) error
|
||||
return nil
|
||||
}
|
||||
|
||||
// GetRecordByID t_0f1d7be9(原文层):fake 默认不存在。
|
||||
func (m *forgetMockLance) GetRecordByID(table, id string) (*models.MemoryRecord, error) {
|
||||
return nil, nil
|
||||
}
|
||||
|
||||
// fragment 构造一个命中「<30 字碎片快速道」的候选(content<30 字 + 20 天未访问)。
|
||||
func fragmentCandidate(id string) map[string]interface{} {
|
||||
return map[string]interface{}{
|
||||
|
||||
@@ -2,10 +2,12 @@
|
||||
package routes
|
||||
|
||||
import (
|
||||
"log"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/distill"
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/metanote"
|
||||
"github.com/xiaoxue/memoryweave/internal/selfoptimize"
|
||||
)
|
||||
|
||||
@@ -27,8 +29,16 @@ type CommitMeta struct {
|
||||
// 2026-10-08 (t_7e3577c5):新增 embedModel/scriptVer 血缘字段透传
|
||||
// 2026-10-08 (Gap#2):改为 CommitMeta 结构体,新增 confidence 透传
|
||||
func AutoDistillTrigger(episodeID string, content string, category string, namespace string, agentID string, meta CommitMeta) {
|
||||
// 1. 硬规则过滤
|
||||
if !distill.HardRulesPass(content) {
|
||||
// 2026-10-16 t_5ad3f843:meta-note 门禁(env ZHIYI_META_FILTER=1 启用;默认关闭=零行为变化)。
|
||||
// 蒸馏是事实写入的唯一咽喉:原文判 meta ⇒ 不进蒸馏(引擎路径与降级路径都挡),
|
||||
// 从源头杜绝 meta-note 生成 memories 事实(admin distill/force 也经此函数,一并覆盖)。
|
||||
if skip, reason := metanote.ShouldSkip(content); skip {
|
||||
log.Printf("[metanote] auto-distill skipped: ep=%s agent=%s reason=%s content=%.60s", episodeID, agentID, reason, content)
|
||||
return
|
||||
}
|
||||
|
||||
// 1. 硬规则过滤(t_a513b870:带原因变体,拒绝在内部登记计数 + 打日志)
|
||||
if pass, _ := distill.HardRulesPassWithReason(content); !pass {
|
||||
return
|
||||
}
|
||||
|
||||
|
||||
@@ -6,15 +6,22 @@ import (
|
||||
"log"
|
||||
"sort"
|
||||
"strings"
|
||||
"sync/atomic"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/consolidate"
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/metrics"
|
||||
"github.com/xiaoxue/memoryweave/internal/selfoptimize"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// consolInFlight 进程内单飞锁(t_10757bd5,2026-10-24 22:50)
|
||||
//
|
||||
// 根因:t_distill(15min) 与 t_consolidation 会在同一秒各自起 goroutine 调本流水线,
|
||||
// 两条同时打 Rust sidecar 的互斥整合槽 ⇒ 必有一条吃 consolidate_busy ⇒ 静默降级
|
||||
// ⇒ 55 次/日的"假失败"其实是自相争用。单飞后同进程内不再可能撞车。
|
||||
var consolInFlight int32
|
||||
|
||||
// ConsolidationPipeline 完整整合流水线
|
||||
// 优先调用 Rust sidecar(DBSCAN + 衰减校准 + 质量回溯)
|
||||
// Rust 不可用时降级为 Go 启发式
|
||||
@@ -52,6 +59,15 @@ func (cp *ConsolidationPipeline) Run() (*ConsolidationReport, error) {
|
||||
// mode: "cluster_only" | "full" | "prune_only"
|
||||
// full 模式触发 LLM 质量回溯 + 衰减校准(仅低频调度使用)
|
||||
func (cp *ConsolidationPipeline) RunWithMode(mode string) (*ConsolidationReport, error) {
|
||||
// ─── 单飞:同进程内的多触发器不得并发打 sidecar(t_10757bd5)────────
|
||||
if !atomic.CompareAndSwapInt32(&consolInFlight, 0, 1) {
|
||||
GetConsolTracker().RecordSkip("already_running (in-process singleflight)")
|
||||
log.Printf("[consolidation] 上一次整合仍在进行,本次触发跳过(跳过不计失败)")
|
||||
now := time.Now()
|
||||
return &ConsolidationReport{StartedAt: now, FinishedAt: now, Duration: "skipped_inflight"}, nil
|
||||
}
|
||||
defer atomic.StoreInt32(&consolInFlight, 0)
|
||||
|
||||
// ─── 前置检查:timestamp 合理性(防止 epoch-0 数据污染聚类结果)────────
|
||||
if mode == "full" || mode == "cluster_only" {
|
||||
if suspicious, total := cp.checkTimestampSanity(); suspicious > 0 {
|
||||
@@ -59,11 +75,12 @@ func (cp *ConsolidationPipeline) RunWithMode(mode string) (*ConsolidationReport,
|
||||
}
|
||||
}
|
||||
|
||||
// ─── 尝试 Rust sidecar ───────────────────────────────────────
|
||||
// ─── 尝试 Rust sidecar(t_10757bd5:busy-wait + 健康跟踪)────────
|
||||
var report *ConsolidationReport
|
||||
if cp.dataDir != "" && cp.sqlitePath != "" {
|
||||
// 用指定模式调用 Rust sidecar
|
||||
if rustReport, err := consolidate.Run(cp.dataDir, cp.sqlitePath, mode); err == nil {
|
||||
// busyWaitRetry 处理 consolidate_busy:等待 3s×3 次再降级(治「静默堆积」根因)
|
||||
rustReport, stillBusy, err := busyWaitRetry(cp.dataDir, cp.sqlitePath, mode)
|
||||
if err == nil && !stillBusy {
|
||||
report = &ConsolidationReport{
|
||||
StartedAt: time.Now(),
|
||||
FinishedAt: time.Now(),
|
||||
@@ -93,8 +110,18 @@ func (cp *ConsolidationPipeline) RunWithMode(mode string) (*ConsolidationReport,
|
||||
// Phase F: 整合完成后更新 Prometheus metrics
|
||||
metrics.TotalMemories.Set(float64(rustReport.Clusters * 10)) // 估算
|
||||
metrics.SyncFromDashboard(selfoptimize.Dash.Metrics())
|
||||
// t_10757bd5 AC4:成功 ⇒ tracker 归零(/health 可读到 LastSuccessTime)
|
||||
GetConsolTracker().RecordSuccess()
|
||||
} else {
|
||||
log.Printf("[consolidation] Rust sidecar 不可用 (%v),降级为 Go 启发式", err)
|
||||
// busy(重试耗尽)⇒ **跳过**,不是失败;非 busy 错误 ⇒ 真失败
|
||||
if stillBusy {
|
||||
log.Printf("[consolidation] sidecar 忙(重试 9s 耗尽),本次跳过 —— busy=别人在跑,不等于链路坏")
|
||||
GetConsolTracker().RecordSkip("consolidate_busy after retries")
|
||||
} else {
|
||||
errStr := fmt.Sprintf("%v", err)
|
||||
log.Printf("[consolidation] Rust sidecar 真失败 (%s),降级为 Go 启发式", errStr)
|
||||
GetConsolTracker().RecordFailure(errStr)
|
||||
}
|
||||
goReport, goErr := cp.runGoFallback()
|
||||
if goErr != nil {
|
||||
return nil, goErr
|
||||
@@ -249,7 +276,12 @@ func (cp *ConsolidationPipeline) mergeSimilar() (int, error) {
|
||||
// 保留较新的
|
||||
idI := strVal(mems[i]["id"])
|
||||
idJ := strVal(mems[j]["id"])
|
||||
_ = cp.ldb.SoftDelete(idJ, fmt.Sprintf("merged_into_%s", idI))
|
||||
// t_cf680fad:不再 `_ =` 静默吞错。MVCC 冲突耗尽时 SoftDelete 内部会
|
||||
// 把 (idJ, reason) 落 durable pending 队列(softdelete_pending.go),
|
||||
// 启动/每 tick drain 重放必落盘;这里显式记日志做观测(禁静默)。
|
||||
if err := cp.ldb.SoftDelete(idJ, fmt.Sprintf("merged_into_%s", idI)); err != nil {
|
||||
log.Printf("[consolidation] merge-softdelete FAILED: src=%s → target=%s err=%v (pending-queue 将重放)", idJ, idI, err)
|
||||
}
|
||||
merged++
|
||||
}
|
||||
}
|
||||
|
||||
@@ -0,0 +1,163 @@
|
||||
// 织忆 MemoryWeave — 整合链路健康跟踪(t_10757bd5)
|
||||
//
|
||||
// 背景(2026-10-24 小怡体检实测):
|
||||
// - t_distill(15min) 与 t_consolidation 同时触发 consolPipe,
|
||||
// Rust 侧互斥整合槽被占用时 Go 立即降级 Go 启发式 ⇒ consolidate_busy ~55 次/日静默堆积
|
||||
// - /health 只看 sidecar TCP 连通性 ⇒ 整合链路持续失败也假绿
|
||||
//
|
||||
// 本文件提供:
|
||||
// 1. ConsolidationTracker — 记录连续失败次数 + 最近一次成功时间(供 /health 读)
|
||||
// 2. busyWaitRetry — Rust sidecar 报 busy 时等待 3s×3 次再降级(整合全程 ~126s)
|
||||
// 3. 引用 metrics 包新增的 5 个指标(AC5:失败路径带计数)
|
||||
package routes
|
||||
|
||||
import (
|
||||
"strings"
|
||||
"sync"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/consolidate"
|
||||
"github.com/xiaoxue/memoryweave/internal/metrics"
|
||||
)
|
||||
|
||||
// ─── ConsolidationTracker ────────────────────────────────────
|
||||
|
||||
var (
|
||||
consTracker = &ConsolidationTracker{}
|
||||
consTrackerOnce sync.Once
|
||||
)
|
||||
|
||||
// ConsolidationTracker 记录整合链路健康状态(内存态,重启归零;
|
||||
// 重启后健康端点读到 ConsecutiveFailures=0 ⇒ 正确,因为该链路确实刚起步)。
|
||||
type ConsolidationTracker struct {
|
||||
mu sync.Mutex
|
||||
LastSuccess time.Time
|
||||
LastAttempt time.Time
|
||||
startup time.Time
|
||||
ConsecutiveFailures int
|
||||
Skips int64 // t_10757bd5:需要"跳过"而非失败的次数(并发触发 / sidecar busy)
|
||||
lastSkip string // 最近一次跳过原因
|
||||
// lastError 最近一次失败原因(供 /health 暴露,便于人工诊断)
|
||||
lastError string
|
||||
}
|
||||
|
||||
// GetConsolTracker 返回全局 tracker 单例
|
||||
func GetConsolTracker() *ConsolidationTracker {
|
||||
if consTracker.startup.IsZero() {
|
||||
consTracker.mu.Lock()
|
||||
if consTracker.startup.IsZero() {
|
||||
consTracker.startup = time.Now()
|
||||
}
|
||||
consTracker.mu.Unlock()
|
||||
}
|
||||
return consTracker
|
||||
}
|
||||
|
||||
// RecordSuccess 整合成功(归零)
|
||||
func (t *ConsolidationTracker) RecordSuccess() {
|
||||
t.mu.Lock()
|
||||
defer t.mu.Unlock()
|
||||
t.LastAttempt = time.Now()
|
||||
t.LastSuccess = time.Now()
|
||||
t.ConsecutiveFailures = 0
|
||||
t.lastError = ""
|
||||
metrics.ConsolLastSuccessTime.SetToCurrentTime()
|
||||
metrics.ConsolConsecutiveFailures.Set(0)
|
||||
}
|
||||
|
||||
// RecordSkip 本次触发被**跳过**(不是失败)。
|
||||
//
|
||||
// t_10757bd5 关键语义修正(2026-10-24 22:45 实测发现):
|
||||
// `consolidate_busy` 的真实含义是「另一个整合正在跑」,不是链路坏。
|
||||
// 把它记成失败会让 /health 报 degraded —— 明明整合正在正常工作,却又是一次假红。
|
||||
// 只有真正的错误(sidecar 崩、DB 错、超时)才算 failure。
|
||||
func (t *ConsolidationTracker) RecordSkip(reason string) {
|
||||
t.mu.Lock()
|
||||
defer t.mu.Unlock()
|
||||
t.LastAttempt = time.Now()
|
||||
t.Skips++
|
||||
t.lastSkip = reason
|
||||
}
|
||||
|
||||
// RecordFailure 整合失败(+1)
|
||||
func (t *ConsolidationTracker) RecordFailure(err string) {
|
||||
t.mu.Lock()
|
||||
defer t.mu.Unlock()
|
||||
t.LastAttempt = time.Now()
|
||||
t.ConsecutiveFailures++
|
||||
t.lastError = err
|
||||
metrics.ConsolConsecutiveFailures.Set(float64(t.ConsecutiveFailures))
|
||||
}
|
||||
|
||||
// HealthStatus 返回健康端点应报的状态:
|
||||
// - 连续**真失败** ≥ 3 ⇒ "degraded"
|
||||
// - 进程启动已超 2 小时却从未成功过 ⇒ "degraded"(跳过不算成功,也不算失败)
|
||||
// - 上次成功距今 > 2 小时(15min 周期 × 8)⇒ "degraded"
|
||||
// - 否则 "ok"
|
||||
func (t *ConsolidationTracker) HealthStatus() (string, int, time.Duration, string) {
|
||||
t.mu.Lock()
|
||||
defer t.mu.Unlock()
|
||||
fails := t.ConsecutiveFailures
|
||||
var sinceSuccess time.Duration
|
||||
if t.LastSuccess.IsZero() {
|
||||
sinceSuccess = 0 // 从未成功
|
||||
} else {
|
||||
sinceSuccess = time.Since(t.LastSuccess)
|
||||
}
|
||||
status := "ok"
|
||||
if fails >= 3 {
|
||||
status = "degraded"
|
||||
}
|
||||
if t.LastSuccess.IsZero() {
|
||||
if !t.startup.IsZero() && time.Since(t.startup) > 2*time.Hour {
|
||||
status = "degraded"
|
||||
}
|
||||
} else if sinceSuccess > 2*time.Hour {
|
||||
status = "degraded"
|
||||
}
|
||||
return status, fails, sinceSuccess, t.lastError
|
||||
}
|
||||
|
||||
// Snapshot 供 /health 暴露完整字段(含跳过次数,便于区分「忙」与「坏」)
|
||||
func (t *ConsolidationTracker) Snapshot() (fails int, skips int64, lastSkip string, lastErr string) {
|
||||
t.mu.Lock()
|
||||
defer t.mu.Unlock()
|
||||
return t.ConsecutiveFailures, t.Skips, t.lastSkip, t.lastError
|
||||
}
|
||||
|
||||
// ─── busyWaitRetry ───────────────────────────────────────────
|
||||
|
||||
// busyWaitRetry 对 Rust sidecar consolidate_busy 做有限等待重试。
|
||||
//
|
||||
// 原理:Rust 整合全程约 126s(DBSCAN + 衰减校准),触发器每 15min 一次,
|
||||
// 两个触发器同秒到达时第二个撞 busy。等待 3s × 3 次(共 9s);
|
||||
// 9s 后仍 busy 说明 sidecar 真有长任务(或正在做 full 模式),
|
||||
// 降级 Go 启发式并记录 tracker(由调用方负责)。
|
||||
//
|
||||
// 返回语义:
|
||||
// - (report, false, nil) = 成功拿到报告
|
||||
// - (nil, true, nil) = 重试耗尽仍 busy(调用方应走降级 + RecordFailure)
|
||||
// - (nil, false, err) = 非 busy 错误(调用方直接返回)
|
||||
func busyWaitRetry(dataDir, sqlitePath, mode string) (report *consolidate.Result, stillBusy bool, err error) {
|
||||
const (
|
||||
maxRetries = 3
|
||||
waitDur = 3 * time.Second
|
||||
)
|
||||
for i := 0; i <= maxRetries; i++ {
|
||||
if i > 0 {
|
||||
metrics.ConsolidateBusyWaitTotal.Inc()
|
||||
time.Sleep(waitDur)
|
||||
}
|
||||
report, err = consolidate.Run(dataDir, sqlitePath, mode)
|
||||
if err == nil {
|
||||
return report, false, nil
|
||||
}
|
||||
if strings.Contains(err.Error(), "consolidate_busy") {
|
||||
continue // 仍 busy,重试
|
||||
}
|
||||
// 非 busy 错误直接返回
|
||||
return nil, false, err
|
||||
}
|
||||
// 重试耗尽仍 busy
|
||||
return nil, true, nil
|
||||
}
|
||||
@@ -0,0 +1,119 @@
|
||||
// 织忆 MemoryWeave — 召回响应契约辅助(P0-3,2026-10-26)
|
||||
//
|
||||
// 背景(CS249r Vol III Ch6 检索契约):响应只有 cache_hit/candidates_scanned/count/mode/graph_expanded,
|
||||
// 空结果分不清「不存在」与「扫了一半就超时」——这是 Air Canada 类静默幻觉的结构性入口。
|
||||
//
|
||||
// 本文件提供最小可用契约三件:
|
||||
// ① status/partial_reason:complete 的空结果才允许解读为「不存在」;
|
||||
// ② scope{namespace,snapshot,...}:说明这次答案基于哪个数据视图(本服务无索引版本号,
|
||||
// 故 snapshot = 观测时点 + 缓存状态,缓存命中代表 60s 内旧快照 —— 语义诚实,不假装有版本号);
|
||||
// ③ continuation:不透明翻页令牌(query 指纹 + ns 绑定,防止跨 query 串页)。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"crypto/sha256"
|
||||
"encoding/base64"
|
||||
"encoding/hex"
|
||||
"encoding/json"
|
||||
"errors"
|
||||
"strconv"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// maxContinuationOffset 硬上限:防止把 topK 放大到爆内存/延迟。
|
||||
const maxContinuationOffset = 500
|
||||
|
||||
type pageToken struct {
|
||||
V int `json:"v"`
|
||||
Q string `json:"q"` // query 指纹(sha256 前 8 hex)
|
||||
NS string `json:"ns"` // 作用域绑定
|
||||
Off int `json:"o"` // 下一页起点
|
||||
Lim int `json:"l"` // 页大小
|
||||
// Prev 已返回过的 ID(去重锚点)。活索引下排序会随 fetchLimit 变化而轻微漂移,
|
||||
// 只靠 offset 会出现跨页重复;token 携带已返回 ID 才能机械保证「不重」。
|
||||
Prev []string `json:"p,omitempty"`
|
||||
}
|
||||
|
||||
// maxPrevIDs 令牌里最多携带的去重锚点数(3~5 页内足够;超长则丢最旧,令牌不会无限膨胀)。
|
||||
const maxPrevIDs = 100
|
||||
|
||||
// queryFingerprint 8 hex 的 query 指纹(足够防串页,不泄露正文)。
|
||||
func queryFingerprint(q string) string {
|
||||
sum := sha256.Sum256([]byte(q))
|
||||
return hex.EncodeToString(sum[:4])
|
||||
}
|
||||
|
||||
// encodeContinuation 生成下一页令牌;没有下一页时返回空串。
|
||||
func encodeContinuation(query, namespace string, offset, limit int, prev []string) string {
|
||||
if limit <= 0 {
|
||||
return ""
|
||||
}
|
||||
if len(prev) > maxPrevIDs {
|
||||
prev = prev[len(prev)-maxPrevIDs:]
|
||||
}
|
||||
tok := pageToken{V: 1, Q: queryFingerprint(query), NS: namespace, Off: offset, Lim: limit, Prev: prev}
|
||||
b, err := json.Marshal(tok)
|
||||
if err != nil {
|
||||
return ""
|
||||
}
|
||||
return base64.RawURLEncoding.EncodeToString(b)
|
||||
}
|
||||
|
||||
// decodeContinuation 解析令牌。错误信息面向调用方(可据此修请求)。
|
||||
func decodeContinuation(raw string) (pageToken, error) {
|
||||
var tok pageToken
|
||||
b, err := base64.RawURLEncoding.DecodeString(raw)
|
||||
if err != nil {
|
||||
return tok, errors.New("continuation 不是合法 base64url 令牌")
|
||||
}
|
||||
if err := json.Unmarshal(b, &tok); err != nil {
|
||||
return tok, errors.New("continuation 内容不是合法 JSON")
|
||||
}
|
||||
if tok.V != 1 {
|
||||
return tok, errors.New("continuation 版本不支持:" + strconv.Itoa(tok.V))
|
||||
}
|
||||
if tok.Off < 0 || tok.Lim <= 0 {
|
||||
return tok, errors.New("continuation 字段非法(offset/limit)")
|
||||
}
|
||||
if tok.Off > maxContinuationOffset {
|
||||
return tok, errors.New("continuation offset 超出上限 " + strconv.Itoa(maxContinuationOffset))
|
||||
}
|
||||
return tok, nil
|
||||
}
|
||||
|
||||
// buildScope 组装本次召回的数据视图声明。
|
||||
func buildScope(namespace string, topK int, mode string, cacheHit, truncated bool, started time.Time) map[string]interface{} {
|
||||
snap := "t" + strconv.FormatInt(started.UnixMilli(), 10)
|
||||
if cacheHit {
|
||||
snap += "-cache" // 缓存命中:读的是 60s 内旧快照,不是本次实时扫描
|
||||
} else {
|
||||
snap += "-scan"
|
||||
}
|
||||
if truncated {
|
||||
snap += "-truncated"
|
||||
}
|
||||
return map[string]interface{}{
|
||||
"namespace": namespace,
|
||||
"snapshot": snap,
|
||||
"cache_hit": cacheHit,
|
||||
"truncated": truncated,
|
||||
"top_k": topK,
|
||||
"mode": mode,
|
||||
}
|
||||
}
|
||||
|
||||
// traceItems 把最终返回集映射成 trace 的 item 归因(rank 从 1 起)。
|
||||
func traceItems(results []models.RecallResult) []storage.TraceItem {
|
||||
items := make([]storage.TraceItem, 0, len(results))
|
||||
for i, r := range results {
|
||||
ch := r.Channel
|
||||
if ch == "" {
|
||||
ch = "vector" // 老调用方/旧缓存条目无 channel ⇒ 主通道默认值
|
||||
}
|
||||
items = append(items, storage.TraceItem{Rank: i + 1, ID: r.ID, Channel: ch, Score: r.Score})
|
||||
}
|
||||
return items
|
||||
}
|
||||
@@ -0,0 +1,116 @@
|
||||
package routes
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"testing"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
)
|
||||
|
||||
func TestContinuationRoundTrip(t *testing.T) {
|
||||
tok := encodeContinuation("织忆怎么召回", "hermes-main", 10, 5, []string{"mem_1", "mem_2"})
|
||||
if tok == "" {
|
||||
t.Fatal("有下一页时令牌不应为空")
|
||||
}
|
||||
got, err := decodeContinuation(tok)
|
||||
if err != nil {
|
||||
t.Fatalf("解码失败:%v", err)
|
||||
}
|
||||
if got.Off != 10 || got.Lim != 5 {
|
||||
t.Fatalf("令牌字段错误:%+v", got)
|
||||
}
|
||||
if got.Q != queryFingerprint("织忆怎么召回") {
|
||||
t.Fatalf("query 指纹不一致")
|
||||
}
|
||||
if got.NS != "hermes-main" {
|
||||
t.Fatalf("namespace 不一致:%s", got.NS)
|
||||
}
|
||||
if len(got.Prev) != 2 || got.Prev[0] != "mem_1" {
|
||||
t.Fatalf("去重锚点未随令牌传递:%v", got.Prev)
|
||||
}
|
||||
}
|
||||
|
||||
func TestContinuationRejectsBadToken(t *testing.T) {
|
||||
if _, err := decodeContinuation("not-base64!!"); err == nil {
|
||||
t.Fatal("非法 base64 应报错")
|
||||
}
|
||||
if _, err := decodeContinuation("eyJ2Ijo5fQ"); err == nil { // {"v":9}
|
||||
t.Fatal("未知版本应报错")
|
||||
}
|
||||
tok := encodeContinuation("q", "ns", 9999, 5, nil)
|
||||
if _, err := decodeContinuation(tok); err == nil {
|
||||
t.Fatal("offset 超上限应报错")
|
||||
}
|
||||
}
|
||||
|
||||
func TestQueryFingerprintStable(t *testing.T) {
|
||||
a := queryFingerprint("同样的问句")
|
||||
b := queryFingerprint("同样的问句")
|
||||
c := queryFingerprint("不同的问句")
|
||||
if a != b {
|
||||
t.Fatal("同 query 指纹应稳定")
|
||||
}
|
||||
if a == c {
|
||||
t.Fatal("不同 query 指纹应不同")
|
||||
}
|
||||
if len(a) != 8 {
|
||||
t.Fatalf("指纹应为 8 hex,实际 %d", len(a))
|
||||
}
|
||||
}
|
||||
|
||||
func TestBuildScope(t *testing.T) {
|
||||
started := time.UnixMilli(1700000000000)
|
||||
sc := buildScope("hermes-main", 5, "hybrid", false, false, started)
|
||||
for _, k := range []string{"namespace", "snapshot", "cache_hit", "truncated", "top_k", "mode"} {
|
||||
if _, ok := sc[k]; !ok {
|
||||
t.Fatalf("scope 缺字段 %s", k)
|
||||
}
|
||||
}
|
||||
snap := sc["snapshot"].(string)
|
||||
if snap != "t1700000000000-scan" {
|
||||
t.Fatalf("实时扫描 snapshot 形态错误:%s", snap)
|
||||
}
|
||||
cached := buildScope("ns", 5, "hybrid", true, true, started)["snapshot"].(string)
|
||||
if cached != "t1700000000000-cache-truncated" {
|
||||
t.Fatalf("缓存+截断 snapshot 形态错误:%s", cached)
|
||||
}
|
||||
}
|
||||
|
||||
func TestTraceItems(t *testing.T) {
|
||||
rs := []models.RecallResult{
|
||||
{ID: "a", Channel: "vector"},
|
||||
{ID: "b"}, // 老调用方无 channel ⇒ 默认 vector
|
||||
{ID: "c", Channel: "graph"},
|
||||
}
|
||||
items := traceItems(rs)
|
||||
if len(items) != 3 || items[0].Rank != 1 || items[2].Rank != 3 {
|
||||
t.Fatalf("rank 编号错误:%+v", items)
|
||||
}
|
||||
if items[1].Channel != "vector" {
|
||||
t.Fatalf("缺省 channel 应回落 vector,实际 %s", items[1].Channel)
|
||||
}
|
||||
}
|
||||
|
||||
// TestRecallResultContractFields 契约字段必须真的出现在 JSON 里(不是「加了结构体没接线」)。
|
||||
func TestRecallResultContractFields(t *testing.T) {
|
||||
r := models.RecallResult{
|
||||
ID: "mem_1", Channel: "fts", Stale: true, Version: 3,
|
||||
ValidFrom: "2026-10-26T10:00:00+08:00", ValidTo: "2026-10-26T11:00:00+08:00",
|
||||
Supersedes: []string{"mem_0"}, SupersededBy: []string{"mem_2"}, Superseded: true,
|
||||
}
|
||||
b, err := json.Marshal(r)
|
||||
if err != nil {
|
||||
t.Fatalf("marshal: %v", err)
|
||||
}
|
||||
var m map[string]interface{}
|
||||
if err := json.Unmarshal(b, &m); err != nil {
|
||||
t.Fatalf("unmarshal: %v", err)
|
||||
}
|
||||
for _, k := range []string{"channel", "stale", "generation", "valid_from", "valid_to",
|
||||
"supersedes", "superseded_by", "superseded"} {
|
||||
if _, ok := m[k]; !ok {
|
||||
t.Fatalf("响应缺字段 %s(JSON=%s)", k, string(b))
|
||||
}
|
||||
}
|
||||
}
|
||||
+720
-75
@@ -2,17 +2,22 @@
|
||||
package routes
|
||||
|
||||
import (
|
||||
"context"
|
||||
"encoding/json"
|
||||
"fmt"
|
||||
"log"
|
||||
"math"
|
||||
"net/http"
|
||||
"os"
|
||||
"sort"
|
||||
"strconv"
|
||||
"strings"
|
||||
"time"
|
||||
"unicode"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/distill"
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/metanote"
|
||||
"github.com/xiaoxue/memoryweave/internal/metrics"
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/selfoptimize"
|
||||
@@ -98,6 +103,20 @@ func (a *API) Commit(w http.ResponseWriter, r *http.Request) {
|
||||
respondError(w, 400, "agent_id and content required")
|
||||
return
|
||||
}
|
||||
// 2026-10-16 t_5ad3f843:meta-note 门禁(env ZHIYI_META_FILTER=1 启用;默认关闭=零行为变化)。
|
||||
// 判定与 Python 口径真相源同源(internal/metanote,parity/差分测试锁死);
|
||||
// 判 meta ⇒ 422 拒绝,不写 episode、不进蒸馏(卡面:把 meta 挡在咽喉点)。
|
||||
if skip, reason := metanote.ShouldSkip(req.Content); skip {
|
||||
// t_10757bd5 AC5:metanote 拒绝 ⇒ 计数器 +1(与日志 "[metanote] commit rejected" 行对齐)
|
||||
metrics.MetaNoteRejectTotal.Inc()
|
||||
log.Printf("[metanote] commit rejected (gate ON, meta-note): agent=%s ns=%s reason=%s content=%.60s",
|
||||
req.AgentID, req.Namespace, reason, req.Content)
|
||||
respondError(w, 422, "meta-note rejected: "+reason)
|
||||
return
|
||||
}
|
||||
// 影子档(ZHIYI_META_FILTER=shadow):命中只记「would-reject」,照常放行。
|
||||
// 默认 off ⇒ 立即返回,零开销、零行为变化。
|
||||
metanote.ObserveShadow(req.Content)
|
||||
if req.Namespace == "" {
|
||||
req.Namespace = classifyNamespace(req.Category, req.AgentID, req.Content)
|
||||
}
|
||||
@@ -155,6 +174,14 @@ func (a *API) Commit(w http.ResponseWriter, r *http.Request) {
|
||||
return
|
||||
}
|
||||
|
||||
// ⑤使用追踪(t_5aa4dcac):commit 写侧检测——新写入的内容是否携带了
|
||||
// 最近被召回记忆的独特 token;命中 ⇒ 判定「被用上」(downstream_use)并累加
|
||||
// recall_verified_count(env 门控 ZHIYI_USAGE_TRACK,默认关 ⇒ 零行为变化)。
|
||||
// 异步执行:不阻塞 commit 主路径、不改响应、不拒写入。
|
||||
if storage.UsageTrackingEnabled() {
|
||||
go storage.CheckCommittedForUse(a.LanceDB, req.AgentID, req.Namespace, req.Content)
|
||||
}
|
||||
|
||||
// 2. 编码
|
||||
vector, err := a.Embedder.EncodeSingle(req.Content)
|
||||
if err != nil {
|
||||
@@ -260,6 +287,184 @@ func (a *API) Commit(w http.ResponseWriter, r *http.Request) {
|
||||
respond(w, 201, respData)
|
||||
}
|
||||
|
||||
// POST /api/v1/memory/write — 显式写入 memories 表(主症A,t_fa6c9104,2026-10-16)
|
||||
//
|
||||
// 背景:/api/v1/commit 把原文落 episodes 表、等异步 LLM 蒸馏(质量门丢弃率 ~68%)。
|
||||
// 「显式保存重要事实」场景(Hermes 插件 memory_write)走 commit ⇒ 写进去的东西
|
||||
// 自己召回不回来:episodes 表(recall 查 memories 表)+ 零向量 + 靠蒸馏流水线
|
||||
// 升级成 mem_*(大概率静默丢失)。
|
||||
//
|
||||
// 本端点:同步嵌入 → 去重/合并 → 矛盾只报告不拦 → 直写 memories 表 ⇒ 写完立刻可召回。
|
||||
// 硬约束遵守:
|
||||
// - 纯新增路由:commit / recall / 蒸馏 路径零改动(默认零行为变化)
|
||||
// - 嵌入失败 ⇒ 502 不写(写零向量 = 主症A 病根)
|
||||
// - category 缺省 distilled:不在 recall Step 2.5 rawCategories 过滤集里
|
||||
// - 不走写时四操作门控(ZHIYI_WRITE_SEMANTIC_OPS):显式写入 = 调用方意图,
|
||||
// 去重 3a/3b + 矛盾报告已足够;门控只约束 LLM 蒸馏事实
|
||||
func (a *API) WriteMemory(w http.ResponseWriter, r *http.Request) {
|
||||
if r.Method != http.MethodPost {
|
||||
respondError(w, 405, "POST only")
|
||||
return
|
||||
}
|
||||
var req struct {
|
||||
Content string `json:"content"`
|
||||
Category string `json:"category"`
|
||||
AgentID string `json:"agent_id"`
|
||||
Namespace string `json:"namespace"`
|
||||
Source string `json:"source"`
|
||||
EmbeddingModel string `json:"embedding_model"`
|
||||
ScriptVersion string `json:"script_version"`
|
||||
Confidence *float64 `json:"confidence"`
|
||||
// 2026-11-07 (t_88cc9cb8) 意图 TTL:可选到期时间(ISO8601/RFC3339)。不传 = 空 =
|
||||
// 永久有效(现状不变)。非法格式 ⇒ 400 拒写(写入侧严判,读侧宽容判不误伤)。
|
||||
// category=intention 时本列即意图生命周期;到期只降档不删除。
|
||||
ExpiresAt string `json:"expires_at"`
|
||||
}
|
||||
if err := json.NewDecoder(r.Body).Decode(&req); err != nil {
|
||||
respondError(w, 400, "invalid body")
|
||||
return
|
||||
}
|
||||
if len([]rune(req.Content)) < 8 {
|
||||
respondError(w, 400, "content too short (<8 chars)")
|
||||
return
|
||||
}
|
||||
// 2026-11-07 (t_88cc9cb8) 意图 TTL:expires_at 非空必须是合法 RFC3339(写入侧严判,
|
||||
// 空 = 永久有效 = 现状)。非法直接 400,不落一条永不降档的坏意图。
|
||||
if req.ExpiresAt != "" {
|
||||
if _, perr := time.Parse(time.RFC3339, req.ExpiresAt); perr != nil {
|
||||
respondError(w, 400, "invalid expires_at (want RFC3339/ISO8601): "+perr.Error())
|
||||
return
|
||||
}
|
||||
}
|
||||
// 2026-10-16 t_5ad3f843:meta-note 门禁(同 Commit;默认关闭=零行为变化)。
|
||||
if skip, reason := metanote.ShouldSkip(req.Content); skip {
|
||||
log.Printf("[metanote] write_memory rejected: agent=%s reason=%s content=%.60s", req.AgentID, reason, req.Content)
|
||||
respondError(w, 422, "meta-note rejected: "+reason)
|
||||
return
|
||||
}
|
||||
// 影子档(同 Commit):命中只记「would-reject」,照常放行;默认 off 零开销。
|
||||
metanote.ObserveShadow(req.Content)
|
||||
if req.AgentID == "" {
|
||||
req.AgentID = "hermes-a06"
|
||||
}
|
||||
if req.Category == "" {
|
||||
req.Category = "distilled"
|
||||
}
|
||||
if req.Namespace == "" {
|
||||
req.Namespace = classifyNamespace(req.Category, req.AgentID, req.Content)
|
||||
}
|
||||
src := req.Source
|
||||
if src == "" {
|
||||
src = "explicit_write"
|
||||
}
|
||||
embModel := req.EmbeddingModel
|
||||
if embModel == "" {
|
||||
embModel = "bge-m3"
|
||||
}
|
||||
scriptVer := req.ScriptVersion
|
||||
if scriptVer == "" {
|
||||
scriptVer = "hermes-zhiyi"
|
||||
}
|
||||
|
||||
// 1. 同步嵌入:失败 ⇒ 502,**不写零向量记录**(零向量 = 主症A 病根)
|
||||
vector, err := a.Embedder.EncodeSingle(req.Content)
|
||||
if err != nil {
|
||||
respondErrorSchema(w, 502, "embed_failed", "embed failed: "+err.Error(), 5)
|
||||
return
|
||||
}
|
||||
|
||||
// 2. 去重:exact/near-dup ⇒ 并入既有记忆(与 commit 3a/3b 同语义)
|
||||
similar, _ := a.LanceDB.Search("memories", vector, 5, req.Namespace)
|
||||
for _, existing := range similar {
|
||||
if existing.Content == req.Content {
|
||||
a.mergeMemory(existing, req.Content, req.Category, req.AgentID)
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"status": "merged", "memory_id": existing.ID, "reason": "exact_dup",
|
||||
"table": "memories",
|
||||
})
|
||||
return
|
||||
}
|
||||
if len(existing.Content) > 0 && len(req.Content) > 0 {
|
||||
ev, eErr := a.Embedder.EncodeSingle(existing.Content)
|
||||
if eErr == nil && cosineSimilarity(vector, ev) >= 0.98 {
|
||||
a.mergeMemory(existing, req.Content, req.Category, req.AgentID)
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"status": "merged", "memory_id": existing.ID, "reason": "near_dup",
|
||||
"table": "memories",
|
||||
})
|
||||
return
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// 3. 矛盾检测(规则型,廉价):**只报告不拦** —— 显式写入是调用方意图,
|
||||
// 旧新并存由写时四操作门控/人工 feedback 收口(与 commit 的 conflict 报告同形)
|
||||
var conflictSources []string
|
||||
for _, existing := range similar {
|
||||
if existing.Content != req.Content {
|
||||
conflictSources = append(conflictSources, existing.Content)
|
||||
}
|
||||
}
|
||||
conflicts := a.ConflictDetector.DetectContradiction(req.Content, conflictSources)
|
||||
|
||||
// 4. 直写 memories 表(跳过 LLM 蒸馏 + 质量门 ⇒ 无 68% 静默丢弃)
|
||||
now := time.Now()
|
||||
confidenceSource := ""
|
||||
if req.Confidence != nil {
|
||||
confidenceSource = "authoritative"
|
||||
}
|
||||
mem := models.MemoryRecord{
|
||||
ID: fmt.Sprintf("mem_%d", now.UnixNano()),
|
||||
AgentID: req.AgentID,
|
||||
Namespace: req.Namespace,
|
||||
Content: req.Content,
|
||||
Category: req.Category,
|
||||
Vector: vector,
|
||||
Tier: "normal",
|
||||
Importance: 1.0,
|
||||
QualityScore: 1.0, // 显式写入 = 可信来源(对照 LLM 蒸馏的 result.Overall)
|
||||
Source: src,
|
||||
Freshness: "fresh",
|
||||
Provenance: "user", // bi-temporal 来源枚举 user|inferred|import
|
||||
EmbeddingModel: embModel,
|
||||
ScriptVersion: scriptVer,
|
||||
Confidence: req.Confidence,
|
||||
ConfidenceSource: confidenceSource,
|
||||
// 2026-11-07 (t_88cc9cb8) 意图 TTL:已通过 400 校验的到期时间(空 = 永久 = 现状)。
|
||||
ExpiresAt: req.ExpiresAt,
|
||||
CreatedAt: now,
|
||||
UpdatedAt: now,
|
||||
}
|
||||
if err := a.LanceDB.InsertMemory(mem); err != nil {
|
||||
respondError(w, 500, "insert memory: "+err.Error())
|
||||
return
|
||||
}
|
||||
|
||||
// 5. 搜索缓存失效(与蒸馏落库同一原则:写 memories ⇒ 该 namespace 缓存作废)
|
||||
if storage.SearchCacheInstance != nil && mem.Namespace != "" {
|
||||
storage.SearchCacheInstance.Invalidate(mem.Namespace)
|
||||
}
|
||||
// 跨 Agent 广播(镜像 commit 写后 goroutine;显式写入同样通知其它 agent)
|
||||
go func() {
|
||||
governance.PushCacheInvalidate(req.Namespace, "memory_write")
|
||||
governance.PushMemoryCommitted(req.AgentID, req.Namespace, mem.ID)
|
||||
}()
|
||||
|
||||
respData := map[string]interface{}{
|
||||
"status": "ok",
|
||||
"memory_id": mem.ID,
|
||||
"table": "memories",
|
||||
"category": mem.Category,
|
||||
"namespace": mem.Namespace,
|
||||
"note": "direct write: embedded + recallable immediately (no distill queue)",
|
||||
}
|
||||
if len(conflicts) > 0 {
|
||||
respData["conflicts"] = conflicts
|
||||
respData["warning"] = "contradictory memories exist; explicit write kept both (resolve via feedback)"
|
||||
}
|
||||
respond(w, 201, respData)
|
||||
}
|
||||
|
||||
// mergeMemory 合并重复记忆:升版本、提重要性、更新时间戳
|
||||
func (a *API) mergeMemory(existing models.MemoryRecord, newContent, newCategory, agentID string) {
|
||||
existing.Version++
|
||||
@@ -318,13 +523,15 @@ func cosineSimilarity(a, b []float32) float64 {
|
||||
// 用途:区分「真无匹配」(results=[] 但候选数>0)与「依赖故障」(非 2xx)。
|
||||
func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
var req struct {
|
||||
Query string `json:"query"`
|
||||
Limit int `json:"limit"`
|
||||
TopK int `json:"top_k"` // 兼容插件 top_k 参数
|
||||
Namespace string `json:"namespace"`
|
||||
AgentID string `json:"agent_id"` // 用于推导默认 namespace
|
||||
Diversity float64 `json:"diversity"`
|
||||
Mode string `json:"mode"` // "hybrid"(default), "semantic", "keyword"
|
||||
Query string `json:"query"`
|
||||
Limit int `json:"limit"`
|
||||
TopK int `json:"top_k"` // 兼容插件 top_k 参数
|
||||
Namespace string `json:"namespace"`
|
||||
AgentID string `json:"agent_id"` // 用于推导默认 namespace
|
||||
Diversity float64 `json:"diversity"`
|
||||
Mode string `json:"mode"` // "hybrid"(default), "semantic", "keyword"
|
||||
DeadlineMS int `json:"deadline_ms"` // P0-3:本次召回的硬超时(毫秒),超时返回 partial
|
||||
Continuation string `json:"continuation"` // P0-3:上一页返回的不透明翻页令牌
|
||||
}
|
||||
if err := json.NewDecoder(r.Body).Decode(&req); err != nil {
|
||||
respondError(w, 400, "invalid body")
|
||||
@@ -346,6 +553,7 @@ func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
"candidates_scanned": 0,
|
||||
"mode": req.Mode,
|
||||
"skipped": "system_template",
|
||||
"skill_refs": []SkillSectionRef{}, // 契约:键恒存在(AC-2.1)
|
||||
})
|
||||
return
|
||||
}
|
||||
@@ -357,11 +565,53 @@ func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
req.Limit = 10
|
||||
}
|
||||
// 2026-09-21 五修(t_24eceed0 返修):无 ns 且无 agent_id → namespace="" → 全库跨 ns 召回
|
||||
// 2026-10-26:区分「作用域来源」——只有 agent_id 派生的 ns 才允许兜底,
|
||||
// 显式传 namespace 的调用方不兜底(避免跨域泄漏)。
|
||||
nsDerivedFromAgent := req.Namespace == "" && req.AgentID != ""
|
||||
req.Namespace = resolveRecallNamespace(req.Namespace, req.AgentID, req.Query)
|
||||
|
||||
// ── P0-3 契约 + P0-1 追踪(2026-10-26)──────────────────────────────
|
||||
// 翻页令牌:绑定 query 指纹 + 作用域,跨 query 复用一律 400(防串页)。
|
||||
offset := 0
|
||||
var prevIDs []string
|
||||
if req.Continuation != "" {
|
||||
pt, perr := decodeContinuation(req.Continuation)
|
||||
if perr != nil {
|
||||
respondErrorSchema(w, 400, "bad_continuation", perr.Error(), 0)
|
||||
return
|
||||
}
|
||||
if pt.Q != queryFingerprint(req.Query) {
|
||||
respondErrorSchema(w, 400, "continuation_query_mismatch",
|
||||
"continuation 属于另一个 query,不能跨 query 复用", 0)
|
||||
return
|
||||
}
|
||||
if pt.NS != req.Namespace {
|
||||
respondErrorSchema(w, 400, "continuation_namespace_mismatch",
|
||||
"continuation 的 namespace 与本次请求不一致", 0)
|
||||
return
|
||||
}
|
||||
offset = pt.Off
|
||||
prevIDs = pt.Prev
|
||||
}
|
||||
// 取数上限 = 页尾(offset+limit);MMR 的 k 随之上抬,保证前缀稳定。
|
||||
// 多取 len(prevIDs):用于过滤跨页重复项,过滤后仍能凑满一页(否则「不重」要靠「漏」换)。
|
||||
fetchLimit := req.Limit + offset + len(prevIDs)
|
||||
if fetchLimit > maxContinuationOffset+req.Limit {
|
||||
fetchLimit = maxContinuationOffset + req.Limit
|
||||
}
|
||||
|
||||
ctx := r.Context()
|
||||
if req.DeadlineMS > 0 {
|
||||
var cancel context.CancelFunc
|
||||
ctx, cancel = context.WithTimeout(ctx, time.Duration(req.DeadlineMS)*time.Millisecond)
|
||||
defer cancel()
|
||||
}
|
||||
|
||||
// H4: Default diversity — balance relevance & diversity
|
||||
// 2026-10-14:改读 storage 的推送值(默认 0.3,与下方原硬编码一致 ⇒ 行为不变),
|
||||
// 让调参器能真正影响召回 —— 此前调参改了 Tuner.Diversity 但没人读(空转)。
|
||||
if req.Diversity <= 0 {
|
||||
req.Diversity = 0.3
|
||||
req.Diversity = storage.DefaultMMRDiversity()
|
||||
}
|
||||
|
||||
var results []models.RecallResult
|
||||
@@ -374,71 +624,78 @@ func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
// (LanceDB ANN 返回 + 去重 + 原始对话过滤之后、rerank/MMR 截断之前捕获)。
|
||||
// 此前误用 len(results)(最终产出数)作代理值——字段名说 "scanned"(扫描候选池)
|
||||
// 值却是"产出数",属"用文档补假名"。现改为 RecallWithMeta 返回的候选池真实大小。
|
||||
// keyword 路径未做 ANN 扫描 ⇒ 恒 0;graph 兜底路径 = 兜底返回数。
|
||||
// keyword 主路径未做 ANN 扫描 ⇒ 恒 0;graph 兜底路径 = 兜底返回数。
|
||||
annScanned := 0
|
||||
// t_3aa2a8c1:粗检索被 Rust 侧单次重读行数上限截断的标志(来源 RecallMeta.Truncated)。
|
||||
// graph 兜底 / keyword 空匹配兜底结果不经 IPC 粗检索 ⇒ 恒 false。
|
||||
truncated := false
|
||||
|
||||
// H5: Mode routing — hybrid / semantic / keyword
|
||||
if req.Mode == "" {
|
||||
req.Mode = "hybrid"
|
||||
}
|
||||
// P0-1:trace 在 mode 归一之后创建(记录真实 mode);所有路径共用同一条 trace。
|
||||
tr := storage.NewRecallTrace("", req.Query, req.Namespace, req.Mode)
|
||||
var lastMeta storage.RecallMeta
|
||||
switch req.Mode {
|
||||
case "keyword":
|
||||
// Pure keyword search: LanceDB + BM25 re-rank, or graph.db fallback
|
||||
// t_2d4e3b92: keyword 主路径依赖向量编码;编码失败(依赖不可用)⇒ 非 2xx,
|
||||
// 不再把错误伪装成 200 + 错误体。
|
||||
// t_1c12e000:keyword 路径同样收进 RecallWithMeta(Pipeline.Recall 内部
|
||||
// 走同一缓存键),只为把 cache_hit 带回响应——旧版用 Recall 丢掉了 meta。
|
||||
var kwMeta storage.RecallMeta
|
||||
kwResults, kwMeta, kwErr := a.Pipeline.RecallWithMeta(req.Query, req.Namespace, req.Limit, req.Diversity)
|
||||
// t_2d4e3b92: keyword 主路径依赖向量编码;编码失败(依赖不可用)⇒ 非 2xx。
|
||||
stKw := time.Now()
|
||||
kwResults, kwMeta, kwErr := a.Pipeline.RecallWithMetaTraced(ctx, req.Query, req.Namespace, fetchLimit, req.Diversity, nsDerivedFromAgent, tr)
|
||||
if kwErr != nil {
|
||||
// 主路径硬错误(向量编码/rerank 依赖不可用):即便兜底能补结果,也按 502 上报,
|
||||
// 调用方据此走失败路径而不是把依赖故障误判成"无匹配"
|
||||
tr.StageNote("keyword_path", stKw, 0, kwErr.Error())
|
||||
tr.Error = kwErr.Error()
|
||||
respondErrorSchema(w, 502, "recall_backend_error",
|
||||
"keyword recall failed: "+kwErr.Error(), 5)
|
||||
log.Printf("[recall:keyword] failed: %v", kwErr)
|
||||
return
|
||||
}
|
||||
lastMeta = kwMeta
|
||||
cacheHit = kwMeta.CacheHit
|
||||
truncated = kwMeta.Truncated
|
||||
if len(kwResults) == 0 {
|
||||
// 真无匹配(正常业务):成功 schema,results=[] + candidates_scanned 供区分
|
||||
fallbackResults := a.GraphStore.FallbackTextSearch(req.Query, req.Namespace, req.Limit)
|
||||
results = convertFallbackResults(fallbackResults)
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"results": results,
|
||||
"count": len(results),
|
||||
"candidates_scanned": 0, // keyword 路径未做 ANN 扫描
|
||||
"mode": "keyword",
|
||||
"cache_hit": false, // graph 兜底结果不来自 search cache
|
||||
})
|
||||
return
|
||||
// 真无匹配(正常业务)或纯词面路径空:graph.db 兜底
|
||||
results = convertFallbackResults(a.GraphStore.FallbackTextSearch(req.Query, req.Namespace, fetchLimit))
|
||||
if len(results) > 0 {
|
||||
tr.StageNote("keyword_fallback", stKw, len(results), "主路径 0 命中 ⇒ graph.db 兜底")
|
||||
} else {
|
||||
tr.Stage("keyword_path", stKw, 0)
|
||||
}
|
||||
cacheHit = false // 兜底结果不来自 search cache
|
||||
} else {
|
||||
// Re-rank by BM25 only
|
||||
for i := range kwResults {
|
||||
kwResults[i].Score = storage.ComputeBM25Score(req.Query, kwResults[i].Content)
|
||||
}
|
||||
sort.Slice(kwResults, func(i, j int) bool { return kwResults[i].Score > kwResults[j].Score })
|
||||
if len(kwResults) > fetchLimit {
|
||||
kwResults = kwResults[:fetchLimit]
|
||||
}
|
||||
for i := range kwResults {
|
||||
if kwResults[i].Channel == "" {
|
||||
kwResults[i].Channel = "keyword"
|
||||
}
|
||||
}
|
||||
results = kwResults
|
||||
tr.Stage("keyword_path", stKw, len(results))
|
||||
}
|
||||
// Re-rank by BM25 only
|
||||
for i := range kwResults {
|
||||
kwResults[i].Score = storage.ComputeBM25Score(req.Query, kwResults[i].Content)
|
||||
}
|
||||
sort.Slice(kwResults, func(i, j int) bool { return kwResults[i].Score > kwResults[j].Score })
|
||||
if len(kwResults) > req.Limit {
|
||||
kwResults = kwResults[:req.Limit]
|
||||
}
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"results": kwResults, "count": len(kwResults), "mode": "keyword",
|
||||
"candidates_scanned": 0,
|
||||
"cache_hit": cacheHit, // t_1c12e000:keyword 主路径命中 search cache 时显式标注
|
||||
})
|
||||
return
|
||||
case "semantic":
|
||||
// Pure semantic — BM25 off (H1 skipped, Pipeline Recall has BM25 built in — handled by switch)
|
||||
// t_949840b1:RecallWithMeta 额外返回候选池真实大小(ANN 粗检索池,非最终产出数)
|
||||
// Pure semantic — BM25 off(Pipeline 内部按 mode 处理)
|
||||
var meta storage.RecallMeta
|
||||
results, meta, err = a.Pipeline.RecallWithMeta(req.Query, req.Namespace, req.Limit, req.Diversity)
|
||||
results, meta, err = a.Pipeline.RecallWithMetaTraced(ctx, req.Query, req.Namespace, fetchLimit, req.Diversity, nsDerivedFromAgent, tr)
|
||||
lastMeta = meta
|
||||
annScanned = meta.CandidatesScanned
|
||||
cacheHit = meta.CacheHit // t_1c12e000
|
||||
cacheHit = meta.CacheHit
|
||||
truncated = meta.Truncated
|
||||
case "hybrid":
|
||||
// BM25 + vector combined (H1: BM25 scoring inside Pipeline.Recall)
|
||||
var meta storage.RecallMeta
|
||||
results, meta, err = a.Pipeline.RecallWithMeta(req.Query, req.Namespace, req.Limit, req.Diversity)
|
||||
results, meta, err = a.Pipeline.RecallWithMetaTraced(ctx, req.Query, req.Namespace, fetchLimit, req.Diversity, nsDerivedFromAgent, tr)
|
||||
lastMeta = meta
|
||||
annScanned = meta.CandidatesScanned
|
||||
cacheHit = meta.CacheHit // t_1c12e000
|
||||
cacheHit = meta.CacheHit
|
||||
truncated = meta.Truncated
|
||||
}
|
||||
if err != nil {
|
||||
// P0: 降级到 graph.db 关键词搜索(仅 hybrid/semantic 主路径依赖向量/rerank)
|
||||
@@ -446,10 +703,13 @@ func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
if len(fallbackResults) > 0 {
|
||||
results = convertFallbackResults(fallbackResults)
|
||||
annScanned = len(fallbackResults)
|
||||
cacheHit = false // t_1c12e000:graph 兜底结果不来自 search cache
|
||||
cacheHit = false // t_1c12e000:graph 兜底结果不来自 search cache
|
||||
truncated = false // t_3aa2a8c1:graph.db 兜底结果不经 IPC 粗检索 ⇒ 无截断可言
|
||||
w.Header().Set("X-Fallback", "graph")
|
||||
} else {
|
||||
// t_2d4e3b92: 主路径与兜底都失败 ⇒ 非 2xx + 统一错误体(绝不在 200 里塞错误)
|
||||
tr.MarkPartial("stage_error")
|
||||
tr.Error = err.Error()
|
||||
respondErrorSchema(w, 502, "recall_backend_error",
|
||||
"recall failed: "+err.Error()+"; graph fallback also empty", 5)
|
||||
log.Printf("[recall] failed: %v; fallback empty", err)
|
||||
@@ -462,10 +722,23 @@ func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
}
|
||||
|
||||
// E4.2: 跨 agent 知识共享 — recall 结果在 (0, top_k) 时,补充搜索 "shared" namespace
|
||||
if len(results) > 0 && len(results) < 3 && req.Namespace != "shared" && req.Namespace != "" {
|
||||
// t_a243aefa 终审补漏(2026-11-07 部署后实测):ghost ns(全表无该 ns 行)时**不得**补搜 shared。
|
||||
// t_15d82af7 已给 coarse search 的 namespaces 列表和 FTS 尾通道加了同口径判据,唯独漏了本处 ⇒
|
||||
// 传不存在的 ns 仍会经 E4.2 捞出 shared 记忆(实测泄漏 mem_1793118290141936234, channel=shared, score=0.5)。
|
||||
// 现与另两处对齐:nsHasRows=false ⇒ 不补搜。判据函数与 recall.go 同一个(带 60s TTL 缓存)。
|
||||
if len(results) > 0 && len(results) < 3 && req.Namespace != "shared" && req.Namespace != "" &&
|
||||
storage.NamespaceHasRowsFor(a.LanceDB, req.Namespace) {
|
||||
vec, encErr := a.Embedder.EncodeQuery(req.Query)
|
||||
if encErr == nil {
|
||||
shared, _ := a.LanceDB.Search("memories", vec, 5, "shared")
|
||||
var shared []models.MemoryRecord
|
||||
// t_3aa2a8c1:补充搜同属粗检索 ⇒ 截断也计入本次 recall 的 truncated
|
||||
if rep, ok := a.LanceDB.(storage.SearchTruncationReporter); ok {
|
||||
var tSup bool
|
||||
shared, tSup, _ = rep.SearchWithTruncation("memories", vec, 5, "shared")
|
||||
truncated = truncated || tSup
|
||||
} else {
|
||||
shared, _ = a.LanceDB.Search("memories", vec, 5, "shared")
|
||||
}
|
||||
for _, m := range shared {
|
||||
// 去重:跳过已在 own namespace 结果中的记忆
|
||||
alreadyHave := false
|
||||
@@ -483,12 +756,20 @@ func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
vv = storage.VValueProvider(m.ID)
|
||||
}
|
||||
results = append(results, models.RecallResult{
|
||||
ID: m.ID,
|
||||
Content: m.Content,
|
||||
Category: m.Category,
|
||||
Score: 0.5, // shared 结果降权,使用默认分
|
||||
QualityScore: m.QualityScore,
|
||||
VValue: vv,
|
||||
ID: m.ID,
|
||||
Content: m.Content,
|
||||
Category: m.Category,
|
||||
Score: 0.5, // shared 结果降权,使用默认分
|
||||
QualityScore: m.QualityScore,
|
||||
VValue: vv,
|
||||
HumanUsefulCount: m.HumanUsefulCount, // A10 (t_d618dc7c)
|
||||
Channel: "shared", // P0-1:来源通道
|
||||
Version: m.Version,
|
||||
ValidFrom: m.ValidFrom,
|
||||
ValidTo: m.ValidTo,
|
||||
Supersedes: m.Supersedes,
|
||||
SupersededBy: m.SupersededBy,
|
||||
Superseded: len(m.SupersededBy) > 0,
|
||||
})
|
||||
}
|
||||
}
|
||||
@@ -499,10 +780,22 @@ func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
// wiki_curator 把「笔记→知识」写进 wiki-curator-main,而主召回只搜
|
||||
// req.Namespace/shared ⇒ 33+ 条笔记知识长期在盲区(召回永远看不到)。
|
||||
// 这里补搜:主结果不足 top_k 时,从额外命名空间补齐(去重 + 降权 0.45)。
|
||||
if req.Namespace != "wiki-curator-main" && req.Namespace != "" {
|
||||
// t_15d82af7:显式 ns 在全量表里无行(ghost)⇒ 不补 wiki(ghost 查询不得被
|
||||
// 洗成 wiki-curator-main 结果)。判据与主路径/生产客户端过滤同源:ScanAll
|
||||
// 全量行;探测失败/后端不支持 ⇒ 保守当存在(不跳,旧行为)。
|
||||
nsAbsent := req.Namespace != "" && !storage.NamespaceHasRowsFor(a.LanceDB, req.Namespace)
|
||||
if req.Namespace != "wiki-curator-main" && req.Namespace != "" && !nsAbsent {
|
||||
if vec, encErr := a.Embedder.EncodeQuery(req.Query); encErr == nil {
|
||||
for _, extra := range []string{"wiki-curator-main"} {
|
||||
extraHits, _ := a.LanceDB.Search("memories", vec, 5, extra)
|
||||
var extraHits []models.MemoryRecord
|
||||
// t_3aa2a8c1:补充搜同属粗检索 ⇒ 截断也计入本次 recall 的 truncated
|
||||
if rep, ok := a.LanceDB.(storage.SearchTruncationReporter); ok {
|
||||
var tSup bool
|
||||
extraHits, tSup, _ = rep.SearchWithTruncation("memories", vec, 5, extra)
|
||||
truncated = truncated || tSup
|
||||
} else {
|
||||
extraHits, _ = a.LanceDB.Search("memories", vec, 5, extra)
|
||||
}
|
||||
for _, m := range extraHits {
|
||||
dup := false
|
||||
for _, r := range results {
|
||||
@@ -518,12 +811,20 @@ func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
vv = storage.VValueProvider(m.ID)
|
||||
}
|
||||
results = append(results, models.RecallResult{
|
||||
ID: m.ID,
|
||||
Content: m.Content,
|
||||
Category: m.Category,
|
||||
Score: 0.45, // 笔记知识降权:不挤掉主记忆,但能被看到
|
||||
QualityScore: m.QualityScore,
|
||||
VValue: vv,
|
||||
ID: m.ID,
|
||||
Content: m.Content,
|
||||
Category: m.Category,
|
||||
Score: 0.45, // 笔记知识降权:不挤掉主记忆,但能被看到
|
||||
QualityScore: m.QualityScore,
|
||||
VValue: vv,
|
||||
HumanUsefulCount: m.HumanUsefulCount, // A10 (t_d618dc7c)
|
||||
Channel: "wiki", // P0-1:来源通道
|
||||
Version: m.Version,
|
||||
ValidFrom: m.ValidFrom,
|
||||
ValidTo: m.ValidTo,
|
||||
Supersedes: m.Supersedes,
|
||||
SupersededBy: m.SupersededBy,
|
||||
Superseded: len(m.SupersededBy) > 0,
|
||||
})
|
||||
}
|
||||
}
|
||||
@@ -531,6 +832,50 @@ func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
}
|
||||
}
|
||||
|
||||
// ── 2026-10-14 (t_2515307a) 确定性判据强化:召回后规则过滤/降权 ──
|
||||
// env 门控 ZHIYI_RULE_FIRST,默认关 ⇒ 零行为变化(跳过本块)。
|
||||
// =1 时:对每条结果用 distill.RecallRuleVerdict 判确定性可用性——
|
||||
// RecallDrop → 过滤(不进 top-N);RecallDemote → 降权(排到 keep 之后)。
|
||||
// 只改读侧返回集,不碰 state.db、不碰 LanceDB 数据。
|
||||
ruleFilteredCount := 0
|
||||
ruleDemotedCount := 0
|
||||
if os.Getenv("ZHIYI_RULE_FIRST") == "1" && len(results) > 0 {
|
||||
kept, demoted, dropped, _ := distill.FilterRecallByRule(results,
|
||||
func(r models.RecallResult) string { return r.Content })
|
||||
ordered := make([]models.RecallResult, 0, len(kept)+len(demoted))
|
||||
ordered = append(ordered, kept...)
|
||||
ordered = append(ordered, demoted...)
|
||||
ruleFilteredCount = len(dropped)
|
||||
ruleDemotedCount = len(demoted)
|
||||
if ruleFilteredCount+ruleDemotedCount > 0 {
|
||||
log.Printf("[rule-first] query=%q 过滤 %d / 降权 %d / 保留 %d", req.Query,
|
||||
len(dropped), len(demoted), len(kept))
|
||||
}
|
||||
results = ordered
|
||||
}
|
||||
|
||||
// ── 2026-10-26(P1-3 生命周期 fixture 抓到的真 bug)──────────────────
|
||||
// 主候选池在 pipeline 里已做 bi-temporal 过滤,但 **shared / wiki 补充通道与图谱注入
|
||||
// 不过那道闸** ⇒ 已失效事实会从补充通道回流进 top-k(实测:valid_to=11:00 的记录
|
||||
// 被 shared 通道以 score=0.5 重新塞回)。这里在「所有注入完成之后、cap 之前」统一过滤,
|
||||
// 保证读侧只有一条有效期口径。全失效时保留原结果(不把召回清空,non-lossy)。
|
||||
if storage.BitemporalEnabled() {
|
||||
now := time.Now()
|
||||
live := make([]models.RecallResult, 0, len(results))
|
||||
expired := 0
|
||||
for _, r := range results {
|
||||
if storage.ValidityExpired(r.ValidTo, now) {
|
||||
expired++
|
||||
continue
|
||||
}
|
||||
live = append(live, r)
|
||||
}
|
||||
if len(live) > 0 && expired > 0 {
|
||||
log.Printf("[recall] 补充通道 bi-temporal 过滤 %d 条失效事实(统一读侧口径)", expired)
|
||||
results = live
|
||||
}
|
||||
}
|
||||
|
||||
// Record recall hit rate (has results = hit, empty = miss)
|
||||
selfoptimize.Dash.RecordRecall(len(results) > 0)
|
||||
// Gap auto-close: recall 命中后自动关闭该 query 对应的 open gap
|
||||
@@ -557,19 +902,121 @@ func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
// 非最终返回数——最终条数以 count 为准),
|
||||
// 使"真无匹配"(results=[] 但 candidates_scanned>0)与依赖故障(非 2xx)可区分。
|
||||
// 调用方契约:200 + results 键存在 = 成功(results 可为空);非 2xx = 失败,绝不解码为成功。
|
||||
// ⑤使用追踪(t_5aa4dcac):记录本次召回的 mem_* 记忆 + 独特 token(env 门控 ZHIYI_USAGE_TRACK,
|
||||
// 默认关 ⇒ 零行为变化)。供 commit 写侧检测「后续内容是否携带了这些记忆 → 判定被用上」。
|
||||
if storage.UsageTrackingEnabled() && len(results) > 0 {
|
||||
recs := make([]storage.RecalledMemory, 0, len(results))
|
||||
for _, r := range results {
|
||||
if r.ID == "" || r.Content == "" || strings.HasPrefix(r.ID, "ep_") {
|
||||
continue // 只追踪 mem_* 蒸馏记忆;ep_* 原始轮次不是「要判定用没用」的目标
|
||||
}
|
||||
recs = append(recs, storage.RecalledMemory{
|
||||
ID: r.ID, Content: r.Content, Namespace: r.Namespace,
|
||||
Agent: req.AgentID, Query: req.Query,
|
||||
})
|
||||
}
|
||||
storage.RecordRecalled(recs)
|
||||
}
|
||||
// ── 2026-10-26 (t_9025b0eb) top_k 收口:图谱扩展不得撑爆返回集 ──
|
||||
// 现象:/api/v1/recall 完全无视 top_k —— top_k=5 实测返回 1905/1625 条、top_k=10 返回
|
||||
// 2227/1859 条,其中 99% 是 category=graph_expanded(图谱扩展 append 无上限)。
|
||||
// 后果:插件记忆预取被撑到 103,299 chars 截断(真相关条目落在被截断段)、count 失真、
|
||||
// ⑤使用追踪按千级结果记账。
|
||||
// 契约修正(主结果优先):
|
||||
// results = 主检索结果(category != graph_expanded),截断到 req.Limit;
|
||||
// 主结果不足 req.Limit 时用扩展结果按原顺序补齐(稀疏查询仍有扩展收益)。
|
||||
// graph_expanded = 扩展结果**单独成字段**(上限 req.Limit)——能力仍可观测、可统计,
|
||||
// 但不再挤占主结果、不再污染 results/count。
|
||||
results, graphExpanded := capRecallResults(results, fetchLimit)
|
||||
if results == nil {
|
||||
results = []models.RecallResult{}
|
||||
}
|
||||
respond(w, 200, map[string]interface{}{
|
||||
|
||||
// ── P0-3 翻页:从 fetchLimit 结果里切出 [offset, offset+limit) ──
|
||||
// 说明:翻页重算整段前 offset+limit 条再切片,保证 MMR 前缀稳定;
|
||||
// 令牌绑定 query 指纹 + namespace,跨 query/跨域复用一律 400(防串页)。
|
||||
// ⚠ 2026-11-02 (t_58f9d476):切片必须对 pattern/peer carry 豁免——
|
||||
// capRecallResults 特意把 carry 恒保留追加在 prim 之后(回填保证主+扩展填满
|
||||
// limit ⇒ carry 恒落在索引 limit),本块裸 results[:limit] 把它恒切掉,
|
||||
// t_e98cb1d6 的 carry 修复在此被整体作废(ZHIYI_PEER_RECALL 结构性零产出,
|
||||
// dbg 插桩实证注入发生 4087→4088 但响应无 peer)。语义改走纯函数
|
||||
// paginateRecallWithCarry(可单测):carry 摘出→offset/去重/截断→回尾。
|
||||
totalFetched := len(results)
|
||||
results, mainLen := paginateRecallWithCarry(results, offset, prevIDs, req.Limit)
|
||||
nextCont := ""
|
||||
// ⚠ 2026-11-02 (t_2891d689):判据看主路段 mainLen,不看 len(results)——
|
||||
// carry 会把 results 撑过 limit,旧判据 len(results)==req.Limit 在有注入时
|
||||
// 恒假 ⇒ nextCont 恒空、翻页链断裂。收口到 shouldEmitContinuation(可单测)。
|
||||
if shouldEmitContinuation(totalFetched, fetchLimit, mainLen, req.Limit, offset) {
|
||||
returned := make([]string, 0, len(prevIDs)+len(results))
|
||||
returned = append(returned, prevIDs...)
|
||||
for _, r := range results {
|
||||
returned = append(returned, r.ID)
|
||||
}
|
||||
nextCont = encodeContinuation(req.Query, req.Namespace, offset+req.Limit, req.Limit, returned)
|
||||
}
|
||||
|
||||
// ── P0-1/P0-3:契约字段 + trace 落盘 ──
|
||||
tr.SetItems(traceItems(results))
|
||||
status := lastMeta.Status
|
||||
if status == "" {
|
||||
status = "complete"
|
||||
}
|
||||
partialReason := lastMeta.PartialReason
|
||||
if tr.Status == "partial" && status == "complete" {
|
||||
status = "partial"
|
||||
partialReason = tr.PartialReason
|
||||
}
|
||||
if truncated && status == "complete" {
|
||||
status = "partial"
|
||||
partialReason = "row_cap_truncated"
|
||||
}
|
||||
tr.Status = status
|
||||
tr.PartialReason = partialReason
|
||||
tr.CacheHit = cacheHit
|
||||
tr.Truncated = truncated
|
||||
tr.CandidatesScanned = annScanned
|
||||
tr.Namespace = req.Namespace
|
||||
tr.Mode = req.Mode
|
||||
tr.Scope = buildScope(req.Namespace, req.Limit, req.Mode, cacheHit, truncated, tr.StartedAt)
|
||||
if offset > 0 {
|
||||
tr.Scope["offset"] = offset
|
||||
}
|
||||
storage.SaveTrace(tr)
|
||||
|
||||
resp := map[string]interface{}{
|
||||
"results": results,
|
||||
"count": len(results),
|
||||
"candidates_scanned": annScanned,
|
||||
"mode": req.Mode,
|
||||
// 2026-10-26 (t_9025b0eb):扩展结果单独成字段,避免撑爆 results。
|
||||
// 键恒存在(可为空数组),便于探针/统计区分「无扩展」与「字段缺失」。
|
||||
"graph_expanded": graphExpanded,
|
||||
// AC-2.1(t_e3f5cb79 · B1):第二路 skill 分节检索,**分栏不混排** ——
|
||||
// 键恒存在;开关 ZHIYI_RECALL_SKILLREFS 关 / 任何失败 ⇒ []。
|
||||
// 「怎么做/为什么」类答案稳定落在 skill 文档而从不进 memories 表
|
||||
// (2026-10-31 方案验证节),这里补第二条通道,results 结构一字不动。
|
||||
"skill_refs": skillRefsForQuery(req.Query, 5),
|
||||
// t_1c12e000:AC3 —— 缓存命中/回源扫表必须可区分。
|
||||
// true ⇒ candidates_scanned=0 是「读了 60s 内的旧快照」(含 L1/L2);
|
||||
// false ⇒ 本次真扫了表(candidates_scanned 为真实候选池大小)。
|
||||
"cache_hit": cacheHit,
|
||||
})
|
||||
// 2026-10-26(P0-1/P0-3 契约):
|
||||
// trace_id ⇒ GET /api/v1/trace/<id> 可重建本次调用链(阶段耗时 + 每通道贡献);
|
||||
// status ⇒ complete 的空结果才可解读为「不存在」;partial 必须看 partial_reason;
|
||||
// scope ⇒ 本次答案基于哪个数据视图(namespace/snapshot/cache_hit/truncated);
|
||||
// continuation ⇒ 空串=无下一页,非空=拼回请求体取下一页。
|
||||
"trace_id": tr.TraceID,
|
||||
"status": status,
|
||||
"scope": tr.Scope,
|
||||
"continuation": nextCont,
|
||||
}
|
||||
if partialReason != "" {
|
||||
resp["partial_reason"] = partialReason
|
||||
}
|
||||
// t_3aa2a8c1:truncated —— 只在 true 时暴露(键缺失 = 未截断,等价 omitempty 语义)。
|
||||
if truncated {
|
||||
resp["truncated"] = true
|
||||
}
|
||||
respond(w, 200, resp)
|
||||
|
||||
// H3: Async trust score update
|
||||
if a.GraphStore != nil {
|
||||
@@ -585,6 +1032,38 @@ func (a *API) Recall(w http.ResponseWriter, r *http.Request) {
|
||||
// useful_count / not_useful_count(后者是 P0-1 拆分的旧混写列)。反馈统一走
|
||||
// feedback.go 的 /api/v1/feedback/{useful,not-useful,deprecate,correct}(写 human_not_useful_count)。
|
||||
|
||||
// GET /api/v1/usage/report — ⑤使用追踪上报(t_5aa4dcac)。
|
||||
// 返回最近被自动判定「被用上」(carry_forward)的记忆样本,供 ⑥反馈消费 + 取证。
|
||||
// env 门控 ZHIYI_USAGE_TRACK,默认关 ⇒ 返回空;不写任何东西,零行为变化。
|
||||
func (a *API) UsageReport(w http.ResponseWriter, r *http.Request) {
|
||||
limit := 20
|
||||
if v := r.URL.Query().Get("limit"); v != "" {
|
||||
if n, err := strconv.Atoi(v); err == nil && n > 0 && n <= 200 {
|
||||
limit = n
|
||||
}
|
||||
}
|
||||
flags := storage.UsageReport(limit)
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"enabled": storage.UsageTrackingEnabled(),
|
||||
"count": len(flags),
|
||||
"flags": flags,
|
||||
})
|
||||
}
|
||||
|
||||
// POST /api/v1/usage/detect — ⑤使用追踪手动触发(t_5aa4dcac)。
|
||||
// 对「当前有 ZHIYI_USAGE_TRACK 且仍有未消费 recall 行」做一次兜底检测。
|
||||
// 主要靠 commit 写侧自动检测;此端点供运维/验证在无新 commit 时手动补扫。
|
||||
// 门控:关闭时返回 enabled=false,不碰任何数据。
|
||||
func (a *API) UsageDetect(w http.ResponseWriter, r *http.Request) {
|
||||
if !storage.UsageTrackingEnabled() {
|
||||
respond(w, 200, map[string]interface{}{"enabled": false, "count": 0, "flags": []storage.UsageFlag{}})
|
||||
return
|
||||
}
|
||||
// 手动触发需要一个候选内容作比对源;无 commit 时无可比内容,返回空。
|
||||
// 真实检测由 commit 写侧完成(见 Commit handler)。此端点仅回执开关状态。
|
||||
respond(w, 200, map[string]interface{}{"enabled": true, "count": 0, "note": "detection runs on commit write-side"})
|
||||
}
|
||||
|
||||
// POST /api/v1/recall/debug — recall 诊断端点(优化),返回各阶段耗时和状态
|
||||
func (a *API) RecallDebug(w http.ResponseWriter, r *http.Request) {
|
||||
var req struct {
|
||||
@@ -611,6 +1090,14 @@ func (a *API) RecallDebug(w http.ResponseWriter, r *http.Request) {
|
||||
}
|
||||
// 2026-09-21 五修:与 Recall 完全一致(同一解析函数),保证 debug 端点如实反映 Recall 行为
|
||||
req.Namespace = resolveRecallNamespace(req.Namespace, req.AgentID, req.Query)
|
||||
// t_f1ee22e5:与 Recall (core.go:613) 完全同源的 diversity 默认值。
|
||||
// 修前 debug 直接用 req.Diversity(缺省 0)⇒ mmr 行报 diversity=0.0,
|
||||
// 而生产 Recall 走 storage.DefaultMMRDiversity()(实测 tune-state 推送 0.1)
|
||||
// ⇒ 诊断端点报的 MMR 与生产不同口径(撒的谎比没诊断更贵)。
|
||||
// 不硬编码 0.1 —— 读的是同一个 storage 推送原子值,调参器改了就跟着变。
|
||||
if req.Diversity <= 0 {
|
||||
req.Diversity = storage.DefaultMMRDiversity()
|
||||
}
|
||||
|
||||
type stepInfo struct {
|
||||
Step string `json:"step"`
|
||||
@@ -627,7 +1114,7 @@ func (a *API) RecallDebug(w http.ResponseWriter, r *http.Request) {
|
||||
encodeTime := time.Since(t1).Milliseconds()
|
||||
if err != nil {
|
||||
steps = append(steps, stepInfo{"encode", "error", encodeTime, err.Error()})
|
||||
respond(w, 200, map[string]interface{}{"steps": steps, "results": []interface{}{}, "total_ms": time.Since(totalStart).Milliseconds()})
|
||||
respond(w, 200, map[string]interface{}{"query": req.Query, "steps": steps, "results": []interface{}{}, "count": 0, "total_ms": time.Since(totalStart).Milliseconds()})
|
||||
return
|
||||
}
|
||||
steps = append(steps, stepInfo{"encode", "ok", encodeTime, fmt.Sprintf("dim=%d", len(queryVec))})
|
||||
@@ -636,11 +1123,14 @@ func (a *API) RecallDebug(w http.ResponseWriter, r *http.Request) {
|
||||
t2 := time.Now()
|
||||
// 2026-09-21 五修:与 RecallPipeline 完全一致 —— ns=="" 走全库单次检索,
|
||||
// 否则 [ns, shared]。诊断端点必须如实反映生产召回行为,不能自带另一套 ns 逻辑。
|
||||
// 2026-11-09 t_nsdebug:补上 ghost-ns 闸(与 recall.go 的 namespaceHasRows 同判据、同缓存)。
|
||||
// 背景:生产 /recall 已于 11-07 修好(ghost ns ⇒ 0 条),debug 端点仍无条件并 shared,
|
||||
// 实测 ghost ns 报 "5 candidates from 2 namespaces" ⇒ 诊断撒的谎比没诊断更贵。
|
||||
nsList := []string{req.Namespace}
|
||||
if req.Namespace == "" {
|
||||
nsList = []string{""} // 全库
|
||||
} else if req.Namespace != "shared" {
|
||||
nsList = append(nsList, "shared")
|
||||
} else if req.Namespace != "shared" && storage.NamespaceHasRowsFor(a.LanceDB, req.Namespace) {
|
||||
nsList = append(nsList, "shared") // ghost ns(全量表无行)⇒ 不并 shared,与生产同口径
|
||||
}
|
||||
var candidates []models.MemoryRecord
|
||||
for _, ns := range nsList {
|
||||
@@ -655,8 +1145,8 @@ func (a *API) RecallDebug(w http.ResponseWriter, r *http.Request) {
|
||||
}
|
||||
annTime := time.Since(t2).Milliseconds()
|
||||
if len(candidates) == 0 {
|
||||
steps = append(steps, stepInfo{"ann_search", "ok", annTime, "0 candidates"})
|
||||
respond(w, 200, map[string]interface{}{"steps": steps, "results": []interface{}{}, "total_ms": time.Since(totalStart).Milliseconds()})
|
||||
steps = append(steps, stepInfo{"ann_search", "ok", annTime, fmt.Sprintf("0 candidates from %d namespaces", len(nsList))})
|
||||
respond(w, 200, map[string]interface{}{"query": req.Query, "steps": steps, "results": []interface{}{}, "count": 0, "total_ms": time.Since(totalStart).Milliseconds()})
|
||||
return
|
||||
}
|
||||
steps = append(steps, stepInfo{"ann_search", "ok", annTime, fmt.Sprintf("%d candidates from %d namespaces", len(candidates), len(nsList))})
|
||||
@@ -706,6 +1196,7 @@ func (a *API) RecallDebug(w http.ResponseWriter, r *http.Request) {
|
||||
results = append(results, models.RecallResult{
|
||||
ID: c.ID, Content: c.Content, Category: c.Category,
|
||||
Score: score, Timestamp: c.CreatedAt.Format(time.RFC3339),
|
||||
HumanUsefulCount: c.HumanUsefulCount, // A10 (t_d618dc7c)
|
||||
})
|
||||
}
|
||||
}
|
||||
@@ -968,7 +1459,14 @@ func (a *API) BatchCommit(w http.ResponseWriter, r *http.Request) {
|
||||
}
|
||||
|
||||
var ids []string
|
||||
skippedMeta := 0
|
||||
for _, item := range req.Items {
|
||||
// 2026-10-16 t_5ad3f843:meta-note 门禁——逐条跳过 meta 条目(门禁默认关闭=零行为变化)。
|
||||
if skip, reason := metanote.ShouldSkip(item.Content); skip {
|
||||
log.Printf("[metanote] batch item skipped: agent=%s reason=%s content=%.60s", item.AgentID, reason, item.Content)
|
||||
skippedMeta++
|
||||
continue
|
||||
}
|
||||
ns := item.Namespace
|
||||
if ns == "" {
|
||||
cat := item.Category
|
||||
@@ -988,7 +1486,7 @@ func (a *API) BatchCommit(w http.ResponseWriter, r *http.Request) {
|
||||
}
|
||||
ids = append(ids, id)
|
||||
}
|
||||
respond(w, 201, map[string]interface{}{"ids": ids, "count": len(ids), "status": "ok"})
|
||||
respond(w, 201, map[string]interface{}{"ids": ids, "count": len(ids), "skipped_meta": skippedMeta, "status": "ok"})
|
||||
}
|
||||
|
||||
// ─── Namespace 分类规则(按 §1.3 设计)─────────────────────
|
||||
@@ -1157,3 +1655,150 @@ func (a *API) EdgeFeedback(w http.ResponseWriter, r *http.Request) {
|
||||
_ = a.GraphStore.UpdateEdgeTrustScores()
|
||||
respond(w, 200, map[string]string{"status": "ok"})
|
||||
}
|
||||
|
||||
// GET /api/v1/popwatch — t_23b6a940 AC7:热门度看门狗快照(report-only 观测)。
|
||||
// 服务端记录「最终 rank1 的 recall_verified_count 连续越 p95 阈值」计数
|
||||
// (storage.PopWatch,观测点在 recallUncached 主路径漏斗末尾);本端点只读快照,
|
||||
// 不改排序、不写库。传感器端脚本(zhiyi-popwatch.py)读它转既有告警通道;
|
||||
// ZHIYI_POPWATCH=0 时 enabled=false(观测关闭)。
|
||||
func (a *API) PopWatch(w http.ResponseWriter, r *http.Request) {
|
||||
respond(w, 200, storage.PopWatchSnapshot())
|
||||
}
|
||||
|
||||
// capRecallResults —— 2026-10-26 (t_9025b0eb) top_k 收口语义(纯函数,可单测)。
|
||||
//
|
||||
// 输入是 pipeline 返回的原始结果(主检索在前、图谱扩展 append 在后,扩展无上限)。
|
||||
// 输出:
|
||||
//
|
||||
// prim = 主检索结果(category != graph_expanded),截断到 limit;
|
||||
// 若主结果不足 limit,用扩展结果按原顺序补齐(稀疏查询仍有扩展收益)。
|
||||
// expanded = 剩余扩展结果,单独成字段返回,上限 limit(能力可观测,但不挤占主结果)。
|
||||
//
|
||||
// 为什么不是「直接 results[:limit]」:扩展结果全部排在主结果之后,直接截断会让
|
||||
// category=graph_expanded 恒为 0 ⇒ 能力虽在跑但对外永久失明(本仓 2026-10 已因同类
|
||||
// 「接线≠出数」栽过一次)。所以既收口、又保留可观测通道。
|
||||
func capRecallResults(results []models.RecallResult, limit int) (prim, expanded []models.RecallResult) {
|
||||
if limit <= 0 {
|
||||
limit = 10
|
||||
}
|
||||
prim = make([]models.RecallResult, 0, limit)
|
||||
if len(results) == 0 {
|
||||
return prim, []models.RecallResult{}
|
||||
}
|
||||
exp := make([]models.RecallResult, 0, len(results))
|
||||
// 2026-10-26 (t_e98cb1d6):pattern / peer 是「附带注入」的召回条目(recall.go Step 6.2/6.3),
|
||||
// 追加在 results 末尾 ⇒ 若并入 prim 一起截断,distilled 占满 limit 时它们恒被切光
|
||||
// (16:28 topkcap 引入的 pattern 截断回归,limit=50 时 pattern=0 / limit=200 才现形 3 条)。
|
||||
// 正确语义:主检索结果(distilled 等)照常收口到 limit;pattern/peer 作为附带条目
|
||||
// 恒保留(不挤占主结果配额),避免「命中即注入」被 cap 吞掉。graph_expanded 仍走独立字段。
|
||||
var carry []models.RecallResult
|
||||
for _, r := range results {
|
||||
switch r.Category {
|
||||
case "graph_expanded":
|
||||
exp = append(exp, r)
|
||||
case "pattern", "peer":
|
||||
carry = append(carry, r)
|
||||
default:
|
||||
prim = append(prim, r)
|
||||
}
|
||||
}
|
||||
// 先收口主结果
|
||||
if len(prim) > limit {
|
||||
prim = prim[:limit]
|
||||
}
|
||||
// 主结果不足 limit 时用扩展结果按原顺序补齐(稀疏查询仍有扩展收益)
|
||||
if len(exp) > 0 {
|
||||
if room := limit - len(prim); room > 0 {
|
||||
if room > len(exp) {
|
||||
room = len(exp)
|
||||
}
|
||||
prim = append(prim, exp[:room]...)
|
||||
exp = exp[room:]
|
||||
}
|
||||
if len(exp) > limit {
|
||||
exp = exp[:limit]
|
||||
}
|
||||
}
|
||||
// pattern / peer 附带条目恒保留在 results 末尾(独立于主结果配额)
|
||||
prim = append(prim, carry...)
|
||||
if expanded == nil {
|
||||
expanded = exp
|
||||
}
|
||||
return prim, expanded
|
||||
}
|
||||
|
||||
// paginateRecallWithCarry —— P0-3 翻页切片,对 pattern/peer carry 豁免
|
||||
// (2026-11-02 t_58f9d476;carry 判据与 capRecallResults 同源:Category ∈ {pattern, peer})。
|
||||
//
|
||||
// 病灶:capRecallResults 把 carry 恒保留追加在 prim 之后(主+扩展回填恒填满 limit
|
||||
// ⇒ carry 恒在索引 limit 处),紧随的 P0-3 裸 `results[:req.Limit]` 恒把它切掉
|
||||
// ——t_e98cb1d6 的 carry 修复被作废,peer/pattern 注入在主召回响应里结构性失明。
|
||||
//
|
||||
// 语义(纯函数,可单测):先把 carry 摘出,对剩余主路段照旧做
|
||||
// offset 切片 → prevIDs 去重 → [:limit] 截断,第一页把 carry 回尾。
|
||||
// 保证:① 主路段逐位不变(t_9025b0eb AC 不动:主路段 ≤ limit);
|
||||
// ② carry 在第一页存活且恒在响应末尾;③ 无 carry(门关态)逐位与旧内联逻辑 delta=0;
|
||||
// ④ 主路段切空(offset 越界 / 去重全掉)时返回空段,不返回孤儿 carry。
|
||||
//
|
||||
// 2026-11-02(t_2891d689)两处修订:
|
||||
// ① 返回值加 mainLen(主路段截断后的长度)。4ffc546 后 carry 使 len(results) 可以
|
||||
// 超过 limit,翻页判据若看 len(results) 会恒假 ⇒ nextCont 恒空、带注入的 query
|
||||
// 翻页链断裂(本卡病灶)。判据改看主路段(见 shouldEmitContinuation)。
|
||||
// ② carry 只在第一页出现:carry 是固定钉住的注入条目,第一页其 ID 已随 returned
|
||||
// 记进令牌 prev;续页再追加必然逐页重复,等于把去重成本转嫁给客户端。
|
||||
// ⇒ offset > 0 时只回主路段,不追加 carry。
|
||||
func paginateRecallWithCarry(results []models.RecallResult, offset int, prevIDs []string, limit int) ([]models.RecallResult, int) {
|
||||
var carry []models.RecallResult
|
||||
main := make([]models.RecallResult, 0, len(results))
|
||||
for _, r := range results {
|
||||
if r.Category == "pattern" || r.Category == "peer" {
|
||||
carry = append(carry, r)
|
||||
} else {
|
||||
main = append(main, r)
|
||||
}
|
||||
}
|
||||
if offset > 0 {
|
||||
if offset >= len(main) {
|
||||
main = []models.RecallResult{}
|
||||
} else {
|
||||
main = main[offset:]
|
||||
}
|
||||
}
|
||||
if len(prevIDs) > 0 {
|
||||
seenPrev := make(map[string]bool, len(prevIDs))
|
||||
for _, id := range prevIDs {
|
||||
seenPrev[id] = true
|
||||
}
|
||||
kept := main[:0]
|
||||
for _, r := range main {
|
||||
if !seenPrev[r.ID] {
|
||||
kept = append(kept, r)
|
||||
}
|
||||
}
|
||||
main = kept
|
||||
}
|
||||
if limit >= 0 && len(main) > limit {
|
||||
main = main[:limit]
|
||||
}
|
||||
mainLen := len(main)
|
||||
if mainLen == 0 {
|
||||
// 与旧语义一致:主路段空 ⇒ 整页空(页面上只有注入条目没有意义)
|
||||
return []models.RecallResult{}, 0
|
||||
}
|
||||
if offset > 0 {
|
||||
// t_2891d689:carry 只在第一页出现,续页不回尾(见函数头注释 ②)
|
||||
return main, mainLen
|
||||
}
|
||||
return append(main, carry...), mainLen
|
||||
}
|
||||
|
||||
// shouldEmitContinuation —— P0-3 是否发放下一页 continuation 令牌(2026-11-02 t_2891d689)。
|
||||
//
|
||||
// 病灶:4ffc546 后 carry 追加在主路段之后 ⇒ len(results) 可以 > limit,
|
||||
// 判据 `len(results) == req.Limit` 只要 carry 命中就恒假 ⇒ nextCont 恒空,
|
||||
// 带 pattern/peer 注入的 query 翻页链断裂(第二页永远取不到)。
|
||||
// 修法:判据看**主路段长度** mainLen —— carry 不参与「是否还有下一页」的判断。
|
||||
// 必须用 == 而不用 >=:主路段未满一页(offset 越界 / 尾页不满)时不得错发令牌。
|
||||
func shouldEmitContinuation(totalFetched, fetchLimit, mainLen, limit, offset int) bool {
|
||||
return totalFetched >= fetchLimit && mainLen == limit && offset+limit < maxContinuationOffset
|
||||
}
|
||||
|
||||
@@ -0,0 +1,491 @@
|
||||
package routes
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
)
|
||||
|
||||
// 2026-10-26 (t_9025b0eb):top_k 收口契约测试。
|
||||
// 起因:/api/v1/recall 完全无视 top_k —— top_k=5 实测返回 1905/1625 条(99% graph_expanded),
|
||||
// 插件记忆预取被撑到 103,299 chars 截断、count 失真、使用追踪按千级结果记账。
|
||||
// 钉住四件事:① results 不超过 limit ② 主结果不被扩展挤掉 ③ 扩展仍可见且不超 limit
|
||||
// ④ 稀疏查询(主结果 < limit)时扩展能补齐。
|
||||
func TestCapRecallResults(t *testing.T) {
|
||||
mk := func(n int, cat string) []models.RecallResult {
|
||||
out := make([]models.RecallResult, n)
|
||||
for i := 0; i < n; i++ {
|
||||
out[i] = models.RecallResult{ID: cat + string(rune('a'+i%26)), Category: cat, Content: cat}
|
||||
}
|
||||
return out
|
||||
}
|
||||
cases := []struct {
|
||||
name string
|
||||
prim, exp int
|
||||
limit int
|
||||
wantPrim int
|
||||
wantExp int
|
||||
primCategory string
|
||||
}{
|
||||
{"主结果足额_扩展不得进results", 10, 1900, 5, 5, 5, "distilled"},
|
||||
{"主结果只有2条_扩展补齐到limit", 2, 900, 5, 5, 5, "distilled"},
|
||||
{"无扩展_纯截断", 30, 0, 10, 10, 0, "distilled"},
|
||||
{"扩展少于limit", 1, 3, 5, 4, 0, "distilled"},
|
||||
{"空结果", 0, 0, 5, 0, 0, ""},
|
||||
}
|
||||
for _, c := range cases {
|
||||
t.Run(c.name, func(t *testing.T) {
|
||||
all := append(mk(c.prim, "distilled"), mk(c.exp, "graph_expanded")...)
|
||||
prim, exp := capRecallResults(all, c.limit)
|
||||
if len(prim) != c.wantPrim {
|
||||
t.Fatalf("prim=%d want %d", len(prim), c.wantPrim)
|
||||
}
|
||||
if len(exp) != c.wantExp {
|
||||
t.Fatalf("expanded=%d want %d", len(exp), c.wantExp)
|
||||
}
|
||||
if len(prim)+len(exp) > c.limit*2 {
|
||||
t.Fatalf("总量失控: prim=%d exp=%d", len(prim), len(exp))
|
||||
}
|
||||
// 主结果条数不得超过原始主结果数(不得凭空造)
|
||||
n := 0
|
||||
for _, r := range prim {
|
||||
if r.Category != "graph_expanded" {
|
||||
n++
|
||||
}
|
||||
}
|
||||
if n > c.prim {
|
||||
t.Fatalf("主结果 %d 条,超过输入 %d 条(凭空造)", n, c.prim)
|
||||
}
|
||||
if c.primCategory != "" && c.prim > 0 && n == 0 {
|
||||
t.Fatalf("主结果被扩展挤光:%+v", prim)
|
||||
}
|
||||
})
|
||||
}
|
||||
}
|
||||
|
||||
// limit 非法(0/负数)时按默认 10 处理,不做无界返回。
|
||||
func TestCapRecallResultsDefaultLimit(t *testing.T) {
|
||||
all := make([]models.RecallResult, 50)
|
||||
for i := range all {
|
||||
all[i] = models.RecallResult{Category: "distilled"}
|
||||
}
|
||||
prim, _ := capRecallResults(all, 0)
|
||||
if len(prim) != 10 {
|
||||
t.Fatalf("limit=0 应回落 10,得到 %d", len(prim))
|
||||
}
|
||||
}
|
||||
|
||||
// ── t_e98cb1d6 回归:pattern / peer 被 cap 截断 ────────────────────────────
|
||||
// 病灶:capRecallResults 把非 graph_expanded 全部并入 prim 再截断到 limit;
|
||||
// pattern/peer 是 recall.go Step 6.2/6.3 追加到 results 末尾的附带条目,
|
||||
// distilled 占满 limit 时它们被整段切掉(16:28 topkcap 引入,limit=50 时 pattern=0)。
|
||||
// 修后:pattern/peer 恒保留在 results 末尾(独立于主结果配额),主结果仍照常收口。
|
||||
func TestCapRecallResults_PatternAndPeerSurviveCap(t *testing.T) {
|
||||
mk := func(n int, cat string) []models.RecallResult {
|
||||
out := make([]models.RecallResult, n)
|
||||
for i := 0; i < n; i++ {
|
||||
out[i] = models.RecallResult{ID: cat + string(rune('a'+i%26)), Category: cat, Content: cat}
|
||||
}
|
||||
return out
|
||||
}
|
||||
count := func(rs []models.RecallResult, cat string) int {
|
||||
n := 0
|
||||
for _, r := range rs {
|
||||
if r.Category == cat {
|
||||
n++
|
||||
}
|
||||
}
|
||||
return n
|
||||
}
|
||||
|
||||
cases := []struct {
|
||||
name string
|
||||
d, p, pe, e int // distilled / pattern / peer / graph_expanded
|
||||
limit int
|
||||
wantD, wantP, wantPe int
|
||||
}{
|
||||
// ① 金标场景:主结果占满 limit,pattern/peer 追加在末尾 ⇒ 修前恒为 0
|
||||
{"limit=50_主结果占满_pattern 恒保留", 50, 3, 1, 0, 50, 50, 3, 1},
|
||||
{"limit=200_主结果占满_pattern 仍保留", 100, 3, 1, 97, 200, 100, 3, 1},
|
||||
// ② peer 注入同样不被截断
|
||||
{"limit=50_peer 注入不被截断", 50, 0, 2, 0, 50, 50, 0, 2},
|
||||
// ③ 主结果不足 limit:扩展先补齐主结果,carry 仍保留在末尾
|
||||
{"limit=50_主结果不足_扩展补齐+carry 保留", 30, 2, 1, 10, 50, 30, 2, 1},
|
||||
}
|
||||
for _, c := range cases {
|
||||
t.Run(c.name, func(t *testing.T) {
|
||||
all := make([]models.RecallResult, 0, c.d+c.p+c.pe+c.e)
|
||||
all = append(all, mk(c.d, "distilled")...)
|
||||
all = append(all, mk(c.p, "pattern")...)
|
||||
all = append(all, mk(c.pe, "peer")...)
|
||||
all = append(all, mk(c.e, "graph_expanded")...)
|
||||
prim, exp := capRecallResults(all, c.limit)
|
||||
d := count(prim, "distilled")
|
||||
p := count(prim, "pattern")
|
||||
pe := count(prim, "peer")
|
||||
e := count(prim, "graph_expanded")
|
||||
if d != c.wantD {
|
||||
t.Errorf("distilled=%d want %d", d, c.wantD)
|
||||
}
|
||||
// AC:limit=50 时 pattern 必须 ≥1(金标 query 复现终审现象)
|
||||
if c.p > 0 && p < 1 {
|
||||
t.Errorf("pattern=%d,应 ≥1(截断回归未修)", p)
|
||||
}
|
||||
if p != c.wantP {
|
||||
t.Errorf("pattern=%d want %d", p, c.wantP)
|
||||
}
|
||||
if pe != c.wantPe {
|
||||
t.Errorf("peer=%d want %d", pe, c.wantPe)
|
||||
}
|
||||
// cap 仍然生效:主结果(distilled + 扩展补齐)不得超过 limit
|
||||
if d+e > c.limit {
|
||||
t.Fatalf("主结果超 cap: distilled=%d graph_expanded=%d limit=%d", d, e, c.limit)
|
||||
}
|
||||
if len(exp) > c.limit {
|
||||
t.Fatalf("graph_expanded 字段超 cap: %d > %d", len(exp), c.limit)
|
||||
}
|
||||
// 附带条目不得被塞进 graph_expanded 字段
|
||||
if count(exp, "pattern") > 0 || count(exp, "peer") > 0 {
|
||||
t.Fatalf("pattern/peer 被误放入 graph_expanded 字段")
|
||||
}
|
||||
})
|
||||
}
|
||||
}
|
||||
|
||||
// ── t_58f9d476 回归:P0-3 翻页切片吞掉 carry ──────────────────────────────
|
||||
// 病灶:capRecallResults 之后 results = [主(填满 limit)..., carry...],紧随的
|
||||
// P0-3 翻页块裸 `results[:req.Limit]` 恒把 carry 切掉(carry 恰在索引 limit)
|
||||
// ⇒ t_e98cb1d6 的 carry 修复被作废,peer/pattern 注入结构性失明
|
||||
// (t_9dc647f1 dbg 插桩实证:注入 4087→4088 发生,响应 50 条无 peer)。
|
||||
// 修后:paginateRecallWithCarry 对 carry 豁免切片并回尾;关态(无 carry)逐位 delta=0。
|
||||
func TestPaginateRecallWithCarry(t *testing.T) {
|
||||
mkMain := func(n int) []models.RecallResult {
|
||||
out := make([]models.RecallResult, n)
|
||||
for i := 0; i < n; i++ {
|
||||
out[i] = models.RecallResult{ID: fmt.Sprintf("mem_%03d", i), Category: "distilled", Content: "m"}
|
||||
}
|
||||
return out
|
||||
}
|
||||
carry := func(rs ...models.RecallResult) []models.RecallResult { return rs }
|
||||
|
||||
// ① 金标场景:limit=5、主+扩展填满 limit、末位=peer ⇒ 切片后末位仍 = peer:<id>,
|
||||
// 且主路段逐位 = 原前 5 位(t_9025b0eb AC:主路 ≤ limit 不变)。
|
||||
t.Run("limit=5_末位peer存活_主路段逐位不变", func(t *testing.T) {
|
||||
in := append(mkMain(5), models.RecallResult{ID: "peer:muc", Category: "peer", Content: "p"})
|
||||
got, mainLen := paginateRecallWithCarry(in, 0, nil, 5)
|
||||
if len(got) != 6 {
|
||||
t.Fatalf("len=%d want 6(主 5 + carry 1)", len(got))
|
||||
}
|
||||
if mainLen != 5 {
|
||||
t.Fatalf("mainLen=%d want 5(t_2891d689:判据主路段长度=limit,翻页令牌据此发放)", mainLen)
|
||||
}
|
||||
if got[5].ID != "peer:muc" || got[5].Category != "peer" {
|
||||
t.Fatalf("末位=%s/%s,want peer:muc/peer(截断回归未修)", got[5].ID, got[5].Category)
|
||||
}
|
||||
for i := 0; i < 5; i++ {
|
||||
if got[i].ID != in[i].ID {
|
||||
t.Fatalf("主路段第 %d 位变了: got=%s want=%s", i, got[i].ID, in[i].ID)
|
||||
}
|
||||
}
|
||||
})
|
||||
|
||||
// ② limit=50、pattern(3)+peer(1) 全存活,主路段逐位不变。
|
||||
t.Run("limit=50_pattern与peer全存活", func(t *testing.T) {
|
||||
in := append(mkMain(50), carry(
|
||||
models.RecallResult{ID: "pattern:a", Category: "pattern"},
|
||||
models.RecallResult{ID: "pattern:b", Category: "pattern"},
|
||||
models.RecallResult{ID: "pattern:c", Category: "pattern"},
|
||||
models.RecallResult{ID: "peer:muc", Category: "peer"},
|
||||
)...)
|
||||
got, _ := paginateRecallWithCarry(in, 0, nil, 50)
|
||||
if len(got) != 54 {
|
||||
t.Fatalf("len=%d want 54", len(got))
|
||||
}
|
||||
for i := 0; i < 50; i++ {
|
||||
if got[i].ID != in[i].ID {
|
||||
t.Fatalf("主路段第 %d 位变了", i)
|
||||
}
|
||||
}
|
||||
if got[53].ID != "peer:muc" {
|
||||
t.Fatalf("末位=%s want peer:muc", got[53].ID)
|
||||
}
|
||||
nPat := 0
|
||||
for _, r := range got {
|
||||
if r.Category == "pattern" {
|
||||
nPat++
|
||||
}
|
||||
}
|
||||
if nPat != 3 {
|
||||
t.Fatalf("pattern=%d want 3", nPat)
|
||||
}
|
||||
})
|
||||
|
||||
// ③ 关态(无 carry)逐位 delta=0:offset × prevIDs × limit 组合下
|
||||
// 与旧内联语义(切片→去重→截断)逐一比对。
|
||||
t.Run("关态无carry_与旧内联逻辑逐位一致", func(t *testing.T) {
|
||||
legacy := func(in []models.RecallResult, offset int, prevIDs []string, limit int) []models.RecallResult {
|
||||
results := in
|
||||
if offset > 0 {
|
||||
if offset >= len(results) {
|
||||
results = []models.RecallResult{}
|
||||
} else {
|
||||
results = results[offset:]
|
||||
}
|
||||
}
|
||||
if len(prevIDs) > 0 {
|
||||
seen := make(map[string]bool, len(prevIDs))
|
||||
for _, id := range prevIDs {
|
||||
seen[id] = true
|
||||
}
|
||||
kept := make([]models.RecallResult, 0, len(results))
|
||||
for _, r := range results {
|
||||
if !seen[r.ID] {
|
||||
kept = append(kept, r)
|
||||
}
|
||||
}
|
||||
results = kept
|
||||
}
|
||||
if len(results) > limit {
|
||||
results = results[:limit]
|
||||
}
|
||||
return results
|
||||
}
|
||||
in := mkMain(30)
|
||||
for _, offset := range []int{0, 1, 7, 29, 30, 45} {
|
||||
for _, prev := range [][]string{nil, {"mem_008"}, {"mem_008", "mem_009", "mem_020"}} {
|
||||
for _, limit := range []int{5, 10, 50} {
|
||||
got, _ := paginateRecallWithCarry(in, offset, prev, limit)
|
||||
want := legacy(in, offset, prev, limit)
|
||||
if len(got) != len(want) {
|
||||
t.Fatalf("offset=%d prev=%v limit=%d: len got=%d want=%d", offset, prev, limit, len(got), len(want))
|
||||
}
|
||||
for i := range got {
|
||||
if got[i].ID != want[i].ID {
|
||||
t.Fatalf("offset=%d prev=%v limit=%d: 第%d位 got=%s want=%s", offset, prev, limit, i, got[i].ID, want[i].ID)
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
})
|
||||
|
||||
// ④ 主路段切空 ⇒ 整页空(不返回孤儿 carry,与旧语义一致)。
|
||||
t.Run("offset越界_整页空不带孤儿carry", func(t *testing.T) {
|
||||
in := append(mkMain(5), models.RecallResult{ID: "peer:muc", Category: "peer"})
|
||||
if got, _ := paginateRecallWithCarry(in, 5, nil, 5); len(got) != 0 {
|
||||
t.Fatalf("len=%d want 0", len(got))
|
||||
}
|
||||
})
|
||||
|
||||
// ⑤ 续页(offset>0 + prevIDs 去重)主路段从 offset 起且去掉 prevIDs。
|
||||
// ⚠ 2026-11-02 (t_2891d689) 判据反转:原断言「续页 carry 回尾」锁死的正是
|
||||
// 本卡要改的行为(carry 每页重复出现,去重成本转嫁客户端)。现语义:
|
||||
// carry 只在第一页出现,续页只回主路段。
|
||||
t.Run("续页不回carry_主路段offset加去重", func(t *testing.T) {
|
||||
in := append(mkMain(20), models.RecallResult{ID: "peer:muc", Category: "peer"})
|
||||
got, mainLen := paginateRecallWithCarry(in, 3, []string{"mem_005"}, 5)
|
||||
if len(got) != 5 {
|
||||
t.Fatalf("len=%d want 5(续页不含 carry)", len(got))
|
||||
}
|
||||
if mainLen != 5 {
|
||||
t.Fatalf("mainLen=%d want 5", mainLen)
|
||||
}
|
||||
wantMain := []string{"mem_003", "mem_004", "mem_006", "mem_007", "mem_008"}
|
||||
for i, id := range wantMain {
|
||||
if got[i].ID != id {
|
||||
t.Fatalf("主路段第 %d 位 got=%s want=%s", i, got[i].ID, id)
|
||||
}
|
||||
}
|
||||
for _, r := range got {
|
||||
if r.Category == "peer" || r.Category == "pattern" {
|
||||
t.Fatalf("续页混入 carry: %s/%s", r.ID, r.Category)
|
||||
}
|
||||
}
|
||||
})
|
||||
|
||||
// ⑥ 端到端:capRecallResults → paginateRecallWithCarry 全链路
|
||||
// (生产形态:主 60 + 扩展 100 + pattern 3 + peer 1,limit=50)。
|
||||
t.Run("端到端cap后翻页_peer不再被切", func(t *testing.T) {
|
||||
var all []models.RecallResult
|
||||
all = append(all, mkMain(60)...)
|
||||
for i := 0; i < 100; i++ {
|
||||
all = append(all, models.RecallResult{ID: fmt.Sprintf("gx_%03d", i), Category: "graph_expanded", Content: "[graph] x"})
|
||||
}
|
||||
all = append(all,
|
||||
models.RecallResult{ID: "pattern:a", Category: "pattern"},
|
||||
models.RecallResult{ID: "peer:muc", Category: "peer"})
|
||||
prim, _ := capRecallResults(all, 50)
|
||||
if prim[len(prim)-1].Category != "peer" {
|
||||
t.Fatalf("cap 后末位=%s,capRecallResults 语义变了", prim[len(prim)-1].ID)
|
||||
}
|
||||
got, _ := paginateRecallWithCarry(prim, 0, nil, 50)
|
||||
// 修前此处恒被切(results[:50] 丢掉末尾 carry)
|
||||
if got[len(got)-1].ID != "peer:muc" {
|
||||
t.Fatalf("翻页后末位=%s want peer:muc(P0-3 截断回归未修)", got[len(got)-1].ID)
|
||||
}
|
||||
nMain := 0
|
||||
for _, r := range got {
|
||||
if r.Category != "pattern" && r.Category != "peer" {
|
||||
nMain++
|
||||
}
|
||||
}
|
||||
if nMain > 50 {
|
||||
t.Fatalf("主路段 %d 条 > limit 50(t_9025b0eb AC 破坏)", nMain)
|
||||
}
|
||||
})
|
||||
}
|
||||
|
||||
// ── t_2891d689 回归:carry 撑大 len(results) ⇒ nextCont 恒空、翻页链断 ──────
|
||||
// 病灶:4ffc546 后 paginateRecallWithCarry 回 main+carry,len(results) 可 > limit,
|
||||
// handler 判据 `len(results) == req.Limit` 只要 carry 命中就恒假
|
||||
// ⇒ nextCont 恒空,带 pattern/peer 注入的 query 第二页永远取不到。
|
||||
// 修后:判据收口 shouldEmitContinuation,看主路段 mainLen;carry 只在第一页回尾。
|
||||
// 判据链与 handler(core.go 翻页块)逐行同构:paginate → shouldEmitContinuation
|
||||
// → returned=prevIDs+页内ID → encodeContinuation(卡面允许的「抽出判定函数单测」路线)。
|
||||
func TestContinuationIssuedWithCarry(t *testing.T) {
|
||||
mkMain := func(n int) []models.RecallResult {
|
||||
out := make([]models.RecallResult, n)
|
||||
for i := 0; i < n; i++ {
|
||||
out[i] = models.RecallResult{ID: fmt.Sprintf("mem_%03d", i), Category: "distilled", Content: "m"}
|
||||
}
|
||||
return out
|
||||
}
|
||||
idsOf := func(rs []models.RecallResult) []string {
|
||||
out := make([]string, len(rs))
|
||||
for i, r := range rs {
|
||||
out[i] = r.ID
|
||||
}
|
||||
return out
|
||||
}
|
||||
// 生产形态(t_58f9d476 实证):cap 后 prim = 主路段填满 limit + 末尾 carry。
|
||||
limit := 5
|
||||
prim := append(mkMain(5), models.RecallResult{ID: "peer:muc", Category: "peer"})
|
||||
totalFetched := len(prim) // 6 ≥ fetchLimit(=limit+offset+len(prev)=5)
|
||||
page, mainLen := paginateRecallWithCarry(prim, 0, nil, limit)
|
||||
if len(page) != 6 || mainLen != 5 {
|
||||
t.Fatalf("page=%d mainLen=%d want 6/5", len(page), mainLen)
|
||||
}
|
||||
// 病灶判据复现:len(page)==limit ⇒ 6==5 恒假 ⇒ 链断。本例页形必须仍是 len>limit,
|
||||
// 否则该用例失去对旧病灶的覆盖。
|
||||
if len(page) == limit {
|
||||
t.Fatal("页形不再是 len>limit,本用例失去对旧病灶的覆盖")
|
||||
}
|
||||
// 新判据:主路段满页 ⇒ 必须发令牌
|
||||
if !shouldEmitContinuation(totalFetched, limit, mainLen, limit, 0) {
|
||||
t.Fatal("totalFetched>=fetchLimit 且主路段满页 ⇒ 应发 nextCont(翻页链断裂回归未修)")
|
||||
}
|
||||
// handler 完整动作 ⇒ nextCont != "",且令牌推进 offset=5
|
||||
returned := idsOf(page) // 含 carry ID(t_58f9d476 既有行为:去重锚点)
|
||||
nextCont := encodeContinuation("q", "ns", 0+limit, limit, returned)
|
||||
if nextCont == "" {
|
||||
t.Fatal("nextCont == \"\",翻页链断")
|
||||
}
|
||||
tok, err := decodeContinuation(nextCont)
|
||||
if err != nil || tok.Off != 5 || tok.Lim != 5 {
|
||||
t.Fatalf("令牌非法: off=%d lim=%d err=%v(want 5/5/nil)", tok.Off, tok.Lim, err)
|
||||
}
|
||||
}
|
||||
|
||||
// AC2:offset>0 的续页 ⇒ 不含前页已返回的 carry,主路段继续推进;尾页不满 ⇒ 链自然终止。
|
||||
func TestCarryOnlyOnFirstPageAcrossPages(t *testing.T) {
|
||||
mkMain := func(n int) []models.RecallResult {
|
||||
out := make([]models.RecallResult, n)
|
||||
for i := 0; i < n; i++ {
|
||||
out[i] = models.RecallResult{ID: fmt.Sprintf("mem_%03d", i), Category: "distilled", Content: "m"}
|
||||
}
|
||||
return out
|
||||
}
|
||||
limit := 5
|
||||
// 18 主(4 页:5+5+5+3)+ 2 carry
|
||||
prim := append(mkMain(18),
|
||||
models.RecallResult{ID: "pattern:a", Category: "pattern"},
|
||||
models.RecallResult{ID: "peer:muc", Category: "peer"})
|
||||
|
||||
// 第 1 页:主 5 + carry 2 回尾;令牌 returned 含 carry ID
|
||||
page1, ml1 := paginateRecallWithCarry(prim, 0, nil, limit)
|
||||
if len(page1) != 7 || ml1 != 5 {
|
||||
t.Fatalf("page1=%d mainLen=%d want 7/5", len(page1), ml1)
|
||||
}
|
||||
if page1[6].Category != "peer" || page1[5].Category != "pattern" {
|
||||
t.Fatalf("第一页 carry 未回尾: %v", page1[5:])
|
||||
}
|
||||
if !shouldEmitContinuation(len(prim), limit, ml1, limit, 0) {
|
||||
t.Fatal("第 1 页应发令牌")
|
||||
}
|
||||
prev := make([]string, 0, len(page1))
|
||||
for _, r := range page1 {
|
||||
prev = append(prev, r.ID)
|
||||
}
|
||||
|
||||
// 第 2 页:offset=5(模拟 handler 从令牌取 offset/prev)
|
||||
page2, ml2 := paginateRecallWithCarry(prim, 5, prev, limit)
|
||||
for _, r := range page2 {
|
||||
if r.Category == "pattern" || r.Category == "peer" {
|
||||
t.Fatalf("续页混入前页 carry: %s/%s", r.ID, r.Category)
|
||||
}
|
||||
}
|
||||
want2 := []string{"mem_005", "mem_006", "mem_007", "mem_008", "mem_009"}
|
||||
if len(page2) != 5 || ml2 != 5 {
|
||||
t.Fatalf("page2=%d mainLen=%d want 5/5", len(page2), ml2)
|
||||
}
|
||||
for i, id := range want2 {
|
||||
if page2[i].ID != id {
|
||||
t.Fatalf("主路段未推进: 第%d位 got=%s want=%s", i, page2[i].ID, id)
|
||||
}
|
||||
}
|
||||
// 链未断:第 2 页满页且取数满足 ⇒ 继续发令牌(生产页 2 的 fetchLimit=5+5+len(prev))
|
||||
if !shouldEmitContinuation(limit+5+len(prev), limit+5+len(prev), ml2, limit, 5) {
|
||||
t.Fatal("满页续页应继续发令牌(链不得在第 2 页断)")
|
||||
}
|
||||
for _, r := range page2 {
|
||||
prev = append(prev, r.ID)
|
||||
}
|
||||
// 第 3 页照推
|
||||
page3, ml3 := paginateRecallWithCarry(prim, 10, prev, limit)
|
||||
if ml3 != 5 || page3[0].ID != "mem_010" {
|
||||
t.Fatalf("page3 mainLen=%d first=%s want 5/mem_010", ml3, page3[0].ID)
|
||||
}
|
||||
// 第 4 页(尾页只剩 3 主)⇒ mainLen=3 < limit ⇒ 不再发令牌(不得错发空尾页令牌)
|
||||
page4, ml4 := paginateRecallWithCarry(prim, 15, prev, limit)
|
||||
if ml4 != 3 || len(page4) != 3 {
|
||||
t.Fatalf("page4 mainLen=%d len=%d want 3/3", ml4, len(page4))
|
||||
}
|
||||
if shouldEmitContinuation(len(prim), limit+15+len(prev), ml4, limit, 15) {
|
||||
t.Fatal("尾页主路段不满 limit ⇒ 不应发令牌")
|
||||
}
|
||||
}
|
||||
|
||||
// AC3:offset 越界 ⇒ 空页且 nextCont == "";并钉死「判据看 mainLen 而非 len(results)」:
|
||||
// 主路段 4 + carry 1(len(page)==limit 但 mainLen<limit)也不得发令牌 ——
|
||||
// 这正是卡面警告的「不要用 len(results)>=limit,offset 越界/尾页会错发 token」的镜像。
|
||||
func TestNoContinuationOnEmptyOrShortMainPage(t *testing.T) {
|
||||
mkMain := func(n int) []models.RecallResult {
|
||||
out := make([]models.RecallResult, n)
|
||||
for i := 0; i < n; i++ {
|
||||
out[i] = models.RecallResult{ID: fmt.Sprintf("mem_%03d", i), Category: "distilled", Content: "m"}
|
||||
}
|
||||
return out
|
||||
}
|
||||
limit := 5
|
||||
|
||||
// A. offset 越界(=主路段长度)⇒ 空页 + 不发令牌
|
||||
prim := append(mkMain(5), models.RecallResult{ID: "peer:muc", Category: "peer"})
|
||||
page, ml := paginateRecallWithCarry(prim, 5, []string{"mem_000"}, limit)
|
||||
if len(page) != 0 || ml != 0 {
|
||||
t.Fatalf("越界页 len=%d mainLen=%d want 0/0", len(page), ml)
|
||||
}
|
||||
if shouldEmitContinuation(len(prim), limit+5+1, ml, limit, 5) {
|
||||
t.Fatal("越界空页不得发令牌")
|
||||
}
|
||||
|
||||
// B. 主路段不满页但 len(page)==limit(4 主 + 1 carry 撑到 5)⇒ 不得发令牌
|
||||
prim2 := append(mkMain(4), models.RecallResult{ID: "pattern:a", Category: "pattern"})
|
||||
page2, ml2 := paginateRecallWithCarry(prim2, 0, nil, limit)
|
||||
if len(page2) != 5 || ml2 != 4 {
|
||||
t.Fatalf("短页 len=%d mainLen=%d want 5/4", len(page2), ml2)
|
||||
}
|
||||
if shouldEmitContinuation(len(prim2), limit, ml2, limit, 0) {
|
||||
t.Fatal("主路段未满页 ⇒ 不得发令牌(判据必须看 mainLen,不是 len(results))")
|
||||
}
|
||||
}
|
||||
@@ -3,8 +3,11 @@ package routes
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
_ "embed"
|
||||
"fmt"
|
||||
"net/http"
|
||||
"os"
|
||||
"path/filepath"
|
||||
"strings"
|
||||
"sync"
|
||||
"time"
|
||||
@@ -12,6 +15,15 @@ import (
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// go:embed testdata/golden-set.json 把金标集打进二进制(t_dfc93ad0 AC5):
|
||||
// 部署 CWD=/home/muc,旧版「path=="" → 相对 testdata/」解析到 /home/muc/testdata
|
||||
// ⇒ POST /api/v1/eval/golden 不传 golden_path 时 500(2026-10-14 实测复现)。
|
||||
// 内嵌兜底后:缺省/相对路径读不到 ⇒ 回落内嵌基线(仍可用);env ZHIYI_GOLDEN_SET
|
||||
// 指定绝对路径 ⇒ 读该文件(可临时替换金标集)。测试仍按显式路径调用,行为不变。
|
||||
//
|
||||
//go:embed testdata/golden-set.json
|
||||
var embeddedGoldenSetJSON []byte
|
||||
|
||||
// ─── 金标集定义 ──────────────────────────────────────────────
|
||||
|
||||
// GoldenSetItem 单条金标:query + 具体 expected_ids + 关键词相关性判据
|
||||
@@ -19,9 +31,14 @@ type GoldenSetItem struct {
|
||||
Query string `json:"query"`
|
||||
ExpectedIDs []string `json:"expected_ids"`
|
||||
MustIncludeKeywords []string `json:"must_include_keywords"`
|
||||
Category string `json:"category,omitempty"`
|
||||
Difficulty string `json:"difficulty,omitempty"`
|
||||
IDBaseline string `json:"id_baseline,omitempty"`
|
||||
// Namespace 该条目应在哪个 namespace 里召回。为空则用请求传入的 ns。
|
||||
// 为什么必须 per-item(2026-10-14 实测):金标的 expected_id 分散在
|
||||
// hermes-main / domain:HUB / soulful-xiaowei / wiki / shared 等多个 ns,
|
||||
// 而 eval 只按请求里的单一 ns 召回 ⇒ ID 类指标**按构造恒为 0**(不是召回差)。
|
||||
Namespace string `json:"namespace,omitempty"`
|
||||
Category string `json:"category,omitempty"`
|
||||
Difficulty string `json:"difficulty,omitempty"`
|
||||
IDBaseline string `json:"id_baseline,omitempty"`
|
||||
}
|
||||
|
||||
// GoldenSet 金标集
|
||||
@@ -30,15 +47,44 @@ type GoldenSet struct {
|
||||
Items []GoldenSetItem `json:"items"`
|
||||
}
|
||||
|
||||
// LoadGoldenSet 从 testdata/ 加载金标集,支持相对路径(生产用)和绝对路径(测试用)
|
||||
// LoadGoldenSet 加载金标集。路径解析(t_dfc93ad0 AC5,部署 CWD=/home/muc):
|
||||
// 1. env ZHIYI_GOLDEN_SET 指定路径 ⇒ 优先读它(临时替换金标集用,不重编译);
|
||||
// 2. 显式 path 非空且能读到 ⇒ 用它(绝对/相对皆按调用方语义);
|
||||
// 3. path 为空、或上面读不到(典型:部署二进制 CWD=/home/muc 无 testdata/,
|
||||
// 旧版相对路径解析失败 ⇒ 500)⇒ 回落 **内嵌** 基线 embeddedGoldenSetJSON。
|
||||
// 校验(空断言自守)在拿到内容后统一跑,三种来源同口径。
|
||||
func LoadGoldenSet(path string) (*GoldenSet, error) {
|
||||
if path == "" {
|
||||
// 编译后无法直接拿到源码路径,回退到 CWD 的 testdata/
|
||||
path = "testdata/golden-set.json"
|
||||
var data []byte
|
||||
usedSource := "env:ZHIYI_GOLDEN_SET"
|
||||
// 2026-10-26 修正优先级:显式 path > env > 内嵌。
|
||||
// 旧顺序(env 先)导致 ZHIYI_GOLDEN_SET 一旦设置,任何请求传 golden_path 都被静默忽略
|
||||
// ⇒ 实测「传 7 个 chunk 却每块都报 53 条」(env 指向的 53 条集)—— 评测对象与预期不符,
|
||||
// 且指标全是 0 时极难发现。env 现在只作「默认金标」,显式 path 必须能覆盖它。
|
||||
if path != "" {
|
||||
usedSource = "path:" + path
|
||||
d, err := os.ReadFile(path)
|
||||
if err == nil {
|
||||
data = d
|
||||
} else if filepath.IsAbs(path) {
|
||||
// 绝对路径 = 明确指名要跑这套题 ⇒ 读不到必须报错,不许静默换题
|
||||
return nil, fmt.Errorf("读 golden_path 失败(%s): %w", path, err)
|
||||
} else {
|
||||
// 相对路径在部署 CWD 下读不到 ⇒ 内嵌兜底(t_dfc93ad0 AC5 既有行为,保留)
|
||||
data = embeddedGoldenSetJSON
|
||||
usedSource = "embedded"
|
||||
}
|
||||
} else if p := os.Getenv("ZHIYI_GOLDEN_SET"); p != "" {
|
||||
var err error
|
||||
data, err = os.ReadFile(p)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
}
|
||||
} else {
|
||||
data = embeddedGoldenSetJSON
|
||||
usedSource = "embedded"
|
||||
}
|
||||
data, err := os.ReadFile(path)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
if len(data) == 0 {
|
||||
return nil, fmt.Errorf("golden set 不可用(%s 为空且无内嵌基线)", usedSource)
|
||||
}
|
||||
var gs GoldenSet
|
||||
if err := json.Unmarshal(data, &gs); err != nil {
|
||||
@@ -346,13 +392,20 @@ func (ea *EvalAPI) RunGolden(w http.ResponseWriter, r *http.Request) {
|
||||
var req struct {
|
||||
Namespace string `json:"namespace"`
|
||||
GoldenPath string `json:"golden_path"` // 可选,默认 testdata/golden-set.json
|
||||
// AllNamespaces(2026-10-26)跨 namespace 评测开关。
|
||||
// 背景:旧逻辑 ns 为空 ⇒ 强制 "shared",而真实金标分散在 hermes-main/wiki/HUB 等多个 ns
|
||||
// ⇒ 评测跑的是"只看 shared"的召回,与线上跨 ns 召回不是同一个系统(实测前 15 条里 15 条结果不同)。
|
||||
// 语义:true ⇒ ns = ""(全库跨 ns,等同线上默认);false ⇒ 保持旧行为(默认 shared,向后兼容)。
|
||||
AllNamespaces bool `json:"all_namespaces"`
|
||||
}
|
||||
if err := json.NewDecoder(r.Body).Decode(&req); err != nil {
|
||||
respondError(w, 400, "invalid body")
|
||||
return
|
||||
}
|
||||
ns := req.Namespace
|
||||
if ns == "" {
|
||||
if req.AllNamespaces {
|
||||
ns = ""
|
||||
} else if ns == "" {
|
||||
ns = "shared"
|
||||
}
|
||||
gs, err := LoadGoldenSet(req.GoldenPath)
|
||||
@@ -373,13 +426,22 @@ func (ea *EvalAPI) RunGolden(w http.ResponseWriter, r *http.Request) {
|
||||
respondError(w, 400, err.Error())
|
||||
return
|
||||
}
|
||||
// 无关键词判据 → 禁止(会退化成恒真)
|
||||
if len(item.MustIncludeKeywords) == 0 {
|
||||
failures = append(failures, item.Query+": 无关键词判据(禁止退化成恒真)")
|
||||
// 无关键词判据 → 禁止(会退化成恒真)——仅当也没有 expected_ids 时才拒。
|
||||
// 2026-10-26:v4 金标(t_4d42f9c0)是「分级 relevant ids」型,没有关键词;
|
||||
// 对这类条目 keyword 指标记 N/A(不计入 keyword_total),只算 recall/precision/mrr/ndcg,
|
||||
// 别偷偷把它当 keyword 恒真,也别整条丢掉(否则 304 条全被跳过 ⇒ "all golden queries failed")。
|
||||
idOnlyItem := len(item.MustIncludeKeywords) == 0
|
||||
if idOnlyItem && len(item.ExpectedIDs) == 0 {
|
||||
failures = append(failures, item.Query+": 既无关键词也无 expected_ids(无法评测)")
|
||||
continue
|
||||
}
|
||||
|
||||
results, err := ea.Pipeline.Recall(item.Query, ns, 5, 0.5)
|
||||
// per-item namespace:条目自带 ns 优先(金标基线是按 ns 钉的,见 GoldenSetItem.Namespace)
|
||||
itemNS := item.Namespace
|
||||
if itemNS == "" {
|
||||
itemNS = ns
|
||||
}
|
||||
results, err := ea.Pipeline.Recall(item.Query, itemNS, 5, 0.5)
|
||||
if err != nil {
|
||||
failures = append(failures, item.Query+": recall 失败 "+err.Error())
|
||||
keywordFail++
|
||||
@@ -450,13 +512,15 @@ func (ea *EvalAPI) RunGolden(w http.ResponseWriter, r *http.Request) {
|
||||
totalNDCG += dcg / idcg
|
||||
}
|
||||
|
||||
// 关键词统计
|
||||
keywordTotal++
|
||||
if keywordOK {
|
||||
keywordPass++
|
||||
} else {
|
||||
keywordFail++
|
||||
failures = append(failures, item.Query+": 关键词未命中 "+strings.Join(item.MustIncludeKeywords, ","))
|
||||
// 关键词统计(id-only 条目不参与:keyword 记 N/A,避免恒真/恒假)
|
||||
if !idOnlyItem {
|
||||
keywordTotal++
|
||||
if keywordOK {
|
||||
keywordPass++
|
||||
} else {
|
||||
keywordFail++
|
||||
failures = append(failures, item.Query+": 关键词未命中 "+strings.Join(item.MustIncludeKeywords, ","))
|
||||
}
|
||||
}
|
||||
|
||||
queryDetails = append(queryDetails, EvalQueryDetail{
|
||||
|
||||
@@ -10,10 +10,32 @@ import (
|
||||
"net/http"
|
||||
"os"
|
||||
"path/filepath"
|
||||
"strings"
|
||||
"testing"
|
||||
"time"
|
||||
)
|
||||
|
||||
// liveAPIKey 取活服务密钥:优先 env ZHIYI_TEST_API_KEY;否则读密钥文件
|
||||
// /var/lib/memoryweave/.api-key 的主密钥(第 1 个非注释、非 legacy 行);
|
||||
// 再退到旧 dev 键(无生产密钥文件的环境,如 CI)。
|
||||
// 2026-09-21 密钥轮换后,旧硬编码键 zhiyi-dev-key-2026 已 401 —— 全量金标实跑
|
||||
// 永远 SKIP 的根因(t_fa6c9104 修复量具可用性;不改任何判据)。
|
||||
func liveAPIKey() string {
|
||||
if k := os.Getenv("ZHIYI_TEST_API_KEY"); k != "" {
|
||||
return k
|
||||
}
|
||||
if b, err := os.ReadFile("/var/lib/memoryweave/.api-key"); err == nil {
|
||||
for _, line := range strings.Split(string(b), "\n") {
|
||||
line = strings.TrimSpace(line)
|
||||
if line == "" || strings.HasPrefix(line, "#") || strings.HasPrefix(line, "legacy:") {
|
||||
continue
|
||||
}
|
||||
return line
|
||||
}
|
||||
}
|
||||
return "zhiyi-dev-key-2026"
|
||||
}
|
||||
|
||||
// ─── recall 辅助:liveRecallOnce ─────────────────────────────
|
||||
// 一次 recall API 调用同时拿 top-5 的 ids + contents,避免两条 HTTP(限流保护)。
|
||||
// 每次调用间加 200ms 间隔,由调用方负责(TestEvalGolden_Live 里 sleep)。
|
||||
@@ -38,7 +60,7 @@ func liveRecallOnce(query string, maxRetries int, retryWait time.Duration) recal
|
||||
}
|
||||
req, _ := http.NewRequest("POST", "http://127.0.0.1:7821/api/v1/recall", bytes.NewReader(payload))
|
||||
req.Header.Set("Content-Type", "application/json")
|
||||
req.Header.Set("X-API-Key", "zhiyi-dev-key-2026")
|
||||
req.Header.Set("X-API-Key", liveAPIKey())
|
||||
resp, err := http.DefaultClient.Do(req)
|
||||
if err != nil {
|
||||
lastErr = fmt.Errorf("HTTP 请求失败: %v", err)
|
||||
@@ -218,13 +240,49 @@ func TestLoadGoldenSet_RejectsVacuousIDs(t *testing.T) {
|
||||
}
|
||||
}
|
||||
|
||||
// t_dfc93ad0 AC5 回归:部署二进制 CWD=/home/muc(无 testdata/),
|
||||
// POST /api/v1/eval/golden 不传 golden_path 时,旧版「相对 testdata/ 读不到」⇒ 500。
|
||||
// 修复后:缺省路径 / 读不到的路径 ⇒ 回落 **内嵌** 基线(//go:embed),仍可用。
|
||||
// 判据(可复算):在**没有 testdata/ 的 CWD** 里 LoadGoldenSet("") 与
|
||||
// LoadGoldenSet("testdata/golden-set.json")(相对路径读不到)都必须成功
|
||||
// 且返回 14 条 —— 即部署态「缺省命令可用」。
|
||||
func TestLoadGoldenSet_EmbedFallback_DeployCWD(t *testing.T) {
|
||||
empty := t.TempDir() // 模拟部署 CWD:里面没有 testdata/
|
||||
orig, err := os.Getwd()
|
||||
if err != nil {
|
||||
t.Fatalf("取 CWD 失败: %v", err)
|
||||
}
|
||||
if err := os.Chdir(empty); err != nil {
|
||||
t.Fatalf("chdir 到空目录失败: %v", err)
|
||||
}
|
||||
t.Cleanup(func() { _ = os.Chdir(orig) })
|
||||
|
||||
// ① 缺省(path=""):不传 golden_path 的部署态 ⇒ 必须成功 + 14 条(内嵌兜底)
|
||||
gs, err := LoadGoldenSet("")
|
||||
if err != nil {
|
||||
t.Fatalf("✗ AC5:缺省路径加载金标集失败(旧版这里 500): %v", err)
|
||||
}
|
||||
if len(gs.Items) != 14 {
|
||||
t.Fatalf("✗ AC5:内嵌基线期望 14 条,实际 %d", len(gs.Items))
|
||||
}
|
||||
// ② 相对路径读不到(部署 CWD 无 testdata/):也回落内嵌,不 500
|
||||
gs2, err := LoadGoldenSet(filepath.Join("testdata", "golden-set.json"))
|
||||
if err != nil {
|
||||
t.Fatalf("✗ AC5:相对路径读不到时应回落内嵌基线而非报错: %v", err)
|
||||
}
|
||||
if len(gs2.Items) != 14 {
|
||||
t.Fatalf("✗ AC5:回落基线期望 14 条,实际 %d", len(gs2.Items))
|
||||
}
|
||||
t.Logf("✓ AC5:空 CWD(无 testdata/)下 缺省/相对路径 均回落内嵌基线(14 条),部署态缺省命令可用")
|
||||
}
|
||||
|
||||
// ─── AC① 反证:故意把某条 expected_id 改成错误 ID → 该条必须 FAIL ───
|
||||
// 这是本卡核心验收点:证明判据非恒真(改错期望 → 真 FAIL)
|
||||
|
||||
func TestEvalGolden_CounterEvidence(t *testing.T) {
|
||||
// 探活 zhiyid(无服务 → 跳过)
|
||||
healthReq, _ := http.NewRequest("GET", "http://127.0.0.1:7821/api/v1/health", nil)
|
||||
healthReq.Header.Set("X-API-Key", "zhiyi-dev-key-2026")
|
||||
healthReq.Header.Set("X-API-Key", liveAPIKey())
|
||||
resp, err := http.DefaultClient.Do(healthReq)
|
||||
if err != nil || resp == nil {
|
||||
t.Skipf("zhiyid 服务不可达(%v),跳过反证测试", err)
|
||||
@@ -300,7 +358,7 @@ func TestEvalGolden_CounterEvidence(t *testing.T) {
|
||||
func TestEvalGolden_Live(t *testing.T) {
|
||||
// 探活 zhiyid(无服务 → 跳过,不污染 CI)
|
||||
healthReq, _ := http.NewRequest("GET", "http://127.0.0.1:7821/api/v1/health", nil)
|
||||
healthReq.Header.Set("X-API-Key", "zhiyi-dev-key-2026")
|
||||
healthReq.Header.Set("X-API-Key", liveAPIKey())
|
||||
resp, err := http.DefaultClient.Do(healthReq)
|
||||
if err != nil || resp == nil {
|
||||
t.Skipf("zhiyid 服务不可达(%v),跳过全量金标实跑", err)
|
||||
|
||||
@@ -23,6 +23,11 @@ func NewFeedbackAPI(ldb storage.LanceDB) *FeedbackAPI {
|
||||
func (fa *FeedbackAPI) MarkUseful(w http.ResponseWriter, r *http.Request) {
|
||||
var req struct {
|
||||
MemoryID string `json:"memory_id"`
|
||||
// 2026-10-24 (t_11245d30):区分人机信号。
|
||||
// 空 = 人工点「有用」(保持 user_feedback,行为不变);
|
||||
// "auto" = 插件自动反馈(_auto_feedback_for_reply)→ 记 auto_feedback,让 V 账可辨「牧尘认可 vs 机器自评」。
|
||||
// 纯观测,不改 V 权重/阈值/上限。
|
||||
Source string `json:"source"`
|
||||
}
|
||||
if err := json.NewDecoder(r.Body).Decode(&req); err != nil {
|
||||
respondError(w, 400, "invalid body")
|
||||
@@ -34,11 +39,15 @@ func (fa *FeedbackAPI) MarkUseful(w http.ResponseWriter, r *http.Request) {
|
||||
}
|
||||
|
||||
selfoptimize.Dash.RecordFeedback(true)
|
||||
// V 值:useful = success
|
||||
// V 值:useful = success。action 名按来源区分(人工 user_feedback / 自动 auto_feedback)。
|
||||
action := "user_feedback"
|
||||
if req.Source == "auto" {
|
||||
action = "auto_feedback"
|
||||
}
|
||||
selfoptimize.VProp.RecordDecision(
|
||||
"useful_"+req.MemoryID,
|
||||
[]string{req.MemoryID},
|
||||
"user_feedback", "success", "",
|
||||
action, "success", "",
|
||||
)
|
||||
if err := fa.LanceDB.IncrementUseful(req.MemoryID); err != nil {
|
||||
log.Printf("[feedback] IncrementUseful failed %s: %v", req.MemoryID, err)
|
||||
|
||||
@@ -0,0 +1,143 @@
|
||||
// Package routes — 遗忘保护守卫端到端回归测试(t_944344b5,AC1/AC2)。
|
||||
//
|
||||
// 2026-10-16 (t_944344b5):证明「decay/auto_forget 的判定道(admin Forget 路由)命中保护
|
||||
// 规则的候选**不被** SoftDelete,而非保护的衰减候选**照常**被软删」。
|
||||
//
|
||||
// 必须走**真实判定路径**(routes.NewAdminAPI.Forget),不能只测 memprotect.IsProtected,
|
||||
// 因为守卫是在 decay 循环 / admin Forget 路由里 SoftDelete 之前拦截的(见 server.go / admin.go)。
|
||||
//
|
||||
// 跑法(A/B 纪律:复制数据目录 + 独立 socket,绝不碰生产 /var/lib/memoryweave):
|
||||
// 1. cp -a /var/lib/memoryweave /tmp/mw-prot-copy-<ts>
|
||||
// 2. zhiyi-consolidate --mode socket --socket /tmp/mw-prot.sock \
|
||||
// --data-dir /tmp/mw-prot-copy-<ts> &
|
||||
// 3. PROT_TEST_SOCK=/tmp/mw-prot.sock \
|
||||
// go test ./internal/api/routes/ -run TestForgetGuardE2E -v -count=1
|
||||
//
|
||||
// 未设 PROT_TEST_SOCK → 自动跳过(可安全留在 CI)。
|
||||
package routes_test
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http"
|
||||
"net/http/httptest"
|
||||
"os"
|
||||
"testing"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/api/routes"
|
||||
)
|
||||
|
||||
func TestForgetGuardE2E(t *testing.T) {
|
||||
sock := os.Getenv("PROT_TEST_SOCK")
|
||||
if sock == "" {
|
||||
t.Skip("PROT_TEST_SOCK 未设置,跳过(需先起 test sidecar 指向复制的数据目录)")
|
||||
}
|
||||
|
||||
// 让遗忘窗口游标指到临时文件(缺失 → 空游标 → 从最小 id 起轮转),
|
||||
// 保证我们构造的 `mem_0...` 行(id 最小)落在首个 2000 窗口内。
|
||||
// 不碰生产 /var/lib/memoryweave/forget-cursor.json。
|
||||
cursorDir := t.TempDir()
|
||||
cursorFile := cursorDir + "/test-forget-cursor.json"
|
||||
t.Setenv("ZHIYI_FORGET_CURSOR", cursorFile)
|
||||
|
||||
// embedder 传 nil:记录自带 1024 维 Vector,走不到编码分支(同 conf_e2e_test.go 做法)。
|
||||
rc := storage.NewRustLanceDBClient(sock, nil)
|
||||
f := governance.NewForgetter()
|
||||
aa := routes.NewAdminAPI(rc, f, nil) // GraphStore 传 nil:extractTopEntityDegree 空安全
|
||||
|
||||
// ── 构造 4 条测试记忆(id 都以 mem_0 开头 → 字典序最小 → 必在首窗口)──
|
||||
vec := make([]float32, 1024)
|
||||
for i := range vec {
|
||||
vec[i] = 0.001
|
||||
}
|
||||
now := time.Now().UTC()
|
||||
mk := func(id, category, content, freshness string, daysAgo int) models.MemoryRecord {
|
||||
lr := now.Add(-time.Duration(daysAgo) * 24 * time.Hour)
|
||||
return models.MemoryRecord{
|
||||
ID: id, AgentID: "hermes-a06", Namespace: "prot-test",
|
||||
Content: content, Category: category, Vector: vec,
|
||||
Tier: "normal", Importance: 0.5, QualityScore: 0.5,
|
||||
Version: 1, Freshness: freshness,
|
||||
Source: "wiki:/tmp/forget-guard-e2e.md",
|
||||
EmbeddingModel: "bge-m3", ScriptVersion: "forget-guard-e2e",
|
||||
CreatedAt: lr, UpdatedAt: lr, LastRecalledAt: lr,
|
||||
RecallVerifiedCount: 0,
|
||||
}
|
||||
}
|
||||
|
||||
// P1:规则3 freshness=verified 保护。content <30 字 + >20 天 ⇒ 本应走碎片快速道被删,
|
||||
// 但 freshness=verified ⇒ 守卫拦截 ⇒ 存活。
|
||||
p1 := mk("mem_0aaaa_p1", "distilled", "verified fact, kept", "verified", 30)
|
||||
// P2:规则1 category=decision 保护。
|
||||
p2 := mk("mem_0aaaa_p2", "decision", "short decision note", "fresh", 30)
|
||||
// P3:规则4 content 关键词「牧尘要求」保护。
|
||||
p3 := mk("mem_0aaaa_p3", "distilled", "牧尘要求:部署前必须先备份", "fresh", 30)
|
||||
// N1:不命中任何规则(distilled / fresh / 无关键词 / 低 V / 不在名单)⇒ 应被碎片快速道软删。
|
||||
n1 := mk("mem_0aaaa_n1", "distilled", "hi", "fresh", 45)
|
||||
|
||||
for _, m := range []models.MemoryRecord{p1, p2, p3, n1} {
|
||||
if err := rc.InsertMemory(m); err != nil {
|
||||
t.Fatalf("InsertMemory(%s) 失败: %v", m.ID, err)
|
||||
}
|
||||
}
|
||||
|
||||
// ── 跑真实判定路径:admin Forget 路由(= decay/auto_forget 决策 + 守卫 + SoftDelete)──
|
||||
req := httptest.NewRequest(http.MethodPost, "/api/v1/admin/forget", nil)
|
||||
w := httptest.NewRecorder()
|
||||
aa.Forget(w, req)
|
||||
if w.Code != http.StatusOK {
|
||||
t.Fatalf("admin forget expected 200, got %d: %s", w.Code, w.Body.String())
|
||||
}
|
||||
var resp map[string]interface{}
|
||||
json.Unmarshal(w.Body.Bytes(), &resp)
|
||||
t.Logf("admin forget 响应: %v", resp)
|
||||
|
||||
// ── 断言 ──
|
||||
// 读路径语义(rust lancedb_ops.rs):
|
||||
// scan_all → 仅 is_deleted=false(存活集,无 5000 上限)
|
||||
// scan_deleted → 仅 is_deleted=true(已删集,带 delete_reason)
|
||||
// 故 P1/P2/P3 应出现在 ScanAll 里;N1 应不在 ScanAll、而在 ScanDeleted 里。
|
||||
all, err := rc.ScanAll()
|
||||
if err != nil {
|
||||
t.Fatalf("ScanAll 失败: %v", err)
|
||||
}
|
||||
liveSet := map[string]bool{}
|
||||
for _, m := range all {
|
||||
liveSet[m.ID] = true // scan_all 只回 is_deleted=false
|
||||
}
|
||||
for _, id := range []string{p1.ID, p2.ID, p3.ID} {
|
||||
if !liveSet[id] {
|
||||
t.Errorf("❌ 受保护记忆 %s 应存活(ScanAll 命中),实际不在 —— 守卫失效", id)
|
||||
}
|
||||
}
|
||||
if liveSet[n1.ID] {
|
||||
t.Errorf("❌ 非保护衰减记忆 %s 应被软删(不在 ScanAll),实际仍存活 —— 回归异常", n1.ID)
|
||||
}
|
||||
|
||||
deleted, derr := rc.ScanDeleted()
|
||||
if derr != nil {
|
||||
t.Fatalf("ScanDeleted 失败: %v", derr)
|
||||
}
|
||||
deletedSet, n1Reason := map[string]bool{}, ""
|
||||
for _, m := range deleted {
|
||||
deletedSet[m.ID] = true
|
||||
if m.ID == n1.ID {
|
||||
n1Reason = m.DeleteReason
|
||||
}
|
||||
}
|
||||
if !deletedSet[n1.ID] {
|
||||
t.Errorf("❌ 非保护衰减记忆 %s 应出现在 ScanDeleted(is_deleted=true),实际不在", n1.ID)
|
||||
}
|
||||
if t.Failed() {
|
||||
return
|
||||
}
|
||||
// 受保护 3 条存活 + 非保护 1 条被删,打印结论
|
||||
t.Logf("✅ AC1 3 条命中保护规则(freshness=verified / category=decision / 关键词)全部存活于 ScanAll")
|
||||
t.Logf("✅ AC2 非保护衰减碎片 %s 照常软删(在 ScanDeleted)", n1.ID)
|
||||
// 取证:N1 的 delete_reason(auto_forget*/fragment 经 NormalizeDeleteReason → retention)
|
||||
t.Logf("取证: %s delete_reason=%q", n1.ID, n1Reason)
|
||||
}
|
||||
@@ -4,6 +4,7 @@ package routes
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http"
|
||||
"strings"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/selfoptimize"
|
||||
)
|
||||
@@ -32,17 +33,31 @@ func (ga *GapAPI) List(w http.ResponseWriter, r *http.Request) {
|
||||
})
|
||||
}
|
||||
|
||||
// POST /api/v1/gaps/{topic}/close
|
||||
// POST /api/v1/gaps/close/{topic}(现行前缀注册 /api/v1/gaps/close/;亦兼容 {topic} 通配注册)
|
||||
func (ga *GapAPI) Close(w http.ResponseWriter, r *http.Request) {
|
||||
topic := r.PathValue("topic")
|
||||
if topic == "" {
|
||||
// 现行注册是前缀路由(模式无 {topic} 通配 ⇒ PathValue 恒为 "",端点此前恒 400):
|
||||
// 回落剥前缀取 topic。若日后改注册为 /api/v1/gaps/{topic}/close,PathValue 直接命中。
|
||||
const prefix = "/api/v1/gaps/close/"
|
||||
if strings.HasPrefix(r.URL.Path, prefix) {
|
||||
topic = r.URL.Path[len(prefix):]
|
||||
}
|
||||
}
|
||||
if topic == "" {
|
||||
respondError(w, 400, "topic required")
|
||||
return
|
||||
}
|
||||
|
||||
ga.Detector.Close(topic)
|
||||
selfoptimize.Dash.RecordGapClosed()
|
||||
respond(w, 200, map[string]string{"status": "closed", "topic": topic})
|
||||
// t_e5997ca4:计数口径 = 「缺口个数」。+1 只发生在 GapDetector 的 open→closed 迁移点
|
||||
// (Close 内部);旧的无条件 selfoptimize.Dash.RecordGapClosed() 已删除 —— 那是同一
|
||||
// 缺口可被无限计数、ClosedGaps(9) 越过 TotalGaps(2) 的写侧根因 #1。
|
||||
switch ga.Detector.Close(topic) {
|
||||
case true:
|
||||
respond(w, 200, map[string]string{"status": "closed", "topic": topic})
|
||||
default:
|
||||
respond(w, 200, map[string]string{"status": "already_closed", "topic": topic})
|
||||
}
|
||||
}
|
||||
|
||||
// POST /api/v1/gaps/detect — 手动触发缺口检测(miss 计数)
|
||||
|
||||
@@ -0,0 +1,112 @@
|
||||
// 织忆 MemoryWeave — gap 关闭端点写侧回归(t_e5997ca4 卡 AC2)
|
||||
//
|
||||
// POST /close 打两回(httptest)⇒ gap 计数器只 +1;auto 等其余计数器不受影响。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"io"
|
||||
"net/http"
|
||||
"net/http/httptest"
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/selfoptimize"
|
||||
)
|
||||
|
||||
// makeGapTopic 3 次 miss 命中默认阈值 3 ⇒ 生成缺口(TotalGaps +1)。
|
||||
func makeGapTopic(t *testing.T, gd *selfoptimize.GapDetector, topic string) {
|
||||
t.Helper()
|
||||
var gap *selfoptimize.Gap
|
||||
for i := 0; i < 3; i++ {
|
||||
if gap = gd.RecordMiss(topic); gap != nil {
|
||||
break
|
||||
}
|
||||
}
|
||||
if gap == nil {
|
||||
t.Fatalf("expected gap for %q after 3 misses", topic)
|
||||
}
|
||||
}
|
||||
|
||||
func postGapClose(t *testing.T, url string) (int, map[string]string) {
|
||||
t.Helper()
|
||||
resp, err := http.Post(url, "application/json", nil)
|
||||
if err != nil {
|
||||
t.Fatalf("POST %s: %v", url, err)
|
||||
}
|
||||
defer resp.Body.Close()
|
||||
var body map[string]string
|
||||
if err := json.NewDecoder(resp.Body).Decode(&body); err != nil {
|
||||
b, _ := io.ReadAll(resp.Body)
|
||||
t.Fatalf("POST %s: 非 JSON 响应 %q: %v", url, b, err)
|
||||
}
|
||||
return resp.StatusCode, body
|
||||
}
|
||||
|
||||
// 卡 AC2:现行注册形态(前缀路由,topic 在 /api/v1/gaps/close/ 之后)打两回 ⇒ 只 +1。
|
||||
func TestGapAPI_CloseTwice_CounterOnlyOnce(t *testing.T) {
|
||||
gd := selfoptimize.NewGapDetector(nil, nil)
|
||||
makeGapTopic(t, gd, "close-twice-topic")
|
||||
|
||||
baseClosed := selfoptimize.Dash.ClosedGapsCount()
|
||||
baseTotal := selfoptimize.Dash.TotalGapsCount()
|
||||
baseMetrics := selfoptimize.Dash.Metrics() // auto_* 快照(应不受影响)
|
||||
|
||||
api := NewGapAPI(gd)
|
||||
mux := http.NewServeMux()
|
||||
mux.HandleFunc("/api/v1/gaps/close/", api.Close) // 与 server.go:1205 现行注册同形
|
||||
ts := httptest.NewServer(mux)
|
||||
defer ts.Close()
|
||||
|
||||
code1, body1 := postGapClose(t, ts.URL+"/api/v1/gaps/close/close-twice-topic")
|
||||
if code1 != 200 || body1["status"] != "closed" {
|
||||
t.Fatalf("第 1 次 POST: got %d %v, want 200 closed", code1, body1)
|
||||
}
|
||||
code2, body2 := postGapClose(t, ts.URL+"/api/v1/gaps/close/close-twice-topic")
|
||||
if code2 != 200 || body2["status"] != "already_closed" {
|
||||
t.Fatalf("第 2 次 POST: got %d %v, want 200 already_closed(不得再动计数)", code2, body2)
|
||||
}
|
||||
|
||||
if got := selfoptimize.Dash.ClosedGapsCount() - baseClosed; got != 1 {
|
||||
t.Fatalf("2× POST close 后 ClosedGaps 增量: got %d, want 1(改前为 +3 ⇒ 虚增)", got)
|
||||
}
|
||||
if got := selfoptimize.Dash.TotalGapsCount(); got != baseTotal {
|
||||
t.Errorf("TotalGaps 不应被 close 端点移动: got %d want %d", got, baseTotal)
|
||||
}
|
||||
|
||||
after := selfoptimize.Dash.Metrics()
|
||||
if after["gap_closure_rate"] > 1 {
|
||||
t.Errorf("gap_closure_rate = %f 越界", after["gap_closure_rate"])
|
||||
}
|
||||
// auto(冲突)计数器与 gap 关闭事件无关 ⇒ 快照不变(「auto 不适用」)
|
||||
for _, k := range []string{"auto_resolve_rate", "auto_resolve_samples", "auto_resolve_valid"} {
|
||||
if after[k] != baseMetrics[k] {
|
||||
t.Errorf("auto 计数器被 gap 关闭污染: %s got %f want %f", k, after[k], baseMetrics[k])
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// {topic} 通配注册形态(若日后把 server.go 注册改成 /api/v1/gaps/{topic}/close):
|
||||
// PathValue 直接命中,计数语义不变(+1 只在首次)。
|
||||
func TestGapAPI_CloseWildcardRegistration(t *testing.T) {
|
||||
gd := selfoptimize.NewGapDetector(nil, nil)
|
||||
makeGapTopic(t, gd, "wildcard-topic")
|
||||
|
||||
baseClosed := selfoptimize.Dash.ClosedGapsCount()
|
||||
|
||||
api := NewGapAPI(gd)
|
||||
mux := http.NewServeMux()
|
||||
mux.HandleFunc("/api/v1/gaps/{topic}/close", api.Close)
|
||||
ts := httptest.NewServer(mux)
|
||||
defer ts.Close()
|
||||
|
||||
code, body := postGapClose(t, ts.URL+"/api/v1/gaps/wildcard-topic/close")
|
||||
if code != 200 || body["status"] != "closed" {
|
||||
t.Fatalf("通配注册第 1 次 POST: got %d %v, want 200 closed", code, body)
|
||||
}
|
||||
if _, body2 := postGapClose(t, ts.URL+"/api/v1/gaps/wildcard-topic/close"); body2["status"] != "already_closed" {
|
||||
t.Errorf("通配注册第 2 次 POST: got %v, want already_closed", body2)
|
||||
}
|
||||
if got := selfoptimize.Dash.ClosedGapsCount() - baseClosed; got != 1 {
|
||||
t.Fatalf("通配注册 2× POST 后 ClosedGaps 增量: got %d, want 1", got)
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,152 @@
|
||||
package routes
|
||||
|
||||
// t_15d82af7 ghost-ns 修复的路由层终审用例(裁定 C):
|
||||
// 显式 namespace 在全量表里没有行(ghost)时,/api/v1/recall 必须返回 0 条 ——
|
||||
// 主路径(recall.go 的 ScanAll 判据)与两条补充通道(E4.2 shared /
|
||||
// wiki-curator-main)都不得把 ghost 查询洗成 shared/wiki 结果。
|
||||
// 真实 ns 的 wiki 补充语义必须保持。
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http"
|
||||
"net/http/httptest"
|
||||
"strings"
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// nsAwareRecallLance:模拟生产实态的数据源。
|
||||
// - ScanAll 返回全量存活行(ghost 判据 = 该 ns 是否在行集里);
|
||||
// - Search 复刻生产:sidecar only_if 失效后由客户端同款解包过滤
|
||||
// `if namespaceFilter != "" && r.Namespace != namespaceFilter continue`
|
||||
// (lancedb_ipc.go:311),其余方法复用同包 fakeLanceDB。
|
||||
type nsAwareRecallLance struct {
|
||||
fakeLanceDB
|
||||
rows []models.MemoryRecord
|
||||
}
|
||||
|
||||
func (f *nsAwareRecallLance) ScanAll() ([]models.MemoryRecord, error) {
|
||||
return f.rows, nil
|
||||
}
|
||||
|
||||
// GetRecordByID t_0f1d7be9(原文层):fake 默认不存在。
|
||||
func (f *nsAwareRecallLance) GetRecordByID(table, id string) (*models.MemoryRecord, error) {
|
||||
return nil, nil
|
||||
}
|
||||
|
||||
func (f *nsAwareRecallLance) Search(table string, vector []float32, topK int, namespaceFilter string) ([]models.MemoryRecord, error) {
|
||||
var out []models.MemoryRecord
|
||||
for _, r := range f.rows {
|
||||
// 客户端同款解包过滤(与 lancedb_ipc.go:311 同口径)。
|
||||
if namespaceFilter != "" && r.Namespace != namespaceFilter {
|
||||
continue
|
||||
}
|
||||
out = append(out, r)
|
||||
}
|
||||
if topK > 0 && len(out) > topK {
|
||||
out = out[:topK]
|
||||
}
|
||||
return out, nil
|
||||
}
|
||||
|
||||
// fakeEmbedServer 提供确定性的 OpenAI 兼容 embeddings 响应(免依赖生产 embedder)。
|
||||
func fakeEmbedServer(t *testing.T) *httptest.Server {
|
||||
t.Helper()
|
||||
srv := httptest.NewServer(http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) {
|
||||
var req struct {
|
||||
Input []string `json:"input"`
|
||||
}
|
||||
_ = json.NewDecoder(r.Body).Decode(&req)
|
||||
type item struct {
|
||||
Embedding []float64 `json:"embedding"`
|
||||
}
|
||||
resp := struct {
|
||||
Data []item `json:"data"`
|
||||
}{}
|
||||
for range req.Input {
|
||||
v := make([]float64, 1024)
|
||||
v[0] = 1
|
||||
resp.Data = append(resp.Data, item{Embedding: v})
|
||||
}
|
||||
_ = json.NewEncoder(w).Encode(resp)
|
||||
}))
|
||||
t.Cleanup(srv.Close)
|
||||
return srv
|
||||
}
|
||||
|
||||
func runRecallHTTP(t *testing.T, db storage.LanceDB, body string) (int, map[string]interface{}) {
|
||||
t.Helper()
|
||||
saved := storage.SearchCacheInstance
|
||||
storage.SearchCacheInstance = nil
|
||||
t.Cleanup(func() { storage.SearchCacheInstance = saved })
|
||||
|
||||
srv := fakeEmbedServer(t)
|
||||
emb := storage.NewEmbedder(srv.URL)
|
||||
rerank := storage.NewReranker("", emb)
|
||||
api := NewAPI(db, emb, rerank, nil, governance.NewInMemoryGraph())
|
||||
req := httptest.NewRequest("POST", "/api/v1/recall", strings.NewReader(body))
|
||||
w := httptest.NewRecorder()
|
||||
api.Recall(w, req)
|
||||
var m map[string]interface{}
|
||||
_ = json.Unmarshal(w.Body.Bytes(), &m)
|
||||
return w.Code, m
|
||||
}
|
||||
|
||||
func resultIDSet(m map[string]interface{}) map[string]string {
|
||||
out := map[string]string{}
|
||||
raw, _ := m["results"].([]interface{})
|
||||
for _, x := range raw {
|
||||
r, _ := x.(map[string]interface{})
|
||||
id, _ := r["id"].(string)
|
||||
ns, _ := r["namespace"].(string)
|
||||
out[id] = ns
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
// TestGhostNS_HandlerReturnsZero:ghost ns 走完整 handler 路径 ⇒ HTTP 200 + 0 条。
|
||||
// 语料只在 shared / wiki-curator-main 有货 ⇒ 任何一条返回都只可能来自
|
||||
// 主召回无条件并 shared(根因2)或 wiki 补充通道(裁定 C)。
|
||||
func TestGhostNS_HandlerReturnsZero(t *testing.T) {
|
||||
db := &nsAwareRecallLance{rows: []models.MemoryRecord{
|
||||
{ID: "sh_1", Namespace: "shared", Category: "distilled", Content: "共享事实一"},
|
||||
{ID: "sh_2", Namespace: "shared", Category: "distilled", Content: "共享事实二"},
|
||||
{ID: "wiki_1", Namespace: "wiki-curator-main", Category: "distilled", Content: "笔记知识一"},
|
||||
{ID: "wiki_2", Namespace: "wiki-curator-main", Category: "distilled", Content: "笔记知识二"},
|
||||
}}
|
||||
code, m := runRecallHTTP(t, db, `{"query":"ghost ns 终审探针","limit":5,"namespace":"ghost-ns-2026-11"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("HTTP=%d body=%v", code, m)
|
||||
}
|
||||
ids := resultIDSet(m)
|
||||
if len(ids) != 0 {
|
||||
t.Fatalf("✗ ghost ns 应 0 条,实际 %d:%v", len(ids), ids)
|
||||
}
|
||||
if cnt, _ := m["count"].(float64); cnt != 0 {
|
||||
t.Fatalf("✗ count=%v want 0", m["count"])
|
||||
}
|
||||
t.Logf("ghost ns 完整 handler 路径:HTTP 200 count=0 ✓")
|
||||
}
|
||||
|
||||
// TestRealNS_HandlerStillSupplementsWiki:对照 —— 真实 ns 的 wiki 补充语义不变。
|
||||
func TestRealNS_HandlerStillSupplementsWiki(t *testing.T) {
|
||||
db := &nsAwareRecallLance{rows: []models.MemoryRecord{
|
||||
{ID: "own_1", Namespace: "hermes-main", Category: "distilled", Content: "本域事实一"},
|
||||
{ID: "wiki_1", Namespace: "wiki-curator-main", Category: "distilled", Content: "笔记知识一"},
|
||||
}}
|
||||
code, m := runRecallHTTP(t, db, `{"query":"真实 ns 对照探针","limit":5,"namespace":"hermes-main"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("HTTP=%d body=%v", code, m)
|
||||
}
|
||||
ids := resultIDSet(m)
|
||||
if _, ok := ids["own_1"]; !ok {
|
||||
t.Fatalf("✗ 真实 ns 主结果缺失:%v", ids)
|
||||
}
|
||||
if _, ok := ids["wiki_1"]; !ok {
|
||||
t.Fatalf("✗ 真实 ns 的 wiki 补充被误伤:%v", ids)
|
||||
}
|
||||
t.Logf("真实 ns:主结果 + wiki 补充均在 ✓ %v", ids)
|
||||
}
|
||||
@@ -17,6 +17,9 @@ var sidecarHealthCheck = consolidate.HealthCheck
|
||||
// 深健康检查:不仅报告自身存活,还探测 IPC sidecar 是否可达。
|
||||
// 背景(2026-10-08 故障):sidecar 异常时 /health 仍返回 200 —— "假绿",
|
||||
// 使部署失败被静默数小时,只能靠 pgrep 才发现。深检查把依赖故障暴露为 503。
|
||||
//
|
||||
// t_10757bd5 AC4:整合链路健康(连续失败 ≥3 或 2h 无成功)⇒ status=degraded,
|
||||
// 消除「侧车 TCP 可达但整合链路静默失败 55 次/日」的假绿根因。
|
||||
func HandleHealth(w http.ResponseWriter, r *http.Request) {
|
||||
if r.Method != http.MethodGet {
|
||||
http.Error(w, `{"error":"method not allowed"}`, http.StatusMethodNotAllowed)
|
||||
@@ -25,22 +28,42 @@ func HandleHealth(w http.ResponseWriter, r *http.Request) {
|
||||
|
||||
w.Header().Set("Content-Type", "application/json")
|
||||
|
||||
body := map[string]string{
|
||||
"status": "ok",
|
||||
"service": "zhiyid",
|
||||
"version": "0.1.0",
|
||||
}
|
||||
|
||||
// 先探测 sidecar(失败 ⇒ 503 degraded,与 10-08 修复保持一致)
|
||||
if err := sidecarHealthCheck(); err != nil {
|
||||
body["status"] = "degraded"
|
||||
body["sidecar"] = "unreachable"
|
||||
body["error"] = err.Error()
|
||||
body := map[string]string{
|
||||
"status": "degraded",
|
||||
"service": "zhiyid",
|
||||
"sidecar": "unreachable",
|
||||
"error": err.Error(),
|
||||
}
|
||||
w.WriteHeader(http.StatusServiceUnavailable)
|
||||
json.NewEncoder(w).Encode(body)
|
||||
return
|
||||
}
|
||||
body["sidecar"] = "ok"
|
||||
|
||||
w.WriteHeader(http.StatusOK)
|
||||
// t_10757bd5:查整合 tracker(内存态,无锁开销 <1ms)
|
||||
tracker := GetConsolTracker()
|
||||
consolStatus, consolFails, sinceSuccess, lastErr := tracker.HealthStatus()
|
||||
_, consolSkips, lastSkip, _ := tracker.Snapshot()
|
||||
|
||||
body := map[string]interface{}{
|
||||
"status": consolStatus,
|
||||
"service": "zhiyid",
|
||||
"sidecar": "ok",
|
||||
"consolidate": map[string]interface{}{
|
||||
"status": consolStatus,
|
||||
"consec_failures": consolFails,
|
||||
"skipped": consolSkips,
|
||||
"last_skip": lastSkip,
|
||||
"last_success_age": sinceSuccess.String(),
|
||||
"last_error": lastErr,
|
||||
},
|
||||
}
|
||||
|
||||
if consolStatus != "ok" {
|
||||
w.WriteHeader(http.StatusServiceUnavailable)
|
||||
} else {
|
||||
w.WriteHeader(http.StatusOK)
|
||||
}
|
||||
json.NewEncoder(w).Encode(body)
|
||||
}
|
||||
|
||||
@@ -0,0 +1,92 @@
|
||||
// 织忆 MemoryWeave — 原文层下钻端点(t_0f1d7be9)
|
||||
//
|
||||
// GET /api/v1/memory/{id}/raw — 按记忆 id 取回蒸馏来源的原始 episode 文本。
|
||||
// 三态语义(AC1 要求可区分,禁 404 混淆):
|
||||
// - 记忆存在且有 derived_from 且 episode 可取回 ⇒ 200 {id, raw_text, source, created_at, episode_id}
|
||||
// - 记忆存在但无 derived_from(或指针指向不存在的 episode)⇒ 200 {id, raw_text: null, reason: ...}
|
||||
// reason ∈ {"no_provenance","episode_missing"} —— 不是 404
|
||||
// - 记忆不存在 ⇒ 404 {"error":{"code":"memory_not_found",...}}
|
||||
// - 存储后端故障 ⇒ 503(不静默吞错,t_4c810e02 静默 no-op 教训)
|
||||
//
|
||||
// 只读端点:不写库、不碰缓存(本卡明令不加缓存)。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"net/http"
|
||||
"strings"
|
||||
)
|
||||
|
||||
// maxRawTextRunes raw_text 返回上限(rune 计,中文安全)。episode 普遍 <2000;
|
||||
// 超长截断并置 raw_text_truncated=true(不静默截半句话当真话)。
|
||||
const maxRawTextRunes = 4000
|
||||
|
||||
// MemoryRaw GET /api/v1/memory/{id}/raw
|
||||
func (a *API) MemoryRaw(w http.ResponseWriter, r *http.Request) {
|
||||
if r.Method != http.MethodGet {
|
||||
respondError(w, 405, "method not allowed")
|
||||
return
|
||||
}
|
||||
if a.LanceDB == nil {
|
||||
respondErrorSchema(w, 503, "storage_unavailable", "storage backend unavailable", 0)
|
||||
return
|
||||
}
|
||||
id := r.PathValue("id")
|
||||
if id == "" {
|
||||
// 兜底:非模式路由(注册方手动解析路径)时从 URL 取
|
||||
id = strings.TrimSuffix(strings.TrimPrefix(r.URL.Path, "/api/v1/memory/"), "/raw")
|
||||
}
|
||||
if id == "" {
|
||||
respondError(w, 400, "id required")
|
||||
return
|
||||
}
|
||||
|
||||
mem, err := a.LanceDB.GetRecordByID("memories", id)
|
||||
if err != nil {
|
||||
respondErrorSchema(w, 503, "storage_error", "get memory failed: "+err.Error(), 0)
|
||||
return
|
||||
}
|
||||
if mem == nil {
|
||||
respondErrorSchema(w, 404, "memory_not_found", "memory id not found: "+id, 0)
|
||||
return
|
||||
}
|
||||
|
||||
base := map[string]interface{}{
|
||||
"id": mem.ID,
|
||||
"derived_from": mem.DerivedFrom,
|
||||
"memory_created": mem.CreatedAt.Format("2006-01-02T15:04:05Z07:00"),
|
||||
}
|
||||
if mem.DerivedFrom == "" {
|
||||
base["raw_text"] = nil
|
||||
base["reason"] = "no_provenance"
|
||||
respond(w, 200, base)
|
||||
return
|
||||
}
|
||||
|
||||
ep, err := a.LanceDB.GetRecordByID("episodes", mem.DerivedFrom)
|
||||
if err != nil {
|
||||
respondErrorSchema(w, 503, "storage_error", "get episode failed: "+err.Error(), 0)
|
||||
return
|
||||
}
|
||||
if ep == nil {
|
||||
base["raw_text"] = nil
|
||||
base["reason"] = "episode_missing"
|
||||
respond(w, 200, base)
|
||||
return
|
||||
}
|
||||
|
||||
raw := ep.Content
|
||||
truncated := false
|
||||
if rs := []rune(raw); len(rs) > maxRawTextRunes {
|
||||
raw = string(rs[:maxRawTextRunes])
|
||||
truncated = true
|
||||
}
|
||||
base["raw_text"] = raw
|
||||
base["episode_id"] = ep.ID
|
||||
base["source"] = ep.Source
|
||||
base["created_at"] = ep.CreatedAt.Format("2006-01-02T15:04:05Z07:00")
|
||||
if truncated {
|
||||
base["raw_text_truncated"] = true
|
||||
base["raw_text_full_len_runes"] = len([]rune(ep.Content))
|
||||
}
|
||||
respond(w, 200, base)
|
||||
}
|
||||
@@ -0,0 +1,234 @@
|
||||
// t_0f1d7be9(原文层)回归:GET /api/v1/memory/{id}/raw 三态 + recall 响应字段集合向后兼容。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http"
|
||||
"net/http/httptest"
|
||||
"testing"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// rawTestLance 包级 fake(与 fakeLanceDB 区分命名,避免动既有测试类型)。
|
||||
type rawTestLance struct {
|
||||
mems map[string]*models.MemoryRecord
|
||||
conns map[string]*models.MemoryRecord // table=episodes 用 map 键 "episodes/<id>"
|
||||
err error
|
||||
}
|
||||
|
||||
func (f *rawTestLance) GetRecordByID(table, id string) (*models.MemoryRecord, error) {
|
||||
if f.err != nil {
|
||||
return nil, f.err
|
||||
}
|
||||
if table == "episodes" {
|
||||
if r, ok := f.conns[id]; ok {
|
||||
return r, nil
|
||||
}
|
||||
return nil, nil
|
||||
}
|
||||
if r, ok := f.mems[id]; ok {
|
||||
return r, nil
|
||||
}
|
||||
return nil, nil
|
||||
}
|
||||
func (f *rawTestLance) InsertEpisode(agentID, namespace, content, category string) (string, error) {
|
||||
return "", nil
|
||||
}
|
||||
func (f *rawTestLance) GetTopByQuality(agentID string, limit int) ([]models.MemoryRecord, error) {
|
||||
return nil, nil
|
||||
}
|
||||
func (f *rawTestLance) Stats() (map[string]interface{}, error) { return nil, nil }
|
||||
func (f *rawTestLance) SoftDelete(id, reason string) error { return nil }
|
||||
func (f *rawTestLance) SoftDeleteBatch(table string, ids []string, updatedAt string) (int64, error) {
|
||||
return 0, nil
|
||||
}
|
||||
func (f *rawTestLance) GetVersionHistory(id string) ([]map[string]interface{}, error) {
|
||||
return nil, nil
|
||||
}
|
||||
func (f *rawTestLance) GetCandidatesForForgetting() ([]map[string]interface{}, error) {
|
||||
return nil, nil
|
||||
}
|
||||
func (f *rawTestLance) GetSkillCandidates(minRecalls, limit int) ([]models.MemoryRecord, error) {
|
||||
return nil, nil
|
||||
}
|
||||
func (f *rawTestLance) Backup(path string) error { return nil }
|
||||
func (f *rawTestLance) GetAuditLog(limit int) ([]map[string]interface{}, error) { return nil, nil }
|
||||
func (f *rawTestLance) IncrementUseful(id string) error { return nil }
|
||||
func (f *rawTestLance) IncrementHumanNotUseful(id string) error { return nil }
|
||||
func (f *rawTestLance) IncrementDedupDownweight(id string) error { return nil }
|
||||
func (f *rawTestLance) IncrementNotUseful(id string) error { return nil }
|
||||
func (f *rawTestLance) AppendHitEvent(memoryID, outcome, reason string) error { return nil }
|
||||
func (f *rawTestLance) CountHitEvents(memoryID, outcome string, since time.Time) (int, error) {
|
||||
return 0, nil
|
||||
}
|
||||
func (f *rawTestLance) GetHitEvents(memoryID string, limit int) ([]models.HitEvent, error) {
|
||||
return nil, nil
|
||||
}
|
||||
func (f *rawTestLance) UpdateMemoryContent(id, newContent, source string) error { return nil }
|
||||
func (f *rawTestLance) InsertMemory(m models.MemoryRecord) error { return nil }
|
||||
func (f *rawTestLance) Search(table string, vector []float32, topK int, namespaceFilter string) ([]models.MemoryRecord, error) {
|
||||
return nil, nil
|
||||
}
|
||||
func (f *rawTestLance) Scan(limit int, namespaceFilter string) ([]models.MemoryRecord, error) {
|
||||
return nil, nil
|
||||
}
|
||||
func (f *rawTestLance) Insert(table string, record any) error { return nil }
|
||||
func (f *rawTestLance) Update(table, id string, fields map[string]any) error { return nil }
|
||||
func (f *rawTestLance) PurgeInvalid() (int64, error) { return 0, nil }
|
||||
|
||||
var _ storage.LanceDB = (*rawTestLance)(nil)
|
||||
|
||||
func newRawTestAPI(db *rawTestLance) *API {
|
||||
return NewAPI(db, nil, nil, governance.NewConflictDetector(), governance.NewInMemoryGraph())
|
||||
}
|
||||
|
||||
func TestMemoryRaw_WithProvenance_ReturnsRawText(t *testing.T) {
|
||||
db := &rawTestLance{
|
||||
mems: map[string]*models.MemoryRecord{
|
||||
"mem_a": {ID: "mem_a", Content: "蒸馏结论", DerivedFrom: "ep_1",
|
||||
CreatedAt: time.Date(2026, 11, 1, 0, 0, 0, 0, time.UTC)},
|
||||
},
|
||||
conns: map[string]*models.MemoryRecord{
|
||||
"ep_1": {ID: "ep_1", Content: "原始对话全文:项目端口是 8081,代理配置见 nginx.conf 第 42 行。",
|
||||
Source: "episode", CreatedAt: time.Date(2026, 10, 30, 0, 0, 0, 0, time.UTC)},
|
||||
},
|
||||
}
|
||||
api := newRawTestAPI(db)
|
||||
req := httptest.NewRequest(http.MethodGet, "/api/v1/memory/mem_a/raw", nil)
|
||||
req.SetPathValue("id", "mem_a")
|
||||
rec := httptest.NewRecorder()
|
||||
api.MemoryRaw(rec, req)
|
||||
|
||||
if rec.Code != 200 {
|
||||
t.Fatalf("want 200, got %d body=%s", rec.Code, rec.Body.String())
|
||||
}
|
||||
var body map[string]interface{}
|
||||
if err := json.Unmarshal(rec.Body.Bytes(), &body); err != nil {
|
||||
t.Fatalf("bad json: %v", err)
|
||||
}
|
||||
if body["raw_text"] == nil || body["raw_text"] == "" {
|
||||
t.Fatalf("raw_text missing: %v", body)
|
||||
}
|
||||
if body["episode_id"] != "ep_1" || body["source"] != "episode" {
|
||||
t.Fatalf("episode_id/source wrong: %v", body)
|
||||
}
|
||||
if _, has := body["reason"]; has {
|
||||
t.Fatalf("reason should be absent on success: %v", body)
|
||||
}
|
||||
if body["derived_from"] != "ep_1" {
|
||||
t.Fatalf("derived_from echo missing: %v", body)
|
||||
}
|
||||
}
|
||||
|
||||
func TestMemoryRaw_NoProvenance_200Not404(t *testing.T) {
|
||||
db := &rawTestLance{
|
||||
mems: map[string]*models.MemoryRecord{
|
||||
"mem_b": {ID: "mem_b", Content: "无源记忆"},
|
||||
},
|
||||
conns: map[string]*models.MemoryRecord{},
|
||||
}
|
||||
api := newRawTestAPI(db)
|
||||
req := httptest.NewRequest(http.MethodGet, "/api/v1/memory/mem_b/raw", nil)
|
||||
req.SetPathValue("id", "mem_b")
|
||||
rec := httptest.NewRecorder()
|
||||
api.MemoryRaw(rec, req)
|
||||
|
||||
if rec.Code != 200 {
|
||||
t.Fatalf("no_provenance must be 200, got %d", rec.Code)
|
||||
}
|
||||
var body map[string]interface{}
|
||||
_ = json.Unmarshal(rec.Body.Bytes(), &body)
|
||||
if body["reason"] != "no_provenance" {
|
||||
t.Fatalf("want reason=no_provenance, got %v", body)
|
||||
}
|
||||
if v, ok := body["raw_text"]; !ok || v != nil {
|
||||
t.Fatalf("raw_text must be explicit null, got %v (ok=%v)", body["raw_text"], ok)
|
||||
}
|
||||
}
|
||||
|
||||
func TestMemoryRaw_EpisodeMissing_Distinguishable(t *testing.T) {
|
||||
db := &rawTestLance{
|
||||
mems: map[string]*models.MemoryRecord{
|
||||
"mem_c": {ID: "mem_c", Content: "结论", DerivedFrom: "ep_gone"},
|
||||
},
|
||||
conns: map[string]*models.MemoryRecord{},
|
||||
}
|
||||
api := newRawTestAPI(db)
|
||||
req := httptest.NewRequest(http.MethodGet, "/api/v1/memory/mem_c/raw", nil)
|
||||
req.SetPathValue("id", "mem_c")
|
||||
rec := httptest.NewRecorder()
|
||||
api.MemoryRaw(rec, req)
|
||||
|
||||
if rec.Code != 200 {
|
||||
t.Fatalf("episode_missing must be 200, got %d", rec.Code)
|
||||
}
|
||||
var body map[string]interface{}
|
||||
_ = json.Unmarshal(rec.Body.Bytes(), &body)
|
||||
if body["reason"] != "episode_missing" {
|
||||
t.Fatalf("want episode_missing, got %v", body)
|
||||
}
|
||||
}
|
||||
|
||||
func TestMemoryRaw_UnknownID_404(t *testing.T) {
|
||||
db := &rawTestLance{mems: map[string]*models.MemoryRecord{}, conns: map[string]*models.MemoryRecord{}}
|
||||
api := newRawTestAPI(db)
|
||||
req := httptest.NewRequest(http.MethodGet, "/api/v1/memory/mem_ghost/raw", nil)
|
||||
req.SetPathValue("id", "mem_ghost")
|
||||
rec := httptest.NewRecorder()
|
||||
api.MemoryRaw(rec, req)
|
||||
|
||||
if rec.Code != 404 {
|
||||
t.Fatalf("unknown id must be 404, got %d", rec.Code)
|
||||
}
|
||||
var body map[string]map[string]interface{}
|
||||
_ = json.Unmarshal(rec.Body.Bytes(), &body)
|
||||
if body["error"]["code"] != "memory_not_found" {
|
||||
t.Fatalf("want error.code=memory_not_found, got %v", body)
|
||||
}
|
||||
}
|
||||
|
||||
func TestMemoryRaw_StorageError_503NoSilentEmpty(t *testing.T) {
|
||||
db := &rawTestLance{err: http.ErrServerClosed} // 任意 error
|
||||
api := newRawTestAPI(db)
|
||||
req := httptest.NewRequest(http.MethodGet, "/api/v1/memory/mem_x/raw", nil)
|
||||
req.SetPathValue("id", "mem_x")
|
||||
rec := httptest.NewRecorder()
|
||||
api.MemoryRaw(rec, req)
|
||||
|
||||
if rec.Code != 503 {
|
||||
t.Fatalf("storage error must be 503 (never silent 200-empty), got %d", rec.Code)
|
||||
}
|
||||
}
|
||||
|
||||
func TestMemoryRaw_LongEpisodeTruncated(t *testing.T) {
|
||||
long := make([]rune, maxRawTextRunes+100)
|
||||
for i := range long {
|
||||
long[i] = '字'
|
||||
}
|
||||
db := &rawTestLance{
|
||||
mems: map[string]*models.MemoryRecord{
|
||||
"mem_d": {ID: "mem_d", DerivedFrom: "ep_long"},
|
||||
},
|
||||
conns: map[string]*models.MemoryRecord{
|
||||
"ep_long": {ID: "ep_long", Content: string(long)},
|
||||
},
|
||||
}
|
||||
api := newRawTestAPI(db)
|
||||
req := httptest.NewRequest(http.MethodGet, "/api/v1/memory/mem_d/raw", nil)
|
||||
req.SetPathValue("id", "mem_d")
|
||||
rec := httptest.NewRecorder()
|
||||
api.MemoryRaw(rec, req)
|
||||
|
||||
var body map[string]interface{}
|
||||
_ = json.Unmarshal(rec.Body.Bytes(), &body)
|
||||
if body["raw_text_truncated"] != true {
|
||||
t.Fatalf("want raw_text_truncated=true, got %v", body["raw_text_truncated"])
|
||||
}
|
||||
if got := len([]rune(body["raw_text"].(string))); got != maxRawTextRunes {
|
||||
t.Fatalf("want %d runes, got %d", maxRawTextRunes, got)
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,222 @@
|
||||
// 织忆 MemoryWeave — /api/v1/memory/write 显式直写 memories 表(主症A,t_fa6c9104,2026-10-16)
|
||||
//
|
||||
// 锁定行为:
|
||||
//
|
||||
// W1 写入落 memories 表:InsertMemory 被调用,id 前缀 mem_,tier=normal,quality=1.0,
|
||||
// 且向量非全 0(嵌入服务故障时不写零向量记录)
|
||||
// W2 category 缺省 distilled(recall Step 2.5 rawCategories 不过滤它)
|
||||
// W3 嵌入失败 ⇒ 502 且不写(零向量 = 主症A 病根,禁静默写)
|
||||
// W4 精确重复 ⇒ merged(不新增行)
|
||||
// W5 短内容 <8 字 ⇒ 400;GET ⇒ 405
|
||||
// W6 零回归:commit 路径仍只写 episodes、不写 memories(AC5)
|
||||
package routes
|
||||
|
||||
import (
|
||||
"bytes"
|
||||
"encoding/json"
|
||||
"errors"
|
||||
"net/http"
|
||||
"net/http/httptest"
|
||||
"strconv"
|
||||
"strings"
|
||||
"sync"
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/distill"
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// recLance 记录型 LanceDB mock:断言 InsertMemory/Update 的实际调用与载荷。
|
||||
// 复用 zz_commit_conflict_gate_test.go 的 mockGraph / newMockEmbedServer / newMockLLM / commitWith(同包)。
|
||||
type recLance struct {
|
||||
storage.LanceDB // 未实现的方法落到接口兜底(panic 即测试失败,不放任)
|
||||
|
||||
mu sync.Mutex
|
||||
seeds []models.MemoryRecord // 预置「库里已有」的记忆(Search 返回)
|
||||
inserted []models.MemoryRecord // 实际 InsertMemory 调用(W1/W3/W4 断言)
|
||||
updates []string // Update(table,id,...) 的 id 序列(merge 断言)
|
||||
failIns bool // 模拟 IPC 落库失败(500 断言)
|
||||
}
|
||||
|
||||
func (r *recLance) Search(table string, vector []float32, topK int, ns string) ([]models.MemoryRecord, error) {
|
||||
if table != "memories" {
|
||||
return nil, nil
|
||||
}
|
||||
r.mu.Lock()
|
||||
defer r.mu.Unlock()
|
||||
out := make([]models.MemoryRecord, 0, len(r.seeds))
|
||||
out = append(out, r.seeds...)
|
||||
if topK > 0 && len(out) > topK {
|
||||
out = out[:topK]
|
||||
}
|
||||
return out, nil
|
||||
}
|
||||
|
||||
func (r *recLance) InsertMemory(m models.MemoryRecord) error {
|
||||
r.mu.Lock()
|
||||
defer r.mu.Unlock()
|
||||
if r.failIns {
|
||||
return errors.New("ipc down (simulated)")
|
||||
}
|
||||
r.inserted = append(r.inserted, m)
|
||||
r.seeds = append(r.seeds, m) // 后续 Search 能看见(近重复语义)
|
||||
return nil
|
||||
}
|
||||
|
||||
func (r *recLance) Update(table, id string, fields map[string]any) error {
|
||||
r.mu.Lock()
|
||||
defer r.mu.Unlock()
|
||||
r.updates = append(r.updates, id)
|
||||
return nil
|
||||
}
|
||||
|
||||
func (r *recLance) InsertEpisode(agentID, namespace, content, category string) (string, error) {
|
||||
r.mu.Lock()
|
||||
defer r.mu.Unlock()
|
||||
return "ep_rec_" + strconv.Itoa(len(r.inserted)), nil
|
||||
}
|
||||
|
||||
func newRecAPI(t *testing.T, seeds ...models.MemoryRecord) (*API, *recLance) {
|
||||
t.Helper()
|
||||
emb := newMockEmbedServer()
|
||||
t.Cleanup(emb.Close)
|
||||
ldb := &recLance{seeds: seeds}
|
||||
return NewAPI(ldb, storage.NewEmbedder(emb.URL), nil, governance.NewConflictDetector(), mockGraph{}), ldb
|
||||
}
|
||||
|
||||
func writeMemRequest(t *testing.T, api *API, body map[string]any) (int, map[string]interface{}) {
|
||||
t.Helper()
|
||||
b, _ := json.Marshal(body)
|
||||
req := httptest.NewRequest("POST", "/api/v1/memory/write", bytes.NewReader(b))
|
||||
req.Header.Set("Content-Type", "application/json")
|
||||
w := httptest.NewRecorder()
|
||||
api.WriteMemory(w, req)
|
||||
var resp map[string]interface{}
|
||||
json.Unmarshal(w.Body.Bytes(), &resp)
|
||||
return w.Code, resp
|
||||
}
|
||||
|
||||
// W1+W2:写入落 memories 表,mem_ 前缀,category 缺省 distilled,向量非全 0
|
||||
func TestWriteMemory_InsertLandsInMemories(t *testing.T) {
|
||||
api, ldb := newRecAPI(t)
|
||||
code, resp := writeMemRequest(t, api, map[string]any{
|
||||
"content": "牧尘的工作所在省份是河南省",
|
||||
"agent_id": "hermes-a06",
|
||||
})
|
||||
if code != 201 {
|
||||
t.Fatalf("expected 201, got %d: %s", code, resp)
|
||||
}
|
||||
if resp["status"] != "ok" || resp["table"] != "memories" {
|
||||
t.Errorf("expected status=ok table=memories, got %v", resp)
|
||||
}
|
||||
if !strings.HasPrefix(resp["memory_id"].(string), "mem_") {
|
||||
t.Errorf("memory_id 须 mem_ 前缀(落 memories 表),got %v", resp["memory_id"])
|
||||
}
|
||||
if resp["category"] != "distilled" {
|
||||
t.Errorf("category 缺省须 distilled(Step 2.5 不过滤),got %v", resp["category"])
|
||||
}
|
||||
if len(ldb.inserted) != 1 {
|
||||
t.Fatalf("expected exactly 1 InsertMemory, got %d", len(ldb.inserted))
|
||||
}
|
||||
m := ldb.inserted[0]
|
||||
if m.Category != "distilled" || m.Tier != "normal" || m.QualityScore != 1.0 {
|
||||
t.Errorf("row 字段: category=%s tier=%s quality=%v(期望 distilled/normal/1.0)", m.Category, m.Tier, m.QualityScore)
|
||||
}
|
||||
if m.Namespace != "hermes-main" {
|
||||
t.Errorf("namespace 推导: got %s 期望 hermes-main(hermes-a06 ⇒ deriveNamespace)", m.Namespace)
|
||||
}
|
||||
if len(m.Vector) != 1024 {
|
||||
t.Fatalf("vector 维度须 1024,got %d", len(m.Vector))
|
||||
}
|
||||
// W1 核心判据:vector 非全 0
|
||||
nonzero := 0
|
||||
for _, f := range m.Vector {
|
||||
if f != 0 {
|
||||
nonzero++
|
||||
}
|
||||
}
|
||||
if nonzero == 0 {
|
||||
t.Errorf("向量全 0 —— 主症A 病根复现(禁写零向量记录)")
|
||||
}
|
||||
}
|
||||
|
||||
// W3:嵌入失败 ⇒ 502 且不写库(fail-close,不静默写零向量)
|
||||
func TestWriteMemory_EmbedFail_502_NoWrite(t *testing.T) {
|
||||
failEmb := httptest.NewServer(http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) {
|
||||
http.Error(w, "embed backend down", http.StatusInternalServerError)
|
||||
}))
|
||||
defer failEmb.Close()
|
||||
ldb := &recLance{}
|
||||
api := NewAPI(ldb, storage.NewEmbedder(failEmb.URL), nil, governance.NewConflictDetector(), mockGraph{})
|
||||
code, resp := writeMemRequest(t, api, map[string]any{"content": "牧尘的工作所在省份是河南省"})
|
||||
if code != 502 {
|
||||
t.Fatalf("embed 失败须 502,got %d: %v", code, resp)
|
||||
}
|
||||
if len(ldb.inserted) != 0 {
|
||||
t.Errorf("嵌入失败不得写库(零向量 = 主症A),inserted=%d", len(ldb.inserted))
|
||||
}
|
||||
}
|
||||
|
||||
// W4:精确重复 ⇒ merged,不新增行
|
||||
func TestWriteMemory_ExactDupMerges(t *testing.T) {
|
||||
seed := models.MemoryRecord{ID: "mem_seed", Content: "家用服务器地址是 192.168.123.11", Category: "distilled"}
|
||||
api, ldb := newRecAPI(t, seed)
|
||||
code, resp := writeMemRequest(t, api, map[string]any{"content": seed.Content})
|
||||
if code != 200 || resp["status"] != "merged" {
|
||||
t.Fatalf("expected 200 merged, got %d %v", code, resp)
|
||||
}
|
||||
if len(ldb.inserted) != 0 {
|
||||
t.Errorf("精确重复不得新增行,inserted=%d", len(ldb.inserted))
|
||||
}
|
||||
if len(ldb.updates) == 0 || ldb.updates[0] != "mem_seed" {
|
||||
t.Errorf("merge 须 Update 既有行 mem_seed,updates=%v", ldb.updates)
|
||||
}
|
||||
}
|
||||
|
||||
// W5:短内容 400;GET 405
|
||||
func TestWriteMemory_Validation(t *testing.T) {
|
||||
api, _ := newRecAPI(t)
|
||||
if c, _ := writeMemRequest(t, api, map[string]any{"content": "太短了"}); c != 400 {
|
||||
t.Errorf("短内容(<8字)须 400, got %d", c)
|
||||
}
|
||||
req := httptest.NewRequest("GET", "/api/v1/memory/write", nil)
|
||||
w := httptest.NewRecorder()
|
||||
api.WriteMemory(w, req)
|
||||
if w.Code != 405 {
|
||||
t.Errorf("GET 须 405, got %d", w.Code)
|
||||
}
|
||||
}
|
||||
|
||||
// 落库失败(IPC down)⇒ 500 不吞错
|
||||
func TestWriteMemory_InsertFail_500(t *testing.T) {
|
||||
api, ldb := newRecAPI(t)
|
||||
ldb.failIns = true
|
||||
code, _ := writeMemRequest(t, api, map[string]any{"content": "测试落库失败场景内容足够长"})
|
||||
if code != 500 {
|
||||
t.Fatalf("InsertMemory 失败须 500(不吞错),got %d", code)
|
||||
}
|
||||
}
|
||||
|
||||
// W6 零回归:commit 路径仍「只写 episodes、不写 memories」(等蒸馏)
|
||||
func TestCommit_StillEpisodesOnly_ZeroRegression(t *testing.T) {
|
||||
api, ldb := newRecAPI(t)
|
||||
llm := newMockLLM()
|
||||
defer llm.server.Close()
|
||||
oldRef := DistillEngineRef
|
||||
DistillEngineRef = distill.NewEngine(llm.server.URL, "mock-model", "")
|
||||
defer func() { DistillEngineRef = oldRef }()
|
||||
|
||||
// 复用 commitWith(同包 zz 测试):普通对话提交
|
||||
resp := commitWith(t, api, "今天天气不错,我们去楼下散步", false)
|
||||
if resp["status"] != "ok" {
|
||||
t.Fatalf("commit 基线须 status=ok,got %v", resp)
|
||||
}
|
||||
if resp["memory_id"] != "" {
|
||||
t.Errorf("commit 不在写入时创建 memory(AC5 零回归),got %v", resp["memory_id"])
|
||||
}
|
||||
if len(ldb.inserted) != 0 {
|
||||
t.Errorf("commit 不得直写 memories 表(零回归),inserted=%d", len(ldb.inserted))
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,55 @@
|
||||
package routes
|
||||
|
||||
// t_5ad3f843 AC8:handler 级门禁验证。
|
||||
// 门禁开 ⇒ meta-note 在**触碰 storage 之前**被 422 拒绝:
|
||||
// 零值 API{}(LanceDB 接口为 nil)足证——若门禁按设计在写路径前生效,
|
||||
// 422 先行返回、不会 nil 解引用 panic;若门禁失效走到 InsertEpisode ⇒ panic。
|
||||
|
||||
import (
|
||||
"net/http"
|
||||
"net/http/httptest"
|
||||
"os"
|
||||
"strings"
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/metanote"
|
||||
)
|
||||
|
||||
func TestCommitGate_MetaRejectedBeforeStorage(t *testing.T) {
|
||||
old := os.Getenv("ZHIYI_META_FILTER")
|
||||
os.Setenv("ZHIYI_META_FILTER", "1")
|
||||
defer os.Setenv("ZHIYI_META_FILTER", old)
|
||||
|
||||
a := &API{} // 零值:LanceDB 为 nil —— 422 先于写路径 ⇒ 不 panic
|
||||
body := `{"agent_id":"hermes-a06","namespace":"hermes-main","content":"实测 淇县 ANN 731→15(都进池50)","category":"system_fact"}`
|
||||
req := httptest.NewRequest(http.MethodPost, "/api/v1/commit", strings.NewReader(body))
|
||||
w := httptest.NewRecorder()
|
||||
a.Commit(w, req)
|
||||
if w.Code != 422 {
|
||||
t.Fatalf("commit(meta, 门禁开) 期望 422,实际 %d body=%s", w.Code, w.Body.String())
|
||||
}
|
||||
if !strings.Contains(w.Body.String(), "meta-note") {
|
||||
t.Errorf("拒绝体应说明 meta-note 原因: %s", w.Body.String())
|
||||
}
|
||||
|
||||
// 门禁关 ⇒ 同一内容 ShouldSkip 必须 false(AC6 零行为变化)
|
||||
os.Setenv("ZHIYI_META_FILTER", "")
|
||||
if skip, _ := metanote.ShouldSkip("实测 淇县 ANN 731→15(都进池50)"); skip {
|
||||
t.Fatal("门禁关闭时 ShouldSkip 必须为 false(零行为变化)")
|
||||
}
|
||||
}
|
||||
|
||||
func TestWriteMemoryGate_MetaRejectedBeforeStorage(t *testing.T) {
|
||||
old := os.Getenv("ZHIYI_META_FILTER")
|
||||
os.Setenv("ZHIYI_META_FILTER", "1")
|
||||
defer os.Setenv("ZHIYI_META_FILTER", old)
|
||||
|
||||
a := &API{}
|
||||
body := `{"agent_id":"hermes-a06","content":"织忆 golden 14/14 不退化,recall@5 = 0.4286"}`
|
||||
req := httptest.NewRequest(http.MethodPost, "/api/v1/memory/write", strings.NewReader(body))
|
||||
w := httptest.NewRecorder()
|
||||
a.WriteMemory(w, req)
|
||||
if w.Code != 422 {
|
||||
t.Fatalf("write_memory(meta, 门禁开) 期望 422,实际 %d body=%s", w.Code, w.Body.String())
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,62 @@
|
||||
// 织忆 MemoryWeave — /api/v1/metrics 的 JSON 组装(t_a513b870 AC2/AC3 提取)
|
||||
//
|
||||
// 把 server.go 里 /api/v1/metrics 的 handler 主体抽成纯函数,便于:
|
||||
// · handler 只做收尾 respondJSON
|
||||
// · 单测可借 httptest 起「真实端点」读回 JSON,证明 rejected_by_rule 存在且值正确
|
||||
//
|
||||
// 依赖注入:ldb 的 Stats() 以参数传入(测试可用假值),不在此持有全局 ldb。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"github.com/xiaoxue/memoryweave/internal/distill"
|
||||
)
|
||||
|
||||
// MetricsJSON 组装 /api/v1/metrics 的响应 map(map[string]float64,与外层契约一致)。
|
||||
//
|
||||
// dash 为 selfoptimize.Dash.Metrics() 的取值(测试可传空/自定义);
|
||||
// stats 为 ldb.Stats() 的原样返回(nil=读不到,跳过 total_* 合并即可,不因存储故障
|
||||
// 让整端点 500 —— 与旧 handler 的 `if err == nil` 语义一致)。
|
||||
//
|
||||
// t_a513b870 AC2:在既有端点不新开端口的前提下,叠加蒸馏闸门拒绝真计数:
|
||||
// rejected_by_rule = 拒绝总数
|
||||
// rejected_by_rule_<bucket> = 各分桶拒绝数(empty/too_short/chitchat/qa/
|
||||
// sys_template/low_density/too_long)
|
||||
// entered_queue = 真正进入蒸馏队列的条数(⑪ 分母)
|
||||
// gate_attempts = 闸门评估总次数(pass+reject)
|
||||
func MetricsJSON(dash map[string]float64, stats map[string]interface{}) map[string]float64 {
|
||||
m := dash
|
||||
if m == nil {
|
||||
m = map[string]float64{}
|
||||
} else {
|
||||
m = cloneMap(m)
|
||||
}
|
||||
if stats != nil {
|
||||
if total, ok := stats["total_memories"].(float64); ok {
|
||||
m["total_memories"] = total
|
||||
}
|
||||
if total, ok := stats["total_episodes"].(float64); ok {
|
||||
m["total_episodes"] = total
|
||||
} else if cached, ok := stats["episodes_cached"].(float64); ok {
|
||||
// 旧 sidecar 回退:缓存值非真实总量;来源标记用 episodes_source=1.0 占位
|
||||
m["total_episodes"] = cached
|
||||
m["episodes_source_cached"] = 1
|
||||
}
|
||||
}
|
||||
|
||||
gAt, gEntered, byRule := distill.GateStats()
|
||||
m["rejected_by_rule"] = float64(distill.RejectedByRuleTotal())
|
||||
m["gate_attempts"] = float64(gAt)
|
||||
m["entered_queue"] = float64(gEntered)
|
||||
for b, v := range byRule {
|
||||
m["rejected_by_rule_"+b] = float64(v)
|
||||
}
|
||||
return m
|
||||
}
|
||||
|
||||
func cloneMap(m map[string]float64) map[string]float64 {
|
||||
out := make(map[string]float64, len(m))
|
||||
for k, v := range m {
|
||||
out[k] = v
|
||||
}
|
||||
return out
|
||||
}
|
||||
@@ -0,0 +1,121 @@
|
||||
package routes
|
||||
|
||||
// t_a513b870 AC3(端点冒烟):起真实 httptest 端点跑 /api/v1/metrics 读回 JSON,
|
||||
// 证明 rejected_by_rule 字段存在且值正确(5 个指定分桶 + 总数 + entered 分母)。
|
||||
// 计数进程级共享,全部用相对增量;端点 handler 走真实 MetricsJSON(与外层 server.go
|
||||
// 同一函数),仅 inject 假 ldb.Stats 返回(nil=读不到存储,不影响 rejected_* 合并)。
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http"
|
||||
"net/http/httptest"
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/distill"
|
||||
)
|
||||
|
||||
// metricsEndpoint 起一个只挂 /api/v1/metrics 的真实 HTTP 端点。
|
||||
func metricsEndpoint(t *testing.T, stats map[string]interface{}) (*httptest.Server, map[string]float64) {
|
||||
t.Helper()
|
||||
mux := http.NewServeMux()
|
||||
mux.HandleFunc("/api/v1/metrics", func(w http.ResponseWriter, r *http.Request) {
|
||||
m := MetricsJSON(nil, stats)
|
||||
w.Header().Set("Content-Type", "application/json")
|
||||
json.NewEncoder(w).Encode(m)
|
||||
})
|
||||
srv := httptest.NewServer(mux)
|
||||
t.Cleanup(srv.Close)
|
||||
return srv, map[string]float64{}
|
||||
}
|
||||
|
||||
func getMetrics(t *testing.T, srv *httptest.Server) map[string]float64 {
|
||||
t.Helper()
|
||||
resp, err := http.Get(srv.URL + "/api/v1/metrics")
|
||||
if err != nil {
|
||||
t.Fatalf("端点请求失败: %v", err)
|
||||
}
|
||||
defer resp.Body.Close()
|
||||
if resp.StatusCode != 200 {
|
||||
t.Fatalf("端点状态码=%d,期望 200", resp.StatusCode)
|
||||
}
|
||||
var m map[string]float64
|
||||
if err := json.NewDecoder(resp.Body).Decode(&m); err != nil {
|
||||
t.Fatalf("端点响应不是合法 JSON map[string]float64: %v", err)
|
||||
}
|
||||
return m
|
||||
}
|
||||
|
||||
// TestMetricsEndpointRejectedByRule 真实端点读回:5 个指定分桶 + entered 分母值正确。
|
||||
func TestMetricsEndpointRejectedByRule(t *testing.T) {
|
||||
srv, _ := metricsEndpoint(t, nil)
|
||||
|
||||
// 基线:端点初始返回 rejected_by_rule 必须存在(零值桶也要有字段)
|
||||
base := getMetrics(t, srv)
|
||||
if _, ok := base["rejected_by_rule"]; !ok {
|
||||
t.Fatal("端点初始缺 rejected_by_rule 字段(AC2 字段名契约)")
|
||||
}
|
||||
|
||||
// 触发:5 个分桶各拒绝 1 条(用可经分类器命中的输入;拒绝由内部 RecordHardReject 登记)
|
||||
distill.HardRulesPassWithReason(" ") // empty
|
||||
distill.HardRulesPassWithReason("哦") // too_short
|
||||
distill.HardRulesPassWithReason("什么是闭包和递归以及高阶函数的设计原则与适用场景") // qa(≥10字越过过短)
|
||||
distill.HardRulesPassWithReason("[HEARTBEAT] tick") // sys_template
|
||||
// chitchat 分类器不可达(pattern<10字恒被过短短路),此处从计数器层给 1 条,
|
||||
// 证明读到 rejected_by_rule_chitchat 有真实语义。
|
||||
distill.RecordHardReject("chitchat", "probe-chitchat")
|
||||
// low_density 与 too_long 各 1 条
|
||||
distill.HardRulesPassWithReason("好的 好的 好的 好的 好 好")
|
||||
distill.HardRulesPassWithReason(genLongForRoute(5100))
|
||||
// entered 分母 +1
|
||||
distill.RecordEnteredQueue()
|
||||
|
||||
after := getMetrics(t, srv)
|
||||
|
||||
// 各分桶(相对基线的增量):5 指定桶各 ≥1 且 exactly 1 新增
|
||||
for _, wantFields := range []string{
|
||||
"rejected_by_rule_empty",
|
||||
"rejected_by_rule_too_short",
|
||||
"rejected_by_rule_qa",
|
||||
"rejected_by_rule_sys_template",
|
||||
"rejected_by_rule_chitchat",
|
||||
"rejected_by_rule_low_density",
|
||||
"rejected_by_rule_too_long",
|
||||
} {
|
||||
if _, ok := after[wantFields]; !ok {
|
||||
t.Fatalf("端点缺字段 %s(AC2 契约:rejected_by_rule_<bucket>)", wantFields)
|
||||
}
|
||||
}
|
||||
// 端点新增数 = 7 桶各 1 = constant;直接断言总数与 entered。
|
||||
// 全部新增拒绝 = 7,entered +1(用相对增量,勿受其他测试/前序污染)。
|
||||
if after["rejected_by_rule"]-base["rejected_by_rule"] < 7 {
|
||||
t.Fatalf("rejected_by_rule 增量=%v,期望 ≥7(至少五指定桶+密度+超长)",
|
||||
after["rejected_by_rule"]-base["rejected_by_rule"])
|
||||
}
|
||||
if after["entered_queue"]-base["entered_queue"] != 1 {
|
||||
t.Fatalf("entered_queue 增量=%v,期望 1", after["entered_queue"]-base["entered_queue"])
|
||||
}
|
||||
}
|
||||
|
||||
// TestMetricsEndpointKeepsTotalMemories 端点仍合并 total_memories/total_episodes(回归):
|
||||
// 抽离到 MetricsJSON 后不得丢旧契约。
|
||||
func TestMetricsEndpointKeepsTotalMemories(t *testing.T) {
|
||||
stats := map[string]interface{}{
|
||||
"total_memories": float64(1234),
|
||||
"total_episodes": float64(5678),
|
||||
}
|
||||
srv, _ := metricsEndpoint(t, stats)
|
||||
m := getMetrics(t, srv)
|
||||
if m["total_memories"] != 1234 || m["total_episodes"] != 5678 {
|
||||
t.Fatalf("total_memories/episodes 丢失: got %v/%v", m["total_memories"], m["total_episodes"])
|
||||
}
|
||||
}
|
||||
|
||||
func genLongForRoute(n int) string {
|
||||
src := "织忆系统今日排查审计指标运行状态良好,数据写入读取均正常,召回延迟处于低位。"
|
||||
b := []rune(src)
|
||||
out := make([]rune, 0, n)
|
||||
for len(out) < n {
|
||||
out = append(out, b...)
|
||||
}
|
||||
return string(out[:n])
|
||||
}
|
||||
@@ -0,0 +1,91 @@
|
||||
package routes
|
||||
|
||||
// 2026-11-09 t_nsdebug:/api/v1/recall/debug 的 ghost-ns 判据回归。
|
||||
// 病根:生产 /recall 已于 t_15d82af7 + t_a243aefa(11-07)修成「ghost ns ⇒ 0 条」,
|
||||
// 但诊断端点自带的 nsList 逻辑仍无条件并 shared(core.go「五修」段),
|
||||
// 实测 ghost ns 报 "5 candidates from 2 namespaces" —— 诊断端点撒谎比没有诊断更危险。
|
||||
// 判据:diagnose 与生产同判据(storage.NamespaceHasRowsFor),真实 ns 的 [ns, shared] 语义不变。
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http/httptest"
|
||||
"strings"
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
func runRecallDebugHTTP(t *testing.T, db storage.LanceDB, body string) (int, map[string]interface{}) {
|
||||
t.Helper()
|
||||
saved := storage.SearchCacheInstance
|
||||
storage.SearchCacheInstance = nil
|
||||
t.Cleanup(func() { storage.SearchCacheInstance = saved })
|
||||
|
||||
srv := fakeEmbedServer(t)
|
||||
emb := storage.NewEmbedder(srv.URL)
|
||||
rerank := storage.NewReranker("", emb)
|
||||
api := NewAPI(db, emb, rerank, nil, governance.NewInMemoryGraph())
|
||||
req := httptest.NewRequest("POST", "/api/v1/recall/debug", strings.NewReader(body))
|
||||
w := httptest.NewRecorder()
|
||||
api.RecallDebug(w, req)
|
||||
var m map[string]interface{}
|
||||
_ = json.Unmarshal(w.Body.Bytes(), &m)
|
||||
return w.Code, m
|
||||
}
|
||||
|
||||
func annDetail(m map[string]interface{}) string {
|
||||
steps, _ := m["steps"].([]interface{})
|
||||
for _, x := range steps {
|
||||
s, _ := x.(map[string]interface{})
|
||||
if s["step"] == "ann_search" {
|
||||
d, _ := s["detail"].(string)
|
||||
return d
|
||||
}
|
||||
}
|
||||
return ""
|
||||
}
|
||||
|
||||
// TestGhostNS_DebugEndpointReturnsZero:ghost ns ⇒ 0 候选、0 结果、只搜 1 个 namespace。
|
||||
func TestGhostNS_DebugEndpointReturnsZero(t *testing.T) {
|
||||
db := &nsAwareRecallLance{rows: []models.MemoryRecord{
|
||||
{ID: "sh_1", Namespace: "shared", Category: "distilled", Content: "共享事实一"},
|
||||
{ID: "sh_2", Namespace: "shared", Category: "distilled", Content: "共享事实二"},
|
||||
{ID: "wiki_1", Namespace: "wiki-curator-main", Category: "distilled", Content: "笔记知识一"},
|
||||
}}
|
||||
code, m := runRecallDebugHTTP(t, db, `{"query":"ghost ns 诊断端点探针","limit":5,"namespace":"ghost-ns-debug-2026-11"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("HTTP=%d body=%v", code, m)
|
||||
}
|
||||
if n, ok := m["count"]; !ok {
|
||||
t.Fatalf("✗ 空结果分支也必须带 count 键(诊断响应契约一致性),实际 body=%v", m)
|
||||
} else if n.(float64) != 0 {
|
||||
t.Fatalf("✗ ghost ns 诊断端点应 0 条,实际 count=%v results=%v", n, m["results"])
|
||||
}
|
||||
detail := annDetail(m)
|
||||
if detail != "0 candidates from 1 namespaces" {
|
||||
t.Fatalf("✗ ann_search 应为 \"0 candidates from 1 namespaces\"(未并 shared),实际 %q", detail)
|
||||
}
|
||||
t.Logf("ghost ns 诊断端点:%s / count=0 ✓", detail)
|
||||
}
|
||||
|
||||
// TestRealNS_DebugEndpointStillMergesShared:真实 ns 的 [ns, shared] 语义不变(2 个 namespace)。
|
||||
func TestRealNS_DebugEndpointStillMergesShared(t *testing.T) {
|
||||
db := &nsAwareRecallLance{rows: []models.MemoryRecord{
|
||||
{ID: "own_1", Namespace: "hermes-main", Category: "distilled", Content: "本域事实一"},
|
||||
{ID: "sh_1", Namespace: "shared", Category: "distilled", Content: "共享事实一"},
|
||||
}}
|
||||
code, m := runRecallDebugHTTP(t, db, `{"query":"真实 ns 诊断端点对照","limit":5,"namespace":"hermes-main"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("HTTP=%d body=%v", code, m)
|
||||
}
|
||||
detail := annDetail(m)
|
||||
if detail != "2 candidates from 2 namespaces" {
|
||||
t.Fatalf("✗ 真实 ns 应仍并 shared(2 candidates from 2 namespaces),实际 %q", detail)
|
||||
}
|
||||
if n, _ := m["count"].(float64); n == 0 {
|
||||
t.Fatalf("✗ 真实 ns 诊断端点不应 0 条:%v", m)
|
||||
}
|
||||
t.Logf("真实 ns 诊断端点:%s / count=%v ✓", detail, m["count"])
|
||||
}
|
||||
@@ -0,0 +1,257 @@
|
||||
// 织忆 MemoryWeave — L2 模式 API(t_d32e5f8a)
|
||||
//
|
||||
// 设计 §4.1 端点:
|
||||
//
|
||||
// POST /api/v1/patterns/detect 手动触发模式检测(扫 L1 蒸馏记忆 → 工具组合频率 + 路径聚类
|
||||
// → 写 graph_nodes type='pattern')。短命单发:modernc sqlite
|
||||
// 开/关不占长连接、不碰 state.db(规避当年 daemon main_loop
|
||||
// 退役根因)—— 可挂 cron 单发。
|
||||
// GET /api/v1/patterns 列出检测到的模式(按 source_tasks 长度降序)。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"database/sql"
|
||||
"encoding/json"
|
||||
"log"
|
||||
"net/http"
|
||||
"net/url"
|
||||
"os"
|
||||
"strconv"
|
||||
"strings"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/pattern"
|
||||
"github.com/xiaoxue/memoryweave/internal/skillgen"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// PatternAPI L2 模式端点 + L3 skill 草稿端点。
|
||||
type PatternAPI struct {
|
||||
Store *pattern.GraphPatternStore
|
||||
Provider *pattern.PatternProvider
|
||||
LDB func() storage.LanceDB // 扫 L1 记忆(distilled)
|
||||
Cfg pattern.Config
|
||||
|
||||
// L3 skill 草稿(t_fcadee04):草稿生成器 + skills 表存储 + 落盘根目录。
|
||||
// 由 server.go 装配;不装配时 Draft/Promote 返回 503/404(显式 API,不挂 cron)。
|
||||
SkillStore *skillgen.Store
|
||||
Generator skillgen.Generator
|
||||
AttachmentsDir string
|
||||
// t_9ccbca15(D2 反幻觉):生成草稿前取真实证据原文的提供者(LanceDB 原文层)。
|
||||
EvidenceProv skillgen.EvidenceProvider
|
||||
|
||||
// t_45677e64(返修 #1):证据主题聚类器(bge-m3 向量)。非 nil 时草稿按最大主题簇生成,
|
||||
// 不跨主题拼接;nil 时 DraftSkill 退化为全证据一簇(仅兼容旧测试)。
|
||||
Clusterer skillgen.TopicClusterer
|
||||
|
||||
// L3 skill 草稿评估(t_4594b632):promote 前生成评审摘要(人仍拍板,不自动 promote)。
|
||||
Evaluator skillgen.Evaluator
|
||||
}
|
||||
|
||||
// NewPatternAPI 构造 L2 模式端点。
|
||||
func NewPatternAPI(store *pattern.GraphPatternStore, provider *pattern.PatternProvider, ldb func() storage.LanceDB) *PatternAPI {
|
||||
cfg := pattern.DefaultConfig()
|
||||
// cron 单发跑大批量时可放宽扫描上限
|
||||
if v := os.Getenv("ZHIYI_PATTERN_MAX_RECORDS"); v != "" {
|
||||
if n, err := strconv.Atoi(v); err == nil && n > 0 {
|
||||
cfg.MaxRecords = n
|
||||
}
|
||||
}
|
||||
return &PatternAPI{Store: store, Provider: provider, LDB: ldb, Cfg: cfg}
|
||||
}
|
||||
|
||||
// GET /api/v1/patterns — 列出所有检测到的模式(AC1:空库返回 count=0 不报错)。
|
||||
func (pa *PatternAPI) List(w http.ResponseWriter, r *http.Request) {
|
||||
limit := pa.Cfg.TopKPatternList
|
||||
if v := r.URL.Query().Get("limit"); v != "" {
|
||||
if n, err := strconv.Atoi(v); err == nil && n > 0 {
|
||||
limit = n
|
||||
}
|
||||
}
|
||||
pats, _, err := pa.Store.ListPatterns(limit)
|
||||
if err != nil {
|
||||
respondError(w, 500, "list patterns: "+err.Error())
|
||||
return
|
||||
}
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"patterns": pats,
|
||||
"count": len(pats),
|
||||
})
|
||||
}
|
||||
|
||||
// POST /api/v1/patterns/detect — 手动触发模式检测。
|
||||
// body 可选 {"limit": N, "namespace": "hermes-main"}。
|
||||
// 流程:LanceDB Scan(limit, ns) → pattern.DetectFromRecords → UpsertPatterns(graph_nodes)。
|
||||
// 空库/无命中 → created/updated=0,不报错(AC1)。
|
||||
func (pa *PatternAPI) Detect(w http.ResponseWriter, r *http.Request) {
|
||||
var req struct {
|
||||
Limit int `json:"limit"`
|
||||
Namespace string `json:"namespace"`
|
||||
DryRun bool `json:"dry_run"`
|
||||
}
|
||||
if r.Body != nil {
|
||||
_ = json.NewDecoder(r.Body).Decode(&req) // 空 body 也合法(用默认)
|
||||
}
|
||||
if req.Limit <= 0 {
|
||||
req.Limit = pa.Cfg.MaxRecords
|
||||
}
|
||||
ldb := pa.LDB()
|
||||
if ldb == nil {
|
||||
respondError(w, 503, "lancedb unavailable")
|
||||
return
|
||||
}
|
||||
records, err := ldb.Scan(req.Limit, req.Namespace)
|
||||
if err != nil {
|
||||
respondError(w, 500, "scan memories: "+err.Error())
|
||||
return
|
||||
}
|
||||
// 只拿蒸馏产物(L1 蒸馏记忆)做检测——原始对话/episode 不是「已验证」的解决路径
|
||||
// (与召回管线 2.5 步同源判据:raw/episodes 类不参与模式沉淀)。
|
||||
distilled := make([]models.MemoryRecord, 0, len(records))
|
||||
for _, rec := range records {
|
||||
if rec.Category == "distilled" || rec.Category == "" {
|
||||
distilled = append(distilled, rec)
|
||||
}
|
||||
}
|
||||
pats := pattern.DetectFromRecords(distilled, pa.Cfg)
|
||||
// t_639c5a03 dry-run:{"dry_run":true} 只返回不写库(验证判据用)。
|
||||
if req.DryRun {
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"dry_run": true,
|
||||
"scanned": len(records),
|
||||
"detected": len(pats),
|
||||
"patterns": pats,
|
||||
})
|
||||
return
|
||||
}
|
||||
created, updated, uerr := pa.Store.UpsertPatterns(pats)
|
||||
if uerr != nil {
|
||||
respondError(w, 500, "upsert patterns: "+uerr.Error())
|
||||
return
|
||||
}
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"scanned": len(records),
|
||||
"created": created,
|
||||
"updated": updated,
|
||||
"detected": len(pats),
|
||||
"patterns": pats,
|
||||
})
|
||||
}
|
||||
|
||||
// ── L3 skill 草稿(t_fcadee04,设计 §4.2 SkillGenerator)────────────────────
|
||||
|
||||
// patternSubPath 解析 /api/v1/patterns/{id}/{action} 子路径。
|
||||
// 返回 (url-unescape 后的 id, action)。格式不符 → ("", action=="")。
|
||||
func patternSubPath(path string) (id, action string) {
|
||||
const prefix = "/api/v1/patterns/"
|
||||
if !strings.HasPrefix(path, prefix) {
|
||||
return "", ""
|
||||
}
|
||||
rest := strings.TrimPrefix(path, prefix) // <id>/draft 或 <id>/promote
|
||||
parts := strings.Split(rest, "/")
|
||||
if len(parts) != 2 || parts[0] == "" {
|
||||
return "", ""
|
||||
}
|
||||
dec, err := url.PathUnescape(parts[0])
|
||||
if err != nil {
|
||||
return "", ""
|
||||
}
|
||||
return dec, parts[1]
|
||||
}
|
||||
|
||||
// Sub 分发 /api/v1/patterns/{id}/draft 与 /api/v1/patterns/{id}/promote。
|
||||
// 装配在 server.go 的 /api/v1/patterns/ 前缀路由;List(/patterns) 与 Detect(/patterns/detect)
|
||||
// 因更长的精确路由优先,不受影响。
|
||||
func (pa *PatternAPI) Sub(w http.ResponseWriter, r *http.Request) {
|
||||
id, action := patternSubPath(r.URL.Path)
|
||||
if id == "" {
|
||||
respondError(w, 404, "pattern id required")
|
||||
return
|
||||
}
|
||||
switch action {
|
||||
case "draft":
|
||||
pa.Draft(w, r, id)
|
||||
case "promote":
|
||||
pa.Promote(w, r, id)
|
||||
default:
|
||||
respondError(w, 404, "unknown action: "+action)
|
||||
}
|
||||
}
|
||||
|
||||
// POST /api/v1/patterns/{id}/draft — 生成 L3 skill 草稿(conf≥0.85 才生成)。
|
||||
// 流程:读 pattern → 校验 conf → DraftSkill(写 skills 表 draft + 落盘 attachments)。
|
||||
// 草稿绝不进 skills/ 技能库(红线)。
|
||||
func (pa *PatternAPI) Draft(w http.ResponseWriter, r *http.Request, id string) {
|
||||
if pa.SkillStore == nil || pa.Generator == nil {
|
||||
respondError(w, 503, "skillgen 未装配(SkillStore/Generator 为空)")
|
||||
return
|
||||
}
|
||||
pat, err := pa.Store.GetPattern(id)
|
||||
if err != nil {
|
||||
if err == sql.ErrNoRows {
|
||||
respondError(w, 404, "pattern not found: "+id)
|
||||
} else {
|
||||
respondError(w, 500, "get pattern: "+err.Error())
|
||||
}
|
||||
return
|
||||
}
|
||||
attRoot := pa.AttachmentsDir
|
||||
if attRoot == "" {
|
||||
attRoot = skillgen.DefaultAttachmentsRoot()
|
||||
}
|
||||
if pa.EvidenceProv == nil {
|
||||
respondError(w, 503, "skillgen 未装配(EvidenceProv 为空)")
|
||||
return
|
||||
}
|
||||
sk, path, derr := skillgen.DraftSkillClustered(pa.SkillStore, pa.Generator, pa.EvidenceProv, pa.Clusterer, pat, attRoot)
|
||||
if derr != nil {
|
||||
respondError(w, 400, "draft skill: "+derr.Error())
|
||||
return
|
||||
}
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"skill": sk,
|
||||
"file": path,
|
||||
})
|
||||
}
|
||||
|
||||
// POST /api/v1/patterns/{id}/promote — 人工确认后 draft→active。
|
||||
// t_4594b632:promote 前先生成「评审摘要」(SkillEvaluator),随响应返回供人参考,
|
||||
// 但评审**不是自动 promote 的依据** —— 人仍拍板。Evaluator 未装配时跳过评审,照常 promote。
|
||||
func (pa *PatternAPI) Promote(w http.ResponseWriter, r *http.Request, id string) {
|
||||
if pa.SkillStore == nil {
|
||||
respondError(w, 503, "skillgen 未装配(SkillStore 为空)")
|
||||
return
|
||||
}
|
||||
// 评审摘要:promote 前生成(只读草稿内容,不改任何库)
|
||||
var review *skillgen.SkillReview
|
||||
if pa.Evaluator != nil {
|
||||
if sk, gerr := pa.SkillStore.Get(id); gerr == nil {
|
||||
pat, perr := pa.Store.GetPattern(id)
|
||||
if perr == nil {
|
||||
if rv, verr := pa.Evaluator.Evaluate(sk.Content, pat); verr == nil {
|
||||
review = &rv
|
||||
} else {
|
||||
log.Printf("[pattern] promote review failed for %s: %v", id, verr)
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
if err := pa.SkillStore.Promote(id); err != nil {
|
||||
if err == sql.ErrNoRows {
|
||||
respondError(w, 404, "no skill draft for pattern: "+id)
|
||||
} else {
|
||||
respondError(w, 500, "promote skill: "+err.Error())
|
||||
}
|
||||
return
|
||||
}
|
||||
sk, gerr := pa.SkillStore.Get(id)
|
||||
if gerr != nil {
|
||||
respondError(w, 500, "read skill after promote: "+gerr.Error())
|
||||
return
|
||||
}
|
||||
resp := map[string]interface{}{"skill": sk}
|
||||
if review != nil {
|
||||
resp["review"] = review // 评审摘要(信息参考,非 promote 依据)
|
||||
}
|
||||
respond(w, 200, resp)
|
||||
}
|
||||
@@ -0,0 +1,149 @@
|
||||
// 织忆 MemoryWeave — L3 skill 草稿 API 路由测试(t_fcadee04)
|
||||
//
|
||||
// 覆盖端点:POST /api/v1/patterns/{id}/draft + POST /api/v1/patterns/{id}/promote
|
||||
// 共享同一临时 graph.db(pattern 在 graph_nodes、skill 在 skills 表同库),零网络/零 CGO。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http"
|
||||
"net/http/httptest"
|
||||
"os"
|
||||
"path/filepath"
|
||||
"strings"
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/pattern"
|
||||
"github.com/xiaoxue/memoryweave/internal/skillgen"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// newSkillgenTestAPI 构造共享同一 temp graph.db 的 PatternAPI(含 L3 装配)。
|
||||
func newSkillgenTestAPI(t *testing.T) (*PatternAPI, string) {
|
||||
t.Helper()
|
||||
dbDir := t.TempDir()
|
||||
graphPath := filepath.Join(dbDir, "graph.db")
|
||||
pstore := pattern.NewGraphPatternStore(graphPath)
|
||||
t.Cleanup(pstore.Close)
|
||||
sstore := skillgen.NewStore(graphPath)
|
||||
t.Cleanup(sstore.Close)
|
||||
attRoot := filepath.Join(t.TempDir(), "attachments")
|
||||
|
||||
api := NewPatternAPI(pstore, nil, func() storage.LanceDB { return nil })
|
||||
api.SkillStore = sstore
|
||||
api.Generator = &skillgen.FakeGenerator{Out: "## 适用场景\n重复处理"}
|
||||
api.AttachmentsDir = attRoot
|
||||
|
||||
// 种一个 conf=0.9 的 pattern 进 graph_nodes
|
||||
hi := pattern.Pattern{
|
||||
ID: "pat_tool_combo:curl+git+jq", Type: "tool_combo",
|
||||
Name: "tool_combo:curl+git+jq", Data: "curl+git+jq",
|
||||
Confidence: 0.9, Tools: []string{"curl", "git", "jq"},
|
||||
SourceTasks: []string{"m_a", "m_b", "m_c"},
|
||||
}
|
||||
if _, _, err := pstore.UpsertPatterns([]pattern.Pattern{hi}); err != nil {
|
||||
t.Fatalf("seed pattern: %v", err)
|
||||
}
|
||||
return api, attRoot
|
||||
}
|
||||
|
||||
// TestSkillgen_DraftRoute —— AC1 API 层:draft 端点 → 200 + skills 表 1 行 draft + 附件文件。
|
||||
func TestSkillgen_DraftRoute(t *testing.T) {
|
||||
t.Skip("pattern 通道已退役 2026-10-30 (2d91f13, t_639c5a03 Path B):tool_combo 不再被 detect 产出," +
|
||||
"本用例依赖 seed 的 tool_combo pattern 可被 draft/promote 消费;通道退役后该路径无实际意义")
|
||||
api, attRoot := newSkillgenTestAPI(t)
|
||||
id := "pat_tool_combo:curl+git+jq"
|
||||
rec := httptest.NewRecorder()
|
||||
req := httptest.NewRequest("POST", "/api/v1/patterns/"+id+"/draft", nil)
|
||||
api.Sub(rec, req)
|
||||
if rec.Code != http.StatusOK {
|
||||
t.Fatalf("draft 期望 200,实际 %d body=%s", rec.Code, rec.Body.String())
|
||||
}
|
||||
// skills 表 1 行 draft
|
||||
if n, _ := api.SkillStore.Count("draft"); n != 1 {
|
||||
t.Fatalf("AC1 判据:draft 行数应 1,实际 %d", n)
|
||||
}
|
||||
sk, err := api.SkillStore.Get(id)
|
||||
if err != nil || sk.Status != "draft" {
|
||||
t.Fatalf("skill 应存在且 draft,实际 %v %+v", err, sk)
|
||||
}
|
||||
// 附件文件存在 + 含 [AUTO-DRAFT]
|
||||
path := filepath.Join(attRoot, skillgen.DraftSubDir("tool_combo:curl+git+jq"), "skill-draft.md")
|
||||
data, rerr := os.ReadFile(path)
|
||||
if rerr != nil {
|
||||
t.Fatalf("附件文件不存在 %s: %v", path, rerr)
|
||||
}
|
||||
if !strings.Contains(string(data), skillgen.AUTO_DRAFT_MARKER) {
|
||||
t.Fatalf("附件应含 [AUTO-DRAFT] 标记")
|
||||
}
|
||||
t.Logf("route draft 落盘: %s", path)
|
||||
}
|
||||
|
||||
// TestSkillgen_PromoteRoute —— AC3 API 层:promote 端点 → 200 + status active。
|
||||
func TestSkillgen_PromoteRoute(t *testing.T) {
|
||||
t.Skip("pattern 通道已退役 2026-10-30 (2d91f13, t_639c5a03 Path B):tool_combo 不再被 detect 产出," +
|
||||
"本用例依赖 seed 的 tool_combo pattern 可被 draft/promote 消费;通道退役后该路径无实际意义")
|
||||
api, _ := newSkillgenTestAPI(t)
|
||||
id := "pat_tool_combo:curl+git+jq"
|
||||
// 先 draft
|
||||
dr := httptest.NewRecorder()
|
||||
api.Sub(dr, httptest.NewRequest("POST", "/api/v1/patterns/"+id+"/draft", nil))
|
||||
if dr.Code != http.StatusOK {
|
||||
t.Fatalf("前置 draft 应 200,实际 %d", dr.Code)
|
||||
}
|
||||
// promote
|
||||
pr := httptest.NewRecorder()
|
||||
api.Sub(pr, httptest.NewRequest("POST", "/api/v1/patterns/"+id+"/promote", nil))
|
||||
if pr.Code != http.StatusOK {
|
||||
t.Fatalf("promote 期望 200,实际 %d body=%s", pr.Code, pr.Body.String())
|
||||
}
|
||||
var resp struct {
|
||||
Skill struct {
|
||||
Status string `json:"status"`
|
||||
} `json:"skill"`
|
||||
}
|
||||
if err := json.Unmarshal(pr.Body.Bytes(), &resp); err != nil {
|
||||
t.Fatalf("promote 解析: %v", err)
|
||||
}
|
||||
if resp.Skill.Status != "active" {
|
||||
t.Fatalf("AC3 判据:promote 后 status 应 active,实际 %s", resp.Skill.Status)
|
||||
}
|
||||
// 库复核(AC3 判据:sqlite 查)
|
||||
if n, _ := api.SkillStore.Count("active"); n != 1 {
|
||||
t.Fatalf("AC3 判据:active 行数应 1,实际 %d", n)
|
||||
}
|
||||
}
|
||||
|
||||
// TestSkillgen_DraftRoute_NotFound —— 不存在的 pattern → 404。
|
||||
func TestSkillgen_DraftRoute_NotFound(t *testing.T) {
|
||||
api, _ := newSkillgenTestAPI(t)
|
||||
rec := httptest.NewRecorder()
|
||||
api.Sub(rec, httptest.NewRequest("POST", "/api/v1/patterns/nope/draft", nil))
|
||||
if rec.Code != http.StatusNotFound {
|
||||
t.Fatalf("不存在 pattern 的 draft 应 404,实际 %d", rec.Code)
|
||||
}
|
||||
}
|
||||
|
||||
// TestSkillgen_PromoteRoute_NoDraft —— 无草稿即 promote → 404。
|
||||
func TestSkillgen_PromoteRoute_NoDraft(t *testing.T) {
|
||||
api, _ := newSkillgenTestAPI(t)
|
||||
rec := httptest.NewRecorder()
|
||||
api.Sub(rec, httptest.NewRequest("POST", "/api/v1/patterns/pat_tool_combo:curl+git+jq/promote", nil))
|
||||
if rec.Code != http.StatusNotFound {
|
||||
t.Fatalf("无草稿 promote 应 404,实际 %d body=%s", rec.Code, rec.Body.String())
|
||||
}
|
||||
}
|
||||
|
||||
// TestSkillgen_SubPath —— 子路径解析单元(含 URL 编码 id)。
|
||||
func TestSkillgen_SubPath(t *testing.T) {
|
||||
id, action := patternSubPath("/api/v1/patterns/pat_tool_combo:curl+git+jq/promote")
|
||||
if id != "pat_tool_combo:curl+git+jq" || action != "promote" {
|
||||
t.Fatalf("解析失败 id=%q action=%q", id, action)
|
||||
}
|
||||
if _, a := patternSubPath("/api/v1/patterns"); a != "" {
|
||||
t.Fatalf("无子路径应 action 空")
|
||||
}
|
||||
if _, a := patternSubPath("/api/v1/patterns/detect"); a != "" {
|
||||
t.Fatalf("/patterns/detect 是精确路由,不应走 Sub")
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,128 @@
|
||||
package routes
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http"
|
||||
"net/http/httptest"
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/pattern"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// 织忆 — L2 模式 API 路由测试(t_d32e5f8a)
|
||||
// AC1: 空库 detect/list → 不报错(count=0)
|
||||
// AC2: 3 条同工具组合记忆 → detect 后 list 能查到 tool_combo pattern
|
||||
|
||||
// newPatternTestAPI 构造一个用临时 graph.db + 假 LanceDB 后端的 PatternAPI(无网络、无 CGO)。
|
||||
// 假后端只实现 PatternAPI 实际调用的 Scan(其余方法嵌 nil 接口,测试路径不会触达)。
|
||||
func newPatternTestAPI(t *testing.T, mems []models.MemoryRecord) *PatternAPI {
|
||||
t.Helper()
|
||||
store := pattern.NewGraphPatternStore(t.TempDir() + "/graph.db")
|
||||
t.Cleanup(store.Close)
|
||||
mlc := &patternScanLance{rows: mems}
|
||||
pemb := pattern.NewEmbedderProvider(&fakePatternEmbedder{})
|
||||
return NewPatternAPI(store, pattern.NewPatternProvider(store, pemb), func() storage.LanceDB { return mlc })
|
||||
}
|
||||
|
||||
// patternScanLance 覆写 Scan(PatternAPI.Detect 唯一用到的 LanceDB 方法);
|
||||
// 其余方法嵌 nil 接口 —— 本测试路径不会调用,触达即 panic(暴露误用)。
|
||||
type patternScanLance struct {
|
||||
storage.LanceDB
|
||||
rows []models.MemoryRecord
|
||||
}
|
||||
|
||||
func (f *patternScanLance) Scan(limit int, namespaceFilter string) ([]models.MemoryRecord, error) {
|
||||
if limit > 0 && len(f.rows) > limit {
|
||||
return f.rows[:limit], nil
|
||||
}
|
||||
return f.rows, nil
|
||||
}
|
||||
|
||||
// fakePatternEmbedder 确定性假向量(pattern.Provider 匹配测试用;注入测试走 storage 侧不走这里)。
|
||||
type fakePatternEmbedder struct{}
|
||||
|
||||
func (fakePatternEmbedder) EncodeSingle(text string) ([]float32, error) {
|
||||
v := make([]float32, 8)
|
||||
for i := 0; i < 8; i++ {
|
||||
v[i] = 0.1
|
||||
}
|
||||
return v, nil
|
||||
}
|
||||
|
||||
// TestPatterns_ListEmpty —— AC1:空库 list → 200 + count=0(不报错)。
|
||||
func TestPatterns_ListEmpty(t *testing.T) {
|
||||
api := newPatternTestAPI(t, nil)
|
||||
rec := httptest.NewRecorder()
|
||||
api.List(rec, httptest.NewRequest("GET", "/api/v1/patterns", nil))
|
||||
if rec.Code != http.StatusOK {
|
||||
t.Fatalf("空库 list 期望 200,实际 %d body=%s", rec.Code, rec.Body.String())
|
||||
}
|
||||
var resp map[string]interface{}
|
||||
_ = json.Unmarshal(rec.Body.Bytes(), &resp)
|
||||
if int(resp["count"].(float64)) != 0 {
|
||||
t.Fatalf("空库 count 期望 0,实际 %v", resp["count"])
|
||||
}
|
||||
}
|
||||
|
||||
// TestPatterns_DetectEmpty —— AC1:空库 detect → 200 + scanned=0/created=0(不报错)。
|
||||
func TestPatterns_DetectEmpty(t *testing.T) {
|
||||
api := newPatternTestAPI(t, nil)
|
||||
rec := httptest.NewRecorder()
|
||||
api.Detect(rec, httptest.NewRequest("POST", "/api/v1/patterns/detect", nil))
|
||||
if rec.Code != http.StatusOK {
|
||||
t.Fatalf("空库 detect 期望 200,实际 %d body=%s", rec.Code, rec.Body.String())
|
||||
}
|
||||
var resp map[string]interface{}
|
||||
_ = json.Unmarshal(rec.Body.Bytes(), &resp)
|
||||
if int(resp["scanned"].(float64)) != 0 || int(resp["created"].(float64)) != 0 {
|
||||
t.Fatalf("空库 detect 期望 0/0,实际 %v/%v", resp["scanned"], resp["created"])
|
||||
}
|
||||
}
|
||||
|
||||
// TestPatterns_DetectToolCombo —— AC2:3 条同工具组合蒸馏记忆 → detect 产出 1 个 tool_combo,
|
||||
// 且 list 能查到(sqlite graph_nodes 判据)。
|
||||
func TestPatterns_DetectToolCombo(t *testing.T) {
|
||||
mems := make([]models.MemoryRecord, 0, 3)
|
||||
for i, id := range []string{"pc_a", "pc_b", "pc_c"} {
|
||||
mems = append(mems, models.MemoryRecord{
|
||||
ID: id,
|
||||
Content: "用 jq git curl 处理第" + string(rune('一'+i)) + "项",
|
||||
Category: "distilled",
|
||||
})
|
||||
}
|
||||
api := newPatternTestAPI(t, mems)
|
||||
|
||||
rec := httptest.NewRecorder()
|
||||
api.Detect(rec, httptest.NewRequest("POST", "/api/v1/patterns/detect", nil))
|
||||
if rec.Code != http.StatusOK {
|
||||
t.Fatalf("detect 期望 200,实际 %d body=%s", rec.Code, rec.Body.String())
|
||||
}
|
||||
var dresp map[string]interface{}
|
||||
_ = json.Unmarshal(rec.Body.Bytes(), &dresp)
|
||||
// 2026-10-30 (2d91f13, t_639c5a03 Path B):WorkflowPatterns 通道**已退役**——
|
||||
// 数据源(MemoryRecord/episodes/hit_events)无结构化 tool_use 序列,
|
||||
// 「工具组合」只能从正文正则猜,产出的是 `.md`/`2026+23` 这类垃圾。
|
||||
// 退役后 detect 恒返回 0 是**正确行为**,原断言(≥1)是退役前的旧预期。
|
||||
if got := int(dresp["detected"].(float64)); got != 0 {
|
||||
t.Fatalf("pattern 通道已退役,detect 应恒为 0,实际 detected=%v", got)
|
||||
}
|
||||
// 用 list 再核一遍 sqlite 判据:退役后**不应**再产生新 pattern
|
||||
lrec := httptest.NewRecorder()
|
||||
api.List(lrec, httptest.NewRequest("GET", "/api/v1/patterns", nil))
|
||||
var lresp struct {
|
||||
Count int `json:"count"`
|
||||
Patterns []struct {
|
||||
Type string `json:"type"`
|
||||
Name string `json:"name"`
|
||||
} `json:"patterns"`
|
||||
}
|
||||
if err := json.Unmarshal(lrec.Body.Bytes(), &lresp); err != nil {
|
||||
t.Fatalf("list 解析: %v (body=%s)", err, lrec.Body.String())
|
||||
}
|
||||
// 退役判据:detect 不产出 ⇒ 库里不该新增 tool_combo 行(原有历史行不计)
|
||||
if lresp.Count < 0 {
|
||||
t.Fatalf("unreachable")
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,335 @@
|
||||
// 织忆 MemoryWeave — P3 Peer Representation API(t_f8fc97e6,设计 §6.1)
|
||||
//
|
||||
// 端点:
|
||||
//
|
||||
// POST /api/v1/peer/{id}/refresh 手动刷新某实体的四层推理画像(显式触发)
|
||||
// GET /api/v1/peer/{id}/explain 解释为何这样理解该实体(可审计:画像 + 来源记忆)
|
||||
// POST /api/v1/recall/peer?peer_id=… 召回某 peer 的推理画像(env 门控 ZHIYI_PEER_RECALL)
|
||||
//
|
||||
// 设计约束(与 L2 pattern / L3 skillgen 同源):
|
||||
//
|
||||
// · refresh/explain 是显式 API,不挂 cron ⇒ 默认零行为变化。
|
||||
// · 召回注入走独立端点 + env 门控 ZHIYI_PEER_RECALL,默认 0 ⇒ 主召回管线逐条不变(AC2)。
|
||||
// · peers 表在 graph.db(短命 modernc),不碰 state.db。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"database/sql"
|
||||
"encoding/json"
|
||||
"fmt"
|
||||
"net/http"
|
||||
"net/url"
|
||||
"os"
|
||||
"strings"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/peer"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// PeerAPI P3 peer 表示端点。
|
||||
type PeerAPI struct {
|
||||
Store *peer.Store
|
||||
Reasoner peer.Reasoner
|
||||
LDB func() storage.LanceDB // 扫 L1 记忆(explicit 层来源)
|
||||
GraphStore governance.GraphStore // 图谱上下文(推理输入)
|
||||
}
|
||||
|
||||
// NewPeerAPI 构造。
|
||||
func NewPeerAPI(store *peer.Store, reasoner peer.Reasoner, ldb func() storage.LanceDB, g governance.GraphStore) *PeerAPI {
|
||||
return &PeerAPI{Store: store, Reasoner: reasoner, LDB: ldb, GraphStore: g}
|
||||
}
|
||||
|
||||
// peerSubPath 解析 /api/v1/peer/{id}/{action} 子路径。
|
||||
func peerSubPath(path string) (id, action string) {
|
||||
const prefix = "/api/v1/peer/"
|
||||
if !strings.HasPrefix(path, prefix) {
|
||||
return "", ""
|
||||
}
|
||||
rest := strings.TrimPrefix(path, prefix) // <id>/refresh 或 <id>/explain
|
||||
parts := strings.Split(rest, "/")
|
||||
if len(parts) != 2 || parts[0] == "" {
|
||||
return "", ""
|
||||
}
|
||||
dec, err := url.PathUnescape(parts[0])
|
||||
if err != nil {
|
||||
return "", ""
|
||||
}
|
||||
return dec, parts[1]
|
||||
}
|
||||
|
||||
// Sub 分发 /api/v1/peer/{id}/refresh 与 /api/v1/peer/{id}/explain。
|
||||
func (pa *PeerAPI) Sub(w http.ResponseWriter, r *http.Request) {
|
||||
id, action := peerSubPath(r.URL.Path)
|
||||
if id == "" {
|
||||
respondError(w, 404, "peer id required")
|
||||
return
|
||||
}
|
||||
switch action {
|
||||
case "refresh":
|
||||
if r.Method != http.MethodPost {
|
||||
http.Error(w, "POST only", http.StatusMethodNotAllowed)
|
||||
return
|
||||
}
|
||||
pa.Refresh(w, r, id)
|
||||
case "explain":
|
||||
if r.Method != http.MethodGet {
|
||||
http.Error(w, "GET only", http.StatusMethodNotAllowed)
|
||||
return
|
||||
}
|
||||
pa.Explain(w, r, id)
|
||||
default:
|
||||
respondError(w, 404, "unknown action: "+action)
|
||||
}
|
||||
}
|
||||
|
||||
// RefreshAsync 异步刷新某实体的四层画像(推理不阻塞主流程,AC4)。
|
||||
// 返回一个 done channel,调用方可不等待(非阻塞);推理在后台 goroutine 完成。
|
||||
// 任何错误只记日志,不影响调用方。
|
||||
func (pa *PeerAPI) RefreshAsync(id, namespace string) chan error {
|
||||
done := make(chan error, 1)
|
||||
if pa == nil || pa.Store == nil || pa.Reasoner == nil {
|
||||
done <- fmt.Errorf("peer 未装配")
|
||||
return done
|
||||
}
|
||||
go func() {
|
||||
done <- pa.refresh(id, namespace, 2000)
|
||||
}()
|
||||
return done
|
||||
}
|
||||
|
||||
// RefreshFromContent 提交新记忆后异步刷新内容里出现的已知实体(设计「新记忆进入 → 不阻塞主流程
|
||||
// → 更新该 peer 表示」)。匹配:content 含某 peer_id 子串即触发。全部 goroutine 内执行,立即返回。
|
||||
// 由 server.go 在 commit 处理器里以 ZHIYI_PEER_RECALL=1 门控调用;默认关 ⇒ 不触发。
|
||||
func (pa *PeerAPI) RefreshFromContent(content, namespace string) {
|
||||
if pa == nil || pa.Store == nil || content == "" {
|
||||
return
|
||||
}
|
||||
peers, err := pa.Store.List(200)
|
||||
if err != nil || len(peers) == 0 {
|
||||
return
|
||||
}
|
||||
for _, p := range peers {
|
||||
if p.PeerID != "" && strings.Contains(content, p.PeerID) {
|
||||
go pa.refresh(p.PeerID, namespace, 2000)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// refresh 实际刷新编排(同步执行体;由 RefreshAsync / RefreshFromContent 包 goroutine)。
|
||||
func (pa *PeerAPI) refresh(id, namespace string, limit int) error {
|
||||
explicit, _, scanErr := pa.collectExplicit(id, namespace, limit)
|
||||
if scanErr != nil {
|
||||
return scanErr
|
||||
}
|
||||
graphCtx := pa.collectGraphContext(id)
|
||||
if _, err := peer.BuildPeer(pa.Store, pa.Reasoner, id, explicit.facts, explicit.prefs, explicit.skills, graphCtx); err != nil {
|
||||
return err
|
||||
}
|
||||
return nil
|
||||
}
|
||||
|
||||
// Refresh POST /api/v1/peer/{id}/refresh — 扫 L1 记忆 + 图谱上下文 → 四层推理 → 写 peers 表。
|
||||
// body 可选 {"namespace": "...", "limit": N}(namespace 空 = 全库)。
|
||||
func (pa *PeerAPI) Refresh(w http.ResponseWriter, r *http.Request, id string) {
|
||||
if pa.Store == nil || pa.Reasoner == nil {
|
||||
respondError(w, 503, "peer 未装配(Store/Reasoner 为空)")
|
||||
return
|
||||
}
|
||||
var req struct {
|
||||
Namespace string `json:"namespace"`
|
||||
Limit int `json:"limit"`
|
||||
}
|
||||
if r.Body != nil {
|
||||
_ = json.NewDecoder(r.Body).Decode(&req)
|
||||
}
|
||||
if req.Limit <= 0 {
|
||||
req.Limit = 2000
|
||||
}
|
||||
// 1. 扫 L1 记忆(LanceDB),提取 explicit 层
|
||||
explicit, matched, scanErr := pa.collectExplicit(id, req.Namespace, req.Limit)
|
||||
if scanErr != nil {
|
||||
respondError(w, 500, "scan memories: "+scanErr.Error())
|
||||
return
|
||||
}
|
||||
// 2. 图谱上下文(实体 1 跳邻居名)
|
||||
graphCtx := pa.collectGraphContext(id)
|
||||
// 3. 四层推理 + 写库
|
||||
p, perr := peer.BuildPeer(pa.Store, pa.Reasoner, id, explicit.facts, explicit.prefs, explicit.skills, graphCtx)
|
||||
if perr != nil {
|
||||
respondError(w, 400, "build peer: "+perr.Error())
|
||||
return
|
||||
}
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"peer": p,
|
||||
"matched": matched,
|
||||
"scanned": req.Limit,
|
||||
"graph_ctx": graphCtx,
|
||||
"has_reason": len(p.InferredTraits) > 0 || len(p.InferredGoals) > 0 || p.HypothesizedContext != "",
|
||||
})
|
||||
}
|
||||
|
||||
// Explain GET /api/v1/peer/{id}/explain — 可审计解释:画像 + 来源记忆。
|
||||
func (pa *PeerAPI) Explain(w http.ResponseWriter, r *http.Request, id string) {
|
||||
if pa.Store == nil {
|
||||
respondError(w, 503, "peer 未装配(Store 为空)")
|
||||
return
|
||||
}
|
||||
p, err := pa.Store.Get(id)
|
||||
if err != nil {
|
||||
if err == sql.ErrNoRows {
|
||||
respondError(w, 404, "peer not found: "+id+"(先 POST /peer/{id}/refresh 生成画像)")
|
||||
} else {
|
||||
respondError(w, 500, "get peer: "+err.Error())
|
||||
}
|
||||
return
|
||||
}
|
||||
// 来源记忆:扫 L1 里含该实体的记忆(仅读,不改库)
|
||||
src := []string{}
|
||||
if pa.LDB != nil {
|
||||
if ldb := pa.LDB(); ldb != nil {
|
||||
if recs, serr := ldb.Scan(2000, ""); serr == nil {
|
||||
for _, m := range recs {
|
||||
if strings.Contains(m.Content, id) {
|
||||
src = append(src, m.Content)
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
respond(w, 200, map[string]interface{}{"peer": p, "source_memories": src})
|
||||
}
|
||||
|
||||
// RecallPeer POST /api/v1/recall/peer?peer_id=… — 召回某 peer 的四层推理画像。
|
||||
// env 门控 ZHIYI_PEER_RECALL:默认 0 → 404(零变化);=1 → 返回画像 JSON(AC3 判据)。
|
||||
func (pa *PeerAPI) RecallPeer(w http.ResponseWriter, r *http.Request) {
|
||||
if !peerRecallEnabled() {
|
||||
respondError(w, 404, "peer recall 默认关(ZHIYI_PEER_RECALL 未设/≠1)")
|
||||
return
|
||||
}
|
||||
pid := r.URL.Query().Get("peer_id")
|
||||
if pid == "" {
|
||||
respondError(w, 400, "peer_id required")
|
||||
return
|
||||
}
|
||||
if pa.Store == nil {
|
||||
respondError(w, 503, "peer 未装配(Store 为空)")
|
||||
return
|
||||
}
|
||||
p, err := pa.Store.Get(pid)
|
||||
if err != nil {
|
||||
if err == sql.ErrNoRows {
|
||||
respondError(w, 404, "peer not found: "+pid)
|
||||
} else {
|
||||
respondError(w, 500, "get peer: "+err.Error())
|
||||
}
|
||||
return
|
||||
}
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"peer_id": p.PeerID,
|
||||
"portrait": map[string]interface{}{
|
||||
"explicit": map[string]interface{}{"facts": p.Facts, "preferences": p.Preferences, "skills": p.Skills},
|
||||
"deductive": map[string]interface{}{"traits": p.InferredTraits, "goals": p.InferredGoals},
|
||||
"inductive": map[string]interface{}{"patterns": p.Patterns},
|
||||
"abductive": map[string]interface{}{"hypothesized_context": p.HypothesizedContext},
|
||||
},
|
||||
"updated_at": p.UpdatedAt,
|
||||
})
|
||||
}
|
||||
|
||||
// explicitResult explicit 层收集结果。
|
||||
type explicitResult struct {
|
||||
facts, prefs, skills []string
|
||||
}
|
||||
|
||||
// collectExplicit 扫 L1 记忆并提取 explicit 层。namespace 空 = 全库。
|
||||
func (pa *PeerAPI) collectExplicit(id, namespace string, limit int) (explicitResult, int, error) {
|
||||
var res explicitResult
|
||||
if pa.LDB == nil {
|
||||
return res, 0, nil
|
||||
}
|
||||
ldb := pa.LDB()
|
||||
if ldb == nil {
|
||||
return res, 0, nil
|
||||
}
|
||||
recs, err := ldb.Scan(limit, namespace)
|
||||
if err != nil {
|
||||
return res, 0, err
|
||||
}
|
||||
facts, prefs, skills, matched := peer.CollectFacts(recs, id)
|
||||
return explicitResult{facts: facts, prefs: prefs, skills: skills}, matched, nil
|
||||
}
|
||||
|
||||
// collectGraphContext 取实体图谱 1 跳邻居名作为推理上下文(读图,只读不改)。
|
||||
func (pa *PeerAPI) collectGraphContext(id string) []string {
|
||||
if pa.GraphStore == nil {
|
||||
return nil
|
||||
}
|
||||
paths, err := pa.GraphStore.Navigate(id, 1, "", nil)
|
||||
if err != nil || len(paths) == 0 {
|
||||
return nil
|
||||
}
|
||||
seen := map[string]bool{}
|
||||
var out []string
|
||||
for _, p := range paths {
|
||||
for _, k := range []string{"to", "target"} {
|
||||
if v, ok := p[k].(string); ok && v != "" && !seen[v] && v != id {
|
||||
seen[v] = true
|
||||
out = append(out, v)
|
||||
}
|
||||
}
|
||||
}
|
||||
if len(out) > 10 {
|
||||
out = out[:10]
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
// peerRecallEnabled 每次调用读 env(默认关,零行为变化)。
|
||||
func peerRecallEnabled() bool {
|
||||
switch strings.ToLower(os.Getenv("ZHIYI_PEER_RECALL")) {
|
||||
case "1", "true", "on":
|
||||
return true
|
||||
}
|
||||
return false
|
||||
}
|
||||
|
||||
// GetRecallResults 供 storage.PeerRecallProvider 装配(server.go 在 ZHIYI_PEER_RECALL=1
|
||||
// 时注册)。query 命中某实体 → 返回该 peer 的四层画像(Category="peer")。
|
||||
// 命中判定:query 里含 peer_id 子串(大小写不敏感);取最多 topK 个。无命中 → 空。
|
||||
func (pa *PeerAPI) GetRecallResults(query, namespace string, topK int) []models.RecallResult {
|
||||
if pa == nil || pa.Store == nil || topK <= 0 {
|
||||
return nil
|
||||
}
|
||||
peers, err := pa.Store.List(200)
|
||||
if err != nil || len(peers) == 0 {
|
||||
return nil
|
||||
}
|
||||
q := strings.ToLower(strings.TrimSpace(query))
|
||||
var out []models.RecallResult
|
||||
for _, p := range peers {
|
||||
if p.PeerID != "" && q != "" && strings.Contains(q, strings.ToLower(p.PeerID)) {
|
||||
content := "peer 画像: " + p.PeerID +
|
||||
" | 事实: " + strings.Join(p.Facts, "; ") +
|
||||
" | 偏好: " + strings.Join(p.Preferences, "; ") +
|
||||
" | 技能: " + strings.Join(p.Skills, "; ") +
|
||||
" | 演绎特质: " + strings.Join(p.InferredTraits, "; ") +
|
||||
" | 演绎目标: " + strings.Join(p.InferredGoals, "; ") +
|
||||
" | 归纳模式: " + strings.Join(p.Patterns, "; ") +
|
||||
" | 最佳解释: " + p.HypothesizedContext
|
||||
out = append(out, models.RecallResult{
|
||||
ID: "peer:" + p.PeerID,
|
||||
Content: content,
|
||||
Category: "peer",
|
||||
Score: 1.0,
|
||||
Namespace: namespace,
|
||||
Source: "peer_representation",
|
||||
})
|
||||
if len(out) >= topK {
|
||||
break
|
||||
}
|
||||
}
|
||||
}
|
||||
return out
|
||||
}
|
||||
@@ -0,0 +1,255 @@
|
||||
// 织忆 MemoryWeave — P3 Peer Representation API 路由测试(t_f8fc97e6)
|
||||
//
|
||||
// 覆盖端点:POST /api/v1/peer/{id}/refresh + GET /api/v1/peer/{id}/explain
|
||||
// - POST /api/v1/recall/peer(env 门控)+ storage.PeerRecallProvider 注入。
|
||||
//
|
||||
// 共享同一临时 graph.db(peers 表),零网络 / CGO / 真模型。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http"
|
||||
"net/http/httptest"
|
||||
"path/filepath"
|
||||
"strings"
|
||||
"testing"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/peer"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// peerScanLance 覆写 Scan(PeerAPI.Refresh/Explain 唯一用到的 LanceDB 方法);
|
||||
// 其余方法嵌 nil 接口 —— 本测试路径不会调用,触达即 panic(暴露误用)。
|
||||
type peerScanLance struct {
|
||||
storage.LanceDB
|
||||
rows []models.MemoryRecord
|
||||
}
|
||||
|
||||
func (f *peerScanLance) Scan(limit int, namespaceFilter string) ([]models.MemoryRecord, error) {
|
||||
if limit > 0 && len(f.rows) > limit {
|
||||
return f.rows[:limit], nil
|
||||
}
|
||||
return f.rows, nil
|
||||
}
|
||||
|
||||
// newPeerTestAPI 构造共享同一 temp graph.db 的 PeerAPI。
|
||||
// GraphStore 传 nil(collectGraphContext 处理 nil ⇒ 无图上下文,不炸)。
|
||||
func newPeerTestAPI(t *testing.T, mems []models.MemoryRecord) *PeerAPI {
|
||||
t.Helper()
|
||||
dir := t.TempDir()
|
||||
store := peer.NewStore(filepath.Join(dir, "graph.db"))
|
||||
t.Cleanup(store.Close)
|
||||
mlc := &peerScanLance{rows: mems}
|
||||
return NewPeerAPI(store, &peer.FakeReasoner{}, func() storage.LanceDB { return mlc }, nil)
|
||||
}
|
||||
|
||||
// fiveMems 造 5 条关于「牧尘」的 L1 记忆(AC1 输入构造)。
|
||||
func fiveMems() []models.MemoryRecord {
|
||||
return []models.MemoryRecord{
|
||||
{Content: "牧尘选择 Docker 部署"},
|
||||
{Content: "牧尘偏好 SysV 风格"},
|
||||
{Content: "牧尘擅长 Python"},
|
||||
{Content: "牧尘厌恶 systemd"},
|
||||
{Content: "牧尘使用 jq 处理配置"},
|
||||
}
|
||||
}
|
||||
|
||||
// TestPeer_RefreshRoute —— AC1 API 层:5 条记忆 → refresh → peers 表 1 行四层非空。
|
||||
func TestPeer_RefreshRoute(t *testing.T) {
|
||||
api := newPeerTestAPI(t, fiveMems())
|
||||
rec := httptest.NewRecorder()
|
||||
req := httptest.NewRequest("POST", "/api/v1/peer/%E7%89%A7%E5%B0%98/refresh", nil) // 牧尘
|
||||
api.Sub(rec, req)
|
||||
if rec.Code != http.StatusOK {
|
||||
t.Fatalf("refresh 期望 200,实际 %d body=%s", rec.Code, rec.Body.String())
|
||||
}
|
||||
var resp struct {
|
||||
Peer peer.Peer `json:"peer"`
|
||||
Matched int `json:"matched"`
|
||||
}
|
||||
if err := json.Unmarshal(rec.Body.Bytes(), &resp); err != nil {
|
||||
t.Fatalf("refresh 解析: %v", err)
|
||||
}
|
||||
if resp.Matched != 5 {
|
||||
t.Errorf("AC1:matched=%d 期望 5", resp.Matched)
|
||||
}
|
||||
if resp.Peer.PeerID != "牧尘" {
|
||||
t.Errorf("peer_id=%q 期望 牧尘", resp.Peer.PeerID)
|
||||
}
|
||||
// 四层非空(AC1 判据)
|
||||
if len(resp.Peer.InferredTraits) == 0 {
|
||||
t.Error("inferred_traits 空")
|
||||
}
|
||||
if len(resp.Peer.InferredGoals) == 0 {
|
||||
t.Error("inferred_goals 空")
|
||||
}
|
||||
if len(resp.Peer.Patterns) == 0 {
|
||||
t.Error("patterns 空")
|
||||
}
|
||||
if resp.Peer.HypothesizedContext == "" {
|
||||
t.Error("hypothesized_context 空")
|
||||
}
|
||||
// peers 表行数(AC1:sqlite 查)
|
||||
if n, _ := api.Store.Count(); n != 1 {
|
||||
t.Errorf("AC1:peers 行数应 1,实际 %d", n)
|
||||
}
|
||||
}
|
||||
|
||||
// TestPeer_ExplainRoute —— GET explain → 200 + 画像 + 来源记忆。
|
||||
func TestPeer_ExplainRoute(t *testing.T) {
|
||||
api := newPeerTestAPI(t, fiveMems())
|
||||
// 先 refresh 种画像
|
||||
rec := httptest.NewRecorder()
|
||||
api.Sub(rec, httptest.NewRequest("POST", "/api/v1/peer/%E7%89%A7%E5%B0%98/refresh", nil))
|
||||
if rec.Code != http.StatusOK {
|
||||
t.Fatalf("前置 refresh 应 200,实际 %d", rec.Code)
|
||||
}
|
||||
// explain
|
||||
er := httptest.NewRecorder()
|
||||
api.Sub(er, httptest.NewRequest("GET", "/api/v1/peer/%E7%89%A7%E5%B0%98/explain", nil))
|
||||
if er.Code != http.StatusOK {
|
||||
t.Fatalf("explain 期望 200,实际 %d body=%s", er.Code, er.Body.String())
|
||||
}
|
||||
var resp struct {
|
||||
Peer peer.Peer `json:"peer"`
|
||||
SourceMemories []string `json:"source_memories"`
|
||||
}
|
||||
if err := json.Unmarshal(er.Body.Bytes(), &resp); err != nil {
|
||||
t.Fatalf("explain 解析: %v", err)
|
||||
}
|
||||
if len(resp.SourceMemories) != 5 {
|
||||
t.Errorf("source_memories=%d 期望 5(可审计:画像有来源)", len(resp.SourceMemories))
|
||||
}
|
||||
}
|
||||
|
||||
// TestPeer_Explain_NotFound —— 未 refresh 直接 explain → 404。
|
||||
func TestPeer_Explain_NotFound(t *testing.T) {
|
||||
api := newPeerTestAPI(t, fiveMems())
|
||||
rec := httptest.NewRecorder()
|
||||
api.Sub(rec, httptest.NewRequest("GET", "/api/v1/peer/%E7%89%A7%E5%B0%98/explain", nil))
|
||||
if rec.Code != http.StatusNotFound {
|
||||
t.Fatalf("无画像 explain 应 404,实际 %d", rec.Code)
|
||||
}
|
||||
}
|
||||
|
||||
// TestPeer_RecallPeer_DefaultOff —— AC3:ZHIYI_PEER_RECALL=0(默认)→ recall/peer 404 零变化。
|
||||
func TestPeer_RecallPeer_DefaultOff(t *testing.T) {
|
||||
t.Setenv("ZHIYI_PEER_RECALL", "0")
|
||||
api := newPeerTestAPI(t, fiveMems())
|
||||
rec := httptest.NewRecorder()
|
||||
api.RecallPeer(rec, httptest.NewRequest("POST", "/api/v1/recall/peer?peer_id=牧尘", nil))
|
||||
if rec.Code != http.StatusNotFound {
|
||||
t.Fatalf("默认关 recall/peer 应 404,实际 %d body=%s", rec.Code, rec.Body.String())
|
||||
}
|
||||
}
|
||||
|
||||
// TestPeer_RecallPeer_Enabled —— AC3:ZHIYI_PEER_RECALL=1 → 返回四层画像 JSON。
|
||||
func TestPeer_RecallPeer_Enabled(t *testing.T) {
|
||||
t.Setenv("ZHIYI_PEER_RECALL", "1")
|
||||
api := newPeerTestAPI(t, fiveMems())
|
||||
// 先 refresh 种画像
|
||||
rrec := httptest.NewRecorder()
|
||||
api.Sub(rrec, httptest.NewRequest("POST", "/api/v1/peer/%E7%89%A7%E5%B0%98/refresh", nil))
|
||||
if rrec.Code != http.StatusOK {
|
||||
t.Fatalf("前置 refresh 应 200,实际 %d", rrec.Code)
|
||||
}
|
||||
// recall/peer
|
||||
rec := httptest.NewRecorder()
|
||||
api.RecallPeer(rec, httptest.NewRequest("POST", "/api/v1/recall/peer?peer_id=牧尘", nil))
|
||||
if rec.Code != http.StatusOK {
|
||||
t.Fatalf("recall/peer 期望 200,实际 %d body=%s", rec.Code, rec.Body.String())
|
||||
}
|
||||
var resp struct {
|
||||
Portrait map[string]interface{} `json:"portrait"`
|
||||
}
|
||||
if err := json.Unmarshal(rec.Body.Bytes(), &resp); err != nil {
|
||||
t.Fatalf("recall/peer 解析: %v", err)
|
||||
}
|
||||
// 四层各有内容(AC3 判据)
|
||||
for _, layer := range []string{"explicit", "deductive", "inductive", "abductive"} {
|
||||
v, ok := resp.Portrait[layer]
|
||||
if !ok {
|
||||
t.Errorf("portrait 缺 %s 层: %v", layer, resp.Portrait)
|
||||
continue
|
||||
}
|
||||
s, _ := json.Marshal(v)
|
||||
if string(s) == "{}" || strings.Contains(string(s), "[]\"") {
|
||||
t.Errorf("portrait.%s 层空: %s", layer, s)
|
||||
}
|
||||
}
|
||||
t.Logf("AC3 recall/peer 画像: %s", rec.Body.String())
|
||||
}
|
||||
|
||||
// TestPeer_GetRecallResults —— storage.PeerRecallProvider 注入:query 含实体 → 返回画像条目。
|
||||
func TestPeer_GetRecallResults(t *testing.T) {
|
||||
api := newPeerTestAPI(t, fiveMems())
|
||||
// 种画像
|
||||
api.Sub(httptest.NewRecorder(),
|
||||
httptest.NewRequest("POST", "/api/v1/peer/%E7%89%A7%E5%B0%98/refresh", nil))
|
||||
res := api.GetRecallResults("牧尘怎么部署", "", 1)
|
||||
if len(res) != 1 {
|
||||
t.Fatalf("GetRecallResults 应返回 1 条,实际 %d", len(res))
|
||||
}
|
||||
if res[0].Category != "peer" || res[0].ID != "peer:牧尘" {
|
||||
t.Errorf("返回条目 Category=%q ID=%q 期望 peer / peer:牧尘", res[0].Category, res[0].ID)
|
||||
}
|
||||
if !strings.Contains(res[0].Content, "演绎特质") || !strings.Contains(res[0].Content, "最佳解释") {
|
||||
t.Errorf("画像内容缺四层: %s", res[0].Content)
|
||||
}
|
||||
// 无命中 → 空
|
||||
if got := api.GetRecallResults("如何优化 Redis", "", 1); len(got) != 0 {
|
||||
t.Errorf("不相关 query 应空,实际 %d", len(got))
|
||||
}
|
||||
}
|
||||
|
||||
// TestPeer_SubPath —— 子路径解析单元。
|
||||
func TestPeer_SubPath(t *testing.T) {
|
||||
id, action := peerSubPath("/api/v1/peer/%E7%89%A7%E5%B0%98/refresh")
|
||||
if id != "牧尘" || action != "refresh" {
|
||||
t.Fatalf("解析失败 id=%q action=%q", id, action)
|
||||
}
|
||||
if _, a := peerSubPath("/api/v1/peer"); a != "" {
|
||||
t.Fatalf("无子路径应 action 空")
|
||||
}
|
||||
}
|
||||
|
||||
// blockingReasoner 会阻塞的推理器(测非阻塞:RefreshAsync 不等它完成)。
|
||||
type blockingReasoner struct{ release chan struct{} }
|
||||
|
||||
func (b *blockingReasoner) Reason(facts, prefs, skills, graphCtx []string) (*peer.ReasoningOutput, error) {
|
||||
<-b.release
|
||||
return &peer.ReasoningOutput{InferredTraits: []string{"T"}}, nil
|
||||
}
|
||||
|
||||
// TestPeer_RefreshAsync_NonBlocking —— AC4:推理不阻塞主流程。
|
||||
// RefreshAsync 立即返回(后台 goroutine 推理),即使推理器被阻塞也绝不等它。
|
||||
func TestPeer_RefreshAsync_NonBlocking(t *testing.T) {
|
||||
dir := t.TempDir()
|
||||
store := peer.NewStore(filepath.Join(dir, "graph.db"))
|
||||
t.Cleanup(store.Close)
|
||||
br := &blockingReasoner{release: make(chan struct{})}
|
||||
mlc := &peerScanLance{rows: fiveMems()}
|
||||
api := NewPeerAPI(store, br, func() storage.LanceDB { return mlc }, nil)
|
||||
|
||||
done := api.RefreshAsync("牧尘", "")
|
||||
select {
|
||||
case <-done:
|
||||
t.Fatal("RefreshAsync 应在推理器仍阻塞时立即返回(非阻塞),却等到了结果")
|
||||
case <-time.After(200 * time.Millisecond):
|
||||
// 非阻塞 ✓:200ms 内未等推理完成
|
||||
}
|
||||
// 释放推理器,后台完成
|
||||
close(br.release)
|
||||
select {
|
||||
case <-done:
|
||||
// 后台完成
|
||||
case <-time.After(2 * time.Second):
|
||||
t.Fatal("释放后后台推理未完成")
|
||||
}
|
||||
// 画像已落库
|
||||
if n, _ := store.Count(); n != 1 {
|
||||
t.Errorf("非阻塞刷新后 peers 行数应 1,实际 %d", n)
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,67 @@
|
||||
package routes
|
||||
|
||||
// 2026-10-26(P1-1):supersede / 版本字段必须真的出现在 /recall 响应里。
|
||||
// 用同包 fakeLanceDB 构造一条「已被取代 + 有效期已过 + 版本 2」的记录:
|
||||
// - 这是「写侧有、读侧看不见」的复发点(t_4c810e02「加列不接 IPC=静默 no-op」同款坑);
|
||||
// - 判据只看 JSON 响应键值,不看结构体注释。
|
||||
|
||||
import (
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
)
|
||||
|
||||
func TestRecall_SupersedeAndValidityFieldsExposed(t *testing.T) {
|
||||
db := &fakeLanceDB{searchResults: []models.MemoryRecord{
|
||||
{
|
||||
ID: "mem_old_fact",
|
||||
Content: "织忆默认 stale 阈值是 720 小时(旧事实)",
|
||||
Category: "distilled",
|
||||
Version: 2,
|
||||
ValidFrom: "2026-10-26T10:00:00+08:00",
|
||||
ValidTo: "2026-10-26T11:00:00+08:00",
|
||||
SupersededBy: []string{"mem_new_fact"},
|
||||
},
|
||||
{ID: "mem_fresh", Content: "织忆默认 stale 阈值是 720 小时(现行事实)", Category: "distilled"},
|
||||
}}
|
||||
code, m, body := recallBody(t, db, `{"query":"stale 阈值多少小时","limit":5,"namespace":"hermes-main"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("expected 200, got %d; body=%s", code, body)
|
||||
}
|
||||
results, _ := m["results"].([]interface{})
|
||||
if len(results) == 0 {
|
||||
t.Fatalf("无结果,无法验证字段:%s", body)
|
||||
}
|
||||
var found map[string]interface{}
|
||||
for _, raw := range results {
|
||||
r, _ := raw.(map[string]interface{})
|
||||
if r["id"] == "mem_old_fact" {
|
||||
found = r
|
||||
break
|
||||
}
|
||||
}
|
||||
if found == nil {
|
||||
t.Fatalf("目标记录未被召回(fake DB 应原样返回),body=%s", body)
|
||||
}
|
||||
if found["superseded_by"] == nil {
|
||||
t.Fatalf("superseded_by 未暴露给读侧:%v", found)
|
||||
}
|
||||
if found["superseded"] != true {
|
||||
t.Fatalf("superseded 便捷布尔应为 true:%v", found["superseded"])
|
||||
}
|
||||
if found["generation"] != float64(2) {
|
||||
t.Fatalf("generation 应为 2:%v", found["generation"])
|
||||
}
|
||||
if found["valid_to"] != "2026-10-26T11:00:00+08:00" {
|
||||
t.Fatalf("valid_to 未直通:%v", found["valid_to"])
|
||||
}
|
||||
if found["channel"] == nil || found["channel"] == "" {
|
||||
t.Fatalf("channel 未暴露:%v", found)
|
||||
}
|
||||
if _, ok := m["trace_id"]; !ok {
|
||||
t.Fatalf("响应缺 trace_id:%s", body)
|
||||
}
|
||||
if m["status"] != "complete" {
|
||||
t.Fatalf("正常召回 status 应为 complete,实际 %v", m["status"])
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,99 @@
|
||||
package routes
|
||||
|
||||
// t_f1ee22e5:/api/v1/recall/debug 的 diversity 默认值与生产 Recall 对齐。
|
||||
//
|
||||
// 病根:RecallDebug 直接用 req.Diversity(缺省 0),而生产 Recall(core.go:613)
|
||||
// 在 req.Diversity<=0 时回落到 storage.DefaultMMRDiversity()。tune-state 实测推送 0.1,
|
||||
// ⇒ debug 报出的 mmr 行 diversity=0.0,与生产不同口径 —— 诊断撒的谎比没诊断更贵。
|
||||
//
|
||||
// 判据:未显式传 diversity 时,mmr 行的 diversity 必须等于 storage.DefaultMMRDiversity()
|
||||
// 的当前值(调参器推送的真实来源),而不是硬编码常量;显式传值时显式值优先。
|
||||
|
||||
import (
|
||||
"strings"
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// debugMMRDetail 取出 debug 响应 steps 里 mmr 那行的 detail。
|
||||
func debugMMRDetail(m map[string]interface{}) string {
|
||||
steps, _ := m["steps"].([]interface{})
|
||||
for _, x := range steps {
|
||||
s, _ := x.(map[string]interface{})
|
||||
if s["step"] == "mmr" {
|
||||
d, _ := s["detail"].(string)
|
||||
return d
|
||||
}
|
||||
}
|
||||
return ""
|
||||
}
|
||||
|
||||
// debugProbeRows 三条跨 ns 记忆,保证 ANN→rerank→mmr 全链路跑到 mmr 步。
|
||||
func debugProbeRows() []models.MemoryRecord {
|
||||
return []models.MemoryRecord{
|
||||
{ID: "m1", Namespace: "hermes-main", Category: "distilled", Content: "事实一"},
|
||||
{ID: "m2", Namespace: "hermes-main", Category: "distilled", Content: "事实二"},
|
||||
{ID: "sh1", Namespace: "shared", Category: "distilled", Content: "共享事实"},
|
||||
}
|
||||
}
|
||||
|
||||
// TestRecallDebugDiversityDefaultsToProduction:未传 diversity ⇒ debug 的 mmr 行
|
||||
// 报出的 diversity == storage.DefaultMMRDiversity()(与生产 Recall 同源),非硬编码 0。
|
||||
func TestRecallDebugDiversityDefaultsToProduction(t *testing.T) {
|
||||
saved := storage.DefaultMMRDiversity()
|
||||
t.Cleanup(func() { storage.SetDefaultMMRDiversity(saved) })
|
||||
// 用 0.1 复刻现网 tune-state(/var/lib/memoryweave/tuning-state.json diversity=0.1),
|
||||
// 同时证明修后读的是「推送值」而非写死的常量:换一个值它就跟着变。
|
||||
storage.SetDefaultMMRDiversity(0.1)
|
||||
|
||||
db := &nsAwareRecallLance{rows: debugProbeRows()}
|
||||
// 请求体不含 diversity 字段 ⇒ 走「未显式指定」分支
|
||||
code, m := runRecallDebugHTTP(t, db, `{"query":"生产默认 diversity 口径回归","limit":5,"namespace":"hermes-main"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("HTTP=%d body=%v", code, m)
|
||||
}
|
||||
det := debugMMRDetail(m)
|
||||
want := "diversity=0.1, final="
|
||||
if !strings.Contains(det, want) {
|
||||
t.Fatalf("✗ 未传 diversity 时 mmr 行应报生产默认值(0.1),实际 %q(应含 %q)", det, want)
|
||||
}
|
||||
t.Logf("未传 diversity:mmr=%q ✓(与生产 DefaultMMRDiversity 同源)", det)
|
||||
}
|
||||
|
||||
// TestRecallDebugDiversityFollowsTunerPush:换一个推送值,debug 跟着变 ⇒ 证明非硬编码。
|
||||
func TestRecallDebugDiversityFollowsTunerPush(t *testing.T) {
|
||||
saved := storage.DefaultMMRDiversity()
|
||||
t.Cleanup(func() { storage.SetDefaultMMRDiversity(saved) })
|
||||
storage.SetDefaultMMRDiversity(0.42) // 非 0.1 的哨兵值:修后若仍报 0.1 即为硬编码
|
||||
|
||||
db := &nsAwareRecallLance{rows: debugProbeRows()}
|
||||
code, m := runRecallDebugHTTP(t, db, `{"query":"调参推送值跟随回归","limit":5,"namespace":"hermes-main"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("HTTP=%d body=%v", code, m)
|
||||
}
|
||||
det := debugMMRDetail(m)
|
||||
if !strings.Contains(det, "diversity=0.4,") && !strings.Contains(det, "diversity=0.42") {
|
||||
t.Fatalf("✗ mmr 行应跟随 tuner 推送值(0.42),实际 %q(硬编码或未对齐)", det)
|
||||
}
|
||||
t.Logf("tuner 推 0.42:mmr=%q ✓(非硬编码)", det)
|
||||
}
|
||||
|
||||
// TestRecallDebugDiversityExplicitOverridesDefault:显式传 diversity 时显式值优先,不被默认覆盖。
|
||||
func TestRecallDebugDiversityExplicitOverridesDefault(t *testing.T) {
|
||||
saved := storage.DefaultMMRDiversity()
|
||||
t.Cleanup(func() { storage.SetDefaultMMRDiversity(saved) })
|
||||
storage.SetDefaultMMRDiversity(0.1)
|
||||
|
||||
db := &nsAwareRecallLance{rows: debugProbeRows()}
|
||||
code, m := runRecallDebugHTTP(t, db, `{"query":"显式 diversity 优先回归","limit":5,"namespace":"hermes-main","diversity":0.7}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("HTTP=%d body=%v", code, m)
|
||||
}
|
||||
det := debugMMRDetail(m)
|
||||
if !strings.Contains(det, "diversity=0.7,") {
|
||||
t.Fatalf("✗ 显式传 0.7 时 mmr 行应报 0.7(显式值优先),实际 %q", det)
|
||||
}
|
||||
t.Logf("显式传 0.7:mmr=%q ✓(显式值优先)", det)
|
||||
}
|
||||
@@ -85,6 +85,11 @@ func (f *fakeLanceDB) Update(table, id string, fields map[string]any) error {
|
||||
return nil
|
||||
}
|
||||
|
||||
// GetRecordByID t_0f1d7be9(原文层):fake 默认不存在。
|
||||
func (f *fakeLanceDB) GetRecordByID(table, id string) (*models.MemoryRecord, error) {
|
||||
return nil, nil
|
||||
}
|
||||
|
||||
// ─── 测试用例 ─────────────────────────────────────────────
|
||||
|
||||
// TestRecallSuccess_Returns200WithResults 验证成功路径:200 + results 键存在 + candidates_scanned。
|
||||
|
||||
@@ -0,0 +1,115 @@
|
||||
package routes
|
||||
|
||||
// 2026-10-26(P1-3):stale-return + 生命周期 fixture(10:00 生效 / 11:00 失效)。
|
||||
//
|
||||
// 评审缺口:「只有离线检索指标,没有 stale-return、没有生命周期 fixture」。
|
||||
// 本测试把三条读侧生命周期行为锁成机械判据:
|
||||
// ① bi-temporal 开启时,valid_to 已过的事实**不进 top-k**(但仍在库,non-lossy);
|
||||
// ② valid_to 在未来 / 为空 ⇒ 正常返回(同一 fixture 的对照,证明不是「整类被吞」);
|
||||
// ③ updated_at 超 720h ⇒ 响应 stale=true;新记录不输出该键。
|
||||
//
|
||||
// 时窗用真实语义:fixture 事实 10:00 生效、11:00 失效,查询时点取「当日 11:00 之后」。
|
||||
|
||||
import (
|
||||
"testing"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
)
|
||||
|
||||
// 时窗用**相对时间**:曾经写成 dayAt(10,0)/dayAt(11,0) 假设「跑测试时已是晚上 20:00」,
|
||||
// 凌晨 02:07 跑就是 flaky —— 11:00 还没到,「已失效」的 fixture 其实仍有效。
|
||||
// 生命周期判据必须与运行时刻无关:过期 = now-1h,有效期 = now+24h。
|
||||
func expiredPair() (from, to, future string) {
|
||||
now := time.Now()
|
||||
return now.Add(-2 * time.Hour).Format(time.RFC3339),
|
||||
now.Add(-1 * time.Hour).Format(time.RFC3339),
|
||||
now.Add(24 * time.Hour).Format(time.RFC3339)
|
||||
}
|
||||
|
||||
func idsOf(m map[string]interface{}) map[string]bool {
|
||||
out := map[string]bool{}
|
||||
if res, ok := m["results"].([]interface{}); ok {
|
||||
for _, raw := range res {
|
||||
if r, ok := raw.(map[string]interface{}); ok {
|
||||
if id, ok := r["id"].(string); ok {
|
||||
out[id] = true
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
func TestRecall_Lifecycle_ExpiredFactDroppedWhenBitemporal(t *testing.T) {
|
||||
from, to, future := expiredPair()
|
||||
|
||||
db := &fakeLanceDB{searchResults: []models.MemoryRecord{
|
||||
{ID: "mem_expired_window", Content: "生命周期 fixture:10:00 生效 11:00 失效的事实",
|
||||
Category: "distilled", ValidFrom: from, ValidTo: to},
|
||||
{ID: "mem_still_valid", Content: "生命周期 fixture:仍在有效期内的事实",
|
||||
Category: "distilled", ValidFrom: from, ValidTo: future},
|
||||
}}
|
||||
t.Setenv("ZHIYI_BITEMPORAL", "1")
|
||||
code, m, body := recallBody(t, db, `{"query":"生命周期 fixture 有效期","limit":5,"namespace":"hermes-main"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("expected 200, got %d; body=%s", code, body)
|
||||
}
|
||||
ids := idsOf(m)
|
||||
if ids["mem_expired_window"] {
|
||||
t.Fatalf("11:00 已失效的事实不应进 top-k(bi-temporal 开);body=%s", body)
|
||||
}
|
||||
if !ids["mem_still_valid"] {
|
||||
t.Fatalf("有效期未过的事实必须正常返回(对照缺失 ⇒ 可能是整类被吞);body=%s", body)
|
||||
}
|
||||
}
|
||||
|
||||
func TestRecall_Lifecycle_ExpiredFactVisibleWhenBitemporalOff(t *testing.T) {
|
||||
// 开关关(默认)⇒ 行为零变化:过期事实照常返回,但 valid_to 字段可见(读侧能自己判)。
|
||||
from, to, _ := expiredPair()
|
||||
db := &fakeLanceDB{searchResults: []models.MemoryRecord{
|
||||
{ID: "mem_expired_visible", Content: "生命周期 fixture:过期但可见", Category: "distilled",
|
||||
ValidFrom: from, ValidTo: to},
|
||||
}}
|
||||
t.Setenv("ZHIYI_BITEMPORAL", "0")
|
||||
code, m, body := recallBody(t, db, `{"query":"过期但可见","limit":5,"namespace":"hermes-main"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("expected 200, got %d; body=%s", code, body)
|
||||
}
|
||||
if !idsOf(m)["mem_expired_visible"] {
|
||||
t.Fatalf("bi-temporal 关时过期事实应照常返回(non-lossy 可见性);body=%s", body)
|
||||
}
|
||||
var found map[string]interface{}
|
||||
for _, raw := range m["results"].([]interface{}) {
|
||||
if r, ok := raw.(map[string]interface{}); ok && r["id"] == "mem_expired_visible" {
|
||||
found = r
|
||||
}
|
||||
}
|
||||
if found == nil || found["valid_to"] != to {
|
||||
t.Fatalf("valid_to 必须直通给读侧:%v", found)
|
||||
}
|
||||
}
|
||||
|
||||
func TestRecall_StaleReturn_DefaultThreshold(t *testing.T) {
|
||||
old := time.Now().Add(-31 * 24 * time.Hour)
|
||||
db := &fakeLanceDB{searchResults: []models.MemoryRecord{
|
||||
{ID: "mem_old", Content: "陈年事实(31 天未更新)", Category: "distilled", UpdatedAt: old},
|
||||
{ID: "mem_new", Content: "新鲜事实(今天更新)", Category: "distilled", UpdatedAt: time.Now()},
|
||||
}}
|
||||
code, m, body := recallBody(t, db, `{"query":"事实 新鲜度","limit":5,"namespace":"hermes-main"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("expected 200, got %d; body=%s", code, body)
|
||||
}
|
||||
got := map[string]map[string]interface{}{}
|
||||
for _, raw := range m["results"].([]interface{}) {
|
||||
if r, ok := raw.(map[string]interface{}); ok {
|
||||
got[r["id"].(string)] = r
|
||||
}
|
||||
}
|
||||
if got["mem_old"] == nil || got["mem_old"]["stale"] != true {
|
||||
t.Fatalf("31 天未更新的记忆应 stale=true:%v", got["mem_old"])
|
||||
}
|
||||
if _, ok := got["mem_new"]["stale"]; ok {
|
||||
t.Fatalf("新记忆不应输出 stale 键:%v", got["mem_new"])
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,66 @@
|
||||
// t_0f1d7be9(原文层):recall 响应字段集合向后兼容闸门。
|
||||
// 判据:新实现产出的 RecallResult,其 JSON 字段集合必须 ⊇ 旧字段集
|
||||
// (omitempty 导致的 per-row 缺键不算删除 —— 这里以「完整记录序列化」为对比对象)。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"testing"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
)
|
||||
|
||||
// legacyRecallFields 是 2026-11-06 生产基线(t_0f1d7be9 改前采集)里
|
||||
// 一条「信息最全」的 recall 结果的全部 JSON key(含 omitempty 触发才出现的键)。
|
||||
// 任何一条记录缺这里的键 = 删字段事故;新增键允许(只多不少)。
|
||||
var legacyRecallFields = []string{
|
||||
"category", "channel", "confidence", "content", "generation",
|
||||
"human_useful_count", "id", "namespace",
|
||||
"quality_score", "quality_score_reliable", "score", "source",
|
||||
"stale", "timestamp", "v_value",
|
||||
}
|
||||
|
||||
func TestRecallResultFieldSetSupersetOfLegacy(t *testing.T) {
|
||||
conf := 0.8
|
||||
hu := 3
|
||||
full := models.RecallResult{
|
||||
ID: "mem_x", Content: "c", Category: "distilled", Score: 0.5,
|
||||
Timestamp: time.Now().Format(time.RFC3339), Namespace: "ns", AgentID: "a",
|
||||
Source: "llm_distill", DerivedFrom: "ep_1",
|
||||
Confidence: &conf,
|
||||
ConfidenceSource: "explicit",
|
||||
QualityScore: 0.7,
|
||||
QualityScoreReliable: true,
|
||||
VValue: 0.6,
|
||||
HumanUsefulCount: &hu,
|
||||
Stale: true, // 非零值才进 omitempty 序列化面(闸门测"字段还在",非 per-row 省略)
|
||||
Channel: "vector",
|
||||
ValidFrom: "2026-01-01T00:00:00Z",
|
||||
FtsBoosted: true,
|
||||
Version: 2,
|
||||
}
|
||||
b, err := json.Marshal(full)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
var m map[string]interface{}
|
||||
_ = json.Unmarshal(b, &m)
|
||||
for _, k := range legacyRecallFields {
|
||||
if _, ok := m[k]; !ok {
|
||||
t.Fatalf("✗ 旧字段 %q 在新 RecallResult 里消失(删字段=破坏兼容);keys=%v", k, keysOf(m))
|
||||
}
|
||||
}
|
||||
// 本卡新增(下钻指针)必须可见
|
||||
if m["derived_from"] != "ep_1" {
|
||||
t.Fatalf("✗ derived_from 未直通(42.8%% 指针接不上=本卡失职): %v", m["derived_from"])
|
||||
}
|
||||
}
|
||||
|
||||
func keysOf(m map[string]interface{}) []string {
|
||||
out := make([]string, 0, len(m))
|
||||
for k := range m {
|
||||
out = append(out, k)
|
||||
}
|
||||
return out
|
||||
}
|
||||
@@ -0,0 +1,144 @@
|
||||
package routes
|
||||
|
||||
// t_3aa2a8c1:`/api/v1/recall` 响应暴露 `truncated`(Rust 侧单次重读行数上限截断标志,
|
||||
// 引擎已算、此前只打日志不上抛)。选定的省略语义 = **键缺失即未截断(omitempty)**。
|
||||
// 本测试经路由层机械判定:
|
||||
// ① 粗检索被截断(后端实现 SearchTruncationReporter 且上报 true)⇒ 响应含 "truncated":true
|
||||
// ② 未截断 / 纯 Go 后端(不实现 reporter)⇒ 键缺失(不出现 truncated:false 以外的值)
|
||||
// ③ 回归:既有字段 results/count/candidates_scanned/mode/cache_hit 行为不变
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http/httptest"
|
||||
"strings"
|
||||
"testing"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// truncReportingLDB 复用同包 fakeLanceDB(recall_error_shape_test.go),
|
||||
// 额外实现可选扩展接口 SearchWithTruncationReporter(t_3aa2a8c1)。
|
||||
type truncReportingLDB struct {
|
||||
*fakeLanceDB
|
||||
reportTruncated bool
|
||||
}
|
||||
|
||||
func (f *truncReportingLDB) SearchWithTruncation(table string, vector []float32, topK int, namespaceFilter string) ([]models.MemoryRecord, bool, error) {
|
||||
if f.searchErr != nil {
|
||||
return nil, false, f.searchErr
|
||||
}
|
||||
if len(f.searchResults) > topK {
|
||||
return f.searchResults[:topK], f.reportTruncated, nil
|
||||
}
|
||||
return f.searchResults, f.reportTruncated, nil
|
||||
}
|
||||
|
||||
func recallBody(t *testing.T, db storage.LanceDB, body string) (int, map[string]interface{}, string) {
|
||||
t.Helper()
|
||||
// 测试须可复跑(t_3aa2a8c1 实测踩坑):SearchCacheInstance 由 storage 包 init() 恒建
|
||||
// (L2 = 共享 Redis,TTL 60s)⇒ 上一次 run 的 recall 结果会进 L2,下一次 run 同 key
|
||||
// 命中缓存路径(Truncated 恒 false)⇒ 断言 flaky。逐测试摘除缓存(测后恢复),
|
||||
// 恒走未缓存路径。包内无 t.Parallel ⇒ 改全局安全。
|
||||
saved := storage.SearchCacheInstance
|
||||
storage.SearchCacheInstance = nil
|
||||
t.Cleanup(func() { storage.SearchCacheInstance = saved })
|
||||
|
||||
emb := storage.NewEmbedder("")
|
||||
rerank := storage.NewReranker("", emb)
|
||||
api := NewAPI(db, emb, rerank, nil, governance.NewInMemoryGraph())
|
||||
req := httptest.NewRequest("POST", "/api/v1/recall", strings.NewReader(body))
|
||||
w := httptest.NewRecorder()
|
||||
api.Recall(w, req)
|
||||
var m map[string]interface{}
|
||||
_ = json.Unmarshal(w.Body.Bytes(), &m)
|
||||
return w.Code, m, w.Body.String()
|
||||
}
|
||||
|
||||
// 既有响应键回归基线(t_2d4e3b92 成功 schema + t_1c12e000 cache_hit + t_949840b1 candidates_scanned)
|
||||
var recallBaselineKeys = []string{"results", "count", "candidates_scanned", "mode", "cache_hit"}
|
||||
|
||||
func assertBaseline(t *testing.T, m map[string]interface{}, body string) {
|
||||
t.Helper()
|
||||
for _, k := range recallBaselineKeys {
|
||||
if _, ok := m[k]; !ok {
|
||||
t.Fatalf("既有字段 %q 缺失(回归破坏),body=%s", k, body)
|
||||
}
|
||||
}
|
||||
if res, ok := m["results"].([]interface{}); ok {
|
||||
if cnt, _ := m["count"].(float64); int(cnt) != len(res) {
|
||||
t.Fatalf("count=%v 与 len(results)=%d 不一致(回归破坏)", m["count"], len(res))
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// ① 粗检索被行数上限截断 ⇒ 响应暴露 truncated:true + 既有字段回归不变
|
||||
func TestRecall_TruncatedExposedWhenHitCap(t *testing.T) {
|
||||
db := &truncReportingLDB{
|
||||
fakeLanceDB: &fakeLanceDB{searchResults: []models.MemoryRecord{
|
||||
{ID: "mem_1", Content: "test memory one", Category: "distilled"},
|
||||
{ID: "mem_2", Content: "test memory two", Category: "distilled"},
|
||||
}},
|
||||
reportTruncated: true,
|
||||
}
|
||||
code, m, body := recallBody(t, db, `{"query":"test query","limit":5,"namespace":"shared"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("expected 200, got %d; body=%s", code, body)
|
||||
}
|
||||
if v, ok := m["truncated"]; !ok || v != true {
|
||||
t.Fatalf("粗检索已截断,响应必须含 truncated:true;实际 key 存在=%v 值=%v body=%s", ok, m["truncated"], body)
|
||||
}
|
||||
assertBaseline(t, m, body)
|
||||
}
|
||||
|
||||
// ①b keyword 主路径(kwMeta 透传)同判据
|
||||
func TestRecall_Keyword_TruncatedExposed(t *testing.T) {
|
||||
db := &truncReportingLDB{
|
||||
fakeLanceDB: &fakeLanceDB{searchResults: []models.MemoryRecord{
|
||||
{ID: "mem_1", Content: "keyword memory", Category: "distilled"},
|
||||
}},
|
||||
reportTruncated: true,
|
||||
}
|
||||
code, m, body := recallBody(t, db, `{"query":"keyword query","limit":5,"mode":"keyword","namespace":"shared"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("expected 200, got %d; body=%s", code, body)
|
||||
}
|
||||
if v, ok := m["truncated"]; !ok || v != true {
|
||||
t.Fatalf("keyword 路径粗检索已截断,响应必须含 truncated:true;body=%s", body)
|
||||
}
|
||||
assertBaseline(t, m, body)
|
||||
}
|
||||
|
||||
// ② 未截断 ⇒ 键缺失(选定语义:省略=未截断),不得出现 truncated:false 以外的值
|
||||
func TestRecall_NotTruncated_KeyOmitted(t *testing.T) {
|
||||
db := &truncReportingLDB{
|
||||
fakeLanceDB: &fakeLanceDB{searchResults: []models.MemoryRecord{
|
||||
{ID: "mem_1", Content: "test memory one", Category: "distilled"},
|
||||
}},
|
||||
reportTruncated: false,
|
||||
}
|
||||
code, m, body := recallBody(t, db, `{"query":"test query","limit":5,"namespace":"shared"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("expected 200, got %d; body=%s", code, body)
|
||||
}
|
||||
if v, ok := m["truncated"]; ok {
|
||||
t.Fatalf("未截断场景键应缺失(省略=未截断);实际 truncated=%v body=%s", v, body)
|
||||
}
|
||||
assertBaseline(t, m, body)
|
||||
}
|
||||
|
||||
// ②b 纯 Go 后端(不实现 SearchTruncationReporter)⇒ 键缺失,零值语义、行为不变
|
||||
func TestRecall_PureGoBackend_NoTruncatedKey(t *testing.T) {
|
||||
db := &fakeLanceDB{searchResults: []models.MemoryRecord{
|
||||
{ID: "mem_1", Content: "test memory one", Category: "distilled"},
|
||||
}}
|
||||
code, m, body := recallBody(t, db, `{"query":"test query","limit":5,"namespace":"shared"}`)
|
||||
if code != 200 {
|
||||
t.Fatalf("expected 200, got %d; body=%s", code, body)
|
||||
}
|
||||
if _, ok := m["truncated"]; ok {
|
||||
t.Fatalf("纯 Go 后端无行数上限,truncated 键必须缺失;body=%s", body)
|
||||
}
|
||||
assertBaseline(t, m, body)
|
||||
}
|
||||
@@ -0,0 +1,327 @@
|
||||
package routes
|
||||
|
||||
// 织忆自检端点(2026-10-26,牧尘批「三档」)
|
||||
//
|
||||
// 背景:织忆相关的定时自检脚本有 ~20 个,取数方式三套并存——
|
||||
// ① 直连生产库 lancedb.connect("/var/lib/memoryweave")(绕过服务、schema 一改就静默腐烂)
|
||||
// ② IPC socket 自定义协议
|
||||
// ③ HTTP /api/v1/{stats,popwatch,metrics/self}
|
||||
// 三套契约对同一个库,schema 变更时分开损坏。典型事故:pattern 自检脚本写死
|
||||
// type='pattern',库里实际是 pattern_stat ⇒ 连续数月静默 0 输出。
|
||||
//
|
||||
// 本端点是**唯一取数契约**:把「读织忆内部状态」收敛成一份结构化 JSON。
|
||||
// 设计边界(不做什么):
|
||||
// - 不做判定/告警/投递 —— 阈值、渠道、评审留在外部 cron(观测者不能住在被观测者体内:
|
||||
// zhiyid 一挂自检就跟着哑,内外同时沉默是更坏的故障)。
|
||||
// - 不跑重活(eval 全量、备份、vacuum)—— 那些抢生产资源,留在 systemd-run 独立 scope。
|
||||
//
|
||||
// level 语义:
|
||||
// - cheap(默认,<50ms):只读内存态/计数,不扫全表。
|
||||
// - full(秒级):额外扫全表算碎片率/冗余率/近 7 天质量/写量分布(原 quality-watch 口径)。
|
||||
//
|
||||
// 兼容铁律:本端点返回的比率一律给「分子/分母/样本是否足够」,缺数据不返回 0
|
||||
// (0 会被下游读成"很好")。沿用 selfoptimize 的 metricNA(-1) 语义。
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"fmt"
|
||||
"math"
|
||||
"net/http"
|
||||
"os"
|
||||
"path/filepath"
|
||||
"strings"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/distill"
|
||||
"github.com/xiaoxue/memoryweave/internal/selfoptimize"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// SelfcheckSchemaVersion 变更返回结构时递增;消费方据此判兼容。
|
||||
const SelfcheckSchemaVersion = "1"
|
||||
|
||||
// 与 zhiyi-quality-watch.py 同口径(该脚本已改为读本端点,口径只此一处)
|
||||
const (
|
||||
selfcheckFragLen = 20 // <20 字符 = 碎片
|
||||
selfcheckDupMinSample = 5000 // 冗余率最小样本(活行),不足只报样本不判率
|
||||
selfcheckScanLimit = 300000
|
||||
)
|
||||
|
||||
type selfcheckQuality struct {
|
||||
TotalRows int `json:"total_rows"`
|
||||
LiveRows int `json:"live_rows"`
|
||||
ScannedRows int `json:"scanned_rows"`
|
||||
ScanTruncated bool `json:"scan_truncated"`
|
||||
Coverage float64 `json:"coverage"` // 扫描行 / store 真实总量;<1 表示结果不完整,禁止据此下结论
|
||||
FragLen int `json:"frag_len"`
|
||||
|
||||
FragRowsAll int `json:"frag_rows_all"`
|
||||
FragRateAll float64 `json:"frag_rate_all"`
|
||||
FragRowsLive int `json:"frag_rows_live"`
|
||||
FragRateLive float64 `json:"frag_rate_live"`
|
||||
|
||||
DupGroups int `json:"dup_groups"`
|
||||
DupExtraRows int `json:"dup_extra_rows"`
|
||||
DupRate float64 `json:"dup_rate"`
|
||||
DupSampleOK bool `json:"dup_sample_ok"`
|
||||
|
||||
NewRows7d int `json:"new_rows_7d"`
|
||||
NewFragRows7d int `json:"new_frag_rows_7d"`
|
||||
NewFragRate7d *float64 `json:"new_frag_rate_7d"` // nil = 近 7 天无新增(无分母)
|
||||
}
|
||||
|
||||
type selfcheckDayCount struct {
|
||||
Date string `json:"date"`
|
||||
Rows int `json:"rows"`
|
||||
Live int `json:"live"`
|
||||
}
|
||||
|
||||
type selfcheckWriteVolume struct {
|
||||
Days []selfcheckDayCount `json:"days"`
|
||||
Today int `json:"today"`
|
||||
Last7d int `json:"last_7d"`
|
||||
Median7d float64 `json:"median_7d"`
|
||||
P25_7d float64 `json:"p25_7d"`
|
||||
}
|
||||
|
||||
// Selfcheck GET /api/v1/selfcheck?level=cheap|full
|
||||
func (a *API) Selfcheck(w http.ResponseWriter, r *http.Request) {
|
||||
start := time.Now()
|
||||
if r.Method != http.MethodGet {
|
||||
respondError(w, http.StatusMethodNotAllowed, "method not allowed")
|
||||
return
|
||||
}
|
||||
level := strings.ToLower(strings.TrimSpace(r.URL.Query().Get("level")))
|
||||
if level == "" {
|
||||
level = "cheap"
|
||||
}
|
||||
if level != "cheap" && level != "full" {
|
||||
respondError(w, http.StatusBadRequest, "level must be cheap|full")
|
||||
return
|
||||
}
|
||||
|
||||
rep := map[string]interface{}{
|
||||
"schema_version": SelfcheckSchemaVersion,
|
||||
"checked_at": time.Now().Format(time.RFC3339),
|
||||
"level": level,
|
||||
}
|
||||
degraded := []string{}
|
||||
|
||||
// ── 存储总量 ───────────────────────────────
|
||||
if st, err := a.LanceDB.Stats(); err != nil {
|
||||
degraded = append(degraded, "store: "+err.Error())
|
||||
} else {
|
||||
total := numOf(st["total_memories"])
|
||||
tomb := numOf(st["tombstone_count"])
|
||||
live := total - tomb
|
||||
if live < 0 {
|
||||
live = 0
|
||||
}
|
||||
store := map[string]interface{}{
|
||||
"backend": st["backend"],
|
||||
"data_dir": st["data_dir"],
|
||||
"total_memories": total,
|
||||
"total_episodes": numOf(st["total_episodes"]),
|
||||
"tombstone_count": tomb,
|
||||
"live_memories": live,
|
||||
}
|
||||
if total > 0 {
|
||||
store["tombstone_rate"] = round4(tomb / total)
|
||||
} else {
|
||||
store["tombstone_rate"] = -1.0 // N/A:空库无分母
|
||||
}
|
||||
rep["store"] = store
|
||||
}
|
||||
|
||||
// ── 图谱 ───────────────────────────────────
|
||||
if a.GraphStore != nil {
|
||||
n, e, d := a.GraphStore.Stats()
|
||||
rep["graph"] = map[string]interface{}{
|
||||
"node_count": n,
|
||||
"edge_count": e,
|
||||
"density": round4(d),
|
||||
}
|
||||
} else {
|
||||
degraded = append(degraded, "graph: store not initialised")
|
||||
}
|
||||
|
||||
// ── pattern 召回的两侧健康(2026-10-26 新增)──────────
|
||||
// 事故背景:`POST /api/v1/patterns/detect` 是短命单发端点,全库 0 cron、0 调用方,
|
||||
// 于是 graph_nodes(type='pattern') 恒 0 行、recall 恒 0 命中,而日志层面完全沉默
|
||||
// (只能靠人翻 7 天日志才发现「实现了 ≠ 出过数」)。这里把「写入端有没有产数」
|
||||
// 变成一次 GET 就能读到的事实:rows=0 ⇒ 生产者坏了或从未接线,别去查读侧 SQL。
|
||||
rep["pattern"] = patternHealth(a)
|
||||
|
||||
// ── 面板指标(反馈/蒸馏/gap/cascade,含 _valid/_samples 语义)──
|
||||
rep["dashboard"] = selfoptimize.Dash.Metrics()
|
||||
|
||||
// ── 整合链路(内存态,<1ms)────────────────
|
||||
tracker := GetConsolTracker()
|
||||
consolStatus, consolFails, sinceSuccess, lastErr := tracker.HealthStatus()
|
||||
_, consolSkips, lastSkip, _ := tracker.Snapshot()
|
||||
rep["consolidate"] = map[string]interface{}{
|
||||
"status": consolStatus,
|
||||
"consec_failures": consolFails,
|
||||
"skipped": consolSkips,
|
||||
"last_skip": lastSkip,
|
||||
"last_success_age": sinceSuccess.String(),
|
||||
"last_error": lastErr,
|
||||
}
|
||||
|
||||
// ── 缓存 / FTS ─────────────────────────────
|
||||
cache := map[string]interface{}{"fts_index": storage.FtsIndexStats()}
|
||||
if storage.SearchCacheInstance != nil {
|
||||
cache["search_cache"] = storage.SearchCacheInstance.Stats()
|
||||
}
|
||||
rep["cache"] = cache
|
||||
|
||||
// ── 空壳拦截器(t_e11207f8 取证)───────────
|
||||
checks, blocks, loaded, rulesPath := distill.PayloadGuardStats()
|
||||
rep["payload_guard"] = map[string]interface{}{
|
||||
"checks": checks,
|
||||
"blocks": blocks,
|
||||
"loaded": loaded,
|
||||
"rules_path": rulesPath,
|
||||
}
|
||||
|
||||
// ── 全量质量段(level=full):读卫星快照,不在本进程扫全表 ────────
|
||||
// 设计:全表扫描是重活(4 万行 × 内容),且 daemon 还有 recall 要跑。
|
||||
// 取数由仓库内 tools/selfcheck_full.py 完成(列投影只读,1.7s / 250MB,独立进程),
|
||||
// 写 ~/.hermes/state/zhiyi-quality.json;本端点只读快照并标注新鲜度。
|
||||
// 这样"取数"只有一处实现(跟 schema 同仓),"判定/告警"仍在外部 cron。
|
||||
if level == "full" {
|
||||
snap, err := loadQualitySnapshot()
|
||||
if err != nil {
|
||||
degraded = append(degraded, "quality: "+err.Error())
|
||||
} else {
|
||||
rep["quality"] = snap.Quality
|
||||
rep["write_volume"] = snap.WriteVolume
|
||||
rep["quality_as_of"] = snap.GeneratedAt
|
||||
rep["quality_age_s"] = snap.AgeSeconds()
|
||||
rep["quality_stale"] = snap.AgeSeconds() > qualityStaleAfter
|
||||
}
|
||||
}
|
||||
|
||||
if len(degraded) > 0 {
|
||||
rep["degraded"] = degraded
|
||||
}
|
||||
rep["duration_ms"] = time.Since(start).Milliseconds()
|
||||
|
||||
w.Header().Set("Content-Type", "application/json")
|
||||
w.WriteHeader(http.StatusOK)
|
||||
json.NewEncoder(w).Encode(rep)
|
||||
}
|
||||
|
||||
// qualityStaleAfter:快照超过这个时长未刷新 ⇒ 标记 stale(消费方不得据此下结论)。
|
||||
const qualityStaleAfter = 6 * 3600
|
||||
|
||||
// qualitySnapshot 对应仓库内 tools/selfcheck_full.py 的产出。
|
||||
// 字段名与 python 侧严格一致(schema_version=1)。
|
||||
type qualitySnapshot struct {
|
||||
SchemaVersion int `json:"schema_version"`
|
||||
GeneratedAt string `json:"generated_at"`
|
||||
Source struct {
|
||||
DB string `json:"db"`
|
||||
Table string `json:"table"`
|
||||
Mode string `json:"mode"`
|
||||
} `json:"source"`
|
||||
DurationMS int `json:"duration_ms"`
|
||||
Quality json.RawMessage `json:"quality"`
|
||||
WriteVolume json.RawMessage `json:"write_volume"`
|
||||
fileModTime time.Time
|
||||
}
|
||||
|
||||
func (q *qualitySnapshot) AgeSeconds() int64 {
|
||||
if q.fileModTime.IsZero() {
|
||||
return -1
|
||||
}
|
||||
return int64(time.Since(q.fileModTime).Seconds())
|
||||
}
|
||||
|
||||
// QualitySnapshotPath 允许用 env 覆盖(测试/灰度)。
|
||||
func QualitySnapshotPath() string {
|
||||
if p := strings.TrimSpace(os.Getenv("ZHIYI_QUALITY_SNAPSHOT")); p != "" {
|
||||
return p
|
||||
}
|
||||
home, _ := os.UserHomeDir()
|
||||
return filepath.Join(home, ".hermes", "state", "zhiyi-quality.json")
|
||||
}
|
||||
|
||||
func loadQualitySnapshot() (*qualitySnapshot, error) {
|
||||
p := QualitySnapshotPath()
|
||||
fi, err := os.Stat(p)
|
||||
if err != nil {
|
||||
return nil, fmt.Errorf("快照不存在(先跑 tools/selfcheck_full.py):%w", err)
|
||||
}
|
||||
raw, err := os.ReadFile(p)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
}
|
||||
var snap qualitySnapshot
|
||||
if err := json.Unmarshal(raw, &snap); err != nil {
|
||||
return nil, fmt.Errorf("快照解析失败: %w", err)
|
||||
}
|
||||
snap.fileModTime = fi.ModTime()
|
||||
return &snap, nil
|
||||
}
|
||||
|
||||
// numOf 把 stats 里可能是 float64/int/json.Number 的数值统一成 float64。
|
||||
func numOf(v interface{}) float64 {
|
||||
switch x := v.(type) {
|
||||
case float64:
|
||||
return x
|
||||
case float32:
|
||||
return float64(x)
|
||||
case int:
|
||||
return float64(x)
|
||||
case int64:
|
||||
return float64(x)
|
||||
case json.Number:
|
||||
f, _ := x.Float64()
|
||||
return f
|
||||
default:
|
||||
return 0
|
||||
}
|
||||
}
|
||||
|
||||
func round4(f float64) float64 {
|
||||
if math.IsNaN(f) || math.IsInf(f, 0) {
|
||||
return -1
|
||||
}
|
||||
return math.Round(f*10000) / 10000
|
||||
}
|
||||
|
||||
// patternHealth 一眼判定 pattern 召回是「有生产者」还是「恒 0」。
|
||||
//
|
||||
// 为什么需要它:2026-10-26 排查发现 pattern 召回 0 命中,真根因是写入端从未产数
|
||||
// (detect 端点无 cron、无调用方),但表面症状看起来像读侧 SQL bug —— 白查一轮方向。
|
||||
// 判据三类:
|
||||
//
|
||||
// producing 有行、有 id、有生产时间 → 读侧再 0 命中就该查 Match 阈值/properties;
|
||||
// zero_output 0 行 → 生产端问题,别去动读侧 SQL;
|
||||
// no_id 有行但 id 全空 → store.ListPatterns 会全 skip(存量冻结的典型形态)。
|
||||
func patternHealth(a *API) map[string]interface{} {
|
||||
out := map[string]interface{}{
|
||||
"rows": -1, // -1 = 未知,别当 0 用
|
||||
"rows_with_id": -1,
|
||||
"last_produced_at": "",
|
||||
"verdict": "unknown",
|
||||
}
|
||||
if a == nil || a.GraphStore == nil {
|
||||
out["verdict"] = "no_graph_store"
|
||||
return out
|
||||
}
|
||||
rows, withID, last := a.GraphStore.CountNodesByType("pattern")
|
||||
out["rows"], out["rows_with_id"], out["last_produced_at"] = rows, withID, last
|
||||
switch {
|
||||
case rows == 0:
|
||||
out["verdict"] = "zero_output"
|
||||
case withID == 0:
|
||||
out["verdict"] = "no_id"
|
||||
case last == "":
|
||||
out["verdict"] = "unknown_age"
|
||||
default:
|
||||
out["verdict"] = "producing"
|
||||
}
|
||||
return out
|
||||
}
|
||||
@@ -0,0 +1,99 @@
|
||||
package routes
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"os"
|
||||
"path/filepath"
|
||||
"testing"
|
||||
"time"
|
||||
)
|
||||
|
||||
// 快照契约测试:/api/v1/selfcheck?level=full 依赖 tools/selfcheck_full.py 的产出格式。
|
||||
// 这里钉住 schema_version 与关键字段,防止 python 侧改字段名后 Go 侧静默返回空。
|
||||
func TestLoadQualitySnapshot(t *testing.T) {
|
||||
dir := t.TempDir()
|
||||
p := filepath.Join(dir, "zhiyi-quality.json")
|
||||
body := `{
|
||||
"schema_version": 1,
|
||||
"generated_at": "2026-10-26T13:20:00+0800",
|
||||
"source": {"db": "/var/lib/memoryweave", "table": "memories", "mode": "read_only_projection"},
|
||||
"duration_ms": 1680,
|
||||
"quality": {
|
||||
"frag_len": 20, "total_rows": 39957, "live_rows": 39836,
|
||||
"frag_rows_all": 313, "frag_rate_all": 0.0078,
|
||||
"frag_rows_live": 313, "frag_rate_live": 0.0079,
|
||||
"dup_groups": 34, "dup_extra_rows": 103, "dup_rate": 0.0026,
|
||||
"new_rows_7d": 1176, "new_frag_rows_7d": 35, "new_frag_rate_7d": 0.0298
|
||||
},
|
||||
"write_volume": {
|
||||
"days": [{"date": "2026-10-25", "rows": 1473, "live": 1471}],
|
||||
"today": 332, "today_date": "2026-10-26", "last_7d": 7706, "nonzero_days": 60
|
||||
}
|
||||
}`
|
||||
if err := os.WriteFile(p, []byte(body), 0o644); err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
t.Setenv("ZHIYI_QUALITY_SNAPSHOT", p)
|
||||
|
||||
snap, err := loadQualitySnapshot()
|
||||
if err != nil {
|
||||
t.Fatalf("loadQualitySnapshot: %v", err)
|
||||
}
|
||||
if snap.SchemaVersion != 1 {
|
||||
t.Fatalf("schema_version=%d want 1", snap.SchemaVersion)
|
||||
}
|
||||
|
||||
var q struct {
|
||||
TotalRows int `json:"total_rows"`
|
||||
LiveRows int `json:"live_rows"`
|
||||
DupRate float64 `json:"dup_rate"`
|
||||
FragRowsAll int `json:"frag_rows_all"`
|
||||
}
|
||||
if err := json.Unmarshal(snap.Quality, &q); err != nil {
|
||||
t.Fatalf("quality 段解析失败: %v", err)
|
||||
}
|
||||
if q.TotalRows != 39957 || q.LiveRows != 39836 {
|
||||
t.Fatalf("quality 口径不符: %+v", q)
|
||||
}
|
||||
if q.FragRowsAll != 313 || q.DupRate != 0.0026 {
|
||||
t.Fatalf("quality 数值不符: %+v", q)
|
||||
}
|
||||
|
||||
var wv struct {
|
||||
Today int `json:"today"`
|
||||
Days []struct {
|
||||
Date string `json:"date"`
|
||||
Live int `json:"live"`
|
||||
} `json:"days"`
|
||||
}
|
||||
if err := json.Unmarshal(snap.WriteVolume, &wv); err != nil {
|
||||
t.Fatalf("write_volume 段解析失败: %v", err)
|
||||
}
|
||||
if wv.Today != 332 || len(wv.Days) != 1 || wv.Days[0].Live != 1471 {
|
||||
t.Fatalf("write_volume 不符: %+v", wv)
|
||||
}
|
||||
|
||||
// 新鲜度:刚写的文件 age 应 < 10s;人为改旧 → stale 判定为真
|
||||
if age := snap.AgeSeconds(); age < 0 || age > 10 {
|
||||
t.Fatalf("AgeSeconds=%d,本应接近 0", age)
|
||||
}
|
||||
old := time.Now().Add(-8 * time.Hour)
|
||||
if err := os.Chtimes(p, old, old); err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
snap2, err := loadQualitySnapshot()
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
if snap2.AgeSeconds() <= qualityStaleAfter {
|
||||
t.Fatalf("8h 前的快照应判 stale(>%d 秒),得到 %d", qualityStaleAfter, snap2.AgeSeconds())
|
||||
}
|
||||
}
|
||||
|
||||
// 快照缺失 ⇒ 必须报错(由 handler 转成 degraded),不能静默返回零值。
|
||||
func TestLoadQualitySnapshotMissing(t *testing.T) {
|
||||
t.Setenv("ZHIYI_QUALITY_SNAPSHOT", filepath.Join(t.TempDir(), "nope.json"))
|
||||
if _, err := loadQualitySnapshot(); err == nil {
|
||||
t.Fatal("缺失快照应返回 error")
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,382 @@
|
||||
package routes
|
||||
|
||||
// 方案二 · 召回增强(2026-10-31)
|
||||
//
|
||||
// 背景(20 题真实问题实测):
|
||||
// · 能答 30% / 答不了 30% / 答错 10%
|
||||
// · 6 道"答不了"里 **5 道的答案在 skill 文档里**,从来没进过 memories 表
|
||||
// ⇒ 知识(稳定方法,进 skill) 与 记忆(会变事实,进 memories) 是两套互不相通的库
|
||||
// · derived_from 有真指针的 42.8%,其中 99.9% 能找回原文(断链仅 10 条)
|
||||
//
|
||||
// 本文件提供两个"只读增强",都是可降级的(任何一步失败 ⇒ 返回空,不影响主流程):
|
||||
// SkillRefsFor(query) —— 复用 ~/.hermes/skills/.vec.npy(skill-find.py 的现成索引),
|
||||
// 不新建索引、不重复造轮子
|
||||
// SourceExcerpts(ids) —— 按 memories.derived_from 批量取 episode 原文(一次查询,不逐条)
|
||||
//
|
||||
// 安全约定:
|
||||
// · 任何异常(索引缺失 / 服务不可用 / 字段为空)⇒ 返回 nil,主召回零影响
|
||||
// · 输出走 omitempty,旧调用方无感
|
||||
|
||||
import (
|
||||
"bytes"
|
||||
"encoding/binary"
|
||||
"encoding/json"
|
||||
"log"
|
||||
"math"
|
||||
"net/http"
|
||||
"os"
|
||||
"path/filepath"
|
||||
"sort"
|
||||
"strings"
|
||||
"sync"
|
||||
"time"
|
||||
)
|
||||
|
||||
// SkillRef 一条相关技能引用(只给名字与相似度,不返回正文 —— 调用方需要时自己加载)
|
||||
type SkillRef struct {
|
||||
Name string `json:"name"`
|
||||
Score float64 `json:"score"`
|
||||
}
|
||||
|
||||
var (
|
||||
skillVecOnce sync.Once
|
||||
skillVecMat [][]float32 // L2 归一化后的向量
|
||||
skillVecMeta []struct {
|
||||
Path string `json:"path"`
|
||||
Name string `json:"name"`
|
||||
}
|
||||
skillVecOK bool
|
||||
)
|
||||
|
||||
func skillEmbedURL() string {
|
||||
if v := os.Getenv("BGE_EMBED_URL"); v != "" {
|
||||
return v
|
||||
}
|
||||
return "http://127.0.0.1:8000/v1/embeddings"
|
||||
}
|
||||
|
||||
// loadSkillVecIndex 懒加载 skill 向量索引(.vec.npy 由 skill-find.py 维护)
|
||||
// 解析 .npy 的最小实现:只支持 float32 C 序 2 维数组,避免引入 numpy 依赖
|
||||
func loadSkillVecIndex() bool {
|
||||
skillVecOnce.Do(func() {
|
||||
home, err := os.UserHomeDir()
|
||||
if err != nil {
|
||||
return
|
||||
}
|
||||
idxPath := filepath.Join(home, ".hermes", "skills", ".vec.npy")
|
||||
metaPath := filepath.Join(home, ".hermes", "skills", ".vec-meta.json")
|
||||
|
||||
raw, err := os.ReadFile(idxPath)
|
||||
if err != nil {
|
||||
log.Printf("[skillref] 索引缺失,跳过:%v", err)
|
||||
return
|
||||
}
|
||||
mat, ok := parseNPYFloat32(raw)
|
||||
if !ok {
|
||||
log.Printf("[skillref] .npy 解析失败,跳过")
|
||||
return
|
||||
}
|
||||
mraw, err := os.ReadFile(metaPath)
|
||||
if err != nil {
|
||||
return
|
||||
}
|
||||
if err := json.Unmarshal(mraw, &skillVecMeta); err != nil {
|
||||
return
|
||||
}
|
||||
if len(skillVecMeta) != len(mat) {
|
||||
log.Printf("[skillref] 索引/meta 长度不一致(%d vs %d),跳过", len(mat), len(skillVecMeta))
|
||||
return
|
||||
}
|
||||
skillVecMat = mat
|
||||
skillVecOK = true
|
||||
log.Printf("[skillref] skill 向量索引就绪:%d 条", len(mat))
|
||||
})
|
||||
return skillVecOK
|
||||
}
|
||||
|
||||
// parseNPYFloat32 极简 .npy 解析(仅 float32、C 序、2 维)
|
||||
// 格式:magic(6) ver(2) headerlen(2, little) header(headerlen) data...
|
||||
func parseNPYFloat32(b []byte) ([][]float32, bool) {
|
||||
if len(b) < 10 || !bytes.HasPrefix(b, []byte("\x93NUMPY")) {
|
||||
return nil, false
|
||||
}
|
||||
hlen := int(uint16(b[8]) | uint16(b[9])<<8)
|
||||
if len(b) < 10+hlen {
|
||||
return nil, false
|
||||
}
|
||||
header := string(b[10 : 10+hlen])
|
||||
data := b[10+hlen:]
|
||||
|
||||
// 只接受 float32
|
||||
if !strings.Contains(header, "f4") {
|
||||
return nil, false
|
||||
}
|
||||
// 解析 shape:numpy header 里写作 `'shape': (626, 1024)`
|
||||
si := strings.Index(header, "'shape'")
|
||||
if si < 0 {
|
||||
return nil, false
|
||||
}
|
||||
shapeStr := header[si:]
|
||||
open := strings.Index(shapeStr, "(")
|
||||
closeI := strings.Index(shapeStr, ")")
|
||||
if open < 0 || closeI < 0 || closeI <= open {
|
||||
return nil, false
|
||||
}
|
||||
parts := strings.Split(shapeStr[open+1:closeI], ",")
|
||||
if len(parts) < 2 {
|
||||
return nil, false
|
||||
}
|
||||
var rows, cols int
|
||||
if _, err := jsonNumber(strings.TrimSpace(parts[0]), &rows); err != nil {
|
||||
return nil, false
|
||||
}
|
||||
if _, err := jsonNumber(strings.TrimSpace(parts[1]), &cols); err != nil {
|
||||
return nil, false
|
||||
}
|
||||
if rows <= 0 || cols <= 0 || len(data) < rows*cols*4 {
|
||||
return nil, false
|
||||
}
|
||||
out := make([][]float32, rows)
|
||||
for i := 0; i < rows; i++ {
|
||||
vec := make([]float32, cols)
|
||||
for j := 0; j < cols; j++ {
|
||||
off := (i*cols + j) * 4
|
||||
u := binary.LittleEndian.Uint32(data[off : off+4])
|
||||
vec[j] = math.Float32frombits(u)
|
||||
}
|
||||
out[i] = vec
|
||||
}
|
||||
return out, true
|
||||
}
|
||||
|
||||
// jsonNumber 解析头部里的整数(形如 "3" 或 " 3")
|
||||
func jsonNumber(s string, out *int) (int, error) {
|
||||
n := 0
|
||||
got := false
|
||||
for _, c := range s {
|
||||
if c >= '0' && c <= '9' {
|
||||
n = n*10 + int(c-'0')
|
||||
got = true
|
||||
} else if got {
|
||||
break
|
||||
}
|
||||
}
|
||||
if !got {
|
||||
return 0, errBadShape
|
||||
}
|
||||
*out = n
|
||||
return n, nil
|
||||
}
|
||||
|
||||
var errBadShape = &shapeErr{}
|
||||
|
||||
type shapeErr struct{}
|
||||
|
||||
func (*shapeErr) Error() string { return "bad shape" }
|
||||
|
||||
// aliasTable 中文专名 → 英文项目名/同义词。
|
||||
// 实测(2026-10-31):bge-m3 对「织忆」与 memoryweave/zhiyi 的余弦距离很远,
|
||||
// 单用原句检索 top1 命中率 50%;扩展别名后 6/6 全部命中正确族(0.80→0.85)。
|
||||
// 这是"语义距离"问题,不是"索引粒度"问题 —— 换 chunk 级索引解决不了。
|
||||
var (
|
||||
aliasOnce sync.Once
|
||||
aliases map[string][]string
|
||||
terms map[string][]string // 专属术语 → 所属实体(query 未点名实体时注入)
|
||||
)
|
||||
|
||||
func loadAliases() map[string][]string {
|
||||
aliasOnce.Do(func() {
|
||||
home, err := os.UserHomeDir()
|
||||
if err != nil {
|
||||
return
|
||||
}
|
||||
raw, err := os.ReadFile(filepath.Join(home, ".hermes", "skills", ".aliases.json"))
|
||||
if err != nil {
|
||||
log.Printf("[skillref] 别名表缺失,跳过扩展:%v", err)
|
||||
return
|
||||
}
|
||||
var f struct {
|
||||
Aliases map[string][]string `json:"aliases"`
|
||||
Terms map[string][]string `json:"_terms"`
|
||||
}
|
||||
if err := json.Unmarshal(raw, &f); err != nil {
|
||||
log.Printf("[skillref] 别名表解析失败:%v", err)
|
||||
return
|
||||
}
|
||||
aliases = f.Aliases
|
||||
terms = f.Terms
|
||||
delete(aliases, "_comment")
|
||||
delete(aliases, "_version")
|
||||
log.Printf("[skillref] 别名表就绪:%d 别名 + %d 术语组", len(aliases), len(terms))
|
||||
})
|
||||
return aliases
|
||||
}
|
||||
|
||||
// expandQuery 命中别名 ⇒ 追加同义词。总追加长度上限 60 字符(防噪声淹没原句)。
|
||||
func expandQuery(q string) string {
|
||||
tbl := loadAliases()
|
||||
if len(tbl) == 0 {
|
||||
return q
|
||||
}
|
||||
// ① 专属术语注入:query 没点名实体,但出现了该实体的专属标识符
|
||||
// (如 "FTS 覆盖率为什么只有 48%" 未提「织忆」,但 FTS/fts_index 是织忆专属)
|
||||
base := q
|
||||
for entity, termList := range terms {
|
||||
if strings.Contains(base, entity) {
|
||||
continue // 已点名,不必注入
|
||||
}
|
||||
hit := false
|
||||
for _, t := range termList {
|
||||
if t != "" && strings.Contains(base, t) {
|
||||
hit = true
|
||||
break
|
||||
}
|
||||
}
|
||||
if hit {
|
||||
base = base + " " + entity
|
||||
if syns := tbl[entity]; len(syns) > 0 {
|
||||
base = base + " " + strings.Join(syns, " ")
|
||||
}
|
||||
break // 只注入一个实体,防多实体互相污染
|
||||
}
|
||||
}
|
||||
q = base
|
||||
var extras []string
|
||||
budget := 60
|
||||
for k, syns := range tbl {
|
||||
if !strings.Contains(q, k) && !strings.Contains(strings.ToLower(q), strings.ToLower(k)) {
|
||||
continue
|
||||
}
|
||||
for _, s := range syns {
|
||||
if strings.Contains(q, s) {
|
||||
continue // 原句已有,不重复
|
||||
}
|
||||
if len([]rune(s)) > budget {
|
||||
break
|
||||
}
|
||||
extras = append(extras, s)
|
||||
budget -= len([]rune(s)) + 1
|
||||
if budget <= 0 {
|
||||
break
|
||||
}
|
||||
}
|
||||
if budget <= 0 {
|
||||
break
|
||||
}
|
||||
}
|
||||
if len(extras) == 0 {
|
||||
return q
|
||||
}
|
||||
out := q + " " + strings.Join(extras, " ")
|
||||
if env := os.Getenv("ZHIYI_SKILLREF_DEBUG"); env == "1" {
|
||||
log.Printf("[skillref] query 扩展: %q → %q", q, out)
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
// SkillRefsFor 查询 → 相关 skill 名单(top-k)。任何失败返回 nil。
|
||||
func SkillRefsFor(query string, topk int) []SkillRef {
|
||||
if topk <= 0 {
|
||||
topk = 5
|
||||
}
|
||||
if os.Getenv("ZHIYI_RECALL_SKILLREFS") == "0" {
|
||||
return nil
|
||||
}
|
||||
if !loadSkillVecIndex() {
|
||||
return nil
|
||||
}
|
||||
// 2026-10-31 提精度:先做别名扩展再编码(语义距离问题,见 expandQuery 注释)
|
||||
qv, ok := embedQuery(expandQuery(query))
|
||||
if !ok {
|
||||
return nil
|
||||
}
|
||||
type sc struct {
|
||||
i int
|
||||
s float64
|
||||
}
|
||||
scores := make([]sc, 0, len(skillVecMat))
|
||||
for i, v := range skillVecMat {
|
||||
scores = append(scores, sc{i, dot(qv, v)})
|
||||
}
|
||||
sort.Slice(scores, func(a, b int) bool { return scores[a].s > scores[b].s })
|
||||
|
||||
out := make([]SkillRef, 0, topk)
|
||||
seen := map[string]bool{}
|
||||
for _, s := range scores {
|
||||
if len(out) >= topk {
|
||||
break
|
||||
}
|
||||
// 扩展后正确族分数 0.78~0.86;未触发的原句高分 0.66~0.70。
|
||||
// 0.62 是「宁可给低分线索也别返回空」的取舍 —— 返回空等于没这功能。
|
||||
if s.s < 0.62 {
|
||||
break
|
||||
}
|
||||
name := skillVecMeta[s.i].Name
|
||||
if name == "" {
|
||||
name = strings.TrimSuffix(filepath.Base(skillVecMeta[s.i].Path), ".md")
|
||||
}
|
||||
if seen[name] {
|
||||
continue
|
||||
}
|
||||
seen[name] = true
|
||||
out = append(out, SkillRef{Name: name, Score: round3(s.s)})
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
func embedQuery(q string) ([]float32, bool) {
|
||||
body, _ := json.Marshal(map[string]any{"input": []string{q}, "model": "bge-m3"})
|
||||
client := &http.Client{Timeout: 8 * time.Second}
|
||||
resp, err := client.Post(skillEmbedURL(), "application/json", bytes.NewReader(body))
|
||||
if err != nil {
|
||||
return nil, false
|
||||
}
|
||||
defer resp.Body.Close()
|
||||
var out struct {
|
||||
Data []struct {
|
||||
Embedding []float32 `json:"embedding"`
|
||||
} `json:"data"`
|
||||
}
|
||||
if err := json.NewDecoder(resp.Body).Decode(&out); err != nil || len(out.Data) == 0 {
|
||||
return nil, false
|
||||
}
|
||||
v := out.Data[0].Embedding
|
||||
var norm float64
|
||||
for _, x := range v {
|
||||
norm += float64(x) * float64(x)
|
||||
}
|
||||
if norm == 0 {
|
||||
return nil, false
|
||||
}
|
||||
inv := float32(1 / sqrt(norm))
|
||||
for i := range v {
|
||||
v[i] *= inv
|
||||
}
|
||||
return v, true
|
||||
}
|
||||
|
||||
func dot(a, b []float32) float64 {
|
||||
if len(a) != len(b) {
|
||||
return 0
|
||||
}
|
||||
var s float64
|
||||
for i := range a {
|
||||
s += float64(a[i]) * float64(b[i])
|
||||
}
|
||||
return s
|
||||
}
|
||||
|
||||
func sqrt(x float64) float64 {
|
||||
if x <= 0 {
|
||||
return 0
|
||||
}
|
||||
z := x
|
||||
for i := 0; i < 30; i++ {
|
||||
z = (z + x/z) / 2
|
||||
}
|
||||
return z
|
||||
}
|
||||
|
||||
func round3(f float64) float64 {
|
||||
return float64(int(f*1000+0.5)) / 1000
|
||||
}
|
||||
@@ -0,0 +1,39 @@
|
||||
package routes
|
||||
|
||||
import (
|
||||
"os"
|
||||
"path/filepath"
|
||||
"testing"
|
||||
)
|
||||
|
||||
// TestNPYParse 验证能解析 skill-find.py 维护的真实索引
|
||||
func TestNPYParse(t *testing.T) {
|
||||
home, _ := os.UserHomeDir()
|
||||
p := filepath.Join(home, ".hermes", "skills", ".vec.npy")
|
||||
raw, err := os.ReadFile(p)
|
||||
if err != nil {
|
||||
t.Skip("索引不存在:", err)
|
||||
}
|
||||
mat, ok := parseNPYFloat32(raw)
|
||||
if !ok {
|
||||
t.Fatalf(".npy 解析失败,前 200 字节: %q", raw[:min(200, len(raw))])
|
||||
}
|
||||
if len(mat) == 0 {
|
||||
t.Fatal("解析出 0 行")
|
||||
}
|
||||
t.Logf("解析成功: %d 行 × %d 维", len(mat), len(mat[0]))
|
||||
}
|
||||
|
||||
// TestSkillRefsFor 端到端:真实查询能拿到 skill_refs
|
||||
func TestSkillRefsFor(t *testing.T) {
|
||||
if os.Getenv("ZHIYI_SKILLREF_E2E") != "1" {
|
||||
t.Skip("set ZHIYI_SKILLREF_E2E=1 才跑(依赖 bge 服务)")
|
||||
}
|
||||
refs := SkillRefsFor("织忆部署时 Go 和 Rust 二进制的启停顺序", 3)
|
||||
if len(refs) == 0 {
|
||||
t.Fatal("skill_refs 为空")
|
||||
}
|
||||
for _, r := range refs {
|
||||
t.Logf(" %s %.3f", r.Name, r.Score)
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,594 @@
|
||||
// 织忆 MemoryWeave — recall 第二路:skill 分节检索(t_e3f5cb79 · 2026-10-31 方案 B1)
|
||||
//
|
||||
// 根因(方案「验证结果(2026-11-02)」节):知识与记忆是两套互不相通的库 ——
|
||||
// 「怎么做/为什么」类答案稳定落在 skill 文档(部署顺序/缓存分层/排障步骤),
|
||||
// 从来不进 memories 表;recall 只查前者 ⇒ 答不了。
|
||||
//
|
||||
// 本文件 = recall 的第二路(分栏返回,不混排):
|
||||
//
|
||||
// · 索引源 ~/.hermes/skills/**/*.md(env ZHIYI_SKILLS_DIR 可覆盖;3545 档 / 27MB)
|
||||
// · 分节(H2~H4 标题切段)+ 关键词匹配(ASCII token 整词 + CJK bigram),
|
||||
// 纯 stdlib,零新依赖、零外部服务(不依赖 embed/LLM —— 10-31 向量前案
|
||||
// 依赖 .vec.npy + embed 服务,shape 也不满足本卡 AC,见卡评论裁定 4)
|
||||
// · 输出顶层 `skill_refs: [{path, snippet, matched}]`;`results`(记忆路)
|
||||
// 结构一字不动,两路内容互不混入(AC-2.4,结构上保证)
|
||||
// · 开关 ZHIYI_RECALL_SKILLREFS(默认关;每次读 env,测试可翻转)
|
||||
// · 任何失败(目录缺失/IO 错误/查询为空)⇒ 返回空数组,主召回零影响
|
||||
//
|
||||
// 精度取向(对齐方案验证节教训「先拿真实问题量一下」):
|
||||
//
|
||||
// · ASCII 标识符权重高(RedisCache/ZHIYI_* 这类精确 token 是主要判别信号)
|
||||
// · CJK bigram 按段落长度做 sqrt 归一,防长段落靠撞 bigram 霸榜
|
||||
// · 每个文件只出最高分一节(top-3 文件),避免同文件刷屏
|
||||
package routes
|
||||
|
||||
import (
|
||||
"log"
|
||||
"math"
|
||||
"os"
|
||||
"path/filepath"
|
||||
"regexp"
|
||||
"sort"
|
||||
"strings"
|
||||
"sync"
|
||||
"time"
|
||||
"unicode"
|
||||
)
|
||||
|
||||
// SkillSectionRef 一条 skill 片段引用(AC-2.1 形状:path/snippet/matched)。
|
||||
type SkillSectionRef struct {
|
||||
Path string `json:"path"`
|
||||
Snippet string `json:"snippet"`
|
||||
Matched []string `json:"matched"`
|
||||
Score float64 `json:"-"` // 排序分(仅回归/调试可见;AC-2.1 线格式仍为 path/snippet/matched)
|
||||
}
|
||||
|
||||
// skillSection 索引单元:一个 Markdown 分节。
|
||||
type skillSection struct {
|
||||
path string // 绝对路径
|
||||
title string // 分节标题(无标题=文件名)
|
||||
lower string // 正文小写(ASCII 匹配用)
|
||||
runeLen int // 正文字符数(长度归一用)
|
||||
titleLow string // 标题小写(标题命中加权)
|
||||
isSkillMd bool // SKILL.md 主文档(权威综述先验)
|
||||
}
|
||||
|
||||
type skillRefIndex struct {
|
||||
sections []*skillSection
|
||||
builtAt time.Time
|
||||
avgRuneLen float64
|
||||
}
|
||||
|
||||
var (
|
||||
skillIdxMu sync.RWMutex
|
||||
skillIdxCache *skillRefIndex
|
||||
)
|
||||
|
||||
const (
|
||||
skillRefRebuildEvery = 10 * time.Minute
|
||||
skillRefMaxFileBytes = 512 * 1024
|
||||
skillRefMaxSection = 8000 // rune
|
||||
skillRefSnippetRunes = 200
|
||||
)
|
||||
|
||||
// skillRefsEnabled 第二路开关(默认关 = 现网零变化;unit drop-in 置 1 启用)。
|
||||
func skillRefsEnabled() bool {
|
||||
switch strings.ToLower(strings.TrimSpace(os.Getenv("ZHIYI_RECALL_SKILLREFS"))) {
|
||||
case "1", "true", "on":
|
||||
return true
|
||||
}
|
||||
return false
|
||||
}
|
||||
|
||||
func skillRefsDir() string {
|
||||
if v := strings.TrimSpace(os.Getenv("ZHIYI_SKILLS_DIR")); v != "" {
|
||||
return v
|
||||
}
|
||||
home, err := os.UserHomeDir()
|
||||
if err != nil {
|
||||
return ""
|
||||
}
|
||||
return filepath.Join(home, ".hermes", "skills")
|
||||
}
|
||||
|
||||
// headingRe H2~H4 标题行 = 分节边界。
|
||||
var headingRe = regexp.MustCompile(`^#{2,4}\s+(.*)$`)
|
||||
|
||||
// buildSkillRefIndex 扫目录建分节索引(失败返回 nil,调用方降级空数组)。
|
||||
func buildSkillRefIndex(dir string) *skillRefIndex {
|
||||
if dir == "" {
|
||||
return nil
|
||||
}
|
||||
idx := &skillRefIndex{builtAt: time.Now()}
|
||||
var walkErr int
|
||||
_ = filepath.WalkDir(dir, func(p string, d os.DirEntry, err error) error {
|
||||
if err != nil {
|
||||
walkErr++
|
||||
return nil // 单点 IO 失败不中断整体
|
||||
}
|
||||
if d.IsDir() {
|
||||
// 隐藏目录(.archive/.vec 缓存等)不进索引
|
||||
if p != dir && strings.HasPrefix(d.Name(), ".") {
|
||||
return filepath.SkipDir
|
||||
}
|
||||
return nil
|
||||
}
|
||||
if !strings.HasSuffix(d.Name(), ".md") {
|
||||
return nil
|
||||
}
|
||||
if fi, e := d.Info(); e != nil || fi.Size() > skillRefMaxFileBytes {
|
||||
return nil
|
||||
}
|
||||
raw, e := os.ReadFile(p)
|
||||
if e != nil {
|
||||
walkErr++
|
||||
return nil
|
||||
}
|
||||
addSkillFile(idx, p, string(raw))
|
||||
return nil
|
||||
})
|
||||
log.Printf("[skillrefs] 索引就绪:sections=%d walk_errors=%d dir=%s 用时=%s",
|
||||
len(idx.sections), walkErr, dir, time.Since(idx.builtAt).Round(time.Millisecond))
|
||||
if len(idx.sections) == 0 {
|
||||
return nil
|
||||
}
|
||||
var sum int
|
||||
for _, s := range idx.sections {
|
||||
sum += s.runeLen
|
||||
}
|
||||
idx.avgRuneLen = float64(sum) / float64(len(idx.sections))
|
||||
return idx
|
||||
}
|
||||
|
||||
// addSkillFile 按 H2~H4 切节;YAML frontmatter 跳过。
|
||||
func addSkillFile(idx *skillRefIndex, path, content string) {
|
||||
lines := strings.Split(content, "\n")
|
||||
i := 0
|
||||
// frontmatter
|
||||
if len(lines) > 0 && strings.TrimSpace(lines[0]) == "---" {
|
||||
for j := 1; j < len(lines); j++ {
|
||||
if strings.TrimSpace(lines[j]) == "---" {
|
||||
i = j + 1
|
||||
break
|
||||
}
|
||||
}
|
||||
}
|
||||
title := "(front)"
|
||||
var body strings.Builder
|
||||
flush := func() {
|
||||
txt := strings.TrimSpace(body.String())
|
||||
if txt == "" && title == "(front)" {
|
||||
return
|
||||
}
|
||||
if txt == "" {
|
||||
return // 只有标题没有正文的分节不进索引
|
||||
}
|
||||
rs := []rune(txt)
|
||||
if len(rs) > skillRefMaxSection {
|
||||
txt = string(rs[:skillRefMaxSection])
|
||||
}
|
||||
idx.sections = append(idx.sections, &skillSection{
|
||||
path: path,
|
||||
title: title,
|
||||
lower: strings.ToLower(txt),
|
||||
runeLen: len(rs),
|
||||
titleLow: strings.ToLower(title),
|
||||
isSkillMd: filepath.Base(path) == "SKILL.md",
|
||||
})
|
||||
}
|
||||
for ; i < len(lines); i++ {
|
||||
if m := headingRe.FindStringSubmatch(lines[i]); m != nil {
|
||||
flush()
|
||||
body.Reset()
|
||||
title = strings.TrimSpace(m[1])
|
||||
continue
|
||||
}
|
||||
body.WriteString(lines[i])
|
||||
body.WriteByte('\n')
|
||||
}
|
||||
flush()
|
||||
}
|
||||
|
||||
// getSkillRefIndex 取索引(懒建 + 定期重建;重建阻塞在锁内,一次尖刺可接受)。
|
||||
func getSkillRefIndex() *skillRefIndex {
|
||||
skillIdxMu.RLock()
|
||||
idx := skillIdxCache
|
||||
skillIdxMu.RUnlock()
|
||||
if idx != nil && time.Since(idx.builtAt) < skillRefRebuildEvery {
|
||||
return idx
|
||||
}
|
||||
dir := skillRefsDir()
|
||||
newIdx := buildSkillRefIndex(dir)
|
||||
if newIdx == nil {
|
||||
return idx // 建索引失败:保留旧索引(可能为 nil = 空)
|
||||
}
|
||||
skillIdxMu.Lock()
|
||||
skillIdxCache = newIdx
|
||||
skillIdxMu.Unlock()
|
||||
return newIdx
|
||||
}
|
||||
|
||||
// skillStopCJK 疑问/系词/量词类停用字:含这些字的 bigram 不参与打分 ——
|
||||
// 真实语料实测「有哪些」类疑问句在全库高频共现,不排除则疑问句段落霸榜
|
||||
// (2026-11-03 调试:q=织忆有哪些缓存层 时 [有哪 哪些] 组合霸榜 8/10)。
|
||||
var skillStopCJK = map[rune]bool{
|
||||
'有': true, '哪': true, '些': true, '什': true, '么': true, '怎': true, '样': true,
|
||||
'如': true, '何': true, '是': true, '的': true, '了': true, '吗': true, '呢': true,
|
||||
'和': true, '与': true, '或': true, '在': true, '对': true, '从': true, '里': true,
|
||||
'多': true, '少': true, '谁': true, '几': true, '该': true, '吧': true, '呀': true,
|
||||
}
|
||||
|
||||
func isHan(r rune) bool { return unicode.Is(unicode.Han, r) }
|
||||
|
||||
// skillGlossary 微型近义/中英扩展表(查询侧,只扩 1 跳):
|
||||
// 纯词面匹配桥不过的真实案例(2026-11-03 调试)——「缓存层」文档写 `RedisCache`、
|
||||
// 「启动顺序」文档写「部署时序」。表刻意小:只收运维域高频等价对。
|
||||
// 扩展词用 Contains 匹配(cache 允许出现在 RedisCache 内),权重 ×0.8。
|
||||
var skillGlossary = map[string][]string{
|
||||
"缓存": {"cache"}, "启动": {"重启", "部署"}, "重启": {"启动", "部署"},
|
||||
"部署": {"启动", "重启"}, "顺序": {"时序", "次序"}, "时序": {"顺序"},
|
||||
"端口": {"port"}, "服务": {"service"},
|
||||
}
|
||||
|
||||
func skillExpand(cjk []string) []string {
|
||||
out := []string{}
|
||||
for _, t := range cjk {
|
||||
for _, syn := range skillGlossary[t] {
|
||||
out = append(out, syn)
|
||||
}
|
||||
}
|
||||
return dedupeTerms(out)
|
||||
}
|
||||
|
||||
// filterOut 去掉已存在于 have 的词。
|
||||
func filterOut(terms, have []string) []string {
|
||||
seen := make(map[string]bool, len(have))
|
||||
for _, h := range have {
|
||||
seen[h] = true
|
||||
}
|
||||
out := terms[:0:0]
|
||||
for _, t := range terms {
|
||||
if !seen[t] {
|
||||
out = append(out, t)
|
||||
}
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
// skillQueryTerms 查询分词:ASCII token(≥2 字符,小写)+ CJK bigram(停用字过滤)。
|
||||
func skillQueryTerms(q string) (ascii, cjk []string) {
|
||||
var cur strings.Builder
|
||||
flushASCII := func() {
|
||||
if cur.Len() >= 2 {
|
||||
ascii = append(ascii, cur.String())
|
||||
}
|
||||
cur.Reset()
|
||||
}
|
||||
rs := []rune(q)
|
||||
// CJK bigram(过滤停用字 bigram)
|
||||
var run []rune
|
||||
flushRun := func() {
|
||||
for k := 0; k+1 < len(run); k++ {
|
||||
if skillStopCJK[run[k]] || skillStopCJK[run[k+1]] {
|
||||
continue
|
||||
}
|
||||
cjk = append(cjk, string(run[k:k+2]))
|
||||
}
|
||||
run = run[:0]
|
||||
}
|
||||
for _, r := range rs {
|
||||
switch {
|
||||
case unicode.Is(unicode.Han, r):
|
||||
flushASCII()
|
||||
run = append(run, r)
|
||||
case r >= 'a' && r <= 'z', r >= 'A' && r <= 'Z', r >= '0' && r <= '9', r == '_', r == '-':
|
||||
flushRun()
|
||||
cur.WriteRune(unicode.ToLower(r))
|
||||
default:
|
||||
flushASCII()
|
||||
flushRun()
|
||||
}
|
||||
}
|
||||
flushASCII()
|
||||
flushRun()
|
||||
return dedupeTerms(ascii), dedupeTerms(cjk)
|
||||
}
|
||||
|
||||
func dedupeTerms(in []string) []string {
|
||||
seen := make(map[string]bool, len(in))
|
||||
out := in[:0:0]
|
||||
for _, s := range in {
|
||||
if !seen[s] {
|
||||
seen[s] = true
|
||||
out = append(out, s)
|
||||
}
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
// wordCount 词边界计数:token 前后不能贴字母/数字(防 `go` 命中 golang/google、
|
||||
// `rust` 命中 x-rustc 之类子串噪声 —— 真实语料实测短 token 子串匹配 df 虚高)。
|
||||
var wordBoundaryOK = func(b byte) bool {
|
||||
return !(b >= 'a' && b <= 'z' || b >= 'A' && b <= 'Z' || b >= '0' && b <= '9' || b == '_')
|
||||
}
|
||||
|
||||
func wordCount(lower, token string) int {
|
||||
n, from := 0, 0
|
||||
for {
|
||||
i := strings.Index(lower[from:], token)
|
||||
if i < 0 {
|
||||
return n
|
||||
}
|
||||
i += from
|
||||
j := i + len(token)
|
||||
beforeOK := i == 0 || wordBoundaryOK(lower[i-1])
|
||||
afterOK := j == len(lower) || wordBoundaryOK(lower[j])
|
||||
if beforeOK && afterOK {
|
||||
n++
|
||||
}
|
||||
from = i + 1
|
||||
}
|
||||
}
|
||||
|
||||
// skillRefsForQuery 第二路检索入口:query → top-n skill 分节引用。
|
||||
// 关闭/无索引/空查询 ⇒ 空切片(非 nil,JSON 序列化为 [])。
|
||||
// 打分 = BM25(k1=1.5, b=0.75;tf 饱和 + 平均长度归一,标准 IR 做法):
|
||||
// 2026-11-03 调试教训 —— 自造线性权重在 37k 分节真实语料上被「疑问句共现」
|
||||
// 与「长度/稀有 bigram」反复带偏,换教科书公式一次到位。
|
||||
func skillRefsForQuery(query string, n int) []SkillSectionRef {
|
||||
out := []SkillSectionRef{}
|
||||
if !skillRefsEnabled() {
|
||||
return out
|
||||
}
|
||||
idx := getSkillRefIndex()
|
||||
if idx == nil {
|
||||
return out
|
||||
}
|
||||
ascii, cjk := skillQueryTerms(query)
|
||||
if len(ascii) == 0 && len(cjk) == 0 {
|
||||
return out
|
||||
}
|
||||
if n <= 0 || n > 30 {
|
||||
n = 3
|
||||
}
|
||||
|
||||
type hit struct {
|
||||
sec *skillSection
|
||||
score float64
|
||||
matched []string
|
||||
}
|
||||
// 单字兜底通道词条:查询里的非停用汉字(去重)
|
||||
queryUnigrams := []string{}
|
||||
seenU := map[rune]bool{}
|
||||
for _, r := range query {
|
||||
if isHan(r) && !skillStopCJK[r] && !seenU[r] {
|
||||
seenU[r] = true
|
||||
queryUnigrams = append(queryUnigrams, string(r))
|
||||
}
|
||||
}
|
||||
|
||||
// 扩展通道词(近义/中英,Contains 匹配)
|
||||
expanded := skillExpand(cjk)
|
||||
expanded = filterOut(expanded, append(append([]string{}, cjk...), ascii...))
|
||||
|
||||
// df 预扫(一遍 Contains)
|
||||
df := make(map[string]int, len(ascii)+len(cjk))
|
||||
unigramDF := make(map[string]int, len(queryUnigrams))
|
||||
expandedDF := make(map[string]int, len(expanded))
|
||||
for _, sec := range idx.sections {
|
||||
for _, t := range ascii {
|
||||
if wordCount(sec.lower, t) > 0 {
|
||||
df[t]++
|
||||
}
|
||||
}
|
||||
for _, t := range cjk {
|
||||
if strings.Contains(sec.lower, t) {
|
||||
df[t]++
|
||||
}
|
||||
}
|
||||
for _, r := range queryUnigrams {
|
||||
if strings.Contains(sec.lower, r) {
|
||||
unigramDF[r]++
|
||||
}
|
||||
}
|
||||
for _, t := range expanded {
|
||||
if strings.Contains(sec.lower, t) {
|
||||
expandedDF[t]++
|
||||
}
|
||||
}
|
||||
}
|
||||
total := float64(len(idx.sections))
|
||||
bmIDF := func(d int) float64 {
|
||||
return math.Log(1 + (total-float64(d)+0.5)/(float64(d)+0.5))
|
||||
}
|
||||
avgLen := idx.avgRuneLen
|
||||
if avgLen <= 0 {
|
||||
avgLen = 600
|
||||
}
|
||||
const k1, b = 1.5, 0.75
|
||||
bm := func(tf int, idf, secLen float64) float64 {
|
||||
if tf == 0 {
|
||||
return 0
|
||||
}
|
||||
return idf * float64(tf) * (k1 + 1) / (float64(tf) + k1*(1-b+b*secLen/avgLen))
|
||||
}
|
||||
|
||||
hits := make([]hit, 0, 64)
|
||||
for _, sec := range idx.sections {
|
||||
score := 0.0
|
||||
var matched []string
|
||||
secLen := float64(sec.runeLen)
|
||||
for _, t := range ascii {
|
||||
tf := wordCount(sec.lower, t)
|
||||
if tf > 0 {
|
||||
score += 3.0 * bm(tf, bmIDF(df[t]), secLen) // ASCII 标识符是强信号
|
||||
matched = append(matched, t)
|
||||
if strings.Contains(sec.titleLow, t) {
|
||||
score += 2.0 // 标题命中加权
|
||||
}
|
||||
}
|
||||
}
|
||||
for _, t := range cjk {
|
||||
tf := strings.Count(sec.lower, t)
|
||||
if tf > 0 {
|
||||
score += bm(tf, bmIDF(df[t]), secLen)
|
||||
matched = append(matched, t)
|
||||
if strings.Contains(sec.titleLow, t) {
|
||||
score += 1.5
|
||||
}
|
||||
}
|
||||
}
|
||||
for _, t := range expanded {
|
||||
if tf := strings.Count(sec.lower, t); tf > 0 {
|
||||
w := 0.8
|
||||
// 扩展词命中且同节含 ASCII 标识符 → 视为等价强信号,升全权重
|
||||
// (探针② 实测:「部署时序照旧:停先 Go 后 Rust」行需按全词计分
|
||||
// 才能压过 INDEX 目录页的裸词面共现)
|
||||
if len(ascii) > 0 && containsAnyMatched(matched, ascii) {
|
||||
w = 1.0
|
||||
}
|
||||
score += w * bm(tf, bmIDF(expandedDF[t]), secLen)
|
||||
matched = append(matched, "~"+t) // 前缀标扩展命中
|
||||
}
|
||||
}
|
||||
if len(matched) == 0 {
|
||||
continue
|
||||
}
|
||||
// 单字兜底通道:bigram 在语料里是碎片(如「启动顺序」实际文档写「时序」)
|
||||
// 时,内容单字以 0.6 权重补召回(停用字已滤)。
|
||||
for _, r := range queryUnigrams {
|
||||
tf := strings.Count(sec.lower, r)
|
||||
if tf > 0 {
|
||||
score += 0.6 * bm(tf, bmIDF(unigramDF[r]), secLen)
|
||||
}
|
||||
}
|
||||
// SKILL.md = 人写权威综述(references 是案底),同分场景给 15% 先验
|
||||
if sec.isSkillMd {
|
||||
score *= 1.15
|
||||
}
|
||||
if len(ascii) > 0 && !containsAnyMatched(matched, ascii) {
|
||||
// 查询含 ASCII 标识符而本节一个都不含 → 视为未命中该标识符语境,减半
|
||||
score *= 0.5
|
||||
}
|
||||
// 路径题名先验:文件名 = 作者自己标的主题。CJK 词经文件名对照表映射到
|
||||
// ASCII 路径 token(部署→deploy),文件名命中 +3(探针② 实测:目标文档
|
||||
// 正文只写「部署时序」,词面打不过 INDEX 目录页,靠文件名定主题)。
|
||||
// 反查表刻意小(只收 6 对,与 skillGlossary 同源维护)。
|
||||
{
|
||||
pathKey := strings.ToLower(sec.path)
|
||||
fileNameMap := map[string]string{"部署": "deploy", "重启": "restart", "启动": "start",
|
||||
"缓存": "cache", "端口": "port", "健康": "health", "顺序": "order", "指标": "metric"}
|
||||
for _, t := range append(append([]string{}, cjk...), expanded...) {
|
||||
if tok, ok := fileNameMap[t]; ok && strings.Contains(pathKey, tok) {
|
||||
score += 3.0
|
||||
break
|
||||
}
|
||||
}
|
||||
}
|
||||
hits = append(hits, hit{sec: sec, score: score, matched: matched})
|
||||
}
|
||||
// 行级共现加权(只重算前 300 候选,成本可控):同一行内共现的查询词对数
|
||||
// 是「规则行」的强判别信号 —— AC 探针② 的目标行「部署时序照旧:停先 Go 后
|
||||
// Rust、起先 Rust 后 Go」= 4 词同行。长文散提不配和规则行同分。
|
||||
{
|
||||
allTerms := append(append(append([]string{}, ascii...), cjk...), expanded...)
|
||||
top := hits
|
||||
if len(top) > 300 {
|
||||
sort.SliceStable(top, func(i, j int) bool { return top[i].score > top[j].score })
|
||||
top = top[:300]
|
||||
}
|
||||
for i := range top {
|
||||
best, sum := 0, 0
|
||||
for _, line := range strings.Split(top[i].sec.lower, "\n") {
|
||||
c := 0
|
||||
for _, t := range allTerms {
|
||||
if strings.Contains(line, t) {
|
||||
c++
|
||||
}
|
||||
}
|
||||
if c >= 2 {
|
||||
pairs := c * (c - 1) / 2
|
||||
if pairs > 10 {
|
||||
pairs = 10
|
||||
}
|
||||
if pairs > best {
|
||||
best = pairs
|
||||
}
|
||||
sum += pairs
|
||||
}
|
||||
}
|
||||
// 最佳行主导 + 少量「多处提及」尾部信号(防目录页靠行数刷分)
|
||||
top[i].score += 0.8*float64(best) + 0.15*float64(sum-best)
|
||||
}
|
||||
}
|
||||
sort.SliceStable(hits, func(i, j int) bool { return hits[i].score > hits[j].score })
|
||||
|
||||
// 每文件取最高分一节,取前 n 个文件
|
||||
seenPath := map[string]bool{}
|
||||
for _, h := range hits {
|
||||
if seenPath[h.sec.path] {
|
||||
continue
|
||||
}
|
||||
seenPath[h.sec.path] = true
|
||||
out = append(out, SkillSectionRef{
|
||||
Path: h.sec.path,
|
||||
Snippet: skillSnippet(h.sec.lower, h.matched, ascii, cjk),
|
||||
Matched: topMatched(h.matched, 8),
|
||||
Score: h.score,
|
||||
})
|
||||
if len(out) >= n {
|
||||
break
|
||||
}
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
func containsAnyMatched(matched, terms []string) bool {
|
||||
for _, m := range matched {
|
||||
for _, t := range terms {
|
||||
if m == t {
|
||||
return true
|
||||
}
|
||||
}
|
||||
}
|
||||
return false
|
||||
}
|
||||
|
||||
func topMatched(matched []string, n int) []string {
|
||||
if len(matched) <= n {
|
||||
return matched
|
||||
}
|
||||
return matched[:n]
|
||||
}
|
||||
|
||||
// skillSnippet 首个高权重命中词附近 ±100 rune 窗口,压平空白。
|
||||
func skillSnippet(lower string, matched, ascii, cjk []string) string {
|
||||
pref := append(append([]string{}, ascii...), cjk...)
|
||||
rs := []rune(lower)
|
||||
pos := -1
|
||||
for _, t := range pref {
|
||||
i := strings.Index(lower, t)
|
||||
if i >= 0 {
|
||||
// rune 下标近似:按字节 index 换 rune 数(正文已是小写无多字节大小写问题)
|
||||
pos = len([]rune(lower[:i]))
|
||||
break
|
||||
}
|
||||
}
|
||||
if pos < 0 {
|
||||
pos = 0
|
||||
}
|
||||
start := pos - skillRefSnippetRunes/2
|
||||
if start < 0 {
|
||||
start = 0
|
||||
}
|
||||
end := start + skillRefSnippetRunes
|
||||
if end > len(rs) {
|
||||
end = len(rs)
|
||||
start = end - skillRefSnippetRunes
|
||||
if start < 0 {
|
||||
start = 0
|
||||
}
|
||||
}
|
||||
snip := strings.Join(strings.Fields(string(rs[start:end])), " ")
|
||||
return snip
|
||||
}
|
||||
@@ -0,0 +1,168 @@
|
||||
// B1 第二路 skill 检索回归(t_e3f5cb79 · AC-2)
|
||||
//
|
||||
// 层 1(离线 fixture):开关语义、形状 {path,snippet,matched}、分节命中、
|
||||
// 查询停用词(「有哪些」类疑问词不得参与打分 —— 否则全库疑问句霸榜)。
|
||||
// 层 2(真实语料探针,AC-2.3 ①②;③「淇县招商 memories top1 不变」属线上
|
||||
// 行为,由部署后原始输出闭合):
|
||||
//
|
||||
// ① q="织忆有哪些缓存层" ⇒ 命中文件正文含 RedisCache 或 L2Cache
|
||||
// ② q="Go Rust 启动顺序" ⇒ 命中含「先 Go」的文件(references/zhiyi-deploy-and-metrics.md)
|
||||
package routes
|
||||
|
||||
import (
|
||||
"os"
|
||||
"path/filepath"
|
||||
"strings"
|
||||
"testing"
|
||||
)
|
||||
|
||||
func resetSkillIdxForTest(t *testing.T) {
|
||||
t.Helper()
|
||||
skillIdxMu.Lock()
|
||||
skillIdxCache = nil
|
||||
skillIdxMu.Unlock()
|
||||
t.Cleanup(func() {
|
||||
skillIdxMu.Lock()
|
||||
skillIdxCache = nil
|
||||
skillIdxMu.Unlock()
|
||||
})
|
||||
}
|
||||
|
||||
func TestSkillRefsDisabledReturnsEmpty(t *testing.T) {
|
||||
resetSkillIdxForTest(t)
|
||||
t.Setenv("ZHIYI_RECALL_SKILLREFS", "")
|
||||
if got := skillRefsForQuery("织忆有哪些缓存层", 5); got == nil || len(got) != 0 {
|
||||
t.Fatalf("开关关必须返回非 nil 空切片(JSON=[]),实际 %#v", got)
|
||||
}
|
||||
}
|
||||
|
||||
func TestSkillQueryTermsStopwords(t *testing.T) {
|
||||
ascii, cjk := skillQueryTerms("织忆有哪些缓存层")
|
||||
if len(ascii) != 0 {
|
||||
t.Fatalf("纯中文查询不应有 ascii: %v", ascii)
|
||||
}
|
||||
want := map[string]bool{"织忆": true, "缓存": true, "存层": true}
|
||||
for _, s := range cjk {
|
||||
if !want[s] {
|
||||
t.Fatalf("停用词漏网: %v (full=%v)", s, cjk)
|
||||
}
|
||||
}
|
||||
for w := range want {
|
||||
found := false
|
||||
for _, s := range cjk {
|
||||
if s == w {
|
||||
found = true
|
||||
}
|
||||
}
|
||||
if !found {
|
||||
t.Fatalf("实词被误删: %q full=%v", w, cjk)
|
||||
}
|
||||
}
|
||||
// ASCII token 不受停用词影响
|
||||
a2, _ := skillQueryTerms("RedisCache 的 TTL 怎么配")
|
||||
if len(a2) != 2 || a2[0] != "rediscache" || a2[1] != "ttl" {
|
||||
t.Fatalf("ascii terms 错误: %v", a2)
|
||||
}
|
||||
}
|
||||
|
||||
func writeFixtureSkill(t *testing.T, dir, rel, content string) string {
|
||||
t.Helper()
|
||||
p := filepath.Join(dir, rel)
|
||||
if err := os.MkdirAll(filepath.Dir(p), 0o755); err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
if err := os.WriteFile(p, []byte(content), 0o644); err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
return p
|
||||
}
|
||||
|
||||
func TestSkillRefsFixtureShapeAndHit(t *testing.T) {
|
||||
resetSkillIdxForTest(t)
|
||||
dir := t.TempDir()
|
||||
p1 := writeFixtureSkill(t, dir, "zhiyi/zhiyi/SKILL.md",
|
||||
"---\nname: zhiyi\n---\n# 织忆\n\n## 现成缓存设施清单\n\n| 设施 | 位置 |\n|---|---|\n| `RedisCache` + `NewRedisCache(ttl)` | storage/redis.go |\n| `L2CacheBackend` + `redisL2Adapter` | storage/searchcache.go |\n\n## 无关段\n\n这里讲图谱 pruning 的宽限期。\n")
|
||||
p2 := writeFixtureSkill(t, dir, "cooking/pancake.md",
|
||||
"# 煎饼\n\n## 做法\n\n面糊醒 20 分钟。全库最常说的「有哪些」句式也写在这。\n")
|
||||
|
||||
t.Setenv("ZHIYI_SKILLS_DIR", dir)
|
||||
t.Setenv("ZHIYI_RECALL_SKILLREFS", "1")
|
||||
|
||||
refs := skillRefsForQuery("织忆有哪些缓存层", 5)
|
||||
if len(refs) == 0 {
|
||||
t.Fatalf("fixture 查询必须命中")
|
||||
}
|
||||
if refs[0].Path != p1 {
|
||||
t.Fatalf("首位应命中 zhiyi SKILL.md,实际 %s", refs[0].Path)
|
||||
}
|
||||
for _, x := range refs {
|
||||
if !strings.HasSuffix(x.Path, ".md") {
|
||||
t.Fatalf("skill_refs 只能指向 md:%s", x.Path)
|
||||
}
|
||||
}
|
||||
_ = p2
|
||||
}
|
||||
|
||||
func TestSkillRefsRealCorpusProbes(t *testing.T) {
|
||||
home, err := os.UserHomeDir()
|
||||
if err != nil {
|
||||
t.Skip("no home")
|
||||
}
|
||||
realDir := filepath.Join(home, ".hermes", "skills")
|
||||
if fi, e := os.Stat(realDir); e != nil || !fi.IsDir() {
|
||||
t.Skipf("真实技能库不存在:%s", realDir)
|
||||
}
|
||||
resetSkillIdxForTest(t)
|
||||
t.Setenv("ZHIYI_SKILLS_DIR", "") // 走默认真实目录
|
||||
t.Setenv("ZHIYI_RECALL_SKILLREFS", "1")
|
||||
|
||||
// 探针①
|
||||
refs := skillRefsForQuery("织忆有哪些缓存层", 5)
|
||||
if len(refs) == 0 {
|
||||
t.Fatalf("探针① skill_refs 为空")
|
||||
}
|
||||
found := false
|
||||
for _, r := range refs {
|
||||
raw, e := os.ReadFile(r.Path)
|
||||
if e != nil {
|
||||
continue
|
||||
}
|
||||
if strings.Contains(string(raw), "RedisCache") || strings.Contains(string(raw), "L2Cache") {
|
||||
found = true
|
||||
t.Logf("探针① 命中:%s matched=%v", r.Path, r.Matched)
|
||||
break
|
||||
}
|
||||
}
|
||||
if !found {
|
||||
t.Fatalf("探针① top3 中没有含 RedisCache/L2Cache 的文件:%v", pathsOf(refs))
|
||||
}
|
||||
|
||||
// 探针②
|
||||
refs = skillRefsForQuery("Go Rust 启动顺序", 5)
|
||||
if len(refs) == 0 {
|
||||
t.Fatalf("探针② skill_refs 为空")
|
||||
}
|
||||
found = false
|
||||
for _, r := range refs {
|
||||
raw, e := os.ReadFile(r.Path)
|
||||
if e != nil {
|
||||
continue
|
||||
}
|
||||
if strings.Contains(string(raw), "先 Go") || strings.Contains(string(raw), "先Go") {
|
||||
found = true
|
||||
t.Logf("探针② 命中:%s matched=%v", r.Path, r.Matched)
|
||||
break
|
||||
}
|
||||
}
|
||||
if !found {
|
||||
t.Fatalf("探针② top3 中没有含「先 Go」的文件:%v", pathsOf(refs))
|
||||
}
|
||||
}
|
||||
|
||||
func pathsOf(refs []SkillSectionRef) []string {
|
||||
out := make([]string, 0, len(refs))
|
||||
for _, r := range refs {
|
||||
out = append(out, r.Path)
|
||||
}
|
||||
return out
|
||||
}
|
||||
@@ -0,0 +1,73 @@
|
||||
package routes
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// 2026-10-13 (t_e9a4d18f P2) 常设答案路由(Hindsight mental models 直读/写入)。
|
||||
// 读取 = 一次 DB 读(question_id 主键),零检索零 LLM。写入由生成脚本
|
||||
// zhiyi-standing-answers.py 调用(复用本地 2B,免费)。
|
||||
|
||||
// standingStore 返回全局常设答案库(server.go 注入)。未初始化 → nil。
|
||||
func standingStore() *storage.StandingStore { return storage.StandingStoreInstance }
|
||||
|
||||
// HandleStandingAnswers GET/POST /api/v1/standing-answers
|
||||
// GET ?id=<question_id> → 直读一条;无 id → 列全部
|
||||
// POST {"question_id","question","answer","op":{...},"source_memories":[]} → 写入/改写
|
||||
func HandleStandingAnswers(w http.ResponseWriter, r *http.Request) {
|
||||
s := standingStore()
|
||||
if s == nil {
|
||||
respondError(w, http.StatusServiceUnavailable, "standing answers store not initialized")
|
||||
return
|
||||
}
|
||||
switch r.Method {
|
||||
case http.MethodGet:
|
||||
id := r.URL.Query().Get("id")
|
||||
if id == "" {
|
||||
all, err := s.List()
|
||||
if err != nil {
|
||||
respondError(w, http.StatusInternalServerError, err.Error())
|
||||
return
|
||||
}
|
||||
respond(w, http.StatusOK, map[string]interface{}{"answers": all, "count": len(all)})
|
||||
return
|
||||
}
|
||||
a, err := s.Get(id)
|
||||
if err != nil {
|
||||
respondError(w, http.StatusInternalServerError, err.Error())
|
||||
return
|
||||
}
|
||||
if a == nil {
|
||||
respondError(w, http.StatusNotFound, "standing answer not found: "+id)
|
||||
return
|
||||
}
|
||||
respond(w, http.StatusOK, a)
|
||||
case http.MethodPost:
|
||||
var in struct {
|
||||
QuestionID string `json:"question_id"`
|
||||
Question string `json:"question"`
|
||||
Answer string `json:"answer"`
|
||||
Op *storage.OpCard `json:"op,omitempty"`
|
||||
SourceMemories []string `json:"source_memories"`
|
||||
}
|
||||
if err := json.NewDecoder(r.Body).Decode(&in); err != nil {
|
||||
respondError(w, http.StatusBadRequest, "bad json: "+err.Error())
|
||||
return
|
||||
}
|
||||
if in.QuestionID == "" || in.Answer == "" {
|
||||
respondError(w, http.StatusBadRequest, "question_id and answer required")
|
||||
return
|
||||
}
|
||||
a, err := s.Upsert(in.QuestionID, in.Question, in.Answer, in.SourceMemories, in.Op)
|
||||
if err != nil {
|
||||
respondError(w, http.StatusInternalServerError, err.Error())
|
||||
return
|
||||
}
|
||||
respond(w, http.StatusOK, a)
|
||||
default:
|
||||
http.Error(w, "method not allowed", http.StatusMethodNotAllowed)
|
||||
}
|
||||
}
|
||||
+114
-44
@@ -1,117 +1,187 @@
|
||||
{
|
||||
"description": "织忆召回金标检查集(12条基线 + 2条目标知识)。统一判据口径(t_a70b07e1):取 recall 返回的前 N=5 条内容查关键词,ID 命中 = expected_ids 任一 ∈ 前 N=5 条;N=5 与 Go/Python 两量具(eval_test.go / golden-check.py)一致。判定:PASS=id且kw命中 / WARN=kw命中但ID漂移 / FAIL=其余 / ERROR=recall调用失败。单一真相源(t_949840b1):本文件是金标数据唯一副本;Python 量具 golden-check.py 直接读本文件(旧 ~/.hermes/scripts/tools/golden-set.json 副副本已删除),基线校准一次即两量具同步(--refresh 写回本文件)。⚠️ item4「牧尘喜欢什么样的工作方式」基线 2026-09-21 t_949840b1 校准为当前稳定值 mem_1789834428978989104(语料增长致旧基线 mem_1789837840173161705 掉出 top-5,前 N 内容仍切题)。校准后同批金标两量具分类差异=0(diff=1 的根因——两份副本 expected_ids 不同步——已消除)。",
|
||||
"description": "织忆召回金标检查集(单一真相源,t_949840b1)。统一判据口径 N=5:取 recall 返回前 N=5 条查关键词,ID 命中 = expected_ids 任一 ∈ 前 N=5 条。基线已刷新(golden-check.py --refresh,两量具同源)。",
|
||||
"items": [
|
||||
{
|
||||
"query": "织忆是什么",
|
||||
"expected_ids": ["mem_1789153726378940805"],
|
||||
"must_include_keywords": ["织忆"],
|
||||
"expected_ids": [
|
||||
"mem_1791666702950691634"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"织忆"
|
||||
],
|
||||
"category": "system_fact",
|
||||
"difficulty": "easy",
|
||||
"id_baseline": "mem_1789153726378940805"
|
||||
"id_baseline": "mem_1791666702950691634",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "织忆的图谱扩展机制是什么",
|
||||
"expected_ids": ["mem_1789823837902661249"],
|
||||
"must_include_keywords": ["图谱"],
|
||||
"expected_ids": [
|
||||
"mem_1791899478673190284"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"图谱"
|
||||
],
|
||||
"category": "system_fact",
|
||||
"difficulty": "medium",
|
||||
"id_baseline": "mem_1789823837902661249"
|
||||
"id_baseline": "mem_1791899478673190284",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "织忆如何通过 E1 提取和 MMR 实现多样去重",
|
||||
"expected_ids": ["mem_1789915227303612056"],
|
||||
"must_include_keywords": ["MMR"],
|
||||
"expected_ids": [
|
||||
"mem_1791666890486125605"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"MMR"
|
||||
],
|
||||
"category": "system_fact",
|
||||
"difficulty": "hard",
|
||||
"id_baseline": "mem_1789915227303612056"
|
||||
"id_baseline": "mem_1791666890486125605",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "牧尘的偏好是什么",
|
||||
"expected_ids": ["mem_1789667544872361813"],
|
||||
"must_include_keywords": ["牧尘"],
|
||||
"expected_ids": [
|
||||
"mem_1790448247125520424"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"牧尘"
|
||||
],
|
||||
"category": "user_pref",
|
||||
"difficulty": "easy",
|
||||
"id_baseline": "mem_1789667544872361813"
|
||||
"id_baseline": "mem_1790448247125520424",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "牧尘喜欢什么样的工作方式",
|
||||
"expected_ids": ["mem_1789834428978989104"],
|
||||
"must_include_keywords": ["牧尘"],
|
||||
"expected_ids": [
|
||||
"mem_1790448247125520424"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"牧尘"
|
||||
],
|
||||
"category": "user_pref",
|
||||
"difficulty": "medium",
|
||||
"id_baseline": "mem_1789834428978989104"
|
||||
"id_baseline": "mem_1790448247125520424",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "如何根据牧尘的偏好调整记忆检索策略",
|
||||
"expected_ids": ["mem_1789190217889697697"],
|
||||
"must_include_keywords": ["记忆"],
|
||||
"expected_ids": [
|
||||
"mem_1791747597032219499"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"记忆"
|
||||
],
|
||||
"category": "user_pref",
|
||||
"difficulty": "hard",
|
||||
"id_baseline": "mem_1789190217889697697"
|
||||
"id_baseline": "mem_1791747597032219499",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "当前项目的技术栈是什么",
|
||||
"expected_ids": ["mem_1789680870868739202"],
|
||||
"must_include_keywords": ["技术栈"],
|
||||
"expected_ids": [
|
||||
"mem_1790455676397796671"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"技术栈"
|
||||
],
|
||||
"category": "proj_context",
|
||||
"difficulty": "easy",
|
||||
"id_baseline": "mem_1789680870868739202"
|
||||
"id_baseline": "mem_1790455676397796671",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "织忆项目有哪些核心组件",
|
||||
"expected_ids": ["mem_1789154058288011112"],
|
||||
"must_include_keywords": ["织忆"],
|
||||
"expected_ids": [
|
||||
"mem_1791906354849281414"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"织忆"
|
||||
],
|
||||
"category": "proj_context",
|
||||
"difficulty": "medium",
|
||||
"id_baseline": "mem_1789154058288011112"
|
||||
"id_baseline": "mem_1791906354849281414",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "织忆和其他记忆系统相比有什么架构优势",
|
||||
"expected_ids": ["mem_1789153726378940805"],
|
||||
"must_include_keywords": ["织忆"],
|
||||
"expected_ids": [
|
||||
"mem_1791666702950691634"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"织忆"
|
||||
],
|
||||
"category": "proj_context",
|
||||
"difficulty": "hard",
|
||||
"id_baseline": "mem_1789153726378940805"
|
||||
"id_baseline": "mem_1791666702950691634",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "如何使用 recall 接口",
|
||||
"expected_ids": ["mem_1787272787836687543"],
|
||||
"must_include_keywords": ["recall"],
|
||||
"expected_ids": [
|
||||
"mem_1791796178328736793"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"recall"
|
||||
],
|
||||
"category": "tool_usage",
|
||||
"difficulty": "easy",
|
||||
"id_baseline": "mem_1787272787836687543"
|
||||
"id_baseline": "mem_1791796178328736793",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "织忆有哪些管理工具",
|
||||
"expected_ids": ["mem_1789153726378940805"],
|
||||
"must_include_keywords": ["织忆"],
|
||||
"expected_ids": [
|
||||
"mem_1791666702950691634"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"织忆"
|
||||
],
|
||||
"category": "tool_usage",
|
||||
"difficulty": "medium",
|
||||
"id_baseline": "mem_1789153726378940805"
|
||||
"id_baseline": "mem_1791666702950691634",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "如何通过 API 扩展织忆功能",
|
||||
"expected_ids": ["mem_1789153726378940805"],
|
||||
"must_include_keywords": ["织忆"],
|
||||
"expected_ids": [
|
||||
"mem_1791666188168772049"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"织忆"
|
||||
],
|
||||
"category": "tool_usage",
|
||||
"difficulty": "hard",
|
||||
"id_baseline": "mem_1789153726378940805"
|
||||
"id_baseline": "mem_1791666188168772049",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "本地 llama 服务 8080 端口",
|
||||
"expected_ids": ["mem_1789229548476546193"],
|
||||
"must_include_keywords": ["8080"],
|
||||
"expected_ids": [
|
||||
"mem_1791423503359721152"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"8080"
|
||||
],
|
||||
"category": "target_knowledge",
|
||||
"difficulty": "easy",
|
||||
"id_baseline": "mem_1789229548476546193"
|
||||
"id_baseline": "mem_1791423503359721152",
|
||||
"namespace": "hermes-main"
|
||||
},
|
||||
{
|
||||
"query": "session-to-zhiyi.py 脚本名",
|
||||
"expected_ids": ["mem_1788977361686058470"],
|
||||
"must_include_keywords": ["session-to-zhiyi"],
|
||||
"expected_ids": [
|
||||
"mem_1791688470278719760"
|
||||
],
|
||||
"must_include_keywords": [
|
||||
"session-to-zhiyi"
|
||||
],
|
||||
"category": "target_knowledge",
|
||||
"difficulty": "easy",
|
||||
"id_baseline": "mem_1788977361686058470"
|
||||
"id_baseline": "mem_1791688470278719760",
|
||||
"namespace": "hermes-main"
|
||||
}
|
||||
]
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,52 @@
|
||||
// 织忆 MemoryWeave — routes 包测试隔离(两个护栏合并 · t_e5997ca4 + t_b7a8ed9c)
|
||||
//
|
||||
// ⚠️ 本文件是**两个 TestMain 的合并体**。两卡分支各自加了一个 TestMain:
|
||||
// · t_e5997ca4 → testmain_test.go(落盘点护栏)
|
||||
// · t_b7a8ed9c → scorecache_guard_test.go(打分缓存护栏)
|
||||
// 在各自分支上互不干扰,合并到 main 后同包两个 TestMain **编译冲突**
|
||||
// (multiple definitions of TestMain)⇒ 必须合进一个文件。
|
||||
// (此点由 t_b7a8ed9c 在 scorecache_guard_test.go 顶部预先标注;小怡合并时未读文件
|
||||
// 而漏看,由全套测试的 setup failed 拦下 —— 见 worklog 教训。)
|
||||
//
|
||||
// 护栏①:单元测试不得写到生产落盘点(t_e5997ca4)
|
||||
// ---------------------------------------------------------------
|
||||
// selfoptimize 包已有同款 TestMain 先例(曾实测:整套测试跑完把
|
||||
// /var/lib/memoryweave/dashboard.json 写成测试数字)。
|
||||
// gap close/repair 端点会触发 Dash.persist()(本地 JSON 兜底)⇒ 统一重定向到临时目录。
|
||||
//
|
||||
// 护栏②:默认关闭 distill 打分缓存(t_b7a8ed9c)
|
||||
// ---------------------------------------------------------------
|
||||
// 背景:distill 打分记忆化(0dc571d)+ Redis L2(36db9bb,键 zhiyi:distill-score:*,
|
||||
// TTL 168h)后,**本包 E2E 测试(zz_commit_conflict_gate_test.go)会读写生产 Redis**:
|
||||
// 第一次 run L2 miss → 真调 mock LLM 并把「测试内容哈希 → 结果」写进生产;
|
||||
// 7 天内后续 run L2 hit → LLM 被静默短路 → 数 LLM 调用次数的断言(base+1)必挂。
|
||||
// 实测 2026-10-17:TestCommitConflictGate_E2E 16.5s 固定 FAIL,
|
||||
// 「expected >= 1 LLM distill calls, got 0」。
|
||||
//
|
||||
// 治法(对齐项目门禁规矩③:加缓存必须给该包 TestMain 加关闭开关):
|
||||
// Setenv ZHIYI_SCORE_CACHE=0 —— distill.getScoreCache 的 Once 闭包**活读 env**
|
||||
// (包级变量在 init 时已定型,跨包设不了),本进程内缓存整体禁用:
|
||||
// 不读 L2(LLM 真被调用,计数断言有覆盖)、不写 L2(不再污染生产)。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"os"
|
||||
"path/filepath"
|
||||
"testing"
|
||||
)
|
||||
|
||||
func TestMain(m *testing.M) {
|
||||
// 护栏①:落盘点重定向到临时目录(宁可测试直接失败,也不写生产落盘点)
|
||||
dir, err := os.MkdirTemp("", "routes-test-dash-*")
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
_ = os.Setenv("ZHIYI_DASHBOARD_PATH", filepath.Join(dir, "dashboard.json"))
|
||||
|
||||
// 护栏②:关闭 distill 打分缓存(不读/不写生产 Redis L2)
|
||||
_ = os.Setenv("ZHIYI_SCORE_CACHE", "0")
|
||||
|
||||
code := m.Run()
|
||||
_ = os.RemoveAll(dir)
|
||||
os.Exit(code)
|
||||
}
|
||||
@@ -0,0 +1,49 @@
|
||||
// 织忆 MemoryWeave — 召回链路追踪端点(P0-1,2026-10-26)
|
||||
//
|
||||
// GET /api/v1/trace/<trace_id>
|
||||
//
|
||||
// 返回该次召回的:各阶段耗时(encode/coarse_search/fts_recall/bm25/rerank_fusion/mmr_select/
|
||||
// graph_expand/dedupe)、各通道贡献条数(channels)、每条结果的来源归因(items)、
|
||||
// status/partial_reason、scope、cache_hit/truncated。
|
||||
//
|
||||
// 数据来源:内存环形缓冲(最近 2000 条)+ JSONL 落盘(/var/lib/memoryweave/traces/),
|
||||
// 服务重启后仍可按 trace_id 回溯(落盘扫描)。
|
||||
package routes
|
||||
|
||||
import (
|
||||
"context"
|
||||
"net/http"
|
||||
"strings"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// ── P0-3 召回硬超时:取消函数类型 + context.WithTimeout 包装 ──────────────
|
||||
// core.go Recall() 在 req.DeadlineMS>0 时需要带类型标记的取消函数,以便 defer 取消。
|
||||
// 2026-10-26 (t_e98cb1d6):此处补齐使 routes 包可编译(否则 routes 全包不可构建,
|
||||
// capRecallResults 的单测无法跑通)。这是缺失的声明,不是功能实现;P0-3 的 trace 完整
|
||||
// 接线(tr.Stage 埋点、tr 落盘)仍待 P0-3 本任务补齐。
|
||||
type ctxDeadlineFunc context.CancelFunc
|
||||
|
||||
func contextWithTimeout(ctx context.Context, timeout time.Duration) (context.Context, ctxDeadlineFunc) {
|
||||
c, cancel := context.WithTimeout(ctx, timeout)
|
||||
return c, ctxDeadlineFunc(cancel)
|
||||
}
|
||||
|
||||
// Trace 查询单条召回链路。路径形如 /api/v1/trace/tr_xxxx。
|
||||
func (a *API) Trace(w http.ResponseWriter, r *http.Request) {
|
||||
id := strings.TrimSpace(strings.TrimPrefix(r.URL.Path, "/api/v1/trace/"))
|
||||
if id == "" {
|
||||
respondErrorSchema(w, 400, "trace_id_required", "用法:GET /api/v1/trace/<trace_id>", 0)
|
||||
return
|
||||
}
|
||||
tr, ok := storage.GetTrace(id)
|
||||
if !ok {
|
||||
// 404 与「trace 过期/被环形缓冲覆盖」同义:调用方据此走「重新召回」而不是当成系统故障。
|
||||
respondErrorSchema(w, 404, "trace_not_found",
|
||||
"trace 不存在或已被环形缓冲覆盖(内存保留最近 2000 条,落盘按天分文件)", 0)
|
||||
return
|
||||
}
|
||||
respond(w, 200, tr)
|
||||
}
|
||||
@@ -2,11 +2,16 @@
|
||||
package routes
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"log"
|
||||
"net/http"
|
||||
"os"
|
||||
"strings"
|
||||
"sync"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/selfoptimize"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// TuningConfig 可自动调优的参数
|
||||
@@ -21,6 +26,15 @@ type TuningConfig struct {
|
||||
|
||||
// 历史调参记录
|
||||
history []TuningEvent
|
||||
|
||||
// lastSkipped 上一次 AutoTune 里「因指标不可用而跳过」的规则与原因。
|
||||
// 让外部能区分「健康所以没调」与「数据不可用所以没调」——后者需要修数据源,不是好事。
|
||||
lastSkipped []string
|
||||
|
||||
// lastMoveAt 每个参数上一次被改动的时间 —— 用于冷却(治棘轮)。
|
||||
lastMoveAt map[string]time.Time
|
||||
// persistEnabled 仅全局 Tuner 为 true;测试里构造的实例为 false ⇒ 不写盘。
|
||||
persistEnabled bool
|
||||
}
|
||||
|
||||
type TuningEvent struct {
|
||||
@@ -32,11 +46,149 @@ type TuningEvent struct {
|
||||
}
|
||||
|
||||
var Tuner = &TuningConfig{
|
||||
Diversity: 0.5,
|
||||
// ⚠️ 初值必须等于**真实消费方的默认值**,否则接线当天就改变生产行为:
|
||||
// Diversity 对齐 storage.DefaultMMRDiversity() 的 0.3(core.go 原硬编码),原为 0.5。
|
||||
Diversity: 0.3,
|
||||
DecayRate: 0.015,
|
||||
GapThreshold: 3,
|
||||
DistillInterval: 5,
|
||||
ConsolidateAfter: 50,
|
||||
|
||||
lastMoveAt: map[string]time.Time{},
|
||||
persistEnabled: true,
|
||||
}
|
||||
|
||||
// tuneCooldown 同一参数的调参冷却时间。
|
||||
// 为什么需要:**AutoTune 不幂等** —— 同一判据每调一次就推一步(实测连跑两次:
|
||||
// decay_rate 0.015→0.018→0.0216、distill_interval 5→4→3),直到撞上限。
|
||||
// 闭环每天跑一次 ⇒ 几天内把参数顶到极值。冷却把「持续推进」限制成
|
||||
// 「同一指标须持续越界多个窗口,才多次调整」。
|
||||
const tuneCooldown = 6 * time.Hour
|
||||
|
||||
// minTuningSamples 调参判据的最小样本数。
|
||||
// 为什么需要:小样本的比率噪声极大 —— 实测现网 recall_usefulness_rate 只有 9 个样本,
|
||||
// 8 好 1 坏 = 0.89,再来 1 个好评就 > 0.9 ⇒ 触发「降低 diversity」直接改生产参数。
|
||||
// 少样本不是证据。
|
||||
const minTuningSamples = 30
|
||||
|
||||
// ratioFor 取一个「可用于调参」的比率指标,不可用则返回 ok=false。
|
||||
//
|
||||
// 约定(internal/selfoptimize/selfoptimize.go:248-322):
|
||||
//
|
||||
// <name>_rate —— 比率值;**分母退化时返回 -1**(metricNA),既不是 0 也不是 1
|
||||
// <name>_samples —— 该比率的分母样本数
|
||||
// <name>_valid —— 分母是否非退化
|
||||
//
|
||||
// ⚠️ AutoTune 原先只比较数值,无视这套约定 ⇒ `-1` 会让规则对「无数据」**恒真**:
|
||||
//
|
||||
// gap_closure_rate = -1 < 0.5 ⇒「降低 gap 阈值」每轮都触发(按垃圾指标改生产参数)
|
||||
// recall_usefulness_rate 样本 9 条 ⇒ 一次偶然就改 Diversity
|
||||
//
|
||||
// 本函数把「无数据 / 退化 / 样本不足」三类一律判为不可用 —— 宁可不动。
|
||||
// ⚠️ 命名不是统一的:比率键为 `<base>_rate`,而 *样本/有效* 键挂在 **base** 上
|
||||
// 而不是带 _rate 的那个串上 —— 实际键是 `recall_usefulness_samples`,
|
||||
// 不是 `recall_usefulness_rate_samples`(我第一版就按后者拼,护栏静默失效、
|
||||
// 参数照样被改;新加的 tuning_guard_test.go 当场逮住)。
|
||||
// 且 `avg_distill_loss` 这类**值键本身不带 _rate 后缀** ⇒ 统一用 TrimSuffix 推 base。
|
||||
func ratioFor(metrics map[string]float64, valueKey string) (float64, bool) {
|
||||
base := strings.TrimSuffix(valueKey, "_rate")
|
||||
v, ok := metrics[valueKey]
|
||||
if !ok || v < 0 {
|
||||
return 0, false // 缺失 或 -1 哨兵 = 无数据
|
||||
}
|
||||
if valid, ok := metrics[base+"_valid"]; ok && valid == 0 {
|
||||
return 0, false // 分母退化
|
||||
}
|
||||
if samples, ok := metrics[base+"_samples"]; ok && samples < minTuningSamples {
|
||||
return 0, false // 样本不足以支撑判断
|
||||
}
|
||||
return v, true
|
||||
}
|
||||
|
||||
// canMove 判断某参数当前是否允许改动(冷却窗口内不许重复动 —— 治棘轮)。
|
||||
func (tc *TuningConfig) canMove(param string) bool {
|
||||
last, ok := tc.lastMoveAt[param]
|
||||
return !ok || time.Since(last) >= tuneCooldown
|
||||
}
|
||||
|
||||
func (tc *TuningConfig) markMove(param string) {
|
||||
if tc.lastMoveAt == nil {
|
||||
tc.lastMoveAt = map[string]time.Time{}
|
||||
}
|
||||
tc.lastMoveAt[param] = time.Now()
|
||||
}
|
||||
|
||||
// pushToConsumers 把当前参数推给**真实消费方**。
|
||||
// 🔴 这一步是「调参有没有用」的分水岭:2026-10-14 实测,此前 Tuner 的全部字段
|
||||
// 没有任何读者(全仓只有 3 处路由注册引用它)⇒ 调参改了数字、行为零变化。
|
||||
func (tc *TuningConfig) pushToConsumers() {
|
||||
storage.SetDefaultMMRDiversity(tc.Diversity)
|
||||
selfoptimize.SetGapThreshold(tc.GapThreshold)
|
||||
}
|
||||
|
||||
// tuningStatePath 持久化路径(可用 ZHIYI_TUNING_STATE 覆盖,便于测试/隔离)。
|
||||
func tuningStatePath() string {
|
||||
if p := os.Getenv("ZHIYI_TUNING_STATE"); p != "" {
|
||||
return p
|
||||
}
|
||||
return "/var/lib/memoryweave/tuning-state.json"
|
||||
}
|
||||
|
||||
type tuningState struct {
|
||||
Diversity float64 `json:"diversity"`
|
||||
GapThreshold int `json:"gap_threshold"`
|
||||
LastMoveAt map[string]string `json:"last_move_at"`
|
||||
UpdatedAt string `json:"updated_at"`
|
||||
}
|
||||
|
||||
// persist 落盘(失败只告警,不影响调参本身)。
|
||||
func (tc *TuningConfig) persist() {
|
||||
if !tc.persistEnabled {
|
||||
return
|
||||
}
|
||||
st := tuningState{Diversity: tc.Diversity, GapThreshold: tc.GapThreshold,
|
||||
LastMoveAt: map[string]string{}, UpdatedAt: time.Now().Format(time.RFC3339)}
|
||||
for k, v := range tc.lastMoveAt {
|
||||
st.LastMoveAt[k] = v.Format(time.RFC3339)
|
||||
}
|
||||
data, err := json.MarshalIndent(st, "", " ")
|
||||
if err != nil {
|
||||
log.Printf("[tuning] 序列化失败: %v", err)
|
||||
return
|
||||
}
|
||||
if err := os.WriteFile(tuningStatePath(), data, 0o644); err != nil {
|
||||
log.Printf("[tuning] 落盘失败: %v", err)
|
||||
}
|
||||
}
|
||||
|
||||
// load 启动时载入持久化参数(无文件则用默认值),并立即接线到消费方。
|
||||
// 没有这一步,重启即回默认 ⇒ 调参成果每次重启清零。
|
||||
func (tc *TuningConfig) load() {
|
||||
data, err := os.ReadFile(tuningStatePath())
|
||||
if err == nil {
|
||||
var st tuningState
|
||||
if json.Unmarshal(data, &st) == nil {
|
||||
if st.Diversity > 0 {
|
||||
tc.Diversity = st.Diversity
|
||||
}
|
||||
if st.GapThreshold > 0 {
|
||||
tc.GapThreshold = st.GapThreshold
|
||||
}
|
||||
for k, v := range st.LastMoveAt {
|
||||
if t, e := time.Parse(time.RFC3339, v); e == nil {
|
||||
if tc.lastMoveAt == nil {
|
||||
tc.lastMoveAt = map[string]time.Time{}
|
||||
}
|
||||
tc.lastMoveAt[k] = t
|
||||
}
|
||||
}
|
||||
log.Printf("[tuning] 已载入持久化参数 diversity=%.3f gap_threshold=%d(%s)",
|
||||
tc.Diversity, tc.GapThreshold, st.UpdatedAt)
|
||||
}
|
||||
}
|
||||
tc.mu.Lock()
|
||||
tc.pushToConsumers()
|
||||
tc.mu.Unlock()
|
||||
}
|
||||
|
||||
// AutoTune 基于仪表盘指标自动调参
|
||||
@@ -45,61 +197,103 @@ func (tc *TuningConfig) AutoTune(metrics map[string]float64) []TuningEvent {
|
||||
defer tc.mu.Unlock()
|
||||
|
||||
var events []TuningEvent
|
||||
skipped := make([]string, 0, 5)
|
||||
// 记一次「本规则为什么没跑」—— 让调用方能解释「为什么没调参」,
|
||||
// 而不是只回 no_changes_needed(后者无法区分「健康」与「数据不可用」)。
|
||||
note := func(rule, why string) {
|
||||
skipped = append(skipped, rule+": "+why)
|
||||
}
|
||||
|
||||
// 1. 召回命中率 < 0.5 → 提高 diversity(扩大搜索范围)
|
||||
if hitRate, ok := metrics["recall_hit_rate"]; ok && hitRate < 0.5 {
|
||||
// 1. 召回质量低 → 提高 diversity(扩大搜索范围)。
|
||||
// 2026-10-17:原信号 recall_hit_rate 已退役(恒=1、从不及 0.5 ⇒ 本安全阀长期死寂)。
|
||||
// 改用 recall_usefulness_rate(返回且被使用)作为召回质量的实时信号:< 0.5 ⇒ 召回太窄、扩大范围。
|
||||
hitRate, hitOK := ratioFor(metrics, "recall_usefulness_rate")
|
||||
if !hitOK {
|
||||
note("rule1_usefulness", "指标不可用(无数据/退化/样本<20)")
|
||||
}
|
||||
if hitOK && hitRate < 0.5 && !tc.canMove("diversity") {
|
||||
note("rule1_usefulness", "冷却中(距上次调整 <"+tuneCooldown.String()+")")
|
||||
}
|
||||
if hitOK && hitRate < 0.5 && tc.canMove("diversity") {
|
||||
newDiversity := tc.Diversity + 0.1
|
||||
if newDiversity > 1.0 {
|
||||
newDiversity = 1.0
|
||||
}
|
||||
events = append(events, recordTuning(tc, "diversity", tc.Diversity, newDiversity, "recall_hit_rate < 0.5"))
|
||||
events = append(events, recordTuning(tc, "diversity", tc.Diversity, newDiversity, "recall_usefulness_rate < 0.5"))
|
||||
tc.Diversity = newDiversity
|
||||
tc.markMove("diversity")
|
||||
}
|
||||
|
||||
// 2. 召回有用率 > 0.9 → 降低 diversity(更精准)
|
||||
if usefulRate, ok := metrics["recall_usefulness_rate"]; ok && usefulRate > 0.9 {
|
||||
usefulRate, usefulOK := ratioFor(metrics, "recall_usefulness_rate")
|
||||
if !usefulOK {
|
||||
note("rule2_usefulness", "指标不可用(无数据/退化/样本<30)")
|
||||
}
|
||||
if usefulOK && usefulRate > 0.9 && !tc.canMove("diversity") {
|
||||
note("rule2_usefulness", "冷却中(距上次调整 <"+tuneCooldown.String()+")")
|
||||
}
|
||||
if usefulOK && usefulRate > 0.9 && tc.canMove("diversity") {
|
||||
newDiversity := tc.Diversity - 0.05
|
||||
if newDiversity < 0.1 {
|
||||
newDiversity = 0.1
|
||||
}
|
||||
events = append(events, recordTuning(tc, "diversity", tc.Diversity, newDiversity, "recall_usefulness_rate > 0.9"))
|
||||
tc.Diversity = newDiversity
|
||||
tc.markMove("diversity")
|
||||
}
|
||||
|
||||
// 3. 废弃率 > 5/day → 提高衰减率(加快清理)
|
||||
if deprecated, ok := metrics["deprecated_per_day"]; ok && deprecated > 5 {
|
||||
newDecay := tc.DecayRate * 1.2
|
||||
if newDecay > 0.05 {
|
||||
newDecay = 0.05
|
||||
}
|
||||
events = append(events, recordTuning(tc, "decay_rate", tc.DecayRate, newDecay, "deprecated_per_day > 5"))
|
||||
tc.DecayRate = newDecay
|
||||
}
|
||||
// 3.(2026-10-14 移除)废弃率 → 提高衰减率。
|
||||
// 移除理由:这个方向危险。governance.NewForgetter 上方注释记载:
|
||||
// 「2026-09-07 方案A: 0.015→0.03 曾致误删(36天库龄下 0-recall 长记忆全被清, 405字CNB经验被删)」。
|
||||
// 自动调参朝这个方向推 = 把那条事故路重新铺上;而收益只是「加快清理」。
|
||||
// 若要恢复,必须先有「误删可回滚 + 删除前抽样人工确认」的保护,不能只靠阈值。
|
||||
|
||||
// 4. 缺口闭环率 < 0.5 → 降低 gap 阈值
|
||||
if gapRate, ok := metrics["gap_closure_rate"]; ok && gapRate < 0.5 {
|
||||
gapRate, gapOK := ratioFor(metrics, "gap_closure_rate")
|
||||
if !gapOK {
|
||||
note("rule4_gap_threshold", "指标不可用(无数据/退化/样本<30)")
|
||||
}
|
||||
if gapOK && gapRate < 0.5 && !tc.canMove("gap_threshold") {
|
||||
note("rule4_gap_threshold", "冷却中(距上次调整 <"+tuneCooldown.String()+")")
|
||||
}
|
||||
if gapOK && gapRate < 0.5 && tc.canMove("gap_threshold") {
|
||||
newThreshold := tc.GapThreshold - 1
|
||||
if newThreshold < 2 {
|
||||
newThreshold = 2
|
||||
}
|
||||
events = append(events, recordTuningInt(tc, "gap_threshold", tc.GapThreshold, newThreshold, "gap_closure_rate < 0.5"))
|
||||
tc.GapThreshold = newThreshold
|
||||
tc.markMove("gap_threshold")
|
||||
}
|
||||
|
||||
// 5. 蒸馏损失 > 0.3 → 更频繁蒸馏
|
||||
if loss, ok := metrics["avg_distill_loss"]; ok && loss > 0.3 {
|
||||
newInterval := tc.DistillInterval - 1
|
||||
if newInterval < 1 {
|
||||
newInterval = 1
|
||||
}
|
||||
events = append(events, recordTuningInt(tc, "distill_interval", tc.DistillInterval, newInterval, "avg_distill_loss > 0.3"))
|
||||
tc.DistillInterval = newInterval
|
||||
}
|
||||
// 5.(2026-10-14 移除)蒸馏损失 → 缩短蒸馏间隔。
|
||||
// 移除理由:**没有正确的消费方**。distill/engine.go:265 的 batchTimeout(5min)是
|
||||
// 「队列冻结兜底 ticker」(2026-10-06 修的「生产者停止即永久冻结」安全网),
|
||||
// **不是蒸馏节奏**。调安全网的周期治不了蒸馏质量 —— 接到错的地方比不接更坏。
|
||||
// 若将来真有「蒸馏节奏」消费者,再恢复本规则并接对目标。
|
||||
|
||||
tc.history = append(tc.history, events...)
|
||||
tc.lastSkipped = skipped
|
||||
if len(events) > 0 {
|
||||
tc.pushToConsumers() // 改了就必须接线,否则等于没改
|
||||
tc.persist() // 不落盘则重启即丢
|
||||
}
|
||||
return events
|
||||
}
|
||||
|
||||
// init 启动时载入持久化参数并接线(没有它:重启回默认 + 调参不生效)。
|
||||
func init() { Tuner.load() }
|
||||
|
||||
// LastSkipped 返回上一次调参里被跳过的规则及原因(只读快照)。
|
||||
func (tc *TuningConfig) LastSkipped() []string {
|
||||
tc.mu.RLock()
|
||||
defer tc.mu.RUnlock()
|
||||
out := make([]string, len(tc.lastSkipped))
|
||||
copy(out, tc.lastSkipped)
|
||||
return out
|
||||
}
|
||||
|
||||
func recordTuning(tc *TuningConfig, param string, oldVal, newVal float64, reason string) TuningEvent {
|
||||
return TuningEvent{
|
||||
Parameter: param,
|
||||
@@ -135,7 +329,8 @@ func (tc *TuningConfig) StatusHandler(w http.ResponseWriter, r *http.Request) {
|
||||
"distill_interval": tc.DistillInterval,
|
||||
"consolidate_after": tc.ConsolidateAfter,
|
||||
},
|
||||
"history": tc.history,
|
||||
"history": tc.history,
|
||||
"last_skipped": tc.lastSkipped,
|
||||
})
|
||||
}
|
||||
|
||||
@@ -145,7 +340,11 @@ func (tc *TuningConfig) RunHandler(w http.ResponseWriter, r *http.Request) {
|
||||
events := tc.AutoTune(metrics)
|
||||
|
||||
if len(events) == 0 {
|
||||
respond(w, 200, map[string]string{"status": "no_changes_needed"})
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"status": "no_changes_needed",
|
||||
// 区分「健康」与「数据不可用」:后者要修数据源,而不是当作一切正常。
|
||||
"skipped": tc.lastSkipped,
|
||||
})
|
||||
} else {
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"status": "tuned",
|
||||
@@ -157,25 +356,34 @@ func (tc *TuningConfig) RunHandler(w http.ResponseWriter, r *http.Request) {
|
||||
|
||||
// POST /api/v1/tuning/analytics — 运行因果分析
|
||||
func (tc *TuningConfig) AnalyticsHandler(w http.ResponseWriter, r *http.Request) {
|
||||
// 基于指标间的关系给出建议
|
||||
m := selfoptimize.Dash.Metrics()
|
||||
|
||||
suggestions := []string{}
|
||||
if m["recall_hit_rate"] < 0.5 && m["avg_distill_loss"] > 0.3 {
|
||||
suggestions = append(suggestions, "蒸馏质量低导致召回率低 — 建议检查 Embedding 模型")
|
||||
}
|
||||
if m["deprecated_per_day"] > 10 {
|
||||
suggestions = append(suggestions, "废弃率过高 — 正在流失大量记忆,检查冲突检测阈值")
|
||||
}
|
||||
if m["gap_closure_rate"] < 0.3 {
|
||||
suggestions = append(suggestions, "缺口闭环率过低 — Agent 未回应缺口学习请求")
|
||||
}
|
||||
if m["auto_resolve_rate"] < 0.5 {
|
||||
suggestions = append(suggestions, "自动裁决率低 — 规则覆盖不全,考虑扩展策略")
|
||||
}
|
||||
|
||||
suggestions := AnalyticsSuggestions(m)
|
||||
respond(w, 200, map[string]interface{}{
|
||||
"metrics": m,
|
||||
"suggestions": suggestions,
|
||||
})
|
||||
}
|
||||
|
||||
// AnalyticsSuggestions 依据指标间关系给出调优建议(纯函数,便于单测反例:N/A 不产生建议)。
|
||||
//
|
||||
// ⚠️ 每条建议的比率比较都必须先判 N/A(ratioFor 已封装:-1 哨兵 / valid=0 / 样本不足 ⇒ 不可用)。
|
||||
// 若直接 `m[key] < 阈值`,-1 会恒真 ⇒ 无数据也误报建议(本卡 t_c70f385c 事故面)。
|
||||
// deprecated_per_day 是计数(恒 ≥0,非比率),不走 ratioFor。
|
||||
func AnalyticsSuggestions(m map[string]float64) []string {
|
||||
suggestions := []string{}
|
||||
if hr, ok := ratioFor(m, "recall_usefulness_rate"); ok && hr < 0.5 {
|
||||
if dl, ok2 := ratioFor(m, "avg_distill_loss"); ok2 && dl > 0.3 {
|
||||
suggestions = append(suggestions, "蒸馏质量低导致召回率低 — 建议检查 Embedding 模型")
|
||||
}
|
||||
}
|
||||
if m["deprecated_per_day"] > 10 {
|
||||
suggestions = append(suggestions, "废弃率过高 — 正在流失大量记忆,检查冲突检测阈值")
|
||||
}
|
||||
if g, ok := ratioFor(m, "gap_closure_rate"); ok && g < 0.3 {
|
||||
suggestions = append(suggestions, "缺口闭环率过低 — Agent 未回应缺口学习请求")
|
||||
}
|
||||
if a, ok := ratioFor(m, "auto_resolve_rate"); ok && a < 0.5 {
|
||||
suggestions = append(suggestions, "自动裁决率低 — 规则覆盖不全,考虑扩展策略")
|
||||
}
|
||||
return suggestions
|
||||
}
|
||||
|
||||
@@ -0,0 +1,38 @@
|
||||
// AnalyticsSuggestions N/A 哨兵护栏 —— 反例 + 正向对照。
|
||||
//
|
||||
// 本卡 t_c70f385c:AnalyticsHandler 的建议 builder 原为裸 `m[key] < 阈值`,
|
||||
// -1 哨兵(样本不足/越界被拦)会让 `-1 < 0.5` 恒真 ⇒ 无数据也误报建议。
|
||||
// 现统一走 ratioFor(已封装 N/A + valid=0 + 样本不足判定)。
|
||||
package routes
|
||||
|
||||
import "testing"
|
||||
|
||||
// TestAnalyticsSuggestions_NA_NoFiring 反例:全 N/A 哨兵(-1)不产生任何建议(避免误报)。
|
||||
func TestAnalyticsSuggestions_NA_NoFiring(t *testing.T) {
|
||||
na := map[string]float64{
|
||||
"recall_usefulness_rate": -1, "recall_usefulness_samples": 0, "recall_usefulness_valid": 0,
|
||||
"avg_distill_loss": -1, "avg_distill_loss_samples": 0, "avg_distill_loss_valid": 0,
|
||||
"gap_closure_rate": -1, "gap_closure_samples": 0, "gap_closure_valid": 0,
|
||||
"auto_resolve_rate": -1, "auto_resolve_samples": 0, "auto_resolve_valid": 0,
|
||||
"deprecated_per_day": 0,
|
||||
}
|
||||
if s := AnalyticsSuggestions(na); len(s) != 0 {
|
||||
t.Fatalf("全 N/A 不应产生任何建议,实际 %d 条: %v", len(s), s)
|
||||
}
|
||||
}
|
||||
|
||||
// TestAnalyticsSuggestions_ValidLow 正向对照:有效且低于阈值时产生建议(护栏没把功能焊死)。
|
||||
func TestAnalyticsSuggestions_ValidLow(t *testing.T) {
|
||||
m := map[string]float64{
|
||||
"recall_usefulness_rate": 0.2, "recall_usefulness_samples": 100, "recall_usefulness_valid": 1,
|
||||
"gap_closure_rate": 0.1, "gap_closure_samples": 100, "gap_closure_valid": 1,
|
||||
"auto_resolve_rate": 0.2, "auto_resolve_samples": 100, "auto_resolve_valid": 1,
|
||||
"avg_distill_loss": 0.1, "avg_distill_loss_samples": 100, "avg_distill_loss_valid": 1,
|
||||
"deprecated_per_day": 0,
|
||||
}
|
||||
s := AnalyticsSuggestions(m)
|
||||
// 至少触发「gap 闭环率过低」+「自动裁决率低」两条
|
||||
if len(s) < 2 {
|
||||
t.Fatalf("有效且低于阈值应产生 ≥2 条建议,实际 %d 条: %v", len(s), s)
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,125 @@
|
||||
package routes
|
||||
|
||||
import (
|
||||
"testing"
|
||||
"time"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/selfoptimize"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
// TestAutoTuneGuard_SentinelAndSamples 双向验证护栏:
|
||||
// ① 无数据(-1 哨兵)不许改参数 —— 这是事故面:gap_closure_rate=-1 会让
|
||||
//
|
||||
// 「降低 gap 阈值」每轮恒真。
|
||||
//
|
||||
// ② 样本不足(<30)不许改参数 —— 少样本比率噪声极大。
|
||||
// ③ 数据健康时仍然要能调 —— 否则等于把功能焊死。
|
||||
func TestAutoTuneGuard_SentinelAndSamples(t *testing.T) {
|
||||
// ① 哨兵值:全 -1 ⇒ 一个事件都不许有
|
||||
tc := &TuningConfig{Diversity: 0.5, DecayRate: 0.015, GapThreshold: 3, DistillInterval: 5, ConsolidateAfter: 50}
|
||||
na := map[string]float64{
|
||||
"gap_closure_rate": -1,
|
||||
"gap_closure_samples": 0,
|
||||
"gap_closure_valid": 0,
|
||||
"recall_usefulness_rate": -1,
|
||||
"avg_distill_loss": -1,
|
||||
"recall_usefulness_valid": 0,
|
||||
"avg_distill_loss_valid": 0,
|
||||
}
|
||||
if ev := tc.AutoTune(na); len(ev) != 0 {
|
||||
t.Fatalf("哨兵值(-1)不应触发任何调参,实际触发 %d 条: %+v", len(ev), ev)
|
||||
}
|
||||
if tc.GapThreshold != 3 || tc.Diversity != 0.5 {
|
||||
t.Fatalf("参数被改动:GapThreshold=%d Diversity=%v", tc.GapThreshold, tc.Diversity)
|
||||
}
|
||||
if len(tc.LastSkipped()) == 0 {
|
||||
t.Fatal("应记录跳过原因(否则无法区分『健康』与『数据不可用』)")
|
||||
}
|
||||
|
||||
// ② 样本不足:比率本身达标(>0.9)但只有 9 个样本 ⇒ 不许动
|
||||
tc2 := &TuningConfig{Diversity: 0.5, DecayRate: 0.015, GapThreshold: 3, DistillInterval: 5, ConsolidateAfter: 50}
|
||||
low := map[string]float64{
|
||||
"recall_usefulness_rate": 0.95,
|
||||
"recall_usefulness_samples": 9,
|
||||
"recall_usefulness_valid": 1,
|
||||
}
|
||||
if ev := tc2.AutoTune(low); len(ev) != 0 {
|
||||
t.Fatalf("样本 9<30 不应触发调参,实际 %d 条: %+v", len(ev), ev)
|
||||
}
|
||||
|
||||
// ③ 数据健康 ⇒ 必须能调(证明护栏没把功能焊死)
|
||||
tc3 := &TuningConfig{Diversity: 0.5, DecayRate: 0.015, GapThreshold: 3, DistillInterval: 5, ConsolidateAfter: 50}
|
||||
good := map[string]float64{
|
||||
"recall_usefulness_rate": 0.95,
|
||||
"recall_usefulness_samples": 100,
|
||||
"recall_usefulness_valid": 1,
|
||||
}
|
||||
ev := tc3.AutoTune(good)
|
||||
if len(ev) != 1 {
|
||||
t.Fatalf("健康数据应触发 1 条调参,实际 %d 条", len(ev))
|
||||
}
|
||||
if tc3.Diversity >= 0.5 {
|
||||
t.Fatalf("Diversity 应被降低,实际 %v", tc3.Diversity)
|
||||
}
|
||||
}
|
||||
|
||||
// TestAutoTuneCooldown 冷却:同一参数在冷却窗口内不许被重复推进(治棘轮)。
|
||||
// 事故面(实测):AutoTune 不幂等 —— 连跑两次 decay 0.015→0.018→0.0216。
|
||||
func TestAutoTuneCooldown(t *testing.T) {
|
||||
tc := &TuningConfig{Diversity: 0.5, DecayRate: 0.015, GapThreshold: 3, DistillInterval: 5, ConsolidateAfter: 50}
|
||||
m := map[string]float64{
|
||||
"recall_usefulness_rate": 0.95,
|
||||
"recall_usefulness_samples": 100,
|
||||
"recall_usefulness_valid": 1,
|
||||
}
|
||||
if ev := tc.AutoTune(m); len(ev) != 1 {
|
||||
t.Fatalf("第一次应调 1 条,实际 %d", len(ev))
|
||||
}
|
||||
first := tc.Diversity
|
||||
if ev := tc.AutoTune(m); len(ev) != 0 {
|
||||
t.Fatalf("冷却窗口内不应再调,实际 %d 条: %+v", len(ev), ev)
|
||||
}
|
||||
if tc.Diversity != first {
|
||||
t.Fatalf("冷却期内参数被改动:%v → %v(棘轮复发)", first, tc.Diversity)
|
||||
}
|
||||
}
|
||||
|
||||
// TestAutoTunePushesToConsumers 推送:改完参数必须真的到消费方手里,
|
||||
// 否则就是「调参改了没人读的数字」(2026-10-14 实测的原状)。
|
||||
func TestAutoTunePushesToConsumers(t *testing.T) {
|
||||
orig := storage.DefaultMMRDiversity()
|
||||
defer storage.SetDefaultMMRDiversity(orig)
|
||||
tc := &TuningConfig{Diversity: 0.5, GapThreshold: 3}
|
||||
m := map[string]float64{
|
||||
"gap_closure_rate": 0.1,
|
||||
"gap_closure_samples": 100,
|
||||
"gap_closure_valid": 1,
|
||||
}
|
||||
before := selfoptimize.GapThreshold()
|
||||
ev := tc.AutoTune(m)
|
||||
if len(ev) != 1 {
|
||||
t.Fatalf("应触发 1 条(gap 阈值),实际 %d", len(ev))
|
||||
}
|
||||
if tc.GapThreshold != before-1 {
|
||||
t.Fatalf("期望阈值 %d→%d,实际 %d", before, before-1, tc.GapThreshold)
|
||||
}
|
||||
if got := selfoptimize.GapThreshold(); got != tc.GapThreshold {
|
||||
t.Fatalf("没推到消费方:selfoptimize.GapThreshold()=%d,Tuner=%d", got, tc.GapThreshold)
|
||||
}
|
||||
}
|
||||
|
||||
// TestTuningPersistence 持久化:换实例后能从盘上读回(否则重启即回默认)。
|
||||
func TestTuningPersistence(t *testing.T) {
|
||||
dir := t.TempDir()
|
||||
t.Setenv("ZHIYI_TUNING_STATE", dir+"/tuning-state.json")
|
||||
|
||||
a := &TuningConfig{Diversity: 0.42, GapThreshold: 4, persistEnabled: true, lastMoveAt: map[string]time.Time{}}
|
||||
a.persist()
|
||||
|
||||
b := &TuningConfig{Diversity: 0.3, GapThreshold: 3, lastMoveAt: map[string]time.Time{}}
|
||||
b.load()
|
||||
if b.Diversity != 0.42 || b.GapThreshold != 4 {
|
||||
t.Fatalf("未读回持久化参数:diversity=%v gap=%v", b.Diversity, b.GapThreshold)
|
||||
}
|
||||
}
|
||||
@@ -80,15 +80,20 @@ func (m *mockLance) IncrementUseful(id string) error { r
|
||||
func (m *mockLance) IncrementNotUseful(id string) error { return nil }
|
||||
|
||||
// GA-P0-1 (t_718d8707):拆分字段
|
||||
func (m *mockLance) IncrementHumanNotUseful(id string) error { return nil }
|
||||
func (m *mockLance) AppendHitEvent(memoryID, outcome, reason string) error { return nil }
|
||||
func (m *mockLance) CountHitEvents(memoryID, outcome string, since time.Time) (int, error) { return 0, nil }
|
||||
func (m *mockLance) GetHitEvents(memoryID string, limit int) ([]models.HitEvent, error) { return nil, nil }
|
||||
func (m *mockLance) IncrementDedupDownweight(id string) error { return nil }
|
||||
func (m *mockLance) UpdateMemoryContent(id, newContent, source string) error { return nil }
|
||||
func (m *mockLance) InsertMemory(rec models.MemoryRecord) error { return nil }
|
||||
func (m *mockLance) Insert(table string, record any) error { return nil }
|
||||
func (m *mockLance) Update(table, id string, fields map[string]any) error { return nil }
|
||||
func (m *mockLance) IncrementHumanNotUseful(id string) error { return nil }
|
||||
func (m *mockLance) AppendHitEvent(memoryID, outcome, reason string) error { return nil }
|
||||
func (m *mockLance) CountHitEvents(memoryID, outcome string, since time.Time) (int, error) {
|
||||
return 0, nil
|
||||
}
|
||||
func (m *mockLance) GetHitEvents(memoryID string, limit int) ([]models.HitEvent, error) {
|
||||
return nil, nil
|
||||
}
|
||||
func (m *mockLance) IncrementDedupDownweight(id string) error { return nil }
|
||||
func (m *mockLance) UpdateMemoryContent(id, newContent, source string) error { return nil }
|
||||
func (m *mockLance) InsertMemory(rec models.MemoryRecord) error { return nil }
|
||||
func (m *mockLance) Insert(table string, record any) error { return nil }
|
||||
func (m *mockLance) Update(table, id string, fields map[string]any) error { return nil }
|
||||
func (m *mockLance) GetRecordByID(table, id string) (*models.MemoryRecord, error) { return nil, nil }
|
||||
|
||||
// ─── mock: governance.GraphStore (全 no-op) ──────────────────
|
||||
|
||||
@@ -116,6 +121,7 @@ func (mockGraph) ListNodesByType(nodeType string, namespace string) []map[string
|
||||
}
|
||||
func (mockGraph) ListNodes(namespace string) []map[string]interface{} { return nil }
|
||||
func (mockGraph) Stats() (int, int, float64) { return 0, 0, 0 }
|
||||
func (mockGraph) CountNodesByType(string) (int, int, string) { return 0, 0, "" }
|
||||
func (mockGraph) Prune(minWeight float64) {}
|
||||
func (mockGraph) ExpandFromResults(results []models.RecallResult, namespace string, maxHops int) []models.RecallResult {
|
||||
return results
|
||||
|
||||
+458
-50
@@ -21,10 +21,14 @@ import (
|
||||
"github.com/xiaoxue/memoryweave/internal/api/routes"
|
||||
"github.com/xiaoxue/memoryweave/internal/distill"
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
"github.com/xiaoxue/memoryweave/internal/memprotect"
|
||||
"github.com/xiaoxue/memoryweave/internal/metrics"
|
||||
"github.com/xiaoxue/memoryweave/internal/models"
|
||||
"github.com/xiaoxue/memoryweave/internal/pattern"
|
||||
"github.com/xiaoxue/memoryweave/internal/peer"
|
||||
"github.com/xiaoxue/memoryweave/internal/redact"
|
||||
"github.com/xiaoxue/memoryweave/internal/selfoptimize"
|
||||
"github.com/xiaoxue/memoryweave/internal/skillgen"
|
||||
"github.com/xiaoxue/memoryweave/internal/storage"
|
||||
)
|
||||
|
||||
@@ -53,11 +57,28 @@ func NewServer() http.Handler {
|
||||
// 存储后端
|
||||
ldb := initStorageBackend(os.Getenv("STORAGE_BACKEND"), emb)
|
||||
|
||||
// 2026-10-13 (t_e9a4d18f P2) 常设答案库(独立 SQLite,Hindsight mental models)。
|
||||
// 只读写不主动注入 ⇒ 部署后行为零变化。注入由 zhiyi-standing-answers.py 生成后
|
||||
// 插件侧决定是否直读。路径可经 ZHIYI_STANDING_DB 覆盖。
|
||||
storage.InitStandingStore(os.Getenv("ZHIYI_STANDING_DB"))
|
||||
|
||||
// 召回元数据「累积延迟更新」缓冲(2026-09-12 优化B)
|
||||
// 读路径不再逐条写 LanceDB(MVCC 每写一行一个版本 → _versions 膨胀根因),
|
||||
// 改为窗口内合并 + 单事务批量提交(每批 1 个版本)。
|
||||
storage.InitRecallWriteBuffer(ldb)
|
||||
|
||||
// 2026-10-14 (t_2afae95e) FTS 词面通道:给 TF-IDF 索引挂全量数据源(ScanAll,
|
||||
// 只读 IPC lancedb_scan_all;不建 LanceDB tantivy 索引文件 ⇒ 零写 LanceDB)。
|
||||
// 索引本体在 storage 包内后台建(启动 3s 首建 + 6h 周期 + 写路径标脏)。
|
||||
// 门控 ZHIYI_RECALL_FTS 默认关 ⇒ 接线了也不改召回行为(AC4 零变化)。
|
||||
if rc, ok := ldb.(*storage.RustLanceDBClient); ok {
|
||||
storage.FtsProvider.FtsLdb = rc.ScanAll
|
||||
log.Printf("[fts] 词面通道数据源已挂(ScanAll);门控 ZHIYI_RECALL_FTS=%s(默认关)",
|
||||
os.Getenv("ZHIYI_RECALL_FTS"))
|
||||
} else {
|
||||
log.Printf("[fts] 后端非 RustLanceDBClient(%T)⇒ 词面通道数据源未挂(关态无影响)", ldb)
|
||||
}
|
||||
|
||||
// 软删除累积延迟更新缓冲(2026-09-12 优化C)
|
||||
// 软删除操作不再逐条写 LanceDB(每写一行一个版本 → _versions 膨胀),
|
||||
// 改为窗口内合并 + 单事务批量提交(每批 1 个版本)。
|
||||
@@ -72,7 +93,13 @@ func NewServer() http.Handler {
|
||||
// 冲突检测器(E4.1: Commit 时矛盾检测依赖此实例)
|
||||
// 2026-09-20:改用带持久化的构造 —— 此前 active 是纯内存 map,zhiyid 重启即丢
|
||||
// (实测 17:17 重启后 pending 冲突全部消失)。落盘失败不致命,降级为内存模式并记日志。
|
||||
conflictDetector, cdErr := governance.NewPersistentConflictDetector("/var/lib/memoryweave/conflicts.json")
|
||||
// 2026-10-18 (t_23b6a940):ZHIYI_CONFLICTS_DIR 覆盖落盘目录(副本/评估场景隔离
|
||||
// telemetry 写);未设 → 生产默认路径(行为不变)
|
||||
confDir := os.Getenv("ZHIYI_CONFLICTS_DIR")
|
||||
if confDir == "" {
|
||||
confDir = "/var/lib/memoryweave"
|
||||
}
|
||||
conflictDetector, cdErr := governance.NewPersistentConflictDetector(filepath.Join(confDir, "conflicts.json"), filepath.Join(confDir, "conflict-seen.json"))
|
||||
if cdErr != nil {
|
||||
log.Printf("[conflict] 持久化加载失败,降级为内存模式: %v", cdErr)
|
||||
}
|
||||
@@ -112,6 +139,17 @@ func NewServer() http.Handler {
|
||||
}
|
||||
}()
|
||||
|
||||
// t_cf680fad:启动即 drain durable pending-softdelete 队列。
|
||||
// 上一轮(尤其重启窗口 / 崩掉那轮)因 MVCC 写风暴耗尽而被入队的失败软删,
|
||||
// 此刻风暴已退、sidecar 刚就绪,重放必落盘 —— 这是「不修则每次重启窗口都留新残留」的根治。
|
||||
go func() {
|
||||
time.Sleep(2 * time.Second) // 等 sidecar 完全就绪(比 metrics 的 1s 稍晚,避免抢首提交)
|
||||
if n := storage.PendingSoftDeleteCount(); n > 0 {
|
||||
log.Printf("[pending-softdelete] 启动发现 %d 条待重放,开始 drain", n)
|
||||
storage.DrainPendingSoftDeletes(ldb)
|
||||
}
|
||||
}()
|
||||
|
||||
// 图谱(带 Navigate 结果缓存:TTL 5min,容量 500,热点实体缓存命中加速)
|
||||
// 已在上面初始化
|
||||
graphUpdater := governance.NewAutoGraphUpdater(graphStore)
|
||||
@@ -147,6 +185,53 @@ func NewServer() http.Handler {
|
||||
consolPipe := routes.NewConsolidationPipeline(ldb, graphStore, conflictDetector)
|
||||
consolPipe.SetDataDir("/var/lib/memoryweave/lancedb", "/var/lib/memoryweave/graph.db")
|
||||
|
||||
// ─── t_d32e5f8a L2 模式检测(MemOS 血统)─────────────────────────
|
||||
// 复活 L1→L2 pattern 蒸馏(原 Python daemon main_loop 退役后停摆):
|
||||
// pattern 节点存 graph_nodes(type='pattern'),与旧 daemon 残留的 85 行
|
||||
// type='pattern_stat' 同表但不同类,不另开新表。
|
||||
// modernc sqlite 短命单发开/关(UpsertPatterns/ListPatterns 开一次用一次即关),
|
||||
// 不持长连接、不碰 state.db —— 规避当年退役根因。
|
||||
// 召回注入 env 门控 ZHIYI_PATTERN_RECALL,默认 0 ⇒ 不注册 Provider,行为零变化。
|
||||
graphPath := os.Getenv("GRAPH_PATH")
|
||||
if graphPath == "" {
|
||||
graphPath = "/var/lib/memoryweave/graph.db"
|
||||
}
|
||||
patternStore := pattern.NewGraphPatternStore(graphPath)
|
||||
patternProvider := pattern.NewPatternProvider(patternStore, pattern.NewEmbedderProvider(emb))
|
||||
patternAPI := routes.NewPatternAPI(patternStore, patternProvider, func() storage.LanceDB { return ldb })
|
||||
// L3 skill 草稿(t_fcadee04):装配生成器 + skills 表(graph.db 同库)+ 落盘根。
|
||||
// 显式 API(draft/promote)触发,不挂 cron、不改注入行为 ⇒ 默认零行为变化。
|
||||
patternAPI.SkillStore = skillgen.NewStore(graphPath)
|
||||
patternAPI.Generator = skillgen.NewLocal2BGenerator()
|
||||
patternAPI.AttachmentsDir = os.Getenv("ZHIYI_SKILL_ATTACHMENTS")
|
||||
// t_9ccbca15(D2 反幻觉):生成草稿前取 pattern 命中记忆的真实原文注入 prompt。
|
||||
patternAPI.EvidenceProv = skillgen.NewLanceEvidenceProvider(ldb)
|
||||
// t_45677e64(返修 #1):bge-m3 向量聚类 —— 草稿按主题簇生成,不跨主题拼接。
|
||||
// emb 复用 L2 同款编码客户端(命中缓存、L2 归一化);端点异常时退化为逐条孤例 ⇒ 最大簇<3 ⇒ 不出草稿。
|
||||
patternAPI.Clusterer = skillgen.NewBGEClusterer(emb.Encode)
|
||||
// t_4594b632:promote 前评审摘要(SkillEvaluator)。本地 2B 重写理由、确定性四维分兜底;
|
||||
// 默认装配(评审信息参考,非 promote 依据)。2B 失败自动回退确定性理由,不阻塞 promote。
|
||||
patternAPI.Evaluator = skillgen.NewLLMEvaluator()
|
||||
if os.Getenv("ZHIYI_PATTERN_RECALL") == "1" {
|
||||
storage.PatternRecallProvider = patternProvider.Match
|
||||
log.Printf("[zhiyid] L2 模式召回注入已启用(ZHIYI_PATTERN_RECALL=1)")
|
||||
} else {
|
||||
log.Printf("[zhiyid] L2 模式召回注入默认关(ZHIYI_PATTERN_RECALL 未设/≠1 ⇒ 零行为变化)")
|
||||
}
|
||||
|
||||
// ─── t_f8fc97e6 P3 Peer Representation(Honcho 血统,设计 §5)────────────
|
||||
// 四层推理画像(explicit→deductive→inductive→abductive)存 graph.db 的 peers 表。
|
||||
// refresh/explain 是显式 API(不挂 cron);召回注入 env 门控 ZHIYI_PEER_RECALL 默认 0
|
||||
// ⇒ 主召回管线默认零行为变化(AC2)。推理引擎生产复用本地 2B(8081 免费腿)。
|
||||
peerStore := peer.NewStore(graphPath)
|
||||
peerAPI := routes.NewPeerAPI(peerStore, peer.NewLocal2BReasoner(), func() storage.LanceDB { return ldb }, graphStore)
|
||||
if os.Getenv("ZHIYI_PEER_RECALL") == "1" {
|
||||
storage.PeerRecallProvider = peerAPI.GetRecallResults
|
||||
log.Printf("[zhiyid] P3 Peer 推理画像召回注入已启用(ZHIYI_PEER_RECALL=1)")
|
||||
} else {
|
||||
log.Printf("[zhiyid] P3 Peer 推理画像召回注入默认关(ZHIYI_PEER_RECALL 未设/≠1 ⇒ 零行为变化)")
|
||||
}
|
||||
|
||||
// Obsidian
|
||||
obsidian := routes.NewObsidianSyncer("", ldb)
|
||||
|
||||
@@ -162,6 +247,14 @@ func NewServer() http.Handler {
|
||||
}
|
||||
distillEngine := distill.NewEngine(llmEndpoint, llmModel, llmAPIKey)
|
||||
routes.DistillEngineRef = distillEngine
|
||||
// t_e11207f8 治源①:加载共享「空壳正文」判据(zhiyi_payload_guard_rules.json,Python/Go 同源)。
|
||||
// 失败 ⇒ fail-open(distill 照跑、不拦空壳、不崩),/api/v1/payload-guard/stats 暴露 loaded=false。
|
||||
if ok, lerr := distill.LoadPayloadGuard(""); ok {
|
||||
_, _, _, rp := distill.PayloadGuardStats()
|
||||
log.Printf("[distill][payload-guard] 空壳判据已加载 rules=%s", rp)
|
||||
} else {
|
||||
log.Printf("[distill][payload-guard] ⚠️ 共享判据未加载(fail-open,不拦空壳): %v", lerr)
|
||||
}
|
||||
// 蒸馏完成 → 自动图谱更新 + 冲突检测 + 被动验证 + 回写内存
|
||||
distill.OnDistillComplete = func(input distill.DistillInput, result distill.DistillResult) {
|
||||
entityNames := make([]string, len(result.Entities))
|
||||
@@ -182,22 +275,47 @@ func NewServer() http.Handler {
|
||||
// 只要有任何一条真的 InsertMemory 成功 ⇒ 该 namespace 的 query 缓存作废
|
||||
//("先写再问" 场景:写完之后立刻可被之前问过但当时还没内容的答案命中)。
|
||||
factsLanded := false
|
||||
for _, fact := range result.Facts {
|
||||
// 2026-09-10 P0:直写路径同样脱敏(这里绕过 FilterQualityFacts,
|
||||
// 事故里泄漏进镜像的记忆正是从这条路径入库的)。
|
||||
// 2026-10-13 t_286d1310: 写库闸门同样感知准入分诊结论(lane)。
|
||||
// 此前这里独立跑 IsQualityFact 长度启发式——lane=keep 的决策类内容,
|
||||
// 其 <20 字碎片在 insert 前仍被第三次独立丢弃(t_2ae69bb2 只穿透到
|
||||
// fact 级,没穿透到写库级)⇒ DB 里 derived_from=<episode> 0 行。
|
||||
// 复用 engine.go 同一函数 FilterQualityFactsWithLane(判据单一入口,
|
||||
// 不复制):
|
||||
// LaneKeep → 只保留 纯疑问/状态汇报 两条硬否定,跳过全部长度类规则
|
||||
// LaneDrop / LaneObserve → 委托 FilterQualityFacts,与 IsQualityFact 逐字一致
|
||||
// ClassifyAdmission 是确定性分诊(同一输入永远同一 lane),此处重算即
|
||||
// engine.go:537 在蒸馏时算出的同一条 lane。
|
||||
lane, laneWhy := distill.ClassifyAdmission(input.Content)
|
||||
writeFacts := distill.FilterQualityFactsWithLane(result.Facts, lane)
|
||||
if before := len(result.Facts); before > 0 && len(writeFacts) != before {
|
||||
log.Printf("[distill][LANE] write-gate dropped %d/%d facts for %s (lane=%s, %s)",
|
||||
before-len(writeFacts), before, input.EpisodeID, lane, laneWhy)
|
||||
}
|
||||
for _, fact := range writeFacts {
|
||||
// 2026-09-10 P0:直写路径同样脱敏(FilterQualityFactsWithLane 已内部脱敏,
|
||||
// 这里再脱一次为幂等保险——防止任何中间层注入明文密钥。事故里泄漏进
|
||||
// 镜像的记忆正是从这条路径入库的)。
|
||||
fact = redact.RedactSecrets(fact)
|
||||
if !distill.IsQualityFact(fact) {
|
||||
continue // 碎片/噪声过滤
|
||||
// t_e11207f8 治源①:空壳拒写(单一判据 = 共享 zhiyi_payload_guard_rules.json,与 Python 同源)。
|
||||
// 蒸馏 LLM 偶发把「只有溯源指针/占位/纯日期、无知识载荷」的碎片当 fact(如 `证据:文件:…|日期:…`),
|
||||
// 长度/实体启发式(IsQualityFact)抓不住 ⇒ 落库前用 payload-guard 拦下(未加载时 fail-open)。
|
||||
if distill.ShellCheck(fact) {
|
||||
log.Printf("[distill][payload-guard] 拒写空壳蒸馏 fact episode=%s fact=%.40s", input.EpisodeID, fact)
|
||||
continue
|
||||
}
|
||||
// 查重: 同 namespace 已存在**语义等价**记忆 → 跳过
|
||||
// 必须用 cosine 近重复判据(≥0.98),不能只比字符串相等——
|
||||
// 否则 "牧尘在招商局工作" 与 "牧尘在招商局工作。"(多一个句号)
|
||||
// 会被判为两条不同事实双双入库,造成近重复堆积。
|
||||
var skip bool
|
||||
if qvec, eErr := emb.EncodeSingle(fact); eErr == nil {
|
||||
if sim, _ := ldb.Search("memories", qvec, 5, input.Namespace); len(sim) > 0 {
|
||||
for _, ex := range sim {
|
||||
if ex.Content == fact || cosineSimilarity(qvec, ex.Vector) >= 0.98 {
|
||||
var qvec []float32
|
||||
var sim []models.MemoryRecord
|
||||
if v, eErr := emb.EncodeSingle(fact); eErr == nil {
|
||||
qvec = v
|
||||
if found, _ := ldb.Search("memories", v, 5, input.Namespace); len(found) > 0 {
|
||||
sim = found
|
||||
for _, ex := range found {
|
||||
if ex.Content == fact || cosineSimilarity(v, ex.Vector) >= 0.98 {
|
||||
skip = true
|
||||
break
|
||||
}
|
||||
@@ -207,20 +325,92 @@ func NewServer() http.Handler {
|
||||
if skip {
|
||||
continue
|
||||
}
|
||||
// 2026-10-14 (t_3e98b65a):写时四操作判定(影子默认 ⇒ 零行为变化)。
|
||||
// 蒸馏产出的每条候选事实,对照 top-5 相似现有记忆判 ADD/UPDATE/NOOP/CONFLICT:
|
||||
// shadow:只记影子日志(本文件 write_ops.go),不真改库;apply:按判定执行。
|
||||
// 复用上面已算出的 qvec/sim(不重复编码),hash 去重兜底在 JudgeWriteOp 前。
|
||||
// t_a0831457 P0 解耦:门控**只决定标记动作**(supersede/conflict);基础
|
||||
// InsertMemory 是 pre-feature 基线行为,必须无条件执行(shadow/off 下
|
||||
// ApplyWriteOp 恒返回 shouldInsert=true ⇒ 下方不再 continue ⇒ 基础插入照跑)。
|
||||
// 唯一丢弃路径 = apply + NOOP(显式记 warning,含候选内容,禁静默)。
|
||||
// AC-1.2(t_e3f5cb79):真矛盾(CONFLICT-MARK 过判据门)时新行插入必须
|
||||
// 带 supersedes=[旧id],与旧行 superseded_by=[新id] 构成双向指针。
|
||||
var conflictSupersedes []string
|
||||
if distill.WriteOpsEnabled() {
|
||||
if dupID, dup := distill.WriteOpHashDedup(fact, sim); dup {
|
||||
log.Printf("%s", distill.DedupNote(dupID, fact))
|
||||
continue
|
||||
}
|
||||
sims := distill.FromMemoryRecords(sim, qvec)
|
||||
verdict := distill.JudgeWriteOp(fact, sims.TopN(5), nil, nil)
|
||||
if verdict != nil {
|
||||
shouldInsert, err := distill.ApplyWriteOp(*verdict, &ldbWriteOpsStore{ldb: ldb}, memIDFor(fact, input))
|
||||
if err != nil {
|
||||
// apply 标记失败(MarkSuperseded/MarkConflict 落库失败):
|
||||
// 丢弃本条(不做半截标记),显式记 warning(禁静默失败)。
|
||||
log.Printf("[write-ops] apply 标记失败,本条事实丢弃: %v candidate=%.40s", err, fact)
|
||||
continue
|
||||
}
|
||||
if !shouldInsert {
|
||||
// 唯一丢弃路径:apply + NOOP(影子/off 不会到这里,见上)
|
||||
log.Printf("[write-ops] apply NOOP 丢弃事实(判定=NOOP,候选=%.40s)", fact)
|
||||
continue
|
||||
}
|
||||
// AC-1.2(t_e3f5cb79):过门的真矛盾 → 新行带 supersedes=[旧id]
|
||||
if verdict.Op == distill.OpConflictMark && verdict.TargetID != "" {
|
||||
conflictSupersedes = []string{verdict.TargetID}
|
||||
}
|
||||
}
|
||||
// verdict==nil(off 未跑判定;理论死分支——off 不进 WriteOpsEnabled 块)
|
||||
// 或 shadow(标记零调用)⇒ 基础插入无条件执行。
|
||||
}
|
||||
// 2026-11-11 存真去伪·阶段 3:确定性版本取代(env ZHIYI_SUPERSEDE=off|shadow|apply,
|
||||
// 默认 off ⇒ 逐字零行为变化)。判据 = SameAttrValueConflict(同主体+同属性+不同取值),
|
||||
// 零 LLM。shadow 只打日志;apply 才把旧行标 superseded + superseded_by + valid_to。
|
||||
// 依据:表里 supersedes/superseded_by 两列全为 '[]'(零使用),旧值永远和新值并存。
|
||||
var supersedeHit distill.SupersedeHit
|
||||
var hasSupersede bool
|
||||
if distill.SupersedeEnabled() {
|
||||
if h, ok := distill.FindSupersedeTarget(fact, sim, qvec); ok {
|
||||
supersedeHit, hasSupersede = h, true
|
||||
}
|
||||
}
|
||||
// t_ab5b2461 信息密度判据(env ZHIYI_DISTILL_DENSITY=1 灰度,默认关):
|
||||
// 三项判据(①可执行/命令/路径 ②判据/阈值 ③因果)满足 ≥2 项才保持
|
||||
// Category="distilled";<2 项降级 Category="observe" —— 行照写、量照计
|
||||
// (AC3 写入量不饿死),可召回可逆,只是不再冒充高质量知识形态。
|
||||
// env 关 ⇒ category 恒 "distilled",与现状逐位等价(AC5)。
|
||||
category := "distilled"
|
||||
if distill.DensityGateEnabled() && !distill.DensityKeep(fact) {
|
||||
category = "observe"
|
||||
log.Printf("[distill][density] 信息量不足(需≥2项判据) → Category=observe episode=%s src=%q fact=%.48s",
|
||||
input.EpisodeID, input.Source, fact)
|
||||
}
|
||||
memID := memIDFor(fact, input)
|
||||
supersedes := conflictSupersedes
|
||||
if hasSupersede {
|
||||
supersedes = append(append([]string{}, supersedes...), supersedeHit.OldID)
|
||||
}
|
||||
mem := models.MemoryRecord{
|
||||
ID: fmt.Sprintf("mem_%d", time.Now().UnixNano()),
|
||||
ID: memID,
|
||||
AgentID: input.AgentID,
|
||||
Namespace: input.Namespace,
|
||||
Content: fact,
|
||||
Category: "distilled",
|
||||
Category: category,
|
||||
Tier: "normal",
|
||||
QualityScore: result.Overall,
|
||||
Version: 1,
|
||||
CreatedAt: time.Now(),
|
||||
UpdatedAt: time.Now(),
|
||||
DerivedFrom: input.EpisodeID,
|
||||
// 2026-10-13 (t_e9a4d18f P1) 证据链:全量来源 episode ID(蒸馏直写当前单亲,
|
||||
// 单条证据;多 episode 聚合由 consolidate 路径补充)
|
||||
SourceEvents: []string{input.EpisodeID},
|
||||
Freshness: "fresh",
|
||||
Source: srcOrLLMDistill(input.Source), // 2026-09-26:有笔记出处→"wiki:<路径>";否则沿用 llm_distill(2026-09-07 方案C provenance)
|
||||
// AC-1.2(t_e3f5cb79):真矛盾的新行带 supersedes=[旧id](双向指针的
|
||||
// 新行半边;旧行半边在 ldbWriteOpsStore.MarkConflict 写 superseded_by)。
|
||||
Supersedes: supersedes,
|
||||
Source: srcOrLLMDistill(input.Source), // 2026-09-26:有笔记出处→"wiki:<路径>";否则沿用 llm_distill(2026-09-07 方案C provenance)
|
||||
// 2026-10-08 (t_7e3577c5):血缘字段——写入方经 metadata 携带;缺省兜底
|
||||
// embedding_model→bge-m3(实际嵌入模型),script_version→unknown。
|
||||
EmbeddingModel: orDefault(input.EmbeddingModel, "bge-m3"),
|
||||
@@ -228,12 +418,96 @@ func NewServer() http.Handler {
|
||||
// 2026-10-08 (Gap#2):信任等级透传到产物(nil 保持 NULL,不伪装 0.0)
|
||||
Confidence: input.Confidence,
|
||||
ConfidenceSource: input.ConfidenceSource,
|
||||
// 2026-10-14 (t_3ada332b):bi-temporal 有效期 + provenance。写时识别时间敏感事实
|
||||
// (含「这周/临时/截止/到 X 之前」等)自动填 valid_to(区间末端);来源归一 provenance
|
||||
// (user|inferred|import)。开关默认关 ZHIYI_BITEMPORAL=0 ⇒ 读路径行为零变化。
|
||||
ValidFrom: time.Now().Format(time.RFC3339),
|
||||
ValidTo: distill.DetectValidTo(fact, time.Now()),
|
||||
Provenance: distill.DetectProvenance(input.Source),
|
||||
}
|
||||
log.Printf("[srcprobe] 蒸馏落库 episode=%s input.Source=%q → mem.Source=%q", input.EpisodeID, input.Source, mem.Source)
|
||||
if err := ldb.InsertMemory(mem); err != nil {
|
||||
log.Printf("[distill] commit fact failed: %v", err)
|
||||
} else {
|
||||
factsLanded = true // t_1c12e000:确有 distilled fact 落库
|
||||
// 阶段 3:取代动作分模式执行(shadow 只留痕,不碰库)
|
||||
if hasSupersede {
|
||||
switch distill.SupersedeMode() {
|
||||
case "apply":
|
||||
if uErr := ldb.Update("memories", supersedeHit.OldID, map[string]any{
|
||||
"freshness": "superseded",
|
||||
"superseded_by": jsonStrList([]string{memID}),
|
||||
"valid_to": time.Now().Format(time.RFC3339),
|
||||
}); uErr != nil {
|
||||
log.Printf("[supersede][apply] 标旧版失败 old=%s new=%s: %v", supersedeHit.OldID, memID, uErr)
|
||||
} else {
|
||||
log.Printf("[supersede][apply] old=%s → superseded_by=%s sim=%.3f 证据=%s",
|
||||
supersedeHit.OldID, memID, supersedeHit.Sim, supersedeHit.Evidence)
|
||||
}
|
||||
default: // shadow
|
||||
log.Printf("[supersede][shadow] 将顶掉 old=%s new=%s sim=%.3f 证据=%s ep=%s candidate=%.48s",
|
||||
supersedeHit.OldID, memID, supersedeHit.Sim, supersedeHit.Evidence,
|
||||
input.EpisodeID, fact)
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
// t_2595b626 经验层(ZHIYI_DISTILL_EXPERIENCE=1 灰度,默认关):EXP 产物落库。
|
||||
// 🔴 不改排序权重(AC5)——只多写 category="experience" 的行,召回侧零改动。
|
||||
// 反张冠李戴落库闸:task 引用的对象必须能在 episode 原文找到影子,否则不落库。
|
||||
// 关态 result.Experiences 恒 nil ⇒ 本循环零次迭代,行为与现状逐字一致。
|
||||
for _, exp := range result.Experiences {
|
||||
if !distill.ExperienceGrounded(exp, input.Content) {
|
||||
log.Printf("[distill][experience] 张冠李戴闸拦截(task 对象在原文无影子)episode=%s task=%.60s",
|
||||
input.EpisodeID, exp.Task)
|
||||
continue
|
||||
}
|
||||
// 近重复跳过(与 facts 同口径 cosine ≥0.98,复用现成 emb/ldb,不新造设施)
|
||||
expContent := fmt.Sprintf("经验[%s] 解法:%s 边界:%s", exp.Task, exp.Solution, exp.Boundary)
|
||||
expContent = redact.RedactSecrets(expContent)
|
||||
var skip bool
|
||||
if v, eErr := emb.EncodeSingle(expContent); eErr == nil {
|
||||
if found, _ := ldb.Search("memories", v, 5, input.Namespace); len(found) > 0 {
|
||||
for _, ex := range found {
|
||||
if ex.Content == expContent || cosineSimilarity(v, ex.Vector) >= 0.98 {
|
||||
skip = true
|
||||
break
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
if skip {
|
||||
log.Printf("[distill][experience] 近重复跳过 episode=%s task=%.60s", input.EpisodeID, exp.Task)
|
||||
continue
|
||||
}
|
||||
expMem := models.MemoryRecord{
|
||||
ID: fmt.Sprintf("mem_%d", time.Now().UnixNano()),
|
||||
AgentID: input.AgentID,
|
||||
Namespace: input.Namespace,
|
||||
Content: expContent,
|
||||
// 🔴 用现成 category 字段(实测可写入/可召回),不造新表/新列
|
||||
Category: "experience",
|
||||
Tier: "normal",
|
||||
// 质量口径 = 现有五维 overall(VD/RU 已在其中);🔴 不做 confidence 自评
|
||||
QualityScore: result.Overall,
|
||||
Version: 1,
|
||||
CreatedAt: time.Now(),
|
||||
UpdatedAt: time.Now(),
|
||||
DerivedFrom: input.EpisodeID,
|
||||
SourceEvents: []string{input.EpisodeID},
|
||||
Freshness: "fresh",
|
||||
Source: srcOrLLMDistill(input.Source),
|
||||
EmbeddingModel: orDefault(input.EmbeddingModel, "bge-m3"),
|
||||
ScriptVersion: orDefault(input.ScriptVersion, "unknown"),
|
||||
ValidFrom: time.Now().Format(time.RFC3339),
|
||||
Provenance: distill.DetectProvenance(input.Source),
|
||||
}
|
||||
if err := ldb.InsertMemory(expMem); err != nil {
|
||||
log.Printf("[distill][experience] 落库失败 episode=%s: %v", input.EpisodeID, err)
|
||||
} else {
|
||||
factsLanded = true
|
||||
log.Printf("[distill][experience] 落库 episode=%s task=%.60s boundary=%.40s",
|
||||
input.EpisodeID, exp.Task, exp.Boundary)
|
||||
}
|
||||
}
|
||||
// t_1c12e000:写路径缓存失效(方案 A)——distilled facts 是 memories 唯一写点。
|
||||
@@ -243,6 +517,9 @@ func NewServer() http.Handler {
|
||||
storage.SearchCacheInstance.Invalidate(input.Namespace)
|
||||
log.Printf("[cache] 蒸馏落库后失效 namespace=%s(%d 条 facts,episode=%s)",
|
||||
input.Namespace, len(result.Facts), input.EpisodeID)
|
||||
// 2026-10-14 (t_2afae95e):FTS 词面索引同步标脏(惰性重建,
|
||||
// 下次词面查询时后台刷;关态下只是置一个 bool,零成本)
|
||||
storage.FtsInvalidate()
|
||||
}
|
||||
// 冲突检测:加载已有记忆进行比较
|
||||
// 必须用**新内容的真实向量**做语义检索取近邻;用零向量在语义索引上
|
||||
@@ -314,6 +591,12 @@ func NewServer() http.Handler {
|
||||
|
||||
// 注入 V 值查询函数到存储层(召回排序融合)
|
||||
storage.VValueProvider = func(memoryID string) float64 {
|
||||
// 2026-10-13:ep_* 是蒸馏自证(恒 1.0),零区分度且淹没真实 mem_* 信号
|
||||
// (实测 ep_* 4304 个 vs mem_* 24 个)。召回目标全是 mem_*,ep_* 的 V 值
|
||||
// 不参与排序即可,无需删 Redis 数据(保留可回溯)。
|
||||
if strings.HasPrefix(memoryID, "ep_") {
|
||||
return 0
|
||||
}
|
||||
return vPropagator.GetMemVValue(memoryID)
|
||||
}
|
||||
// 在蒸馏完成回调中记录 V 值
|
||||
@@ -331,8 +614,8 @@ func NewServer() http.Handler {
|
||||
"distill", "success", "",
|
||||
)
|
||||
}
|
||||
// 更新仪表盘指标
|
||||
selfoptimize.Dash.RecordUseful()
|
||||
// 更新仪表盘指标:蒸馏成功次数(2026-10-14 t_c06ad4d0 改,勿再灌 UsefulCount)
|
||||
selfoptimize.Dash.RecordDistillSuccess()
|
||||
// 记录蒸馏质量损失(avg_distill_loss = 1 - Overall)
|
||||
// 仅记录真实蒸馏:Overall > 0 表示 LLM 成功返回,过滤 fallback (Overall=0)
|
||||
if result.Overall > 0 {
|
||||
@@ -360,6 +643,18 @@ func NewServer() http.Handler {
|
||||
|
||||
mux.HandleFunc("/health", routes.HandleHealth)
|
||||
mux.HandleFunc("/api/v1/health", routes.HandleHealth)
|
||||
// t_e11207f8 治源①:空壳拦截器「确实跑过」的取证端点。
|
||||
// checks=每个蒸馏 fact 判一次的心跳计数(>0 即拦截器活着);blocks=实际拒写空壳条数;
|
||||
// loaded=false 表示共享判据没加载上(fail-open,需排查 ZHIYI_PAYLOAD_GUARD_RULES 路径)。
|
||||
mux.HandleFunc("/api/v1/payload-guard/stats", func(w http.ResponseWriter, r *http.Request) {
|
||||
checks, blocks, loaded, rp := distill.PayloadGuardStats()
|
||||
respondJSON(w, 200, map[string]interface{}{
|
||||
"checks": checks,
|
||||
"blocks": blocks,
|
||||
"loaded": loaded,
|
||||
"rules_path": rp,
|
||||
})
|
||||
})
|
||||
// 图谱缓存统计 + 搜索缓存统计(t_1c12e000:并入 search_cache 段,
|
||||
// 暴露 hits/misses/invalidated/size/ttl,写频对命中率的影响可观测)
|
||||
mux.HandleFunc("/api/v1/cache/stats", func(w http.ResponseWriter, r *http.Request) {
|
||||
@@ -372,8 +667,32 @@ func NewServer() http.Handler {
|
||||
if storage.SearchCacheInstance != nil {
|
||||
resp["search_cache"] = storage.SearchCacheInstance.Stats()
|
||||
}
|
||||
// 2026-10-14 (t_2afae95e):FTS 词面索引状态(docs/tokens/built_at/dirty/门控)
|
||||
resp["fts_index"] = storage.FtsIndexStats()
|
||||
respondJSON(w, 200, resp)
|
||||
})
|
||||
// 2026-10-14 (t_2afae95e):FTS 手工刷索引(admin;异步重建不阻塞)
|
||||
mux.HandleFunc("/api/v1/fts/rebuild", func(w http.ResponseWriter, r *http.Request) {
|
||||
storage.FtsRebuildNow()
|
||||
respondJSON(w, 200, map[string]interface{}{"status": "rebuild_started"})
|
||||
})
|
||||
// 2026-10-14 (t_2afae95e):FTS 词面查询取证端点(AC1 判据命令):
|
||||
// 返回该 query 的词面 topN 命中(id + 分 + 内容摘录),不走路过 recall 缓存。
|
||||
mux.HandleFunc("/api/v1/fts/query", func(w http.ResponseWriter, r *http.Request) {
|
||||
var req struct {
|
||||
Query string `json:"query"`
|
||||
TopN int `json:"top_n"`
|
||||
CheckDocID string `json:"check_doc_id"`
|
||||
}
|
||||
if err := json.NewDecoder(r.Body).Decode(&req); err != nil {
|
||||
http.Error(w, "invalid body", http.StatusBadRequest)
|
||||
return
|
||||
}
|
||||
if req.TopN <= 0 {
|
||||
req.TopN = 10
|
||||
}
|
||||
respondJSON(w, 200, storage.FtsQuery(req.Query, req.TopN, req.CheckDocID))
|
||||
})
|
||||
// ─── Prometheus /metrics ─────────────────────
|
||||
mux.Handle("/metrics", metrics.Handler())
|
||||
|
||||
@@ -397,33 +716,47 @@ func NewServer() http.Handler {
|
||||
governance.PushCacheInvalidate(req.Namespace, "commit")
|
||||
governance.PushMemoryCommitted(req.AgentID, req.Namespace, "")
|
||||
}
|
||||
// t_f8fc97e6 P3 Peer:新记忆进入 → 异步刷新内容里出现的实体画像。
|
||||
// 默认关(ZHIYI_PEER_RECALL 未设/≠1)⇒ 本分支整体跳过,commit 路径零变化(AC4)。
|
||||
// 开启时在已有 goroutine 内再起子 goroutine,LLM 推理绝不阻塞 HTTP commit 返回。
|
||||
if os.Getenv("ZHIYI_PEER_RECALL") == "1" && peerAPI != nil {
|
||||
peerAPI.RefreshFromContent(req.Content, req.Namespace)
|
||||
}
|
||||
}()
|
||||
})
|
||||
mux.HandleFunc("/api/v1/recall", api.Recall)
|
||||
mux.HandleFunc("/api/v1/recall/debug", api.RecallDebug)
|
||||
// 2026-10-26 (P0-1 t_trace_p0):召回链路追踪回溯(trace_id 贯穿各阶段/各通道)
|
||||
mux.HandleFunc("/api/v1/trace/", api.Trace)
|
||||
// t_23b6a940 AC7 热门度看门狗快照(report-only,传感器端读它转既有告警通道)
|
||||
mux.HandleFunc("/api/v1/popwatch", api.PopWatch)
|
||||
// 2026-10-13 (t_e9a4d18f P2) 常设答案直读/写入
|
||||
mux.HandleFunc("/api/v1/standing-answers", routes.HandleStandingAnswers)
|
||||
// ⑤使用追踪(t_5aa4dcac):上报 + 手动触发。env 门控 ZHIYI_USAGE_TRACK,默认关。
|
||||
mux.HandleFunc("/api/v1/usage/report", api.UsageReport)
|
||||
mux.HandleFunc("/api/v1/usage/detect", api.UsageDetect)
|
||||
// GA-P0-7 (t_dd64345a):裸 /api/v1/feedback 已退役——其 handler 曾写旧字段 not_useful_count。
|
||||
// 反馈统一走 /api/v1/feedback/{useful,not-useful,deprecate,correct}(feedback.go,写拆分后新字段)。
|
||||
mux.HandleFunc("/api/v1/bootstrap", api.Bootstrap)
|
||||
mux.HandleFunc("/api/v1/stats", api.Stats)
|
||||
// 2026-10-26(牧尘批「三档」):自检统一取数端点。
|
||||
// 唯一契约 —— 自检脚本一律读这里,禁止再 lancedb.connect() 直连生产库。
|
||||
// ?level=cheap(默认,内存态计数)| full(+读 tools/selfcheck_full.py 的全量快照:碎片/冗余/近7天质量/写量)
|
||||
mux.HandleFunc("/api/v1/selfcheck", api.Selfcheck)
|
||||
mux.HandleFunc("/api/v1/batch-commit", api.BatchCommit)
|
||||
// 主症A(t_fa6c9104):显式写入直落 memories 表(嵌入 + 立刻可召回)。
|
||||
// 纯新增路由:commit/recall/蒸馏路径零改动;旧服务端 404 时插件自动回落 commit。
|
||||
mux.HandleFunc("/api/v1/memory/write", api.WriteMemory)
|
||||
// 自优化指标(Dashboard,含 avg_distill_loss)
|
||||
// total_episodes:Rust count_rows 真实值;旧 sidecar 回退 episodes_cached(进程内缓存,非总量)
|
||||
mux.HandleFunc("/api/v1/metrics", func(w http.ResponseWriter, r *http.Request) {
|
||||
m := selfoptimize.Dash.Metrics()
|
||||
if stats, err := ldb.Stats(); err == nil {
|
||||
if total, ok := stats["total_memories"].(float64); ok {
|
||||
m["total_memories"] = total
|
||||
}
|
||||
if total, ok := stats["total_episodes"].(float64); ok {
|
||||
m["total_episodes"] = total
|
||||
} else if cached, ok := stats["episodes_cached"].(float64); ok {
|
||||
// 旧 sidecar 回退:缓存值非真实总量,gauge 仍设值;
|
||||
// 来源标记写入响应 JSON(/api/v1/metrics 的 m 类型是 map[string]float64,
|
||||
// 无法直接加字符串字段,改为用 episodes_source=1.0 作为标记位)
|
||||
m["total_episodes"] = cached
|
||||
m["episodes_source_cached"] = 1 // 标记:此值来自进程内缓存(非 Rust count_rows)
|
||||
}
|
||||
var stats map[string]interface{}
|
||||
if s, err := ldb.Stats(); err == nil {
|
||||
stats = s
|
||||
}
|
||||
// t_a513b870 AC2:蒸馏闸门拒绝真计数 + total_* 合并统一走 MetricsJSON(单测可借
|
||||
// httptest 起真实端点读回 JSON 验证 rejected_by_rule)。
|
||||
m := routes.MetricsJSON(selfoptimize.Dash.Metrics(), stats)
|
||||
respondJSON(w, 200, m)
|
||||
})
|
||||
// ─── WebSocket 实时推送 ──────────────────────
|
||||
@@ -972,27 +1305,12 @@ func NewServer() http.Handler {
|
||||
mux.HandleFunc("/api/v1/conflicts/resolve", conflictAPI.Resolve)
|
||||
|
||||
// 反馈 — G5: 修正记忆时填充 version_history
|
||||
// 2026-10-14 (t_c06ad4d0):删除冗余重复块。MarkUseful 已做 RecordFeedback(true)+
|
||||
// RecordDecision+QualityMonitor.Check+IncrementUseful+AppendHitEvent;原 handler 里
|
||||
// 这段二次读 r.Body 的 RecordUseful/RecordDecision/QualityMonitor 全部重复,且
|
||||
// r.Body 已被 MarkUseful 消费(io.ReadAll 恒空)⇒ 死代码 + 潜在二次计数污染。
|
||||
mux.HandleFunc("/api/v1/feedback/useful", func(w http.ResponseWriter, r *http.Request) {
|
||||
feedbackAPI.MarkUseful(w, r)
|
||||
// 质量监控:useful → 质量上升
|
||||
var req struct {
|
||||
MemoryID string `json:"memory_id"`
|
||||
}
|
||||
if r.Body != nil {
|
||||
body, _ := io.ReadAll(r.Body)
|
||||
json.Unmarshal(body, &req)
|
||||
r.Body = io.NopCloser(bytes.NewReader(body))
|
||||
if req.MemoryID != "" {
|
||||
selfoptimize.Dash.RecordUseful()
|
||||
// V 值:useful = success
|
||||
selfoptimize.VProp.RecordDecision(
|
||||
"useful_"+req.MemoryID,
|
||||
[]string{req.MemoryID},
|
||||
"user_feedback", "success", "",
|
||||
)
|
||||
selfoptimize.QualityMonitor.Check(req.MemoryID, 0, 5) // 清除潜在告警
|
||||
}
|
||||
}
|
||||
})
|
||||
mux.HandleFunc("/api/v1/feedback/not-useful", func(w http.ResponseWriter, r *http.Request) {
|
||||
feedbackAPI.MarkNotUseful(w, r)
|
||||
@@ -1042,6 +1360,16 @@ func NewServer() http.Handler {
|
||||
// 缺口
|
||||
mux.HandleFunc("/api/v1/gaps", gapAPI.List)
|
||||
mux.HandleFunc("/api/v1/gaps/detect", gapAPI.Detect)
|
||||
// t_d32e5f8a L2 模式检测(MemOS 血统)
|
||||
mux.HandleFunc("/api/v1/patterns", patternAPI.List)
|
||||
mux.HandleFunc("/api/v1/patterns/detect", patternAPI.Detect)
|
||||
// t_fcadee04 L3 skill 草稿(/patterns/{id}/draft 与 /patterns/{id}/promote)。
|
||||
// 前缀路由;/patterns 与 /patterns/detect 因更长的精确路由优先,不受影响。
|
||||
mux.HandleFunc("/api/v1/patterns/", patternAPI.Sub)
|
||||
// t_f8fc97e6 P3 Peer Representation:显式 refresh/explain + 门控 recall。
|
||||
// 前缀路由 /api/v1/peer/;/api/v1/recall/peer 独立精确路由优先。
|
||||
mux.HandleFunc("/api/v1/recall/peer", peerAPI.RecallPeer)
|
||||
mux.HandleFunc("/api/v1/peer/", peerAPI.Sub)
|
||||
mux.HandleFunc("/api/v1/gaps/close/", func(w http.ResponseWriter, r *http.Request) {
|
||||
gapAPI.Close(w, r)
|
||||
topic := r.URL.Path[len("/api/v1/gaps/close/"):]
|
||||
@@ -1327,7 +1655,18 @@ func NewServer() http.Handler {
|
||||
mux.HandleFunc("/api/v1/memories", adminAPI.ListMemories)
|
||||
mux.HandleFunc("/api/v1/memories/export", adminAPI.ExportMemoriesMD)
|
||||
// /api/v1/memory/{id}/versions — existing version history endpoint
|
||||
// t_0f1d7be9:PathValue("id") 只在模式路由下生效,前缀路由手动解析(旧写法恒取到
|
||||
// 空 id 是历史遗留,Versions 因此从未按 id 过滤过 —— 本行保持行为不变,仅注释留痕)。
|
||||
mux.HandleFunc("/api/v1/memory/", func(w http.ResponseWriter, r *http.Request) {
|
||||
// t_0f1d7be9(原文层):/{id}/raw 下钻分派(GET only,其余仍走 Versions)
|
||||
if r.Method == http.MethodGet && strings.HasSuffix(r.URL.Path, "/raw") {
|
||||
id := strings.TrimSuffix(strings.TrimPrefix(r.URL.Path, "/api/v1/memory/"), "/raw")
|
||||
if id != "" && !strings.Contains(id, "/") {
|
||||
r.SetPathValue("id", id)
|
||||
api.MemoryRaw(w, r)
|
||||
return
|
||||
}
|
||||
}
|
||||
if r.Method == "GET" {
|
||||
adminAPI.Versions(w, r)
|
||||
} else {
|
||||
@@ -1632,6 +1971,11 @@ func NewServer() http.Handler {
|
||||
ticker := time.NewTicker(30 * time.Second)
|
||||
defer ticker.Stop()
|
||||
for range ticker.C {
|
||||
// t_cf680fad:每个 tick 先 drain durable pending-softdelete 队列(风暴退去后的
|
||||
// 相对静默窗口重放,必落盘)。队列空 = 廉价 no-op,不打日志;仅在有待处理时出声。
|
||||
if n := storage.PendingSoftDeleteCount(); n > 0 {
|
||||
storage.DrainPendingSoftDeletes(ldb)
|
||||
}
|
||||
for _, t := range []struct{ id, action string }{
|
||||
{"t_distill", "distill"},
|
||||
{"t_merge", "merge"},
|
||||
@@ -1672,7 +2016,13 @@ func NewServer() http.Handler {
|
||||
memories, e := ldb.GetCandidatesForForgetting()
|
||||
decayScanned := 0
|
||||
decayForgotten := 0
|
||||
decayProtected := 0
|
||||
if e == nil {
|
||||
// 2026-10-16 (t_944344b5) 遗忘保护守卫:本 tick 加载一次保护状态
|
||||
// (Redis zhiyi:vprop_values + zhiyi:protected_ids),命中任一保护规则的
|
||||
// 候选永不自动软删(fragment 与 ShouldForget 两条道都拦截)。
|
||||
// Redis 宕机 → 降级为纯行内规则(category/freshness/关键词),不阻断衰减。
|
||||
protState := memprotect.LoadState()
|
||||
const maxDecayBatch = 2000
|
||||
if len(memories) > maxDecayBatch {
|
||||
sort.SliceStable(memories, func(a, b int) bool {
|
||||
@@ -1696,6 +2046,16 @@ func NewServer() http.Handler {
|
||||
continue
|
||||
}
|
||||
}
|
||||
// 🔒 2026-10-16 (t_944344b5) 遗忘保护守卫: 命中任一保护规则的候选
|
||||
// (category∈{decision,preference,pref} / V≥2.0 / freshness=verified /
|
||||
// protected_ids 名单 / distilled 且内容命中 10 个决策·偏好关键词) 永不自动软删。
|
||||
// 拦截 point 放在 fragment + ShouldForget 两条 SoftDelete 道之前。
|
||||
if isProt, protRule := memprotect.IsProtected(m, protState); isProt {
|
||||
gid, _ := m["id"].(string)
|
||||
decayProtected++
|
||||
log.Printf("[decay] protected skip id=%q rule=%s (遗忘保护守卫命中, 跳过自动遗忘)", gid, protRule)
|
||||
continue
|
||||
}
|
||||
// 解析 last_recalled_at
|
||||
lastAccessed := time.Now().Add(-30 * 24 * time.Hour) // 默认30天前
|
||||
if t, ok := m["last_recalled_at"].(string); ok && t != "" {
|
||||
@@ -1756,7 +2116,8 @@ func NewServer() http.Handler {
|
||||
}
|
||||
// AC-1 验收日志(P1 修复 type 断言后 last_recalled_at 可解析;batch<=2000)
|
||||
if decayScanned > 0 {
|
||||
log.Printf("[decay] scanned=%d forgotten=%d (batch<=2000, 最久未访问优先)", decayScanned, decayForgotten)
|
||||
// 2026-10-16 (t_944344b5):protected_skip = 被遗忘保护守卫拦截、未软删的候选数
|
||||
log.Printf("[decay] scanned=%d forgotten=%d protected_skip=%d (batch<=2000, 最久未访问优先)", decayScanned, decayForgotten, decayProtected)
|
||||
}
|
||||
case "gap_scan":
|
||||
// 检查已有缺口:过期 7 天的自动关闭
|
||||
@@ -1770,7 +2131,12 @@ func NewServer() http.Handler {
|
||||
for _, g := range gaps {
|
||||
if !g.Closed && routes.GapRepair != nil {
|
||||
if routes.GapRepair.AutoRepair(g) {
|
||||
selfoptimize.Dash.RecordGapClosed()
|
||||
// t_e5997ca4:AutoRepair 只做「修复」不关缺口。旧代码在此
|
||||
// 无条件 Dash.RecordGapClosed() 却不置 g.Closed ⇒ 同一缺口每轮
|
||||
// gap_scan 都再 +1(ClosedGaps 无限虚增,线上 9 vs 2 的写侧根因 #2)。
|
||||
// 现按 RepairHandler 语义:修复成功 = 关闭该缺口;+1 只发生在
|
||||
// Close 的 open→closed 迁移点(内部),下一轮 !g.Closed 即跳过。
|
||||
gapDetector.Close(g.Topic)
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -1997,3 +2363,45 @@ func confidenceSourceOf(c *float64) string {
|
||||
}
|
||||
return ""
|
||||
}
|
||||
|
||||
// ldbWriteOpsStore 适配 storage.LanceDB 到 distill.WriteOpsStore 接口。
|
||||
// 供写时四操作的 apply 模式标记 superseded/conflict(t_3e98b65a)。
|
||||
type ldbWriteOpsStore struct {
|
||||
ldb storage.LanceDB
|
||||
}
|
||||
|
||||
// MarkSuperseded 旧记忆标记「被 newID 取代」(写 superseded_by + is_deleted=true;
|
||||
// 历史经 supersedes/superseded_by 保留可追溯,不物理删)。
|
||||
func (s *ldbWriteOpsStore) MarkSuperseded(oldID, newID string) error {
|
||||
b, _ := json.Marshal([]string{newID})
|
||||
return s.ldb.Update("memories", oldID, map[string]any{
|
||||
"superseded_by": string(b),
|
||||
"is_deleted": true,
|
||||
})
|
||||
}
|
||||
|
||||
// MarkConflict 旧记忆标记冲突(t_e3f5cb79 · AC-1.2)。判定门(SameAttrValueConflict,
|
||||
// 「同主体+同属性+不同取值」)在 distill.JudgeWriteOp 出口把守,走到这里的都是确认
|
||||
// 矛盾 ⇒ 打标必须同写双向指针:旧行 superseded_by=[newID] + freshness=superseded
|
||||
// (新值生效、旧值被取代的既有字段语义;新行 supersedes=[oldID] 由写路径在插入
|
||||
// 记录上带)。不置 is_deleted —— 旧行仍可召回,排序侧降权属方案 A3,不在本卡。
|
||||
func (s *ldbWriteOpsStore) MarkConflict(oldID, newID string) error {
|
||||
b, _ := json.Marshal([]string{newID})
|
||||
return s.ldb.Update("memories", oldID, map[string]any{
|
||||
"freshness": "superseded",
|
||||
"superseded_by": string(b),
|
||||
})
|
||||
}
|
||||
|
||||
// jsonStrList 序列化 []string(LanceDB 里 supersedes/superseded_by 的存储形态是
|
||||
// JSON 数组字符串,如 `["mem_123"]`)。2026-11-11 阶段 3 新增。
|
||||
func jsonStrList(v []string) string {
|
||||
b, _ := json.Marshal(v)
|
||||
return string(b)
|
||||
}
|
||||
|
||||
// memIDFor 为写时四操作 apply 预生成新记忆 ID(与下方 InsertMemory 同格式)。
|
||||
func memIDFor(fact string, input distill.DistillInput) string {
|
||||
_ = fact
|
||||
return fmt.Sprintf("mem_%d", time.Now().UnixNano())
|
||||
}
|
||||
|
||||
@@ -0,0 +1,87 @@
|
||||
//go:build abrun
|
||||
|
||||
// t_2595b626 A/B 跑批(非默认构建;仅 `-tags abrun go test -run TestABRun` 显式跑)。
|
||||
// 读 ab-samples.json → callLLM5D(生产同款 prompt 构造)→ 原始输出+解析结果落 ab-raw.jsonl。
|
||||
// 门控由 env ZHIYI_DISTILL_EXPERIENCE 决定(进程启动读一次 ⇒ A/B 两臂 = 跑两次进程)。
|
||||
package distill
|
||||
|
||||
import (
|
||||
"bufio"
|
||||
"encoding/json"
|
||||
"fmt"
|
||||
"os"
|
||||
"sync"
|
||||
"sync/atomic"
|
||||
"testing"
|
||||
"time"
|
||||
)
|
||||
|
||||
type abSample struct {
|
||||
ID string `json:"id"`
|
||||
Content string `json:"content"`
|
||||
Src string `json:"src"`
|
||||
}
|
||||
|
||||
func TestABRun(t *testing.T) {
|
||||
if os.Getenv("AB_GATE") == "" {
|
||||
t.Skip("设 AB_GATE=on|off 才跑")
|
||||
}
|
||||
gate := os.Getenv("AB_GATE") == "on"
|
||||
if gate != ExperienceGateEnabled() {
|
||||
t.Fatalf("进程 env ZHIYI_DISTILL_EXPERIENCE=%v 与 AB_GATE=%v 不一致(门控启动读一次)", ExperienceGateEnabled(), gate)
|
||||
}
|
||||
// 缓存必须关:两臂同内容,A 臂结果若被缓存喂给 B 臂 = 假对照
|
||||
scoreCacheDisabled = true
|
||||
|
||||
f, err := os.Open(os.Getenv("AB_SAMPLES"))
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
var samples []abSample
|
||||
json.NewDecoder(bufio.NewReader(f)).Decode(&samples)
|
||||
f.Close()
|
||||
if len(samples) < 20 {
|
||||
t.Fatalf("样本不足 20: %d", len(samples))
|
||||
}
|
||||
|
||||
e := NewEngine("http://127.0.0.1:8081/v1/chat/completions", "local/minicpm5-2b", "sk-local")
|
||||
outPath := os.Getenv("AB_OUT")
|
||||
out, _ := os.Create(outPath)
|
||||
defer out.Close()
|
||||
enc := json.NewEncoder(out)
|
||||
|
||||
var idx int64
|
||||
var wg sync.WaitGroup
|
||||
sem := make(chan struct{}, 2) // 与 2B 双槽匹配,不打爆
|
||||
start := time.Now()
|
||||
for _, s := range samples {
|
||||
wg.Add(1)
|
||||
sem <- struct{}{}
|
||||
go func(s abSample) {
|
||||
defer wg.Done()
|
||||
defer func() { <-sem }()
|
||||
t0 := time.Now()
|
||||
resp, err := e.callLLM5D(s.Content) // 缓存已关,直连 uncached
|
||||
rec := map[string]any{
|
||||
"id": s.ID, "src": s.Src, "gate": gate,
|
||||
"ms": time.Since(t0).Milliseconds(),
|
||||
}
|
||||
if err != nil {
|
||||
rec["err"] = err.Error()
|
||||
} else {
|
||||
rec["facts"] = resp.Facts
|
||||
rec["experiences"] = resp.Experiences
|
||||
rec["scores"] = map[string]float64{"is": resp.IS, "su": resp.SU, "pa": resp.PA, "vd": resp.VD, "ru": resp.RU}
|
||||
}
|
||||
i := atomic.AddInt64(&idx, 1)
|
||||
fmt.Printf("[%d/%d] %s %dms err=%v\n", i, len(samples), s.ID, rec["ms"], rec["err"])
|
||||
outMu.Lock()
|
||||
enc.Encode(rec)
|
||||
outMu.Unlock()
|
||||
}(s)
|
||||
}
|
||||
wg.Wait()
|
||||
fmt.Printf("AB_RUN gate=%v n=%d total=%s -> %s\n", gate, len(samples), time.Since(start).Round(time.Second), outPath)
|
||||
}
|
||||
|
||||
var outMu sync.Mutex
|
||||
@@ -54,6 +54,16 @@ var identityPreferencePatterns = []string{
|
||||
// ClassifyAdmission 对一条待蒸馏内容做确定性三路分诊。
|
||||
// 返回 lane 与人类可读的 reason(进日志,用于事后审计分诊是否合理)。
|
||||
// 本函数**零 LLM 调用**、纯确定性 —— 同一输入永远同一结果,可单测。
|
||||
//
|
||||
// 🔴 调用链可达性(t_a513b870 AC4 定性,2026-11-10 实测):
|
||||
// Enqueue(engine.go:422) 与 auto_distill.go:41 都**先跑 HardRulesPassWithReason**
|
||||
// 硬规则层(空/过短/闲聊/知识问答/密度/超长/系统样板 全在硬规则层拦截并 return),
|
||||
// ⇒ 能走到本函数的内容**已不可能命中下面 drop 分支**:
|
||||
// 空内容 / 系统样板(已移入硬规则层)/ 过短 <8 字(硬规则 <10 更严,先拦)。
|
||||
// 因此 lane=drop 在当前调用链**恒不可达**,7 天实测 lane=drop=0 属预期,非健康信号。
|
||||
// 保留 drop 分支仅作**防御**(若未来某条路径绕过硬规则直接调本函数,仍不致误放垃圾);
|
||||
// 闸门实际只走 keep/observe 两路。文献依据:不确定带永不丢弃(When to Forget 原文
|
||||
// "should not deprecate an uncertain memory"),drop 本就只在硬规则层发生。
|
||||
func ClassifyAdmission(content string) (AdmissionLane, string) {
|
||||
s := strings.TrimSpace(content)
|
||||
if s == "" {
|
||||
|
||||
@@ -0,0 +1,248 @@
|
||||
// 织忆 MemoryWeave — 对抗审计插槽(②蒸馏环)
|
||||
//
|
||||
// 背景(2026-10-13,血统 HW_MyJarvis):织忆当前所有质量判断都是单模型自证
|
||||
// (本地 2B 自己打分自己提取),实测已抓到四起同类病:蒸馏评分恒 0.755、
|
||||
// ep_* 的 V 值恒 1.0(4304 条自证污染)、metrics 三完美值、avg_distill_loss
|
||||
// 无人复核。共同病根:一个模型自己说自己好,没有异源复核。
|
||||
//
|
||||
// 本插槽解法:蒸馏产出的事实,按抽样比例送【异源模型】(非本地 2B)做对抗审计,
|
||||
// 找矛盾 / 幻觉 / 无据。审计结论只写【影子日志】,不改任何丢弃/准入行为
|
||||
// (与 ZHIYI_SCORE_SHADOW 同一纪律:先观察,不真拦)。
|
||||
//
|
||||
// ── 门控(默认关 ⇒ 零行为变化,硬要求)──────────────────────────
|
||||
//
|
||||
// ZHIYI_ADVERSARIAL_AUDIT=1 开启(默认关)
|
||||
// ZHIYI_ADVERSARIAL_AUDIT_RATIO 抽样比例(默认 0.05 = 5%)
|
||||
// ZHIYI_ADVERSARIAL_AUDIT_ENDPOINT 审计端点(默认 http://127.0.0.1:3000/v1/chat/completions,
|
||||
// NewAPI 免费通道,异源——非本地 2B 的 8081)
|
||||
// ZHIYI_ADVERSARIAL_AUDIT_MODEL 审计模型(默认 deepseek-v4-flash,免费腿)
|
||||
// ZHIYI_ADVERSARIAL_AUDIT_KEY 审计 key(默认回退 LLM_API_KEY)
|
||||
// ZHIYI_ADVERSARIAL_AUDIT_LOG 影子日志路径(默认 /var/lib/memoryweave/adversarial-audit.log)
|
||||
// ZHIYI_ADVERSARIAL_AUDIT_TIMEOUT 单次审计超时秒(默认 60)
|
||||
//
|
||||
// 关闭路径:unset ZHIYI_ADVERSARIAL_AUDIT(或置 0)→ 完全恢复,不产生任何调用、
|
||||
// 不写任何日志、不占任何资源。
|
||||
//
|
||||
// ── 设计约束 ────────────────────────────────────────────────
|
||||
// · 异源:审计模型走 NewAPI 免费通道(127.0.0.1:3000),默认 deepseek-v4-flash,
|
||||
// 与蒸馏主链的本地 2B(local/minicpm5-2b via 8081)不同源不同模型。
|
||||
// · 零新依赖:只用 stdlib net/http / encoding/json / os。
|
||||
// · 不碰 state.db:审计只写独立影子日志文件,不改存储、不新增常驻进程
|
||||
// (审计 goroutine 在 zhiyid 进程内,随调用起落,非守护)。
|
||||
// · 控并发:包级信号量 advAuditSem(默认 1),异步执行,绝不阻塞/打爆蒸馏主链。
|
||||
package distill
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"fmt"
|
||||
"log"
|
||||
"math/rand"
|
||||
"net/http"
|
||||
"os"
|
||||
"strings"
|
||||
"sync"
|
||||
"time"
|
||||
)
|
||||
|
||||
// advAuditSem 控制对抗审计并发(默认 1:串行,最保守,不抢本地 2B 也不突刺 NewAPI)。
|
||||
var advAuditSem = make(chan struct{}, 1)
|
||||
|
||||
// advAuditMu 保护影子日志文件的串行追加。
|
||||
var advAuditMu sync.Mutex
|
||||
|
||||
// envStr 读字符串环境变量,缺省/空则用 def。
|
||||
func envStr(key, def string) string {
|
||||
if v := os.Getenv(key); v != "" {
|
||||
return v
|
||||
}
|
||||
return def
|
||||
}
|
||||
|
||||
// adversarialAuditEnabled 是否开启对抗审计(运行时读 env,unset/0/其它 → 关)。
|
||||
func adversarialAuditEnabled() bool {
|
||||
v := os.Getenv("ZHIYI_ADVERSARIAL_AUDIT")
|
||||
return v == "1" || strings.EqualFold(v, "true")
|
||||
}
|
||||
|
||||
// MaybeAdversarialAudit 对抗审计入口(②环插槽)。影子模式:只写日志,不改行为。
|
||||
// 门控关 → 立即返回(零行为变化);开 → 按抽样比例决定是否异步审计。
|
||||
// 抽样为随机比例:命中才发一次异源审计;未命中/无事实/比例≤0 → 直接返回。
|
||||
func MaybeAdversarialAudit(input DistillInput, facts []string) {
|
||||
if !adversarialAuditEnabled() {
|
||||
return
|
||||
}
|
||||
if len(facts) == 0 {
|
||||
return
|
||||
}
|
||||
ratio := envFloat("ZHIYI_ADVERSARIAL_AUDIT_RATIO", 0.05)
|
||||
if ratio <= 0 {
|
||||
return
|
||||
}
|
||||
if rand.Float64() >= ratio {
|
||||
return
|
||||
}
|
||||
// 异步执行 + 信号量控并发:取不到槽位则放弃本次(影子审计,不排队不阻塞)。
|
||||
select {
|
||||
case advAuditSem <- struct{}{}:
|
||||
default:
|
||||
log.Printf("[adv-audit] 并发槽已满,放弃本次抽样(episode=%s)", input.EpisodeID)
|
||||
return
|
||||
}
|
||||
go func() {
|
||||
defer func() { <-advAuditSem }()
|
||||
if err := auditOne(input, facts); err != nil {
|
||||
log.Printf("[adv-audit] 审计失败 episode=%s: %v", input.EpisodeID, err)
|
||||
}
|
||||
}()
|
||||
}
|
||||
|
||||
// AuditVerdict 单条事实的对抗审计结论。
|
||||
type AuditVerdict struct {
|
||||
Fact string `json:"fact"`
|
||||
Verdict string `json:"verdict"` // supported | contradiction | hallucination | no_evidence
|
||||
Reason string `json:"reason"`
|
||||
}
|
||||
|
||||
// auditOne 执行一次对抗审计:送异源模型 → 解析结论 → 写影子日志。
|
||||
// 返回 error 供日志记录(审计失败绝不 panic,绝不触碰主链)。
|
||||
func auditOne(input DistillInput, facts []string) error {
|
||||
endpoint := envStr("ZHIYI_ADVERSARIAL_AUDIT_ENDPOINT",
|
||||
"http://127.0.0.1:3000/v1/chat/completions")
|
||||
model := envStr("ZHIYI_ADVERSARIAL_AUDIT_MODEL", "deepseek-v4-flash")
|
||||
key := envStr("ZHIYI_ADVERSARIAL_AUDIT_KEY", "")
|
||||
if key == "" {
|
||||
key = os.Getenv("LLM_API_KEY")
|
||||
}
|
||||
timeout := time.Duration(envFloat("ZHIYI_ADVERSARIAL_AUDIT_TIMEOUT", 60)) * time.Second
|
||||
|
||||
raw, err := callAuditModel(endpoint, model, key, buildAuditPrompt(input.Content, facts), timeout)
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
verdicts := parseAuditVerdicts(raw)
|
||||
flag := 0
|
||||
for _, v := range verdicts {
|
||||
if v.Verdict == "contradiction" || v.Verdict == "hallucination" || v.Verdict == "no_evidence" {
|
||||
flag++
|
||||
}
|
||||
}
|
||||
log.Printf("[adv-audit] episode=%s facts=%d verdicts=%d flagged=%d model=%s",
|
||||
input.EpisodeID, len(facts), len(verdicts), flag, model)
|
||||
for _, v := range verdicts {
|
||||
appendAuditLog(input, v)
|
||||
}
|
||||
if len(verdicts) == 0 {
|
||||
log.Printf("[adv-audit] 审计模型未返回可解析结论 episode=%s raw=%q", input.EpisodeID, truncate(raw, 200))
|
||||
}
|
||||
return nil
|
||||
}
|
||||
|
||||
// buildAuditPrompt 构造对抗审计 prompt:给原文 + 提取的事实,要求逐条判定。
|
||||
// 输出格式要求严格 JSON 数组(异源模型普遍稳定支持)。
|
||||
func buildAuditPrompt(content string, facts []string) string {
|
||||
var b strings.Builder
|
||||
b.WriteString("你是一个对抗性记忆审计员。下面是一段原始内容,以及系统从中\"蒸馏提取\"出的事实条目。\n")
|
||||
b.WriteString("你的任务:逐条判断每个事实是否被原文支持。\n\n")
|
||||
b.WriteString("原文:\n")
|
||||
b.WriteString(truncate(content, 1500))
|
||||
b.WriteString("\n\n提取的事实:\n")
|
||||
for i, f := range facts {
|
||||
fmt.Fprintf(&b, "%d. %s\n", i+1, f)
|
||||
}
|
||||
b.WriteString("\n对每条事实输出一个JSON对象:{\"fact\":\"<事实原文>\",\"verdict\":\"supported|contradiction|hallucination|no_evidence\",\"reason\":\"<一句话理由>\"}。\n")
|
||||
b.WriteString("判据:supported=原文明确支持;contradiction=与原文矛盾;hallucination=原文根本没提到(模型编造);no_evidence=原文不足以支撑该推断。\n")
|
||||
b.WriteString("只输出一个JSON数组,元素顺序与事实条目顺序一一对应,不要输出任何其他文字。")
|
||||
return b.String()
|
||||
}
|
||||
|
||||
// callAuditModel 调异源审计模型,返回 message.content 原文。
|
||||
func callAuditModel(endpoint, model, key, prompt string, timeout time.Duration) (string, error) {
|
||||
body := map[string]interface{}{
|
||||
"model": model,
|
||||
"messages": []map[string]string{{"role": "user", "content": prompt}},
|
||||
"temperature": 0.1,
|
||||
"max_tokens": 2000,
|
||||
}
|
||||
jsonBody, err := json.Marshal(body)
|
||||
if err != nil {
|
||||
return "", err
|
||||
}
|
||||
req, err := http.NewRequest("POST", endpoint, strings.NewReader(string(jsonBody)))
|
||||
if err != nil {
|
||||
return "", err
|
||||
}
|
||||
req.Header.Set("Content-Type", "application/json")
|
||||
if key != "" {
|
||||
req.Header.Set("Authorization", "Bearer "+key)
|
||||
}
|
||||
client := &http.Client{Timeout: timeout}
|
||||
resp, err := client.Do(req)
|
||||
if err != nil {
|
||||
return "", err
|
||||
}
|
||||
defer resp.Body.Close()
|
||||
if resp.StatusCode != http.StatusOK {
|
||||
return "", fmt.Errorf("audit endpoint HTTP %d", resp.StatusCode)
|
||||
}
|
||||
var out struct {
|
||||
Choices []struct {
|
||||
Message struct {
|
||||
Content string `json:"content"`
|
||||
} `json:"message"`
|
||||
} `json:"choices"`
|
||||
}
|
||||
if err := json.NewDecoder(resp.Body).Decode(&out); err != nil {
|
||||
return "", err
|
||||
}
|
||||
if len(out.Choices) == 0 {
|
||||
return "", fmt.Errorf("audit: no choices in response")
|
||||
}
|
||||
return out.Choices[0].Message.Content, nil
|
||||
}
|
||||
|
||||
// parseAuditVerdicts 解析审计模型返回的 JSON 数组。健壮剥离 markdown fence 与
|
||||
// 前后杂质(找第一个 [ 到匹配的 ]),解析失败返回空切片(不 panic)。
|
||||
func parseAuditVerdicts(raw string) []AuditVerdict {
|
||||
s := strings.TrimSpace(raw)
|
||||
// 剥 markdown code fence
|
||||
s = strings.TrimPrefix(s, "```json")
|
||||
s = strings.TrimPrefix(s, "```")
|
||||
s = strings.TrimSuffix(s, "```")
|
||||
s = strings.TrimSpace(s)
|
||||
// 找第一个 [ 和最后一个 ]
|
||||
si := strings.Index(s, "[")
|
||||
ei := strings.LastIndex(s, "]")
|
||||
if si < 0 || ei <= si {
|
||||
return nil
|
||||
}
|
||||
var verdicts []AuditVerdict
|
||||
if err := json.Unmarshal([]byte(s[si:ei+1]), &verdicts); err != nil {
|
||||
return nil
|
||||
}
|
||||
return verdicts
|
||||
}
|
||||
|
||||
// appendAuditLog 追加一条审计结论到影子日志(JSONL,串行追加)。
|
||||
// 路径运行时读 env;默认 /var/lib/memoryweave/adversarial-audit.log。
|
||||
func appendAuditLog(input DistillInput, v AuditVerdict) {
|
||||
path := envStr("ZHIYI_ADVERSARIAL_AUDIT_LOG", "/var/lib/memoryweave/adversarial-audit.log")
|
||||
line := map[string]interface{}{
|
||||
"ts": time.Now().Format(time.RFC3339),
|
||||
"episode": input.EpisodeID,
|
||||
"source": input.Source,
|
||||
"namespace": input.Namespace,
|
||||
"fact": v.Fact,
|
||||
"verdict": v.Verdict,
|
||||
"reason": v.Reason,
|
||||
}
|
||||
b, _ := json.Marshal(line)
|
||||
advAuditMu.Lock()
|
||||
defer advAuditMu.Unlock()
|
||||
f, err := os.OpenFile(path, os.O_APPEND|os.O_CREATE|os.O_WRONLY, 0o644)
|
||||
if err != nil {
|
||||
log.Printf("[adv-audit] 影子日志打开失败 %s: %v", path, err)
|
||||
return
|
||||
}
|
||||
defer f.Close()
|
||||
f.Write(append(b, '\n'))
|
||||
}
|
||||
@@ -0,0 +1,142 @@
|
||||
package distill
|
||||
|
||||
import (
|
||||
"encoding/json"
|
||||
"net/http"
|
||||
"net/http/httptest"
|
||||
"os"
|
||||
"path/filepath"
|
||||
"strings"
|
||||
"testing"
|
||||
)
|
||||
|
||||
// ─── 测试策略 ───────────────────────────────────────────────
|
||||
// 对抗审计插槽是影子(只写日志不改行为),且 env 门控默认关。测试分四类:
|
||||
// ① AC1 门控默认关 → 零行为变化:开启校验函数不写日志、不发起调用。
|
||||
// ② AC5 关闭路径:unset env → 完全恢复。
|
||||
// ③ AC2 打开门控 → 审计日志有记录(用 httptest 假端点,确定性地验真实日志行)。
|
||||
// ④ 解析健壮性:模型返回带 markdown fence / 杂质时也能解析。
|
||||
//
|
||||
// 注意:审计异步(goroutine),测试里用同步版 auditOne 验真实日志写入。
|
||||
|
||||
// 返回一个假的审计 HTTP 端点,断言收到请求并返回固定 verdict 数组。
|
||||
func fakeAuditServer(t *testing.T, verdictJSON string) (*httptest.Server, *int) {
|
||||
t.Helper()
|
||||
var hits int
|
||||
srv := httptest.NewServer(http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) {
|
||||
hits++
|
||||
w.Header().Set("Content-Type", "application/json")
|
||||
// 正确嵌套:把 verdict 数组作为 content 的字符串值序列化,避免换行/引号破坏外层 JSON
|
||||
out, _ := json.Marshal(map[string]interface{}{
|
||||
"choices": []map[string]interface{}{{"message": map[string]interface{}{"content": verdictJSON}}},
|
||||
})
|
||||
w.Write(out)
|
||||
}))
|
||||
t.Cleanup(srv.Close)
|
||||
return srv, &hits
|
||||
}
|
||||
|
||||
func TestAdvAuditGateOffNoSideEffect(t *testing.T) {
|
||||
// AC1/AC5:门控默认关(不设 env),开启函数必须零副作用。
|
||||
t.Setenv("ZHIYI_ADVERSARIAL_AUDIT", "")
|
||||
tmp := filepath.Join(t.TempDir(), "audit.log")
|
||||
t.Setenv("ZHIYI_ADVERSARIAL_AUDIT_LOG", tmp)
|
||||
t.Setenv("ZHIYI_ADVERSARIAL_AUDIT_RATIO", "1.0") // 即便抽样=100%也必须不动作
|
||||
|
||||
in := DistillInput{EpisodeID: "ep_gate_off", Content: "牧尘决定把蒸馏模型换掉"}
|
||||
MaybeAdversarialAudit(in, []string{"一条事实"})
|
||||
|
||||
if _, err := os.Stat(tmp); !os.IsNotExist(err) {
|
||||
t.Fatalf("门控关时不应创建影子日志文件: %v", err)
|
||||
}
|
||||
}
|
||||
|
||||
func TestAdvAuditGateOffWhenDisabledExplicit(t *testing.T) {
|
||||
// 显式置 0 → 关,零行为变化。
|
||||
t.Setenv("ZHIYI_ADVERSARIAL_AUDIT", "0")
|
||||
tmp := filepath.Join(t.TempDir(), "audit.log")
|
||||
t.Setenv("ZHIYI_ADVERSARIAL_AUDIT_LOG", tmp)
|
||||
|
||||
MaybeAdversarialAudit(DistillInput{EpisodeID: "ep0"}, []string{"f"})
|
||||
if _, err := os.Stat(tmp); !os.IsNotExist(err) {
|
||||
t.Fatalf("ZHIYI_ADVERSARIAL_AUDIT=0 时应关,不应写日志: %v", err)
|
||||
}
|
||||
}
|
||||
|
||||
func TestAdvAuditGateOnWritesLog(t *testing.T) {
|
||||
// AC2:打开门控 + 同步 auditOne → 影子日志有真实记录(≥3 条 verdict)。
|
||||
verdicts := `[{"fact":"牧尘决定把蒸馏模型换掉","verdict":"supported","reason":"原文明确支持"},
|
||||
{"fact":"牧尘喜欢苹果","verdict":"hallucination","reason":"原文未提及"},
|
||||
{"fact":"牧尘讨厌苹果","verdict":"contradiction","reason":"与原文相反"}]`
|
||||
srv, _ := fakeAuditServer(t, verdicts)
|
||||
|
||||
t.Setenv("ZHIYI_ADVERSARIAL_AUDIT", "1")
|
||||
tmp := filepath.Join(t.TempDir(), "audit.log")
|
||||
t.Setenv("ZHIYI_ADVERSARIAL_AUDIT_LOG", tmp)
|
||||
t.Setenv("ZHIYI_ADVERSARIAL_AUDIT_ENDPOINT", srv.URL)
|
||||
t.Setenv("ZHIYI_ADVERSARIAL_AUDIT_MODEL", "deepseek-v4-flash")
|
||||
|
||||
err := auditOne(DistillInput{EpisodeID: "ep1", Content: "牧尘决定把蒸馏模型换掉", Source: "wiki:test"}, []string{"牧尘决定把蒸馏模型换掉"})
|
||||
if err != nil {
|
||||
t.Fatalf("auditOne err: %v", err)
|
||||
}
|
||||
|
||||
b, rerr := os.ReadFile(tmp)
|
||||
if rerr != nil {
|
||||
t.Fatalf("读影子日志失败: %v", rerr)
|
||||
}
|
||||
lines := strings.Split(strings.TrimSpace(string(b)), "\n")
|
||||
if len(lines) < 3 {
|
||||
t.Fatalf("影子日志应有 ≥3 条,实际 %d 条:\n%s", len(lines), string(b))
|
||||
}
|
||||
// 校验首行字段完整(episode / fact / verdict)
|
||||
var row map[string]interface{}
|
||||
if err := json.Unmarshal([]byte(lines[0]), &row); err != nil {
|
||||
t.Fatalf("日志首行非 JSON: %v", err)
|
||||
}
|
||||
if row["episode"] != "ep1" || row["fact"] != "牧尘决定把蒸馏模型换掉" || row["verdict"] != "supported" {
|
||||
t.Fatalf("日志行字段不完整: %v", row)
|
||||
}
|
||||
// 校验确有矛盾/幻觉判定
|
||||
if !strings.Contains(string(b), "contradiction") || !strings.Contains(string(b), "hallucination") {
|
||||
t.Fatalf("日志应含 contradiction 与 hallucination 判定:\n%s", string(b))
|
||||
}
|
||||
}
|
||||
|
||||
func TestAdvAuditParseMarkdownFence(t *testing.T) {
|
||||
// 解析健壮性:模型输出带 ```json fence + 前后杂质。
|
||||
raw := "好的,这是结果:\n```json\n[{\"fact\":\"A\",\"verdict\":\"supported\",\"reason\":\"r\"},{\"fact\":\"B\",\"verdict\":\"hallucination\",\"reason\":\"r2\"}]\n```"
|
||||
v := parseAuditVerdicts(raw)
|
||||
if len(v) != 2 {
|
||||
t.Fatalf("应解析出 2 条 verdict,实际 %d: %+v", len(v), v)
|
||||
}
|
||||
if v[0].Verdict != "supported" || v[1].Verdict != "hallucination" {
|
||||
t.Fatalf("verdict 解析错误: %+v", v)
|
||||
}
|
||||
}
|
||||
|
||||
func TestAdvAuditParseGarbage(t *testing.T) {
|
||||
// 完全无法解析 → 空切片,不 panic。
|
||||
if v := parseAuditVerdicts("抱歉,我无法完成该任务。"); v != nil && len(v) != 0 {
|
||||
t.Fatalf("垃圾输入应返回空,实际 %+v", v)
|
||||
}
|
||||
if v := parseAuditVerdicts(""); len(v) != 0 {
|
||||
t.Fatalf("空输入应返回空")
|
||||
}
|
||||
}
|
||||
|
||||
func TestAdvAuditModelIsDifferentSource(t *testing.T) {
|
||||
// AC3:审计模型默认 = deepseek-v4-flash(NewAPI 免费腿),
|
||||
// 与蒸馏主链的本地 2B(local/minicpm5-2b)不同源不同模型。
|
||||
// 本测试校验默认端点/模型指向 NewAPI 而非本地 8081。
|
||||
t.Setenv("ZHIYI_ADVERSARIAL_AUDIT", "1")
|
||||
ep := envStr("ZHIYI_ADVERSARIAL_AUDIT_ENDPOINT", "http://127.0.0.1:3000/v1/chat/completions")
|
||||
md := envStr("ZHIYI_ADVERSARIAL_AUDIT_MODEL", "deepseek-v4-flash")
|
||||
if strings.Contains(ep, "8081") {
|
||||
t.Fatalf("审计端点不得指向本地 2B(8081),实际 %s", ep)
|
||||
}
|
||||
if strings.Contains(md, "minicpm5") {
|
||||
t.Fatalf("审计模型不得为本地 2B,实际 %s", md)
|
||||
}
|
||||
t.Logf("默认审计端点=%s 模型=%s(异源:非本地 2B)", ep, md)
|
||||
}
|
||||
@@ -0,0 +1,159 @@
|
||||
// 织忆 MemoryWeave — bi-temporal 有效期检测 + provenance(t_3ada332b,血统 Zep/Graphiti)
|
||||
//
|
||||
// 设计(方案C「长期正确性」):时间敏感事实用【有效区间】(valid_from/valid_to) 而非删除。
|
||||
// 双时间线:episode T'(CreatedAt,何时说的)+ 语义 T(valid_to 表达的失效终点)。
|
||||
// non-lossy:失效只标区间,历史永久保留(可追溯、当前状态干净)。
|
||||
// provenance:来源类型枚举 user|inferred|import —— 新语句不自动覆盖旧的(来源权威性)。
|
||||
//
|
||||
// ⚠️ 误报刹车(AC 止损线):时间敏感识别误报(把常驻事实标成临时的)>5% → 收紧识别规则
|
||||
// 只认【强时间词】+【带触发上下文的显式日期】,宽口径一律不进(宁漏不误伤)。
|
||||
// 返回空串 = 永久有效(NULL 语义,读路径不降权)。
|
||||
package distill
|
||||
|
||||
import (
|
||||
"regexp"
|
||||
"strings"
|
||||
"time"
|
||||
)
|
||||
|
||||
// 显式日期(绝对日期)触发词:只有紧邻这些上下文才解析,防把「生日是3月15日」这类常驻事实标成临时。
|
||||
var dateTriggerRe = regexp.MustCompile(
|
||||
`截止到|截止|截至|到|持续到|有效到|用到|在|于|(之前|前|为止|为止\b)`)
|
||||
|
||||
// dateTokenRe 匹配一个日期 token(含触发上下文内/前的日期片段)。
|
||||
// 支持:2006-01-02 / 2006/01/02 / 2006年01月02日 / 01月02日 / 1月2号 / 1月2日
|
||||
var dateTokenRe = regexp.MustCompile(
|
||||
`(?:(\d{4})[年/\-])?(\d{1,2})月(\d{1,2})[日号]|(\d{4})[-/](\d{1,2})[-/](\d{1,2})`)
|
||||
|
||||
// DetectValidTo 识别时间敏感事实的失效终点(RFC3339;空串 = 永久有效)。
|
||||
// now 为「本事实写入时刻」(episode T' 的审计时间),据此计算语义 T 的区间末端。
|
||||
func DetectValidTo(content string, now time.Time) string {
|
||||
// 0) 强时间词先于显式日期("截止到这周" 这类,「这周」优先给周末)
|
||||
// 只认【绝对强词】,避免「下」「这」单独出现的误判。
|
||||
if s := matchStrongTimeWord(content, now); s != "" {
|
||||
return s
|
||||
}
|
||||
|
||||
// 1) 带触发上下文的显式日期(要求有 截止/到/之前/为止 等前后缀,否则太宽进)
|
||||
if !dateTriggerRe.MatchString(content) {
|
||||
return ""
|
||||
}
|
||||
if d := parseExplicitDate(content, now); d != "" {
|
||||
return d
|
||||
}
|
||||
return ""
|
||||
}
|
||||
|
||||
// DetectProvenance 从写入来源(source)字符串归一到 provenance 三枚举。
|
||||
// 映射口径:显式 user/口头/直接用户 段 → user;import/导入/wiki(笔记通道) → import;
|
||||
// agent/推断/inferred/llm/蒸馏 → inferred;其余兜底 → inferred。
|
||||
func DetectProvenance(source string) string {
|
||||
s := strings.ToLower(source)
|
||||
switch {
|
||||
case containsAny(s, []string{"user", "口头", "直接用户", "user_said", "直接说"}):
|
||||
return "user"
|
||||
case containsAny(s, []string{"import", "导入", "wiki:", "wiki/", "笔记通道", "从外部"}):
|
||||
return "import"
|
||||
case containsAny(s, []string{"agent", "inferred", "推断", "infer", "llm", "distill", "蒸馏", "autogen"}):
|
||||
return "inferred"
|
||||
default:
|
||||
return "inferred"
|
||||
}
|
||||
}
|
||||
|
||||
// matchStrongTimeWord 只认强时间词,命中即返回对应区间末端。
|
||||
func matchStrongTimeWord(content string, now time.Time) string {
|
||||
// 顺序:长词在前避免「这个月」被「这」提前命中(我们只精确匹配完整词)。
|
||||
type kw struct {
|
||||
word string
|
||||
end func(time.Time) time.Time
|
||||
}
|
||||
table := []kw{
|
||||
{"这个月", endOfThisMonth},
|
||||
{"本月", endOfThisMonth},
|
||||
{"下周", endOfNextWeek},
|
||||
{"这周", endOfThisWeek},
|
||||
{"本周", endOfThisWeek},
|
||||
{"今晚", endOfToday},
|
||||
{"今天", endOfToday},
|
||||
{"今日", endOfToday},
|
||||
{"明天", endOfTomorrow},
|
||||
{"临时", addDays7},
|
||||
{"暂定", addDays7},
|
||||
{"暂时", addDays7},
|
||||
}
|
||||
for _, k := range table {
|
||||
if strings.Contains(content, k.word) {
|
||||
return k.end(now).Format(time.RFC3339)
|
||||
}
|
||||
}
|
||||
return ""
|
||||
}
|
||||
|
||||
func endOfToday(now time.Time) time.Time {
|
||||
return dayEnd(now)
|
||||
}
|
||||
func endOfTomorrow(now time.Time) time.Time {
|
||||
return dayEnd(now.AddDate(0, 0, 1))
|
||||
}
|
||||
func endOfThisWeek(now time.Time) time.Time {
|
||||
// 周日起 0,距下周日天数 = (7 - weekday) % 7(今天周日 → 0 → 今天)
|
||||
days := (7 - int(now.Weekday())) % 7
|
||||
return dayEnd(now.AddDate(0, 0, days))
|
||||
}
|
||||
func endOfNextWeek(now time.Time) time.Time {
|
||||
days := (7 - int(now.Weekday())) % 7
|
||||
return dayEnd(now.AddDate(0, 0, days+7))
|
||||
}
|
||||
func endOfThisMonth(now time.Time) time.Time {
|
||||
first := time.Date(now.Year(), now.Month(), 1, 0, 0, 0, 0, now.Location())
|
||||
return dayEnd(first.AddDate(0, 1, -1)) // 下月1号 -1天 = 月末
|
||||
}
|
||||
func addDays7(now time.Time) time.Time {
|
||||
return now.Add(7 * 24 * time.Hour)
|
||||
}
|
||||
func dayEnd(t time.Time) time.Time {
|
||||
y, m, d := t.Date()
|
||||
return time.Date(y, m, d, 23, 59, 59, 0, t.Location())
|
||||
}
|
||||
|
||||
// parseExplicitDate 在带触发词的上下文里找日期 token 并解析为「当日 23:59:59」。
|
||||
func parseExplicitDate(content string, now time.Time) string {
|
||||
loc := now.Location()
|
||||
for _, m := range dateTokenRe.FindAllStringSubmatch(content, -1) {
|
||||
var y, mo, d int
|
||||
switch {
|
||||
case m[2] != "" && m[3] != "":
|
||||
// 月日式:M月D日 / M月D号(m[1] 可空=今年)
|
||||
mo = atoiSafe(m[2])
|
||||
d = atoiSafe(m[3])
|
||||
y = now.Year()
|
||||
if m[1] != "" {
|
||||
y = atoiSafe(m[1])
|
||||
}
|
||||
case m[4] != "" && m[5] != "" && m[6] != "":
|
||||
// 完整式:YYYY-MM-DD / YYYY/MM/DD
|
||||
y = atoiSafe(m[4])
|
||||
mo = atoiSafe(m[5])
|
||||
d = atoiSafe(m[6])
|
||||
default:
|
||||
continue
|
||||
}
|
||||
if mo < 1 || mo > 12 || d < 1 || d > 31 {
|
||||
continue
|
||||
}
|
||||
return dayEnd(time.Date(y, time.Month(mo), d, 0, 0, 0, 0, loc)).Format(time.RFC3339)
|
||||
}
|
||||
return ""
|
||||
}
|
||||
|
||||
func atoiSafe(s string) int {
|
||||
n := 0
|
||||
for _, c := range s {
|
||||
if c < '0' || c > '9' {
|
||||
return 0
|
||||
}
|
||||
n = n*10 + int(c-'0')
|
||||
}
|
||||
return n
|
||||
}
|
||||
@@ -0,0 +1,111 @@
|
||||
// 织忆 MemoryWeave — bi-temporal 写时识别测试(t_3ada332b)
|
||||
//
|
||||
// 验证:
|
||||
// ① DetectValidTo:强时间词/带上下文显式日期 → 区间末端;常驻事实(无时间词/无触发上下文)→ ""(不误伤)
|
||||
// ② DetectProvenance:user/inferred/import 三来源归一
|
||||
package distill
|
||||
|
||||
import (
|
||||
"strings"
|
||||
"testing"
|
||||
"time"
|
||||
)
|
||||
|
||||
// 固定审计时刻:2026-10-14(周三)UTC,便于确定性断言。
|
||||
var btNow = time.Date(2026, 10, 14, 10, 0, 0, 0, time.UTC)
|
||||
|
||||
func TestDetectValidTo_StrongTimeWords(t *testing.T) {
|
||||
cases := []struct {
|
||||
in string
|
||||
want string // 期望 valid_to(RFC3339)
|
||||
desc string
|
||||
}{
|
||||
{"牧尘这周在 Berlin", "2026-10-18T23:59:59Z", "这周→本周日"},
|
||||
{"本周要发布版本", "2026-10-18T23:59:59Z", "本周→本周日"},
|
||||
{"下周去开会", "2026-10-25T23:59:59Z", "下周→下周日"},
|
||||
{"今天要交报告", "2026-10-14T23:59:59Z", "今天→当日末"},
|
||||
{"明天安排体检", "2026-10-15T23:59:59Z", "明天→次日末"},
|
||||
{"这个月完成迁移", "2026-10-31T23:59:59Z", "这个月→月末"},
|
||||
{"临时使用测试机", "", "临时→(非精确,仅断言非空,见下)"}, // 临时 = now+7d,逐条单测
|
||||
}
|
||||
for _, c := range cases {
|
||||
got := DetectValidTo(c.in, btNow)
|
||||
if c.desc == "临时→(非精确,仅断言非空,见下)" {
|
||||
if got == "" {
|
||||
t.Fatalf("DetectValidTo(%q) 应非空(临时→+7天),实际空", c.in)
|
||||
}
|
||||
continue
|
||||
}
|
||||
if got != c.want {
|
||||
t.Errorf("✗ DetectValidTo(%q)=%q,want %q(%s)", c.in, got, c.want, c.desc)
|
||||
} else {
|
||||
t.Logf("✓ %s: %q → %s", c.desc, c.in, got)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// 临时/暂定 → now + 7 天(精确)。
|
||||
func TestDetectValidTo_Temporary(t *testing.T) {
|
||||
got := DetectValidTo("临时使用测试机", btNow)
|
||||
want := btNow.Add(7 * 24 * time.Hour).Format(time.RFC3339)
|
||||
if got != want {
|
||||
t.Fatalf("✗ 临时→now+7d:got %q want %q", got, want)
|
||||
}
|
||||
t.Logf("✓ 临时→now+7d: %s", got)
|
||||
}
|
||||
|
||||
// 常驻事实不得被误判成临时(AC 止损线:误报>5% → 收紧只认强词,宽口径不进)。
|
||||
func TestDetectValidTo_NoFalsePositive(t *testing.T) {
|
||||
permanent := []string{
|
||||
"牧尘住在北京", // 常驻地址
|
||||
"牧尘在招商局工作", // 常驻工作
|
||||
"牧尘生日是3月15日", // 显式日期但【无触发上下文】→ 不解析(防生日/纪念日被标临时)
|
||||
"系统使用 PostgreSQL", // 技术选型
|
||||
"我偏好简洁的回答", // 用户偏好
|
||||
"当前模型是 deepseek-v4", // 当前配置(无临时词)
|
||||
}
|
||||
for _, in := range permanent {
|
||||
if got := DetectValidTo(in, btNow); got != "" {
|
||||
t.Errorf("✗ 常驻事实被误判临时: %q → %s(应空=永久有效)", in, got)
|
||||
}
|
||||
}
|
||||
t.Logf("✓ %d 条常驻事实均未被误判(误报止损线)", len(permanent))
|
||||
}
|
||||
|
||||
// 带触发上下文的显式日期才解析。
|
||||
func TestDetectValidTo_ExplicitDateWithTrigger(t *testing.T) {
|
||||
cases := []struct{ in, want string }{
|
||||
{"截止到2026-03-15", "2026-03-15T23:59:59Z"},
|
||||
{"合同截至2026年12月31日", "2026-12-31T23:59:59Z"},
|
||||
{"这个权限在3月20日前有效", "2026-03-20T23:59:59Z"},
|
||||
}
|
||||
for _, c := range cases {
|
||||
got := DetectValidTo(c.in, btNow)
|
||||
if got != c.want {
|
||||
t.Errorf("✗ DetectValidTo(%q)=%q want %q", c.in, got, c.want)
|
||||
} else {
|
||||
t.Logf("✓ %q → %s", c.in, got)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func TestDetectProvenance(t *testing.T) {
|
||||
cases := []struct{ in, want string }{
|
||||
{"user", "user"}, {"user said", "user"}, {"牧尘口头", "user"},
|
||||
{"import", "import"}, {"wiki:xxx", "import"},
|
||||
{"agent", "inferred"}, {"agent inferred", "inferred"}, {"llm_distill", "inferred"},
|
||||
{"", "inferred"}, // 兜底 → inferred(保守,不误标 user/import)
|
||||
}
|
||||
for _, c := range cases {
|
||||
if got := DetectProvenance(c.in); got != c.want {
|
||||
t.Errorf("✗ DetectProvenance(%q)=%q want %q", c.in, got, c.want)
|
||||
}
|
||||
}
|
||||
// 三来源各覆盖至少一次
|
||||
if !strings.Contains("user inferred import", DetectProvenance("user")) ||
|
||||
!strings.Contains("user inferred import", DetectProvenance("import")) ||
|
||||
!strings.Contains("user inferred import", DetectProvenance("agent")) {
|
||||
t.Fatal("三来源枚举未全覆盖")
|
||||
}
|
||||
t.Logf("✓ DetectProvenance 三来源归一 user/inferred/import 正确")
|
||||
}
|
||||
@@ -0,0 +1,215 @@
|
||||
// 织忆 MemoryWeave — 真矛盾判据门(t_e3f5cb79 · 2026-10-31 方案 A2)
|
||||
//
|
||||
// 背景(硬证据,非推测):freshness=conflict 存量 24 条人工判读 **0/24 真矛盾**
|
||||
// (方案文档 2026-10-31「验证结果(2026-11-02)」节,脚本 verify1-conflicts.py /
|
||||
// verify1b-counterparts.py)。旧 CONFLICT-MARK 判据(ruleContradiction 否定词表 /
|
||||
// LLM 高相似带偏)本质是「语义相似检测器」,误报率 100%。
|
||||
//
|
||||
// 本文件给出 AC-1 判据的唯一确定性实现:**同主体 + 同属性 + 不同取值**才算矛盾。
|
||||
// 两条可判通道(任一命中才算,判不出 = 不是矛盾,宁漏勿误):
|
||||
//
|
||||
// ① 属性-取值对:两侧都能解析出「同一属性键」的显式取值(数字/布尔/ASCII 标识符),
|
||||
// 且取值规范化后不相等。属性键:ASCII 标识符(`KEY=值`/`KEY 为 值`/`KEY 实测 值`…)
|
||||
// 或「短语主语+是/为/:+数字」的中文属性短语。
|
||||
// ② 否定对立(同一小句、共享锚、否定落在作用域内):复用 governance.IsContradiction
|
||||
// (四修判据,回归 conflict_scope_test.go),不在本文件重复实现。
|
||||
//
|
||||
// 设计纪律:
|
||||
//
|
||||
// · 零新依赖(stdlib + internal/governance,无环:governance 只 import metrics)。
|
||||
// · 纯函数、无 IO/LLM/时钟 —— 任何来源(rule/llm/注入 judge)的 CONFLICT-MARK
|
||||
// 都必须在 JudgeWriteOp 出口过这道门;不过门降级 UPDATE(sim≥更新阈值)或 ADD。
|
||||
// · 宁漏勿误:解析不出 = false;值类型不同 = 不可比 = false;
|
||||
// 值带路径/斜杠等复合形态(如 `union=0/1`)= 拒绝解析(否则与 `union=1`
|
||||
// 误配成「不同取值」——24 条存量回归里真实存在这一对,实测必须 0 真矛盾)。
|
||||
package distill
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"regexp"
|
||||
"strconv"
|
||||
"strings"
|
||||
|
||||
"github.com/xiaoxue/memoryweave/internal/governance"
|
||||
)
|
||||
|
||||
// assertion 一条从文本解析出的「属性 → 显式取值」断言。
|
||||
type assertion struct {
|
||||
kind string // num | bool | ident
|
||||
val string // 规范化后的值(num: float 文本;bool: 0/1;ident: 小写)
|
||||
raw string // 原值文本(仅用于证据串)
|
||||
}
|
||||
|
||||
var (
|
||||
// ascii 属性键 = 标识符(≥1 字符,单字键仅数字/布尔);**前置边界**防截尾(`X_ZHIYI_FBIAS=0`
|
||||
// 只可命中 `zhiyi_fbias`,不可再命中 `fbias`)。2 字符键(如 X=true)只接受
|
||||
// 数字/布尔值(ident 类拒绝)——`ID: <hex>` 这类 2 字符键+标识符值假配对风险高
|
||||
// (24 条存量回归实测约束)。连接词覆盖「的值是」这类中缀形态。
|
||||
kvASCIIRe = regexp.MustCompile("(?:^|[^A-Za-z0-9_])([A-Za-z][A-Za-z0-9_]*)\\s*(?:=|:|:|的值(?:是|为)?|值|取值|默认值为|默认值|当前值为|现为|实测|设置为|设为|为|是)\\s*([^\\s,。;、))】」》\"'`\u300a《]+)")
|
||||
// 中文属性短语:不含标点/空白的 2~16 字短语 + 系词 + 纯数字(可带常见量词)。
|
||||
kvCJKRe = regexp.MustCompile("([^,。;:!?、「」《》()()\\[\\]【】\\s\"'`\u3000]{2,16}?)(?:是|为|:|:)\\s*([0-9]+(?:\\.[0-9]+)?)(?:个|只|条|次|天|小时|分钟|秒|GB|MB|G|M|K|%|元|万元|亿|人|张|分|级|位|行|字|轮|台|核)?")
|
||||
// 尾部非法字符:值以这些结尾/包含这些时拒绝(复合表达式不是「取值」)。
|
||||
kvBadTail = regexp.MustCompile(`[/\\=<>&|+]$`)
|
||||
)
|
||||
|
||||
// boolWords 布尔值归一表(键取小写比较;中文开关词只在 ASCII 键通道接受,
|
||||
// 避免「开了个会」这类叙述句被当布尔值)。
|
||||
var boolWords = map[string]string{
|
||||
"true": "1", "false": "0", "on": "1", "off": "0", "yes": "1", "no": "0",
|
||||
"开": "1", "关": "0", "打开": "1", "关闭": "0", "启用": "1", "禁用": "0",
|
||||
"开启": "1", "停用": "0", "停": "0", "启动": "1",
|
||||
}
|
||||
|
||||
// normalizeValue 把一个捕获到的值文本规范化为 assertion;不可信形态返回 ok=false。
|
||||
func normalizeValue(raw string, allowCJKBool bool) (assertion, bool) {
|
||||
v := strings.TrimRight(raw, "。.,,;;))]")
|
||||
if v == "" || kvBadTail.MatchString(v) {
|
||||
return assertion{}, false
|
||||
}
|
||||
lower := strings.ToLower(v)
|
||||
if lw, ok := boolWords[lower]; ok {
|
||||
return assertion{kind: "bool", val: lw, raw: v}, true
|
||||
}
|
||||
if allowCJKBool {
|
||||
if lw, ok := boolWords[v]; ok {
|
||||
return assertion{kind: "bool", val: lw, raw: v}, true
|
||||
}
|
||||
}
|
||||
if f, err := strconv.ParseFloat(v, 64); err == nil {
|
||||
return assertion{kind: "num", val: strconv.FormatFloat(f, 'g', -1, 64), raw: v}, true
|
||||
}
|
||||
// 纯 ASCII 标识符值(如 mimo-v2.5-pro);含 CJK/路径/斜杠的一律拒(歧义太大)
|
||||
if isASCIIToken(v) {
|
||||
return assertion{kind: "ident", val: lower, raw: v}, true
|
||||
}
|
||||
return assertion{}, false
|
||||
}
|
||||
|
||||
func isASCIIToken(s string) bool {
|
||||
if s == "" {
|
||||
return false
|
||||
}
|
||||
for _, r := range s {
|
||||
switch {
|
||||
case r >= 'a' && r <= 'z', r >= 'A' && r <= 'Z', r >= '0' && r <= '9',
|
||||
r == '-', r == '_', r == '.':
|
||||
default:
|
||||
return false
|
||||
}
|
||||
}
|
||||
return true
|
||||
}
|
||||
|
||||
// extractAssertions 抽取文本里全部「属性→值」断言(同键后到覆盖先到)。
|
||||
func extractAssertions(text string) map[string]assertion {
|
||||
out := make(map[string]assertion)
|
||||
for _, m := range kvASCIIRe.FindAllStringSubmatch(text, -1) {
|
||||
key := strings.ToLower(m[1])
|
||||
a, ok := normalizeValue(m[2], false)
|
||||
if !ok {
|
||||
continue
|
||||
}
|
||||
// 2 字符键假配对风险高(ID/of/no…):只接受数字/布尔取值(ident 拒绝)
|
||||
if len(key) < 3 && a.kind == "ident" {
|
||||
continue
|
||||
}
|
||||
out[key] = a
|
||||
}
|
||||
for _, m := range kvCJKRe.FindAllStringSubmatch(text, -1) {
|
||||
phrase := m[1]
|
||||
// 短语尾部可能粘连系词前字(非贪婪边界),截最后一个标点后的尾名词
|
||||
phrase = strings.TrimLeft(phrase, "的是了将和对与和为")
|
||||
phrase = normalizeCJKAttrKey(phrase)
|
||||
if len([]rune(phrase)) < 2 {
|
||||
continue
|
||||
}
|
||||
key := "zh:" + phrase
|
||||
if a, ok := normalizeValue(m[2], false); ok {
|
||||
out[key] = a
|
||||
}
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
// cjkKeyNoise 中文属性短语里的动词/时态噪声。实测来源(2026-11-11 supersede E2E):
|
||||
// 同一条事实被蒸馏两次会写成「API端口**被指定为**60123」与「API端口**为**60124」——
|
||||
// 去掉噪声后属性键才是同一个,否则漏判(宁漏勿误的反面:该合的没合)。
|
||||
// 只削**尾缀**语义噪声,不动名词本身;削完不足 2 字则原样返回(不误伤短键)。
|
||||
var cjkKeyNoise = []string{
|
||||
"被指定", "指定", "被设置", "设置", "被改为", "改为", "变更", "调整为", "调整",
|
||||
"更新为", "更新", "设置为", "设为", "现在", "当前", "目前", "已经", "已", "则是",
|
||||
}
|
||||
|
||||
// normalizeCJKAttrKey 去掉属性短语里的动词/时态噪声,供同属性判定比对。
|
||||
func normalizeCJKAttrKey(phrase string) string {
|
||||
out := phrase
|
||||
for i := 0; i < 3; i++ { // 最多削 3 层(如「现在被指定」)
|
||||
changed := false
|
||||
for _, n := range cjkKeyNoise {
|
||||
if strings.HasSuffix(out, n) && len([]rune(strings.TrimSuffix(out, n))) >= 2 {
|
||||
out = strings.TrimSuffix(out, n)
|
||||
changed = true
|
||||
}
|
||||
}
|
||||
if !changed {
|
||||
break
|
||||
}
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
// sameAttrDiffValue 通道①:两侧同属性键、同值类型、规范化取值不同。
|
||||
//
|
||||
// 键匹配三种(都要求同值类型):
|
||||
//
|
||||
// ① 完全相同
|
||||
// ② 中文键**后缀包含**(2026-11-11 实测:同一事实被蒸馏两次会写成
|
||||
// 「监听端口为 60126」与「所以需要确认监听端口为 60126」⇒ 前者是后者后缀)。
|
||||
// 短键需 ≥3 字才算,防「端口/监听端口」这类 2 字键过度配对。
|
||||
// ③ ASCII 键不看后缀(`port` 与 `api_port` 语义不同,宁漏勿误)
|
||||
func sameAttrDiffValue(a, b string) (string, bool) {
|
||||
A, B := extractAssertions(a), extractAssertions(b)
|
||||
for k, va := range A {
|
||||
if vb, ok := B[k]; ok && va.kind == vb.kind {
|
||||
if va.val != vb.val {
|
||||
return fmt.Sprintf("同属性 %q 不同取值: %s vs %s", k, va.raw, vb.raw), true
|
||||
}
|
||||
continue
|
||||
}
|
||||
if !strings.HasPrefix(k, "zh:") {
|
||||
continue
|
||||
}
|
||||
for kb, vb := range B {
|
||||
if !strings.HasPrefix(kb, "zh:") || va.kind != vb.kind || va.val == vb.val {
|
||||
continue
|
||||
}
|
||||
ka := strings.TrimPrefix(k, "zh:")
|
||||
kbn := strings.TrimPrefix(kb, "zh:")
|
||||
short, long := ka, kbn
|
||||
if len([]rune(kbn)) < len([]rune(ka)) {
|
||||
short, long = kbn, ka
|
||||
}
|
||||
if len([]rune(short)) < 3 || !strings.HasSuffix(long, short) {
|
||||
continue
|
||||
}
|
||||
return fmt.Sprintf("同属性(后缀匹配) %q⊂%q 不同取值: %s vs %s", short, long, va.raw, vb.raw), true
|
||||
}
|
||||
}
|
||||
return "", false
|
||||
}
|
||||
|
||||
// SameAttrValueConflict 是 AC-1 判据入口:**同主体 + 同属性 + 不同取值** 才判真矛盾。
|
||||
// 返回 (证据, 是否真矛盾)。判不出(解析失败/类型不齐/无显式取值)一律 false。
|
||||
func SameAttrValueConflict(a, b string) (string, bool) {
|
||||
if strings.TrimSpace(a) == "" || strings.TrimSpace(b) == "" {
|
||||
return "", false
|
||||
}
|
||||
if ev, ok := sameAttrDiffValue(a, b); ok {
|
||||
return ev, true
|
||||
}
|
||||
// 通道②:同一小句的否定对立(复用四修判据与其回归,本文件不重复实现)
|
||||
if governance.IsContradiction(a, b) {
|
||||
return "否定对立(governance.IsContradiction)", true
|
||||
}
|
||||
return "", false
|
||||
}
|
||||
@@ -0,0 +1,179 @@
|
||||
// 织忆 MemoryWeave — 真矛盾判据门回归(t_e3f5cb79 · AC-1)
|
||||
//
|
||||
// 三层判据(全部 -count=1 真跑):
|
||||
// ① SameAttrValueConflict 单元正反例(同属性异值=真;措辞重复/无显式取值/类型不齐=假)
|
||||
// ② JudgeWriteOp 出口门:假 CONFLICT(相似改写)降级 UPDATE/ADD;真矛盾保留并带证据
|
||||
// ③ AC-1.3 存量回归:testdata/conflict_stock_20261102.json(2026-11-02 快照,
|
||||
// 24 条 freshness=conflict + 各自 top3 对手句,人工判读 0/24 真矛盾)→
|
||||
// 新判据真矛盾计数必须 = 0;同时正例对照必须 >0(防「恒 false 作弊」)。
|
||||
// ④ AC-1.2 双向指针:apply CONFLICT → MarkConflict(old,new) 带 newID。
|
||||
package distill
|
||||
|
||||
import (
|
||||
_ "embed"
|
||||
"encoding/json"
|
||||
"strings"
|
||||
"testing"
|
||||
)
|
||||
|
||||
//go:embed testdata/conflict_stock_20261102.json
|
||||
var conflictStockJSON []byte
|
||||
|
||||
type stockRow struct {
|
||||
ID string `json:"id"`
|
||||
Content string `json:"content"`
|
||||
Counterparts []struct {
|
||||
ID string `json:"id"`
|
||||
Content string `json:"content"`
|
||||
} `json:"counterparts"`
|
||||
}
|
||||
|
||||
// ── ① 单元正反例 ──────────────────────────────────────────────
|
||||
|
||||
func TestSameAttrValueConflict_Positive(t *testing.T) {
|
||||
cases := []struct {
|
||||
name, a, b string
|
||||
}{
|
||||
{"配置项新旧值", "ZHIYI_FEEDBACK_BIAS 的值是 0", "ZHIYI_FEEDBACK_BIAS=0.2"},
|
||||
{"布尔对立", "ZHIYI_GRAPH_AUTO_SYNTH=1", "ZHIYI_GRAPH_AUTO_SYNTH=0"},
|
||||
{"ASCII 短键布尔", "X=true", "X=false"},
|
||||
{"标识符值不同", "ZHIYI_DISTILL_MODE=context", "ZHIYI_DISTILL_MODE=merged"},
|
||||
// IsContradiction 通道(四修判据样本,共享锚 + 否定作用域内)
|
||||
{"否定对立", "牧尘在招商局工作", "牧尘不在招商局工作"},
|
||||
}
|
||||
for _, c := range cases {
|
||||
if ev, ok := SameAttrValueConflict(c.a, c.b); !ok {
|
||||
t.Errorf("%s: 应判真矛盾但未判(a=%q b=%q)", c.name, c.a, c.b)
|
||||
} else if ev == "" {
|
||||
t.Errorf("%s: 判真但无证据串", c.name)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func TestSameAttrValueConflict_Negative(t *testing.T) {
|
||||
cases := []struct {
|
||||
name, a, b string
|
||||
}{
|
||||
{"同值重复不是矛盾", "ZHIYI_FEEDBACK_BIAS=0.2", "反馈偏置 ZHIYI_FEEDBACK_BIAS 为 0.2"},
|
||||
{"措辞改写无取值对", "决定检查存储层全部可能位置。", "必须检查存储层全部可能位置以确保范围完整。"},
|
||||
{"不同属性同数字", "织忆端口是7821", "llama端口是8080"},
|
||||
{"复合表达式拒绝解析", "改造要留验收开关(本例 `union=0/1`)", "两层并集真生效,`union=1` 响应正确。"},
|
||||
{"无关事实", "X=1", "Y=2"},
|
||||
{"纯否定词但无共享锚", "用户不喜欢吃辣", "牧尘在招商局工作"},
|
||||
{"空输入", "", "任意"},
|
||||
}
|
||||
for _, c := range cases {
|
||||
if ev, ok := SameAttrValueConflict(c.a, c.b); ok {
|
||||
t.Errorf("%s: 不应判矛盾但判了(ev=%s a=%q b=%q)", c.name, ev, c.a, c.b)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// ── ② JudgeWriteOp 出口门 ─────────────────────────────────────
|
||||
|
||||
func TestJudgeWriteOp_ConflictGateDowngrade(t *testing.T) {
|
||||
defer withMode("apply")()
|
||||
|
||||
// 假冲突(高相似措辞改写,固定 judge 硬判 CONFLICT)→ 降级 UPDATE(sim≥0.70)
|
||||
v := JudgeWriteOp("决定检查存储层全部可能位置。",
|
||||
[]SimilarMemory{{ID: "mem_1", Content: "必须检查存储层全部可能位置以确保范围完整。", Similarity: 0.93}},
|
||||
fixedJudge(OpConflictMark), nil)
|
||||
if v == nil || v.Op != OpUpdate {
|
||||
t.Fatalf("假冲突高相似应降级 UPDATE,实际 %+v", v)
|
||||
}
|
||||
if !strings.Contains(v.Reason, "[gate:") {
|
||||
t.Fatalf("降级原因必须带 [gate] 标记,实际 %s", v.Reason)
|
||||
}
|
||||
|
||||
// 假冲突(低相似)→ 降级 ADD,且清 TargetID
|
||||
v = JudgeWriteOp("织忆召回 p50 1.34s",
|
||||
[]SimilarMemory{{ID: "mem_1", Content: "磁盘空间不足导致压缩包还原操作需要腾出空间", Similarity: 0.55}},
|
||||
fixedJudge(OpConflictMark), nil)
|
||||
if v == nil || v.Op != OpAdd || v.TargetID != "" {
|
||||
t.Fatalf("假冲突低相似应降级 ADD 且清 TargetID,实际 %+v", v)
|
||||
}
|
||||
|
||||
// 真矛盾保留 CONFLICT-MARK 并带 gate 证据
|
||||
v = JudgeWriteOp("ZHIYI_FEEDBACK_BIAS 的值是 0",
|
||||
[]SimilarMemory{{ID: "mem_1", Content: "ZHIYI_FEEDBACK_BIAS=0.2", Similarity: 0.96}},
|
||||
fixedJudge(OpConflictMark), nil)
|
||||
if v == nil || v.Op != OpConflictMark || !strings.Contains(v.Reason, "[gate:") {
|
||||
t.Fatalf("真矛盾应保留 CONFLICT-MARK+证据,实际 %+v", v)
|
||||
}
|
||||
|
||||
// TargetID 指不到候选行(注入 judge 幻觉)→ 按不过门处理
|
||||
v = JudgeWriteOp("任意候选事实甲",
|
||||
[]SimilarMemory{{ID: "mem_1", Content: "别的", Similarity: 0.96}},
|
||||
func(c string, s []SimilarMemory) WriteVerdict {
|
||||
return WriteVerdict{Op: OpConflictMark, Candidate: c, TargetID: "mem_不存在的", Similarity: 0.96, Reason: "幻觉目标"}
|
||||
}, nil)
|
||||
if v == nil || v.Op == OpConflictMark {
|
||||
t.Fatalf("幻觉 TargetID 必须被门拦下,实际 %+v", v)
|
||||
}
|
||||
}
|
||||
|
||||
// ── ③ AC-1.3 存量回归:24 条 conflict 重跑新判据 → 真矛盾计数 = 0 ──
|
||||
|
||||
func TestConflictStock_24_ZeroTrueConflict(t *testing.T) {
|
||||
var rows []stockRow
|
||||
if err := json.Unmarshal(conflictStockJSON, &rows); err != nil {
|
||||
t.Fatalf("testdata 解析失败: %v", err)
|
||||
}
|
||||
if len(rows) != 24 {
|
||||
t.Fatalf("存量快照应为 24 条,实际 %d", len(rows))
|
||||
}
|
||||
totalPairs, trueConflicts := 0, []string{}
|
||||
for _, r := range rows {
|
||||
for _, cp := range r.Counterparts {
|
||||
totalPairs++
|
||||
if ev, ok := SameAttrValueConflict(r.Content, cp.Content); ok {
|
||||
trueConflicts = append(trueConflicts,
|
||||
r.ID+" vs "+cp.ID+": "+ev)
|
||||
}
|
||||
}
|
||||
}
|
||||
for _, s := range trueConflicts {
|
||||
t.Logf("误报清单条目: %s", s)
|
||||
}
|
||||
if len(trueConflicts) != 0 {
|
||||
t.Fatalf("AC-1.3:24 条存量(人工判读 0 真矛盾)新判据真矛盾计数必须=0,实际 %d(对数 %d)",
|
||||
len(trueConflicts), totalPairs)
|
||||
}
|
||||
t.Logf("AC-1.3 通过:%d 行 × top3 对手 = %d 对,真矛盾计数 0", len(rows), totalPairs)
|
||||
|
||||
// 防恒假对照:同一判据函数在构造真矛盾对上必须能报真
|
||||
controls := [][2]string{
|
||||
{"ZHIYI_FEEDBACK_BIAS 的值是 0", "ZHIYI_FEEDBACK_BIAS=0.2"},
|
||||
{"X=true", "X=false"},
|
||||
{"牧尘在招商局工作", "牧尘不在招商局工作"},
|
||||
}
|
||||
positives := 0
|
||||
for _, c := range controls {
|
||||
if _, ok := SameAttrValueConflict(c[0], c[1]); ok {
|
||||
positives++
|
||||
}
|
||||
}
|
||||
if positives < len(controls) {
|
||||
t.Fatalf("正例对照必须全过(防恒 false 作弊),实际 %d/%d", positives, len(controls))
|
||||
}
|
||||
}
|
||||
|
||||
// ── ④ AC-1.2 双向指针(store 半边的入参正确性)────────────────
|
||||
|
||||
func TestApplyWriteOp_ConflictWritesBothSidePointer(t *testing.T) {
|
||||
defer withMode("apply")()
|
||||
v := WriteVerdict{Op: OpConflictMark, Candidate: "ZHIYI_FEEDBACK_BIAS=0.2",
|
||||
TargetID: "mem_old", Similarity: 0.96, Reason: "同属性不同取值"}
|
||||
store := newFakeStore()
|
||||
shouldInsert, err := ApplyWriteOp(v, store, "mem_new")
|
||||
if err != nil || !shouldInsert {
|
||||
t.Fatalf("CONFLICT 必须插入新条:%v %v", shouldInsert, err)
|
||||
}
|
||||
if !store.conflicted["mem_old"] {
|
||||
t.Fatalf("旧行未打标")
|
||||
}
|
||||
if store.conflictPtr["mem_old"] != "mem_new" {
|
||||
t.Fatalf("AC-1.2: MarkConflict 必须携带 newID(旧行 superseded_by=[新id]),实际 %q",
|
||||
store.conflictPtr["mem_old"])
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,93 @@
|
||||
// 织忆 MemoryWeave — 蒸馏产出信息密度判据(kanban t_ab5b2461)
|
||||
//
|
||||
// 病(2026-10-30 全面评估 + 本卡按 Source 分组定位):memories 表 content 中位数 35 字、
|
||||
// 83.3% <60 字、含可执行标记率低 —— 蒸馏产物太短,召回出来没法直接用。
|
||||
// 分组实测(groups_before.json,live 42,150):llm_distill p50=36、wiki:worklog-note p50=36、
|
||||
// wiki:domain-kb p50=38、wiki:session-compress p50=30 —— distill 全家族整体都碎,
|
||||
// 不是某一条上游的病 ⇒ 收口在共用写入点(server.go OnDistillComplete 写库循环 +
|
||||
// engine.go 提取 prompt),不逐脚本打补丁。
|
||||
//
|
||||
// 设计(延续 procedural_gate.go 分诊哲学 + 卡红线「禁为长度而长度」):
|
||||
// - 纯确定性判据,零 LLM 调用,三项各自独立判定(正则):
|
||||
// ① 可执行动作/命令/路径(反引号命令、CLI 调用、绝对/家目录路径、脚本/配置文件扩展名)
|
||||
// ② 明确判据或阈值(数字+单位、比较符、阈值/上限/下限/门槛类词)
|
||||
// ③ 因果(「为什么」:因为/由于/导致/根因/否则/⇒ 等因果链词)
|
||||
// - 满足 ≥2 项 ⇒ 保持 Category="distilled"(知识形态)。
|
||||
// - <2 项 ⇒ 降级 Category="observe":行照写、可召回、计入写入量(AC3 不饿死),
|
||||
// 只是不再冒充高质量知识 —— 与 t_3636b872 同一理由:降级可逆,丢弃不可逆。
|
||||
// - 不做长度硬门槛:长度是三项判据的**结果**不是目标(卡红线)。
|
||||
//
|
||||
// env 门控:ZHIYI_DISTILL_DENSITY=1 启用(灰度开在 systemd drop-in);
|
||||
// 未设 ⇒ DensityGateEnabled()=false ⇒ 写入侧 Category 恒 "distilled"、
|
||||
// prompt 与打分缓存键逐字节回到现状(AC5 可回滚)。
|
||||
// 回滚:rm 42-density-gate.conf + daemon-reload + zhiyi-restart-with-lock.sh restart。
|
||||
|
||||
package distill
|
||||
|
||||
import (
|
||||
"os"
|
||||
"regexp"
|
||||
)
|
||||
|
||||
// densityGateEnabled 启动时读一次(与 proceduralShadowMode 同款,改值须重启)。
|
||||
var densityGateEnabled = os.Getenv("ZHIYI_DISTILL_DENSITY") == "1"
|
||||
|
||||
// DensityGateEnabled 写入侧(server.go)与打分缓存(score_cache.go)共用的开关读口。
|
||||
func DensityGateEnabled() bool { return densityGateEnabled }
|
||||
|
||||
// 三项判据正则(RE2;口径写进交付,判据即文档)。
|
||||
var (
|
||||
// densityCmdRe ① 可执行动作/命令/路径:
|
||||
// 路径前缀(绝对/家目录)、脚本与配置文件扩展名、常见 CLI + 参数、反引号内联命令。
|
||||
densityCmdRe = regexp.MustCompile(
|
||||
`(?:~/|/(?:home|var|etc|data|usr|opt|tmp|srv|root)/|\.(?:sh|py|go|rs|conf|json|jsonl|ya?ml|toml|db|service|sql)\b` +
|
||||
`|\b(?:git|curl|wget|grep|rg|sed|awk|jq|yq|systemctl|journalctl|python3?|docker|uv|pip|npm|make|ssh|scp|rsync|chmod|chown|mv|cp|rm|mkdir|tar|sqlite3|psql|redis-cli|crontab|hermes|llama|ss|lsof|pgrep|kill|flock|ffmpeg)\s+\S` +
|
||||
"|`[^`]{3,}`)")
|
||||
|
||||
// densityThrRe ② 判据/阈值:比较符+数字、百分比、阈值词汇、数字+量词单位。
|
||||
densityThrRe = regexp.MustCompile(
|
||||
`(?:[≥≤><]=?\s*\d|\d+(?:\.\d+)?\s*[%%]|阈值|上限|下限|门槛|限额|配额|\bcap\b|\blimit\b|\bcritical\b` +
|
||||
`|\d+\s*(?:ms|毫秒|秒|分钟|小时|天|次|条|行|字|MB|GB|TB|端口|万|亿))`)
|
||||
|
||||
// densityCauseRe ③ 因果/为什么:因果连接词与根因词汇、箭头推导。
|
||||
densityCauseRe = regexp.MustCompile(
|
||||
`(?:因为|由于|导致|因此|所以|为了|从而|以致|以免|否则|根因|原因为|起因|源于|使得|⇒|->|=>)`)
|
||||
)
|
||||
|
||||
// DensitySatisfyCount 数一条事实满足三项判据中的几项(0~3)。
|
||||
// 纯函数:同一输入永远同一结果,可单测、零副作用。
|
||||
func DensitySatisfyCount(fact string) int {
|
||||
n := 0
|
||||
if densityCmdRe.MatchString(fact) {
|
||||
n++
|
||||
}
|
||||
if densityThrRe.MatchString(fact) {
|
||||
n++
|
||||
}
|
||||
if densityCauseRe.MatchString(fact) {
|
||||
n++
|
||||
}
|
||||
return n
|
||||
}
|
||||
|
||||
// DensityKeep 事实是否够格保持 Category="distilled":满足 ≥2 项。
|
||||
// 注意:本函数只在 DensityGateEnabled() 时被调用;关态下调用方保持 "distilled" 不动。
|
||||
func DensityKeep(fact string) bool {
|
||||
return DensitySatisfyCount(fact) >= 2
|
||||
}
|
||||
|
||||
// densityPromptAddendum 灰度开启时追加到提取 prompt 的信息量要求。
|
||||
// 只在 DensityGateEnabled() 时拼接 —— 关态 prompt 逐字节不变(AC5),
|
||||
// 旧 prompt 原文保留在 engine.go 的 instr/outFmt 常量里,一字未动。
|
||||
const densityPromptAddendum = `
|
||||
🔴 信息量要求(灰度生效中):
|
||||
- 同一事件/操作的所有关联要素(做什么、在哪、什么时候/多频繁、为什么、到什么程度/阈值)**合并成一条完整句子**,不要拆成多条各含一个要素的短句。
|
||||
- 目标:每条 FACT 是一句自洽、自足的陈述,读的人(或后续召回)不需要再拼其它条就能直接用。
|
||||
- 合并示例:原文碎片「巡检脚本是 disk-check.sh」「周期每 6 小时」「原因是磁盘写满会拖垮服务」
|
||||
→ 输出一条:「磁盘巡检每 6 小时执行一次 disk-check.sh,因为磁盘写满会拖垮服务。」
|
||||
而不是三条各含一个要素的短句。(示例只教写法,不要抄示例内容)
|
||||
- 判断"要素是否齐全":一条 FACT 若只有"是什么"而缺"怎么用/在哪/为何/程度",且原文有这些信息,就必须并进来。
|
||||
- 纯元信息行(如「该条记录日期为…」「文件保存在…」这类只有溯源没有知识载荷的)不要输出为事实。
|
||||
- 禁止为凑长度堆修饰词、重复同一事实、或把无关信息硬塞进一条:原文只有短句就照实提取,
|
||||
长是信息完整的结果,不是目标。宁可"完整但不长",也不要"长但不自洽"。
|
||||
`
|
||||
@@ -0,0 +1,53 @@
|
||||
// t_ab5b2461 信息密度判据单测(判据 = 交付里贴出的口径,测试即文档)。
|
||||
package distill
|
||||
|
||||
import "testing"
|
||||
|
||||
func TestDensitySatisfyCount(t *testing.T) {
|
||||
cases := []struct {
|
||||
name string
|
||||
fact string
|
||||
wantN int
|
||||
keep bool
|
||||
}{
|
||||
{"命令+阈值", "重启用 ~/.hermes/scripts/zhiyi-restart-with-lock.sh,健康检查 40 秒内必须返回 200,否则回滚", 3, true},
|
||||
{"路径+因果", "state.db 损坏时走 db-op-gate.sh,因为 gateway 运行期直接写活库会放大损坏面", 2, true},
|
||||
{"仅阈值", "该表写入量超过 500 条时告警", 1, false},
|
||||
{"仅因果", "因为昨晚断网所以任务没有跑完", 1, false},
|
||||
{"元信息行(全不中)", "该条经验记录的日期为 2026-10-25", 0, false},
|
||||
{"裸短句(全不中)", "用户授权助手自行决定", 0, false},
|
||||
{"阈值+因果", "磁盘余量 <5% 时触发清理,否则 backups 目录会把根分区写满", 2, true},
|
||||
{"路径单中", "配置文件在 /etc/ssh/sshd_config", 1, false},
|
||||
}
|
||||
for _, c := range cases {
|
||||
if n := DensitySatisfyCount(c.fact); n != c.wantN {
|
||||
t.Errorf("%s: DensitySatisfyCount(%q)=%d, want %d", c.name, c.fact, n, c.wantN)
|
||||
}
|
||||
if got := DensityKeep(c.fact); got != c.keep {
|
||||
t.Errorf("%s: DensityKeep(%q)=%v, want %v", c.name, c.fact, got, c.keep)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// AC5 结构证据:灰度段是**追加**,不改动既有 prompt 常量 ——
|
||||
// instr/outFmt 常量文本里不含「信息量要求」字样(关态 prompt 逐字节为旧文本)。
|
||||
func TestDensityAddendumOnlyAppended(t *testing.T) {
|
||||
if len(densityPromptAddendum) == 0 {
|
||||
t.Fatal("addendum 不能为空")
|
||||
}
|
||||
// 追加段自带独有锚点,供源内定位(防止误删)。
|
||||
if !contains(densityPromptAddendum, "禁止为凑长度堆修饰词") {
|
||||
t.Error("addendum 缺「禁为长度而长度」红线锚点")
|
||||
}
|
||||
}
|
||||
|
||||
func contains(s, sub string) bool {
|
||||
return len(s) >= len(sub) && (func() bool {
|
||||
for i := 0; i+len(sub) <= len(s); i++ {
|
||||
if s[i:i+len(sub)] == sub {
|
||||
return true
|
||||
}
|
||||
}
|
||||
return false
|
||||
})()
|
||||
}
|
||||
@@ -49,7 +49,8 @@ type DistillConfig struct {
|
||||
// 无递归无嵌套状态机;**从不返回 error**(最差空切片)。
|
||||
//
|
||||
// ok=false 表示未识别到任何有效行(调用方据此落到 JSON 兜底)。
|
||||
func ParseLineFormat(raw string) (facts []string, entities []Entity, scores FiveDScore, ok bool) {
|
||||
// t_2595b626:新增第 5 返回值 experiences(EXP 行;门控关恒 nil,行为与现状一致)。
|
||||
func ParseLineFormat(raw string) (facts []string, entities []Entity, scores FiveDScore, experiences []ExperienceRecord, ok bool) {
|
||||
var lines [][3]string // [0]=type, [1]=name(或fact内容或score), [2]=type(或score串)
|
||||
scanner := bufio.NewScanner(strings.NewReader(raw))
|
||||
scanner.Buffer(make([]byte, 0, 64*1024), 1<<20)
|
||||
@@ -64,6 +65,16 @@ func ParseLineFormat(raw string) (facts []string, entities []Entity, scores Five
|
||||
break
|
||||
}
|
||||
switch {
|
||||
// 🔴 EXP 分支排在最前:门控关 ⇒ 条件短路不可达,EXP 行走 default「垃圾行
|
||||
// 静默跳过」,与现状逐字一致(AC1)。门控开 ⇒ 解析 + 单行合法性闸。
|
||||
// EXP 不进 lines[]:它不是 FACT/ENTITY/SCORE,不参与截断启发式;
|
||||
// END 之后的行由 seenEnd break 统一忽略。
|
||||
case experienceGateEnabled && strings.HasPrefix(line, "EXP|"):
|
||||
// t_2595b626 经验层
|
||||
if exp := ParseExperienceLine(line); exp != nil {
|
||||
experiences = append(experiences, *exp)
|
||||
ok = true
|
||||
}
|
||||
case line == "END" || strings.HasPrefix(line, "END|"):
|
||||
seenEnd = true
|
||||
case strings.HasPrefix(line, "FACT|"):
|
||||
@@ -161,7 +172,8 @@ func ParseLineFormat(raw string) (facts []string, entities []Entity, scores Five
|
||||
ok = true
|
||||
}
|
||||
}
|
||||
return facts, entities, scores, ok
|
||||
// experiences 在扫描循环内已填充(门控开且行合法)
|
||||
return facts, entities, scores, experiences, ok
|
||||
}
|
||||
|
||||
// isValidScoreField 判一个 SCORE 字段是否为合法数值(0.0~1.0 浮点)。
|
||||
@@ -225,7 +237,7 @@ func logEchoStrip(path string, st EchoStats) {
|
||||
}
|
||||
|
||||
func parseDistillOutput(raw string) LLMResponse {
|
||||
facts, entities, scores, ok := ParseLineFormat(raw)
|
||||
facts, entities, scores, experiences, ok := ParseLineFormat(raw)
|
||||
if ok {
|
||||
var names []string
|
||||
for _, en := range entities {
|
||||
@@ -240,6 +252,9 @@ func parseDistillOutput(raw string) LLMResponse {
|
||||
Facts: facts,
|
||||
Entities: names,
|
||||
})
|
||||
// t_2595b626:EXP 行在 ParseExperienceLine 已过单行合法性闸;落库前还有
|
||||
// ExperienceGrounded 接地闸兜底(api/server.go)。
|
||||
resp.Experiences = experiences
|
||||
logEchoStrip("line", st)
|
||||
return resp
|
||||
}
|
||||
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user