Compare commits
10
Commits
main
..
observer-kb
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
4d64e4a618 | ||
|
|
3f19ad5d93 | ||
|
|
bd68b662b7 | ||
|
|
3cf000ccf3 | ||
|
|
1dcbe8e04c | ||
|
|
2189a6dbee | ||
|
|
bf033b2d9d | ||
|
|
0756075c6d | ||
|
|
8ca4ba5717 | ||
|
|
c49b30053b |
@@ -1,42 +0,0 @@
|
|||||||
# Real Archon workflow on the Lakehouse repo, fully via our gateway.
|
|
||||||
# Three Pi nodes, each fires LLM → /v1/chat/completions → OpenRouter,
|
|
||||||
# every call lands a Langfuse trace + observer event.
|
|
||||||
#
|
|
||||||
# Read-only (allowed_tools: [read]). Don't pass --branch / leave
|
|
||||||
# --no-worktree at runtime so Archon doesn't try to create a worktree.
|
|
||||||
name: lakehouse-architect-review
|
|
||||||
description: 'Pi reviews Lakehouse architecture in 3 turns through our gateway.'
|
|
||||||
provider: pi
|
|
||||||
model: openrouter/x-ai/grok-4.1-fast
|
|
||||||
|
|
||||||
nodes:
|
|
||||||
- id: shape
|
|
||||||
prompt: |
|
|
||||||
Read these files and answer in 3 short bullets describing the
|
|
||||||
architectural shape of Lakehouse:
|
|
||||||
- /home/profit/lakehouse/Cargo.toml
|
|
||||||
- /home/profit/lakehouse/lakehouse.toml
|
|
||||||
- /home/profit/lakehouse/docs/MODE_RUNNER_TUNING_PLAN.md
|
|
||||||
Be terse. No preamble.
|
|
||||||
allowed_tools: ["read"]
|
|
||||||
effort: low
|
|
||||||
idle_timeout: 90000
|
|
||||||
|
|
||||||
- id: weakness
|
|
||||||
prompt: |
|
|
||||||
Read /home/profit/lakehouse/crates/gateway/src/v1/mod.rs and
|
|
||||||
identify ONE real weakness or risk. Cite file:line. One paragraph.
|
|
||||||
allowed_tools: ["read"]
|
|
||||||
effort: low
|
|
||||||
idle_timeout: 90000
|
|
||||||
depends_on: [shape]
|
|
||||||
|
|
||||||
- id: improvement
|
|
||||||
prompt: |
|
|
||||||
Based on the prior weakness ($weakness.output), propose ONE
|
|
||||||
surgical improvement (≤6 lines of Rust). Show the patch as
|
|
||||||
`old_string` and `new_string` in markdown code blocks.
|
|
||||||
allowed_tools: []
|
|
||||||
effort: low
|
|
||||||
idle_timeout: 90000
|
|
||||||
depends_on: [weakness]
|
|
||||||
-46
@@ -4,49 +4,3 @@
|
|||||||
.env
|
.env
|
||||||
__pycache__/
|
__pycache__/
|
||||||
*.pyc
|
*.pyc
|
||||||
|
|
||||||
# Headshot pool — binary face JPGs are fetched by scripts/staffing/fetch_face_pool.py
|
|
||||||
# (synthetic StyleGAN, ~580MB for 1000 faces). Manifest + fetch script are tracked.
|
|
||||||
data/headshots/face_*.jpg
|
|
||||||
data/headshots/_thumbs/
|
|
||||||
# ComfyUI on-demand generated portraits (per-worker unique). Cached on first
|
|
||||||
# request; fully regeneratable via /headshots/generate/:key.
|
|
||||||
data/headshots_gen/
|
|
||||||
|
|
||||||
# Runtime data — all regeneratable from inputs or accumulated by daemons.
|
|
||||||
# Anything under data/_<name>/ is internal state (auditor outputs, KB caches,
|
|
||||||
# pathway memory snapshots, HNSW trial results, etc.). Anything under
|
|
||||||
# data/datasets/ or data/vectors/ is generated by ingest/index pipelines.
|
|
||||||
data/_*/
|
|
||||||
data/lance/
|
|
||||||
data/datasets/
|
|
||||||
data/vectors/
|
|
||||||
data/demo/
|
|
||||||
data/evidence/
|
|
||||||
data/face_test/
|
|
||||||
data/headshots_role_pool/
|
|
||||||
data/icons_pool/
|
|
||||||
data/scored-runs/
|
|
||||||
data/workspaces/
|
|
||||||
data/catalog/
|
|
||||||
data/**/*.bak-*
|
|
||||||
data/**/*.pre-*-bak
|
|
||||||
|
|
||||||
# Logs
|
|
||||||
logs/
|
|
||||||
|
|
||||||
# Build artifacts
|
|
||||||
node_modules/
|
|
||||||
exports/
|
|
||||||
mcp-server/data/
|
|
||||||
|
|
||||||
# Per-run distillation reports (timestamp-named); keep the parent dir tracked
|
|
||||||
# via .gitkeep if needed but don't carry every batch's report set.
|
|
||||||
reports/distillation/[0-9]*/
|
|
||||||
reports/distillation/*-*-*-*-*/
|
|
||||||
|
|
||||||
# Test scratch — scratchpads, traces, sessions are regenerated each run.
|
|
||||||
# PRD/scenario fixtures stay tracked (they ARE the test).
|
|
||||||
tests/agent_test/_*
|
|
||||||
tests/agent_test/sessions/
|
|
||||||
tests/real-world/runs/
|
|
||||||
|
|||||||
@@ -1,20 +0,0 @@
|
|||||||
{
|
|
||||||
"mcpServers": {
|
|
||||||
"lakehouse": {
|
|
||||||
"command": "bun",
|
|
||||||
"args": ["run", "/home/profit/lakehouse/mcp-server/index.ts"],
|
|
||||||
"env": {
|
|
||||||
"LAKEHOUSE_URL": "http://localhost:3100",
|
|
||||||
"MCP_TRANSPORT": "stdio"
|
|
||||||
}
|
|
||||||
},
|
|
||||||
"gitea": {
|
|
||||||
"command": "bunx",
|
|
||||||
"args": ["gitea-mcp"],
|
|
||||||
"env": {
|
|
||||||
"GITEA_HOST": "https://git.agentview.dev",
|
|
||||||
"GITEA_ACCESS_TOKEN": "SET_ME_FROM_GITEA_UI_USER_SETTINGS_APPLICATIONS"
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
Generated
+403
-3785
File diff suppressed because it is too large
Load Diff
+1
-6
@@ -12,10 +12,6 @@ members = [
|
|||||||
"crates/journald",
|
"crates/journald",
|
||||||
"crates/gateway",
|
"crates/gateway",
|
||||||
"crates/ui",
|
"crates/ui",
|
||||||
"crates/lance-bench",
|
|
||||||
"crates/vectord-lance",
|
|
||||||
"crates/truth",
|
|
||||||
"crates/validator",
|
|
||||||
]
|
]
|
||||||
|
|
||||||
[workspace.dependencies]
|
[workspace.dependencies]
|
||||||
@@ -49,5 +45,4 @@ csv = "1"
|
|||||||
lopdf = "0.35"
|
lopdf = "0.35"
|
||||||
encoding_rs = "0.8"
|
encoding_rs = "0.8"
|
||||||
instant-distance = "0.6"
|
instant-distance = "0.6"
|
||||||
tokio-postgres = { version = "0.7", features = ["with-serde_json-1", "with-chrono-0_4", "with-uuid-1"] }
|
tokio-postgres = { version = "0.7", features = ["with-serde_json-1", "with-chrono-0_4"] }
|
||||||
mysql_async = { version = "0.34", default-features = false, features = ["minimal"] }
|
|
||||||
|
|||||||
@@ -1,269 +0,0 @@
|
|||||||
# STATE OF PLAY — Lakehouse
|
|
||||||
|
|
||||||
**Last verified:** 2026-05-02 evening CDT
|
|
||||||
**Verified by:** live probe (smoke 9/9, parity 32/32, gateway restarted), not memory.
|
|
||||||
|
|
||||||
> **Read this FIRST.** When the user says "we're working on lakehouse," they mean the working code captured below — NOT what `git log` framed as "the cutover" or what memory snapshots from 2 days ago suggest. If memory contradicts this file, this file wins. Update it when something is verified working — not when a phase finishes.
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
## WHAT LANDED 2026-05-01 → 2026-05-02 (10 commits this wave)
|
|
||||||
|
|
||||||
| Commit | What | Verified |
|
|
||||||
|---|---|---|
|
|
||||||
| `5d30b3d` | lance: auto-build doc_id btree in `lance_migrate` handler | doc-fetch ~5ms (was ~100ms full scan) on scale_test_10m |
|
|
||||||
| `044650a` | lance-bench: same scalar build post-IVF (matches gateway) | cargo check clean |
|
|
||||||
| `7594725` | lance: 4-pack — `sanitize_lance_err` + 7 unit tests + 9-probe smoke + 10M re-bench | smoke 9/9 PASS, tests 7/7 PASS |
|
|
||||||
| `98b6647` | gateway: `IterateResponse.trace_id` echoed; session_log_path enabled | parity probes see one unified JSONL |
|
|
||||||
| `57bde63` | gateway: trace-id propagation + coordinator session JSONL (Rust parity with Go wave) | session_log_parity 4/4 |
|
|
||||||
| `ba928b1` | aibridge: drop Python sidecar from hot path; AiClient → direct Ollama | aibridge tests 32/32 PASS, /ai/embed live 768d |
|
|
||||||
| `654797a` | gateway: pub `extract_json` + `parity_extract_json` bin | extract_json_parity 12/12 |
|
|
||||||
| `c5654d4` | docs: pointer to `golangLAKEHOUSE/docs/ARCHITECTURE_COMPARISON.md` | — |
|
|
||||||
| `150cc3b` | aibridge: LRU embed cache, 236× RPS warm (78ms → 129us p50) | load test |
|
|
||||||
| `9eed982` | mcp-server: /_go/* pass-through for G5 cutover slice | — |
|
|
||||||
| `6e34ef7` | gitignore: stop tracking 100+ runtime ephemera (data/_*, lance, logs, node_modules) | untracked dropped 100+ → 0 |
|
|
||||||
| `41b0a99` | chore: add 33 real items that were sitting untracked (scripts, scenarios, kimi reports, dev UIs) | clean working tree |
|
|
||||||
|
|
||||||
**Cross-runtime parity (post-this-wave):** 32/32 across 5 probes — `validator(6/6) + extract_json(12/12) + session_log(4/4) + materializer(2/2) + embed(8/8)`. Run `cd /home/profit/golangLAKEHOUSE && for p in scripts/cutover/parity/*.sh; do bash "$p"; done` to re-verify.
|
|
||||||
|
|
||||||
**Lance backend (was untested 5 days ago, now gauntlet-ready):**
|
|
||||||
- `cargo test -p vectord-lance --release` → 7/7 PASS
|
|
||||||
- `./scripts/lance_smoke.sh` → 9/9 PASS against live gateway
|
|
||||||
- `reports/lance_10m_rebench_2026-05-02.md` — search warm ~20ms / cold ~46ms median, doc-fetch ~5ms post-btree
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
## VERIFIED WORKING RIGHT NOW
|
|
||||||
|
|
||||||
### The client demo (Staffing Co-Pilot)
|
|
||||||
|
|
||||||
**Public URL:** `https://devop.live/lakehouse/` — 200, "Staffing Co-Pilot" (159 KB SPA, leaflet maps, dark theme).
|
|
||||||
**Local URL:** `http://localhost:3700/` — same page, served by `mcp-server/index.ts` (PID 1271, started 09:48 CDT today).
|
|
||||||
|
|
||||||
**The staffers console** (the one the client was thoroughly impressed with):
|
|
||||||
- `https://devop.live/lakehouse/console` — 200, "Lakehouse — What Your Staffing System Would Do" (26 KB)
|
|
||||||
- Pulls project index via `/api/catalog/datasets` (36 datasets) + playbook memory via `/api/vectors/playbook_memory/stats` (4,701 entries with embeddings, real ops like *"fill: Maintenance Tech x2 in Milwaukee, WI"*)
|
|
||||||
|
|
||||||
Client-visible flow that works end-to-end on the public URL:
|
|
||||||
|
|
||||||
| Endpoint | Sample output |
|
|
||||||
|---|---|
|
|
||||||
| `GET /api/catalog/datasets` | 36 datasets indexed: timesheets 1M, call_log 800K, workers_500k 500K, email_log 500K, workers_100k 100K, candidates 100K, placements 50K, job_orders 15K, successful_playbooks_live 2,077 |
|
|
||||||
| `GET /api/vectors/playbook_memory/stats` | 4,701 fill operations with embeddings |
|
|
||||||
| `GET /system/summary` | 36 datasets, 2.98M rows, 60 indexes, 500K workers loaded, 1K candidates |
|
|
||||||
| `POST /intelligence/staffing_forecast` | 744 Production Workers needed in 30d, 11,281 bench (4,687 reliable), coverage 1,444%, risk=ok. Same for Electrician (need 32, bench 2,440) and Maintenance Tech (need 17, bench 5,004). |
|
|
||||||
| `POST /intelligence/permit_contracts` | permit `3442956` $500K → 3 Production Workers, 886-candidate pool, 95% fill, $36K gross. 5 more Chicago permits with 8 workers each, same pool, 95% fill, $96K each. |
|
|
||||||
| `POST /intelligence/market` | major Chicago permits ranked: $730M O'Hare, $615M 307 N Michigan, $580M casino, $445M Loop transit (real geo coords). |
|
|
||||||
| `POST /intelligence/permit_entities` | architects + contractors from permit contacts (e.g. "KACPRZYNSKI, ANDY", "SLS ELECTRICAL SERVICE"). |
|
|
||||||
| `POST /intelligence/activity` + `/intelligence/arch_signals` + `/intelligence/chat` | all 200 |
|
|
||||||
|
|
||||||
The demo tells the story: *"upcoming Chicago contracts → workers needed → coverage from the bench → architects/contractors involved → revenue and margin."* That's the "live data + anticipating contracts + complete workflow" pitch — working as of right now.
|
|
||||||
|
|
||||||
### Backend, verified live this session
|
|
||||||
|
|
||||||
| Surface | State |
|
|
||||||
|---|---|
|
|
||||||
| Gateway `:3100` | up, 4 providers configured, `/v1/health` 200 with 500K workers loaded |
|
|
||||||
| MCP server `:3700` (Co-Pilot demo) | up, all `/intelligence/*` endpoints respond |
|
|
||||||
| VCP UI `:3950` | started this session, `/data/*` 200, real numbers |
|
|
||||||
| Observer `:3800` | ring full (2,000/2,000) — older events evicted, query Langfuse for 24h-ago state |
|
|
||||||
| Sidecar `:3200` | up |
|
|
||||||
| Langfuse `:3001` | recording, `gw:/log` + `v1.chat:openrouter` traces visible |
|
|
||||||
| LLM Team UI `:5000` | up, only `extract` mode registered |
|
|
||||||
| OpenCode fleet | **40 models reachable through one `sk-*` key** (verified live `GET https://opencode.ai/zen/v1/models`) |
|
|
||||||
|
|
||||||
OpenCode catalog (live):
|
|
||||||
- Claude: opus-4-7, opus-4-6, opus-4-5, opus-4-1, sonnet-4-6, sonnet-4-5, sonnet-4, haiku-4-5
|
|
||||||
- GPT-5: 5.5-pro, 5.5, 5.4-pro, 5.4, 5.4-mini, 5.4-nano, 5.3-codex-spark, 5.3-codex, 5.2, 5.2-codex, 5.1-codex-max, 5.1-codex, 5.1-codex-mini, 5.1, 5-codex, 5-nano, 5
|
|
||||||
- Gemini: 3.1-pro, 3-flash
|
|
||||||
- GLM: 5.1, 5
|
|
||||||
- Minimax: m2.7, m2.5
|
|
||||||
- Kimi: k2.6, k2.5
|
|
||||||
- Qwen: 3.6-plus, 3.5-plus
|
|
||||||
- Other: BIG-PKL (was a typo-prone name in the catalog, model id starts with "big-pkl-something")
|
|
||||||
- Free tier: minimax-m2.5-free, hy3-preview-free, ling-2.6-flash-free, trinity-large-preview-free
|
|
||||||
|
|
||||||
### The substrate (frozen — do not re-architect)
|
|
||||||
|
|
||||||
- Distillation v1.0.0 at tag `e7636f2` — **145/145 bun tests pass, 22/22 acceptance, 16/16 audit-full**
|
|
||||||
- Output: `data/_kb/distilled_{facts,procedures,config_hints}.jsonl` + `data/vectors/distilled_{factual,procedural,config_hint}_v20260423102847.parquet`
|
|
||||||
- Auditor cross-lineage: Kimi K2.6 ↔ Haiku 4.5 alternation, Opus auto-promote on diffs >100k chars, **per-PR cap=3 with auto-reset on new head SHA**
|
|
||||||
- Pathway memory: 88 traces, 11/11 successful replays (probation gate crossed)
|
|
||||||
- Mode runner: 5 native modes; `codereview_isolation` is default; composed-corpus auto-downgrade verified Apr 26 (composed lost 5/5 vs isolation, p=0.031)
|
|
||||||
|
|
||||||
### Matrix indexer
|
|
||||||
|
|
||||||
30+ live corpora including:
|
|
||||||
- 5 versions of `workers_500k_v1..v9` (50K embedded chunks each)
|
|
||||||
- 11 batched 2K-row shards `w500k_b3..b17`
|
|
||||||
- `chicago_permits_v1` (3,420), `resumes_100k_v2` (100K candidates), `ethereal_workers_v1` (10K)
|
|
||||||
- `lakehouse_arch_v1` (2,119), `lakehouse_symbols_v1` (2,470), `lakehouse_answers_v1` (1,269), `scrum_findings_v1` (1,260)
|
|
||||||
- `kb_team_runs_v1` (12,693) + `kb_team_runs_agent` (4,407) — LLM-team play history embedded
|
|
||||||
- `distilled_factual_v20260423102507` (8) — distillation output
|
|
||||||
|
|
||||||
### Code health
|
|
||||||
|
|
||||||
- `cargo check --workspace` → **0 warnings, 0 errors**
|
|
||||||
- `bun test auditor + tests/distillation` → **145/145 pass**
|
|
||||||
- `ui/server.ts` + `auditor.ts` bundle clean
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
## DO NOT RELITIGATE
|
|
||||||
|
|
||||||
- **PR #11 is merged into `origin/main` as `ed57eda`** — do not "still need to merge PR #11."
|
|
||||||
- **Distillation tag `distillation-v1.0.0` at `e7636f2` is FROZEN** — do not re-architect schemas, scorer rules, audit fixtures.
|
|
||||||
- **Kimi forensic HOLD verdict (2026-04-27) was 2/8 false + 6/8 latent** — do not re-debate, see `reports/kimi/audit-last-week-full.md`.
|
|
||||||
- **`candidates_safe` `vertical` column bug** — fixed at catalog metadata layer in commit `c3c9c21`. Do not "discover" it again.
|
|
||||||
- **Decisions A/B/C/D from `synthetic-data-gap-report.md`** — all four scripts shipped today (`d56f08e`, `940737d`, `c3c9c21`). Do not "ask J for approval."
|
|
||||||
- **`workers_500k.phone` type fixup** — already string. The fixup script is idempotent; running it is a no-op.
|
|
||||||
- **`client_workerskjkk` typo dataset** — was breaking every SQL query (catalog had it registered, file didn't exist). Removed via `DELETE /catalog/datasets/by-name/client_workerskjkk` this session. Do not re-add. Adding a startup gate that errors on unrecognized parquet names is the long-term fix per now.md Step 2C.
|
|
||||||
- **Python sidecar dropped from hot path 2026-05-02 (`ba928b1`)** — AiClient calls Ollama directly. Do not "wire python embedding back in." `lab_ui.py` + `pipeline_lab.py` keep running as dev-only UIs (not on the runtime path).
|
|
||||||
- **Lance backend gauntlet (2026-05-02)** — sanitizer over all 5 routes, 7 unit tests, 9-probe smoke, 10M re-bench. The `doc_id` btree auto-builds inside `lance_migrate` AND `lance-bench`. Do not "discover" the missing scalar index again or the leaked filesystem paths in error bodies.
|
|
||||||
- **Cross-runtime parity = 32/32** across 5 probes in `golangLAKEHOUSE/scripts/cutover/parity/`. Do not "build a parity probe for X" without checking — validator, extract_json, session_log, materializer, and embed are all already covered.
|
|
||||||
- **Decisions tracker is `golangLAKEHOUSE/docs/ARCHITECTURE_COMPARISON.md`** — single living source of truth for cross-runtime decisions. As of 2026-05-02 it has 0 `_open_` code work items; only 2 strategic items left (Lance vs Parquet+HNSW-with-spilling, Go-vs-Rust primary cutover).
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
## FIXES MADE THIS SESSION (2026-04-27 evening)
|
|
||||||
|
|
||||||
1. **`crates/gateway/src/v1/iterate.rs:93`** — `state` → `_state` (cleared the one cargo warning).
|
|
||||||
2. **`lakehouse-ui.service` (Dioxus)** — disabled. Was failing 7,242 times against a missing `target/dx/ui/debug/web/public` build dir. `systemctl stop && disable`.
|
|
||||||
3. **VCP UI on `:3950`** — started `bun run ui/server.ts` (PID 1162212, log `/tmp/lakehouse_ui.log`). `/data/*` endpoints now 200 with real data.
|
|
||||||
4. **`client_workerskjkk` catalog entry** — `DELETE /catalog/datasets/by-name/client_workerskjkk` removed the dead manifest. **This was the actual root cause** of `/system/summary` reporting `workers_500k_rows: 0` and the demo showing zero bench. Every SQL query was failing schema inference on the missing file before reaching its target table. Fixed → `workers_500k_rows: 500000`, `candidates_rows: 1000`, demo coverage flipped from "critical 0%" to actual percentages on devop.live/lakehouse.
|
|
||||||
|
|
||||||
## FIXES MADE THIS SESSION (2026-04-28 early — face pool)
|
|
||||||
|
|
||||||
5. **Synthetic StyleGAN face pool — 1000 faces, gender+race+age tagged.** `scripts/staffing/fetch_face_pool.py` fetches from thispersondoesnotexist.com; `scripts/staffing/tag_face_pool.py --min-age 22` runs deepface and excludes minors. `data/headshots/manifest.jsonl` now has gender (494 men / 458 women), race (caucasian 662 · east_asian 128 · hispanic 86 · middle_eastern 59 · black 14 · south_asian 3), age, and 48 minor exclusions. Server pool = 952 servable faces.
|
|
||||||
6. **`mcp-server/index.ts:1308` `/headshots/:key` route** — gender×race×age intersection bucketing with graceful fallback (gender-only → all). Same key always returns same face; different keys spread evenly.
|
|
||||||
7. **`/headshots/_thumbs/` pre-resized 384×384 webp** (60× smaller: 587KB → ~11KB). Without this, 40-card grids overran Chrome's parallel-connection budget and ~75% of tiles never finished decoding. Generated via parallel ffmpeg (`xargs -P 8`); `.gitignore`d.
|
|
||||||
8. **`mcp-server/search.html` + `console.html`** — dropped `img.loading='lazy'`. With 11KB thumbs, eager load is cheap (~500KB for 50 cards) and avoids the off-screen race that lazy decode produced.
|
|
||||||
9. **ComfyUI on-demand uniqueness — `serve_imagegen.py:32`** added `seed` to `_cache_key()` (was caching by prompt only — 3 different worker seeds collapsed to 1 cached image). Verified: seed=839185194/195/196 → 3 distinct md5s.
|
|
||||||
10. **`mcp-server/index.ts:1234` `/headshots/generate/:key`** — ComfyUI hot-path that derives a deterministic-per-worker seed via djb2-style hash; cold ~1.5s, cached ~1ms. Worker prompt format: `professional corporate headshot portrait of a {age}-year-old {race} {gender}, {role}, neutral expression, plain studio background, soft natural lighting, sharp focus, photorealistic, dslr`. Cache at `data/headshots_gen/` (gitignored, regeneratable).
|
|
||||||
11. **Confidence-default name resolution** in `search.html` — `genderFor()` and `guessEthnicityFromFirstName()` lookup tables (FEMALE_NAMES, MALE_NAMES, NAMES_HISPANIC, NAMES_BLACK, NAMES_SOUTH_ASIAN, NAMES_EAST_ASIAN, NAMES_MIDDLE_EASTERN). Xavier → man+hispanic, Aisha → woman+black, etc. Every worker resolves to a face-pool bucket.
|
|
||||||
|
|
||||||
End-to-end verified: playwright run on `https://devop.live/lakehouse/?q=forklift+operators+IL` → 21/21 cards loaded, 0 broken, all 384×384 webp thumbs.
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
## OPEN — but not blocking the demo
|
|
||||||
|
|
||||||
| Item | What | When to act |
|
|
||||||
|---|---|---|
|
|
||||||
| `modes.toml` `staffing_inference.matrix_corpus` | still says `workers_500k_v8`. v9 in vector index is from Apr 17 (raw-sourced, not safe-view). The new `build_workers_v9.sh` rebuilds from `workers_safe`. | Run when you have 30+ min for the rebuild. |
|
|
||||||
| Open PRs #6, #7, #10 | sitting since Apr 22-24, auditor verdicts on disk at `data/_auditor/kimi_verdicts/{6,7,10}-*.json` | Read verdicts, decide reconcile/close. |
|
|
||||||
| `test/enrich-prd-pipeline` branch | 35 unmerged commits, includes more-evolved auditor/inference.ts (666 vs main's 580 lines), curation+fact-extractor wiring | Reconcile or formally archive — see `memory/project_unmerged_architecture_work.md`. |
|
|
||||||
| `federation-hnsw-trials` stash | Lance + S3/MinIO prototype, `aws-config` crate added, 708 insertions | Phase B from EXECUTION_PLAN.md — revisit when Parquet vector ceiling actually hurts. |
|
|
||||||
| `candidates` manifest drift | manifest 100K vs SQL 1K. Cosmetic. | Run a metadata resync if it matters. |
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
## RUNTIME CHEATSHEET
|
|
||||||
|
|
||||||
```bash
|
|
||||||
# Verify the demo (public + local both work)
|
|
||||||
curl -sS https://devop.live/lakehouse/ # Co-Pilot HTML
|
|
||||||
curl -sS https://devop.live/lakehouse/console # staffers console
|
|
||||||
curl -sS -X POST https://devop.live/lakehouse/intelligence/staffing_forecast \
|
|
||||||
-d '{}' -H 'content-type: application/json' \
|
|
||||||
| jq '.forecast[] | {role, demand_workers, bench_total, coverage_pct, risk}'
|
|
||||||
|
|
||||||
# Restart sequence (after Rust changes)
|
|
||||||
sudo systemctl restart lakehouse.service # gateway :3100
|
|
||||||
sudo systemctl restart lakehouse-auditor # auditor daemon
|
|
||||||
sudo systemctl restart lakehouse-observer # observer :3800
|
|
||||||
# UI bun on :3950 is NOT systemd-managed (lakehouse-ui.service is disabled).
|
|
||||||
# Restart manually: kill <pid>; nohup bun run ui/server.ts > /tmp/lakehouse_ui.log 2>&1 &
|
|
||||||
|
|
||||||
# Health checks
|
|
||||||
curl -sS http://localhost:3100/v1/health | jq # workers_count, providers
|
|
||||||
curl -sS http://localhost:3100/vectors/pathway/stats | jq
|
|
||||||
curl -sS http://localhost:3100/v1/usage | jq # since-restart cost
|
|
||||||
curl -sS http://localhost:3700/system/summary | jq # dataset counts
|
|
||||||
```
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
## VISION — what we're actually building (not what's done)
|
|
||||||
|
|
||||||
J's framing for the legacy staffing company:
|
|
||||||
|
|
||||||
- Pull live data, anticipate contracts based on Chicago permits → real architect/contractor associations, headcount, time period, money, scope.
|
|
||||||
- Hybrid + memory index → search large corpora cheaply.
|
|
||||||
- Email comes in → verify against contract; SMS comes in → alert when index changes.
|
|
||||||
- Real-time.
|
|
||||||
- Invent metrics nobody else has using the hybrid index.
|
|
||||||
- Next stage: workers download an app → geolocation clock-in → automatic responsiveness measurement, no user effort, with incentives for using it.
|
|
||||||
- Find people getting certificates (passive cert tracking).
|
|
||||||
- Pull union data → bring contracts that work for **employees**, not just employers.
|
|
||||||
- All metrics visible, nothing hidden, value-aligned with what each side actually needs.
|
|
||||||
|
|
||||||
If a future session is shaving away from this vision toward "fix the cutover" or "land Phase X," the vision wins. Phases are scaffolding for the vision, not the goal.
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
## CURRENT PLAN — fix the demo for the legacy staffing client
|
|
||||||
|
|
||||||
Built from playwright audit of the live demo (2026-04-27 evening). Each item ends in something the client can SEE, not internal cleanups.
|
|
||||||
|
|
||||||
**Demo state is anchored by git tag `demo-2026-04-27`** (commit `ed57eda`, the merge of PR #11). To restore code state: `git checkout demo-2026-04-27`. To restore runtime state: `DELETE /catalog/datasets/by-name/client_workerskjkk` (catalog hot-fix is not in git).
|
|
||||||
|
|
||||||
### P1 — Search box that actually filters (highest visible impact)
|
|
||||||
|
|
||||||
**Problem:** typing in `#sq` and pressing Enter fires `POST /intelligence/chat` with body `{"message":"<query>"}`. The state (`#sst`) and role (`#srl`) selects are ignored — never sent in the body. So every search returns a generic chat completion, never a SQL+vector hybrid filter against `workers_500k`. That is the "cached/generic response" the client sees.
|
|
||||||
|
|
||||||
**Fix:** in `mcp-server/search.html`, change the search-submit handler to call the real worker search endpoint with `{query, state, role, top_k}`. The MCP `search_workers` tool surface already exists; route the form there. Render returned worker rows in the existing card grid.
|
|
||||||
|
|
||||||
**Done when:** typing "forklift" + state IL + role "Forklift Operator" returns ≤ top_k IL Forklift Operators, and changing state to WI returns different workers.
|
|
||||||
|
|
||||||
### P2 — Contractor-name click → `/contractor` profile page
|
|
||||||
|
|
||||||
**Problem:** clicking a contractor name in any rendered card stays on `/lakehouse/`. URL doesn't change.
|
|
||||||
|
|
||||||
**Fix:** wrap contractor names in `<a href="/contractor?name=<encoded>">`. The page `mcp-server/contractor.html` (14.8 KB, "Contractor Profile · Staffing Co-Pilot") already exists at `/contractor` and the data endpoint `/intelligence/contractor_profile` already returns rich data.
|
|
||||||
|
|
||||||
**Then check contractor.html actually shows:** full history of every record the database has on that contractor + heat map of locations underneath + relevant info (per J 2026-04-27). If the page is incomplete, finish it. Otherwise just wire the link.
|
|
||||||
|
|
||||||
**Done when:** clicking "KACPRZYNSKI, ANDY" opens a profile with: every Chicago permit they're contact_1 or contact_2 on, a leaflet map with markers for each address, and any matched workers from prior placements at their sites.
|
|
||||||
|
|
||||||
### P3 — Substrate signal at the bottom shows the right numbers
|
|
||||||
|
|
||||||
**Problem:** J reports the bottom panel says "playbook memory empty, 80 traces 0 replies." Reality from the live endpoints: `/api/vectors/playbook_memory/stats` = 4,701 entries with embeddings; `/vectors/pathway/stats` = 88 traces, 11/11 replays.
|
|
||||||
|
|
||||||
**Fix:** find the renderer in search.html that builds the substrate signal panel; verify it's hitting the right endpoints and reading the right keys; fix shape mismatches.
|
|
||||||
|
|
||||||
**Done when:** bottom panel shows real numbers (4,701 playbooks, 88 traces, 11/11 replays) and references at least one specific recent operation from the playbook stats sample.
|
|
||||||
|
|
||||||
### P4 — Top nav reflects today's architecture
|
|
||||||
|
|
||||||
**Problem:** Walkthrough/Architecture/Spec/Onboard/Alerts/Workspaces tabs all return 200 but content is from old architecture. Doesn't mention: gateway scratchpad, memory indexer, ranker, mode runner, OpenCode 40-model fleet, distillation substrate, auditor cross-lineage.
|
|
||||||
|
|
||||||
**Fix:** rewrite `mcp-server/proof.html` (or add a single new page "What's running" that replaces Architecture+Spec) to describe what's actually shipped as of `demo-2026-04-27`. Keep one architecture page, drop redundancy. Either complete or hide Onboard/Alerts/Workspaces — J's call which.
|
|
||||||
|
|
||||||
**Done when:** the architecture page tells a non-technical reader, in 2 minutes, what each piece does in coordinator-relatable terms ("intern that read every email", not "3-stage adversarial inference pipeline").
|
|
||||||
|
|
||||||
### P5 — Caching for the project-index build_signal (J flagged unfinished)
|
|
||||||
|
|
||||||
**Problem:** "we never finished our caching for project index build signal it's not pulling new information." Need to find what `build_signal` refers to. Likely a scrum/auditor signal that should rebuild the `lakehouse_arch_v1` corpus on commit but isn't wired to.
|
|
||||||
|
|
||||||
**Fix:** identify the build-signal pipeline (likely in `auditor/` or `crates/vectord/`), wire its emit to a corpus rebuild, verify by making a test commit and watching the new chunk appear in `/vectors/indexes` for `lakehouse_arch_v1`.
|
|
||||||
|
|
||||||
**Done when:** committing a new file to `crates/` causes `lakehouse_arch_v1` chunk_count to increase within N minutes.
|
|
||||||
|
|
||||||
### P0 — Anchor the demo state (DONE)
|
|
||||||
|
|
||||||
Tagged `ed57eda` as `demo-2026-04-27`. Future sessions: `git checkout demo-2026-04-27` to land in this exact code state.
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
## EXECUTION ORDER
|
|
||||||
|
|
||||||
1. **P1 first** — biggest visible bug, ~30-60 min
|
|
||||||
2. **P2 next** — contractor click is the second-biggest "doesn't work" the client sees, ~20 min if profile is mostly done
|
|
||||||
3. **P3** — small fix, big "looks alive" win
|
|
||||||
4. **P4** — biggest scope; might split across sessions
|
|
||||||
5. **P5** — feature work, only after the visible bugs are fixed
|
|
||||||
|
|
||||||
Each item commits independently with the format `demo: P<n> — <one-line>` so the commit log doubles as a progress journal. After each merge to main, re-tag `demo-latest` to point at the new HEAD.
|
|
||||||
|
|
||||||
Stop here and let J pick which item to start with. Do not silently extend scope.
|
|
||||||
@@ -0,0 +1,183 @@
|
|||||||
|
# PRD: Observer Knowledge Base
|
||||||
|
|
||||||
|
**Status:** Active — extraction pipeline proven, needs multi-pass processing via LLM Team modes
|
||||||
|
**Created:** 2026-03-28
|
||||||
|
**Owner:** J
|
||||||
|
**Branch:** `observer-kb`
|
||||||
|
**Parent:** Lakehouse core (crates/)
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
## Problem
|
||||||
|
|
||||||
|
AI conversations generate massive amounts of knowledge that's lost to context windows, hallucination, and scope drift. Current approach (single-pass extraction into categories) produces disorganized, hard-to-validate output. Reading raw pages is not useful — the system needs to process, clean, structure, and curate knowledge like an editorial team.
|
||||||
|
|
||||||
|
## Vision
|
||||||
|
|
||||||
|
A publishing pipeline that takes raw AI conversation exports and produces well-curated, validated knowledge documents. The output should be something you hand to a team — organized, filtered, and clearly presented. Questions anchor the content, with branching connections showing what was asked, what was answered, and how reasoning was directed.
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
## Architecture
|
||||||
|
|
||||||
|
### Multi-Pass Processing via LLM Team Modes
|
||||||
|
|
||||||
|
The key insight: devop.live already has 20 analysis modes that process content through structured workflows. The Observer KB should route uploaded data through these modes automatically.
|
||||||
|
|
||||||
|
```
|
||||||
|
Raw PDF Upload
|
||||||
|
│
|
||||||
|
▼ Mode: EXTRACT
|
||||||
|
Structured facts, entities, relationships
|
||||||
|
│
|
||||||
|
▼ Mode: VALIDATOR
|
||||||
|
Fact-check claims, score 1-10 confidence
|
||||||
|
│
|
||||||
|
▼ Mode: HALLUCINATION
|
||||||
|
Verify each claim, flag likely hallucinations
|
||||||
|
│
|
||||||
|
▼ Mode: CONSENSUS
|
||||||
|
Multiple passes iterate until extraction converges
|
||||||
|
│
|
||||||
|
▼ Mode: REDTEAM
|
||||||
|
Find flaws in knowledge, patch them
|
||||||
|
│
|
||||||
|
▼ Mode: PIPELINE (custom)
|
||||||
|
Clean → Q&A structure → topic grouping → value ranking
|
||||||
|
│
|
||||||
|
▼ RENDER
|
||||||
|
Well-curated document: questions as anchors, branching connections,
|
||||||
|
what was asked → answered → directed
|
||||||
|
```
|
||||||
|
|
||||||
|
### Integration with devop.live (LLM Team)
|
||||||
|
|
||||||
|
The Observer KB calls the LLM Team API to run modes against extracted content:
|
||||||
|
|
||||||
|
| Mode | Purpose in KB |
|
||||||
|
|---|---|
|
||||||
|
| **extract** | Structured facts, entities, relationships from raw text |
|
||||||
|
| **validator** | Fact-check extracted claims, confidence scores |
|
||||||
|
| **hallucination** | Verify each factual claim independently |
|
||||||
|
| **drift** | Process N times, find consistent vs uncertain content |
|
||||||
|
| **redteam** | Find flaws in extracted knowledge, improve |
|
||||||
|
| **consensus** | Iterate until multiple passes agree on correct extraction |
|
||||||
|
| **pipeline** | Chain: clean → extract → validate → organize → render |
|
||||||
|
| **research** | Generate follow-up questions, research in parallel |
|
||||||
|
| **blindassembly** | Split content into parts, process independently, reassemble |
|
||||||
|
|
||||||
|
### Data Flow
|
||||||
|
|
||||||
|
```
|
||||||
|
Upload Portal (Observer KB :3400)
|
||||||
|
│
|
||||||
|
├── PDF → Lakehouse ingestd (text extraction, Parquet storage)
|
||||||
|
│
|
||||||
|
▼
|
||||||
|
Processing Pipeline
|
||||||
|
│
|
||||||
|
├── Call devop.live API (:5000) with each mode
|
||||||
|
├── Each mode processes content through local Ollama models
|
||||||
|
├── Results stored back in Lakehouse (Parquet + catalog)
|
||||||
|
│
|
||||||
|
▼
|
||||||
|
Knowledge Store
|
||||||
|
│
|
||||||
|
├── knowledge_facts: verified claims with confidence scores
|
||||||
|
├── knowledge_qa: question → answer pairs with context
|
||||||
|
├── knowledge_topics: auto-generated categories
|
||||||
|
├── knowledge_connections: how topics relate across conversations
|
||||||
|
├── knowledge_contradictions: flagged conflicts between conversations
|
||||||
|
├── knowledge_validated: claims that passed hallucination check
|
||||||
|
│
|
||||||
|
▼
|
||||||
|
Rendering
|
||||||
|
│
|
||||||
|
├── Structured knowledge view (web UI)
|
||||||
|
├── Exportable curated document (PDF/markdown)
|
||||||
|
└── Question-anchored navigation (Q → A → follow-up → related)
|
||||||
|
```
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
## Processing Pipeline Detail
|
||||||
|
|
||||||
|
### Pass 1: Clean + Structure
|
||||||
|
- Strip PDF artifacts (headers, footers, page numbers)
|
||||||
|
- Identify conversation turns (user/AI)
|
||||||
|
- Fix encoding issues (ligatures, special chars)
|
||||||
|
- Normalize formatting
|
||||||
|
|
||||||
|
### Pass 2: Q&A Extraction
|
||||||
|
- Identify questions asked by user
|
||||||
|
- Map each question to its answer
|
||||||
|
- Track follow-up questions and how they branch
|
||||||
|
- Build question→answer→follow-up chains
|
||||||
|
|
||||||
|
### Pass 3: Fact Extraction + Validation
|
||||||
|
- Run EXTRACT mode: pull structured facts, entities, relationships
|
||||||
|
- Run VALIDATOR mode: score each fact 1-10 confidence
|
||||||
|
- Run HALLUCINATION mode: verify claims independently
|
||||||
|
- Flag contradictions between conversations
|
||||||
|
|
||||||
|
### Pass 4: Organize + Curate
|
||||||
|
- Run CONSENSUS mode: multiple passes converge on correct categorization
|
||||||
|
- Auto-generate topic categories from content (not predefined)
|
||||||
|
- Rank content by value (decisions > insights > discussion > noise)
|
||||||
|
- Connect related content across conversations
|
||||||
|
|
||||||
|
### Pass 5: Render
|
||||||
|
- Question-anchored view: each question is a node, answers branch from it
|
||||||
|
- Topic-grouped view: knowledge organized by auto-generated categories
|
||||||
|
- Timeline view: how thinking evolved across conversations
|
||||||
|
- Export as clean markdown/PDF
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
## Current State (as of 2026-03-28)
|
||||||
|
|
||||||
|
### What's Built
|
||||||
|
- PDF ingestion (8 PDFs, 477 pages extracted)
|
||||||
|
- Single-pass knowledge extraction (496 topics, 300 decisions, 100 insights)
|
||||||
|
- Semantic search via HNSW (27ms over 477 chunks)
|
||||||
|
- RAG (question → search → LLM answer with sources)
|
||||||
|
- 5-pass deep analysis (corpus overview, patterns, evolution, gaps, synthesis)
|
||||||
|
- Observer KB web UI (knowledge-first, not page-first)
|
||||||
|
- Upload portal with drag & drop
|
||||||
|
|
||||||
|
### What's Not Built Yet
|
||||||
|
- Integration with devop.live LLM Team modes
|
||||||
|
- Multi-pass processing pipeline (extract → validate → hallucination check)
|
||||||
|
- Q&A chain extraction (question → answer → follow-up mapping)
|
||||||
|
- Contradiction detection between conversations
|
||||||
|
- Curated document export (PDF/markdown)
|
||||||
|
- Question-anchored navigation
|
||||||
|
- Auto-processing on upload (currently manual script)
|
||||||
|
|
||||||
|
### What Needs to Happen Next Session
|
||||||
|
1. **Integrate with devop.live API** — call modes programmatically
|
||||||
|
2. **Build the multi-pass pipeline** — extract → validate → hallucinate-check → organize
|
||||||
|
3. **Q&A chain extraction** — questions as anchors, answers branching
|
||||||
|
4. **Auto-process on upload** — no manual script, pipeline runs automatically
|
||||||
|
5. **Render curated output** — readable, hand-it-to-someone quality
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
## Tech Stack
|
||||||
|
|
||||||
|
- **Storage:** Lakehouse storaged (Parquet on object storage)
|
||||||
|
- **Catalog:** Lakehouse catalogd (metadata, PII, lineage)
|
||||||
|
- **Query:** Lakehouse queryd (DataFusion SQL, hot cache, paged results)
|
||||||
|
- **Vectors:** Lakehouse vectord (HNSW search, RAG)
|
||||||
|
- **AI Processing:** devop.live LLM Team API (20 modes, multiple models)
|
||||||
|
- **AI Runtime:** Ollama (local models — qwen2.5, mistral, gemma2, nomic-embed-text)
|
||||||
|
- **UI:** Pure HTML/JS on :3400
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
## Non-Goals (for now)
|
||||||
|
|
||||||
|
- Real-time conversation ingestion (PDF exports only)
|
||||||
|
- Multi-user collaboration
|
||||||
|
- Cloud deployment
|
||||||
|
- Editing extracted knowledge from UI (read-only for now)
|
||||||
@@ -0,0 +1,286 @@
|
|||||||
|
<!DOCTYPE html>
|
||||||
|
<html lang="en">
|
||||||
|
<head>
|
||||||
|
<meta charset="UTF-8">
|
||||||
|
<meta name="viewport" content="width=device-width, initial-scale=1.0">
|
||||||
|
<title>Observer KB</title>
|
||||||
|
<style>
|
||||||
|
:root{--bg:#0a0a0f;--s1:#12121a;--s2:#1a1a28;--b:#2a2a3a;--t:#e0e0e8;--d:#888898;--a:#6c5ce7;--ok:#00d2a0;--err:#ff6b6b;--warn:#ffa94d;--f:'JetBrains Mono','Fira Code',monospace}
|
||||||
|
*{margin:0;padding:0;box-sizing:border-box}body{font-family:var(--f);background:var(--bg);color:var(--t);font-size:13px;min-height:100vh}
|
||||||
|
.app{max-width:1200px;margin:0 auto;padding:20px}
|
||||||
|
header{display:flex;align-items:center;gap:20px;padding:16px 0;border-bottom:1px solid var(--b);margin-bottom:20px}
|
||||||
|
header h1{font-size:20px;color:var(--a)}
|
||||||
|
.tabs{display:flex;gap:2px}.tab{background:none;border:none;color:var(--d);font-family:var(--f);font-size:12px;padding:10px 16px;cursor:pointer;border-bottom:2px solid transparent}
|
||||||
|
.tab:hover{color:var(--t)}.tab.active{color:var(--a);border-bottom-color:var(--a)}
|
||||||
|
.hdr-stats{margin-left:auto;font-size:11px;color:var(--d)}
|
||||||
|
.btn{background:var(--a);color:white;border:none;padding:8px 16px;border-radius:6px;font-family:var(--f);font-size:12px;cursor:pointer;font-weight:600}
|
||||||
|
.btn:hover{opacity:.9}.btn:disabled{opacity:.5}.btn-sm{padding:5px 10px;font-size:11px}
|
||||||
|
.hidden{display:none}
|
||||||
|
.stats-bar{display:grid;grid-template-columns:repeat(auto-fill,minmax(130px,1fr));gap:8px;margin-bottom:20px}
|
||||||
|
.stat{background:var(--s1);border:1px solid var(--b);border-radius:8px;padding:12px;text-align:center}
|
||||||
|
.stat-val{font-size:22px;font-weight:700;color:var(--a)}.stat-label{font-size:10px;color:var(--d);text-transform:uppercase;margin-top:2px}
|
||||||
|
.section{margin-bottom:24px}.section h2{font-size:13px;color:var(--d);text-transform:uppercase;letter-spacing:.08em;margin-bottom:10px;border-bottom:1px solid var(--b);padding-bottom:6px}
|
||||||
|
.entry{background:var(--s1);border:1px solid var(--b);border-radius:8px;padding:14px;margin-bottom:8px}
|
||||||
|
.badge{font-size:9px;text-transform:uppercase;letter-spacing:.08em;padding:2px 8px;border-radius:3px;display:inline-block;margin-bottom:6px;font-weight:600}
|
||||||
|
.badge-fact{background:var(--a);color:white}.badge-entity{background:var(--ok);color:white}
|
||||||
|
.badge-decision{background:#e67e22;color:white}.badge-insight{background:#3498db;color:white}
|
||||||
|
.badge-question{background:var(--warn);color:#000}.badge-verified{background:var(--ok);color:white}
|
||||||
|
.entry-text{font-size:12px;line-height:1.6}.entry-src{font-size:10px;color:var(--d);margin-top:4px}
|
||||||
|
.cat-grid{display:grid;grid-template-columns:repeat(auto-fill,minmax(250px,1fr));gap:8px;margin-bottom:16px}
|
||||||
|
.cat-card{background:var(--s1);border:1px solid var(--b);border-radius:8px;padding:14px;cursor:pointer;border-left:3px solid var(--a);transition:all .15s}
|
||||||
|
.cat-card:hover{border-color:var(--a)}.cat-title{font-weight:600;font-size:13px}.cat-count{font-size:10px;color:var(--d);margin-top:2px}
|
||||||
|
.search-row{display:flex;gap:8px;margin-bottom:16px}
|
||||||
|
.search-row input{flex:1;background:var(--s1);border:2px solid var(--b);color:var(--t);font-family:var(--f);font-size:14px;padding:12px;border-radius:8px;outline:none}
|
||||||
|
.search-row input:focus{border-color:var(--a)}
|
||||||
|
.ask-input{width:100%;background:var(--s1);border:2px solid var(--b);color:var(--t);font-family:var(--f);font-size:13px;padding:12px;border-radius:8px;resize:vertical;min-height:80px;outline:none;margin-bottom:8px}
|
||||||
|
.ask-input:focus{border-color:var(--a)}
|
||||||
|
.ai-answer{background:var(--s2);border:1px solid var(--b);border-radius:8px;padding:16px;margin-top:12px;line-height:1.7;white-space:pre-wrap}
|
||||||
|
.ai-meta{font-size:10px;color:var(--d);margin-top:6px}
|
||||||
|
.upload-zone{border:2px dashed var(--b);border-radius:12px;padding:36px;text-align:center;cursor:pointer;margin-bottom:16px}
|
||||||
|
.upload-zone:hover{border-color:var(--a);background:rgba(108,92,231,.03)}
|
||||||
|
.upload-zone h3{margin-bottom:4px}.upload-zone p{color:var(--d);font-size:11px}
|
||||||
|
.file-item{display:flex;align-items:center;justify-content:space-between;padding:8px 12px;border-bottom:1px solid var(--b);font-size:12px}
|
||||||
|
.done{color:var(--ok)}.failed{color:var(--err)}.uploading{color:var(--a)}
|
||||||
|
.result{background:var(--s2);border:1px solid var(--b);border-radius:8px;padding:12px;margin-bottom:6px;border-left:3px solid var(--a)}
|
||||||
|
.result-score{font-size:10px;color:var(--a);margin-bottom:2px}.result-text{font-size:12px;line-height:1.5}
|
||||||
|
.empty{color:var(--d);text-align:center;padding:32px}
|
||||||
|
</style>
|
||||||
|
</head>
|
||||||
|
<body>
|
||||||
|
<div class="app">
|
||||||
|
<header>
|
||||||
|
<h1>OBSERVER KB</h1>
|
||||||
|
<div class="tabs">
|
||||||
|
<button class="tab active" onclick="showTab('knowledge')">Knowledge</button>
|
||||||
|
<button class="tab" onclick="showTab('facts')">Facts & Entities</button>
|
||||||
|
<button class="tab" onclick="showTab('explore')">Search</button>
|
||||||
|
<button class="tab" onclick="showTab('ask')">Ask AI</button>
|
||||||
|
<button class="tab" onclick="showTab('upload')">Ingest</button>
|
||||||
|
</div>
|
||||||
|
<div class="hdr-stats" id="hdr-stats"></div>
|
||||||
|
</header>
|
||||||
|
|
||||||
|
<div id="tab-knowledge"></div>
|
||||||
|
<div id="tab-facts" class="hidden"></div>
|
||||||
|
<div id="tab-explore" class="hidden"></div>
|
||||||
|
<div id="tab-ask" class="hidden"></div>
|
||||||
|
<div id="tab-upload" class="hidden"></div>
|
||||||
|
</div>
|
||||||
|
|
||||||
|
<script>
|
||||||
|
const API=`http://${location.hostname}:3100`;
|
||||||
|
const $=id=>document.getElementById(id);
|
||||||
|
async function q(sql){return(await(await fetch(API+'/query/sql',{method:'POST',headers:{'Content-Type':'application/json'},body:JSON.stringify({sql})})).json())}
|
||||||
|
async function searchHNSW(query,k=10){try{return(await(await fetch(API+'/vectors/hnsw/search',{method:'POST',headers:{'Content-Type':'application/json'},body:JSON.stringify({index_name:'observer_kb',query,top_k:k})})).json()).results||[]}catch{return[]}}
|
||||||
|
|
||||||
|
function showTab(name){
|
||||||
|
['knowledge','facts','explore','ask','upload'].forEach((t,i)=>{
|
||||||
|
$('tab-'+t).classList.toggle('hidden',t!==name);
|
||||||
|
document.querySelectorAll('.tab')[i].classList.toggle('active',t===name);
|
||||||
|
});
|
||||||
|
({knowledge:loadKnowledge,facts:loadFacts,explore:loadExplore,ask:loadAsk,upload:loadUpload})[name]();
|
||||||
|
}
|
||||||
|
|
||||||
|
function makeEntry(type,text,source){
|
||||||
|
const e=document.createElement('div');e.className='entry';
|
||||||
|
const b=document.createElement('span');b.className='badge badge-'+type;b.textContent=type;
|
||||||
|
const t=document.createElement('div');t.className='entry-text';t.textContent=text;
|
||||||
|
const s=document.createElement('div');s.className='entry-src';s.textContent=source;
|
||||||
|
e.append(b,t,s);return e;
|
||||||
|
}
|
||||||
|
|
||||||
|
// === KNOWLEDGE (categories + decisions + insights) ===
|
||||||
|
async function loadKnowledge(){
|
||||||
|
const el=$('tab-knowledge');el.textContent='';
|
||||||
|
try{
|
||||||
|
const[topics,decisions,insights,questions,extractions]=await Promise.all([
|
||||||
|
q("SELECT topic,COUNT(*) as n,COUNT(DISTINCT conversation) as c FROM knowledge_topics GROUP BY topic ORDER BY n DESC LIMIT 15"),
|
||||||
|
q("SELECT conversation,page,decision FROM knowledge_decisions LIMIT 12"),
|
||||||
|
q("SELECT conversation,page,insight FROM knowledge_insights LIMIT 8"),
|
||||||
|
q("SELECT COUNT(*) as n FROM knowledge_questions"),
|
||||||
|
q("SELECT type,COUNT(*) as n FROM processed_extractions GROUP BY type"),
|
||||||
|
]);
|
||||||
|
|
||||||
|
const factCount=extractions.rows.find(r=>r.type==='fact')?.n||0;
|
||||||
|
const entityCount=extractions.rows.find(r=>r.type==='entity')?.n||0;
|
||||||
|
|
||||||
|
// Stats
|
||||||
|
const sb=document.createElement('div');sb.className='stats-bar';
|
||||||
|
[{v:topics.row_count,l:'Categories'},{v:factCount,l:'Verified Facts'},{v:entityCount,l:'Entities'},{v:decisions.row_count,l:'Decisions'},{v:insights.row_count,l:'Insights'},{v:questions.rows[0]?.n||0,l:'Open Questions'}].forEach(s=>{
|
||||||
|
const d=document.createElement('div');d.className='stat';
|
||||||
|
const v=document.createElement('div');v.className='stat-val';v.textContent=s.v;
|
||||||
|
const l=document.createElement('div');l.className='stat-label';l.textContent=s.l;
|
||||||
|
d.append(v,l);sb.appendChild(d);
|
||||||
|
});
|
||||||
|
el.appendChild(sb);
|
||||||
|
$('hdr-stats').textContent=factCount+' facts · '+entityCount+' entities · '+decisions.row_count+' decisions';
|
||||||
|
|
||||||
|
// Categories
|
||||||
|
const cs=document.createElement('div');cs.className='section';
|
||||||
|
cs.insertAdjacentHTML('beforeend','<h2>Auto-Generated Categories</h2>');
|
||||||
|
const cg=document.createElement('div');cg.className='cat-grid';
|
||||||
|
topics.rows.forEach(t=>{
|
||||||
|
const c=document.createElement('div');c.className='cat-card';
|
||||||
|
const n=document.createElement('div');n.className='cat-title';n.textContent=t.topic;
|
||||||
|
const m=document.createElement('div');m.className='cat-count';m.textContent=t.n+' mentions · '+t.c+' conversations';
|
||||||
|
c.append(n,m);c.onclick=()=>drillTopic(t.topic);cg.appendChild(c);
|
||||||
|
});
|
||||||
|
cs.appendChild(cg);el.appendChild(cs);
|
||||||
|
|
||||||
|
// Decisions
|
||||||
|
const ds=document.createElement('div');ds.className='section';
|
||||||
|
ds.insertAdjacentHTML('beforeend','<h2>Key Decisions</h2>');
|
||||||
|
decisions.rows.forEach(d=>ds.appendChild(makeEntry('decision',d.decision,d.conversation+' p'+d.page)));
|
||||||
|
el.appendChild(ds);
|
||||||
|
|
||||||
|
// Insights
|
||||||
|
const is=document.createElement('div');is.className='section';
|
||||||
|
is.insertAdjacentHTML('beforeend','<h2>Key Insights</h2>');
|
||||||
|
insights.rows.forEach(d=>is.appendChild(makeEntry('insight',d.insight,d.conversation+' p'+d.page)));
|
||||||
|
el.appendChild(is);
|
||||||
|
}catch(e){el.textContent='Error: '+e}
|
||||||
|
}
|
||||||
|
|
||||||
|
async function drillTopic(topic){
|
||||||
|
const el=$('tab-knowledge');el.textContent='';
|
||||||
|
const back=document.createElement('button');back.className='btn btn-sm';back.textContent='← Back';back.onclick=loadKnowledge;
|
||||||
|
const h=document.createElement('h2');h.style.cssText='font-size:18px;margin:12px 0';h.textContent=topic;
|
||||||
|
el.append(back,h);
|
||||||
|
const results=await searchHNSW(topic,10);
|
||||||
|
const s=document.createElement('div');s.className='section';
|
||||||
|
s.insertAdjacentHTML('beforeend','<h2>Related Content</h2>');
|
||||||
|
results.forEach(r=>{
|
||||||
|
const e=document.createElement('div');e.className='result';
|
||||||
|
const sc=document.createElement('div');sc.className='result-score';sc.textContent='['+r.score.toFixed(3)+'] '+r.doc_id;
|
||||||
|
const t=document.createElement('div');t.className='result-text';t.textContent=r.chunk_text.substring(0,300);
|
||||||
|
e.append(sc,t);s.appendChild(e);
|
||||||
|
});
|
||||||
|
el.appendChild(s);
|
||||||
|
}
|
||||||
|
|
||||||
|
// === FACTS & ENTITIES (from LLM Team extract mode) ===
|
||||||
|
async function loadFacts(){
|
||||||
|
const el=$('tab-facts');el.textContent='';
|
||||||
|
try{
|
||||||
|
const[facts,entities,verified]=await Promise.all([
|
||||||
|
q("SELECT conversation,page,content FROM processed_extractions WHERE type='fact' ORDER BY conversation,page LIMIT 30"),
|
||||||
|
q("SELECT conversation,content,COUNT(*) as n FROM processed_extractions WHERE type='entity' GROUP BY conversation,content ORDER BY n DESC LIMIT 30"),
|
||||||
|
q("SELECT conversation,page,content FROM processed_validated LIMIT 10"),
|
||||||
|
]);
|
||||||
|
|
||||||
|
const fs=document.createElement('div');fs.className='section';
|
||||||
|
fs.insertAdjacentHTML('beforeend','<h2>Extracted Facts ('+facts.row_count+' total — via LLM Team Extract Mode)</h2>');
|
||||||
|
facts.rows.forEach(r=>fs.appendChild(makeEntry('fact',r.content,r.conversation+' p'+r.page)));
|
||||||
|
el.appendChild(fs);
|
||||||
|
|
||||||
|
const es=document.createElement('div');es.className='section';
|
||||||
|
es.insertAdjacentHTML('beforeend','<h2>Entities ('+entities.row_count+' unique)</h2>');
|
||||||
|
const eg=document.createElement('div');eg.style.cssText='display:flex;flex-wrap:wrap;gap:6px';
|
||||||
|
entities.rows.forEach(r=>{
|
||||||
|
const chip=document.createElement('span');
|
||||||
|
chip.style.cssText='background:var(--s2);border:1px solid var(--b);padding:4px 10px;border-radius:4px;font-size:11px;cursor:pointer';
|
||||||
|
chip.textContent=r.content+(r.n>1?' ('+r.n+')':'');
|
||||||
|
chip.onclick=()=>{showTab('explore');setTimeout(()=>{document.getElementById('searchInput').value=r.content;doSearch()},100)};
|
||||||
|
eg.appendChild(chip);
|
||||||
|
});
|
||||||
|
es.appendChild(eg);el.appendChild(es);
|
||||||
|
|
||||||
|
if(verified.rows.length){
|
||||||
|
const vs=document.createElement('div');vs.className='section';
|
||||||
|
vs.insertAdjacentHTML('beforeend','<h2>Verified by Secondary Model</h2>');
|
||||||
|
verified.rows.forEach(r=>vs.appendChild(makeEntry('verified',r.content,r.conversation+' p'+r.page)));
|
||||||
|
el.appendChild(vs);
|
||||||
|
}
|
||||||
|
}catch(e){el.textContent='Error: '+e}
|
||||||
|
}
|
||||||
|
|
||||||
|
// === SEARCH ===
|
||||||
|
function loadExplore(){
|
||||||
|
const el=$('tab-explore');el.textContent='';
|
||||||
|
const row=document.createElement('div');row.className='search-row';
|
||||||
|
const input=document.createElement('input');input.id='searchInput';input.placeholder='Search by meaning across all knowledge...';
|
||||||
|
const btn=document.createElement('button');btn.className='btn';btn.textContent='Search';
|
||||||
|
btn.onclick=doSearch;input.onkeydown=e=>{if(e.key==='Enter')doSearch()};
|
||||||
|
row.append(input,btn);
|
||||||
|
const res=document.createElement('div');res.id='searchResults';
|
||||||
|
const hint=document.createElement('div');hint.className='empty';hint.textContent='Try: "object storage architecture", "data ingestion trade-offs", "CRM options"';
|
||||||
|
el.append(row,res,hint);
|
||||||
|
}
|
||||||
|
async function doSearch(){
|
||||||
|
const query=document.getElementById('searchInput').value;if(!query)return;
|
||||||
|
const el=$('searchResults');el.textContent='searching...';
|
||||||
|
const results=await searchHNSW(query,15);
|
||||||
|
el.textContent='';
|
||||||
|
if(!results.length){el.textContent='No results';return}
|
||||||
|
results.forEach(r=>{
|
||||||
|
const e=document.createElement('div');e.className='result';
|
||||||
|
const s=document.createElement('div');s.className='result-score';s.textContent='['+r.score.toFixed(3)+'] '+r.doc_id.replace(/_/g,' ');
|
||||||
|
const t=document.createElement('div');t.className='result-text';t.textContent=r.chunk_text.substring(0,400);
|
||||||
|
e.append(s,t);el.appendChild(e);
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
|
// === ASK AI ===
|
||||||
|
function loadAsk(){
|
||||||
|
const el=$('tab-ask');el.textContent='';
|
||||||
|
const ta=document.createElement('textarea');ta.className='ask-input';ta.id='askInput';
|
||||||
|
ta.placeholder='Ask a question about your knowledge base...\n\nExamples:\n- What architecture decisions were made about Iceberg?\n- Compare Spark vs Flink approaches\n- What approaches were abandoned and why?';
|
||||||
|
const btn=document.createElement('button');btn.className='btn';btn.id='askBtn';btn.textContent='Ask AI';
|
||||||
|
btn.onclick=doAsk;
|
||||||
|
const resp=document.createElement('div');resp.id='askResp';
|
||||||
|
el.append(ta,btn,resp);
|
||||||
|
}
|
||||||
|
async function doAsk(){
|
||||||
|
const question=$('askInput').value;if(!question)return;
|
||||||
|
$('askBtn').disabled=true;$('askBtn').textContent='thinking...';
|
||||||
|
const el=$('askResp');el.textContent='searching knowledge...';
|
||||||
|
try{
|
||||||
|
const r=await(await fetch(API+'/vectors/rag',{method:'POST',headers:{'Content-Type':'application/json'},body:JSON.stringify({index_name:'observer_kb',question,top_k:5})})).json();
|
||||||
|
el.textContent='';
|
||||||
|
const ans=document.createElement('div');ans.className='ai-answer';ans.textContent=r.answer;
|
||||||
|
const meta=document.createElement('div');meta.className='ai-meta';meta.textContent='Model: '+r.model+(r.tokens_generated?' · '+r.tokens_generated+' tokens':'');
|
||||||
|
el.append(ans,meta);
|
||||||
|
if(r.sources?.length){
|
||||||
|
const sh=document.createElement('h2');sh.style.cssText='font-size:11px;color:var(--d);margin-top:14px';sh.textContent='SOURCES';el.appendChild(sh);
|
||||||
|
r.sources.forEach(s=>{
|
||||||
|
const e=document.createElement('div');e.className='result';e.style.marginTop='4px';
|
||||||
|
const sc=document.createElement('div');sc.className='result-score';sc.textContent='['+s.score.toFixed(3)+'] '+s.doc_id;
|
||||||
|
const t=document.createElement('div');t.className='result-text';t.style.fontSize='11px';t.textContent=s.chunk_text.substring(0,200);
|
||||||
|
e.append(sc,t);el.appendChild(e);
|
||||||
|
});
|
||||||
|
}
|
||||||
|
}catch(e){el.textContent='Error: '+e}
|
||||||
|
$('askBtn').disabled=false;$('askBtn').textContent='Ask AI';
|
||||||
|
}
|
||||||
|
|
||||||
|
// === UPLOAD ===
|
||||||
|
function loadUpload(){
|
||||||
|
const el=$('tab-upload');el.textContent='';
|
||||||
|
const zone=document.createElement('div');zone.className='upload-zone';
|
||||||
|
zone.onclick=()=>{const i=document.createElement('input');i.type='file';i.multiple=true;i.accept='.pdf,.txt,.csv,.json';i.onchange=e=>[...e.target.files].forEach(uploadFile);i.click()};
|
||||||
|
zone.ondragover=e=>{e.preventDefault();zone.style.borderColor='var(--a)'};
|
||||||
|
zone.ondragleave=()=>zone.style.borderColor='';
|
||||||
|
zone.ondrop=e=>{e.preventDefault();zone.style.borderColor='';[...e.dataTransfer.files].forEach(uploadFile)};
|
||||||
|
const h=document.createElement('h3');h.textContent='Drop files to ingest';
|
||||||
|
const p=document.createElement('p');p.textContent='PDF, CSV, JSON, Text — auto-extracted and indexed';
|
||||||
|
zone.append(h,p);
|
||||||
|
const list=document.createElement('div');list.id='upList';
|
||||||
|
el.append(zone,list);
|
||||||
|
}
|
||||||
|
function uploadFile(file){
|
||||||
|
const item=document.createElement('div');item.className='file-item';
|
||||||
|
const name=document.createElement('span');name.textContent=file.name;
|
||||||
|
const status=document.createElement('span');status.className='uploading';status.textContent='uploading...';
|
||||||
|
item.append(name,status);$('upList').prepend(item);
|
||||||
|
const fd=new FormData();fd.append('file',file);
|
||||||
|
const xhr=new XMLHttpRequest();xhr.open('POST',API+'/ingest/file');
|
||||||
|
xhr.upload.onprogress=e=>{if(e.lengthComputable)status.textContent=Math.round(e.loaded/e.total*100)+'%'};
|
||||||
|
xhr.onload=()=>{status.className=xhr.status<300?'done':'failed';status.textContent=xhr.status<300?'ingested':'failed'};
|
||||||
|
xhr.onerror=()=>{status.className='failed';status.textContent='error'};
|
||||||
|
xhr.send(fd);
|
||||||
|
}
|
||||||
|
|
||||||
|
loadKnowledge();
|
||||||
|
</script>
|
||||||
|
</body>
|
||||||
|
</html>
|
||||||
@@ -1,60 +0,0 @@
|
|||||||
# Lakehouse Claim Auditor
|
|
||||||
|
|
||||||
A Bun sub-agent that watches open PRs on Gitea, reads the ship-claims
|
|
||||||
in commit messages and PR bodies, and **hard-blocks** merges when the
|
|
||||||
code doesn't back the claim.
|
|
||||||
|
|
||||||
Rationale: when "compiles + one curl works" gets called "phase shipped,"
|
|
||||||
placeholder code accumulates. This auditor runs every 90s, fetches
|
|
||||||
each open PR, and subjects it to four checks:
|
|
||||||
|
|
||||||
1. **Static diff** — grep/parse looking for placeholder patterns
|
|
||||||
2. **Dynamic** — runs the never-before-executed hybrid test fixture
|
|
||||||
3. **Cloud inference** — asks `gpt-oss:120b` via `/v1/chat` to
|
|
||||||
identify gaps in the diff
|
|
||||||
4. **KB query** — looks up `data/_kb/` + observer for prior failure
|
|
||||||
patterns on similar claims
|
|
||||||
|
|
||||||
Verdict is assembled, posted to Gitea as:
|
|
||||||
- A **failing commit status** (hard block — branch protection
|
|
||||||
prevents merge)
|
|
||||||
- A **review comment** explaining every finding
|
|
||||||
|
|
||||||
## Run manually
|
|
||||||
|
|
||||||
```bash
|
|
||||||
cd /home/profit/lakehouse
|
|
||||||
bun run auditor/index.ts
|
|
||||||
```
|
|
||||||
|
|
||||||
Defaults: polls every 90s, stops on `auditor.paused` file present.
|
|
||||||
|
|
||||||
## State
|
|
||||||
|
|
||||||
- `data/_auditor/state.json` — last-audited head SHA per PR
|
|
||||||
- `data/_auditor/verdicts/{pr}-{sha}.json` — per-run verdict record
|
|
||||||
- `data/_kb/audit_lessons.jsonl` — one row per block/warn finding,
|
|
||||||
path-agnostic signature for dedup. Tailed by kb_query on each audit
|
|
||||||
to surface recurring patterns (2+ distinct PRs with same signature
|
|
||||||
→ info, 3-4 → warn, 5+ → block). This is how the auditor learns.
|
|
||||||
- `data/_kb/scrum_reviews.jsonl` — scrum-master per-file reviews. If
|
|
||||||
a file in the current PR has been scrum-reviewed, kb_query surfaces
|
|
||||||
the review as a finding with the accepted model and attempt count.
|
|
||||||
|
|
||||||
## Where YOU edit
|
|
||||||
|
|
||||||
`auditor/policy.ts` — the verdict assembler. Controls which findings
|
|
||||||
block vs warn vs inform. All other code is mechanical: fetching,
|
|
||||||
running checks, posting to Gitea.
|
|
||||||
|
|
||||||
## Hard-block mechanism
|
|
||||||
|
|
||||||
1. Commit status is posted as `failure` with context `lakehouse/auditor`
|
|
||||||
2. If `main` branch protection requires `lakehouse/auditor` status
|
|
||||||
to pass, Gitea prevents merge
|
|
||||||
3. When code is fixed and re-audit passes, status flips to `success`,
|
|
||||||
merge unblocks
|
|
||||||
|
|
||||||
Enable branch protection (one-time, via Gitea UI or API):
|
|
||||||
- `POST /repos/profit/lakehouse/branch_protections`
|
|
||||||
- `{"branch_name": "main", "required_status_checks": {"contexts": ["lakehouse/auditor"]}}`
|
|
||||||
@@ -1,246 +0,0 @@
|
|||||||
// Orchestrator — runs all four checks on a PR, assembles a verdict,
|
|
||||||
// posts to Gitea. This is task #8's integration layer; the poller
|
|
||||||
// (task #9) calls this once per PR on every fresh head SHA.
|
|
||||||
//
|
|
||||||
// Hard-block mechanism: commit status posted with state="failure"
|
|
||||||
// and context="lakehouse/auditor". If `main` branch protection
|
|
||||||
// requires that context to pass, merge is physically impossible
|
|
||||||
// until the auditor re-audits a fixed commit and flips the status
|
|
||||||
// to "success".
|
|
||||||
//
|
|
||||||
// Human-readable reasoning: posted as a PR issue comment (not a
|
|
||||||
// review — reviews have self-review restrictions on Gitea and the
|
|
||||||
// auditor currently uses the same PAT as the PR author).
|
|
||||||
|
|
||||||
import { readFile, writeFile, mkdir, appendFile } from "node:fs/promises";
|
|
||||||
import { createHash } from "node:crypto";
|
|
||||||
import { join } from "node:path";
|
|
||||||
import type { PrSnapshot, Verdict, Finding } from "./types.ts";
|
|
||||||
import { getPrDiff, postCommitStatus, postIssueComment } from "./gitea.ts";
|
|
||||||
import { parseClaims } from "./claim_parser.ts";
|
|
||||||
import { assembleVerdict } from "./policy.ts";
|
|
||||||
import { runStaticCheck } from "./checks/static.ts";
|
|
||||||
import { runDynamicCheck } from "./checks/dynamic.ts";
|
|
||||||
import { runInferenceCheck } from "./checks/inference.ts";
|
|
||||||
import { runKbCheck } from "./checks/kb_query.ts";
|
|
||||||
import { runKimiArchitectCheck } from "./checks/kimi_architect.ts";
|
|
||||||
|
|
||||||
const VERDICTS_DIR = "/home/profit/lakehouse/data/_auditor/verdicts";
|
|
||||||
// Playbook for audit findings — one row per block/warn finding from a
|
|
||||||
// verdict. kb_query tails this next audit and escalates recurrences.
|
|
||||||
// Structured as JSONL so it's cheap to append and cheap to tail.
|
|
||||||
const AUDIT_LESSONS_JSONL = "/home/profit/lakehouse/data/_kb/audit_lessons.jsonl";
|
|
||||||
|
|
||||||
export interface AuditOptions {
|
|
||||||
// Skip the cloud inference call (fast path for iteration). Default false.
|
|
||||||
skip_inference?: boolean;
|
|
||||||
// Skip the dynamic check (avoid running the hybrid fixture every PR,
|
|
||||||
// since it hits live services and mutates playbook state). Default false
|
|
||||||
// on `main`-branch-target PRs, true when auditing feature branches
|
|
||||||
// where the fixture would pollute state. Caller decides.
|
|
||||||
skip_dynamic?: boolean;
|
|
||||||
// Skip Gitea posting — useful for dry-runs / local testing.
|
|
||||||
// Default false.
|
|
||||||
dry_run?: boolean;
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function auditPr(pr: PrSnapshot, opts: AuditOptions = {}): Promise<Verdict> {
|
|
||||||
const t0 = Date.now();
|
|
||||||
const diff = await getPrDiff(pr.number);
|
|
||||||
const { claims } = parseClaims(pr);
|
|
||||||
|
|
||||||
// Run checks in parallel where they don't share mutable state.
|
|
||||||
// Static + kb_query + inference are all read-only. Dynamic mutates
|
|
||||||
// playbook state (nonce-scoped per run, but still live) so if
|
|
||||||
// skip_dynamic is false we still run it in parallel — the mutation
|
|
||||||
// is namespaced.
|
|
||||||
const [staticFindings, dynamicFindings, inferenceFindings, kbFindings] = await Promise.all([
|
|
||||||
runStaticCheck(diff),
|
|
||||||
opts.skip_dynamic ? Promise.resolve(stubFinding("dynamic", "skipped by options")) : runDynamicCheck(),
|
|
||||||
opts.skip_inference ? Promise.resolve(stubFinding("inference", "skipped by options")) : runInferenceCheck(claims, diff, { pr_number: pr.number, head_sha: pr.head_sha }),
|
|
||||||
runKbCheck(claims, pr.files.map(f => f.path)),
|
|
||||||
]);
|
|
||||||
|
|
||||||
const allFindings: Finding[] = [
|
|
||||||
...staticFindings,
|
|
||||||
...dynamicFindings,
|
|
||||||
...inferenceFindings,
|
|
||||||
...kbFindings,
|
|
||||||
];
|
|
||||||
|
|
||||||
// Kimi-architect second-pass review. Off by default; enabled with
|
|
||||||
// LH_AUDITOR_KIMI=1. Sequential (not in the parallel block above)
|
|
||||||
// because it consumes the prior findings as context — Kimi sees what
|
|
||||||
// deepseek already flagged and is asked "what did everyone miss?"
|
|
||||||
// Failure-isolated by design: any error returns a single info-level
|
|
||||||
// skip finding so the existing audit pipeline never blocks on Kimi.
|
|
||||||
if (process.env.LH_AUDITOR_KIMI === "1") {
|
|
||||||
try {
|
|
||||||
const kimiFindings = await runKimiArchitectCheck(diff, allFindings, {
|
|
||||||
pr_number: pr.number,
|
|
||||||
head_sha: pr.head_sha,
|
|
||||||
});
|
|
||||||
allFindings.push(...kimiFindings);
|
|
||||||
} catch (e) {
|
|
||||||
allFindings.push({
|
|
||||||
check: "kimi_architect",
|
|
||||||
severity: "info",
|
|
||||||
summary: `kimi_architect outer error — ${(e as Error).message.slice(0, 160)}`,
|
|
||||||
evidence: [(e as Error).stack?.slice(0, 360) ?? ""],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
const duration_ms = Date.now() - t0;
|
|
||||||
const metrics = {
|
|
||||||
audit_duration_ms: duration_ms,
|
|
||||||
findings_total: allFindings.length,
|
|
||||||
findings_block: allFindings.filter(f => f.severity === "block").length,
|
|
||||||
findings_warn: allFindings.filter(f => f.severity === "warn").length,
|
|
||||||
findings_info: allFindings.filter(f => f.severity === "info").length,
|
|
||||||
claims_strong: claims.filter(c => c.strength === "strong").length,
|
|
||||||
claims_moderate: claims.filter(c => c.strength === "moderate").length,
|
|
||||||
claims_weak: claims.filter(c => c.strength === "weak").length,
|
|
||||||
claims_empirical: claims.filter(c => c.strength === "empirical").length,
|
|
||||||
claims_total: claims.length,
|
|
||||||
diff_bytes: diff.length,
|
|
||||||
};
|
|
||||||
|
|
||||||
const verdict = assembleVerdict(allFindings, metrics, pr.number, pr.head_sha);
|
|
||||||
|
|
||||||
await persistVerdict(verdict);
|
|
||||||
|
|
||||||
// Feedback loop — every block/warn finding becomes a row in
|
|
||||||
// audit_lessons.jsonl, dedup-keyed by (check, normalized-summary).
|
|
||||||
// The next audit's kb_query reads these and escalates recurring
|
|
||||||
// findings so we don't lose the "this pattern has been flagged
|
|
||||||
// before" signal across runs. Fire-and-forget; failure here must
|
|
||||||
// not break the audit.
|
|
||||||
appendAuditLessons(verdict).catch(e =>
|
|
||||||
console.error(`[audit] audit_lessons append failed: ${(e as Error).message}`));
|
|
||||||
|
|
||||||
if (!opts.dry_run) {
|
|
||||||
await postToGitea(verdict);
|
|
||||||
}
|
|
||||||
|
|
||||||
return verdict;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Normalizes a finding summary for dedup: strips path-specific tails
|
|
||||||
// ("in path/to/file.ts" → "in <file>"), line numbers, and long
|
|
||||||
// commit-hash snippets. The goal is: the SAME class of finding on
|
|
||||||
// DIFFERENT files should share a signature, so we can measure
|
|
||||||
// "this pattern keeps showing up."
|
|
||||||
function normalizedSignature(f: Finding): string {
|
|
||||||
const summary = String(f.summary)
|
|
||||||
.replace(/\bin\s+\S+\.(ts|rs|js|py|md)\b/gi, "in <file>")
|
|
||||||
.replace(/:\+?\d+\b/g, ":<line>")
|
|
||||||
.replace(/[0-9a-f]{8,}/gi, "<hash>")
|
|
||||||
.replace(/\s+/g, " ")
|
|
||||||
.trim()
|
|
||||||
.slice(0, 240);
|
|
||||||
const src = `${f.check}::${f.severity}::${summary}`;
|
|
||||||
return createHash("sha256").update(src).digest("hex").slice(0, 16);
|
|
||||||
}
|
|
||||||
|
|
||||||
async function appendAuditLessons(v: Verdict): Promise<void> {
|
|
||||||
const actionable = v.findings.filter(f => f.severity === "block" || f.severity === "warn");
|
|
||||||
if (actionable.length === 0) return;
|
|
||||||
await mkdir(join(AUDIT_LESSONS_JSONL, ".."), { recursive: true });
|
|
||||||
const rows: string[] = [];
|
|
||||||
for (const f of actionable) {
|
|
||||||
rows.push(JSON.stringify({
|
|
||||||
signature: normalizedSignature(f),
|
|
||||||
check: f.check,
|
|
||||||
severity: f.severity,
|
|
||||||
summary: f.summary,
|
|
||||||
pr_number: v.pr_number,
|
|
||||||
head_sha: v.head_sha,
|
|
||||||
audited_at: v.audited_at,
|
|
||||||
}));
|
|
||||||
}
|
|
||||||
await appendFile(AUDIT_LESSONS_JSONL, rows.join("\n") + "\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
async function persistVerdict(v: Verdict): Promise<void> {
|
|
||||||
await mkdir(VERDICTS_DIR, { recursive: true });
|
|
||||||
const filename = `${v.pr_number}-${v.head_sha.slice(0, 12)}.json`;
|
|
||||||
await writeFile(join(VERDICTS_DIR, filename), JSON.stringify(v, null, 2));
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function postToGitea(v: Verdict): Promise<void> {
|
|
||||||
// 1. Commit status — the hard block signal (if branch protection
|
|
||||||
// is configured to require lakehouse/auditor on main).
|
|
||||||
const state = v.overall === "approve" ? "success" : "failure";
|
|
||||||
await postCommitStatus({
|
|
||||||
sha: v.head_sha,
|
|
||||||
state,
|
|
||||||
context: "lakehouse/auditor",
|
|
||||||
description: v.one_liner,
|
|
||||||
target_url: "", // no URL yet; could point to a verdicts dashboard
|
|
||||||
});
|
|
||||||
|
|
||||||
// 2. Issue comment — the reasoning. Gated so we don't spam the PR
|
|
||||||
// with identical comments on re-audits of the same SHA. Caller
|
|
||||||
// (poller) ensures we only re-audit fresh SHAs, but a dedup
|
|
||||||
// marker inside the body keeps it idempotent if re-run.
|
|
||||||
const body = formatReviewBody(v);
|
|
||||||
await postIssueComment({ pr_number: v.pr_number, body });
|
|
||||||
}
|
|
||||||
|
|
||||||
function formatReviewBody(v: Verdict): string {
|
|
||||||
const byCheck: Record<string, Finding[]> = {};
|
|
||||||
for (const f of v.findings) {
|
|
||||||
(byCheck[f.check] ||= []).push(f);
|
|
||||||
}
|
|
||||||
|
|
||||||
const verdictEmoji =
|
|
||||||
v.overall === "approve" ? "✅" :
|
|
||||||
v.overall === "request_changes" ? "⚠️" :
|
|
||||||
"🛑";
|
|
||||||
|
|
||||||
const lines: string[] = [];
|
|
||||||
lines.push(`## Auditor verdict: ${verdictEmoji} \`${v.overall}\``);
|
|
||||||
lines.push("");
|
|
||||||
lines.push(`**One-liner:** ${v.one_liner}`);
|
|
||||||
lines.push(`**Head SHA:** \`${v.head_sha.slice(0, 12)}\``);
|
|
||||||
lines.push(`**Audited at:** ${v.audited_at}`);
|
|
||||||
lines.push("");
|
|
||||||
|
|
||||||
// Per-check sections, only if the check produced findings.
|
|
||||||
const checkOrder = ["static", "dynamic", "inference", "kb_query", "kimi_architect"] as const;
|
|
||||||
for (const check of checkOrder) {
|
|
||||||
const fs = byCheck[check] ?? [];
|
|
||||||
if (fs.length === 0) continue;
|
|
||||||
const bySev = {
|
|
||||||
block: fs.filter(f => f.severity === "block").length,
|
|
||||||
warn: fs.filter(f => f.severity === "warn").length,
|
|
||||||
info: fs.filter(f => f.severity === "info").length,
|
|
||||||
};
|
|
||||||
lines.push(`<details><summary><b>${check}</b> — ${fs.length} findings (${bySev.block} block, ${bySev.warn} warn, ${bySev.info} info)</summary>`);
|
|
||||||
lines.push("");
|
|
||||||
for (const f of fs) {
|
|
||||||
const mark = f.severity === "block" ? "🛑" : f.severity === "warn" ? "⚠️" : "ℹ️";
|
|
||||||
lines.push(`${mark} **${f.severity}** — ${f.summary}`);
|
|
||||||
for (const e of f.evidence.slice(0, 3)) {
|
|
||||||
lines.push(` - \`${e.slice(0, 180).replace(/\n/g, " ")}\``);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
lines.push("");
|
|
||||||
lines.push("</details>");
|
|
||||||
lines.push("");
|
|
||||||
}
|
|
||||||
|
|
||||||
lines.push("### Metrics");
|
|
||||||
lines.push("```json");
|
|
||||||
lines.push(JSON.stringify(v.metrics, null, 2));
|
|
||||||
lines.push("```");
|
|
||||||
lines.push("");
|
|
||||||
lines.push(`<sub>Lakehouse auditor · SHA ${v.head_sha.slice(0, 8)} · re-audit on new commit flips the status automatically.</sub>`);
|
|
||||||
|
|
||||||
return lines.join("\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
function stubFinding(check: "dynamic" | "inference" | "kimi_architect", why: string): Finding[] {
|
|
||||||
return [{ check, severity: "info", summary: `${check} check skipped — ${why}`, evidence: [why] }];
|
|
||||||
}
|
|
||||||
@@ -1,68 +0,0 @@
|
|||||||
// One-shot dry-run audit of a single PR. Useful for verifying check
|
|
||||||
// behavior (kb_query scrum surfacing, inference prompts, etc.) without
|
|
||||||
// posting to Gitea. Does NOT touch state.json and does NOT post
|
|
||||||
// commit status or PR comments.
|
|
||||||
//
|
|
||||||
// Run: bun run auditor/audit_one.ts <pr-number>
|
|
||||||
|
|
||||||
import { getPrSnapshot } from "./gitea.ts";
|
|
||||||
import { auditPr } from "./audit.ts";
|
|
||||||
|
|
||||||
async function main() {
|
|
||||||
const prNumRaw = process.argv[2];
|
|
||||||
if (!prNumRaw) {
|
|
||||||
console.error("usage: bun run auditor/audit_one.ts <pr-number>");
|
|
||||||
process.exit(2);
|
|
||||||
}
|
|
||||||
const prNum = Number(prNumRaw);
|
|
||||||
if (!Number.isFinite(prNum)) {
|
|
||||||
console.error(`invalid PR number: ${prNumRaw}`);
|
|
||||||
process.exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
console.log(`[audit_one] fetching PR #${prNum}...`);
|
|
||||||
const pr = await getPrSnapshot(prNum);
|
|
||||||
console.log(`[audit_one] PR #${pr.number}: "${pr.title}" (head=${pr.head_sha.slice(0, 12)})`);
|
|
||||||
console.log(`[audit_one] files in diff: ${pr.files.length}`);
|
|
||||||
for (const f of pr.files) console.log(` - ${f.path} (+${f.additions}/-${f.deletions})`);
|
|
||||||
console.log("");
|
|
||||||
|
|
||||||
const verdict = await auditPr(pr, {
|
|
||||||
dry_run: true, // no Gitea posting
|
|
||||||
skip_dynamic: true, // don't run fixture
|
|
||||||
skip_inference: process.env.LH_AUDITOR_SKIP_INFERENCE === "1",
|
|
||||||
});
|
|
||||||
|
|
||||||
console.log("\n═══ VERDICT ═══");
|
|
||||||
console.log(`overall: ${verdict.overall}`);
|
|
||||||
console.log(`one-liner: ${verdict.one_liner}`);
|
|
||||||
console.log(`findings: total=${verdict.metrics.findings_total} block=${verdict.metrics.findings_block} warn=${verdict.metrics.findings_warn} info=${verdict.metrics.findings_info}`);
|
|
||||||
console.log("");
|
|
||||||
|
|
||||||
// Print findings, highlighting kb_query scrum surfacing
|
|
||||||
const byCheck: Record<string, typeof verdict.findings> = {};
|
|
||||||
for (const f of verdict.findings) (byCheck[f.check] ||= []).push(f);
|
|
||||||
|
|
||||||
for (const [check, findings] of Object.entries(byCheck)) {
|
|
||||||
console.log(`── ${check} (${findings.length}) ──`);
|
|
||||||
for (const f of findings) {
|
|
||||||
const tag = f.severity === "block" ? "🛑" : f.severity === "warn" ? "⚠️ " : "ℹ️ ";
|
|
||||||
console.log(` ${tag} [${f.severity}] ${f.summary}`);
|
|
||||||
if (f.summary.includes("scrum-master")) {
|
|
||||||
for (const e of f.evidence) {
|
|
||||||
console.log(` → ${e.slice(0, 200)}`);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
const scrumFindings = verdict.findings.filter(f => f.summary.includes("scrum-master"));
|
|
||||||
console.log("");
|
|
||||||
console.log(`═══ SCRUM WIRE CHECK: ${scrumFindings.length} scrum-master findings surfaced by kb_query ═══`);
|
|
||||||
if (scrumFindings.length === 0) {
|
|
||||||
console.log(" (none — either no matching scrum_reviews.jsonl rows, or files didn't match PR diff)");
|
|
||||||
}
|
|
||||||
process.exit(0);
|
|
||||||
}
|
|
||||||
|
|
||||||
main().catch(e => { console.error("[audit_one] fatal:", e); process.exit(1); });
|
|
||||||
@@ -1,91 +0,0 @@
|
|||||||
// Dynamic execution check — runs the hybrid fixture and maps its
|
|
||||||
// layer results to auditor Findings.
|
|
||||||
//
|
|
||||||
// A layer that fails with a "not implemented / 404 / slice N" error
|
|
||||||
// gets severity=info (honest placeholder signal). A layer that fails
|
|
||||||
// any other way gets severity=warn (something actually broke).
|
|
||||||
// An info-level summary finding is always emitted carrying the real
|
|
||||||
// numbers — shipped/placeholder phase counts, per-layer latency.
|
|
||||||
|
|
||||||
import { runHybridFixture } from "../fixtures/hybrid_38_40_45.ts";
|
|
||||||
import type { Finding } from "../types.ts";
|
|
||||||
|
|
||||||
const PLACEHOLDER_MARKERS = [
|
|
||||||
"unimplemented",
|
|
||||||
" 404 ", "(404)", " 405 ", "(405)",
|
|
||||||
"slice 3", "slice 4", "slice 5",
|
|
||||||
"endpoint not built", "not yet",
|
|
||||||
];
|
|
||||||
|
|
||||||
function isPlaceholderFailure(err?: string): boolean {
|
|
||||||
if (!err) return false;
|
|
||||||
const low = err.toLowerCase();
|
|
||||||
return PLACEHOLDER_MARKERS.some(m => low.includes(m.toLowerCase()));
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function runDynamicCheck(): Promise<Finding[]> {
|
|
||||||
const findings: Finding[] = [];
|
|
||||||
|
|
||||||
let result;
|
|
||||||
try {
|
|
||||||
result = await runHybridFixture();
|
|
||||||
} catch (e) {
|
|
||||||
// Fixture itself crashed — can't run dynamic check at all.
|
|
||||||
return [
|
|
||||||
{
|
|
||||||
check: "dynamic",
|
|
||||||
severity: "warn",
|
|
||||||
summary: `hybrid fixture crashed before completing: ${(e as Error).message.slice(0, 140)}`,
|
|
||||||
evidence: [(e as Error).message],
|
|
||||||
},
|
|
||||||
];
|
|
||||||
}
|
|
||||||
|
|
||||||
// Per-layer findings for every non-ok layer.
|
|
||||||
for (const layer of result.layers) {
|
|
||||||
if (layer.ok) continue;
|
|
||||||
const placeholder = isPlaceholderFailure(layer.error);
|
|
||||||
findings.push({
|
|
||||||
check: "dynamic",
|
|
||||||
severity: placeholder ? "info" : "warn",
|
|
||||||
summary: placeholder
|
|
||||||
? `hybrid fixture layer ${layer.layer} (Phase ${layer.phase}) honestly reports unimplemented`
|
|
||||||
: `hybrid fixture layer ${layer.layer} (Phase ${layer.phase}) failed — not a placeholder, a real failure`,
|
|
||||||
evidence: [
|
|
||||||
`evidence: ${layer.evidence.slice(0, 160)}`,
|
|
||||||
...(layer.error ? [`error: ${layer.error.slice(0, 160)}`] : []),
|
|
||||||
`latency_ms: ${layer.latency_ms}`,
|
|
||||||
],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
// One overall summary with real numbers so the report shows what
|
|
||||||
// DID pass plus per-layer timing.
|
|
||||||
const metrics_preview = Object.entries(result.real_numbers)
|
|
||||||
.slice(0, 10)
|
|
||||||
.map(([k, v]) => `${k}=${v}`);
|
|
||||||
findings.push({
|
|
||||||
check: "dynamic",
|
|
||||||
severity: "info",
|
|
||||||
summary: `hybrid fixture overall=${result.overall}, shipped [${result.shipped_phases.join(", ")}], placeholder [${result.placeholder_phases.join(", ")}]`,
|
|
||||||
evidence: metrics_preview.length > 0 ? metrics_preview : ["no metrics emitted"],
|
|
||||||
});
|
|
||||||
|
|
||||||
// If the fixture ran at all but nothing passed, elevate one of the
|
|
||||||
// summary findings to warn — something more than "all honest
|
|
||||||
// placeholders" is wrong.
|
|
||||||
if (result.overall === "fail") {
|
|
||||||
findings.push({
|
|
||||||
check: "dynamic",
|
|
||||||
severity: "warn",
|
|
||||||
summary: `hybrid fixture: 0 layers passed (overall=fail)`,
|
|
||||||
evidence: [
|
|
||||||
"a total fixture fail usually means a precondition service is down",
|
|
||||||
"(gateway /health / sidecar / Langfuse /v1/chat) — NOT necessarily",
|
|
||||||
"the PR's code problem. Check service status before blaming the PR.",
|
|
||||||
],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
return findings;
|
|
||||||
}
|
|
||||||
@@ -1,580 +0,0 @@
|
|||||||
// Cloud inference check — wraps the proven run_codereview pattern
|
|
||||||
// from llm_team_ui.py (same 3-stage framing, same cloud model) to
|
|
||||||
// critique a PR's claims against its diff.
|
|
||||||
//
|
|
||||||
// Proved out 2026-04-22 via /tmp/codereview_runner.py — gpt-oss:120b
|
|
||||||
// caught a real ternary bug in auditor/fixtures/hybrid_38_40_45.ts
|
|
||||||
// that unit tests missed. This module reuses the reviewer prompt
|
|
||||||
// shape (bugs / security / performance / style / edge cases) and
|
|
||||||
// adds claim-vs-diff specific framing.
|
|
||||||
//
|
|
||||||
// Call surface: runInferenceCheck(claims, diff) → Finding[].
|
|
||||||
// Cloud latency budget: ~60s (gpt-oss:120b reviewer typically 35-50s
|
|
||||||
// with a 15KB diff + claim list).
|
|
||||||
|
|
||||||
import type { Claim, Finding } from "../types.ts";
|
|
||||||
import { Glob } from "bun";
|
|
||||||
import { readFile, mkdir, appendFile } from "node:fs/promises";
|
|
||||||
import { extractFacts } from "../fact_extractor.ts";
|
|
||||||
|
|
||||||
const GATEWAY = process.env.LH_GATEWAY_URL ?? "http://localhost:3100";
|
|
||||||
// Rebuild 2026-04-26: route claim verification through /v1/mode/execute
|
|
||||||
// (task_class=pr_audit) so we get pathway memory + lakehouse_answers_v1
|
|
||||||
// + JSON-shaped framing molded into ONE prompt. The hand-rolled
|
|
||||||
// systemMsg/userMsg path was reinventing the mode runner badly.
|
|
||||||
//
|
|
||||||
// 2026-04-27 update: original default kimi-k2:1t hit a sustained
|
|
||||||
// upstream outage on Ollama Cloud (consistent 500 ISE across hours of
|
|
||||||
// retries — verified with trivial 8-token probes). Swapped default to
|
|
||||||
// deepseek-v3.1:671b which is proven working end-to-end through the
|
|
||||||
// pr_audit mode runner during Phase 5 distillation acceptance testing.
|
|
||||||
// kimi-k2:1t can be re-selected via LH_AUDITOR_REVIEW_MODEL env when
|
|
||||||
// the upstream returns. Tie-breaker stays grok-4.1-fast (different
|
|
||||||
// vendor lineage so consensus + tie-break won't fail-correlate).
|
|
||||||
const MODEL = process.env.LH_AUDITOR_REVIEW_MODEL ?? "deepseek-v3.1:671b";
|
|
||||||
const TIEBREAKER_MODEL = process.env.LH_AUDITOR_TIEBREAKER_MODEL ?? "x-ai/grok-4.1-fast";
|
|
||||||
const N_CONSENSUS = Number(process.env.LH_AUDITOR_CONSENSUS_N ?? 3);
|
|
||||||
const AUDIT_DISCREPANCIES_JSONL = "/home/profit/lakehouse/data/_kb/audit_discrepancies.jsonl";
|
|
||||||
// 40KB comfortably fits the consensus models' context windows
|
|
||||||
// (deepseek-v3.1 64K, gpt-oss-120b 128K). When the raw PR diff
|
|
||||||
// exceeds this, we truncate and signal it via curationNote — the
|
|
||||||
// pr_audit mode runner's matrix retrieval (lakehouse_answers_v1 +
|
|
||||||
// arch + symbols) supplies the cross-PR context that tree-split
|
|
||||||
// used to synthesize from scratch. Tree-split itself was retired
|
|
||||||
// 2026-04-27 (see commit deleting treeSplitDiff/callCloud/SHARD_*).
|
|
||||||
const MAX_DIFF_CHARS = 40000;
|
|
||||||
const CALL_TIMEOUT_MS = 120_000;
|
|
||||||
// Mode runner can take longer than a raw /v1/chat call because it does
|
|
||||||
// pathway-fingerprint lookup + matrix retrieval + relevance filter
|
|
||||||
// before the LLM call. Budget extra time so we don't trip on a slow
|
|
||||||
// answers-corpus search.
|
|
||||||
const MODE_RUNNER_TIMEOUT_MS = 240_000;
|
|
||||||
const REPO_ROOT = "/home/profit/lakehouse";
|
|
||||||
|
|
||||||
export interface InferenceContext {
|
|
||||||
pr_number: number;
|
|
||||||
head_sha: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
const AUDIT_FACTS_JSONL = "/home/profit/lakehouse/data/_kb/audit_facts.jsonl";
|
|
||||||
|
|
||||||
export async function runInferenceCheck(
|
|
||||||
claims: Claim[],
|
|
||||||
diff: string,
|
|
||||||
ctx?: InferenceContext,
|
|
||||||
): Promise<Finding[]> {
|
|
||||||
if (claims.length === 0) {
|
|
||||||
return [{
|
|
||||||
check: "inference",
|
|
||||||
severity: "info",
|
|
||||||
summary: "no ship-claims extracted — skipping cloud inference",
|
|
||||||
evidence: ["parser returned empty claim list; nothing to verify against cloud"],
|
|
||||||
}];
|
|
||||||
}
|
|
||||||
|
|
||||||
// Empirical claims (runtime metrics / observed outcomes) can't be
|
|
||||||
// verified from the diff. Drop them from the cloud prompt so the
|
|
||||||
// reviewer doesn't chase ghosts. A future `runtime_evidence` check
|
|
||||||
// can validate these against data/_kb/*/summary.json outputs.
|
|
||||||
const verifiable = claims.filter(c => c.strength !== "empirical");
|
|
||||||
const empiricalCount = claims.length - verifiable.length;
|
|
||||||
if (verifiable.length === 0) {
|
|
||||||
return [{
|
|
||||||
check: "inference",
|
|
||||||
severity: "info",
|
|
||||||
summary: `all ${claims.length} claims are empirical (runtime metrics) — skipping cloud inference`,
|
|
||||||
evidence: [`empirical claims can't be verified from a static diff; needs runtime-evidence check`],
|
|
||||||
}];
|
|
||||||
}
|
|
||||||
|
|
||||||
// 2026-04-27 architecture simplification: dropped the tree-split
|
|
||||||
// scratchpad layer. Rationale: the mode runner's pr_audit pipeline
|
|
||||||
// pulls from lakehouse_answers_v1 (gold-standard prior audits) +
|
|
||||||
// lakehouse_arch_v1 + lakehouse_symbols_v1 via matrix retrieval. That
|
|
||||||
// corpus IS the cross-PR context the tree-split was synthesizing
|
|
||||||
// from scratch on every audit run. With the distillation substrate
|
|
||||||
// shipped (commits 27b1d27..1b433a9), per-shard fact extraction is
|
|
||||||
// redundant — and gpt-oss:120b at 168 calls/audit was the dominant
|
|
||||||
// cost. Now: truncate diff to MAX_DIFF_CHARS, hand straight to the
|
|
||||||
// mode runner, let retrieval supply context. ONE strong-model call
|
|
||||||
// per consensus rep × N=3 reps = 3 calls total per audit.
|
|
||||||
const truncated = diff.length > MAX_DIFF_CHARS
|
|
||||||
? diff.slice(0, MAX_DIFF_CHARS) + `\n...[${diff.length - MAX_DIFF_CHARS} more chars truncated — the pr_audit mode runner has matrix retrieval against lakehouse_answers_v1 + arch + symbols for cross-PR context]`
|
|
||||||
: diff;
|
|
||||||
const curationNote = diff.length > MAX_DIFF_CHARS
|
|
||||||
? ` (truncated ${diff.length}→${MAX_DIFF_CHARS} chars; matrix retrieval supplies cross-PR context)`
|
|
||||||
: "";
|
|
||||||
|
|
||||||
// Build the reviewer prompt in the same shape as run_codereview's
|
|
||||||
// review stage (llm_team_ui.py:10950), adapted for claim verification:
|
|
||||||
// "Task: ..."
|
|
||||||
// "Code: ..."
|
|
||||||
// "Review: bugs/security/perf/style/edge. Provide corrected code."
|
|
||||||
// We add: claim list upfront + ask for structured JSON verdict.
|
|
||||||
//
|
|
||||||
// Curation flag is now just a truncation flag — when the diff was
|
|
||||||
// cut, tell the reviewer it didn't see the full picture so it doesn't
|
|
||||||
// confidently mark a claim NOT BACKED based on absence in the
|
|
||||||
// (potentially incomplete) input.
|
|
||||||
const isCurated = curationNote.length > 0;
|
|
||||||
const prNumber = ctx?.pr_number ?? 0;
|
|
||||||
|
|
||||||
// N=3 consensus — fire the mode runner three times in parallel.
|
|
||||||
// Each /v1/mode/execute call composes pathway memory + answers corpus
|
|
||||||
// + JSON-shaped pr_audit framing internally, so the auditor's only
|
|
||||||
// job here is to vote-aggregate. Wall-clock ~= single call.
|
|
||||||
const primaryRuns = await Promise.all(
|
|
||||||
Array.from({ length: N_CONSENSUS }, () =>
|
|
||||||
runModeRunnerInference(truncated, verifiable, prNumber, isCurated, MODEL)),
|
|
||||||
);
|
|
||||||
|
|
||||||
const parsedRuns = primaryRuns.filter(r => r.parsed !== null);
|
|
||||||
if (parsedRuns.length === 0) {
|
|
||||||
// All N calls failed. Surface the first-run diagnostic so the
|
|
||||||
// operator sees *why* (unreachable / non-200 / unparseable).
|
|
||||||
const first = primaryRuns[0];
|
|
||||||
return [{
|
|
||||||
check: "inference",
|
|
||||||
severity: "info",
|
|
||||||
summary: `cloud inference all ${N_CONSENSUS} consensus runs failed — ${first.error ?? "unknown"}`,
|
|
||||||
evidence: [
|
|
||||||
`first-run diagnostic: ${first.diagnostic ?? "(none)"}`,
|
|
||||||
`successful runs: 0 / ${N_CONSENSUS}`,
|
|
||||||
],
|
|
||||||
}];
|
|
||||||
}
|
|
||||||
|
|
||||||
// Aggregate votes per claim_idx.
|
|
||||||
interface Votes { trues: number; falses: number; evidences: string[] }
|
|
||||||
const votesByClaim = new Map<number, Votes>();
|
|
||||||
const unflaggedByRun: any[][] = [];
|
|
||||||
// The N=3 consensus calls run via Promise.all — wall-clock is
|
|
||||||
// bounded by the SLOWEST call, not the sum. Pre-2026-04-27 we
|
|
||||||
// summed and reported "Xms total" which double/triple-counted
|
|
||||||
// (Opus self-audit caught it). Use max for accurate wall-clock.
|
|
||||||
let maxLatencyMs = 0;
|
|
||||||
let totalEnrichedChars = 0;
|
|
||||||
let bugFingerprintsSeen = 0;
|
|
||||||
let matrixKeptSeen = 0;
|
|
||||||
for (const run of parsedRuns) {
|
|
||||||
maxLatencyMs = Math.max(maxLatencyMs, run.latency_ms ?? 0);
|
|
||||||
totalEnrichedChars += run.enriched_chars ?? 0;
|
|
||||||
bugFingerprintsSeen = Math.max(bugFingerprintsSeen, run.bug_fingerprints ?? 0);
|
|
||||||
matrixKeptSeen = Math.max(matrixKeptSeen, run.matrix_kept ?? 0);
|
|
||||||
unflaggedByRun.push(Array.isArray(run.parsed?.unflagged_gaps) ? run.parsed.unflagged_gaps : []);
|
|
||||||
for (const v of run.parsed?.claim_verdicts ?? []) {
|
|
||||||
const idx = Number(v?.claim_idx);
|
|
||||||
if (!Number.isFinite(idx)) continue;
|
|
||||||
const rec = votesByClaim.get(idx) ?? { trues: 0, falses: 0, evidences: [] };
|
|
||||||
if (v.backed === false) {
|
|
||||||
rec.falses++;
|
|
||||||
rec.evidences.push(String(v.evidence ?? ""));
|
|
||||||
} else if (v.backed === true) {
|
|
||||||
rec.trues++;
|
|
||||||
}
|
|
||||||
votesByClaim.set(idx, rec);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
const findings: Finding[] = [];
|
|
||||||
|
|
||||||
// Summary finding so the verdict layer knows the check ran.
|
|
||||||
findings.push({
|
|
||||||
check: "inference",
|
|
||||||
severity: "info",
|
|
||||||
summary: `pr_audit mode runner completed (model=${MODEL}, consensus=${parsedRuns.length}/${N_CONSENSUS}, ${maxLatencyMs}ms wall-clock)${curationNote}`,
|
|
||||||
evidence: [
|
|
||||||
`claims voted: ${votesByClaim.size}`,
|
|
||||||
`parsed runs: ${parsedRuns.length} / ${N_CONSENSUS}`,
|
|
||||||
`enrichment: ${bugFingerprintsSeen} bug fingerprints, ${matrixKeptSeen} answers-corpus chunks, prompt avg ${Math.round(totalEnrichedChars / Math.max(parsedRuns.length, 1))} chars`,
|
|
||||||
],
|
|
||||||
});
|
|
||||||
|
|
||||||
// Per-claim majority vote; tie-break if no majority.
|
|
||||||
const discrepancies: Array<{
|
|
||||||
claim_idx: number;
|
|
||||||
claim_text: string;
|
|
||||||
votes: { trues: number; falses: number };
|
|
||||||
resolution: "majority_backed" | "majority_not_backed" | "tiebreaker_backed" | "tiebreaker_not_backed" | "unresolved";
|
|
||||||
tiebreaker_model?: string;
|
|
||||||
}> = [];
|
|
||||||
|
|
||||||
for (const [idx, votes] of votesByClaim) {
|
|
||||||
const claim = verifiable[idx];
|
|
||||||
if (!claim) continue;
|
|
||||||
const totalVotes = votes.trues + votes.falses;
|
|
||||||
let notBacked: boolean | null = null;
|
|
||||||
let resolution: typeof discrepancies[number]["resolution"] = "majority_backed";
|
|
||||||
let evidenceText = "";
|
|
||||||
let tbModel: string | undefined;
|
|
||||||
|
|
||||||
if (votes.falses > votes.trues) {
|
|
||||||
notBacked = true;
|
|
||||||
resolution = "majority_not_backed";
|
|
||||||
evidenceText = votes.evidences[0] ?? "(no reason given)";
|
|
||||||
} else if (votes.trues > votes.falses) {
|
|
||||||
notBacked = false;
|
|
||||||
resolution = "majority_backed";
|
|
||||||
} else {
|
|
||||||
// Tie. Run tie-breaker with a different-architecture model
|
|
||||||
// through the same mode runner so framing/enrichment match.
|
|
||||||
const tb = await runModeRunnerInference(truncated, verifiable, prNumber, isCurated, TIEBREAKER_MODEL);
|
|
||||||
if (tb.parsed) {
|
|
||||||
const tv = (tb.parsed.claim_verdicts ?? []).find((v: any) => Number(v?.claim_idx) === idx);
|
|
||||||
if (tv?.backed === false) {
|
|
||||||
notBacked = true;
|
|
||||||
resolution = "tiebreaker_not_backed";
|
|
||||||
evidenceText = `(tie-breaker ${TIEBREAKER_MODEL}) ${String(tv.evidence ?? "")}`;
|
|
||||||
tbModel = TIEBREAKER_MODEL;
|
|
||||||
} else if (tv?.backed === true) {
|
|
||||||
notBacked = false;
|
|
||||||
resolution = "tiebreaker_backed";
|
|
||||||
tbModel = TIEBREAKER_MODEL;
|
|
||||||
} else {
|
|
||||||
resolution = "unresolved";
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
resolution = "unresolved";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Log every case where the N runs disagreed — discrepancies are
|
|
||||||
// signal, not noise. Separate from audit_lessons.jsonl because
|
|
||||||
// they're about the *auditor's* quality, not the PR's quality.
|
|
||||||
const disagreed = totalVotes >= 2 && votes.trues > 0 && votes.falses > 0;
|
|
||||||
if (disagreed || resolution.startsWith("tiebreaker") || resolution === "unresolved") {
|
|
||||||
discrepancies.push({
|
|
||||||
claim_idx: idx,
|
|
||||||
claim_text: claim.text,
|
|
||||||
votes: { trues: votes.trues, falses: votes.falses },
|
|
||||||
resolution,
|
|
||||||
tiebreaker_model: tbModel,
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
if (notBacked === true) {
|
|
||||||
const sev: Finding["severity"] = claim.strength === "strong" ? "block"
|
|
||||||
: claim.strength === "moderate" ? "warn"
|
|
||||||
: "info";
|
|
||||||
findings.push({
|
|
||||||
check: "inference",
|
|
||||||
severity: sev,
|
|
||||||
claim_text: claim.text,
|
|
||||||
summary: `cloud: claim not backed — "${claim.text.slice(0, 100)}"`,
|
|
||||||
evidence: [
|
|
||||||
`at ${claim.location}`,
|
|
||||||
`consensus: ${votes.falses}/${totalVotes} not-backed (resolution: ${resolution})`,
|
|
||||||
`cloud reason: ${evidenceText.slice(0, 200)}`,
|
|
||||||
],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Persist discrepancies so we can measure consensus drift over time.
|
|
||||||
if (discrepancies.length > 0 && ctx) {
|
|
||||||
persistDiscrepancies(ctx, discrepancies).catch(e =>
|
|
||||||
console.error(`[inference] discrepancy log failed: ${(e as Error).message}`));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Use first run's parsed for downstream unflagged_gaps processing.
|
|
||||||
const parsed = parsedRuns[0].parsed;
|
|
||||||
|
|
||||||
// Route the curated scratchpad through llm_team's extract-facts
|
|
||||||
// pipeline when we have (a) a curated scratchpad (best signal about
|
|
||||||
// what the PR actually changed) and (b) PR context to scope facts.
|
|
||||||
// AWAITED (not fire-and-forget) so CLI callers like audit_one.ts
|
|
||||||
// don't exit before extraction lands; the systemd poller has plenty
|
|
||||||
// of headroom (90s cycle vs ~15s extraction). A failure inside
|
|
||||||
// extractAndPersistFacts is caught + logged but never throws.
|
|
||||||
// Post-2026-04-27: extraction now runs against the truncated diff
|
|
||||||
// (no scratchpad to extract from since tree-split was retired).
|
|
||||||
// Fact extraction is still useful for surfacing entities/symbols
|
|
||||||
// into audit_facts.jsonl even from truncated input.
|
|
||||||
if (isCurated && ctx && process.env.LH_AUDITOR_SKIP_EXTRACT !== "1") {
|
|
||||||
try {
|
|
||||||
await extractAndPersistFacts(truncated, ctx);
|
|
||||||
} catch (e) {
|
|
||||||
console.error(`[inference] fact extraction failed: ${(e as Error).message}`);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Belt-and-suspenders: when operating on a curated scratchpad, drop
|
|
||||||
// the unflagged_gaps section entirely. The distillation can't
|
|
||||||
// reliably ground gap-detection, and false positives are worse than
|
|
||||||
// misses for this signal class. The systemMsg already asks the
|
|
||||||
// cloud to skip this section when curated — but the model may still
|
|
||||||
// emit it, so we filter here too.
|
|
||||||
const gapsToEmit = isCurated ? [] : (parsed.unflagged_gaps ?? []);
|
|
||||||
for (const g of gapsToEmit) {
|
|
||||||
const summary = String(g?.summary ?? "?");
|
|
||||||
const location = String(g?.location ?? "?");
|
|
||||||
// False-positive guard — when the cloud says "X not defined in this
|
|
||||||
// diff" or "missing implementation of X", the cloud may just mean
|
|
||||||
// "X is not in the added lines," not "X doesn't exist in the repo."
|
|
||||||
// Extract candidate symbol names and grep the repo. If any symbol
|
|
||||||
// is defined elsewhere, drop the finding — it's a known-symbol
|
|
||||||
// reference, not a placeholder.
|
|
||||||
if (/not\s+defined|missing\s+implementation|never\s+referenced\s+or\s+integrated/i.test(summary)) {
|
|
||||||
const symbols = extractSymbols(summary);
|
|
||||||
if (symbols.length > 0) {
|
|
||||||
const resolved = await symbolsExistInRepo(symbols);
|
|
||||||
if (resolved.length === symbols.length) {
|
|
||||||
// Every named symbol exists somewhere in the repo — silent drop.
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
if (resolved.length > 0) {
|
|
||||||
// Partially resolved — demote to info with a note.
|
|
||||||
findings.push({
|
|
||||||
check: "inference",
|
|
||||||
severity: "info",
|
|
||||||
summary: `cloud gap partially resolved by repo grep: ${summary.slice(0, 120)}`,
|
|
||||||
evidence: [
|
|
||||||
`location: ${location.slice(0, 140)}`,
|
|
||||||
`resolved via grep: ${resolved.join(",")}`,
|
|
||||||
`unresolved: ${symbols.filter(s => !resolved.includes(s)).join(",")}`,
|
|
||||||
],
|
|
||||||
});
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
findings.push({
|
|
||||||
check: "inference",
|
|
||||||
severity: "warn",
|
|
||||||
summary: `cloud-flagged gap not in any claim: ${summary.slice(0, 120)}`,
|
|
||||||
evidence: [`location: ${location.slice(0, 140)}`],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
return findings;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Single mode-runner call — consensus + tie-breaker dispatch through
|
|
||||||
// here. Returns parsed JSON shape + telemetry from /v1/mode/execute
|
|
||||||
// (latency, enrichment metrics) + any error diagnostic. NEVER throws.
|
|
||||||
// The consensus aggregator handles partial failures by dropping
|
|
||||||
// non-parsed runs from the vote.
|
|
||||||
interface CloudRunResult {
|
|
||||||
parsed: any | null;
|
|
||||||
latency_ms: number;
|
|
||||||
enriched_chars: number;
|
|
||||||
bug_fingerprints: number;
|
|
||||||
matrix_kept: number;
|
|
||||||
error?: string; // "unreachable" | "non_200" | "unparseable"
|
|
||||||
diagnostic?: string; // first 200 chars for debugging
|
|
||||||
model: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
async function runModeRunnerInference(
|
|
||||||
diffOrScratchpad: string,
|
|
||||||
claims: Claim[],
|
|
||||||
prNumber: number,
|
|
||||||
isCurated: boolean,
|
|
||||||
model: string,
|
|
||||||
): Promise<CloudRunResult> {
|
|
||||||
// user_question carries the claim list + the curation note (if any).
|
|
||||||
// pr_audit's framing (mode.rs FRAMING_PR_AUDIT) holds the JSON shape +
|
|
||||||
// strict-output rules so we don't repeat them here.
|
|
||||||
const claimDigest = claims
|
|
||||||
.map((c, i) => ` ${i}. [${c.strength}] "${c.text}" at ${c.location}`)
|
|
||||||
.join("\n");
|
|
||||||
const curationNote = isCurated
|
|
||||||
? "\n\nNOTE: the FILE below is a curated multi-shard scratchpad of the diff, not the raw diff itself. Absence in the scratchpad is NOT evidence of absence in the actual diff. Only mark backed=false on direct contradiction (e.g. scratchpad shows the function is empty / a stub). Skip unflagged_gaps entirely when scratchpad is curated."
|
|
||||||
: "";
|
|
||||||
const userQuestion = [
|
|
||||||
"Verify each ship-claim against the diff (or scratchpad).",
|
|
||||||
"",
|
|
||||||
"Ship-claims (numbered 0..N-1):",
|
|
||||||
claimDigest,
|
|
||||||
curationNote,
|
|
||||||
"",
|
|
||||||
"Every claim above must produce exactly one claim_verdicts entry. Output strict JSON only — no prose outside the JSON object.",
|
|
||||||
].join("\n");
|
|
||||||
|
|
||||||
let resp: Response;
|
|
||||||
try {
|
|
||||||
resp = await fetch(`${GATEWAY}/v1/mode/execute`, {
|
|
||||||
method: "POST",
|
|
||||||
headers: { "content-type": "application/json" },
|
|
||||||
body: JSON.stringify({
|
|
||||||
task_class: "pr_audit",
|
|
||||||
file_path: `pr-${prNumber}.diff`,
|
|
||||||
file_content: diffOrScratchpad,
|
|
||||||
user_question: userQuestion,
|
|
||||||
force_model: model,
|
|
||||||
force_temperature: 0,
|
|
||||||
}),
|
|
||||||
signal: AbortSignal.timeout(MODE_RUNNER_TIMEOUT_MS),
|
|
||||||
});
|
|
||||||
} catch (e) {
|
|
||||||
return {
|
|
||||||
parsed: null, latency_ms: 0, enriched_chars: 0, bug_fingerprints: 0, matrix_kept: 0,
|
|
||||||
error: "unreachable", diagnostic: (e as Error).message.slice(0, 200), model,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
if (!resp.ok) {
|
|
||||||
return {
|
|
||||||
parsed: null, latency_ms: 0, enriched_chars: 0, bug_fingerprints: 0, matrix_kept: 0,
|
|
||||||
error: "non_200", diagnostic: `${resp.status}: ${(await resp.text()).slice(0, 160)}`, model,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
let body: any;
|
|
||||||
try { body = await resp.json(); }
|
|
||||||
catch (e) {
|
|
||||||
return {
|
|
||||||
parsed: null, latency_ms: 0, enriched_chars: 0, bug_fingerprints: 0, matrix_kept: 0,
|
|
||||||
error: "unparseable", diagnostic: (e as Error).message, model,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
const content: string = typeof body?.response === "string" ? body.response : "";
|
|
||||||
const parsed = extractJson(content);
|
|
||||||
// Number-coerced extractors so a non-numeric upstream value (string,
|
|
||||||
// null, NaN) collapses to 0 instead of poisoning downstream
|
|
||||||
// arithmetic. Caught 2026-04-27 by kimi_architect self-audit —
|
|
||||||
// optional-chaining + ?? only catches null/undefined, not type drift.
|
|
||||||
const num = (v: unknown): number => {
|
|
||||||
const n = typeof v === "number" ? v : Number(v);
|
|
||||||
return Number.isFinite(n) ? n : 0;
|
|
||||||
};
|
|
||||||
return {
|
|
||||||
parsed,
|
|
||||||
latency_ms: num(body?.latency_ms),
|
|
||||||
enriched_chars: num(body?.enriched_prompt_chars),
|
|
||||||
bug_fingerprints: num(body?.sources?.bug_fingerprints_count),
|
|
||||||
matrix_kept: num(body?.sources?.matrix_chunks_kept),
|
|
||||||
error: parsed ? undefined : "unparseable",
|
|
||||||
diagnostic: parsed ? undefined : content.slice(0, 200),
|
|
||||||
model,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
async function persistDiscrepancies(ctx: InferenceContext, discrepancies: any[]): Promise<void> {
|
|
||||||
await mkdir("/home/profit/lakehouse/data/_kb", { recursive: true });
|
|
||||||
const rows = discrepancies.map(d => JSON.stringify({
|
|
||||||
pr_number: ctx.pr_number,
|
|
||||||
head_sha: ctx.head_sha,
|
|
||||||
logged_at: new Date().toISOString(),
|
|
||||||
...d,
|
|
||||||
}));
|
|
||||||
await appendFile(AUDIT_DISCREPANCIES_JSONL, rows.join("\n") + "\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
// Extract structured knowledge from the curated scratchpad and append
|
|
||||||
// to data/_kb/audit_facts.jsonl — one row per extract run, keyed by
|
|
||||||
// PR number + head SHA for scope tracking. kb_query tails this next
|
|
||||||
// audit to surface recurring entities/relationships across PRs.
|
|
||||||
async function extractAndPersistFacts(scratchpad: string, ctx: InferenceContext): Promise<void> {
|
|
||||||
const ex = await extractFacts(scratchpad);
|
|
||||||
if (ex.error && ex.entities.length === 0 && ex.facts.length === 0) {
|
|
||||||
// Full failure — log but don't write an empty row.
|
|
||||||
console.error(`[inference] extractFacts skipped row: ${ex.error}`);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
const row = {
|
|
||||||
pr_number: ctx.pr_number,
|
|
||||||
head_sha: ctx.head_sha,
|
|
||||||
extracted_at: ex.extracted_at,
|
|
||||||
extractor: ex.extractor_model,
|
|
||||||
verifier: ex.verifier_model,
|
|
||||||
llm_team_run_id: ex.llm_team_run_id ?? null,
|
|
||||||
facts: ex.facts,
|
|
||||||
entities: ex.entities,
|
|
||||||
relationships: ex.relationships,
|
|
||||||
verification_preview: ex.verification.slice(0, 400),
|
|
||||||
verifier_verdicts: ex.verifier_verdicts,
|
|
||||||
facts_dropped_by_verifier: ex.facts_dropped_by_verifier ?? 0,
|
|
||||||
schema_version: 2,
|
|
||||||
source: "audit_inference",
|
|
||||||
};
|
|
||||||
await mkdir("/home/profit/lakehouse/data/_kb", { recursive: true });
|
|
||||||
await appendFile(AUDIT_FACTS_JSONL, JSON.stringify(row) + "\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
// Pull out plausible code-symbol names from a summary string.
|
|
||||||
// Matches:
|
|
||||||
// - identifier with backticks: `foo_bar`
|
|
||||||
// - identifier followed by parens: foo_bar()
|
|
||||||
// - CamelCase types
|
|
||||||
// - snake_case_functions
|
|
||||||
// Filters out common English words that could be matched accidentally.
|
|
||||||
const STOPWORDS = new Set([
|
|
||||||
"not","the","and","for","this","that","with","but","are","was","has",
|
|
||||||
"have","been","any","missing","implementation","diff","defined","never",
|
|
||||||
"referenced","integrated","flow","code","file","some","only","when",
|
|
||||||
]);
|
|
||||||
function extractSymbols(text: string): string[] {
|
|
||||||
const out = new Set<string>();
|
|
||||||
// `backticked` symbols
|
|
||||||
for (const m of text.matchAll(/`([A-Za-z_][A-Za-z0-9_]{2,})`/g)) out.add(m[1]);
|
|
||||||
// foo() or foo_bar() calls
|
|
||||||
for (const m of text.matchAll(/\b([A-Za-z_][A-Za-z0-9_]{2,})\s*\(/g)) out.add(m[1]);
|
|
||||||
// CamelCase types (3+ chars, must start with uppercase)
|
|
||||||
for (const m of text.matchAll(/\b([A-Z][A-Za-z0-9]{2,})\b/g)) out.add(m[1]);
|
|
||||||
return Array.from(out).filter(s => !STOPWORDS.has(s.toLowerCase()));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Scan the repo for at least one definition of each symbol. Uses Bun's
|
|
||||||
// Glob to walk TS/Rust/Python/JS sources; ignores node_modules, data/,
|
|
||||||
// and target/. Skips files > 500KB — those are fixtures/snapshots that
|
|
||||||
// won't contain a definition line and slurping them slows the audit.
|
|
||||||
async function symbolsExistInRepo(symbols: string[]): Promise<string[]> {
|
|
||||||
const patterns = ["**/*.ts", "**/*.tsx", "**/*.rs", "**/*.py", "**/*.js"];
|
|
||||||
const skip = (p: string) => p.includes("/node_modules/") || p.startsWith("data/") || p.includes("/target/") || p.startsWith("dist/");
|
|
||||||
const MAX_FILE_BYTES = 500_000;
|
|
||||||
const { stat } = await import("node:fs/promises");
|
|
||||||
const resolved = new Set<string>();
|
|
||||||
const toFind = new Set(symbols);
|
|
||||||
for (const pat of patterns) {
|
|
||||||
if (toFind.size === 0) break;
|
|
||||||
const glob = new Glob(pat);
|
|
||||||
for await (const f of glob.scan({ cwd: REPO_ROOT, onlyFiles: true })) {
|
|
||||||
if (skip(f)) continue;
|
|
||||||
try { const s = await stat(`${REPO_ROOT}/${f}`); if (s.size > MAX_FILE_BYTES) continue; } catch { continue; }
|
|
||||||
let content: string;
|
|
||||||
try { content = await readFile(`${REPO_ROOT}/${f}`, "utf8"); } catch { continue; }
|
|
||||||
for (const sym of Array.from(toFind)) {
|
|
||||||
// Definition heuristics: `function sym`, `fn sym`, `const sym`,
|
|
||||||
// `let sym`, `def sym`, `class sym`, `struct sym`, `enum sym`,
|
|
||||||
// `trait sym`, `async function sym`, `pub (async )?fn sym`.
|
|
||||||
const re = new RegExp(
|
|
||||||
`\\b(function|async\\s+function|const|let|var|def|class|struct|enum|trait|impl|type|interface|fn|pub\\s+(async\\s+)?fn)\\s+${escapeRe(sym)}\\b`
|
|
||||||
);
|
|
||||||
if (re.test(content)) {
|
|
||||||
resolved.add(sym);
|
|
||||||
toFind.delete(sym);
|
|
||||||
if (toFind.size === 0) break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return Array.from(resolved);
|
|
||||||
}
|
|
||||||
|
|
||||||
function escapeRe(s: string): string {
|
|
||||||
return s.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
|
|
||||||
}
|
|
||||||
|
|
||||||
// Lift the first balanced JSON object out of the response. Tolerates
|
|
||||||
// leading prose, code fences, and model reasoning preamble when the
|
|
||||||
// cloud model ignored "strict JSON only."
|
|
||||||
function extractJson(text: string): any | null {
|
|
||||||
const cleaned = text.replace(/^```(?:json)?\s*/im, "").replace(/```\s*$/im, "");
|
|
||||||
let depth = 0;
|
|
||||||
let start = -1;
|
|
||||||
for (let i = 0; i < cleaned.length; i++) {
|
|
||||||
const c = cleaned[i];
|
|
||||||
if (c === "{") {
|
|
||||||
if (depth === 0) start = i;
|
|
||||||
depth++;
|
|
||||||
} else if (c === "}") {
|
|
||||||
depth--;
|
|
||||||
if (depth === 0 && start >= 0) {
|
|
||||||
try { return JSON.parse(cleaned.slice(start, i + 1)); } catch { start = -1; }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
@@ -1,397 +0,0 @@
|
|||||||
// Local-KB check — reads data/_kb/ + data/_observer/ + data/_bot/
|
|
||||||
// for prior evidence bearing on this PR's claims. Cheap, offline,
|
|
||||||
// no model calls. The point: if a claim like "Phase X shipped" has
|
|
||||||
// a historical record of failing on the same signature before, the
|
|
||||||
// auditor surfaces that pattern before the cloud check has to
|
|
||||||
// infer it.
|
|
||||||
//
|
|
||||||
// What this check reads (all file-backed, append-only or periodic):
|
|
||||||
// data/_kb/outcomes.jsonl — per-scenario outcomes (kb.ts)
|
|
||||||
// data/_kb/error_corrections.jsonl — fail→succeed deltas on same sig
|
|
||||||
// data/_kb/scrum_reviews.jsonl — scrum-master accepted reviews
|
|
||||||
// data/_observer/ops.jsonl — observer ring → disk stream
|
|
||||||
// data/_bot/cycles/*.json — bot cycle results
|
|
||||||
//
|
|
||||||
// Each JSONL line / per-cycle file is small; this check reads tails
|
|
||||||
// only (last N lines or last M files) to stay cheap on large corpora.
|
|
||||||
|
|
||||||
import { readFile, readdir, stat } from "node:fs/promises";
|
|
||||||
import { join } from "node:path";
|
|
||||||
import type { Claim, Finding } from "../types.ts";
|
|
||||||
import { aggregate, ratingSeverity, formatAgg } from "../kb_index.ts";
|
|
||||||
|
|
||||||
const KB_DIR = "/home/profit/lakehouse/data/_kb";
|
|
||||||
const OBSERVER_OPS = "/home/profit/lakehouse/data/_observer/ops.jsonl";
|
|
||||||
const BOT_CYCLES_DIR = "/home/profit/lakehouse/data/_bot/cycles";
|
|
||||||
const SCRUM_REVIEWS_JSONL = "/home/profit/lakehouse/data/_kb/scrum_reviews.jsonl";
|
|
||||||
const AUDIT_LESSONS_JSONL = "/home/profit/lakehouse/data/_kb/audit_lessons.jsonl";
|
|
||||||
const AUDIT_FACTS_JSONL = "/home/profit/lakehouse/data/_kb/audit_facts.jsonl";
|
|
||||||
const TAIL_LINES = 500;
|
|
||||||
const MAX_BOT_CYCLE_FILES = 30;
|
|
||||||
|
|
||||||
export async function runKbCheck(claims: Claim[], prFiles: string[] = []): Promise<Finding[]> {
|
|
||||||
const findings: Finding[] = [];
|
|
||||||
|
|
||||||
// 1. Recent scenario outcomes: are strong-claim-style phrases showing
|
|
||||||
// up alongside failed events? That's "we claimed it worked" +
|
|
||||||
// "it didn't" in the KB.
|
|
||||||
const scenarioFindings = await checkScenarioOutcomes(claims);
|
|
||||||
findings.push(...scenarioFindings);
|
|
||||||
|
|
||||||
// 2. Error corrections: any of the claims text overlap a
|
|
||||||
// recently-observed fail→succeed pair? If yes, add context.
|
|
||||||
const correctionFindings = await checkErrorCorrections(claims);
|
|
||||||
findings.push(...correctionFindings);
|
|
||||||
|
|
||||||
// 3. Bot cycles: any prior bot cycle ended in tests_failed or
|
|
||||||
// apply_failed on a file this PR is also touching?
|
|
||||||
const botFindings = await checkBotCycles();
|
|
||||||
findings.push(...botFindings);
|
|
||||||
|
|
||||||
// 4. Observer: count recent error events. High volume = shared
|
|
||||||
// infra problem, worth flagging (context for other findings).
|
|
||||||
const obsFindings = await checkObserverStream();
|
|
||||||
findings.push(...obsFindings);
|
|
||||||
|
|
||||||
// 5. Scrum-master reviews — surface prior accepted reviews for any
|
|
||||||
// file in this PR's diff. Cohesion plan Phase C wire: the
|
|
||||||
// auditor gets to "borrow" the scrum-master's deeper per-file
|
|
||||||
// analysis instead of re-doing that work.
|
|
||||||
if (prFiles.length > 0) {
|
|
||||||
const scrumFindings = await checkScrumReviews(prFiles);
|
|
||||||
findings.push(...scrumFindings);
|
|
||||||
}
|
|
||||||
|
|
||||||
// 6b. Audit-facts (llm_team extract pipeline output) — surface
|
|
||||||
// entities that recur across multiple PRs. These are the
|
|
||||||
// "core system entities" accumulating in the knowledge base;
|
|
||||||
// showing them as info on future audits gives reviewers
|
|
||||||
// architectural context the raw diff doesn't convey.
|
|
||||||
const factFindings = await checkAuditFacts();
|
|
||||||
findings.push(...factFindings);
|
|
||||||
|
|
||||||
// 6. Audit-lessons feedback loop — summarize the top recurring
|
|
||||||
// patterns from prior audits' block/warn findings. If the same
|
|
||||||
// pattern signature has fired 3+ times across prior audits,
|
|
||||||
// emit it as a block-severity finding so reviewers know this
|
|
||||||
// is a known-recurring class, not a one-off. Does NOT couple
|
|
||||||
// to the current audit's static/inference findings (those run
|
|
||||||
// in parallel and we can't see them here) — the amplification
|
|
||||||
// is emergent: if the current audit's finding-summary matches
|
|
||||||
// a top recurrence, the reviewer sees both.
|
|
||||||
const auditLessonFindings = await checkAuditLessons();
|
|
||||||
findings.push(...auditLessonFindings);
|
|
||||||
|
|
||||||
return findings;
|
|
||||||
}
|
|
||||||
|
|
||||||
async function tailJsonl<T = any>(path: string, n: number): Promise<T[]> {
|
|
||||||
try {
|
|
||||||
const raw = await readFile(path, "utf8");
|
|
||||||
const lines = raw.split("\n").filter(l => l.length > 0);
|
|
||||||
const slice = lines.slice(-n);
|
|
||||||
const out: T[] = [];
|
|
||||||
for (const line of slice) {
|
|
||||||
try { out.push(JSON.parse(line)); } catch { /* skip malformed */ }
|
|
||||||
}
|
|
||||||
return out;
|
|
||||||
} catch {
|
|
||||||
return [];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
async function checkScenarioOutcomes(_claims: Claim[]): Promise<Finding[]> {
|
|
||||||
const outcomes = await tailJsonl<any>(join(KB_DIR, "outcomes.jsonl"), TAIL_LINES);
|
|
||||||
if (outcomes.length === 0) return [];
|
|
||||||
const totalEvents = outcomes.reduce((s, o) => s + (o.total_events ?? 0), 0);
|
|
||||||
const okEvents = outcomes.reduce((s, o) => s + (o.ok_events ?? 0), 0);
|
|
||||||
const failRate = totalEvents > 0 ? 1 - okEvents / totalEvents : 0;
|
|
||||||
|
|
||||||
if (totalEvents === 0) {
|
|
||||||
return [{
|
|
||||||
check: "kb_query",
|
|
||||||
severity: "info",
|
|
||||||
summary: `KB: no scenario outcomes on file — learning loop is empty`,
|
|
||||||
evidence: [`data/_kb/outcomes.jsonl has ${outcomes.length} entries with 0 total events`],
|
|
||||||
}];
|
|
||||||
}
|
|
||||||
|
|
||||||
const recent = outcomes.slice(-10);
|
|
||||||
const recentFailSigs: string[] = recent
|
|
||||||
.filter(o => (o.ok_events ?? 0) < (o.total_events ?? 0))
|
|
||||||
.map(o => o.sig_hash)
|
|
||||||
.filter(s => typeof s === "string");
|
|
||||||
|
|
||||||
const findings: Finding[] = [{
|
|
||||||
check: "kb_query",
|
|
||||||
severity: failRate > 0.3 ? "warn" : "info",
|
|
||||||
summary: `KB: ${outcomes.length} recent scenario runs, ${okEvents}/${totalEvents} events ok (fail rate ${(failRate * 100).toFixed(1)}%)`,
|
|
||||||
evidence: [
|
|
||||||
`most recent: ${recent[recent.length - 1]?.run_id ?? "?"}`,
|
|
||||||
`recent failing sigs: ${recentFailSigs.length > 0 ? recentFailSigs.slice(-3).join(", ") : "none"}`,
|
|
||||||
],
|
|
||||||
}];
|
|
||||||
return findings;
|
|
||||||
}
|
|
||||||
|
|
||||||
async function checkErrorCorrections(_claims: Claim[]): Promise<Finding[]> {
|
|
||||||
const corrections = await tailJsonl<any>(join(KB_DIR, "error_corrections.jsonl"), TAIL_LINES);
|
|
||||||
if (corrections.length === 0) return [];
|
|
||||||
return [{
|
|
||||||
check: "kb_query",
|
|
||||||
severity: "info",
|
|
||||||
summary: `KB: ${corrections.length} error corrections on file (fail→succeed pairs)`,
|
|
||||||
evidence: [
|
|
||||||
corrections.length > 0
|
|
||||||
? `most recent: ${String(corrections[corrections.length - 1]?.sig_hash ?? "?").slice(0, 24)}`
|
|
||||||
: "none",
|
|
||||||
],
|
|
||||||
}];
|
|
||||||
}
|
|
||||||
|
|
||||||
async function checkBotCycles(): Promise<Finding[]> {
|
|
||||||
let entries: string[] = [];
|
|
||||||
try { entries = await readdir(BOT_CYCLES_DIR); }
|
|
||||||
catch { return []; }
|
|
||||||
|
|
||||||
const jsonFiles = entries.filter(e => e.endsWith(".json"));
|
|
||||||
if (jsonFiles.length === 0) return [];
|
|
||||||
|
|
||||||
// Sort by mtime desc, take most recent N
|
|
||||||
const withStat = await Promise.all(
|
|
||||||
jsonFiles.map(async name => {
|
|
||||||
try { return { name, mtime: (await stat(join(BOT_CYCLES_DIR, name))).mtimeMs }; }
|
|
||||||
catch { return { name, mtime: 0 }; }
|
|
||||||
}),
|
|
||||||
);
|
|
||||||
const recent = withStat.sort((a, b) => b.mtime - a.mtime).slice(0, MAX_BOT_CYCLE_FILES);
|
|
||||||
|
|
||||||
const outcomes: Record<string, number> = {};
|
|
||||||
for (const { name } of recent) {
|
|
||||||
try {
|
|
||||||
const r = JSON.parse(await readFile(join(BOT_CYCLES_DIR, name), "utf8"));
|
|
||||||
const o = String(r.outcome ?? "unknown");
|
|
||||||
outcomes[o] = (outcomes[o] ?? 0) + 1;
|
|
||||||
} catch { /* skip */ }
|
|
||||||
}
|
|
||||||
|
|
||||||
const summary = Object.entries(outcomes)
|
|
||||||
.sort((a, b) => b[1] - a[1])
|
|
||||||
.map(([k, v]) => `${k}=${v}`)
|
|
||||||
.join(", ");
|
|
||||||
|
|
||||||
const failCount = (outcomes["tests_failed"] ?? 0) + (outcomes["apply_failed"] ?? 0) + (outcomes["model_failed"] ?? 0);
|
|
||||||
return [{
|
|
||||||
check: "kb_query",
|
|
||||||
severity: failCount > recent.length / 2 ? "warn" : "info",
|
|
||||||
summary: `KB: bot recorded ${recent.length} recent cycles — ${summary || "no outcomes parsed"}`,
|
|
||||||
evidence: [
|
|
||||||
`dir: ${BOT_CYCLES_DIR}`,
|
|
||||||
`fail-class total: ${failCount} / ${recent.length}`,
|
|
||||||
],
|
|
||||||
}];
|
|
||||||
}
|
|
||||||
|
|
||||||
async function checkObserverStream(): Promise<Finding[]> {
|
|
||||||
const ops = await tailJsonl<any>(OBSERVER_OPS, TAIL_LINES);
|
|
||||||
if (ops.length === 0) return [];
|
|
||||||
const failures = ops.filter(o => o.ok === false).length;
|
|
||||||
return [{
|
|
||||||
check: "kb_query",
|
|
||||||
severity: "info",
|
|
||||||
summary: `KB: observer stream ${ops.length} recent ops, ${failures} failures`,
|
|
||||||
evidence: [
|
|
||||||
`source: ${OBSERVER_OPS}`,
|
|
||||||
`by source: ${observerBySource(ops)}`,
|
|
||||||
],
|
|
||||||
}];
|
|
||||||
}
|
|
||||||
|
|
||||||
function observerBySource(ops: any[]): string {
|
|
||||||
const c: Record<string, number> = {};
|
|
||||||
for (const o of ops) {
|
|
||||||
const s = String(o.source ?? "unknown");
|
|
||||||
c[s] = (c[s] ?? 0) + 1;
|
|
||||||
}
|
|
||||||
return Object.entries(c).sort((a, b) => b[1] - a[1]).map(([k, v]) => `${k}=${v}`).join(", ") || "empty";
|
|
||||||
}
|
|
||||||
|
|
||||||
// Audit-facts — reads data/_kb/audit_facts.jsonl (populated by every
|
|
||||||
// curated inference run via llm_team's extract pipeline). Each row
|
|
||||||
// has arrays: facts, entities, relationships. We explode entities and
|
|
||||||
// aggregate them across PRs using kb_index. An entity seen in 3+ PRs
|
|
||||||
// is a "core system entity" — we surface the top N as info context.
|
|
||||||
//
|
|
||||||
// Filters out short names (<3 chars, likely qwen2.5 truncation
|
|
||||||
// artifacts) and generic types ("string", "number") that would
|
|
||||||
// otherwise dominate the ranking.
|
|
||||||
const ENTITY_NAME_MIN_LEN = 3;
|
|
||||||
const GENERIC_ENTITY_NAMES = new Set([
|
|
||||||
"string", "number", "boolean", "any", "void", "unknown", "never",
|
|
||||||
"object", "array", "function", "const", "let", "var", "true", "false",
|
|
||||||
"null", "undefined", "promise", "map", "set", "record",
|
|
||||||
]);
|
|
||||||
|
|
||||||
async function checkAuditFacts(): Promise<Finding[]> {
|
|
||||||
// Read raw rows — each row has multiple entities, so we can't just
|
|
||||||
// use aggregate() directly (it's one-signature-per-row). Explode
|
|
||||||
// entities into (row, entity) pairs, then aggregate by entity name.
|
|
||||||
let raw: string;
|
|
||||||
try { raw = await (await import("node:fs/promises")).readFile(AUDIT_FACTS_JSONL, "utf8"); }
|
|
||||||
catch { return []; }
|
|
||||||
const lines = raw.split("\n").filter(l => l.length > 0);
|
|
||||||
if (lines.length === 0) return [];
|
|
||||||
|
|
||||||
interface EntityRow { entity_key: string; pr_number: number; type: string; name: string; description: string }
|
|
||||||
const entityRows: EntityRow[] = [];
|
|
||||||
for (const line of lines.slice(-TAIL_LINES * 2)) {
|
|
||||||
let row: any;
|
|
||||||
try { row = JSON.parse(line); } catch { continue; }
|
|
||||||
const prNum = Number(row?.pr_number);
|
|
||||||
if (!Number.isFinite(prNum)) continue;
|
|
||||||
for (const e of Array.isArray(row?.entities) ? row.entities : []) {
|
|
||||||
const name = String(e?.name ?? "").trim();
|
|
||||||
if (name.length < ENTITY_NAME_MIN_LEN) continue;
|
|
||||||
if (GENERIC_ENTITY_NAMES.has(name.toLowerCase())) continue;
|
|
||||||
entityRows.push({
|
|
||||||
entity_key: name.toLowerCase(),
|
|
||||||
pr_number: prNum,
|
|
||||||
type: String(e?.type ?? "?"),
|
|
||||||
name,
|
|
||||||
description: String(e?.description ?? "").slice(0, 160),
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (entityRows.length === 0) return [];
|
|
||||||
|
|
||||||
// Aggregate manually — one key per entity name, distinct_scopes by PR.
|
|
||||||
type Agg = { count: number; scopes: Set<number>; types: Set<string>; last_name: string; last_desc: string };
|
|
||||||
const byEntity = new Map<string, Agg>();
|
|
||||||
for (const r of entityRows) {
|
|
||||||
const a = byEntity.get(r.entity_key) ?? {
|
|
||||||
count: 0, scopes: new Set<number>(), types: new Set<string>(), last_name: "", last_desc: "",
|
|
||||||
};
|
|
||||||
a.count += 1;
|
|
||||||
a.scopes.add(r.pr_number);
|
|
||||||
a.types.add(r.type);
|
|
||||||
a.last_name = r.name;
|
|
||||||
a.last_desc = r.description;
|
|
||||||
byEntity.set(r.entity_key, a);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Rank: require 2+ distinct PRs (same-PR entity-repeats don't count
|
|
||||||
// as "cross-cutting"). Take the top 5 to avoid flooding the verdict.
|
|
||||||
const ranked = Array.from(byEntity.entries())
|
|
||||||
.filter(([_, a]) => a.scopes.size >= 2)
|
|
||||||
.sort((a, b) => b[1].scopes.size - a[1].scopes.size || b[1].count - a[1].count)
|
|
||||||
.slice(0, 5);
|
|
||||||
|
|
||||||
if (ranked.length === 0) {
|
|
||||||
// Useful to know the KB is being populated — emit a single
|
|
||||||
// summary so operators see fact extraction is alive.
|
|
||||||
return [{
|
|
||||||
check: "kb_query",
|
|
||||||
severity: "info",
|
|
||||||
summary: `audit_facts KB has ${entityRows.length} entity-observations across ${new Set(entityRows.map(r => r.pr_number)).size} PRs (no cross-PR recurrences yet)`,
|
|
||||||
evidence: [`source: ${AUDIT_FACTS_JSONL}`],
|
|
||||||
}];
|
|
||||||
}
|
|
||||||
|
|
||||||
return ranked.map(([_, a]) => ({
|
|
||||||
check: "kb_query" as const,
|
|
||||||
severity: "info" as const,
|
|
||||||
summary: `core entity \`${a.last_name}\` recurs in ${a.scopes.size} PRs (types: ${Array.from(a.types).join(",")})`,
|
|
||||||
evidence: [
|
|
||||||
`count=${a.count} distinct_PRs=${a.scopes.size}`,
|
|
||||||
`description: ${a.last_desc.slice(0, 200)}`,
|
|
||||||
`PRs: ${Array.from(a.scopes).sort((x, y) => x - y).join(",")}`,
|
|
||||||
],
|
|
||||||
}));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Audit-lessons — reads data/_kb/audit_lessons.jsonl (populated by
|
|
||||||
// every audit's appendAuditLessons). Uses the shared kb_index
|
|
||||||
// aggregator: groups by `signature`, distinct-scopes keyed by PR
|
|
||||||
// number, severity from ratingSeverity(agg) which applies the
|
|
||||||
// confidence × count rating (see kb_index.ts). This is the same
|
|
||||||
// aggregation any other KB reader uses — shared discipline, not
|
|
||||||
// per-check custom logic.
|
|
||||||
async function checkAuditLessons(): Promise<Finding[]> {
|
|
||||||
const bySig = await aggregate<any>(AUDIT_LESSONS_JSONL, {
|
|
||||||
keyFn: (r) => r?.signature,
|
|
||||||
scopeFn: (r) => (r?.pr_number !== undefined ? `pr-${r.pr_number}` : undefined),
|
|
||||||
checkFn: (r) => r?.check,
|
|
||||||
tailLimit: TAIL_LINES * 4,
|
|
||||||
});
|
|
||||||
if (bySig.size === 0) return [];
|
|
||||||
|
|
||||||
const findings: Finding[] = [];
|
|
||||||
for (const [sig, agg] of bySig) {
|
|
||||||
// Silent on first-ever occurrence — not yet signal.
|
|
||||||
if (agg.count < 2) continue;
|
|
||||||
const sev = ratingSeverity(agg);
|
|
||||||
findings.push({
|
|
||||||
check: "kb_query",
|
|
||||||
severity: sev,
|
|
||||||
summary: `recurring audit pattern (${agg.distinct_scopes} distinct PRs, ${agg.count} flaggings, conf=${agg.confidence.toFixed(2)}): ${agg.representative_summary.slice(0, 160)}`,
|
|
||||||
evidence: [
|
|
||||||
`signature=${sig}`,
|
|
||||||
`checks: ${agg.checks.join(",")}`,
|
|
||||||
`scopes: ${agg.scopes.slice(-6).join(",")}`,
|
|
||||||
formatAgg(agg),
|
|
||||||
],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
return findings;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Scrum-master reviews — the scrum pipeline writes one row per
|
|
||||||
// accepted per-file review. We match reviews whose `file` matches
|
|
||||||
// any path in the PR's diff, then surface the *preview* + which
|
|
||||||
// model the escalation ladder had to reach. If the scrum-master
|
|
||||||
// needed the 123B specialist or larger to resolve a file, that's
|
|
||||||
// a meaningful signal about the code's complexity — and it's
|
|
||||||
// surfaced to the PR without the auditor having to re-run the
|
|
||||||
// escalation ladder itself.
|
|
||||||
async function checkScrumReviews(prFiles: string[]): Promise<Finding[]> {
|
|
||||||
const rows = await tailJsonl<any>(SCRUM_REVIEWS_JSONL, TAIL_LINES);
|
|
||||||
if (rows.length === 0) return [];
|
|
||||||
|
|
||||||
// Match by exact file OR filename suffix — PR files arrive as
|
|
||||||
// `auditor/audit.ts`-style relative paths; scrum stores the same.
|
|
||||||
const norm = (p: string) => p.replace(/^\/+/, "").replace(/^home\/profit\/lakehouse\//, "");
|
|
||||||
const prSet = new Set(prFiles.map(norm));
|
|
||||||
|
|
||||||
// Keep only the most recent review per file (last-wins).
|
|
||||||
const latestByFile = new Map<string, any>();
|
|
||||||
for (const r of rows) {
|
|
||||||
const f = norm(String(r.file ?? ""));
|
|
||||||
if (!f) continue;
|
|
||||||
if (!prSet.has(f)) continue;
|
|
||||||
latestByFile.set(f, r);
|
|
||||||
}
|
|
||||||
if (latestByFile.size === 0) return [];
|
|
||||||
|
|
||||||
const findings: Finding[] = [];
|
|
||||||
for (const [file, r] of latestByFile) {
|
|
||||||
const model = String(r.accepted_model ?? "?");
|
|
||||||
const attempt = r.accepted_on_attempt ?? "?";
|
|
||||||
const treeSplit = !!r.tree_split_fired;
|
|
||||||
// Heuristic: if the scrum-master had to escalate past attempt 3,
|
|
||||||
// or had to tree-split, that's context the PR reviewer should see.
|
|
||||||
// Severity: info for low-escalation, warn if escalated far up
|
|
||||||
// the ladder (cloud specialist required).
|
|
||||||
const heavyEscalation = Number(attempt) >= 4;
|
|
||||||
const sev: "warn" | "info" = heavyEscalation ? "warn" : "info";
|
|
||||||
findings.push({
|
|
||||||
check: "kb_query",
|
|
||||||
severity: sev,
|
|
||||||
summary: `scrum-master review for \`${file}\` — accepted on attempt ${attempt} by \`${model}\`${treeSplit ? " (tree-split)" : ""}`,
|
|
||||||
evidence: [
|
|
||||||
`reviewed_at: ${r.reviewed_at ?? "?"}`,
|
|
||||||
`preview: ${String(r.suggestions_preview ?? "").slice(0, 300).replace(/\n/g, " ")}`,
|
|
||||||
],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
return findings;
|
|
||||||
}
|
|
||||||
@@ -1,461 +0,0 @@
|
|||||||
// Kimi-architect check — second-pass senior architectural review using
|
|
||||||
// kimi-for-coding (Kimi K2.6) via /v1/chat provider=kimi.
|
|
||||||
//
|
|
||||||
// Runs AFTER the deepseek inference check (N=3 consensus) and the
|
|
||||||
// static/kb_query checks. Reads their findings as context and asks Kimi
|
|
||||||
// "what did everyone else miss?" — complementing the cheap-consensus
|
|
||||||
// voting with a sparse senior pass that catches load-bearing issues
|
|
||||||
// (compile errors, false telemetry, schema bypasses, etc.) which the
|
|
||||||
// voting structure can't see.
|
|
||||||
//
|
|
||||||
// Why Kimi here and not in the inner inference loop:
|
|
||||||
// - Cost: ~3min wall-clock per call vs ~30s for deepseek consensus.
|
|
||||||
// - TOS: api.kimi.com is User-Agent-gated (see crates/gateway/src/v1/
|
|
||||||
// kimi.rs); cost-bounded calls only.
|
|
||||||
// - Value: experiment 2026-04-27 showed 7/7 grounding rate with full
|
|
||||||
// files vs ~50% on truncated input. Best as a sparse complement, not
|
|
||||||
// a replacement.
|
|
||||||
//
|
|
||||||
// Failure-isolated: any Kimi error returns a single info-level Finding
|
|
||||||
// "kimi_architect skipped — <reason>" so the existing audit pipeline
|
|
||||||
// is never blocked by a Kimi outage / TOS revocation / 429.
|
|
||||||
//
|
|
||||||
// Cost cap: if a kimi_verdicts/<pr>-<sha>.json file exists less than 24h
|
|
||||||
// old, return cached findings without calling upstream. New commits
|
|
||||||
// produce new SHAs so this is per-head, not per-day.
|
|
||||||
//
|
|
||||||
// Off by default: caller checks LH_AUDITOR_KIMI=1 before invoking.
|
|
||||||
|
|
||||||
import { readFile, writeFile, mkdir, appendFile, stat, realpath } from "node:fs/promises";
|
|
||||||
import { existsSync, realpathSync } from "node:fs";
|
|
||||||
import { dirname, join, resolve } from "node:path";
|
|
||||||
import type { Finding, CheckKind } from "../types.ts";
|
|
||||||
|
|
||||||
const GATEWAY = process.env.LH_GATEWAY_URL ?? "http://localhost:3100";
|
|
||||||
const KIMI_VERDICTS_DIR = "/home/profit/lakehouse/data/_auditor/kimi_verdicts";
|
|
||||||
const KIMI_AUDITS_JSONL = "/home/profit/lakehouse/data/_kb/kimi_audits.jsonl";
|
|
||||||
const REPO_ROOT = "/home/profit/lakehouse";
|
|
||||||
// Canonicalize at module load — REPO_ROOT itself may be a symlink in
|
|
||||||
// some environments (e.g. /home/profit is a bind-mount). Computing
|
|
||||||
// once at startup means the per-finding grounding loop can compare
|
|
||||||
// realpath(target) against this stable anchor.
|
|
||||||
const REPO_ROOT_REAL = (() => {
|
|
||||||
try { return realpathSync(REPO_ROOT); }
|
|
||||||
catch { return REPO_ROOT; }
|
|
||||||
})();
|
|
||||||
// 15 min budget. Bun's fetch has an intrinsic ~300s limit that our
|
|
||||||
// AbortController + setTimeout combo could not override; we use curl
|
|
||||||
// via Bun.spawn instead (callKimi below). Curl honors -m for max
|
|
||||||
// transfer time without a hard intrinsic ceiling.
|
|
||||||
const CALL_TIMEOUT_MS = 900_000;
|
|
||||||
const CACHE_TTL_MS = 24 * 60 * 60 * 1000;
|
|
||||||
const MAX_DIFF_CHARS = 180_000;
|
|
||||||
const MAX_PRIOR_FINDINGS = 50;
|
|
||||||
// Default provider/model = ollama_cloud/kimi-k2.6. Pre-2026-04-27 we
|
|
||||||
// went direct to api.kimi.com, but Ollama Cloud Pro now exposes the
|
|
||||||
// same model legitimately, so we route there to avoid User-Agent
|
|
||||||
// gating. The api.kimi.com path (provider=kimi) remains wired in the
|
|
||||||
// gateway as a fallback for when Ollama Cloud is upstream-broken.
|
|
||||||
const KIMI_PROVIDER = process.env.LH_AUDITOR_KIMI_PROVIDER ?? "ollama_cloud";
|
|
||||||
const KIMI_MODEL = process.env.LH_AUDITOR_KIMI_MODEL ?? "kimi-k2.6";
|
|
||||||
// Cross-lineage alternation. 2026-04-27 J's call: Opus is too
|
|
||||||
// expensive to auto-fire (~$0.30/audit). Kimi K2.6 via Go-sub is
|
|
||||||
// effectively free; Haiku 4.5 via Zen is ~$0.04. Alternate between
|
|
||||||
// them so we get cross-lineage signal (Moonshot vs Anthropic) on
|
|
||||||
// every PR's audit history without burning the budget.
|
|
||||||
//
|
|
||||||
// Default: Kimi K2.6 on even audits, Haiku 4.5 on odd. Each PR's
|
|
||||||
// audits flip between vendors as new SHAs come in.
|
|
||||||
//
|
|
||||||
// Frontier models (Opus 4.7, GPT-5.5, Gemini 3.1) are NOT in the
|
|
||||||
// auto path. Operator hands distilled findings to a frontier model
|
|
||||||
// manually when high-leverage decisions need it. Removing Opus from
|
|
||||||
// auto-promotion saves ~$1-3/day on the daemon at our cadence.
|
|
||||||
//
|
|
||||||
// Override the alternation entirely with LH_AUDITOR_KIMI_MODEL
|
|
||||||
// (forces one model regardless of audit count); set
|
|
||||||
// LH_AUDITOR_KIMI_ALT_MODEL to the alternate.
|
|
||||||
const ALT_MODEL = process.env.LH_AUDITOR_KIMI_ALT_MODEL ?? "claude-haiku-4-5";
|
|
||||||
const ALT_PROVIDER = process.env.LH_AUDITOR_KIMI_ALT_PROVIDER ?? "opencode";
|
|
||||||
const FORCE_DEFAULT = process.env.LH_AUDITOR_KIMI_MODEL !== undefined && process.env.LH_AUDITOR_KIMI_MODEL !== "";
|
|
||||||
|
|
||||||
function selectModel(diffLen: number, auditIndex: number = 0): { provider: string; model: string; promoted: boolean } {
|
|
||||||
// Operator override — env-pinned model wins.
|
|
||||||
if (FORCE_DEFAULT) {
|
|
||||||
return { provider: KIMI_PROVIDER, model: KIMI_MODEL, promoted: false };
|
|
||||||
}
|
|
||||||
// Alternate Kimi (default, even index) ↔ Haiku (alt, odd index).
|
|
||||||
// diffLen kept in the signature for future "big diff → Haiku
|
|
||||||
// anyway" logic; not used yet so we don't auto-burn on big PRs.
|
|
||||||
void diffLen;
|
|
||||||
if (auditIndex % 2 === 1) {
|
|
||||||
return { provider: ALT_PROVIDER, model: ALT_MODEL, promoted: true };
|
|
||||||
}
|
|
||||||
return { provider: KIMI_PROVIDER, model: KIMI_MODEL, promoted: false };
|
|
||||||
}
|
|
||||||
// Model-aware max_tokens. Different upstream APIs cap at different
|
|
||||||
// limits and reject requests that exceed them:
|
|
||||||
// - Anthropic Opus 4.x: 32K output (with extended-output header)
|
|
||||||
// - Anthropic Haiku 4.5: 8K output
|
|
||||||
// - Kimi K2.6 (reasoning): 128K — needs headroom because
|
|
||||||
// reasoning_content counts against the budget
|
|
||||||
// - Default: 16K, conservative middle ground
|
|
||||||
//
|
|
||||||
// 2026-04-27 BLOCK from Opus self-audit: the prior single-default of
|
|
||||||
// 128K worked silently (Anthropic clamps server-side) but was
|
|
||||||
// technically invalid. Per-model caps make it explicit. Override via
|
|
||||||
// LH_AUDITOR_KIMI_MAX_TOKENS to force a value (also fixes the empty-
|
|
||||||
// env Number("") -> 0 trap by using `||` not `??`).
|
|
||||||
const MAX_TOKENS_OVERRIDE = Number(process.env.LH_AUDITOR_KIMI_MAX_TOKENS) || 0;
|
|
||||||
function maxTokensFor(model: string): number {
|
|
||||||
if (MAX_TOKENS_OVERRIDE > 0) return MAX_TOKENS_OVERRIDE;
|
|
||||||
if (model.startsWith("claude-opus")) return 32_000;
|
|
||||||
if (model.startsWith("claude-haiku") || model.startsWith("claude-sonnet")) return 8_192;
|
|
||||||
if (model.startsWith("kimi-")) return 128_000;
|
|
||||||
if (model.startsWith("gpt-5") || model.startsWith("o1") || model.startsWith("o3") || model.startsWith("o4")) return 32_000;
|
|
||||||
return 16_000;
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface KimiArchitectContext {
|
|
||||||
pr_number: number;
|
|
||||||
head_sha: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
interface KimiVerdictFile {
|
|
||||||
pr_number: number;
|
|
||||||
head_sha: string;
|
|
||||||
cached_at: string;
|
|
||||||
model: string;
|
|
||||||
latency_ms: number;
|
|
||||||
finish_reason: string;
|
|
||||||
usage: { prompt_tokens: number; completion_tokens: number; total_tokens: number };
|
|
||||||
raw_content: string;
|
|
||||||
findings: Finding[];
|
|
||||||
grounding: { total: number; verified: number; rate: number };
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function runKimiArchitectCheck(
|
|
||||||
diff: string,
|
|
||||||
priorFindings: Finding[],
|
|
||||||
ctx: KimiArchitectContext,
|
|
||||||
): Promise<Finding[]> {
|
|
||||||
const cachePath = join(KIMI_VERDICTS_DIR, `${ctx.pr_number}-${ctx.head_sha.slice(0, 12)}.json`);
|
|
||||||
const outageSentinel = `${cachePath}.outage`;
|
|
||||||
const OUTAGE_TTL_MS = 10 * 60 * 1000;
|
|
||||||
|
|
||||||
// Outage negative-cache — if upstream failed within OUTAGE_TTL_MS,
|
|
||||||
// skip this audit and return immediately. Prevents the daemon from
|
|
||||||
// hammering a downed Kimi/Anthropic upstream every 90s.
|
|
||||||
if (existsSync(outageSentinel)) {
|
|
||||||
try {
|
|
||||||
const s = await stat(outageSentinel);
|
|
||||||
if (Date.now() - s.mtimeMs < OUTAGE_TTL_MS) {
|
|
||||||
const note = JSON.parse(await readFile(outageSentinel, "utf8"));
|
|
||||||
return [skipFinding(`upstream still down (cached ${Math.round((Date.now() - s.mtimeMs) / 1000)}s ago): ${String(note.reason).slice(0, 160)}`)];
|
|
||||||
}
|
|
||||||
} catch { /* malformed sentinel — fall through to fresh call */ }
|
|
||||||
}
|
|
||||||
|
|
||||||
// Cost cap — return cached findings if a verdict for this exact head
|
|
||||||
// SHA was generated within the TTL.
|
|
||||||
const cached = await loadCachedVerdict(cachePath);
|
|
||||||
if (cached) {
|
|
||||||
return cached.findings.length > 0
|
|
||||||
? cached.findings
|
|
||||||
: [{ check: "kimi_architect" as CheckKind, severity: "info", summary: "kimi_architect cached — 0 findings", evidence: [`cache: ${cachePath}`] }];
|
|
||||||
}
|
|
||||||
|
|
||||||
// Alternate model based on how many audits this PR has had — gives
|
|
||||||
// cross-lineage signal (Kimi/Moonshot ↔ Haiku/Anthropic) on every
|
|
||||||
// PR's audit history. Count is derived from existing kimi_verdicts
|
|
||||||
// files for this PR; cheap O(N_PRs) directory read.
|
|
||||||
let auditIndex = 0;
|
|
||||||
try {
|
|
||||||
const dir = "/home/profit/lakehouse/data/_auditor/kimi_verdicts";
|
|
||||||
if (existsSync(dir)) {
|
|
||||||
const all = require("node:fs").readdirSync(dir) as string[];
|
|
||||||
auditIndex = all.filter((f) => f.startsWith(`${ctx.pr_number}-`)).length;
|
|
||||||
}
|
|
||||||
} catch { /* default 0 — Kimi */ }
|
|
||||||
|
|
||||||
const selected = selectModel(diff.length, auditIndex);
|
|
||||||
let response: { content: string; usage: any; finish_reason: string; latency_ms: number };
|
|
||||||
try {
|
|
||||||
response = await callKimi(buildPrompt(diff, priorFindings, ctx), selected.provider, selected.model);
|
|
||||||
} catch (e) {
|
|
||||||
// Negative-cache for 10 min on outage (caught 2026-04-27 by Opus
|
|
||||||
// self-audit): without this, every audit cycle within the 24h
|
|
||||||
// TTL re-calls upstream while it's still down. Use a sentinel
|
|
||||||
// file with mtime check rather than persisting a verdict so the
|
|
||||||
// happy-path cache reader doesn't have to special-case it.
|
|
||||||
const sentinel = `${cachePath}.outage`;
|
|
||||||
try { await writeFile(sentinel, JSON.stringify({ at: new Date().toISOString(), reason: (e as Error).message.slice(0, 200) })); } catch {}
|
|
||||||
return [skipFinding(`kimi call failed (${selected.model}): ${(e as Error).message.slice(0, 200)}`)];
|
|
||||||
}
|
|
||||||
|
|
||||||
const findings = parseFindings(response.content);
|
|
||||||
const grounding = await computeGrounding(findings);
|
|
||||||
|
|
||||||
const verdict: KimiVerdictFile = {
|
|
||||||
pr_number: ctx.pr_number,
|
|
||||||
head_sha: ctx.head_sha,
|
|
||||||
cached_at: new Date().toISOString(),
|
|
||||||
model: selected.model,
|
|
||||||
latency_ms: response.latency_ms,
|
|
||||||
finish_reason: response.finish_reason,
|
|
||||||
usage: {
|
|
||||||
prompt_tokens: response.usage?.prompt_tokens ?? 0,
|
|
||||||
completion_tokens: response.usage?.completion_tokens ?? 0,
|
|
||||||
total_tokens: response.usage?.total_tokens ?? 0,
|
|
||||||
},
|
|
||||||
raw_content: response.content,
|
|
||||||
findings,
|
|
||||||
grounding,
|
|
||||||
};
|
|
||||||
|
|
||||||
// Cache-poisoning guard (caught 2026-04-27 by Opus self-audit):
|
|
||||||
// when parseFindings returns 0 findings (Kimi rambled, prompt too
|
|
||||||
// big, or the markdown shape changed and our regex missed every
|
|
||||||
// block), persisting the empty verdict short-circuits all future
|
|
||||||
// audits in the 24h TTL window with a useless cached "0 findings"
|
|
||||||
// result. Better to leave no cache and re-call upstream next time.
|
|
||||||
// Always append metrics — observability shouldn't depend on whether
|
|
||||||
// findings parsed.
|
|
||||||
await appendMetrics(verdict);
|
|
||||||
if (findings.length > 0) {
|
|
||||||
await persistVerdict(cachePath, verdict);
|
|
||||||
return findings;
|
|
||||||
}
|
|
||||||
return [{
|
|
||||||
check: "kimi_architect" as CheckKind,
|
|
||||||
severity: "info",
|
|
||||||
summary: `kimi_architect produced 0 ranked findings (${response.finish_reason}, ${verdict.usage.completion_tokens} tokens) — not cached`,
|
|
||||||
evidence: [`raw saved (no cache): see kimi_audits.jsonl ${verdict.cached_at}`],
|
|
||||||
}];
|
|
||||||
}
|
|
||||||
|
|
||||||
async function loadCachedVerdict(path: string): Promise<KimiVerdictFile | null> {
|
|
||||||
if (!existsSync(path)) return null;
|
|
||||||
try {
|
|
||||||
const s = await stat(path);
|
|
||||||
if (Date.now() - s.mtimeMs > CACHE_TTL_MS) return null;
|
|
||||||
return JSON.parse(await readFile(path, "utf8")) as KimiVerdictFile;
|
|
||||||
} catch { return null; }
|
|
||||||
}
|
|
||||||
|
|
||||||
function buildPrompt(diff: string, priorFindings: Finding[], ctx: KimiArchitectContext): string {
|
|
||||||
const truncatedDiff = diff.length > MAX_DIFF_CHARS
|
|
||||||
? diff.slice(0, MAX_DIFF_CHARS) + `\n\n... [truncated; original diff was ${diff.length} chars]`
|
|
||||||
: diff;
|
|
||||||
|
|
||||||
const priorBlock = priorFindings
|
|
||||||
.filter(f => f.severity !== "info")
|
|
||||||
.slice(0, MAX_PRIOR_FINDINGS)
|
|
||||||
.map(f => `- [${f.check}/${f.severity}] ${f.summary}${f.evidence?.[0] ? ` — ${f.evidence[0].slice(0, 160)}` : ""}`)
|
|
||||||
.join("\n");
|
|
||||||
|
|
||||||
return `You are a senior software architect doing a second-pass review on PR #${ctx.pr_number} (head ${ctx.head_sha.slice(0, 12)}). The team's automated auditor (deepseek-v3.1:671b, N=3 consensus) already produced findings. Your job is NOT to repeat what they found — your job is to catch what their voting structure CAN'T see: compile errors, type-system bypasses, false telemetry, silent determinism leaks, schema-bypass anti-patterns, load-bearing assumptions that look fine line-by-line.
|
|
||||||
|
|
||||||
GROUNDING RULES (non-negotiable):
|
|
||||||
- Cite file:line for EVERY finding. Lines you cite must actually contain what you claim. Confabulating a finding wastes more time than missing one.
|
|
||||||
- If the diff is truncated and you can't verify a claim, say "diff-truncated, can't verify" — DO NOT guess.
|
|
||||||
- Distinguish architectural concerns (no specific line) from concrete bugs (specific line). Don't dress one as the other.
|
|
||||||
|
|
||||||
PRIOR FINDINGS FROM DEEPSEEK CONSENSUS (do not repeat these):
|
|
||||||
${priorBlock || "(none)"}
|
|
||||||
|
|
||||||
OUTPUT FORMAT (markdown):
|
|
||||||
- ## Verdict (one sentence)
|
|
||||||
- ## Findings (5-10 items, each formatted EXACTLY as below)
|
|
||||||
|
|
||||||
For each finding use this exact shape so a parser can lift them:
|
|
||||||
|
|
||||||
### F1: <one-line summary>
|
|
||||||
- **Severity:** block | warn | info
|
|
||||||
- **File:** path/to/file.ext:LINE
|
|
||||||
- **Rationale:** one or two sentences
|
|
||||||
|
|
||||||
THE DIFF:
|
|
||||||
|
|
||||||
${truncatedDiff}
|
|
||||||
`;
|
|
||||||
}
|
|
||||||
|
|
||||||
async function callKimi(prompt: string, provider: string, model: string): Promise<{ content: string; usage: any; finish_reason: string; latency_ms: number }> {
|
|
||||||
const t0 = Date.now();
|
|
||||||
const body = JSON.stringify({
|
|
||||||
provider,
|
|
||||||
model,
|
|
||||||
messages: [{ role: "user", content: prompt }],
|
|
||||||
max_tokens: maxTokensFor(model),
|
|
||||||
temperature: 0.2,
|
|
||||||
});
|
|
||||||
// curl via Bun.spawn — bypasses Bun fetch's ~300s intrinsic ceiling.
|
|
||||||
// -m sets the max transfer time honored end-to-end. Body is piped via
|
|
||||||
// stdin to avoid argv length limits on big audit prompts (~50K+ tokens).
|
|
||||||
const proc = Bun.spawn({
|
|
||||||
cmd: [
|
|
||||||
"curl", "-sS", "-X", "POST",
|
|
||||||
"-m", String(Math.ceil(CALL_TIMEOUT_MS / 1000)),
|
|
||||||
"-H", "content-type: application/json",
|
|
||||||
"--data-binary", "@-",
|
|
||||||
`${GATEWAY}/v1/chat`,
|
|
||||||
],
|
|
||||||
stdin: "pipe",
|
|
||||||
stdout: "pipe",
|
|
||||||
stderr: "pipe",
|
|
||||||
});
|
|
||||||
proc.stdin.write(body);
|
|
||||||
await proc.stdin.end();
|
|
||||||
const [stdout, stderr, exitCode] = await Promise.all([
|
|
||||||
new Response(proc.stdout).text(),
|
|
||||||
new Response(proc.stderr).text(),
|
|
||||||
proc.exited,
|
|
||||||
]);
|
|
||||||
if (exitCode !== 0) {
|
|
||||||
throw new Error(`curl exit ${exitCode}: ${stderr.slice(0, 300)}`);
|
|
||||||
}
|
|
||||||
let j: any;
|
|
||||||
try { j = JSON.parse(stdout); }
|
|
||||||
catch (e) {
|
|
||||||
throw new Error(`bad response (${stdout.length} bytes): ${stdout.slice(0, 300)}`);
|
|
||||||
}
|
|
||||||
if (j.error || !j.choices) {
|
|
||||||
throw new Error(`gateway error: ${JSON.stringify(j).slice(0, 300)}`);
|
|
||||||
}
|
|
||||||
return {
|
|
||||||
content: j.choices?.[0]?.message?.content ?? "",
|
|
||||||
usage: j.usage ?? {},
|
|
||||||
finish_reason: j.choices?.[0]?.finish_reason ?? "unknown",
|
|
||||||
latency_ms: Date.now() - t0,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
// Parse Kimi's markdown into Finding[]. Format expected (per buildPrompt):
|
|
||||||
// ### F<N>: <summary>
|
|
||||||
// - **Severity:** block | warn | info
|
|
||||||
// - **File:** path:line
|
|
||||||
// - **Rationale:** ...
|
|
||||||
function parseFindings(content: string): Finding[] {
|
|
||||||
const findings: Finding[] = [];
|
|
||||||
const blocks = content.split(/^###\s+F\d+:\s*/m).slice(1);
|
|
||||||
for (const block of blocks) {
|
|
||||||
const summary = (block.split("\n")[0] ?? "").trim();
|
|
||||||
if (!summary) continue;
|
|
||||||
const sev = /\*\*Severity:\*\*\s*(block|warn|info)/i.exec(block)?.[1]?.toLowerCase();
|
|
||||||
const fileLine = /\*\*File:\*\*\s*(\S+)/i.exec(block)?.[1] ?? "unknown";
|
|
||||||
const rationale = /\*\*Rationale:\*\*\s*([\s\S]+?)(?=\n###|\n\*\*|$)/i.exec(block)?.[1]?.trim() ?? "";
|
|
||||||
const severity: Finding["severity"] = sev === "block" ? "block" : sev === "warn" ? "warn" : "info";
|
|
||||||
findings.push({
|
|
||||||
check: "kimi_architect" as CheckKind,
|
|
||||||
severity,
|
|
||||||
summary: summary.slice(0, 240),
|
|
||||||
evidence: [fileLine, rationale.slice(0, 360)].filter(Boolean),
|
|
||||||
});
|
|
||||||
}
|
|
||||||
return findings;
|
|
||||||
}
|
|
||||||
|
|
||||||
// For each finding's cited file:line, grep the actual file to verify
|
|
||||||
// the line exists. Returns total + verified counts; per-finding metadata
|
|
||||||
// is appended into the evidence array so the reader can see which
|
|
||||||
// citations were verified.
|
|
||||||
async function computeGrounding(findings: Finding[]): Promise<{ total: number; verified: number; rate: number }> {
|
|
||||||
// readFile (async) instead of readFileSync — caught 2026-04-27 by
|
|
||||||
// Kimi's self-audit. Sync I/O in an async fn blocks the event loop
|
|
||||||
// for every cited file; doesn't matter at 10 findings, would matter
|
|
||||||
// at 100+.
|
|
||||||
const checks = await Promise.all(findings.map(async (f) => {
|
|
||||||
const cite = f.evidence[0] ?? "";
|
|
||||||
const m = /^(\S+?):(\d+)/.exec(cite);
|
|
||||||
if (!m) return false;
|
|
||||||
const [, relpath, lineStr] = m;
|
|
||||||
const line = Number(lineStr);
|
|
||||||
if (!line || !relpath) return false;
|
|
||||||
|
|
||||||
// Path-traversal guard, two-layer (caught 2026-04-27 by Kimi
|
|
||||||
// self-audits on dd77632 then 2d9cb12).
|
|
||||||
//
|
|
||||||
// Layer 1 (lexical): resolve() normalizes `..` segments. Refuse
|
|
||||||
// any path that doesn't anchor under REPO_ROOT.
|
|
||||||
//
|
|
||||||
// Layer 2 (symlink): even if the lexical path is anchored, it
|
|
||||||
// could be a symlink whose target escapes. realpath() resolves
|
|
||||||
// symlinks; compare the real path against REPO_ROOT_REAL.
|
|
||||||
//
|
|
||||||
// Both layers exist because attackers might bypass either alone:
|
|
||||||
// raw `../etc/passwd` triggers layer 1; a planted symlink at
|
|
||||||
// ./safe-looking-name → /etc/passwd triggers layer 2.
|
|
||||||
const abs = resolve(REPO_ROOT, relpath);
|
|
||||||
if (!abs.startsWith(REPO_ROOT + "/") && abs !== REPO_ROOT) {
|
|
||||||
f.evidence.push(`[grounding: path escapes repo root, refusing]`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!existsSync(abs)) {
|
|
||||||
f.evidence.push("[grounding: file not found]");
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
try {
|
|
||||||
// Symlink-resolution check before any read. realpath() throws
|
|
||||||
// if the file doesn't exist; existsSync above shields the
|
|
||||||
// common case but a TOCTOU race could still error here — the
|
|
||||||
// outer catch handles it.
|
|
||||||
const realPath = await realpath(abs);
|
|
||||||
if (!realPath.startsWith(REPO_ROOT_REAL + "/") && realPath !== REPO_ROOT_REAL) {
|
|
||||||
f.evidence.push(`[grounding: symlink target escapes repo root, refusing]`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
const lines = (await readFile(realPath, "utf8")).split("\n");
|
|
||||||
if (line < 1 || line > lines.length) {
|
|
||||||
f.evidence.push(`[grounding: line ${line} > EOF (${lines.length})]`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
f.evidence.push(`[grounding: verified at ${relpath}:${line}]`);
|
|
||||||
return true;
|
|
||||||
} catch (e) {
|
|
||||||
f.evidence.push(`[grounding: read failed: ${(e as Error).message.slice(0, 80)}]`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}));
|
|
||||||
const verified = checks.filter(Boolean).length;
|
|
||||||
const total = findings.length;
|
|
||||||
return { total, verified, rate: total === 0 ? 0 : verified / total };
|
|
||||||
}
|
|
||||||
|
|
||||||
async function persistVerdict(path: string, v: KimiVerdictFile): Promise<void> {
|
|
||||||
await mkdir(KIMI_VERDICTS_DIR, { recursive: true });
|
|
||||||
await writeFile(path, JSON.stringify(v, null, 2));
|
|
||||||
}
|
|
||||||
|
|
||||||
async function appendMetrics(v: KimiVerdictFile): Promise<void> {
|
|
||||||
// dirname() instead of join(path, "..") — caught 2026-04-27 by both
|
|
||||||
// Haiku and Opus self-audits. The "/.." idiom resolves correctly
|
|
||||||
// via Node path normalization but is non-idiomatic + breaks if the
|
|
||||||
// path ever has trailing dots.
|
|
||||||
await mkdir(dirname(KIMI_AUDITS_JSONL), { recursive: true });
|
|
||||||
await appendFile(KIMI_AUDITS_JSONL, JSON.stringify({
|
|
||||||
pr_number: v.pr_number,
|
|
||||||
head_sha: v.head_sha,
|
|
||||||
audited_at: v.cached_at,
|
|
||||||
model: v.model,
|
|
||||||
latency_ms: v.latency_ms,
|
|
||||||
finish_reason: v.finish_reason,
|
|
||||||
prompt_tokens: v.usage.prompt_tokens,
|
|
||||||
completion_tokens: v.usage.completion_tokens,
|
|
||||||
findings_total: v.findings.length,
|
|
||||||
findings_block: v.findings.filter(f => f.severity === "block").length,
|
|
||||||
findings_warn: v.findings.filter(f => f.severity === "warn").length,
|
|
||||||
grounding_verified: v.grounding.verified,
|
|
||||||
grounding_rate: Number(v.grounding.rate.toFixed(3)),
|
|
||||||
}) + "\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
function skipFinding(why: string): Finding {
|
|
||||||
return {
|
|
||||||
check: "kimi_architect" as CheckKind,
|
|
||||||
severity: "info",
|
|
||||||
summary: `kimi_architect skipped — ${why}`,
|
|
||||||
evidence: [why],
|
|
||||||
};
|
|
||||||
}
|
|
||||||
@@ -1,311 +0,0 @@
|
|||||||
// Static diff check — grep-style, no AST, no LLM. Looks for patterns
|
|
||||||
// that are high-signal evidence of placeholder code.
|
|
||||||
//
|
|
||||||
// Findings are severity-graded:
|
|
||||||
// block — explicit non-impl markers (unimplemented!, todo!,
|
|
||||||
// panic!("not implemented"), throw new Error("not implemented"))
|
|
||||||
// warn — TODO / FIXME / XXX / HACK comments on added lines,
|
|
||||||
// new struct fields with no read-site anywhere in the diff,
|
|
||||||
// suspiciously-empty function bodies ({ Ok(()) } / {} when
|
|
||||||
// the commit message claims the fn "implements" something)
|
|
||||||
// info — hardcoded "test" / "dummy" / "placeholder" strings in
|
|
||||||
// added lines (could be real, just flag for inspection)
|
|
||||||
//
|
|
||||||
// Consumes: raw unified diff text from Gitea.
|
|
||||||
|
|
||||||
import type { Finding } from "../types.ts";
|
|
||||||
|
|
||||||
// Rust + TypeScript patterns that almost always indicate "this is
|
|
||||||
// not actually implemented yet."
|
|
||||||
const BLOCK_PATTERNS: Array<{ re: RegExp; why: string }> = [
|
|
||||||
{ re: /\bunimplemented!\s*\(/, why: "unimplemented!() macro call" },
|
|
||||||
{ re: /\btodo!\s*\(/, why: "todo!() macro call" },
|
|
||||||
{ re: /panic!\s*\(\s*"(?:not implemented|TODO|not yet|unimpl)/i, why: "panic! with not-implemented message" },
|
|
||||||
{ re: /throw\s+new\s+Error\s*\(\s*['"](?:not implemented|TODO|unimpl)/i, why: "throw Error 'not implemented'" },
|
|
||||||
];
|
|
||||||
|
|
||||||
const WARN_COMMENT_PATTERNS: Array<{ re: RegExp; why: string }> = [
|
|
||||||
{ re: /^\+.*\/\/\s*(TODO|FIXME|XXX|HACK)\b/i, why: "TODO/FIXME/XXX/HACK comment added" },
|
|
||||||
{ re: /^\+.*#\s*(TODO|FIXME|XXX|HACK)\b/i, why: "TODO/FIXME/XXX/HACK comment added" },
|
|
||||||
];
|
|
||||||
|
|
||||||
const INFO_HARDCODED_PATTERNS: Array<{ re: RegExp; why: string }> = [
|
|
||||||
{ re: /"(?:placeholder|dummy|foobar|xxx|replaceme|changeme)"/i, why: "suspicious hardcoded string" },
|
|
||||||
];
|
|
||||||
|
|
||||||
export function runStaticCheck(diff: string): Finding[] {
|
|
||||||
const findings: Finding[] = [];
|
|
||||||
|
|
||||||
// Per-file walk: only look at ADDED lines (prefix '+' but not '+++'
|
|
||||||
// which is the diff header).
|
|
||||||
const perFile = splitDiffByFile(diff);
|
|
||||||
|
|
||||||
for (const [path, lines] of perFile) {
|
|
||||||
// Skip diff bookkeeping + pure-delete files
|
|
||||||
if (!lines.some(l => l.startsWith("+") && !l.startsWith("+++"))) continue;
|
|
||||||
|
|
||||||
// The auditor's own check files literally contain the BLOCK
|
|
||||||
// patterns as regex definitions (BLOCK_PATTERNS in this file,
|
|
||||||
// prompt examples in inference.ts). Skipping BLOCK scan on these
|
|
||||||
// specific paths prevents the checker from self-flagging its own
|
|
||||||
// string literals. WARN/INFO patterns still run — those genuinely
|
|
||||||
// could indicate problems in the checker's own code (TODO
|
|
||||||
// comments don't self-define).
|
|
||||||
const isAuditorCheckerFile = path.startsWith("auditor/checks/") ||
|
|
||||||
path.startsWith("auditor/fixtures/");
|
|
||||||
|
|
||||||
// Track multi-line backtick-template state across the file. Walks
|
|
||||||
// all post-merge lines (context + added, skipping removed lines)
|
|
||||||
// in order and keeps `inMultilineBacktick` flipping on each
|
|
||||||
// unescaped backtick. Pre-2026-04-26 the per-line walk in
|
|
||||||
// isInsideQuotedString missed `todo!()` matches inside docstring
|
|
||||||
// template literals because the opening backtick lived on a
|
|
||||||
// line above the match. Now we OR the file-level state into the
|
|
||||||
// per-line check.
|
|
||||||
let inMultilineBacktick = false;
|
|
||||||
|
|
||||||
for (let idx = 0; idx < lines.length; idx++) {
|
|
||||||
const line = lines[idx];
|
|
||||||
|
|
||||||
// Diff bookkeeping lines and removed lines don't contribute to
|
|
||||||
// the post-merge file's string state.
|
|
||||||
if (line.startsWith("+++") || line.startsWith("---") ||
|
|
||||||
line.startsWith("@@") || line.startsWith("\\ No newline")) continue;
|
|
||||||
if (line.startsWith("-")) continue;
|
|
||||||
|
|
||||||
const isAdded = line.startsWith("+");
|
|
||||||
// Strip the diff prefix (' ' for context, '+' for added).
|
|
||||||
const body = (isAdded || line.startsWith(" ")) ? line.slice(1) : line;
|
|
||||||
|
|
||||||
// Compute the file-level backtick state ENTERING this line.
|
|
||||||
// The state machine sees pattern matches against the right
|
|
||||||
// context: a line that opens a backtick block has its own
|
|
||||||
// pattern checks evaluated under "inside-backtick" semantics
|
|
||||||
// for the portion AFTER the opening tick. Pre-2026-04-27 the
|
|
||||||
// state was updated AFTER the pattern checks, so the FIRST
|
|
||||||
// pattern on a backtick-opening line slipped through with
|
|
||||||
// stale "outside-backtick" semantics. Caught by Kimi self-audit.
|
|
||||||
const stateAtLineStart = inMultilineBacktick;
|
|
||||||
const stateAtLineEnd = updateBacktickState(body, stateAtLineStart);
|
|
||||||
|
|
||||||
if (isAdded) {
|
|
||||||
const added = body;
|
|
||||||
|
|
||||||
if (!isAuditorCheckerFile) {
|
|
||||||
for (const { re, why } of BLOCK_PATTERNS) {
|
|
||||||
const m = added.match(re);
|
|
||||||
if (m && typeof m.index === "number") {
|
|
||||||
// Skip if EITHER (a) the file was already inside a
|
|
||||||
// multi-line backtick block when this line started, OR
|
|
||||||
// (b) the match sits inside a quoted string literal on
|
|
||||||
// THIS line. The earlier code only checked stateAtLineStart;
|
|
||||||
// now we also check that the match isn't past the
|
|
||||||
// opening backtick of a block that opens on this line.
|
|
||||||
if (stateAtLineStart || isInsideQuotedString(added, m.index)) continue;
|
|
||||||
findings.push({
|
|
||||||
check: "static",
|
|
||||||
severity: "block",
|
|
||||||
summary: `${why} in ${path}`,
|
|
||||||
evidence: [`${path}:+${idx + 1}: ${added.trim().slice(0, 160)}`],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
for (const { re, why } of WARN_COMMENT_PATTERNS) {
|
|
||||||
if (re.test(line)) {
|
|
||||||
findings.push({
|
|
||||||
check: "static",
|
|
||||||
severity: "warn",
|
|
||||||
summary: `${why} in ${path}`,
|
|
||||||
evidence: [`${path}:+${idx + 1}: ${added.trim().slice(0, 160)}`],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
for (const { re, why } of INFO_HARDCODED_PATTERNS) {
|
|
||||||
if (re.test(added)) {
|
|
||||||
findings.push({
|
|
||||||
check: "static",
|
|
||||||
severity: "info",
|
|
||||||
summary: `${why} in ${path}`,
|
|
||||||
evidence: [`${path}:+${idx + 1}: ${added.trim().slice(0, 160)}`],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Carry the end-of-line state forward to the next iteration.
|
|
||||||
inMultilineBacktick = stateAtLineEnd;
|
|
||||||
}
|
|
||||||
|
|
||||||
// "Field added but never read" heuristic — catches exactly the
|
|
||||||
// Phase 45 DocRef placeholder pattern. Limited to the diff itself:
|
|
||||||
// we're not doing a full-codebase grep here (too noisy; callers
|
|
||||||
// elsewhere might exist). The point is: if NEITHER this diff nor
|
|
||||||
// any other line in the diff reads the field, the PR is shipping
|
|
||||||
// state without a consumer.
|
|
||||||
//
|
|
||||||
// Serde exemption: if the field's parent struct derives Serialize
|
|
||||||
// or Deserialize, the read-site is the macro itself — JSON
|
|
||||||
// round-trips consume every public field. Without this exemption
|
|
||||||
// the check produces false positives on every response/request
|
|
||||||
// struct shipped through `/v1/*`.
|
|
||||||
const addedLines = lines.filter(l => l.startsWith("+") && !l.startsWith("+++"))
|
|
||||||
.map(l => l.slice(1));
|
|
||||||
const newFields = extractNewFieldsWithLine(lines);
|
|
||||||
const seenNames = new Set<string>();
|
|
||||||
for (const { name: field, lineIdx } of newFields) {
|
|
||||||
if (seenNames.has(field)) continue;
|
|
||||||
seenNames.add(field);
|
|
||||||
if (parentStructHasSerdeDerive(lines, lineIdx)) continue;
|
|
||||||
const readPattern = new RegExp(`[\\.:]\\s*${escape(field)}\\b|\\b${escape(field)}\\s*:`);
|
|
||||||
// The definition line itself matches readPattern — filter it out
|
|
||||||
// by requiring at least TWO lines in the diff mention the field
|
|
||||||
// (one defines, one reads).
|
|
||||||
const hits = addedLines.filter(l => readPattern.test(l));
|
|
||||||
if (hits.length < 2) {
|
|
||||||
findings.push({
|
|
||||||
check: "static",
|
|
||||||
severity: "warn",
|
|
||||||
summary: `field '${field}' added in ${path} but no read-site in the diff — could be placeholder state without a consumer`,
|
|
||||||
evidence: [`${path}: added '${field}' with no reader; rest of diff has ${hits.length - 1} mentions`],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return findings;
|
|
||||||
}
|
|
||||||
|
|
||||||
function splitDiffByFile(diff: string): Map<string, string[]> {
|
|
||||||
const out = new Map<string, string[]>();
|
|
||||||
let current: string | null = null;
|
|
||||||
let buf: string[] = [];
|
|
||||||
for (const line of diff.split(/\r?\n/)) {
|
|
||||||
const m = line.match(/^diff --git a\/(\S+) b\/(\S+)/);
|
|
||||||
if (m) {
|
|
||||||
if (current) out.set(current, buf);
|
|
||||||
current = m[2];
|
|
||||||
buf = [];
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
buf.push(line);
|
|
||||||
}
|
|
||||||
if (current) out.set(current, buf);
|
|
||||||
return out;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Extract new `pub name: Type,` fields from the per-file diff lines,
|
|
||||||
// keeping each occurrence's line index so the caller can resolve the
|
|
||||||
// parent struct. Same narrow rules as before: starts with `pub `,
|
|
||||||
// excludes `pub fn` / `pub struct` / etc.
|
|
||||||
function extractNewFieldsWithLine(lines: string[]): Array<{ name: string; lineIdx: number }> {
|
|
||||||
const out: Array<{ name: string; lineIdx: number }> = [];
|
|
||||||
for (let i = 0; i < lines.length; i++) {
|
|
||||||
const line = lines[i];
|
|
||||||
if (!line.startsWith("+") || line.startsWith("+++")) continue;
|
|
||||||
const t = line.slice(1).trim();
|
|
||||||
const m = t.match(/^pub\s+(?!fn\b|struct\b|enum\b|mod\b|use\b|trait\b|impl\b|const\b|static\b|type\b)(\w+)\s*:/);
|
|
||||||
if (m) out.push({ name: m[1], lineIdx: i });
|
|
||||||
}
|
|
||||||
return out;
|
|
||||||
}
|
|
||||||
|
|
||||||
// True if the field at `fieldLineIdx` lives inside a struct whose
|
|
||||||
// declaration carries `#[derive(... Serialize|Deserialize ...)]`. We
|
|
||||||
// walk backward through the diff (added + context lines both count —
|
|
||||||
// a struct declaration unchanged by the PR still appears as context)
|
|
||||||
// to find the nearest `pub struct` boundary, then scan a few lines
|
|
||||||
// above it for derive attributes. Conservative bounds:
|
|
||||||
// - 80 lines back to find `struct` (struct definitions can grow large)
|
|
||||||
// - 8 lines above the `struct` keyword for attribute lines
|
|
||||||
// Stops the struct-search early if we hit a `}` at zero indent
|
|
||||||
// (the previous scope) or another `pub struct` (we left ours).
|
|
||||||
function parentStructHasSerdeDerive(lines: string[], fieldLineIdx: number): boolean {
|
|
||||||
// Bounds-check fieldLineIdx (caught 2026-04-27 by Kimi self-audit).
|
|
||||||
// Pre-fix: if fieldLineIdx >= lines.length, the loop ran from a
|
|
||||||
// negative implicit upper bound (fieldLineIdx - 80 could be > 0
|
|
||||||
// even when fieldLineIdx is past EOF) and read undefined slots.
|
|
||||||
// Defensive: bail early on out-of-range input.
|
|
||||||
if (fieldLineIdx < 0 || fieldLineIdx >= lines.length) return false;
|
|
||||||
|
|
||||||
let structLineIdx = -1;
|
|
||||||
for (let i = fieldLineIdx - 1; i >= 0 && i >= fieldLineIdx - 80; i--) {
|
|
||||||
const raw = lines[i];
|
|
||||||
if (typeof raw !== "string" || raw.length === 0) continue;
|
|
||||||
const body = stripDiffPrefix(raw);
|
|
||||||
const trimmed = body.trim();
|
|
||||||
if (/^pub\s+struct\s+\w/.test(trimmed)) {
|
|
||||||
structLineIdx = i;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
// Closing brace at column 0 means the enclosing scope ended above
|
|
||||||
// the field — we're not actually inside a struct.
|
|
||||||
if (body.startsWith("}")) return false;
|
|
||||||
}
|
|
||||||
if (structLineIdx < 0) return false;
|
|
||||||
|
|
||||||
for (let j = structLineIdx - 1; j >= 0 && j >= structLineIdx - 8; j--) {
|
|
||||||
const raw = lines[j];
|
|
||||||
if (typeof raw !== "string") continue;
|
|
||||||
const trimmed = stripDiffPrefix(raw).trim();
|
|
||||||
if (trimmed === "" || trimmed.startsWith("//") || trimmed.startsWith("///")) continue;
|
|
||||||
if (!trimmed.startsWith("#[")) break;
|
|
||||||
if (/derive\s*\([^)]*\b(Serialize|Deserialize)\b/.test(trimmed)) return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Strip leading +/-/space from a unified-diff line, leaving the raw
|
|
||||||
// source line. Handles the case where the line is shorter than 1 char
|
|
||||||
// (rare but real for empty-context lines).
|
|
||||||
function stripDiffPrefix(line: string): string {
|
|
||||||
if (line.length === 0) return line;
|
|
||||||
const c = line[0];
|
|
||||||
if (c === "+" || c === "-" || c === " ") return line.slice(1);
|
|
||||||
return line;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Walk a single line and toggle the cross-line backtick state on each
|
|
||||||
// unescaped backtick. Single-quote and double-quote runs are line-
|
|
||||||
// bounded in JS/TS/Rust by language rules (string literals don't span
|
|
||||||
// newlines without explicit `\` continuation), so we only track
|
|
||||||
// backticks across lines. Returns the new state for the next line.
|
|
||||||
function updateBacktickState(line: string, inBacktick: boolean): boolean {
|
|
||||||
let state = inBacktick;
|
|
||||||
let inDouble = false;
|
|
||||||
let inSingle = false;
|
|
||||||
for (let i = 0; i < line.length; i++) {
|
|
||||||
const c = line[i];
|
|
||||||
const esc = i > 0 && line[i - 1] === "\\";
|
|
||||||
if (esc) continue;
|
|
||||||
// Inside a multi-line backtick template, single/double quotes
|
|
||||||
// don't open new strings — they're literal characters of the
|
|
||||||
// template. Same applies the other way around.
|
|
||||||
if (c === '"' && !inSingle && !state) inDouble = !inDouble;
|
|
||||||
else if (c === "'" && !inDouble && !state) inSingle = !inSingle;
|
|
||||||
else if (c === "`" && !inDouble && !inSingle) state = !state;
|
|
||||||
}
|
|
||||||
return state;
|
|
||||||
}
|
|
||||||
|
|
||||||
// True if `pos` falls inside a double- or single-quoted string on this
|
|
||||||
// line (backtick template literals too). Walks left→right toggling the
|
|
||||||
// "in quote" state on each unescaped quote. Per-line only — the file-
|
|
||||||
// level walk in runStaticCheck handles multi-line backtick templates
|
|
||||||
// via updateBacktickState.
|
|
||||||
function isInsideQuotedString(line: string, pos: number): boolean {
|
|
||||||
let inDouble = false, inSingle = false, inBacktick = false;
|
|
||||||
for (let i = 0; i < pos; i++) {
|
|
||||||
const c = line[i];
|
|
||||||
const esc = i > 0 && line[i - 1] === "\\";
|
|
||||||
if (esc) continue;
|
|
||||||
if (c === '"' && !inSingle && !inBacktick) inDouble = !inDouble;
|
|
||||||
else if (c === "'" && !inDouble && !inBacktick) inSingle = !inSingle;
|
|
||||||
else if (c === "`" && !inDouble && !inSingle) inBacktick = !inBacktick;
|
|
||||||
}
|
|
||||||
return inDouble || inSingle || inBacktick;
|
|
||||||
}
|
|
||||||
|
|
||||||
function escape(s: string): string {
|
|
||||||
return s.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
|
|
||||||
}
|
|
||||||
@@ -1,210 +0,0 @@
|
|||||||
// Claim parser — reads commit messages + PR body, extracts ship-claims.
|
|
||||||
//
|
|
||||||
// A "ship-claim" is any phrase that asserts functionality is working,
|
|
||||||
// tested, complete, or landed. These are the assertions the downstream
|
|
||||||
// checks (static/dynamic/inference/kb) try to falsify.
|
|
||||||
//
|
|
||||||
// Heuristic approach (regex + strength grading) — intentionally NOT
|
|
||||||
// using an LLM here. Reason: the inference check already asks a cloud
|
|
||||||
// model "does this match the claim?". The parser's job is to surface
|
|
||||||
// the claim substrates, not judge them. Over-engineering the parser
|
|
||||||
// risks false-negatives when the cloud model was going to catch it
|
|
||||||
// anyway.
|
|
||||||
|
|
||||||
import type { Claim, PrSnapshot } from "./types.ts";
|
|
||||||
|
|
||||||
// Strong claims: explicit end-to-end + verification vocabulary
|
|
||||||
const STRONG_PATTERNS: RegExp[] = [
|
|
||||||
/\bverified\s+(end[- ]to[- ]end|live|in\s+production|against)\b/i,
|
|
||||||
/\btested\s+(live|end[- ]to[- ]end|against|with)\b/i,
|
|
||||||
/\bworks\s+(end[- ]to[- ]end|live|in\s+production)\b/i,
|
|
||||||
/\bproduction[- ]ready\b/i,
|
|
||||||
/\bfully\s+(functional|wired|working)\b/i,
|
|
||||||
/\bphase\s+\d+(\.\d+)?\s+(shipped|complete|done|landed)\b/i,
|
|
||||||
/\bground\s+truth\b/i,
|
|
||||||
/\bproven\b/i,
|
|
||||||
];
|
|
||||||
|
|
||||||
// Moderate claims: asserted completion or pass but without the strong
|
|
||||||
// verification qualifier.
|
|
||||||
const MODERATE_PATTERNS: RegExp[] = [
|
|
||||||
/\bshipped\b/i,
|
|
||||||
/\blanded\b/i,
|
|
||||||
/\bgreen\b/i,
|
|
||||||
/\b(tests?\s+)?pass(ing|ed)\b/i,
|
|
||||||
/\bcomplet(e|ed)\b/i,
|
|
||||||
/\bdone\b/i,
|
|
||||||
/\bwired\b/i,
|
|
||||||
/\bfixed\b/i,
|
|
||||||
/\bworks\b/i,
|
|
||||||
];
|
|
||||||
|
|
||||||
// Weak claims: aspirational or hedged. Usually low-risk but recorded
|
|
||||||
// for completeness.
|
|
||||||
const WEAK_PATTERNS: RegExp[] = [
|
|
||||||
/\bshould\s+work\b/i,
|
|
||||||
/\bexpected\s+to\b/i,
|
|
||||||
/\bintended\s+to\b/i,
|
|
||||||
/\bwill\s+(work|handle|support)\b/i,
|
|
||||||
/\bprobably\b/i,
|
|
||||||
];
|
|
||||||
|
|
||||||
// Empirical claims: runtime measurements / observed outcomes that can't
|
|
||||||
// be verified from a diff (only from the actual run that produced
|
|
||||||
// them). Classifying as empirical lets the inference check skip
|
|
||||||
// diff-verification and saves the ladder for falsifiable claims.
|
|
||||||
//
|
|
||||||
// Two classes share this bucket because they share the skip discipline:
|
|
||||||
//
|
|
||||||
// 1. Runtime metrics — "58 cloud calls", "306s end-to-end"
|
|
||||||
// 2. History/proof refs — "verified on PR #8", "was flipping across runs"
|
|
||||||
//
|
|
||||||
// Both are assertions about state outside the current diff. The cloud
|
|
||||||
// would flag them as "not backed" — but that's a false positive: the
|
|
||||||
// proof lives in the referenced run, prior commit, or test output, not
|
|
||||||
// in the added lines the cloud is reading.
|
|
||||||
const EMPIRICAL_PATTERNS: RegExp[] = [
|
|
||||||
// ─── Runtime metrics ───
|
|
||||||
// Iteration / attempt counts: "6/6 iterations", "attempt 5", "accepted on attempt 3"
|
|
||||||
/\b\d+\s*\/\s*\d+\s+(iterations?|attempts?|cycles?|runs?|shards?)\b/i,
|
|
||||||
/\b(accepted|resolved|converged)\s+on\s+attempt\s+\d+\b/i,
|
|
||||||
// Runtime metrics: "58 cloud calls", "306s end-to-end", "245s total", "5931 chars"
|
|
||||||
/\b\d+\s+(cloud\s+)?calls?\b/i,
|
|
||||||
/\b\d+\s*(ms|s|seconds?|minutes?|m)\s+(end[- ]to[- ]end|total|elapsed|duration)\b/i,
|
|
||||||
/\b\d+\s+chars?\b.*\b(accepted|generated|produced)\b/i,
|
|
||||||
// "escalated through N tiers", "N distinct models"
|
|
||||||
/\bescalated\s+through\s+\d+\b/i,
|
|
||||||
/\b\d+\s+distinct\s+(model|tier)s?\b/i,
|
|
||||||
|
|
||||||
// ─── History / proof references ───
|
|
||||||
// "verified on PR #8", "verified end-to-end on PR 8", "tested against PR #4"
|
|
||||||
// Require PR#N / commit-hash / "prior <word>" to avoid matching
|
|
||||||
// "verified ... in production" (PR without \b-ish anchor previously
|
|
||||||
// consumed "pr" of "production").
|
|
||||||
/\bverified\s+(?:end[- ]to[- ]end\s+)?(?:on|against|in)\s+(?:PR\s*#?\d+|commit\s+[0-9a-f]{6,}|prior\s+\w+|the\s+\w+\s+audit)\b/i,
|
|
||||||
/\btested\s+(?:against|in|on)\s+(?:PR\s*#?\d+|commit\s+[0-9a-f]{6,}|prior\s+\w+)\b/i,
|
|
||||||
// Direct PR/commit references: "PR #8", "on PR 9", "from commit abc123"
|
|
||||||
/\b(?:on|from|in|via|per)\s+PR\s*#?\d+\b/i,
|
|
||||||
/\b(?:from|in|per|against)\s+commit\s+[0-9a-f]{6,}/i,
|
|
||||||
// Observational descriptions of prior behavior: "was flipping", "was X before", "previously observed"
|
|
||||||
/\b(?:was|were)\s+(?:flipping|drifting|inconsistent|non[- ]deterministic|creeping)\b/i,
|
|
||||||
/\bpreviously\s+(?:observed|flagged|reported|seen|landed)\b/i,
|
|
||||||
/\bused\s+to\s+(?:flip|fail|flag|reject|block)\b/i,
|
|
||||||
/\bobserved\s+(?:in|during|on|across)\s+(?:PR|prior|\d+\s+(?:runs?|audits?))/i,
|
|
||||||
// "flipping/drifting across N runs" — historical variance description
|
|
||||||
/\b(?:flipping|drifting|varying|oscillating)\s+across\s+(?:\d+\s+)?(?:runs?|audits?|iterations?)\b/i,
|
|
||||||
// "the proven X" referring to prior work (proven is a STRONG pattern
|
|
||||||
// but in context "the proven FOO" is usually a historical reference,
|
|
||||||
// not a fresh claim). We catch it here so the empirical skip wins.
|
|
||||||
/\bthe\s+proven\s+(?:escalation\s+ladder|pipeline|flow|loop|tier|path)/i,
|
|
||||||
// "from the 9-run test", "across the 5-run validation"
|
|
||||||
/\b(?:from|across|in|during)\s+the\s+\d+[- ]run\s+(?:test|validation|probe|experiment)/i,
|
|
||||||
];
|
|
||||||
|
|
||||||
export interface ParsedClaims {
|
|
||||||
claims: Claim[];
|
|
||||||
commits_scanned: number;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function parseClaims(pr: PrSnapshot): ParsedClaims {
|
|
||||||
const claims: Claim[] = [];
|
|
||||||
|
|
||||||
// PR body — every matching line becomes a claim at location "pr_body:N"
|
|
||||||
if (pr.body) {
|
|
||||||
scanText(pr.body, "pr_body", pr.head_sha, claims);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Each commit message gets its own scan.
|
|
||||||
for (const c of pr.commits) {
|
|
||||||
if (!c.message) continue;
|
|
||||||
scanText(c.message, `commit:${c.sha.slice(0, 8)}`, c.sha, claims);
|
|
||||||
}
|
|
||||||
|
|
||||||
return { claims, commits_scanned: pr.commits.length };
|
|
||||||
}
|
|
||||||
|
|
||||||
function scanText(text: string, location_prefix: string, commit_sha: string, out: Claim[]): void {
|
|
||||||
const lines = text.split(/\r?\n/);
|
|
||||||
for (let i = 0; i < lines.length; i++) {
|
|
||||||
const line = lines[i];
|
|
||||||
if (line.length < 3) continue;
|
|
||||||
|
|
||||||
// Empirical match wins over everything else — if a line ALSO
|
|
||||||
// contains a moderate word like "complete", we still want to
|
|
||||||
// classify it as empirical so the inference check doesn't ask
|
|
||||||
// the cloud to prove "58 cloud calls" from the diff. Order:
|
|
||||||
// empirical → strong → moderate → weak.
|
|
||||||
const empirical = firstUnquotedMatch(line, EMPIRICAL_PATTERNS);
|
|
||||||
if (empirical) {
|
|
||||||
out.push({
|
|
||||||
text: line.trim().slice(0, 200),
|
|
||||||
commit_sha,
|
|
||||||
location: `${location_prefix}:${i + 1}`,
|
|
||||||
strength: "empirical",
|
|
||||||
});
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
const strong = firstUnquotedMatch(line, STRONG_PATTERNS);
|
|
||||||
if (strong) {
|
|
||||||
out.push({
|
|
||||||
text: line.trim().slice(0, 200),
|
|
||||||
commit_sha,
|
|
||||||
location: `${location_prefix}:${i + 1}`,
|
|
||||||
strength: "strong",
|
|
||||||
});
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
const moderate = firstUnquotedMatch(line, MODERATE_PATTERNS);
|
|
||||||
if (moderate) {
|
|
||||||
out.push({
|
|
||||||
text: line.trim().slice(0, 200),
|
|
||||||
commit_sha,
|
|
||||||
location: `${location_prefix}:${i + 1}`,
|
|
||||||
strength: "moderate",
|
|
||||||
});
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
const weak = firstUnquotedMatch(line, WEAK_PATTERNS);
|
|
||||||
if (weak) {
|
|
||||||
out.push({
|
|
||||||
text: line.trim().slice(0, 200),
|
|
||||||
commit_sha,
|
|
||||||
location: `${location_prefix}:${i + 1}`,
|
|
||||||
strength: "weak",
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Match a pattern only when its match position is NOT inside a quoted
|
|
||||||
// string on the line. Mirrors the same guard in auditor/checks/static.ts
|
|
||||||
// — the two files have the same false-positive class: PR authors
|
|
||||||
// quote pattern examples in commit message bodies (e.g. `"Phase 45
|
|
||||||
// shipped"` as a test example) and without this guard those quoted
|
|
||||||
// references get flagged as fresh ship-claims. Only skips when the
|
|
||||||
// match itself falls inside quotes; real (unquoted) uses of the same
|
|
||||||
// vocabulary still classify correctly.
|
|
||||||
function firstUnquotedMatch(text: string, patterns: RegExp[]): RegExp | null {
|
|
||||||
for (const p of patterns) {
|
|
||||||
const m = text.match(p);
|
|
||||||
if (!m || typeof m.index !== "number") continue;
|
|
||||||
if (isInsideQuotedString(text, m.index)) continue;
|
|
||||||
return p;
|
|
||||||
}
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Walks left→right toggling in-quote state on each unescaped quote.
|
|
||||||
// Good enough for single-line claims; multi-line strings aren't parsed.
|
|
||||||
function isInsideQuotedString(line: string, pos: number): boolean {
|
|
||||||
let inDouble = false, inSingle = false, inBacktick = false;
|
|
||||||
for (let i = 0; i < pos; i++) {
|
|
||||||
const c = line[i];
|
|
||||||
const esc = i > 0 && line[i - 1] === "\\";
|
|
||||||
if (esc) continue;
|
|
||||||
if (c === '"' && !inSingle && !inBacktick) inDouble = !inDouble;
|
|
||||||
else if (c === "'" && !inDouble && !inBacktick) inSingle = !inSingle;
|
|
||||||
else if (c === "`" && !inDouble && !inSingle) inBacktick = !inBacktick;
|
|
||||||
}
|
|
||||||
return inDouble || inSingle || inBacktick;
|
|
||||||
}
|
|
||||||
@@ -1,271 +0,0 @@
|
|||||||
// fact_extractor — routes curated TEXT through llm_team_ui's
|
|
||||||
// "knowledge extract facts" mode (mode=extract at /api/run).
|
|
||||||
//
|
|
||||||
// What it gives us: structured {facts, entities, relationships} from
|
|
||||||
// whatever curated blob we send. Auditor sends the tree-split
|
|
||||||
// inference scratchpad (the best distillation of what a PR changed).
|
|
||||||
// Scrum_master will later send its accepted review bodies.
|
|
||||||
//
|
|
||||||
// Why route through llm_team and not just extract directly from our
|
|
||||||
// own checks: llm_team's extract uses a local EXTRACTOR model
|
|
||||||
// (qwen2.5) + a separate VERIFIER (gemma2). This cross-check is the
|
|
||||||
// discipline J wants for knowledge going into the playbook — facts
|
|
||||||
// go in only after a second model has rated them CORRECT /
|
|
||||||
// UNVERIFIABLE. Fast (local models, ~10-20s), free, and matches the
|
|
||||||
// codereview pattern J already trusts.
|
|
||||||
//
|
|
||||||
// SSE parsing: llm_team streams SSE events. We're only interested in
|
|
||||||
// the final "response" event with role="final" + the extraction
|
|
||||||
// response (role="extraction N"). Parse the JSON from the extractor's
|
|
||||||
// response text.
|
|
||||||
|
|
||||||
const LLM_TEAM = process.env.LH_LLM_TEAM_URL ?? "http://localhost:5000";
|
|
||||||
const EXTRACTOR = process.env.LH_FACT_EXTRACTOR ?? "qwen2.5:latest";
|
|
||||||
const VERIFIER = process.env.LH_FACT_VERIFIER ?? "gemma2:latest";
|
|
||||||
const EXTRACT_TIMEOUT_MS = 120_000;
|
|
||||||
const PROJECT_CONTEXT_FILE = process.env.LH_AUDITOR_CONTEXT_FILE
|
|
||||||
?? "/home/profit/lakehouse/docs/AUDITOR_CONTEXT.md";
|
|
||||||
|
|
||||||
let cachedContext: string | null = null;
|
|
||||||
async function loadProjectContext(): Promise<string> {
|
|
||||||
if (cachedContext !== null) return cachedContext;
|
|
||||||
try {
|
|
||||||
const { readFile } = await import("node:fs/promises");
|
|
||||||
const raw = await readFile(PROJECT_CONTEXT_FILE, "utf8");
|
|
||||||
// Cap at 4KB — anything past that is more noise than signal for
|
|
||||||
// the extractor/verifier's attention budget.
|
|
||||||
cachedContext = raw.slice(0, 4000);
|
|
||||||
} catch {
|
|
||||||
cachedContext = ""; // context file missing → extractor runs without preamble
|
|
||||||
}
|
|
||||||
return cachedContext;
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface Entity {
|
|
||||||
name: string;
|
|
||||||
type: string;
|
|
||||||
description?: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface Relationship {
|
|
||||||
from: string;
|
|
||||||
to: string;
|
|
||||||
type: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface ExtractedFacts {
|
|
||||||
facts: string[];
|
|
||||||
entities: Entity[];
|
|
||||||
relationships: Relationship[];
|
|
||||||
verification: string;
|
|
||||||
extractor_model: string;
|
|
||||||
verifier_model: string;
|
|
||||||
source_preview: string;
|
|
||||||
// Populated when the extract run completed server-side (llm_team
|
|
||||||
// persists to its own team_runs; this is for our own cross-ref).
|
|
||||||
llm_team_run_id?: number;
|
|
||||||
extracted_at: string;
|
|
||||||
// Per-fact verdicts from the verifier pass (CORRECT/INCORRECT/
|
|
||||||
// UNVERIFIABLE/UNCHECKED). Aligned 1:1 with the *raw* fact list
|
|
||||||
// pre-drop so operators can see which verdicts mapped to dropped
|
|
||||||
// facts if needed.
|
|
||||||
verifier_verdicts?: Array<"CORRECT" | "INCORRECT" | "UNVERIFIABLE" | "UNCHECKED">;
|
|
||||||
facts_dropped_by_verifier?: number;
|
|
||||||
error?: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Run the llm_team extract pipeline on `source` text. Returns
|
|
||||||
* structured {facts, entities, relationships}.
|
|
||||||
*
|
|
||||||
* Returns an object with `error` set if the pipeline failed — never
|
|
||||||
* throws, because fact extraction is best-effort enrichment (the
|
|
||||||
* primary audit must not break if llm_team is down).
|
|
||||||
*/
|
|
||||||
export async function extractFacts(source: string): Promise<ExtractedFacts> {
|
|
||||||
const base: ExtractedFacts = {
|
|
||||||
facts: [],
|
|
||||||
entities: [],
|
|
||||||
relationships: [],
|
|
||||||
verification: "",
|
|
||||||
extractor_model: EXTRACTOR,
|
|
||||||
verifier_model: VERIFIER,
|
|
||||||
source_preview: source.slice(0, 240),
|
|
||||||
extracted_at: new Date().toISOString(),
|
|
||||||
};
|
|
||||||
|
|
||||||
// Prepend project context to the source so the extractor + verifier
|
|
||||||
// know what codebase/framework these facts belong to. Without this,
|
|
||||||
// the verifier marks most domain-specific facts as UNVERIFIABLE ("I
|
|
||||||
// don't know what Lakehouse is"). With it, the verifier can CORRECT-
|
|
||||||
// stamp facts that align with the stated architecture.
|
|
||||||
const context = await loadProjectContext();
|
|
||||||
const prompt = context.length > 0
|
|
||||||
? `=== PROJECT CONTEXT (for grounding facts; do NOT extract facts from this section) ===\n${context}\n\n=== CONTENT TO EXTRACT FACTS FROM ===\n${source}`
|
|
||||||
: source;
|
|
||||||
|
|
||||||
let resp: Response;
|
|
||||||
try {
|
|
||||||
resp = await fetch(`${LLM_TEAM}/api/run`, {
|
|
||||||
method: "POST",
|
|
||||||
headers: { "content-type": "application/json" },
|
|
||||||
body: JSON.stringify({
|
|
||||||
mode: "extract",
|
|
||||||
prompt,
|
|
||||||
extractor: EXTRACTOR,
|
|
||||||
verifier: VERIFIER,
|
|
||||||
source: "prompt",
|
|
||||||
skip_cache: true, // cache by prompt would dedup identical
|
|
||||||
// scratchpads, but we want fresh extraction
|
|
||||||
// for per-audit facts; cheap since local.
|
|
||||||
}),
|
|
||||||
signal: AbortSignal.timeout(EXTRACT_TIMEOUT_MS),
|
|
||||||
});
|
|
||||||
} catch (e) {
|
|
||||||
return { ...base, error: `fetch failed: ${(e as Error).message}` };
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!resp.ok) {
|
|
||||||
const body = await resp.text().catch(() => "");
|
|
||||||
return { ...base, error: `llm_team /api/run ${resp.status}: ${body.slice(0, 200)}` };
|
|
||||||
}
|
|
||||||
|
|
||||||
// Stream SSE lines; collect the one extraction response + the run_saved event
|
|
||||||
// so we can capture the team-runs ID for cross-ref.
|
|
||||||
const decoder = new TextDecoder();
|
|
||||||
const reader = resp.body?.getReader();
|
|
||||||
if (!reader) return { ...base, error: "no response body" };
|
|
||||||
|
|
||||||
let buffer = "";
|
|
||||||
let extractionText = "";
|
|
||||||
let verifierText = "";
|
|
||||||
let runId: number | undefined = undefined;
|
|
||||||
|
|
||||||
try {
|
|
||||||
while (true) {
|
|
||||||
const { done, value } = await reader.read();
|
|
||||||
if (done) break;
|
|
||||||
buffer += decoder.decode(value, { stream: true });
|
|
||||||
let nl: number;
|
|
||||||
while ((nl = buffer.indexOf("\n\n")) >= 0) {
|
|
||||||
const chunk = buffer.slice(0, nl);
|
|
||||||
buffer = buffer.slice(nl + 2);
|
|
||||||
const dataLine = chunk.split("\n").find(l => l.startsWith("data: "));
|
|
||||||
if (!dataLine) continue;
|
|
||||||
try {
|
|
||||||
const ev = JSON.parse(dataLine.slice(6));
|
|
||||||
if (ev.type === "response") {
|
|
||||||
const role = String(ev.role ?? "");
|
|
||||||
if (role.startsWith("extraction")) extractionText = String(ev.text ?? "");
|
|
||||||
else if (role === "verifier") verifierText = String(ev.text ?? "");
|
|
||||||
} else if (ev.type === "run_saved") {
|
|
||||||
const id = Number(ev.run_id);
|
|
||||||
if (Number.isFinite(id)) runId = id;
|
|
||||||
}
|
|
||||||
} catch { /* skip malformed SSE */ }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} catch (e) {
|
|
||||||
return { ...base, error: `SSE read failed: ${(e as Error).message}` };
|
|
||||||
}
|
|
||||||
|
|
||||||
// Pull the JSON object out of extractionText (may be wrapped in ```json fences).
|
|
||||||
const parsed = extractFirstJsonObject(extractionText);
|
|
||||||
if (!parsed) {
|
|
||||||
return { ...base, error: "extractor returned no parseable JSON", verification: verifierText };
|
|
||||||
}
|
|
||||||
|
|
||||||
const rawFacts: string[] = Array.isArray(parsed.facts)
|
|
||||||
? parsed.facts.slice(0, 50).map(String)
|
|
||||||
: [];
|
|
||||||
|
|
||||||
// Parse the verifier's free-form prose into per-fact verdicts, then
|
|
||||||
// drop any fact the verifier explicitly marked INCORRECT. Leave
|
|
||||||
// UNVERIFIABLE in place: many of our extractions are domain-specific
|
|
||||||
// (Lakehouse internals) and the verifier has no prior-knowledge
|
|
||||||
// anchor, so UNVERIFIABLE is the expected verdict for new signal,
|
|
||||||
// not a quality fail. This is verifier-gated persistence: drop only
|
|
||||||
// what's affirmatively wrong, not what's novel.
|
|
||||||
const verdicts = parseVerifierVerdicts(verifierText, rawFacts.length);
|
|
||||||
const incorrectIdx = new Set<number>();
|
|
||||||
verdicts.forEach((v, i) => { if (v === "INCORRECT") incorrectIdx.add(i); });
|
|
||||||
const kept = rawFacts.filter((_, i) => !incorrectIdx.has(i));
|
|
||||||
|
|
||||||
return {
|
|
||||||
...base,
|
|
||||||
facts: kept,
|
|
||||||
entities: Array.isArray(parsed.entities)
|
|
||||||
? parsed.entities.slice(0, 30).map((e: any) => ({
|
|
||||||
name: String(e?.name ?? ""),
|
|
||||||
type: String(e?.type ?? ""),
|
|
||||||
description: typeof e?.description === "string" ? e.description.slice(0, 240) : undefined,
|
|
||||||
})).filter(e => e.name.length > 0)
|
|
||||||
: [],
|
|
||||||
relationships: Array.isArray(parsed.relationships)
|
|
||||||
? parsed.relationships.slice(0, 30).map((r: any) => ({
|
|
||||||
from: String(r?.from ?? ""),
|
|
||||||
to: String(r?.to ?? ""),
|
|
||||||
type: String(r?.type ?? ""),
|
|
||||||
})).filter(r => r.from.length > 0 && r.to.length > 0)
|
|
||||||
: [],
|
|
||||||
verification: verifierText.slice(0, 1500),
|
|
||||||
facts_dropped_by_verifier: incorrectIdx.size,
|
|
||||||
verifier_verdicts: verdicts,
|
|
||||||
llm_team_run_id: runId,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
// Parse verifier's free-form output into a per-fact verdict array.
|
|
||||||
// Gemma2 uses several formats depending on prompt mood:
|
|
||||||
// Format A: **1.** claim... * **Verdict:** CORRECT
|
|
||||||
// Format B: **1.** claim... * **CORRECT** (no "Verdict:" label)
|
|
||||||
// Format C: 1. claim... CORRECT
|
|
||||||
// Strategy: split on fact numbers, then find the first
|
|
||||||
// CORRECT|INCORRECT|UNVERIFIABLE token in each section. Handles all
|
|
||||||
// three formats without regex gymnastics.
|
|
||||||
function parseVerifierVerdicts(
|
|
||||||
verifierText: string,
|
|
||||||
numFacts: number,
|
|
||||||
): Array<"CORRECT" | "INCORRECT" | "UNVERIFIABLE" | "UNCHECKED"> {
|
|
||||||
const out: Array<"CORRECT" | "INCORRECT" | "UNVERIFIABLE" | "UNCHECKED"> =
|
|
||||||
Array(numFacts).fill("UNCHECKED");
|
|
||||||
if (!verifierText) return out;
|
|
||||||
|
|
||||||
// Find each fact section start — "**N.**" or "N." at line start —
|
|
||||||
// and slice out the content up to the NEXT fact number. Each section
|
|
||||||
// gets scanned for the first CORRECT/INCORRECT/UNVERIFIABLE token.
|
|
||||||
const starts: Array<{ idx: number; pos: number }> = [];
|
|
||||||
const header = /(?:^|\n)\s*(?:\*\*)?(\d+)[.)]/g;
|
|
||||||
for (const m of verifierText.matchAll(header)) {
|
|
||||||
const factNum = Number(m[1]);
|
|
||||||
if (!Number.isFinite(factNum)) continue;
|
|
||||||
starts.push({ idx: factNum - 1, pos: m.index! });
|
|
||||||
}
|
|
||||||
for (let i = 0; i < starts.length; i++) {
|
|
||||||
const s = starts[i];
|
|
||||||
const end = i + 1 < starts.length ? starts[i + 1].pos : verifierText.length;
|
|
||||||
if (s.idx < 0 || s.idx >= numFacts) continue;
|
|
||||||
const section = verifierText.slice(s.pos, end);
|
|
||||||
const v = section.match(/\b(CORRECT|INCORRECT|UNVERIFIABLE)\b/i);
|
|
||||||
if (v) out[s.idx] = v[1].toUpperCase() as "CORRECT" | "INCORRECT" | "UNVERIFIABLE";
|
|
||||||
}
|
|
||||||
return out;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Lift the first balanced JSON object out of (possibly fenced) text.
|
|
||||||
// Same discipline as inference.ts::extractJson.
|
|
||||||
function extractFirstJsonObject(text: string): any | null {
|
|
||||||
const cleaned = text.replace(/^```(?:json)?\s*/im, "").replace(/```\s*$/im, "");
|
|
||||||
let depth = 0, start = -1;
|
|
||||||
for (let i = 0; i < cleaned.length; i++) {
|
|
||||||
const c = cleaned[i];
|
|
||||||
if (c === "{") { if (depth === 0) start = i; depth++; }
|
|
||||||
else if (c === "}") {
|
|
||||||
depth--;
|
|
||||||
if (depth === 0 && start >= 0) {
|
|
||||||
try { return JSON.parse(cleaned.slice(start, i + 1)); } catch { start = -1; }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
@@ -1,49 +0,0 @@
|
|||||||
// Standalone runner for auditor fixtures. Invoke:
|
|
||||||
//
|
|
||||||
// bun run auditor/fixtures/cli.ts hybrid_38_40_45
|
|
||||||
//
|
|
||||||
// Prints human-readable per-layer breakdown + JSON result so the
|
|
||||||
// output can be captured by the dynamic check without re-running.
|
|
||||||
|
|
||||||
import { runHybridFixture, type FixtureResult } from "./hybrid_38_40_45.ts";
|
|
||||||
|
|
||||||
const fixtureArg = process.argv[2] ?? "hybrid_38_40_45";
|
|
||||||
|
|
||||||
let result: FixtureResult;
|
|
||||||
switch (fixtureArg) {
|
|
||||||
case "hybrid_38_40_45":
|
|
||||||
result = await runHybridFixture();
|
|
||||||
break;
|
|
||||||
default:
|
|
||||||
console.error(`unknown fixture: ${fixtureArg}`);
|
|
||||||
process.exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Human-readable summary
|
|
||||||
console.error(""); // blank line to stderr so stdout JSON stays clean
|
|
||||||
console.error(`─── Fixture: ${result.fixture} ───`);
|
|
||||||
console.error(` overall: ${result.overall.toUpperCase()}`);
|
|
||||||
console.error(` shipped: [${result.shipped_phases.join(", ") || "—"}]`);
|
|
||||||
console.error(` placeholder: [${result.placeholder_phases.join(", ") || "—"}]`);
|
|
||||||
console.error("");
|
|
||||||
for (const l of result.layers) {
|
|
||||||
const mark = l.ok ? "✓" : "✗";
|
|
||||||
const phaseStr = `Phase ${l.phase}`.padEnd(11);
|
|
||||||
console.error(` ${mark} ${phaseStr} ${l.layer.padEnd(30)} ${String(l.latency_ms).padStart(6)}ms`);
|
|
||||||
if (l.ok) {
|
|
||||||
console.error(` ${l.evidence.slice(0, 200)}`);
|
|
||||||
} else {
|
|
||||||
console.error(` ERROR: ${l.error?.slice(0, 240) ?? "unknown"}`);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
console.error("");
|
|
||||||
for (const n of result.notes) console.error(` note: ${n}`);
|
|
||||||
console.error("");
|
|
||||||
|
|
||||||
// Machine-readable output on stdout.
|
|
||||||
console.log(JSON.stringify(result, null, 2));
|
|
||||||
|
|
||||||
// Exit code reflects overall: 0 pass, 2 partial, 1 fail.
|
|
||||||
// Dynamic check reads this AND the JSON; partial-pass is treated
|
|
||||||
// as informative (some layers shipped), not blocking on its own.
|
|
||||||
process.exit(result.overall === "pass" ? 0 : result.overall === "partial_pass" ? 2 : 1);
|
|
||||||
@@ -1,335 +0,0 @@
|
|||||||
// The never-run hybrid test fixture. Exercises the full stack end-to-end
|
|
||||||
// across Phase 38 (/v1/chat), Phase 40 (Langfuse tracing), Phase 45
|
|
||||||
// slice 1 (DocRef on playbook), and Phase 45 slice 2 (context7 bridge
|
|
||||||
// drift detection).
|
|
||||||
//
|
|
||||||
// Returns HONEST per-layer results. A layer that's unimplemented or
|
|
||||||
// broken returns ok=false with a real error; overall verdict flags
|
|
||||||
// which phases are genuinely shipped vs still placeholder.
|
|
||||||
//
|
|
||||||
// Deterministic: always runs the same payload so a run's output is
|
|
||||||
// comparable across audits. Uses TEST-prefixed names so playbook
|
|
||||||
// state doesn't get polluted with production-looking fixture data.
|
|
||||||
//
|
|
||||||
// Preconditions:
|
|
||||||
// - gateway up on :3100
|
|
||||||
// - Python sidecar up on :3200
|
|
||||||
// - Ollama local + Ollama Cloud key loaded
|
|
||||||
// - Langfuse up on :3001
|
|
||||||
// - context7 bridge up on :3900 (manual-start per mcp-server/README)
|
|
||||||
// If bridge isn't running, that layer reports ok=false with a
|
|
||||||
// clear error — the fixture doesn't try to auto-start it.
|
|
||||||
|
|
||||||
import { readFile } from "node:fs/promises";
|
|
||||||
|
|
||||||
const GATEWAY = process.env.LH_GATEWAY_URL ?? "http://localhost:3100";
|
|
||||||
const LANGFUSE = process.env.LANGFUSE_URL ?? "http://localhost:3001";
|
|
||||||
const BRIDGE = process.env.CONTEXT7_BRIDGE_URL ?? "http://localhost:3900";
|
|
||||||
const FIXTURE_ID = "auditor:hybrid_38_40_45:v1";
|
|
||||||
const TEST_WORKER_NAME = "__auditor_test_worker__";
|
|
||||||
const STALE_HASH = "stale-hash-for-drift-proof";
|
|
||||||
// Unique-per-run identifiers so each fixture invocation hits the ADD
|
|
||||||
// path in upsert_entry (not UPDATE/NOOP on a leftover from a prior
|
|
||||||
// run). Catches state pollution + avoids interaction with task #12
|
|
||||||
// (UPDATE branch silently drops doc_refs).
|
|
||||||
const RUN_NONCE = Date.now().toString(36);
|
|
||||||
const TEST_WORKER_NAME_VERSIONED = `__auditor_test_worker_${RUN_NONCE}__`;
|
|
||||||
const TEST_OPERATION_VERSIONED = `TEST: fill: __auditor_${RUN_NONCE}__ x1 in TestCity, TC`;
|
|
||||||
|
|
||||||
export interface LayerResult {
|
|
||||||
layer: string;
|
|
||||||
phase: string;
|
|
||||||
ok: boolean;
|
|
||||||
latency_ms: number;
|
|
||||||
evidence: string;
|
|
||||||
error?: string;
|
|
||||||
// Layer-specific numbers that downstream checks can aggregate.
|
|
||||||
metrics?: Record<string, number | string | boolean>;
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface FixtureResult {
|
|
||||||
fixture: string;
|
|
||||||
ran_at: string;
|
|
||||||
overall: "pass" | "partial_pass" | "fail";
|
|
||||||
layers: LayerResult[];
|
|
||||||
real_numbers: Record<string, number>;
|
|
||||||
shipped_phases: string[];
|
|
||||||
placeholder_phases: string[];
|
|
||||||
notes: string[];
|
|
||||||
}
|
|
||||||
|
|
||||||
// Wraps a layer's async body with timing + structured error capture.
|
|
||||||
// On throw: returns ok=false with the error string as evidence, so
|
|
||||||
// downstream verdict code treats it as a layer failure rather than
|
|
||||||
// a fixture crash.
|
|
||||||
async function measureLayer(
|
|
||||||
layer: string,
|
|
||||||
phase: string,
|
|
||||||
body: () => Promise<{ evidence: string; metrics?: Record<string, number | string | boolean> }>,
|
|
||||||
): Promise<LayerResult> {
|
|
||||||
const t0 = Date.now();
|
|
||||||
try {
|
|
||||||
const { evidence, metrics } = await body();
|
|
||||||
return {
|
|
||||||
layer, phase, ok: true,
|
|
||||||
latency_ms: Date.now() - t0,
|
|
||||||
evidence, metrics,
|
|
||||||
};
|
|
||||||
} catch (e) {
|
|
||||||
return {
|
|
||||||
layer, phase, ok: false,
|
|
||||||
latency_ms: Date.now() - t0,
|
|
||||||
evidence: `FAILED: ${(e as Error).message.slice(0, 200)}`,
|
|
||||||
error: (e as Error).message,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
async function langfuseAuth(): Promise<{ pk: string; sk: string } | null> {
|
|
||||||
// Default credentials match mcp-server/tracing.ts. Same sources the
|
|
||||||
// Rust side uses in gateway/src/v1/langfuse_trace.rs.
|
|
||||||
let pk = process.env.LANGFUSE_PUBLIC_KEY ?? "pk-lf-staffing";
|
|
||||||
let sk = process.env.LANGFUSE_SECRET_KEY ?? "sk-lf-staffing-secret";
|
|
||||||
if (!pk || !sk) return null;
|
|
||||||
return { pk, sk };
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function runHybridFixture(): Promise<FixtureResult> {
|
|
||||||
const result: FixtureResult = {
|
|
||||||
fixture: FIXTURE_ID,
|
|
||||||
ran_at: new Date().toISOString(),
|
|
||||||
overall: "fail",
|
|
||||||
layers: [],
|
|
||||||
real_numbers: {},
|
|
||||||
shipped_phases: [],
|
|
||||||
placeholder_phases: [],
|
|
||||||
notes: [],
|
|
||||||
};
|
|
||||||
|
|
||||||
// ========================================================================
|
|
||||||
// Layer 1 — Phase 38: POST /v1/chat returns valid OpenAI shape
|
|
||||||
// ========================================================================
|
|
||||||
// Captured HERE, immediately before the chat layer runs, so layer 2's
|
|
||||||
// Langfuse-trace filter uses the actual moment the chat call was
|
|
||||||
// attempted — not the fixture start time. Earlier draft had a
|
|
||||||
// meaningless ternary returning result.ran_at on both branches; the
|
|
||||||
// LLM-Team codereview (2026-04-22) caught this and flagged it as a
|
|
||||||
// false-negative window on traces created between fixture-start and
|
|
||||||
// chat-fetch.
|
|
||||||
const chat_request_sent_ms = Date.now();
|
|
||||||
|
|
||||||
const l1 = await measureLayer("phase38_chat", "38", async () => {
|
|
||||||
const r = await fetch(`${GATEWAY}/v1/chat`, {
|
|
||||||
method: "POST",
|
|
||||||
headers: { "content-type": "application/json" },
|
|
||||||
body: JSON.stringify({
|
|
||||||
model: "qwen3.5:latest",
|
|
||||||
messages: [
|
|
||||||
{ role: "system", content: "Respond in 8 words or fewer." },
|
|
||||||
{ role: "user", content: "Name one Docker command." },
|
|
||||||
],
|
|
||||||
max_tokens: 60,
|
|
||||||
temperature: 0.2,
|
|
||||||
}),
|
|
||||||
signal: AbortSignal.timeout(60000),
|
|
||||||
});
|
|
||||||
if (!r.ok) throw new Error(`gateway ${r.status}: ${await r.text()}`);
|
|
||||||
const j: any = await r.json();
|
|
||||||
const content = j.choices?.[0]?.message?.content;
|
|
||||||
if (typeof content !== "string" || content.length === 0) {
|
|
||||||
throw new Error(`empty content — think-false default may not be wired: ${JSON.stringify(j).slice(0, 200)}`);
|
|
||||||
}
|
|
||||||
return {
|
|
||||||
evidence: `content="${content.slice(0, 60)}" tokens=${j.usage?.total_tokens}`,
|
|
||||||
metrics: {
|
|
||||||
prompt_tokens: j.usage?.prompt_tokens ?? 0,
|
|
||||||
completion_tokens: j.usage?.completion_tokens ?? 0,
|
|
||||||
total_tokens: j.usage?.total_tokens ?? 0,
|
|
||||||
content_nonempty: true,
|
|
||||||
},
|
|
||||||
};
|
|
||||||
});
|
|
||||||
result.layers.push(l1);
|
|
||||||
|
|
||||||
// ========================================================================
|
|
||||||
// Layer 2 — Phase 40: Langfuse trace lands within 3s
|
|
||||||
// ========================================================================
|
|
||||||
// Fire-and-forget tracing means we need a brief sleep before query.
|
|
||||||
await new Promise(res => setTimeout(res, 2500));
|
|
||||||
const l2 = await measureLayer("phase40_langfuse_trace", "40", async () => {
|
|
||||||
const auth = await langfuseAuth();
|
|
||||||
if (!auth) throw new Error("Langfuse credentials not in env");
|
|
||||||
const r = await fetch(`${LANGFUSE}/api/public/traces?limit=5&name=v1.chat:ollama`, {
|
|
||||||
headers: { Authorization: `Basic ${btoa(`${auth.pk}:${auth.sk}`)}` },
|
|
||||||
signal: AbortSignal.timeout(10000),
|
|
||||||
});
|
|
||||||
if (!r.ok) throw new Error(`langfuse ${r.status}: ${await r.text()}`);
|
|
||||||
const j: any = await r.json();
|
|
||||||
const items = Array.isArray(j.data) ? j.data : [];
|
|
||||||
// Filter on the chat-request timestamp captured above. A Langfuse
|
|
||||||
// trace must be newer than the moment we fired /v1/chat to plausibly
|
|
||||||
// belong to our request. Using fixture start time (result.ran_at)
|
|
||||||
// was wrong and could false-negative on slow fixtures.
|
|
||||||
const recent = items.filter((t: any) => Date.parse(t.timestamp) >= chat_request_sent_ms);
|
|
||||||
if (recent.length === 0) {
|
|
||||||
throw new Error(`no v1.chat:ollama trace since ${new Date(chat_request_sent_ms).toISOString()} (${items.length} older traces visible, Langfuse reachable — tracing is not firing)`);
|
|
||||||
}
|
|
||||||
const trace = recent[0];
|
|
||||||
return {
|
|
||||||
evidence: `trace ${trace.id.slice(0, 8)} name=${trace.name} age=${Date.now() - Date.parse(trace.timestamp)}ms`,
|
|
||||||
metrics: {
|
|
||||||
trace_age_ms: Date.now() - Date.parse(trace.timestamp),
|
|
||||||
trace_latency_reported: Number(trace.latency ?? 0),
|
|
||||||
recent_trace_count: recent.length,
|
|
||||||
},
|
|
||||||
};
|
|
||||||
});
|
|
||||||
result.layers.push(l2);
|
|
||||||
|
|
||||||
// ========================================================================
|
|
||||||
// Layer 3 — Phase 45 slice 1: /seed accepts doc_refs and persists them
|
|
||||||
// ========================================================================
|
|
||||||
// Seed a playbook with doc_refs referencing Docker at a stale hash.
|
|
||||||
// Ignore the cleanup concern for v1 — this fixture pollutes the
|
|
||||||
// in-memory playbook state; operator can retire test entries.
|
|
||||||
const l3 = await measureLayer("phase45_seed_with_doc_refs", "45.1", async () => {
|
|
||||||
const r = await fetch(`${GATEWAY}/vectors/playbook_memory/seed`, {
|
|
||||||
method: "POST",
|
|
||||||
headers: { "content-type": "application/json" },
|
|
||||||
body: JSON.stringify({
|
|
||||||
operation: TEST_OPERATION_VERSIONED,
|
|
||||||
approach: "auditor hybrid fixture run",
|
|
||||||
context: "doc_refs integration test — retire after audit",
|
|
||||||
endorsed_names: [TEST_WORKER_NAME_VERSIONED],
|
|
||||||
append: true,
|
|
||||||
doc_refs: [
|
|
||||||
{
|
|
||||||
tool: "docker",
|
|
||||||
version_seen: "24.0.7",
|
|
||||||
snippet_hash: STALE_HASH,
|
|
||||||
source_url: "https://context7.com/docker/docs",
|
|
||||||
seen_at: new Date().toISOString(),
|
|
||||||
},
|
|
||||||
],
|
|
||||||
}),
|
|
||||||
signal: AbortSignal.timeout(30000),
|
|
||||||
});
|
|
||||||
if (!r.ok) throw new Error(`seed ${r.status}: ${await r.text()}`);
|
|
||||||
const j: any = await r.json();
|
|
||||||
// Verify doc_refs actually persisted — read state.json directly.
|
|
||||||
// That's the canonical source of truth; the seed response may or
|
|
||||||
// may not echo doc_refs back.
|
|
||||||
const state_raw = await readFile("/home/profit/lakehouse/data/_playbook_memory/state.json", "utf8");
|
|
||||||
const state = JSON.parse(state_raw);
|
|
||||||
const entries = state.entries ?? [];
|
|
||||||
const ours = entries.find((e: any) => (e.endorsed_names ?? []).includes(TEST_WORKER_NAME_VERSIONED));
|
|
||||||
if (!ours) throw new Error(`seeded entry not found in state.json (worker ${TEST_WORKER_NAME_VERSIONED} not present)`);
|
|
||||||
const docRefs = ours.doc_refs ?? [];
|
|
||||||
if (docRefs.length === 0) {
|
|
||||||
throw new Error("entry saved but doc_refs field is empty — the field accepted by the API isn't being persisted");
|
|
||||||
}
|
|
||||||
return {
|
|
||||||
evidence: `playbook ${ours.playbook_id.slice(0, 16)} persisted with doc_refs.length=${docRefs.length}; first tool=${docRefs[0]?.tool} hash=${docRefs[0]?.snippet_hash}`,
|
|
||||||
metrics: {
|
|
||||||
doc_refs_stored: docRefs.length,
|
|
||||||
entries_after: j.entries_after ?? -1,
|
|
||||||
playbook_id: ours.playbook_id,
|
|
||||||
mode: j.outcome?.mode ?? "unknown",
|
|
||||||
},
|
|
||||||
};
|
|
||||||
});
|
|
||||||
result.layers.push(l3);
|
|
||||||
|
|
||||||
// ========================================================================
|
|
||||||
// Layer 4 — Phase 45 slice 2: context7 bridge detects drift vs stale hash
|
|
||||||
// ========================================================================
|
|
||||||
const l4 = await measureLayer("phase45_bridge_diff", "45.2", async () => {
|
|
||||||
// Health check first — if bridge isn't running, fail with a clear
|
|
||||||
// message rather than mysterious connection refused.
|
|
||||||
try {
|
|
||||||
const h = await fetch(`${BRIDGE}/health`, { signal: AbortSignal.timeout(3000) });
|
|
||||||
if (!h.ok) throw new Error(`bridge /health ${h.status}`);
|
|
||||||
} catch (e) {
|
|
||||||
throw new Error(`context7 bridge at ${BRIDGE} is not reachable (bridge is manual-start; run 'bun run mcp-server/context7_bridge.ts'): ${(e as Error).message}`);
|
|
||||||
}
|
|
||||||
const r = await fetch(`${BRIDGE}/docs/docker/diff?since=${encodeURIComponent(STALE_HASH)}`, {
|
|
||||||
signal: AbortSignal.timeout(30000),
|
|
||||||
});
|
|
||||||
if (!r.ok) throw new Error(`bridge diff ${r.status}: ${await r.text()}`);
|
|
||||||
const j: any = await r.json();
|
|
||||||
if (j.drifted !== true) {
|
|
||||||
throw new Error(`expected drifted=true against ${STALE_HASH}; got ${JSON.stringify(j)}`);
|
|
||||||
}
|
|
||||||
return {
|
|
||||||
evidence: `bridge confirms drift: current=${j.current_snippet_hash} previous=${j.previous_snippet_hash} upstream_updated=${j.last_updated_upstream}`,
|
|
||||||
metrics: {
|
|
||||||
drifted: true,
|
|
||||||
current_hash_length: String(j.current_snippet_hash ?? "").length,
|
|
||||||
library_id: j.library_id,
|
|
||||||
},
|
|
||||||
};
|
|
||||||
});
|
|
||||||
result.layers.push(l4);
|
|
||||||
|
|
||||||
// ========================================================================
|
|
||||||
// Layer 5 — Phase 45 slice 3: /doc_drift/check/{id} endpoint
|
|
||||||
// (EXPECTED TO FAIL — endpoint unimplemented)
|
|
||||||
// ========================================================================
|
|
||||||
const l5 = await measureLayer("phase45_slice3_drift_flag", "45.3", async () => {
|
|
||||||
const pid = String(l3.metrics?.playbook_id ?? "");
|
|
||||||
if (!pid) throw new Error("layer 3 did not produce a playbook_id to check");
|
|
||||||
const r = await fetch(`${GATEWAY}/vectors/playbook_memory/doc_drift/check/${encodeURIComponent(pid)}`, {
|
|
||||||
method: "POST",
|
|
||||||
signal: AbortSignal.timeout(10000),
|
|
||||||
});
|
|
||||||
if (r.status === 404 || r.status === 405) {
|
|
||||||
// This is the HONEST signal: the endpoint doesn't exist yet.
|
|
||||||
// Fail this layer with a clear marker — not a silent pass.
|
|
||||||
throw new Error(`endpoint unimplemented (${r.status}) — Phase 45 slice 3 is still placeholder. doc_refs are persisted (layer 3) and the bridge can answer drift questions (layer 4), but nothing ties them together into a playbook flag yet.`);
|
|
||||||
}
|
|
||||||
if (!r.ok) throw new Error(`drift/check ${r.status}: ${await r.text()}`);
|
|
||||||
const j: any = await r.json();
|
|
||||||
// If the endpoint DID exist, assert the flag got set.
|
|
||||||
if (!j.flagged) {
|
|
||||||
throw new Error(`endpoint responded but flag not set: ${JSON.stringify(j).slice(0, 200)}`);
|
|
||||||
}
|
|
||||||
return {
|
|
||||||
evidence: `playbook flagged: ${JSON.stringify(j).slice(0, 160)}`,
|
|
||||||
metrics: { flagged: true },
|
|
||||||
};
|
|
||||||
});
|
|
||||||
result.layers.push(l5);
|
|
||||||
|
|
||||||
// ========================================================================
|
|
||||||
// Verdict assembly
|
|
||||||
// ========================================================================
|
|
||||||
for (const l of result.layers) {
|
|
||||||
if (l.ok) result.shipped_phases.push(l.phase);
|
|
||||||
else result.placeholder_phases.push(l.phase);
|
|
||||||
result.real_numbers[`${l.layer}_latency_ms`] = l.latency_ms;
|
|
||||||
if (l.metrics) {
|
|
||||||
for (const [k, v] of Object.entries(l.metrics)) {
|
|
||||||
if (typeof v === "number") result.real_numbers[`${l.layer}.${k}`] = v;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
const anyFail = result.placeholder_phases.length > 0;
|
|
||||||
const allPass = result.layers.every(l => l.ok);
|
|
||||||
result.overall = allPass ? "pass" : (result.shipped_phases.length > 0 ? "partial_pass" : "fail");
|
|
||||||
|
|
||||||
if (!l5.ok) {
|
|
||||||
result.notes.push(
|
|
||||||
"Phase 45 slice 3 (doc_drift/check endpoint) is the expected-fail layer. " +
|
|
||||||
"Layer 5 failing with a 404/405 is the CORRECT honest signal — don't mask this " +
|
|
||||||
"to get a green result. When slice 3 ships, layer 5 flips to ok=true automatically."
|
|
||||||
);
|
|
||||||
}
|
|
||||||
if (anyFail) {
|
|
||||||
result.notes.push(
|
|
||||||
`${result.placeholder_phases.length} layer(s) failed. Check evidence per layer for specifics.`
|
|
||||||
);
|
|
||||||
}
|
|
||||||
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
@@ -1,145 +0,0 @@
|
|||||||
// Gitea API client. Minimal surface — only what the auditor needs:
|
|
||||||
// list open PRs, get commits + files for a PR, fetch a diff, post a
|
|
||||||
// commit status, post a review.
|
|
||||||
//
|
|
||||||
// Auth: reads PAT from ~/.git-credentials (set up by the credential
|
|
||||||
// helper flow in 2026-04-22 session). Gitea's "token" auth scheme
|
|
||||||
// matches what `git fetch` is already using.
|
|
||||||
|
|
||||||
import { readFile } from "node:fs/promises";
|
|
||||||
import type { PrSnapshot } from "./types.ts";
|
|
||||||
|
|
||||||
const HOST = process.env.GITEA_HOST ?? "https://git.agentview.dev";
|
|
||||||
const OWNER = "profit";
|
|
||||||
const REPO = "lakehouse";
|
|
||||||
const CRED_FILE = "/home/profit/.git-credentials";
|
|
||||||
|
|
||||||
let cachedPat: string | null = null;
|
|
||||||
|
|
||||||
async function getPat(): Promise<string> {
|
|
||||||
if (cachedPat) return cachedPat;
|
|
||||||
const raw = await readFile(CRED_FILE, "utf8");
|
|
||||||
for (const line of raw.split("\n")) {
|
|
||||||
const m = line.match(/^https:\/\/[^:]+:([^@]+)@git\.agentview\.dev/);
|
|
||||||
if (m) { cachedPat = m[1]; return m[1]; }
|
|
||||||
}
|
|
||||||
throw new Error(`no Gitea PAT in ${CRED_FILE}`);
|
|
||||||
}
|
|
||||||
|
|
||||||
async function giteaFetch(path: string, init: RequestInit = {}): Promise<Response> {
|
|
||||||
const pat = await getPat();
|
|
||||||
const url = `${HOST}/api/v1${path}`;
|
|
||||||
const headers = new Headers(init.headers);
|
|
||||||
headers.set("Authorization", `token ${pat}`);
|
|
||||||
if (init.body && !headers.has("content-type")) {
|
|
||||||
headers.set("content-type", "application/json");
|
|
||||||
}
|
|
||||||
return fetch(url, { ...init, headers, signal: AbortSignal.timeout(20000) });
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function listOpenPrs(): Promise<PrSnapshot[]> {
|
|
||||||
const r = await giteaFetch(`/repos/${OWNER}/${REPO}/pulls?state=open&page=1&limit=50`);
|
|
||||||
if (!r.ok) throw new Error(`listOpenPrs ${r.status}: ${await r.text()}`);
|
|
||||||
const rows = (await r.json()) as any[];
|
|
||||||
return Promise.all(rows.map(row => snapshotFromPr(row)));
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function getPrSnapshot(num: number): Promise<PrSnapshot> {
|
|
||||||
const r = await giteaFetch(`/repos/${OWNER}/${REPO}/pulls/${num}`);
|
|
||||||
if (!r.ok) throw new Error(`getPr ${num} ${r.status}: ${await r.text()}`);
|
|
||||||
return snapshotFromPr((await r.json()) as any);
|
|
||||||
}
|
|
||||||
|
|
||||||
async function snapshotFromPr(row: any): Promise<PrSnapshot> {
|
|
||||||
const num = row.number;
|
|
||||||
const commitsResp = await giteaFetch(`/repos/${OWNER}/${REPO}/pulls/${num}/commits`);
|
|
||||||
const commits = commitsResp.ok ? ((await commitsResp.json()) as any[]) : [];
|
|
||||||
const filesResp = await giteaFetch(`/repos/${OWNER}/${REPO}/pulls/${num}/files`);
|
|
||||||
const files = filesResp.ok ? ((await filesResp.json()) as any[]) : [];
|
|
||||||
return {
|
|
||||||
number: num,
|
|
||||||
head_sha: row.head?.sha ?? "",
|
|
||||||
base_sha: row.base?.sha ?? "",
|
|
||||||
title: row.title ?? "",
|
|
||||||
body: row.body ?? "",
|
|
||||||
state: row.state === "open" ? "open" : (row.merged ? "merged" : "closed"),
|
|
||||||
author: row.user?.login ?? "",
|
|
||||||
commits: commits.map(c => ({
|
|
||||||
sha: (c.sha ?? "").slice(0, 12),
|
|
||||||
message: c.commit?.message ?? "",
|
|
||||||
author: c.commit?.author?.name ?? "",
|
|
||||||
})),
|
|
||||||
files: files.map(f => ({
|
|
||||||
path: f.filename ?? "",
|
|
||||||
additions: f.additions ?? 0,
|
|
||||||
deletions: f.deletions ?? 0,
|
|
||||||
})),
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Returns the unified diff text of the PR. Used by static checks.
|
|
||||||
export async function getPrDiff(num: number): Promise<string> {
|
|
||||||
const r = await giteaFetch(`/repos/${OWNER}/${REPO}/pulls/${num}.diff`);
|
|
||||||
if (!r.ok) throw new Error(`getDiff ${num} ${r.status}: ${await r.text()}`);
|
|
||||||
return await r.text();
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Hard-block mechanism: post a failing commit status on the PR head
|
|
||||||
/// SHA. Branch protection (if enabled on `main`) treats this as a
|
|
||||||
/// required-check fail and prevents merge. The description is shown
|
|
||||||
/// in the Gitea UI next to the red X.
|
|
||||||
export async function postCommitStatus(args: {
|
|
||||||
sha: string;
|
|
||||||
state: "success" | "pending" | "failure" | "error";
|
|
||||||
context: string;
|
|
||||||
description: string;
|
|
||||||
target_url?: string;
|
|
||||||
}): Promise<void> {
|
|
||||||
const r = await giteaFetch(`/repos/${OWNER}/${REPO}/statuses/${args.sha}`, {
|
|
||||||
method: "POST",
|
|
||||||
body: JSON.stringify({
|
|
||||||
state: args.state,
|
|
||||||
context: args.context,
|
|
||||||
description: args.description.slice(0, 140),
|
|
||||||
target_url: args.target_url ?? "",
|
|
||||||
}),
|
|
||||||
});
|
|
||||||
if (!r.ok) throw new Error(`postCommitStatus ${r.status}: ${await r.text()}`);
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Post a review comment. Gitea typically blocks self-review
|
|
||||||
/// (author posting a review on their own PR). Prefer
|
|
||||||
/// `postIssueComment` when running with the author's PAT.
|
|
||||||
export async function postReview(args: {
|
|
||||||
pr_number: number;
|
|
||||||
commit_id: string;
|
|
||||||
body: string;
|
|
||||||
event: "APPROVE" | "REQUEST_CHANGES" | "COMMENT";
|
|
||||||
}): Promise<void> {
|
|
||||||
const r = await giteaFetch(`/repos/${OWNER}/${REPO}/pulls/${args.pr_number}/reviews`, {
|
|
||||||
method: "POST",
|
|
||||||
body: JSON.stringify({
|
|
||||||
commit_id: args.commit_id,
|
|
||||||
body: args.body,
|
|
||||||
event: args.event,
|
|
||||||
}),
|
|
||||||
});
|
|
||||||
if (!r.ok) throw new Error(`postReview ${r.status}: ${await r.text()}`);
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Plain issue comment. Works for the auditor's own PAT because
|
|
||||||
/// Gitea allows authors to comment on their own PRs (just not
|
|
||||||
/// review them). Auditor uses this for the reasoning body; the
|
|
||||||
/// actual block signal is the commit status.
|
|
||||||
export async function postIssueComment(args: {
|
|
||||||
pr_number: number;
|
|
||||||
body: string;
|
|
||||||
}): Promise<{ id: number; html_url: string }> {
|
|
||||||
const r = await giteaFetch(`/repos/${OWNER}/${REPO}/issues/${args.pr_number}/comments`, {
|
|
||||||
method: "POST",
|
|
||||||
body: JSON.stringify({ body: args.body }),
|
|
||||||
});
|
|
||||||
if (!r.ok) throw new Error(`postIssueComment ${r.status}: ${await r.text()}`);
|
|
||||||
const j = await r.json() as any;
|
|
||||||
return { id: j.id, html_url: j.html_url };
|
|
||||||
}
|
|
||||||
@@ -1,207 +0,0 @@
|
|||||||
// Auditor poller — the top-level entry. Polls Gitea for open PRs on
|
|
||||||
// a fixed interval, dedupes by head SHA, runs audit + posts verdict
|
|
||||||
// for each new (pr, sha) pair.
|
|
||||||
//
|
|
||||||
// Run manually:
|
|
||||||
// bun run auditor/index.ts
|
|
||||||
//
|
|
||||||
// Stop:
|
|
||||||
// touch auditor.paused (skips next cycle)
|
|
||||||
// pkill -f auditor/index.ts (kills in-flight)
|
|
||||||
//
|
|
||||||
// State:
|
|
||||||
// data/_auditor/state.json — last-audited SHA per PR
|
|
||||||
// data/_auditor/verdicts/{id}.json — per-run verdict records
|
|
||||||
//
|
|
||||||
// This entry runs forever. A systemd unit would wrap it once the
|
|
||||||
// workflow is trusted (same pattern as mcp-server, observer).
|
|
||||||
|
|
||||||
import { readFile, writeFile, mkdir, access } from "node:fs/promises";
|
|
||||||
import { listOpenPrs } from "./gitea.ts";
|
|
||||||
import { auditPr } from "./audit.ts";
|
|
||||||
|
|
||||||
const POLL_INTERVAL_MS = 90_000; // 90s — enough budget for audit runs to complete
|
|
||||||
const PAUSE_FILE = "/home/profit/lakehouse/auditor.paused";
|
|
||||||
const STATE_FILE = "/home/profit/lakehouse/data/_auditor/state.json";
|
|
||||||
|
|
||||||
// Per-PR audit cap. Prevents the daemon from running away on a PR
|
|
||||||
// when each push surfaces new findings — operator wants to review
|
|
||||||
// in batch, not have the daemon burn budget while they're away.
|
|
||||||
// Default 3 audits per PR. Override via LH_AUDITOR_MAX_AUDITS_PER_PR.
|
|
||||||
// Set to 0 to disable the cap.
|
|
||||||
//
|
|
||||||
// Reset (after manual review): edit data/_auditor/state.json and
|
|
||||||
// set audit_count_per_pr.<N> = 0 (or delete the key). Daemon picks
|
|
||||||
// up the change on the next cycle without restart.
|
|
||||||
const MAX_AUDITS_PER_PR = Number(process.env.LH_AUDITOR_MAX_AUDITS_PER_PR) || 3;
|
|
||||||
|
|
||||||
interface State {
|
|
||||||
// Map: PR number → last-audited head SHA. Lets us dedupe audits
|
|
||||||
// across restarts (poller can crash/restart without re-auditing
|
|
||||||
// all open PRs from scratch).
|
|
||||||
last_audited: Record<string, string>;
|
|
||||||
// Map: PR number → number of audits run on that PR since last reset.
|
|
||||||
// Daemon halts auditing a PR once this hits MAX_AUDITS_PER_PR.
|
|
||||||
// Operator clears the entry to resume.
|
|
||||||
audit_count_per_pr: Record<string, number>;
|
|
||||||
started_at: string;
|
|
||||||
cycles_total: number;
|
|
||||||
cycles_skipped_paused: number;
|
|
||||||
cycles_skipped_capped: number;
|
|
||||||
audits_run: number;
|
|
||||||
last_cycle_at?: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
async function fileExists(path: string): Promise<boolean> {
|
|
||||||
try { await access(path); return true; } catch { return false; }
|
|
||||||
}
|
|
||||||
|
|
||||||
async function loadState(): Promise<State> {
|
|
||||||
try {
|
|
||||||
const raw = await readFile(STATE_FILE, "utf8");
|
|
||||||
const s = JSON.parse(raw);
|
|
||||||
return {
|
|
||||||
last_audited: s.last_audited ?? {},
|
|
||||||
started_at: s.started_at ?? new Date().toISOString(),
|
|
||||||
audit_count_per_pr: s.audit_count_per_pr ?? {},
|
|
||||||
cycles_total: s.cycles_total ?? 0,
|
|
||||||
cycles_skipped_paused: s.cycles_skipped_paused ?? 0,
|
|
||||||
cycles_skipped_capped: s.cycles_skipped_capped ?? 0,
|
|
||||||
audits_run: s.audits_run ?? 0,
|
|
||||||
last_cycle_at: s.last_cycle_at,
|
|
||||||
};
|
|
||||||
} catch {
|
|
||||||
return {
|
|
||||||
last_audited: {},
|
|
||||||
audit_count_per_pr: {},
|
|
||||||
started_at: new Date().toISOString(),
|
|
||||||
cycles_total: 0,
|
|
||||||
cycles_skipped_paused: 0,
|
|
||||||
cycles_skipped_capped: 0,
|
|
||||||
audits_run: 0,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
async function saveState(s: State): Promise<void> {
|
|
||||||
await mkdir("/home/profit/lakehouse/data/_auditor", { recursive: true });
|
|
||||||
await writeFile(STATE_FILE, JSON.stringify(s, null, 2));
|
|
||||||
}
|
|
||||||
|
|
||||||
async function runCycle(state: State): Promise<State> {
|
|
||||||
state.cycles_total += 1;
|
|
||||||
state.last_cycle_at = new Date().toISOString();
|
|
||||||
|
|
||||||
if (await fileExists(PAUSE_FILE)) {
|
|
||||||
state.cycles_skipped_paused += 1;
|
|
||||||
console.log(`[auditor] cycle ${state.cycles_total}: paused (touch ${PAUSE_FILE} exists)`);
|
|
||||||
return state;
|
|
||||||
}
|
|
||||||
|
|
||||||
let prs;
|
|
||||||
try {
|
|
||||||
prs = await listOpenPrs();
|
|
||||||
} catch (e) {
|
|
||||||
console.error(`[auditor] listOpenPrs failed: ${(e as Error).message}`);
|
|
||||||
return state;
|
|
||||||
}
|
|
||||||
|
|
||||||
console.log(`[auditor] cycle ${state.cycles_total}: ${prs.length} open PR(s)`);
|
|
||||||
|
|
||||||
for (const pr of prs) {
|
|
||||||
const prKey = String(pr.number);
|
|
||||||
const last = state.last_audited[prKey];
|
|
||||||
if (last === pr.head_sha) {
|
|
||||||
console.log(`[auditor] skip PR #${pr.number} (SHA ${pr.head_sha.slice(0, 8)} already audited)`);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
// Per-head-SHA audit cap. Each new push gets MAX_AUDITS_PER_PR
|
|
||||||
// fresh attempts; the counter auto-resets when the head SHA
|
|
||||||
// changes. Operator only intervenes manually if a single SHA
|
|
||||||
// somehow needs MORE than the cap (rare — usually transient
|
|
||||||
// upstream errors clear themselves inside 3 attempts).
|
|
||||||
//
|
|
||||||
// Reset rule: if `last` exists (we've seen this PR before) AND
|
|
||||||
// pr.head_sha != last, that's a new push. Drop the counter.
|
|
||||||
// The dedup branch above already handles same-SHA → skip, so
|
|
||||||
// we only land here when the SHA actually moved.
|
|
||||||
if (last !== undefined && (state.audit_count_per_pr[prKey] ?? 0) > 0) {
|
|
||||||
const prior_count = state.audit_count_per_pr[prKey];
|
|
||||||
console.log(`[auditor] PR #${pr.number} new head ${pr.head_sha.slice(0, 8)} (prior ${last.slice(0, 8)}, was ${prior_count}/${MAX_AUDITS_PER_PR}) — resetting cap counter`);
|
|
||||||
state.audit_count_per_pr[prKey] = 0;
|
|
||||||
}
|
|
||||||
const auditedSoFar = state.audit_count_per_pr[prKey] ?? 0;
|
|
||||||
if (MAX_AUDITS_PER_PR > 0 && auditedSoFar >= MAX_AUDITS_PER_PR) {
|
|
||||||
// This branch only fires now if the SAME head SHA somehow
|
|
||||||
// burned MAX audits (transient upstream errors retried that
|
|
||||||
// many times). Operator can clear state.audit_count_per_pr.<N>
|
|
||||||
// = 0 to force one more attempt; otherwise wait for next push.
|
|
||||||
console.log(`[auditor] skip PR #${pr.number} (same head ${pr.head_sha.slice(0, 8)} burned ${auditedSoFar}/${MAX_AUDITS_PER_PR} — push new code or clear state.json audit_count_per_pr.${prKey})`);
|
|
||||||
state.cycles_skipped_capped += 1;
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
console.log(`[auditor] audit PR #${pr.number} (${pr.head_sha.slice(0, 8)}) — ${pr.title.slice(0, 60)} [${auditedSoFar + 1}/${MAX_AUDITS_PER_PR}]`);
|
|
||||||
try {
|
|
||||||
// Skip dynamic by default: it mutates live playbook state and
|
|
||||||
// re-runs on every PR update would pollute quickly. Operator
|
|
||||||
// can run dynamic via `bun run auditor/fixtures/cli.ts` manually
|
|
||||||
// OR set LH_AUDITOR_RUN_DYNAMIC=1 to opt in.
|
|
||||||
const run_dynamic = process.env.LH_AUDITOR_RUN_DYNAMIC === "1";
|
|
||||||
const verdict = await auditPr(pr, {
|
|
||||||
skip_dynamic: !run_dynamic,
|
|
||||||
skip_inference: process.env.LH_AUDITOR_SKIP_INFERENCE === "1",
|
|
||||||
});
|
|
||||||
console.log(`[auditor] verdict=${verdict.overall} findings=${verdict.metrics.findings_total} (block=${verdict.metrics.findings_block} warn=${verdict.metrics.findings_warn})`);
|
|
||||||
state.last_audited[prKey] = pr.head_sha;
|
|
||||||
state.audit_count_per_pr[prKey] = auditedSoFar + 1;
|
|
||||||
state.audits_run += 1;
|
|
||||||
if (state.audit_count_per_pr[prKey] >= MAX_AUDITS_PER_PR) {
|
|
||||||
console.log(`[auditor] PR #${pr.number} reached cap (${MAX_AUDITS_PER_PR} audits) — daemon will skip further audits until reset`);
|
|
||||||
}
|
|
||||||
// Persist state immediately after each successful audit so the
|
|
||||||
// increment survives a crash. Pre-2026-04-27 the cycle saved
|
|
||||||
// once at the end (main.ts:140), which lost the count if the
|
|
||||||
// daemon was killed mid-cycle. Fix lifted from kimi_architect's
|
|
||||||
// own audit on this very file. saveState is idempotent + cheap
|
|
||||||
// (one JSON write), so per-audit cost is negligible.
|
|
||||||
try { await saveState(state); }
|
|
||||||
catch (e) {
|
|
||||||
console.error(`[auditor] saveState mid-cycle failed: ${(e as Error).message} — count held in memory`);
|
|
||||||
}
|
|
||||||
} catch (e) {
|
|
||||||
console.error(`[auditor] audit failed: ${(e as Error).message}`);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return state;
|
|
||||||
}
|
|
||||||
|
|
||||||
async function main(): Promise<void> {
|
|
||||||
console.log(`[auditor] starting poller — interval ${POLL_INTERVAL_MS / 1000}s`);
|
|
||||||
console.log(`[auditor] pause file: ${PAUSE_FILE}`);
|
|
||||||
console.log(`[auditor] state file: ${STATE_FILE}`);
|
|
||||||
|
|
||||||
let state = await loadState();
|
|
||||||
console.log(`[auditor] loaded state: ${Object.keys(state.last_audited).length} PRs previously audited, ${state.cycles_total} cycles so far`);
|
|
||||||
|
|
||||||
// Single-shot mode for CLI testing: `bun run auditor/index.ts --once`
|
|
||||||
const once = process.argv.includes("--once");
|
|
||||||
if (once) {
|
|
||||||
state = await runCycle(state);
|
|
||||||
await saveState(state);
|
|
||||||
console.log(`[auditor] single-shot complete. total audits: ${state.audits_run}`);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Loop.
|
|
||||||
while (true) {
|
|
||||||
state = await runCycle(state);
|
|
||||||
await saveState(state);
|
|
||||||
await new Promise(res => setTimeout(res, POLL_INTERVAL_MS));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
main().catch(e => {
|
|
||||||
console.error("[auditor] fatal:", e);
|
|
||||||
process.exit(1);
|
|
||||||
});
|
|
||||||
@@ -1,161 +0,0 @@
|
|||||||
// kb_index — generic on-the-fly aggregation over append-only JSONL
|
|
||||||
// scratchpads (audit_lessons, scrum_reviews, outcomes, observer ops).
|
|
||||||
//
|
|
||||||
// The mem0 insight: raw rows are CHEAP and tell the full story, but
|
|
||||||
// downstream prompts need a DEFINITION, not a log. A definition is
|
|
||||||
// the aggregate: "this signature has fired N times across M distinct
|
|
||||||
// scopes, first_seen=X, last_seen=Y, confidence=M/N."
|
|
||||||
//
|
|
||||||
// This library is the single shared aggregator. Every KB writer keeps
|
|
||||||
// appending raw rows; every KB reader uses aggregate() instead of
|
|
||||||
// tailing the raw stream. No second file to sync, no ADD/UPDATE/NOOP
|
|
||||||
// routing — the stats roll up from the raw rows every time.
|
|
||||||
//
|
|
||||||
// Why this works past hundreds of runs:
|
|
||||||
// - aggregate() is bounded by distinct_signatures, not total_rows.
|
|
||||||
// - confidence = distinct_scopes / count — low for same-scope noise,
|
|
||||||
// high for cross-scope patterns. Downstream severity ramps on
|
|
||||||
// confidence × count, not raw count, so one unfixed PR can't
|
|
||||||
// inflate its own recurrence score (the classic mem0 failure).
|
|
||||||
// - rotation (later) moves old raw to archive files; aggregate()
|
|
||||||
// can still read both to compute lifetime counts when needed.
|
|
||||||
|
|
||||||
import { readFile } from "node:fs/promises";
|
|
||||||
|
|
||||||
export interface AggregateRow {
|
|
||||||
signature: string;
|
|
||||||
count: number;
|
|
||||||
distinct_scopes: number;
|
|
||||||
first_seen: string;
|
|
||||||
last_seen: string;
|
|
||||||
confidence: number; // distinct_scopes / count — capped at 1.0
|
|
||||||
representative_summary: string; // most-recent summary for this signature
|
|
||||||
scopes: string[]; // up to 20 most-recent scopes for debugging
|
|
||||||
checks: string[]; // distinct `check` values (audit_lessons-specific)
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface AggregateOptions<T> {
|
|
||||||
/** How to extract the dedup key from a row. */
|
|
||||||
keyFn: (row: T) => string | undefined;
|
|
||||||
/** How to extract the "scope" — distinct scopes count gives confidence. */
|
|
||||||
scopeFn: (row: T) => string | undefined;
|
|
||||||
/** How to extract the timestamp (defaults to row.audited_at / row.reviewed_at / row.timestamp). */
|
|
||||||
timeFn?: (row: T) => string | undefined;
|
|
||||||
/** How to extract a representative summary (defaults to row.summary). */
|
|
||||||
summaryFn?: (row: T) => string | undefined;
|
|
||||||
/** Max rows to read from the JSONL tail; 0 = read all. */
|
|
||||||
tailLimit?: number;
|
|
||||||
/** Include per-row check field (for multi-check aggregates). */
|
|
||||||
checkFn?: (row: T) => string | undefined;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Read a JSONL file and produce the aggregate map keyed by signature.
|
|
||||||
* Safe on missing or malformed files — returns empty map.
|
|
||||||
*/
|
|
||||||
export async function aggregate<T = any>(
|
|
||||||
jsonlPath: string,
|
|
||||||
opts: AggregateOptions<T>,
|
|
||||||
): Promise<Map<string, AggregateRow>> {
|
|
||||||
const out = new Map<string, AggregateRow>();
|
|
||||||
let raw: string;
|
|
||||||
try { raw = await readFile(jsonlPath, "utf8"); } catch { return out; }
|
|
||||||
const lines = raw.split("\n").filter(l => l.length > 0);
|
|
||||||
const sliceFrom = opts.tailLimit && opts.tailLimit > 0 ? Math.max(0, lines.length - opts.tailLimit) : 0;
|
|
||||||
|
|
||||||
const timeFn = opts.timeFn ?? ((r: any) => r?.audited_at ?? r?.reviewed_at ?? r?.timestamp ?? r?.ran_at);
|
|
||||||
const summaryFn = opts.summaryFn ?? ((r: any) => r?.summary ?? r?.representative_summary);
|
|
||||||
|
|
||||||
// Per-signature scope tracking — need counts by scope to compute
|
|
||||||
// distinct_scopes without double-counting a scope that appears 50
|
|
||||||
// times. Using a Set<scope> per signature.
|
|
||||||
const scopeSets = new Map<string, Set<string>>();
|
|
||||||
const checkSets = new Map<string, Set<string>>();
|
|
||||||
|
|
||||||
for (let i = sliceFrom; i < lines.length; i++) {
|
|
||||||
let row: T;
|
|
||||||
try { row = JSON.parse(lines[i]) as T; } catch { continue; }
|
|
||||||
const sig = opts.keyFn(row);
|
|
||||||
if (!sig) continue;
|
|
||||||
|
|
||||||
let agg = out.get(sig);
|
|
||||||
if (!agg) {
|
|
||||||
agg = {
|
|
||||||
signature: sig,
|
|
||||||
count: 0,
|
|
||||||
distinct_scopes: 0,
|
|
||||||
first_seen: "",
|
|
||||||
last_seen: "",
|
|
||||||
confidence: 0,
|
|
||||||
representative_summary: "",
|
|
||||||
scopes: [],
|
|
||||||
checks: [],
|
|
||||||
};
|
|
||||||
out.set(sig, agg);
|
|
||||||
scopeSets.set(sig, new Set<string>());
|
|
||||||
checkSets.set(sig, new Set<string>());
|
|
||||||
}
|
|
||||||
|
|
||||||
agg.count += 1;
|
|
||||||
|
|
||||||
const scope = opts.scopeFn(row);
|
|
||||||
if (scope !== undefined && scope !== null && scope !== "") {
|
|
||||||
scopeSets.get(sig)!.add(String(scope));
|
|
||||||
// Keep scopes array ordered by recency (newest wins — shift
|
|
||||||
// oldest when at cap).
|
|
||||||
const arr = agg.scopes;
|
|
||||||
const s = String(scope);
|
|
||||||
const existing = arr.indexOf(s);
|
|
||||||
if (existing >= 0) arr.splice(existing, 1);
|
|
||||||
arr.push(s);
|
|
||||||
if (arr.length > 20) arr.shift();
|
|
||||||
}
|
|
||||||
|
|
||||||
if (opts.checkFn) {
|
|
||||||
const c = opts.checkFn(row);
|
|
||||||
if (c) checkSets.get(sig)!.add(String(c));
|
|
||||||
}
|
|
||||||
|
|
||||||
const t = timeFn(row);
|
|
||||||
if (t) {
|
|
||||||
if (!agg.first_seen || t < agg.first_seen) agg.first_seen = t;
|
|
||||||
if (!agg.last_seen || t > agg.last_seen) agg.last_seen = t;
|
|
||||||
}
|
|
||||||
|
|
||||||
const s = summaryFn(row);
|
|
||||||
if (s) agg.representative_summary = String(s);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Finalize derived fields.
|
|
||||||
for (const [sig, agg] of out) {
|
|
||||||
const scopes = scopeSets.get(sig) ?? new Set<string>();
|
|
||||||
agg.distinct_scopes = scopes.size;
|
|
||||||
agg.confidence = agg.count > 0 ? Math.min(1, agg.distinct_scopes / agg.count) : 0;
|
|
||||||
const checks = checkSets.get(sig);
|
|
||||||
if (checks) agg.checks = Array.from(checks).sort();
|
|
||||||
}
|
|
||||||
return out;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Severity policy derived from aggregate stats. The rating lives here
|
|
||||||
* (not in each check) so all KB readers ramp severity consistently.
|
|
||||||
*
|
|
||||||
* - confidence × count product is the real signal.
|
|
||||||
* - Low confidence (< 0.3) = same-scope noise → info regardless of count.
|
|
||||||
* - Mid confidence (0.3-0.6) = mixed signal → warn at count ≥ 3.
|
|
||||||
* - High confidence (> 0.6) with count ≥ 5 = block-worthy cross-cutting pattern.
|
|
||||||
*
|
|
||||||
* Callers can override by reading agg directly; this is the default
|
|
||||||
* policy that matches the "don't escalate one unfixed PR" discipline.
|
|
||||||
*/
|
|
||||||
export function ratingSeverity(agg: AggregateRow): "info" | "warn" | "block" {
|
|
||||||
if (agg.confidence >= 0.6 && agg.count >= 5) return "block";
|
|
||||||
if (agg.confidence >= 0.3 && agg.count >= 3) return "warn";
|
|
||||||
return "info";
|
|
||||||
}
|
|
||||||
|
|
||||||
/** Human-friendly one-line summary of an aggregate row for finding evidence. */
|
|
||||||
export function formatAgg(agg: AggregateRow): string {
|
|
||||||
return `count=${agg.count} distinct_scopes=${agg.distinct_scopes} confidence=${agg.confidence.toFixed(2)} seen=[${agg.first_seen.slice(0, 10)}..${agg.last_seen.slice(0, 10)}]`;
|
|
||||||
}
|
|
||||||
@@ -1,269 +0,0 @@
|
|||||||
// kb_stats — on-demand dashboard numbers from the KB scratchpad
|
|
||||||
// files. Reads data/_auditor/verdicts/*, data/_kb/audit_lessons.jsonl,
|
|
||||||
// data/_kb/audit_facts.jsonl, data/_kb/audit_discrepancies.jsonl,
|
|
||||||
// data/_kb/scrum_reviews.jsonl and prints:
|
|
||||||
//
|
|
||||||
// - verdict flip-flop rate (same SHA re-audited, verdict changed?)
|
|
||||||
// - consensus discrepancy rate (N runs disagreed on a claim)
|
|
||||||
// - confidence distribution from kb_index aggregator
|
|
||||||
// - top N recurring entities from audit_facts
|
|
||||||
// - fact growth over time
|
|
||||||
// - scrum vs inference KB split
|
|
||||||
//
|
|
||||||
// Run: bun run auditor/kb_stats.ts
|
|
||||||
// bun run auditor/kb_stats.ts --top 15 # show top 15 entities
|
|
||||||
// bun run auditor/kb_stats.ts --json # machine-readable
|
|
||||||
//
|
|
||||||
// This is the "dashboard" without running Grafana. If someone really
|
|
||||||
// wants a dashboard, wire this output into a static HTML page + cron.
|
|
||||||
|
|
||||||
import { readFile, readdir } from "node:fs/promises";
|
|
||||||
import { join } from "node:path";
|
|
||||||
import { aggregate } from "./kb_index.ts";
|
|
||||||
|
|
||||||
const REPO = "/home/profit/lakehouse";
|
|
||||||
const VERDICTS_DIR = `${REPO}/data/_auditor/verdicts`;
|
|
||||||
const AUDIT_LESSONS = `${REPO}/data/_kb/audit_lessons.jsonl`;
|
|
||||||
const AUDIT_FACTS = `${REPO}/data/_kb/audit_facts.jsonl`;
|
|
||||||
const AUDIT_DISCREPANCIES = `${REPO}/data/_kb/audit_discrepancies.jsonl`;
|
|
||||||
const SCRUM_REVIEWS = `${REPO}/data/_kb/scrum_reviews.jsonl`;
|
|
||||||
|
|
||||||
interface Args {
|
|
||||||
top: number;
|
|
||||||
json: boolean;
|
|
||||||
}
|
|
||||||
|
|
||||||
function parseArgs(argv: string[]): Args {
|
|
||||||
const a: Args = { top: 10, json: false };
|
|
||||||
for (let i = 2; i < argv.length; i++) {
|
|
||||||
if (argv[i] === "--top") a.top = Number(argv[++i] ?? 10);
|
|
||||||
else if (argv[i] === "--json") a.json = true;
|
|
||||||
}
|
|
||||||
return a;
|
|
||||||
}
|
|
||||||
|
|
||||||
async function readJsonl<T = any>(path: string): Promise<T[]> {
|
|
||||||
try {
|
|
||||||
const raw = await readFile(path, "utf8");
|
|
||||||
return raw.split("\n").filter(l => l.length > 0).map(l => {
|
|
||||||
try { return JSON.parse(l) as T; } catch { return null as any; }
|
|
||||||
}).filter(r => r !== null);
|
|
||||||
} catch { return []; }
|
|
||||||
}
|
|
||||||
|
|
||||||
async function loadVerdicts(): Promise<Array<{ pr: number; sha: string; overall: string; findings_total: number; findings_block: number; findings_warn: number }>> {
|
|
||||||
let files: string[] = [];
|
|
||||||
try { files = await readdir(VERDICTS_DIR); } catch { return []; }
|
|
||||||
const out = [];
|
|
||||||
for (const f of files) {
|
|
||||||
if (!f.endsWith(".json")) continue;
|
|
||||||
const m = f.match(/^(\d+)-([0-9a-f]+)\.json$/);
|
|
||||||
if (!m) continue;
|
|
||||||
try {
|
|
||||||
const v = JSON.parse(await readFile(join(VERDICTS_DIR, f), "utf8"));
|
|
||||||
out.push({
|
|
||||||
pr: Number(m[1]),
|
|
||||||
sha: m[2],
|
|
||||||
overall: String(v.overall),
|
|
||||||
findings_total: Number(v.metrics?.findings_total ?? 0),
|
|
||||||
findings_block: Number(v.metrics?.findings_block ?? 0),
|
|
||||||
findings_warn: Number(v.metrics?.findings_warn ?? 0),
|
|
||||||
});
|
|
||||||
} catch { /* skip corrupt */ }
|
|
||||||
}
|
|
||||||
return out;
|
|
||||||
}
|
|
||||||
|
|
||||||
interface Stats {
|
|
||||||
audit_count: number;
|
|
||||||
verdict_distribution: Record<string, number>;
|
|
||||||
// Same PR with multiple SHAs — if verdicts differ, that's drift across
|
|
||||||
// the PR's commit history. Not a flip-flop in the classical sense,
|
|
||||||
// but worth surfacing (e.g. "PR #8 was block block req req block").
|
|
||||||
per_pr_verdict_sequences: Record<number, string[]>;
|
|
||||||
// For each PR with ≥ 2 audits, how many distinct verdicts did it
|
|
||||||
// produce? 1 = stable; 2+ = some flipping.
|
|
||||||
verdict_instability: { pr_count: number; pr_with_multiple_verdicts: number; pr_with_3plus: number };
|
|
||||||
consensus: { discrepancy_count: number; tiebreaker_used: number; unresolved: number };
|
|
||||||
kb: {
|
|
||||||
audit_lessons_rows: number;
|
|
||||||
audit_facts_rows: number;
|
|
||||||
scrum_reviews_rows: number;
|
|
||||||
distinct_finding_signatures: number;
|
|
||||||
distinct_entities_across_prs: number;
|
|
||||||
entities_in_2plus_prs: number;
|
|
||||||
entities_in_5plus_prs: number;
|
|
||||||
};
|
|
||||||
fact_quality: {
|
|
||||||
verifier_verdict_distribution: Record<string, number>;
|
|
||||||
facts_dropped_by_verifier_total: number;
|
|
||||||
extraction_success_rate: number;
|
|
||||||
};
|
|
||||||
top_entities: Array<{ name: string; distinct_prs: number; count: number; types: string[] }>;
|
|
||||||
kb_by_source: Record<string, number>;
|
|
||||||
}
|
|
||||||
|
|
||||||
async function collect(args: Args): Promise<Stats> {
|
|
||||||
const verdicts = await loadVerdicts();
|
|
||||||
const lessons = await readJsonl<any>(AUDIT_LESSONS);
|
|
||||||
const facts = await readJsonl<any>(AUDIT_FACTS);
|
|
||||||
const disc = await readJsonl<any>(AUDIT_DISCREPANCIES);
|
|
||||||
const reviews = await readJsonl<any>(SCRUM_REVIEWS);
|
|
||||||
|
|
||||||
// Verdict stability
|
|
||||||
const byPr: Record<number, string[]> = {};
|
|
||||||
const verdictDist: Record<string, number> = {};
|
|
||||||
for (const v of verdicts) {
|
|
||||||
(byPr[v.pr] ??= []).push(v.overall);
|
|
||||||
verdictDist[v.overall] = (verdictDist[v.overall] ?? 0) + 1;
|
|
||||||
}
|
|
||||||
let multi = 0, tri = 0;
|
|
||||||
for (const [_, seq] of Object.entries(byPr)) {
|
|
||||||
const distinct = new Set(seq);
|
|
||||||
if (distinct.size >= 2) multi++;
|
|
||||||
if (distinct.size >= 3) tri++;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Consensus drift
|
|
||||||
const consensus = {
|
|
||||||
discrepancy_count: disc.length,
|
|
||||||
tiebreaker_used: disc.filter(d => String(d.resolution).startsWith("tiebreaker")).length,
|
|
||||||
unresolved: disc.filter(d => d.resolution === "unresolved").length,
|
|
||||||
};
|
|
||||||
|
|
||||||
// Lesson signatures
|
|
||||||
const lessonAgg = await aggregate<any>(AUDIT_LESSONS, {
|
|
||||||
keyFn: r => r?.signature,
|
|
||||||
scopeFn: r => (r?.pr_number !== undefined ? `pr-${r.pr_number}` : undefined),
|
|
||||||
});
|
|
||||||
|
|
||||||
// Entity aggregation across audit_facts rows
|
|
||||||
interface EntAgg { distinct_prs: Set<number>; count: number; types: Set<string>; name: string; sources: Set<string> }
|
|
||||||
const entAgg = new Map<string, EntAgg>();
|
|
||||||
const sourceCount: Record<string, number> = {};
|
|
||||||
let totalVerdictDist: Record<string, number> = { CORRECT: 0, INCORRECT: 0, UNVERIFIABLE: 0, UNCHECKED: 0 };
|
|
||||||
let factsDroppedTotal = 0;
|
|
||||||
let extractionsWithFacts = 0;
|
|
||||||
|
|
||||||
for (const row of facts) {
|
|
||||||
const src = String(row.source ?? "unknown");
|
|
||||||
sourceCount[src] = (sourceCount[src] ?? 0) + 1;
|
|
||||||
const pr = Number(row.pr_number);
|
|
||||||
if (Array.isArray(row.verifier_verdicts)) {
|
|
||||||
for (const v of row.verifier_verdicts) {
|
|
||||||
totalVerdictDist[v] = (totalVerdictDist[v] ?? 0) + 1;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
factsDroppedTotal += Number(row.facts_dropped_by_verifier ?? 0);
|
|
||||||
if ((Array.isArray(row.facts) && row.facts.length > 0) || (Array.isArray(row.entities) && row.entities.length > 0)) {
|
|
||||||
extractionsWithFacts++;
|
|
||||||
}
|
|
||||||
for (const e of Array.isArray(row.entities) ? row.entities : []) {
|
|
||||||
const name = String(e?.name ?? "").trim();
|
|
||||||
if (name.length < 3) continue;
|
|
||||||
const key = name.toLowerCase();
|
|
||||||
const agg = entAgg.get(key) ?? { distinct_prs: new Set(), count: 0, types: new Set(), name, sources: new Set() };
|
|
||||||
agg.count++;
|
|
||||||
if (Number.isFinite(pr) && pr > 0) agg.distinct_prs.add(pr);
|
|
||||||
if (e?.type) agg.types.add(String(e.type));
|
|
||||||
agg.sources.add(src);
|
|
||||||
entAgg.set(key, agg);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
const entitiesIn2Plus = Array.from(entAgg.values()).filter(a => a.distinct_prs.size >= 2).length;
|
|
||||||
const entitiesIn5Plus = Array.from(entAgg.values()).filter(a => a.distinct_prs.size >= 5).length;
|
|
||||||
const topEntities = Array.from(entAgg.values())
|
|
||||||
.sort((a, b) => b.distinct_prs.size - a.distinct_prs.size || b.count - a.count)
|
|
||||||
.slice(0, args.top)
|
|
||||||
.map(a => ({
|
|
||||||
name: a.name,
|
|
||||||
distinct_prs: a.distinct_prs.size,
|
|
||||||
count: a.count,
|
|
||||||
types: Array.from(a.types),
|
|
||||||
}));
|
|
||||||
|
|
||||||
const stats: Stats = {
|
|
||||||
audit_count: verdicts.length,
|
|
||||||
verdict_distribution: verdictDist,
|
|
||||||
per_pr_verdict_sequences: byPr,
|
|
||||||
verdict_instability: {
|
|
||||||
pr_count: Object.keys(byPr).length,
|
|
||||||
pr_with_multiple_verdicts: multi,
|
|
||||||
pr_with_3plus: tri,
|
|
||||||
},
|
|
||||||
consensus,
|
|
||||||
kb: {
|
|
||||||
audit_lessons_rows: lessons.length,
|
|
||||||
audit_facts_rows: facts.length,
|
|
||||||
scrum_reviews_rows: reviews.length,
|
|
||||||
distinct_finding_signatures: lessonAgg.size,
|
|
||||||
distinct_entities_across_prs: entAgg.size,
|
|
||||||
entities_in_2plus_prs: entitiesIn2Plus,
|
|
||||||
entities_in_5plus_prs: entitiesIn5Plus,
|
|
||||||
},
|
|
||||||
fact_quality: {
|
|
||||||
verifier_verdict_distribution: totalVerdictDist,
|
|
||||||
facts_dropped_by_verifier_total: factsDroppedTotal,
|
|
||||||
extraction_success_rate: facts.length > 0 ? extractionsWithFacts / facts.length : 0,
|
|
||||||
},
|
|
||||||
top_entities: topEntities,
|
|
||||||
kb_by_source: sourceCount,
|
|
||||||
};
|
|
||||||
return stats;
|
|
||||||
}
|
|
||||||
|
|
||||||
function renderHuman(s: Stats): string {
|
|
||||||
const lines: string[] = [];
|
|
||||||
lines.push("═══ KB STATS ═══");
|
|
||||||
lines.push("");
|
|
||||||
lines.push(`Audits: ${s.audit_count} total across ${s.verdict_instability.pr_count} distinct PRs`);
|
|
||||||
lines.push(`Verdicts: ${Object.entries(s.verdict_distribution).map(([k, v]) => `${k}=${v}`).join(" ")}`);
|
|
||||||
const multiplePct = s.verdict_instability.pr_count > 0
|
|
||||||
? Math.round(100 * s.verdict_instability.pr_with_multiple_verdicts / s.verdict_instability.pr_count)
|
|
||||||
: 0;
|
|
||||||
lines.push(`Verdict instability: ${s.verdict_instability.pr_with_multiple_verdicts}/${s.verdict_instability.pr_count} PRs had 2+ distinct verdicts (${multiplePct}%) — 3+ distinct: ${s.verdict_instability.pr_with_3plus}`);
|
|
||||||
lines.push("");
|
|
||||||
lines.push("─── Consensus ───");
|
|
||||||
lines.push(` discrepancies logged: ${s.consensus.discrepancy_count}`);
|
|
||||||
lines.push(` tiebreaker used: ${s.consensus.tiebreaker_used}`);
|
|
||||||
lines.push(` unresolved: ${s.consensus.unresolved}`);
|
|
||||||
const dRate = s.audit_count > 0 ? (100 * s.consensus.discrepancy_count / s.audit_count).toFixed(1) : "0";
|
|
||||||
lines.push(` discrepancy rate: ${dRate}% of audits`);
|
|
||||||
lines.push("");
|
|
||||||
lines.push("─── KB size ───");
|
|
||||||
lines.push(` audit_lessons.jsonl: ${s.kb.audit_lessons_rows} rows, ${s.kb.distinct_finding_signatures} distinct signatures`);
|
|
||||||
lines.push(` audit_facts.jsonl: ${s.kb.audit_facts_rows} rows, ${s.kb.distinct_entities_across_prs} distinct entities`);
|
|
||||||
lines.push(` scrum_reviews.jsonl: ${s.kb.scrum_reviews_rows} rows`);
|
|
||||||
lines.push(` entities in 2+ PRs: ${s.kb.entities_in_2plus_prs}`);
|
|
||||||
lines.push(` entities in 5+ PRs: ${s.kb.entities_in_5plus_prs} ← strong cross-cutting signal`);
|
|
||||||
lines.push("");
|
|
||||||
lines.push("─── Fact quality ───");
|
|
||||||
const v = s.fact_quality.verifier_verdict_distribution;
|
|
||||||
lines.push(` verifier verdicts: CORRECT=${v.CORRECT ?? 0} UNVERIFIABLE=${v.UNVERIFIABLE ?? 0} UNCHECKED=${v.UNCHECKED ?? 0} INCORRECT=${v.INCORRECT ?? 0}`);
|
|
||||||
lines.push(` facts dropped by verifier: ${s.fact_quality.facts_dropped_by_verifier_total}`);
|
|
||||||
lines.push(` extraction success rate: ${(s.fact_quality.extraction_success_rate * 100).toFixed(1)}%`);
|
|
||||||
lines.push("");
|
|
||||||
lines.push("─── KB sources ───");
|
|
||||||
for (const [src, n] of Object.entries(s.kb_by_source)) {
|
|
||||||
lines.push(` ${src}: ${n}`);
|
|
||||||
}
|
|
||||||
lines.push("");
|
|
||||||
lines.push(`─── Top ${s.top_entities.length} recurring entities ───`);
|
|
||||||
for (const e of s.top_entities) {
|
|
||||||
lines.push(` [${e.distinct_prs} PRs × ${e.count} obs] ${e.name} (${e.types.join(",")})`);
|
|
||||||
}
|
|
||||||
return lines.join("\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
async function main() {
|
|
||||||
const args = parseArgs(process.argv);
|
|
||||||
const stats = await collect(args);
|
|
||||||
if (args.json) {
|
|
||||||
console.log(JSON.stringify(stats, (_, v) => v instanceof Set ? Array.from(v) : v, 2));
|
|
||||||
} else {
|
|
||||||
console.log(renderHuman(stats));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
main().catch(e => { console.error("[kb_stats] fatal:", e); process.exit(1); });
|
|
||||||
@@ -1,62 +0,0 @@
|
|||||||
// ═══════════════════════════════════════════════════════════════════
|
|
||||||
// YOU WRITE THIS FILE. Policy decides what blocks vs what's a comment.
|
|
||||||
// Defaults are opinionated on the "stop clicking past placeholder"
|
|
||||||
// side — easier to loosen than to tighten when you're watching the
|
|
||||||
// auditor behave in live PRs.
|
|
||||||
// ═══════════════════════════════════════════════════════════════════
|
|
||||||
|
|
||||||
import type { Finding, Verdict } from "./types.ts";
|
|
||||||
|
|
||||||
/// Translate the four-check output into a single verdict. This is the
|
|
||||||
/// single pane of glass the auditor operates on — tune thresholds here.
|
|
||||||
export function assembleVerdict(
|
|
||||||
findings: Finding[],
|
|
||||||
metrics: Record<string, number>,
|
|
||||||
pr_number: number,
|
|
||||||
head_sha: string,
|
|
||||||
): Verdict {
|
|
||||||
const blocking = findings.filter(f => f.severity === "block");
|
|
||||||
const warning = findings.filter(f => f.severity === "warn");
|
|
||||||
|
|
||||||
let overall: Verdict["overall"];
|
|
||||||
let one_liner: string;
|
|
||||||
|
|
||||||
if (blocking.length > 0) {
|
|
||||||
overall = "block";
|
|
||||||
one_liner = `${blocking.length} blocking issue${blocking.length > 1 ? "s" : ""}: ${blocking[0].summary}`;
|
|
||||||
} else if (warning.length >= 3) {
|
|
||||||
// Three or more warnings is a block — death by a thousand cuts.
|
|
||||||
overall = "request_changes";
|
|
||||||
one_liner = `${warning.length} warnings — see review`;
|
|
||||||
} else if (warning.length > 0) {
|
|
||||||
overall = "request_changes";
|
|
||||||
one_liner = warning[0].summary;
|
|
||||||
} else {
|
|
||||||
overall = "approve";
|
|
||||||
one_liner = `all checks passed (${findings.length} findings, all info)`;
|
|
||||||
}
|
|
||||||
|
|
||||||
return {
|
|
||||||
pr_number,
|
|
||||||
head_sha,
|
|
||||||
audited_at: new Date().toISOString(),
|
|
||||||
overall,
|
|
||||||
findings,
|
|
||||||
metrics,
|
|
||||||
one_liner,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Which strength-of-claim warrants which severity when evidence is
|
|
||||||
/// weak? A "Phase X shipped" claim with zero integration tests is a
|
|
||||||
/// blocker. A "should work" claim with no test is a warn.
|
|
||||||
export function severityFromClaimEvidence(
|
|
||||||
claim_strength: "weak" | "moderate" | "strong",
|
|
||||||
evidence_grade: "none" | "partial" | "full",
|
|
||||||
): "info" | "warn" | "block" {
|
|
||||||
if (evidence_grade === "full") return "info";
|
|
||||||
if (claim_strength === "strong" && evidence_grade === "none") return "block";
|
|
||||||
if (claim_strength === "strong" && evidence_grade === "partial") return "warn";
|
|
||||||
if (claim_strength === "moderate" && evidence_grade === "none") return "warn";
|
|
||||||
return "info";
|
|
||||||
}
|
|
||||||
@@ -1,85 +0,0 @@
|
|||||||
// drift_report.ts — comparison of a current run summary vs the
|
|
||||||
// previous run summary on disk. Spec calls this "drift detection";
|
|
||||||
// concretely it answers: did the pipeline behave the same way as
|
|
||||||
// last time, and if not, was the change explained by an input change
|
|
||||||
// or did it appear out of nowhere (silent drift)?
|
|
||||||
//
|
|
||||||
// Severity:
|
|
||||||
// ok — within 20% on every metric, no hash surprises
|
|
||||||
// warn — record-count or category swing > 20%, OR new error class
|
|
||||||
// alert — output_hash differs while input_hash is identical
|
|
||||||
// (deterministic violation — same input → different output)
|
|
||||||
|
|
||||||
import {
|
|
||||||
ValidationResult, requireString, requireIsoTimestamp,
|
|
||||||
} from "./types";
|
|
||||||
import type { StageName } from "./stage_receipt";
|
|
||||||
|
|
||||||
export const DRIFT_REPORT_SCHEMA_VERSION = 2;
|
|
||||||
export const DRIFT_THRESHOLD_PCT = 0.20;
|
|
||||||
|
|
||||||
export type DriftSeverity = "ok" | "warn" | "alert";
|
|
||||||
|
|
||||||
export interface StageDrift {
|
|
||||||
stage: StageName;
|
|
||||||
delta_records_in: number; // current - prior
|
|
||||||
delta_records_out: number;
|
|
||||||
delta_accepted: number;
|
|
||||||
delta_quarantined: number;
|
|
||||||
pct_change_out: number | null; // null when prior had 0 records
|
|
||||||
// null when input_hash isn't materialized into the stage summary —
|
|
||||||
// schema v1 lied and reported `true` here. v2 is honest: callers
|
|
||||||
// that want determinism enforcement must read the full StageReceipt
|
|
||||||
// off disk and compute input_hash equality there.
|
|
||||||
input_hash_match: boolean | null;
|
|
||||||
output_hash_match: boolean;
|
|
||||||
// alert if input_hash matches but output_hash diverges
|
|
||||||
deterministic_violation: boolean;
|
|
||||||
notes: string[];
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface DriftReport {
|
|
||||||
schema_version: number;
|
|
||||||
run_id: string;
|
|
||||||
prior_run_id: string | null; // null when no prior run on disk
|
|
||||||
generated_at: string;
|
|
||||||
severity: DriftSeverity;
|
|
||||||
stages: StageDrift[];
|
|
||||||
// Top-level swings the human reader should see immediately.
|
|
||||||
flags: string[];
|
|
||||||
}
|
|
||||||
|
|
||||||
export function validateDriftReport(input: unknown): ValidationResult<DriftReport> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
if (typeof input !== "object" || input === null) {
|
|
||||||
return { valid: false, errors: ["expected object"] };
|
|
||||||
}
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
|
|
||||||
if (r.schema_version !== DRIFT_REPORT_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${DRIFT_REPORT_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireString(r.run_id, "run_id", errors) && ok;
|
|
||||||
if (r.prior_run_id !== null && typeof r.prior_run_id !== "string") {
|
|
||||||
errors.push("prior_run_id: must be string or null");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireIsoTimestamp(r.generated_at, "generated_at", errors) && ok;
|
|
||||||
if (!["ok", "warn", "alert"].includes(r.severity as string)) {
|
|
||||||
errors.push(`severity: must be ok|warn|alert, got ${JSON.stringify(r.severity)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (!Array.isArray(r.stages)) {
|
|
||||||
errors.push("stages: expected array");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (!Array.isArray(r.flags)) {
|
|
||||||
errors.push("flags: expected array");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as DriftReport };
|
|
||||||
}
|
|
||||||
@@ -1,116 +0,0 @@
|
|||||||
// EvidenceRecord schema tests.
|
|
||||||
//
|
|
||||||
// Two positive fixtures (one per real-source prototype: distilled_facts
|
|
||||||
// + contract_analyses) and three negative fixtures pinning the
|
|
||||||
// non-negotiable invariants the spec demands:
|
|
||||||
// - every record must trace to a source (provenance)
|
|
||||||
// - schema_version must match — silent v1/v2 drift is the worst kind
|
|
||||||
// - required identity fields (run_id) cannot be missing
|
|
||||||
//
|
|
||||||
// Run with: bun test auditor/schemas/distillation/evidence_record.test.ts
|
|
||||||
|
|
||||||
import { test, expect } from "bun:test";
|
|
||||||
import { readFileSync } from "node:fs";
|
|
||||||
import { resolve } from "node:path";
|
|
||||||
|
|
||||||
import { validateEvidenceRecord, EVIDENCE_SCHEMA_VERSION } from "./evidence_record";
|
|
||||||
|
|
||||||
const FIXTURE_DIR = resolve(import.meta.dir, "fixtures");
|
|
||||||
|
|
||||||
function loadFixture(name: string): unknown {
|
|
||||||
return JSON.parse(readFileSync(resolve(FIXTURE_DIR, name), "utf8"));
|
|
||||||
}
|
|
||||||
|
|
||||||
test("EVIDENCE_SCHEMA_VERSION is 1 — bump deliberately, never silently", () => {
|
|
||||||
expect(EVIDENCE_SCHEMA_VERSION).toBe(1);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("positive: distilled_fact materialized record validates", () => {
|
|
||||||
const r = validateEvidenceRecord(loadFixture("evidence_positive_distilled_fact.json"));
|
|
||||||
if (!r.valid) console.error("unexpected errors:", r.errors);
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
if (r.valid) {
|
|
||||||
expect(r.value.run_id).toBe("cae21289");
|
|
||||||
expect(r.value.model_role).toBe("extractor");
|
|
||||||
expect(r.value.provenance.source_file).toBe("data/_kb/distilled_facts.jsonl");
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
test("positive: contract_analysis materialized record validates with retrieval + observer fields", () => {
|
|
||||||
const r = validateEvidenceRecord(loadFixture("evidence_positive_contract_analysis.json"));
|
|
||||||
if (!r.valid) console.error("unexpected errors:", r.errors);
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
if (r.valid) {
|
|
||||||
expect(r.value.observer_verdict).toBe("reject");
|
|
||||||
expect(r.value.observer_confidence).toBe(95);
|
|
||||||
expect(r.value.retrieved_context?.matrix_corpora?.length).toBe(4);
|
|
||||||
expect(r.value.failure_markers).toContain("observer_rejected");
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
test("negative: missing run_id is rejected with a specific error", () => {
|
|
||||||
const r = validateEvidenceRecord(loadFixture("evidence_negative_no_run_id.json"));
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) {
|
|
||||||
expect(r.errors.some(e => e.includes("run_id"))).toBe(true);
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
test("negative: schema_version mismatch is rejected (silent v1/v2 drift guard)", () => {
|
|
||||||
const r = validateEvidenceRecord(loadFixture("evidence_negative_bad_schema_version.json"));
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) {
|
|
||||||
expect(r.errors.some(e => e.includes("schema_version"))).toBe(true);
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
test("negative: bad provenance (non-sha256 sig_hash, non-ISO timestamp) is rejected", () => {
|
|
||||||
const r = validateEvidenceRecord(loadFixture("evidence_negative_bad_provenance.json"));
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) {
|
|
||||||
// Must catch BOTH the sig_hash AND the recorded_at — comprehensive
|
|
||||||
// error reporting is part of the contract.
|
|
||||||
expect(r.errors.some(e => e.includes("sig_hash"))).toBe(true);
|
|
||||||
expect(r.errors.some(e => e.includes("recorded_at"))).toBe(true);
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
test("negative: non-object input is rejected with clear error", () => {
|
|
||||||
const r = validateEvidenceRecord("not an object");
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) {
|
|
||||||
expect(r.errors[0]).toContain("expected object");
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
test("negative: human_override with invalid decision is rejected", () => {
|
|
||||||
const fixture = loadFixture("evidence_positive_distilled_fact.json") as Record<string, unknown>;
|
|
||||||
fixture.human_override = {
|
|
||||||
overrider: "test-user",
|
|
||||||
decision: "maybe", // invalid — must be accept|reject|needs_review
|
|
||||||
reason: "test",
|
|
||||||
overridden_at: "2026-04-26T22:30:00.000Z",
|
|
||||||
};
|
|
||||||
const r = validateEvidenceRecord(fixture);
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) {
|
|
||||||
expect(r.errors.some(e => e.includes("human_override.decision"))).toBe(true);
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
test("positive: human_override = null is allowed (explicitly no override)", () => {
|
|
||||||
const fixture = loadFixture("evidence_positive_distilled_fact.json") as Record<string, unknown>;
|
|
||||||
fixture.human_override = null;
|
|
||||||
const r = validateEvidenceRecord(fixture);
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("negative: observer_confidence outside [0, 100] is rejected", () => {
|
|
||||||
const fixture = loadFixture("evidence_positive_contract_analysis.json") as Record<string, unknown>;
|
|
||||||
fixture.observer_confidence = 150;
|
|
||||||
const r = validateEvidenceRecord(fixture);
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) {
|
|
||||||
expect(r.errors.some(e => e.includes("observer_confidence"))).toBe(true);
|
|
||||||
}
|
|
||||||
});
|
|
||||||
@@ -1,202 +0,0 @@
|
|||||||
// EvidenceRecord — the unified per-execution-trace record that the
|
|
||||||
// Evidence View emits and the Success Scorer reads.
|
|
||||||
//
|
|
||||||
// Derived from now.md spec + reconciliation of two existing prototypes:
|
|
||||||
// - distilled_facts.jsonl / distilled_procedures.jsonl (LLM-extracted
|
|
||||||
// text with run_id + sig_hash + extractor + verifier + embedding)
|
|
||||||
// - contract_analyses.jsonl (observer integration + retrieval
|
|
||||||
// telemetry + cost + duration)
|
|
||||||
//
|
|
||||||
// Required fields are the ones every record MUST have for traceability:
|
|
||||||
// run_id, task_id, timestamp, schema_version, provenance. Everything
|
|
||||||
// else is typed-but-optional because no single source has all of them
|
|
||||||
// — the Evidence View materializes them by JOINing across streams when
|
|
||||||
// the source data is present.
|
|
||||||
//
|
|
||||||
// schema_version starts at 1 and gets bumped on breaking changes.
|
|
||||||
// Validators MUST check schema_version and refuse unknown values so a
|
|
||||||
// future v2 reader doesn't silently accept v1 records (or vice versa).
|
|
||||||
|
|
||||||
import {
|
|
||||||
ValidationResult, Provenance,
|
|
||||||
requireString, requireNumber, requireIsoTimestamp, requireProvenance, requireStringArray,
|
|
||||||
} from "./types";
|
|
||||||
|
|
||||||
export const EVIDENCE_SCHEMA_VERSION = 1;
|
|
||||||
|
|
||||||
export type ModelRole =
|
|
||||||
| "executor" // produced the answer (e.g. scrum reviewer, mode runner LLM call)
|
|
||||||
| "reviewer" // judged an executor output (e.g. observer, hand-review)
|
|
||||||
| "extractor" // pulled structured data from text (e.g. fact_extractor)
|
|
||||||
| "verifier" // confirmed/rejected an extracted claim (verifier in distilled_*)
|
|
||||||
| "categorizer" // assigned a category (categorizer in distilled_*)
|
|
||||||
| "tiebreaker" // resolved a consensus split
|
|
||||||
| "applier" // landed code (scrum_applier)
|
|
||||||
| "embedder" // produced embeddings
|
|
||||||
| "other";
|
|
||||||
|
|
||||||
export interface EvidenceRecord {
|
|
||||||
// ── Identity ──
|
|
||||||
// run_id ties this record to a specific execution. Sources use it
|
|
||||||
// inconsistently (some stream-level, some per-call). The Evidence
|
|
||||||
// View canonicalizes to per-call; if the source is stream-level,
|
|
||||||
// synthesize as `${stream_run_id}:${row_index}`.
|
|
||||||
run_id: string;
|
|
||||||
|
|
||||||
// task_id groups records by logical task (e.g. one PR = one task_id
|
|
||||||
// across multiple per-call runs). Defaults to run_id when no group
|
|
||||||
// exists — never null.
|
|
||||||
task_id: string;
|
|
||||||
|
|
||||||
// ISO 8601 of when the EXECUTION happened, not when this record was
|
|
||||||
// materialized. Use the source row's timestamp; provenance carries
|
|
||||||
// the materialization time separately.
|
|
||||||
timestamp: string;
|
|
||||||
|
|
||||||
schema_version: number;
|
|
||||||
|
|
||||||
// ── Provenance ── (required — no record without source linkage)
|
|
||||||
provenance: Provenance;
|
|
||||||
|
|
||||||
// ── Model attribution (optional) ──
|
|
||||||
model_name?: string; // e.g. "kimi-k2:1t", "gpt-oss:120b"
|
|
||||||
model_provider?: string; // e.g. "ollama_cloud", "openrouter", "ollama"
|
|
||||||
model_role?: ModelRole;
|
|
||||||
|
|
||||||
// ── Content hashes (optional) ──
|
|
||||||
// sha256 of the full input prompt and full output content. Pre-
|
|
||||||
// computed so the Evidence Index can dedup across re-runs of the
|
|
||||||
// same prompt without re-hashing.
|
|
||||||
input_hash?: string;
|
|
||||||
output_hash?: string;
|
|
||||||
|
|
||||||
// ── Repo + execution context ──
|
|
||||||
source_files?: string[]; // files the run touched/read
|
|
||||||
commands_run?: string[]; // shell commands or tool calls fired
|
|
||||||
retrieved_context?: { // what the model saw via retrieval
|
|
||||||
matrix_corpora?: string[];
|
|
||||||
matrix_hits?: number;
|
|
||||||
matrix_chunks_kept?: number;
|
|
||||||
matrix_chunks_dropped?: number;
|
|
||||||
pathway_fingerprints_seen?: number;
|
|
||||||
};
|
|
||||||
|
|
||||||
// ── Observer + scratchpad ──
|
|
||||||
observer_notes?: string[]; // observer.review() free-form notes
|
|
||||||
observer_verdict?: "accept" | "reject" | "cycle" | string;
|
|
||||||
observer_confidence?: number; // 0-100
|
|
||||||
scratchpad_summary?: string; // tree-split scratchpad text or hash ref
|
|
||||||
|
|
||||||
// ── Outcome markers ──
|
|
||||||
// Both arrays exist because a run can have multiple succeeded gates
|
|
||||||
// AND multiple failed gates simultaneously. Empty arrays are valid;
|
|
||||||
// missing arrays are also valid (means "no evidence either way").
|
|
||||||
success_markers?: string[]; // e.g. "cargo_green", "tests_passed", "anchor_grounded"
|
|
||||||
failure_markers?: string[]; // e.g. "warning_count_up", "rationale_mismatch", "consensus_split"
|
|
||||||
|
|
||||||
// ── Validation telemetry ──
|
|
||||||
validation_results?: {
|
|
||||||
grounded_fraction?: number; // mode_compare grounding %
|
|
||||||
schema_valid?: boolean;
|
|
||||||
pathway_replay_succeeded?: boolean;
|
|
||||||
[key: string]: unknown;
|
|
||||||
};
|
|
||||||
|
|
||||||
// ── Human-in-loop ──
|
|
||||||
human_override?: {
|
|
||||||
overrider: string; // user identifier
|
|
||||||
decision: "accept" | "reject" | "needs_review";
|
|
||||||
reason: string;
|
|
||||||
overridden_at: string; // ISO 8601
|
|
||||||
} | null;
|
|
||||||
|
|
||||||
// ── Performance ──
|
|
||||||
cost_usd?: number;
|
|
||||||
latency_ms?: number;
|
|
||||||
prompt_tokens?: number;
|
|
||||||
completion_tokens?: number;
|
|
||||||
|
|
||||||
// ── Free-form text content (the actual run output) ──
|
|
||||||
// Optional because some sources are pure metadata (auto_apply.jsonl)
|
|
||||||
// and have no text payload. Present for distilled_*, contract_analyses,
|
|
||||||
// mode_experiments, scrum_reviews etc.
|
|
||||||
text?: string;
|
|
||||||
|
|
||||||
// ── Domain-specific metadata bucket ──
|
|
||||||
// Source-specific fields that don't earn a top-level slot. e.g.
|
|
||||||
// contract_analyses rows carry `contractor` here; mode_experiments
|
|
||||||
// could carry `corpus_set`. Typed scalar values only — keep this
|
|
||||||
// small or it becomes a junk drawer. Added 2026-04-27 (Kimi audit
|
|
||||||
// flagged `(ev as any).contractor` schema bypass at export_sft.ts:126).
|
|
||||||
metadata?: Record<string, string | number | boolean>;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function validateEvidenceRecord(input: unknown): ValidationResult<EvidenceRecord> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
|
|
||||||
if (typeof input !== "object" || input === null) {
|
|
||||||
return { valid: false, errors: ["expected object, got " + (input === null ? "null" : typeof input)] };
|
|
||||||
}
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
|
|
||||||
// Required
|
|
||||||
let ok = true;
|
|
||||||
ok = requireString(r.run_id, "run_id", errors) && ok;
|
|
||||||
ok = requireString(r.task_id, "task_id", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(r.timestamp, "timestamp", errors) && ok;
|
|
||||||
ok = requireProvenance(r.provenance, "provenance", errors) && ok;
|
|
||||||
|
|
||||||
if (r.schema_version !== EVIDENCE_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${EVIDENCE_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Optional but typed-when-present
|
|
||||||
if (r.model_role !== undefined) {
|
|
||||||
const valid: ModelRole[] = ["executor", "reviewer", "extractor", "verifier", "categorizer", "tiebreaker", "applier", "embedder", "other"];
|
|
||||||
if (!valid.includes(r.model_role as ModelRole)) {
|
|
||||||
errors.push(`model_role: must be one of ${valid.join("|")}, got ${JSON.stringify(r.model_role)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (r.input_hash !== undefined && !/^[0-9a-f]{64}$/.test(String(r.input_hash))) {
|
|
||||||
errors.push("input_hash: must be hex sha256 when present");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (r.output_hash !== undefined && !/^[0-9a-f]{64}$/.test(String(r.output_hash))) {
|
|
||||||
errors.push("output_hash: must be hex sha256 when present");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (r.source_files !== undefined && !requireStringArray(r.source_files, "source_files", errors)) ok = false;
|
|
||||||
if (r.commands_run !== undefined && !requireStringArray(r.commands_run, "commands_run", errors)) ok = false;
|
|
||||||
if (r.success_markers !== undefined && !requireStringArray(r.success_markers, "success_markers", errors)) ok = false;
|
|
||||||
if (r.failure_markers !== undefined && !requireStringArray(r.failure_markers, "failure_markers", errors)) ok = false;
|
|
||||||
if (r.observer_notes !== undefined && !requireStringArray(r.observer_notes, "observer_notes", errors)) ok = false;
|
|
||||||
|
|
||||||
if (r.observer_confidence !== undefined) {
|
|
||||||
if (!requireNumber(r.observer_confidence, "observer_confidence", errors)) ok = false;
|
|
||||||
else if ((r.observer_confidence as number) < 0 || (r.observer_confidence as number) > 100) {
|
|
||||||
errors.push("observer_confidence: must be in [0, 100]");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (r.human_override !== undefined && r.human_override !== null) {
|
|
||||||
const ho = r.human_override as Record<string, unknown>;
|
|
||||||
if (typeof ho !== "object") {
|
|
||||||
errors.push("human_override: expected object or null");
|
|
||||||
ok = false;
|
|
||||||
} else {
|
|
||||||
ok = requireString(ho.overrider, "human_override.overrider", errors) && ok;
|
|
||||||
ok = requireString(ho.reason, "human_override.reason", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(ho.overridden_at, "human_override.overridden_at", errors) && ok;
|
|
||||||
if (!["accept", "reject", "needs_review"].includes(ho.decision as string)) {
|
|
||||||
errors.push(`human_override.decision: must be accept|reject|needs_review`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as EvidenceRecord };
|
|
||||||
}
|
|
||||||
@@ -1,11 +0,0 @@
|
|||||||
{
|
|
||||||
"run_id": "cae21289",
|
|
||||||
"task_id": "team_runs:637",
|
|
||||||
"timestamp": "2026-04-23T09:54:40.729599Z",
|
|
||||||
"schema_version": 1,
|
|
||||||
"provenance": {
|
|
||||||
"source_file": "data/_kb/distilled_facts.jsonl",
|
|
||||||
"sig_hash": "not-a-real-sha256",
|
|
||||||
"recorded_at": "yesterday"
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,11 +0,0 @@
|
|||||||
{
|
|
||||||
"run_id": "cae21289",
|
|
||||||
"task_id": "team_runs:637",
|
|
||||||
"timestamp": "2026-04-23T09:54:40.729599Z",
|
|
||||||
"schema_version": 99,
|
|
||||||
"provenance": {
|
|
||||||
"source_file": "data/_kb/distilled_facts.jsonl",
|
|
||||||
"sig_hash": "21a809e2dc43dfae0000000000000000000000000000000000000000deadbeef",
|
|
||||||
"recorded_at": "2026-04-26T22:30:00.000Z"
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,11 +0,0 @@
|
|||||||
{
|
|
||||||
"task_id": "team_runs:637",
|
|
||||||
"timestamp": "2026-04-23T09:54:40.729599Z",
|
|
||||||
"schema_version": 1,
|
|
||||||
"provenance": {
|
|
||||||
"source_file": "data/_kb/distilled_facts.jsonl",
|
|
||||||
"sig_hash": "21a809e2dc43dfae0000000000000000000000000000000000000000deadbeef",
|
|
||||||
"recorded_at": "2026-04-26T22:30:00.000Z"
|
|
||||||
},
|
|
||||||
"text": "missing run_id should fail validation"
|
|
||||||
}
|
|
||||||
@@ -1,27 +0,0 @@
|
|||||||
{
|
|
||||||
"run_id": "contract_analysis:101078392:1777250758717",
|
|
||||||
"task_id": "permit:101078392",
|
|
||||||
"timestamp": "2026-04-25T23:45:58.717Z",
|
|
||||||
"schema_version": 1,
|
|
||||||
"provenance": {
|
|
||||||
"source_file": "data/_kb/contract_analyses.jsonl",
|
|
||||||
"line_offset": 0,
|
|
||||||
"sig_hash": "f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1f1",
|
|
||||||
"recorded_at": "2026-04-26T22:30:00.000Z"
|
|
||||||
},
|
|
||||||
"model_name": "kimi-k2:1t",
|
|
||||||
"model_role": "executor",
|
|
||||||
"model_provider": "ollama_cloud",
|
|
||||||
"retrieved_context": {
|
|
||||||
"matrix_corpora": ["entity_brief_v1", "chicago_permits_v1", "distilled_procedural_v20260423102847", "sec_tickers_v1"],
|
|
||||||
"matrix_hits": 10
|
|
||||||
},
|
|
||||||
"observer_notes": ["contractor history shows 0 prior fills in Chicago downtown zone"],
|
|
||||||
"observer_verdict": "reject",
|
|
||||||
"observer_confidence": 95,
|
|
||||||
"success_markers": ["matrix_hits_above_threshold"],
|
|
||||||
"failure_markers": ["observer_rejected"],
|
|
||||||
"cost_usd": 0.0002,
|
|
||||||
"latency_ms": 25419,
|
|
||||||
"text": "Permit 101078392 contractor ANTHONY FIORE — analysis: insufficient prior performance signal; recommend escalation."
|
|
||||||
}
|
|
||||||
@@ -1,19 +0,0 @@
|
|||||||
{
|
|
||||||
"run_id": "cae21289",
|
|
||||||
"task_id": "team_runs:637",
|
|
||||||
"timestamp": "2026-04-23T09:54:40.729599Z",
|
|
||||||
"schema_version": 1,
|
|
||||||
"provenance": {
|
|
||||||
"source_file": "data/_kb/distilled_facts.jsonl",
|
|
||||||
"line_offset": 0,
|
|
||||||
"sig_hash": "21a809e2dc43dfae0000000000000000000000000000000000000000deadbeef",
|
|
||||||
"recorded_at": "2026-04-26T22:30:00.000Z"
|
|
||||||
},
|
|
||||||
"model_name": "qwen2.5:latest",
|
|
||||||
"model_role": "extractor",
|
|
||||||
"model_provider": "ollama",
|
|
||||||
"text": "Convergence refers to the system stabilizing into a state of high performance with low variance across iterations.",
|
|
||||||
"validation_results": {
|
|
||||||
"schema_valid": true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,56 +0,0 @@
|
|||||||
// ModelLedgerEntry — aggregate per-task-type-per-model performance.
|
|
||||||
// Built by aggregating mode_experiments.jsonl + model_trust.jsonl.
|
|
||||||
// Updated rather than appended — one row per (model_name, task_type)
|
|
||||||
// representing latest aggregates.
|
|
||||||
import {
|
|
||||||
ValidationResult, requireString, requireNumber, requireIsoTimestamp, requireStringArray,
|
|
||||||
} from "./types";
|
|
||||||
|
|
||||||
export const MODEL_LEDGER_SCHEMA_VERSION = 1;
|
|
||||||
|
|
||||||
export interface ModelLedgerEntry {
|
|
||||||
schema_version: number;
|
|
||||||
model_name: string;
|
|
||||||
model_provider: string;
|
|
||||||
task_type: string;
|
|
||||||
success_rate: number; // [0, 1]
|
|
||||||
failure_modes: string[]; // top failure mode tags
|
|
||||||
best_partner_model?: string; // pairs well with X (consensus / tie-break)
|
|
||||||
escalation_role?: string; // when this model gets escalated TO (or FROM)
|
|
||||||
cost_usd_p50?: number;
|
|
||||||
latency_ms_p50?: number;
|
|
||||||
latency_ms_p95?: number;
|
|
||||||
context_window?: number;
|
|
||||||
sample_count: number;
|
|
||||||
last_updated: string; // ISO 8601
|
|
||||||
notes?: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function validateModelLedgerEntry(input: unknown): ValidationResult<ModelLedgerEntry> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
if (typeof input !== "object" || input === null) return { valid: false, errors: ["expected object"] };
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
|
|
||||||
if (r.schema_version !== MODEL_LEDGER_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${MODEL_LEDGER_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireString(r.model_name, "model_name", errors) && ok;
|
|
||||||
ok = requireString(r.model_provider, "model_provider", errors) && ok;
|
|
||||||
ok = requireString(r.task_type, "task_type", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(r.last_updated, "last_updated", errors) && ok;
|
|
||||||
ok = requireStringArray(r.failure_modes, "failure_modes", errors) && ok;
|
|
||||||
|
|
||||||
if (!requireNumber(r.success_rate, "success_rate", errors)) ok = false;
|
|
||||||
else if ((r.success_rate as number) < 0 || (r.success_rate as number) > 1) {
|
|
||||||
errors.push("success_rate: must be in [0, 1]"); ok = false;
|
|
||||||
}
|
|
||||||
if (!requireNumber(r.sample_count, "sample_count", errors)) ok = false;
|
|
||||||
else if ((r.sample_count as number) < 1 || !Number.isInteger(r.sample_count)) {
|
|
||||||
errors.push("sample_count: must be positive integer (no aggregate from zero samples)"); ok = false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as ModelLedgerEntry };
|
|
||||||
}
|
|
||||||
@@ -1,68 +0,0 @@
|
|||||||
// Playbook — procedural knowledge extracted from accepted/partially-
|
|
||||||
// accepted runs. Different from pathway_memory's bug_fingerprints (which
|
|
||||||
// are pattern-detectors) — playbooks describe HOW to handle a task type.
|
|
||||||
import {
|
|
||||||
ValidationResult, requireString, requireIsoTimestamp, requireProvenance, requireStringArray,
|
|
||||||
} from "./types";
|
|
||||||
|
|
||||||
export const PLAYBOOK_SCHEMA_VERSION = 1;
|
|
||||||
|
|
||||||
export interface Playbook {
|
|
||||||
schema_version: number;
|
|
||||||
playbook_id: string;
|
|
||||||
task_type: string; // e.g. "scrum_review", "pr_audit", "staffing.fill"
|
|
||||||
problem_pattern: string; // when does this playbook apply?
|
|
||||||
useful_context: string[]; // what to retrieve before running
|
|
||||||
model_routing_path: string[]; // ordered model attempts that worked
|
|
||||||
commands_worked: string[];
|
|
||||||
commands_failed: string[];
|
|
||||||
validation_steps: string[];
|
|
||||||
repo_files_touched: string[];
|
|
||||||
recovery_strategy: string; // what to do when the path fails
|
|
||||||
known_failure_modes: string[];
|
|
||||||
escalation_threshold: string; // when to switch to a stronger model
|
|
||||||
acceptance_criteria: string[]; // how to know it succeeded
|
|
||||||
source_run_ids: string[]; // FK to EvidenceRecord.run_id (provenance — every playbook traces to source)
|
|
||||||
created_at: string;
|
|
||||||
provenance: { source_file: string; line_offset?: number; sig_hash: string; recorded_at: string };
|
|
||||||
}
|
|
||||||
|
|
||||||
export function validatePlaybook(input: unknown): ValidationResult<Playbook> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
if (typeof input !== "object" || input === null) return { valid: false, errors: ["expected object"] };
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
|
|
||||||
if (r.schema_version !== PLAYBOOK_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${PLAYBOOK_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireString(r.playbook_id, "playbook_id", errors) && ok;
|
|
||||||
ok = requireString(r.task_type, "task_type", errors) && ok;
|
|
||||||
ok = requireString(r.problem_pattern, "problem_pattern", errors) && ok;
|
|
||||||
ok = requireString(r.recovery_strategy, "recovery_strategy", errors) && ok;
|
|
||||||
ok = requireString(r.escalation_threshold, "escalation_threshold", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(r.created_at, "created_at", errors) && ok;
|
|
||||||
ok = requireStringArray(r.useful_context, "useful_context", errors) && ok;
|
|
||||||
ok = requireStringArray(r.model_routing_path, "model_routing_path", errors) && ok;
|
|
||||||
ok = requireStringArray(r.commands_worked, "commands_worked", errors) && ok;
|
|
||||||
ok = requireStringArray(r.commands_failed, "commands_failed", errors) && ok;
|
|
||||||
ok = requireStringArray(r.validation_steps, "validation_steps", errors) && ok;
|
|
||||||
ok = requireStringArray(r.repo_files_touched, "repo_files_touched", errors) && ok;
|
|
||||||
ok = requireStringArray(r.known_failure_modes, "known_failure_modes", errors) && ok;
|
|
||||||
ok = requireStringArray(r.acceptance_criteria, "acceptance_criteria", errors) && ok;
|
|
||||||
ok = requireStringArray(r.source_run_ids, "source_run_ids", errors) && ok;
|
|
||||||
|
|
||||||
if (Array.isArray(r.source_run_ids) && r.source_run_ids.length === 0) {
|
|
||||||
errors.push("source_run_ids: must be non-empty — every playbook traces to source evidence (spec non-negotiable)");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (Array.isArray(r.acceptance_criteria) && r.acceptance_criteria.length === 0) {
|
|
||||||
errors.push("acceptance_criteria: must be non-empty — every playbook needs success criteria (spec non-negotiable)");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireProvenance(r.provenance, "provenance", errors) && ok;
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as Playbook };
|
|
||||||
}
|
|
||||||
@@ -1,60 +0,0 @@
|
|||||||
// PreferenceSample — entry in exports/preference/chosen_rejected.jsonl.
|
|
||||||
// Source: real disagreements (audit_discrepancies, scrum ladder retries).
|
|
||||||
// Validator pins: chosen != rejected, both source_run_ids present, reason
|
|
||||||
// is non-empty. No synthesized preferences.
|
|
||||||
import {
|
|
||||||
ValidationResult, requireString, requireIsoTimestamp, requireProvenance,
|
|
||||||
} from "./types";
|
|
||||||
|
|
||||||
export const PREFERENCE_SAMPLE_SCHEMA_VERSION = 1;
|
|
||||||
|
|
||||||
export interface PreferenceSample {
|
|
||||||
schema_version: number;
|
|
||||||
id: string;
|
|
||||||
prompt: string;
|
|
||||||
chosen: string;
|
|
||||||
rejected: string;
|
|
||||||
reason: string; // why chosen > rejected — must be non-empty
|
|
||||||
chosen_run_id: string;
|
|
||||||
rejected_run_id: string;
|
|
||||||
created_at: string;
|
|
||||||
provenance: { source_file: string; line_offset?: number; sig_hash: string; recorded_at: string };
|
|
||||||
}
|
|
||||||
|
|
||||||
export function validatePreferenceSample(input: unknown): ValidationResult<PreferenceSample> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
if (typeof input !== "object" || input === null) return { valid: false, errors: ["expected object"] };
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
|
|
||||||
if (r.schema_version !== PREFERENCE_SAMPLE_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${PREFERENCE_SAMPLE_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireString(r.id, "id", errors) && ok;
|
|
||||||
ok = requireString(r.prompt, "prompt", errors) && ok;
|
|
||||||
ok = requireString(r.chosen, "chosen", errors) && ok;
|
|
||||||
ok = requireString(r.rejected, "rejected", errors) && ok;
|
|
||||||
ok = requireString(r.reason, "reason", errors) && ok;
|
|
||||||
ok = requireString(r.chosen_run_id, "chosen_run_id", errors) && ok;
|
|
||||||
ok = requireString(r.rejected_run_id, "rejected_run_id", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(r.created_at, "created_at", errors) && ok;
|
|
||||||
ok = requireProvenance(r.provenance, "provenance", errors) && ok;
|
|
||||||
|
|
||||||
// Self-pairing guard.
|
|
||||||
if (r.chosen === r.rejected && typeof r.chosen === "string") {
|
|
||||||
errors.push("chosen and rejected must differ — preference data needs a real disagreement");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (r.chosen_run_id === r.rejected_run_id && typeof r.chosen_run_id === "string") {
|
|
||||||
errors.push("chosen_run_id and rejected_run_id must differ — same run can't disagree with itself");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (typeof r.reason === "string" && (r.reason as string).trim().length === 0) {
|
|
||||||
errors.push("reason: must be non-whitespace (every preference needs WHY chosen > rejected)");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as PreferenceSample };
|
|
||||||
}
|
|
||||||
@@ -1,72 +0,0 @@
|
|||||||
// RagSample — entry in exports/rag/playbooks.jsonl. Spec shape exactly,
|
|
||||||
// plus provenance + success_score (so the index can re-rank by quality).
|
|
||||||
import {
|
|
||||||
ValidationResult, requireString, requireNumber, requireIsoTimestamp, requireProvenance, requireStringArray,
|
|
||||||
} from "./types";
|
|
||||||
|
|
||||||
export const RAG_SAMPLE_SCHEMA_VERSION = 1;
|
|
||||||
|
|
||||||
// Allowed source_category values. RAG accepts accepted/partial freely;
|
|
||||||
// needs_human_review is opt-in (must be tagged so consumers can filter
|
|
||||||
// it out for SFT).
|
|
||||||
export const RAG_ALLOWED_CATEGORIES = ["accepted", "partially_accepted", "needs_human_review"] as const;
|
|
||||||
export type RagSourceCategory = (typeof RAG_ALLOWED_CATEGORIES)[number];
|
|
||||||
|
|
||||||
export interface RagSample {
|
|
||||||
schema_version: number;
|
|
||||||
id: string;
|
|
||||||
title: string;
|
|
||||||
content: string;
|
|
||||||
tags: string[];
|
|
||||||
source_run_id: string;
|
|
||||||
// Snapshot of the score the source carried at export time. Lets a
|
|
||||||
// consumer see "this was partial" without re-reading scored-runs.
|
|
||||||
success_score: RagSourceCategory;
|
|
||||||
// Same value as success_score by spec (now.md asks for both fields).
|
|
||||||
// Kept distinct so future schemas can diverge them (e.g. an
|
|
||||||
// "is_review_material" flag) without breaking old consumers.
|
|
||||||
source_category: RagSourceCategory;
|
|
||||||
embedding_text: string; // the text to embed (often == content but can be shorter)
|
|
||||||
created_at: string;
|
|
||||||
provenance: { source_file: string; line_offset?: number; sig_hash: string; recorded_at: string };
|
|
||||||
}
|
|
||||||
|
|
||||||
export function validateRagSample(input: unknown): ValidationResult<RagSample> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
if (typeof input !== "object" || input === null) return { valid: false, errors: ["expected object"] };
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
|
|
||||||
if (r.schema_version !== RAG_SAMPLE_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${RAG_SAMPLE_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireString(r.id, "id", errors) && ok;
|
|
||||||
ok = requireString(r.title, "title", errors) && ok;
|
|
||||||
ok = requireString(r.content, "content", errors) && ok;
|
|
||||||
ok = requireString(r.embedding_text, "embedding_text", errors) && ok;
|
|
||||||
ok = requireString(r.source_run_id, "source_run_id", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(r.created_at, "created_at", errors) && ok;
|
|
||||||
ok = requireStringArray(r.tags, "tags", errors) && ok;
|
|
||||||
ok = requireProvenance(r.provenance, "provenance", errors) && ok;
|
|
||||||
|
|
||||||
if (!RAG_ALLOWED_CATEGORIES.includes(r.success_score as RagSourceCategory)) {
|
|
||||||
errors.push(`success_score: must be one of ${RAG_ALLOWED_CATEGORIES.join("|")} (rejected never enters RAG)`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (!RAG_ALLOWED_CATEGORIES.includes(r.source_category as RagSourceCategory)) {
|
|
||||||
errors.push(`source_category: must be one of ${RAG_ALLOWED_CATEGORIES.join("|")}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (r.success_score !== r.source_category) {
|
|
||||||
errors.push("success_score and source_category must match (mirrored fields per spec)");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (typeof r.content === "string" && (r.content as string).trim().length === 0) {
|
|
||||||
errors.push("content: must be non-whitespace");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as RagSample };
|
|
||||||
}
|
|
||||||
@@ -1,286 +0,0 @@
|
|||||||
// Real-data validation test — proves the EvidenceRecord schema fits
|
|
||||||
// what we ALREADY produce, with the minimum transformation each source
|
|
||||||
// stream requires. Doubles as the stale-extraction probe: if
|
|
||||||
// distilled_facts.jsonl rows can't materialize, we know that stream
|
|
||||||
// has rotted and Phase 2 sources from elsewhere.
|
|
||||||
//
|
|
||||||
// Strategy:
|
|
||||||
// 1. Read first N rows from each source jsonl (skip if missing)
|
|
||||||
// 2. Apply minimal transformer: add schema_version + provenance,
|
|
||||||
// synthesize run_id/task_id when source doesn't carry them
|
|
||||||
// 3. Validate each materialized record
|
|
||||||
// 4. Tally pass/fail per source + collect failure reasons
|
|
||||||
//
|
|
||||||
// This file is allowed to skip when source files don't exist (fresh
|
|
||||||
// clone), so it acts as both a CI guard and a real-environment probe.
|
|
||||||
|
|
||||||
import { test, expect } from "bun:test";
|
|
||||||
import { existsSync, readFileSync } from "node:fs";
|
|
||||||
import { resolve } from "node:path";
|
|
||||||
|
|
||||||
import {
|
|
||||||
validateEvidenceRecord, EVIDENCE_SCHEMA_VERSION, EvidenceRecord, ModelRole,
|
|
||||||
} from "./evidence_record";
|
|
||||||
|
|
||||||
const ROOT = "/home/profit/lakehouse";
|
|
||||||
const SAMPLE_PER_SOURCE = 10;
|
|
||||||
|
|
||||||
interface SourceProbe {
|
|
||||||
source_file: string;
|
|
||||||
transform: (row: any, lineNo: number) => Partial<EvidenceRecord> | null;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Canonical 64-char synthetic sha256 for tests where the source row
|
|
||||||
// lacks one. Pretends the materializer would compute it via
|
|
||||||
// canonicalSha256(orderedKeys(row)) at Phase 2 time. We use a fixed
|
|
||||||
// value here to keep the test deterministic; real materialization
|
|
||||||
// re-hashes per row.
|
|
||||||
const PLACEHOLDER_SHA = "0000000000000000000000000000000000000000000000000000000000000000";
|
|
||||||
const RECORDED = "2026-04-26T22:30:00.000Z";
|
|
||||||
|
|
||||||
function provFor(source_file: string, lineNo: number, sigHashRaw?: string): EvidenceRecord["provenance"] {
|
|
||||||
// Pad shorter hashes (distilled_* uses 16-char) to 64 — mimics
|
|
||||||
// canonical recompute.
|
|
||||||
const sig = sigHashRaw && /^[0-9a-f]+$/.test(sigHashRaw)
|
|
||||||
? sigHashRaw.padEnd(64, "0").slice(0, 64)
|
|
||||||
: PLACEHOLDER_SHA;
|
|
||||||
return {
|
|
||||||
source_file: source_file.replace(`${ROOT}/`, ""),
|
|
||||||
line_offset: lineNo,
|
|
||||||
sig_hash: sig,
|
|
||||||
recorded_at: RECORDED,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
const PROBES: SourceProbe[] = [
|
|
||||||
{
|
|
||||||
source_file: `${ROOT}/data/_kb/distilled_facts.jsonl`,
|
|
||||||
transform: (row: any, lineNo: number) => ({
|
|
||||||
run_id: String(row.run_id ?? `distilled_facts:${lineNo}`),
|
|
||||||
task_id: String(row.source_label ?? `distilled_facts:${lineNo}`),
|
|
||||||
timestamp: row.created_at,
|
|
||||||
schema_version: EVIDENCE_SCHEMA_VERSION,
|
|
||||||
provenance: provFor(`${ROOT}/data/_kb/distilled_facts.jsonl`, lineNo, row.sig_hash),
|
|
||||||
model_name: row.extractor,
|
|
||||||
model_role: "extractor" as ModelRole,
|
|
||||||
model_provider: "ollama",
|
|
||||||
text: row.text,
|
|
||||||
}),
|
|
||||||
},
|
|
||||||
{
|
|
||||||
source_file: `${ROOT}/data/_kb/distilled_procedures.jsonl`,
|
|
||||||
transform: (row: any, lineNo: number) => ({
|
|
||||||
run_id: String(row.run_id ?? `distilled_procedures:${lineNo}`),
|
|
||||||
task_id: String(row.source_label ?? `distilled_procedures:${lineNo}`),
|
|
||||||
timestamp: row.created_at,
|
|
||||||
schema_version: EVIDENCE_SCHEMA_VERSION,
|
|
||||||
provenance: provFor(`${ROOT}/data/_kb/distilled_procedures.jsonl`, lineNo, row.sig_hash),
|
|
||||||
model_name: row.extractor,
|
|
||||||
model_role: "extractor" as ModelRole,
|
|
||||||
model_provider: "ollama",
|
|
||||||
text: row.text,
|
|
||||||
}),
|
|
||||||
},
|
|
||||||
{
|
|
||||||
source_file: `${ROOT}/data/_kb/contract_analyses.jsonl`,
|
|
||||||
transform: (row: any, lineNo: number) => ({
|
|
||||||
run_id: `contract_analysis:${row.permit_id}:${new Date(row.ts).getTime()}`,
|
|
||||||
task_id: `permit:${row.permit_id}`,
|
|
||||||
timestamp: row.ts,
|
|
||||||
schema_version: EVIDENCE_SCHEMA_VERSION,
|
|
||||||
provenance: provFor(`${ROOT}/data/_kb/contract_analyses.jsonl`, lineNo),
|
|
||||||
model_role: "executor" as ModelRole,
|
|
||||||
retrieved_context: {
|
|
||||||
matrix_corpora: Object.keys(row.matrix_corpora ?? {}),
|
|
||||||
matrix_hits: row.matrix_hits,
|
|
||||||
},
|
|
||||||
observer_notes: row.observer_notes ? [row.observer_notes].flat() : undefined,
|
|
||||||
observer_verdict: row.observer_verdict,
|
|
||||||
observer_confidence: row.observer_conf,
|
|
||||||
success_markers: row.ok ? ["matrix_hits_above_threshold"] : undefined,
|
|
||||||
failure_markers: !row.ok || row.observer_verdict === "reject" ? ["observer_rejected"] : undefined,
|
|
||||||
cost_usd: typeof row.cost === "number" ? row.cost / 1_000_000 : undefined,
|
|
||||||
latency_ms: row.duration_ms,
|
|
||||||
text: row.analysis,
|
|
||||||
}),
|
|
||||||
},
|
|
||||||
{
|
|
||||||
source_file: `${ROOT}/data/_kb/mode_experiments.jsonl`,
|
|
||||||
transform: (row: any, lineNo: number) => ({
|
|
||||||
run_id: `mode_exec:${new Date(row.ts).getTime()}:${row.file_path ?? "?"}`,
|
|
||||||
task_id: row.task_class,
|
|
||||||
timestamp: row.ts,
|
|
||||||
schema_version: EVIDENCE_SCHEMA_VERSION,
|
|
||||||
provenance: provFor(`${ROOT}/data/_kb/mode_experiments.jsonl`, lineNo),
|
|
||||||
model_name: row.model,
|
|
||||||
model_role: "executor" as ModelRole,
|
|
||||||
model_provider: row.model?.includes("/") ? "openrouter" : "ollama_cloud",
|
|
||||||
retrieved_context: {
|
|
||||||
matrix_corpora: row.sources?.matrix_corpus,
|
|
||||||
matrix_chunks_kept: row.sources?.matrix_chunks_kept,
|
|
||||||
matrix_chunks_dropped: row.sources?.matrix_chunks_dropped,
|
|
||||||
pathway_fingerprints_seen: row.sources?.bug_fingerprints_count,
|
|
||||||
},
|
|
||||||
latency_ms: row.latency_ms,
|
|
||||||
text: row.response,
|
|
||||||
source_files: row.file_path ? [row.file_path] : undefined,
|
|
||||||
}),
|
|
||||||
},
|
|
||||||
{
|
|
||||||
source_file: `${ROOT}/data/_kb/scrum_reviews.jsonl`,
|
|
||||||
transform: (row: any, lineNo: number) => ({
|
|
||||||
run_id: `scrum:${new Date(row.reviewed_at).getTime()}:${row.file}`,
|
|
||||||
task_id: `scrum_review:${row.file}`,
|
|
||||||
timestamp: row.reviewed_at,
|
|
||||||
schema_version: EVIDENCE_SCHEMA_VERSION,
|
|
||||||
provenance: provFor(`${ROOT}/data/_kb/scrum_reviews.jsonl`, lineNo),
|
|
||||||
model_name: row.accepted_model,
|
|
||||||
model_role: "executor" as ModelRole,
|
|
||||||
source_files: [row.file],
|
|
||||||
success_markers: row.accepted_on_attempt ? [`accepted_on_attempt_${row.accepted_on_attempt}`] : undefined,
|
|
||||||
text: row.suggestions_preview,
|
|
||||||
}),
|
|
||||||
},
|
|
||||||
{
|
|
||||||
source_file: `${ROOT}/data/_kb/observer_escalations.jsonl`,
|
|
||||||
transform: (row: any, lineNo: number) => ({
|
|
||||||
run_id: `obs_esc:${new Date(row.ts).getTime()}:${row.sig_hash}`,
|
|
||||||
task_id: `observer_escalation:${row.cluster_endpoint ?? "?"}`,
|
|
||||||
timestamp: row.ts,
|
|
||||||
schema_version: EVIDENCE_SCHEMA_VERSION,
|
|
||||||
provenance: provFor(`${ROOT}/data/_kb/observer_escalations.jsonl`, lineNo, row.sig_hash),
|
|
||||||
model_role: "reviewer" as ModelRole,
|
|
||||||
prompt_tokens: row.prompt_tokens,
|
|
||||||
completion_tokens: row.completion_tokens,
|
|
||||||
text: row.analysis,
|
|
||||||
}),
|
|
||||||
},
|
|
||||||
{
|
|
||||||
source_file: `${ROOT}/data/_kb/audit_facts.jsonl`,
|
|
||||||
transform: (row: any, lineNo: number) => ({
|
|
||||||
run_id: `audit_facts:${row.head_sha}:${lineNo}`,
|
|
||||||
task_id: `pr:${row.pr_number}`,
|
|
||||||
timestamp: row.extracted_at,
|
|
||||||
schema_version: EVIDENCE_SCHEMA_VERSION,
|
|
||||||
provenance: provFor(`${ROOT}/data/_kb/audit_facts.jsonl`, lineNo),
|
|
||||||
model_name: row.extractor,
|
|
||||||
model_role: "extractor" as ModelRole,
|
|
||||||
// facts/entities/relationships go into text as a JSON dump for now;
|
|
||||||
// structured handling lives in Phase 2 where we map to specific
|
|
||||||
// EvidenceRecord substructures.
|
|
||||||
text: JSON.stringify({
|
|
||||||
facts: row.facts?.length ?? 0,
|
|
||||||
entities: row.entities?.length ?? 0,
|
|
||||||
relationships: row.relationships?.length ?? 0,
|
|
||||||
}),
|
|
||||||
}),
|
|
||||||
},
|
|
||||||
];
|
|
||||||
|
|
||||||
interface ProbeResult {
|
|
||||||
source_file: string;
|
|
||||||
rows_attempted: number;
|
|
||||||
rows_present: boolean;
|
|
||||||
passed: number;
|
|
||||||
failed: number;
|
|
||||||
failure_reasons: string[]; // unique error strings, top 5
|
|
||||||
}
|
|
||||||
|
|
||||||
const RESULTS: ProbeResult[] = [];
|
|
||||||
|
|
||||||
for (const probe of PROBES) {
|
|
||||||
const sourceLabel = probe.source_file.replace(`${ROOT}/`, "");
|
|
||||||
|
|
||||||
test(`real-data: ${sourceLabel}`, () => {
|
|
||||||
const result: ProbeResult = {
|
|
||||||
source_file: sourceLabel,
|
|
||||||
rows_attempted: 0,
|
|
||||||
rows_present: false,
|
|
||||||
passed: 0,
|
|
||||||
failed: 0,
|
|
||||||
failure_reasons: [],
|
|
||||||
};
|
|
||||||
|
|
||||||
if (!existsSync(probe.source_file)) {
|
|
||||||
RESULTS.push(result);
|
|
||||||
// Skip silently — fresh clones won't have these files
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
result.rows_present = true;
|
|
||||||
const lines = readFileSync(probe.source_file, "utf8").split("\n").filter(Boolean).slice(0, SAMPLE_PER_SOURCE);
|
|
||||||
const reasons = new Set<string>();
|
|
||||||
|
|
||||||
for (let i = 0; i < lines.length; i++) {
|
|
||||||
result.rows_attempted++;
|
|
||||||
let row: unknown;
|
|
||||||
try { row = JSON.parse(lines[i]); }
|
|
||||||
catch { continue; }
|
|
||||||
|
|
||||||
const transformed = probe.transform(row, i);
|
|
||||||
if (!transformed) continue;
|
|
||||||
|
|
||||||
const v = validateEvidenceRecord(transformed);
|
|
||||||
if (v.valid) result.passed++;
|
|
||||||
else {
|
|
||||||
result.failed++;
|
|
||||||
for (const e of v.errors) reasons.add(e);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
result.failure_reasons = Array.from(reasons).slice(0, 5);
|
|
||||||
RESULTS.push(result);
|
|
||||||
|
|
||||||
// Test passes as long as we attempted something and got a result.
|
|
||||||
// Per-source pass/fail counts are reported in the markdown writeup.
|
|
||||||
expect(result.rows_attempted).toBeGreaterThanOrEqual(0);
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
test("real-data: emit markdown report", () => {
|
|
||||||
const md: string[] = [];
|
|
||||||
md.push("# Real-data validation report");
|
|
||||||
md.push("");
|
|
||||||
md.push("Schema = EvidenceRecord v" + EVIDENCE_SCHEMA_VERSION + ". Sample = first " + SAMPLE_PER_SOURCE + " rows per source.");
|
|
||||||
md.push("");
|
|
||||||
md.push("| Source | Present | Rows | Pass | Fail | Pass% |");
|
|
||||||
md.push("|---|---|---|---|---|---|");
|
|
||||||
for (const r of RESULTS) {
|
|
||||||
const pct = r.rows_attempted > 0 ? Math.round(100 * r.passed / r.rows_attempted) + "%" : "—";
|
|
||||||
md.push(`| ${r.source_file} | ${r.rows_present ? "✓" : "—"} | ${r.rows_attempted} | ${r.passed} | ${r.failed} | ${pct} |`);
|
|
||||||
}
|
|
||||||
md.push("");
|
|
||||||
let hasFailures = false;
|
|
||||||
for (const r of RESULTS) {
|
|
||||||
if (r.failed > 0) {
|
|
||||||
hasFailures = true;
|
|
||||||
md.push(`## Failures in ${r.source_file}`);
|
|
||||||
for (const reason of r.failure_reasons) md.push(`- \`${reason}\``);
|
|
||||||
md.push("");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (!hasFailures) {
|
|
||||||
md.push("**No failures across all probed sources.** Every materialized record validates against EvidenceRecord v1.");
|
|
||||||
md.push("");
|
|
||||||
}
|
|
||||||
// Stale extraction probe: explicit pass/fail
|
|
||||||
const distilledFacts = RESULTS.find(r => r.source_file.endsWith("distilled_facts.jsonl"));
|
|
||||||
const distilledProc = RESULTS.find(r => r.source_file.endsWith("distilled_procedures.jsonl"));
|
|
||||||
md.push("## Stale-extraction probe");
|
|
||||||
md.push("");
|
|
||||||
if (distilledFacts && distilledFacts.rows_present && distilledFacts.passed > 0) {
|
|
||||||
md.push(`- **distilled_facts.jsonl:** ${distilledFacts.passed}/${distilledFacts.rows_attempted} materialize cleanly. Stream is alive at the schema level.`);
|
|
||||||
} else if (distilledFacts && !distilledFacts.rows_present) {
|
|
||||||
md.push(`- **distilled_facts.jsonl:** missing — stale or never produced. Phase 2 sources from live streams instead.`);
|
|
||||||
} else {
|
|
||||||
md.push(`- **distilled_facts.jsonl:** present but materialization failures; treat as suspect, prefer mode_experiments + scrum_reviews.`);
|
|
||||||
}
|
|
||||||
if (distilledProc && distilledProc.rows_present && distilledProc.passed > 0) {
|
|
||||||
md.push(`- **distilled_procedures.jsonl:** ${distilledProc.passed}/${distilledProc.rows_attempted} materialize cleanly.`);
|
|
||||||
}
|
|
||||||
md.push("");
|
|
||||||
|
|
||||||
// Write the markdown to a stable path and stdout
|
|
||||||
const out = md.join("\n");
|
|
||||||
Bun.write(`${ROOT}/data/_kb/realdata_validation_report.md`, out);
|
|
||||||
console.log("\n" + out);
|
|
||||||
});
|
|
||||||
@@ -1,111 +0,0 @@
|
|||||||
// Receipt — per-pipeline-stage record with everything needed to
|
|
||||||
// reproduce the run. Spec non-negotiable: substantive receipts, not
|
|
||||||
// "ran successfully". Every field below has a deterministic source so
|
|
||||||
// the receipt schema validator catches "I forgot to fill it in" the
|
|
||||||
// same way it catches type errors.
|
|
||||||
import {
|
|
||||||
ValidationResult, requireString, requireNumber, requireIsoTimestamp,
|
|
||||||
} from "./types";
|
|
||||||
|
|
||||||
export const RECEIPT_SCHEMA_VERSION = 1;
|
|
||||||
|
|
||||||
export interface FileReference {
|
|
||||||
path: string; // relative to repo root
|
|
||||||
sha256: string; // hex
|
|
||||||
bytes?: number; // optional but recommended
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface Receipt {
|
|
||||||
schema_version: number;
|
|
||||||
command: string; // shell-line or script identifier
|
|
||||||
git_sha: string; // 40-char hex (full SHA1)
|
|
||||||
git_branch?: string;
|
|
||||||
git_dirty?: boolean; // true if working tree had uncommitted changes
|
|
||||||
started_at: string; // ISO 8601
|
|
||||||
ended_at: string; // ISO 8601
|
|
||||||
duration_ms: number;
|
|
||||||
input_files: FileReference[];
|
|
||||||
output_files: FileReference[];
|
|
||||||
record_counts: {
|
|
||||||
in: number;
|
|
||||||
out: number;
|
|
||||||
[key: string]: number; // per-stage extras (filtered, dropped, etc.)
|
|
||||||
};
|
|
||||||
validation_pass: boolean; // explicit — never inferred
|
|
||||||
errors: string[];
|
|
||||||
warnings: string[];
|
|
||||||
}
|
|
||||||
|
|
||||||
function validateFileRef(v: unknown, field: string, errors: string[]): boolean {
|
|
||||||
if (typeof v !== "object" || v === null) {
|
|
||||||
errors.push(`${field}: expected object`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
const f = v as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
ok = requireString(f.path, `${field}.path`, errors) && ok;
|
|
||||||
if (typeof f.sha256 !== "string" || !/^[0-9a-f]{64}$/.test(f.sha256)) {
|
|
||||||
errors.push(`${field}.sha256: must be hex sha256`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (f.bytes !== undefined && typeof f.bytes !== "number") {
|
|
||||||
errors.push(`${field}.bytes: expected number when present`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
return ok;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function validateReceipt(input: unknown): ValidationResult<Receipt> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
if (typeof input !== "object" || input === null) {
|
|
||||||
return { valid: false, errors: ["expected object"] };
|
|
||||||
}
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
|
|
||||||
if (r.schema_version !== RECEIPT_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${RECEIPT_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireString(r.command, "command", errors) && ok;
|
|
||||||
if (typeof r.git_sha !== "string" || !/^[0-9a-f]{40}$/.test(r.git_sha as string)) {
|
|
||||||
errors.push("git_sha: must be 40-char hex");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireIsoTimestamp(r.started_at, "started_at", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(r.ended_at, "ended_at", errors) && ok;
|
|
||||||
ok = requireNumber(r.duration_ms, "duration_ms", errors) && ok;
|
|
||||||
if (typeof r.validation_pass !== "boolean") {
|
|
||||||
errors.push("validation_pass: must be boolean (explicit, never inferred)");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (!Array.isArray(r.input_files)) {
|
|
||||||
errors.push("input_files: expected array");
|
|
||||||
ok = false;
|
|
||||||
} else {
|
|
||||||
for (let i = 0; i < r.input_files.length; i++) {
|
|
||||||
if (!validateFileRef(r.input_files[i], `input_files[${i}]`, errors)) ok = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (!Array.isArray(r.output_files)) {
|
|
||||||
errors.push("output_files: expected array");
|
|
||||||
ok = false;
|
|
||||||
} else {
|
|
||||||
for (let i = 0; i < r.output_files.length; i++) {
|
|
||||||
if (!validateFileRef(r.output_files[i], `output_files[${i}]`, errors)) ok = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (typeof r.record_counts !== "object" || r.record_counts === null) {
|
|
||||||
errors.push("record_counts: expected object");
|
|
||||||
ok = false;
|
|
||||||
} else {
|
|
||||||
const rc = r.record_counts as Record<string, unknown>;
|
|
||||||
if (typeof rc.in !== "number") { errors.push("record_counts.in: expected number"); ok = false; }
|
|
||||||
if (typeof rc.out !== "number") { errors.push("record_counts.out: expected number"); ok = false; }
|
|
||||||
}
|
|
||||||
if (!Array.isArray(r.errors)) { errors.push("errors: expected array"); ok = false; }
|
|
||||||
if (!Array.isArray(r.warnings)) { errors.push("warnings: expected array"); ok = false; }
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as Receipt };
|
|
||||||
}
|
|
||||||
@@ -1,90 +0,0 @@
|
|||||||
// run_summary.ts — aggregates StageReceipt rows for one run_id.
|
|
||||||
// Spec field set: total records processed, total accepted/rejected/
|
|
||||||
// quarantined, dataset sizes, validation status, overall hash of run.
|
|
||||||
|
|
||||||
import {
|
|
||||||
ValidationResult, requireString, requireNumber, requireIsoTimestamp, requireSha256,
|
|
||||||
} from "./types";
|
|
||||||
import type { StageName } from "./stage_receipt";
|
|
||||||
|
|
||||||
export const RUN_SUMMARY_SCHEMA_VERSION = 1;
|
|
||||||
|
|
||||||
export interface RunStageSummary {
|
|
||||||
stage: StageName;
|
|
||||||
records_in: number;
|
|
||||||
records_out: number;
|
|
||||||
accepted: number;
|
|
||||||
rejected: number;
|
|
||||||
quarantined: number;
|
|
||||||
skipped: number;
|
|
||||||
passed: boolean;
|
|
||||||
duration_ms: number;
|
|
||||||
output_hash: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface RunSummary {
|
|
||||||
schema_version: number;
|
|
||||||
run_id: string;
|
|
||||||
started_at: string; // earliest stage timestamp
|
|
||||||
ended_at: string; // latest stage timestamp + duration
|
|
||||||
git_commit: string;
|
|
||||||
stages: RunStageSummary[];
|
|
||||||
// Aggregates across stages
|
|
||||||
total_records_in: number;
|
|
||||||
total_records_out: number;
|
|
||||||
total_accepted: number;
|
|
||||||
total_rejected: number;
|
|
||||||
total_quarantined: number;
|
|
||||||
total_skipped: number;
|
|
||||||
// Dataset sizes — final outputs of each export stage
|
|
||||||
rag_records: number;
|
|
||||||
sft_records: number;
|
|
||||||
preference_pairs: number;
|
|
||||||
// Pipeline-wide pass = AND of every stage validation.passed
|
|
||||||
overall_passed: boolean;
|
|
||||||
// Run-wide hash: sha256 over each stage's output hash, sorted by stage name.
|
|
||||||
// Detects ANY change in any stage output across runs.
|
|
||||||
run_hash: string;
|
|
||||||
total_duration_ms: number;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function validateRunSummary(input: unknown): ValidationResult<RunSummary> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
if (typeof input !== "object" || input === null) {
|
|
||||||
return { valid: false, errors: ["expected object"] };
|
|
||||||
}
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
|
|
||||||
if (r.schema_version !== RUN_SUMMARY_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${RUN_SUMMARY_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireString(r.run_id, "run_id", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(r.started_at, "started_at", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(r.ended_at, "ended_at", errors) && ok;
|
|
||||||
if (typeof r.git_commit !== "string" || !/^[0-9a-f]{40}$/.test(r.git_commit as string)) {
|
|
||||||
errors.push("git_commit: must be 40-char hex");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (typeof r.overall_passed !== "boolean") {
|
|
||||||
errors.push("overall_passed: must be boolean");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireSha256(r.run_hash, "run_hash", errors) && ok;
|
|
||||||
for (const k of ["total_records_in", "total_records_out", "total_accepted", "total_rejected",
|
|
||||||
"total_quarantined", "total_skipped", "rag_records", "sft_records",
|
|
||||||
"preference_pairs", "total_duration_ms"]) {
|
|
||||||
if (typeof (r as any)[k] !== "number") {
|
|
||||||
errors.push(`${k}: expected number`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (!Array.isArray(r.stages)) {
|
|
||||||
errors.push("stages: expected array");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as RunSummary };
|
|
||||||
}
|
|
||||||
@@ -1,367 +0,0 @@
|
|||||||
// Combined schema tests for ScoredRun, Receipt, Playbook,
|
|
||||||
// ScratchpadSummary, ModelLedgerEntry, RagSample, SftSample,
|
|
||||||
// PreferenceSample. EvidenceRecord lives in its own file because it's
|
|
||||||
// the foundational schema and warrants the JSON-fixture round-trip
|
|
||||||
// pattern; the rest use inline fixture makers since they're simpler.
|
|
||||||
//
|
|
||||||
// Each schema: 1 positive fixture + 4-5 negative cases pinning the
|
|
||||||
// non-negotiable invariants from now.md.
|
|
||||||
//
|
|
||||||
// Run: bun test auditor/schemas/distillation/schemas.test.ts
|
|
||||||
|
|
||||||
import { test, expect } from "bun:test";
|
|
||||||
|
|
||||||
import { validateScoredRun, SCORED_RUN_SCHEMA_VERSION } from "./scored_run";
|
|
||||||
import { validateReceipt, RECEIPT_SCHEMA_VERSION } from "./receipt";
|
|
||||||
import { validatePlaybook, PLAYBOOK_SCHEMA_VERSION } from "./playbook";
|
|
||||||
import { validateScratchpadSummary, SCRATCHPAD_SCHEMA_VERSION } from "./scratchpad_summary";
|
|
||||||
import { validateModelLedgerEntry, MODEL_LEDGER_SCHEMA_VERSION } from "./model_ledger";
|
|
||||||
import { validateRagSample, RAG_SAMPLE_SCHEMA_VERSION } from "./rag_sample";
|
|
||||||
import { validateSftSample, SFT_SAMPLE_SCHEMA_VERSION } from "./sft_sample";
|
|
||||||
import { validatePreferenceSample, PREFERENCE_SAMPLE_SCHEMA_VERSION } from "./preference_sample";
|
|
||||||
|
|
||||||
const NOW = "2026-04-26T22:30:00.000Z";
|
|
||||||
const SHA = "0123456789abcdef0123456789abcdef0123456789abcdef0123456789abcdef";
|
|
||||||
const GIT_SHA = "f753e11157eef753e11157eef753e11157eef753";
|
|
||||||
|
|
||||||
const PROVENANCE = {
|
|
||||||
source_file: "data/_kb/scored_runs.jsonl",
|
|
||||||
line_offset: 0,
|
|
||||||
sig_hash: SHA,
|
|
||||||
recorded_at: NOW,
|
|
||||||
};
|
|
||||||
|
|
||||||
// ─── ScoredRun ───────────────────────────────────────────────────────
|
|
||||||
|
|
||||||
const SCORED_RUN_OK = {
|
|
||||||
schema_version: SCORED_RUN_SCHEMA_VERSION,
|
|
||||||
evidence_run_id: "run-abc",
|
|
||||||
evidence_task_id: "task-abc",
|
|
||||||
category: "accepted",
|
|
||||||
reasons: ["cargo_green=true", "anchor_grounding=0.95"],
|
|
||||||
scored_at: NOW,
|
|
||||||
scorer_version: "v1.0.0",
|
|
||||||
sub_scores: { cargo_green: true, anchor_grounding: 0.95 },
|
|
||||||
provenance: PROVENANCE,
|
|
||||||
};
|
|
||||||
|
|
||||||
test("ScoredRun: positive validates", () => {
|
|
||||||
const r = validateScoredRun(SCORED_RUN_OK);
|
|
||||||
if (!r.valid) console.error(r.errors);
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("ScoredRun: empty reasons rejected (every score needs a reason)", () => {
|
|
||||||
const r = validateScoredRun({ ...SCORED_RUN_OK, reasons: [] });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("reasons"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("ScoredRun: invalid category rejected", () => {
|
|
||||||
const r = validateScoredRun({ ...SCORED_RUN_OK, category: "maybe_ok" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("category"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("ScoredRun: anchor_grounding > 1 rejected (must be in [0, 1])", () => {
|
|
||||||
const r = validateScoredRun({ ...SCORED_RUN_OK, sub_scores: { ...SCORED_RUN_OK.sub_scores, anchor_grounding: 1.5 } });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("anchor_grounding"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
// ─── Receipt ─────────────────────────────────────────────────────────
|
|
||||||
|
|
||||||
const RECEIPT_OK = {
|
|
||||||
schema_version: RECEIPT_SCHEMA_VERSION,
|
|
||||||
command: "bun run scripts/build_evidence_index.ts",
|
|
||||||
git_sha: GIT_SHA,
|
|
||||||
git_branch: "scrum/auto-apply-19814",
|
|
||||||
git_dirty: false,
|
|
||||||
started_at: NOW,
|
|
||||||
ended_at: NOW,
|
|
||||||
duration_ms: 1234,
|
|
||||||
input_files: [{ path: "data/_kb/scrum_reviews.jsonl", sha256: SHA, bytes: 448000 }],
|
|
||||||
output_files: [{ path: "data/evidence/2026/04/26/run.jsonl", sha256: SHA }],
|
|
||||||
record_counts: { in: 100, out: 95, filtered: 5 },
|
|
||||||
validation_pass: true,
|
|
||||||
errors: [],
|
|
||||||
warnings: [],
|
|
||||||
};
|
|
||||||
|
|
||||||
test("Receipt: positive validates", () => {
|
|
||||||
const r = validateReceipt(RECEIPT_OK);
|
|
||||||
if (!r.valid) console.error(r.errors);
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("Receipt: bad git_sha rejected (must be 40-char hex)", () => {
|
|
||||||
const r = validateReceipt({ ...RECEIPT_OK, git_sha: "abc123" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("git_sha"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("Receipt: validation_pass must be boolean (never inferred)", () => {
|
|
||||||
const r = validateReceipt({ ...RECEIPT_OK, validation_pass: "yes" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("validation_pass"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("Receipt: file refs without proper sha256 rejected", () => {
|
|
||||||
const r = validateReceipt({ ...RECEIPT_OK, output_files: [{ path: "x", sha256: "short" }] });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("sha256"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
// ─── Playbook ────────────────────────────────────────────────────────
|
|
||||||
|
|
||||||
const PLAYBOOK_OK = {
|
|
||||||
schema_version: PLAYBOOK_SCHEMA_VERSION,
|
|
||||||
playbook_id: "pb-scrum-review-001",
|
|
||||||
task_type: "scrum_review",
|
|
||||||
problem_pattern: "Cargo workspace warning escalation after applier patch",
|
|
||||||
useful_context: ["pathway memory bug fingerprints for the file area"],
|
|
||||||
model_routing_path: ["x-ai/grok-4.1-fast"],
|
|
||||||
commands_worked: ["cargo check --workspace"],
|
|
||||||
commands_failed: [],
|
|
||||||
validation_steps: ["warning count must not increase"],
|
|
||||||
repo_files_touched: ["crates/queryd/src/service.rs"],
|
|
||||||
recovery_strategy: "git checkout -- file when cargo red",
|
|
||||||
known_failure_modes: ["unused import noise"],
|
|
||||||
escalation_threshold: "use kimi-k2:1t when isolation mode rejects 2 attempts",
|
|
||||||
acceptance_criteria: ["cargo green", "warning count stable", "rationale-diff aligned"],
|
|
||||||
source_run_ids: ["run-xyz", "run-abc"],
|
|
||||||
created_at: NOW,
|
|
||||||
provenance: PROVENANCE,
|
|
||||||
};
|
|
||||||
|
|
||||||
test("Playbook: positive validates", () => {
|
|
||||||
const r = validatePlaybook(PLAYBOOK_OK);
|
|
||||||
if (!r.valid) console.error(r.errors);
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("Playbook: empty source_run_ids rejected (every playbook traces to source — spec)", () => {
|
|
||||||
const r = validatePlaybook({ ...PLAYBOOK_OK, source_run_ids: [] });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("source_run_ids"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("Playbook: empty acceptance_criteria rejected (every playbook needs success criteria — spec)", () => {
|
|
||||||
const r = validatePlaybook({ ...PLAYBOOK_OK, acceptance_criteria: [] });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("acceptance_criteria"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
// ─── ScratchpadSummary ───────────────────────────────────────────────
|
|
||||||
|
|
||||||
const SCRATCHPAD_OK = {
|
|
||||||
schema_version: SCRATCHPAD_SCHEMA_VERSION,
|
|
||||||
run_id: "run-abc",
|
|
||||||
current_objective: "verify pr_audit mode end-to-end",
|
|
||||||
completed_steps: ["restart gateway"],
|
|
||||||
failed_steps: ["cloud chat returned 500"],
|
|
||||||
pending_steps: ["swap default model"],
|
|
||||||
important_paths: ["auditor/checks/inference.ts"],
|
|
||||||
decisions: ["defer kimi-k2 swap until upstream returns"],
|
|
||||||
unresolved_questions: ["does deepseek match kimi quality?"],
|
|
||||||
validation_status: "partial",
|
|
||||||
next_command: "bun run auditor/audit_one.ts 11",
|
|
||||||
source_scratchpad_hash: SHA,
|
|
||||||
summarized_at: NOW,
|
|
||||||
provenance: PROVENANCE,
|
|
||||||
};
|
|
||||||
|
|
||||||
test("ScratchpadSummary: positive validates", () => {
|
|
||||||
const r = validateScratchpadSummary(SCRATCHPAD_OK);
|
|
||||||
if (!r.valid) console.error(r.errors);
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("ScratchpadSummary: invalid validation_status rejected", () => {
|
|
||||||
const r = validateScratchpadSummary({ ...SCRATCHPAD_OK, validation_status: "tbd" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("validation_status"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("ScratchpadSummary: short scratchpad_hash rejected", () => {
|
|
||||||
const r = validateScratchpadSummary({ ...SCRATCHPAD_OK, source_scratchpad_hash: "short" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("source_scratchpad_hash"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
// ─── ModelLedgerEntry ────────────────────────────────────────────────
|
|
||||||
|
|
||||||
const LEDGER_OK = {
|
|
||||||
schema_version: MODEL_LEDGER_SCHEMA_VERSION,
|
|
||||||
model_name: "kimi-k2:1t",
|
|
||||||
model_provider: "ollama_cloud",
|
|
||||||
task_type: "pr_audit",
|
|
||||||
success_rate: 0.85,
|
|
||||||
failure_modes: ["upstream_500", "context_truncation"],
|
|
||||||
best_partner_model: "x-ai/grok-4.1-fast",
|
|
||||||
escalation_role: "primary",
|
|
||||||
cost_usd_p50: 0.0002,
|
|
||||||
latency_ms_p50: 50000,
|
|
||||||
latency_ms_p95: 90000,
|
|
||||||
context_window: 200000,
|
|
||||||
sample_count: 47,
|
|
||||||
last_updated: NOW,
|
|
||||||
};
|
|
||||||
|
|
||||||
test("ModelLedgerEntry: positive validates", () => {
|
|
||||||
const r = validateModelLedgerEntry(LEDGER_OK);
|
|
||||||
if (!r.valid) console.error(r.errors);
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("ModelLedgerEntry: success_rate > 1 rejected", () => {
|
|
||||||
const r = validateModelLedgerEntry({ ...LEDGER_OK, success_rate: 1.5 });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("success_rate"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("ModelLedgerEntry: zero sample_count rejected (no aggregate from zero)", () => {
|
|
||||||
const r = validateModelLedgerEntry({ ...LEDGER_OK, sample_count: 0 });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("sample_count"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
// ─── RagSample ───────────────────────────────────────────────────────
|
|
||||||
|
|
||||||
const RAG_OK = {
|
|
||||||
schema_version: RAG_SAMPLE_SCHEMA_VERSION,
|
|
||||||
id: "rag-pb-001",
|
|
||||||
title: "Scrum applier rationale-diff alignment",
|
|
||||||
content: "When the applier emits a patch with rationale claiming X but the diff shows Y, the rationale-token alignment gate catches it...",
|
|
||||||
tags: ["scrum_review", "applier"],
|
|
||||||
source_run_id: "run-xyz",
|
|
||||||
success_score: "accepted",
|
|
||||||
source_category: "accepted",
|
|
||||||
embedding_text: "applier rationale-diff alignment guard scrum",
|
|
||||||
created_at: NOW,
|
|
||||||
provenance: PROVENANCE,
|
|
||||||
};
|
|
||||||
|
|
||||||
test("RagSample: positive validates", () => {
|
|
||||||
const r = validateRagSample(RAG_OK);
|
|
||||||
if (!r.valid) console.error(r.errors);
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("RagSample: success_score=rejected forbidden (RAG never takes rejected)", () => {
|
|
||||||
const r = validateRagSample({ ...RAG_OK, success_score: "rejected", source_category: "rejected" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("success_score"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("RagSample: success_score and source_category must match", () => {
|
|
||||||
const r = validateRagSample({ ...RAG_OK, success_score: "accepted", source_category: "partially_accepted" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("RagSample: whitespace-only content rejected", () => {
|
|
||||||
const r = validateRagSample({ ...RAG_OK, content: " \n " });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("content"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
// ─── SftSample (the strict one) ──────────────────────────────────────
|
|
||||||
|
|
||||||
const SFT_OK = {
|
|
||||||
schema_version: SFT_SAMPLE_SCHEMA_VERSION,
|
|
||||||
id: "sft-pr11-001",
|
|
||||||
instruction: "Audit this PR diff against ship-claims.",
|
|
||||||
context: "claims: 3 strong, 2 moderate",
|
|
||||||
response: "{\"claim_verdicts\": [...]}",
|
|
||||||
source_run_id: "run-pr11",
|
|
||||||
quality_score: "accepted",
|
|
||||||
created_at: NOW,
|
|
||||||
provenance: PROVENANCE,
|
|
||||||
};
|
|
||||||
|
|
||||||
test("SftSample: positive validates", () => {
|
|
||||||
const r = validateSftSample(SFT_OK);
|
|
||||||
if (!r.valid) console.error(r.errors);
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("SftSample: quality_score=partially_accepted ACCEPTED (--include-partial path)", () => {
|
|
||||||
// Phase 4 update: partial allowed at schema layer; CLI gate decides.
|
|
||||||
const r = validateSftSample({ ...SFT_OK, quality_score: "partially_accepted" });
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("SftSample: quality_score=rejected REJECTED (spec non-negotiable, no leak)", () => {
|
|
||||||
const r = validateSftSample({ ...SFT_OK, quality_score: "rejected" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("quality_score"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("SftSample: quality_score=needs_human_review REJECTED (no leak)", () => {
|
|
||||||
const r = validateSftSample({ ...SFT_OK, quality_score: "needs_human_review" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("SftSample: missing context rejected (must be string, even if empty)", () => {
|
|
||||||
const fixture: Record<string, unknown> = { ...SFT_OK };
|
|
||||||
delete fixture.context;
|
|
||||||
const r = validateSftSample(fixture);
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("context"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("SftSample: empty-string context allowed", () => {
|
|
||||||
const r = validateSftSample({ ...SFT_OK, context: "" });
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("SftSample: empty response rejected (no empty pairs)", () => {
|
|
||||||
const r = validateSftSample({ ...SFT_OK, response: "" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("response"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("SftSample: whitespace-only instruction rejected", () => {
|
|
||||||
const r = validateSftSample({ ...SFT_OK, instruction: " \t\n " });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("instruction"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
// ─── PreferenceSample ────────────────────────────────────────────────
|
|
||||||
|
|
||||||
const PREF_OK = {
|
|
||||||
schema_version: PREFERENCE_SAMPLE_SCHEMA_VERSION,
|
|
||||||
id: "pref-task-x-001",
|
|
||||||
prompt: "Verify claim: 'all 3 services running on matrix-test'",
|
|
||||||
chosen: "{\"backed\": true, \"evidence\": \"systemctl status confirms 3 active\"}",
|
|
||||||
rejected: "{\"backed\": true, \"evidence\": \"the README says so\"}",
|
|
||||||
reason: "chosen cites runtime evidence, rejected cites doc claim only",
|
|
||||||
chosen_run_id: "run-A",
|
|
||||||
rejected_run_id: "run-B",
|
|
||||||
created_at: NOW,
|
|
||||||
provenance: PROVENANCE,
|
|
||||||
};
|
|
||||||
|
|
||||||
test("PreferenceSample: positive validates", () => {
|
|
||||||
const r = validatePreferenceSample(PREF_OK);
|
|
||||||
if (!r.valid) console.error(r.errors);
|
|
||||||
expect(r.valid).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("PreferenceSample: chosen == rejected rejected (no self-pairing)", () => {
|
|
||||||
const r = validatePreferenceSample({ ...PREF_OK, chosen: "x", rejected: "x" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("chosen and rejected"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("PreferenceSample: chosen_run_id == rejected_run_id rejected (no self-disagreement)", () => {
|
|
||||||
const r = validatePreferenceSample({ ...PREF_OK, chosen_run_id: "run-A", rejected_run_id: "run-A" });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("chosen_run_id"))).toBe(true);
|
|
||||||
});
|
|
||||||
|
|
||||||
test("PreferenceSample: empty reason rejected (every preference needs WHY)", () => {
|
|
||||||
const r = validatePreferenceSample({ ...PREF_OK, reason: " " });
|
|
||||||
expect(r.valid).toBe(false);
|
|
||||||
if (!r.valid) expect(r.errors.some(e => e.includes("reason"))).toBe(true);
|
|
||||||
});
|
|
||||||
@@ -1,86 +0,0 @@
|
|||||||
// ScoredRun — output of the deterministic Success Scorer (Phase 3).
|
|
||||||
// Spec mandates 4 categories with explicit reasons; we add scorer
|
|
||||||
// versioning so a future scorer change is detectable in historical data.
|
|
||||||
import {
|
|
||||||
ValidationResult, requireString, requireIsoTimestamp, requireProvenance, requireStringArray, requireNumber,
|
|
||||||
} from "./types";
|
|
||||||
|
|
||||||
export const SCORED_RUN_SCHEMA_VERSION = 1;
|
|
||||||
export const SCORE_CATEGORIES = ["accepted", "partially_accepted", "rejected", "needs_human_review"] as const;
|
|
||||||
export type ScoreCategory = (typeof SCORE_CATEGORIES)[number];
|
|
||||||
|
|
||||||
export interface ScoredRun {
|
|
||||||
schema_version: number;
|
|
||||||
evidence_run_id: string; // FK to EvidenceRecord.run_id
|
|
||||||
evidence_task_id: string; // FK to EvidenceRecord.task_id
|
|
||||||
category: ScoreCategory;
|
|
||||||
reasons: string[]; // human-readable, e.g. ["cargo_green=true", "anchor_grounding<0.7"]
|
|
||||||
scored_at: string; // ISO 8601
|
|
||||||
scorer_version: string; // e.g. "v1.0.0" — bumped on scorer code change
|
|
||||||
// Sub-scores that the scorer collapsed into the category. Persisted
|
|
||||||
// so a downstream UI can show "why" without re-running the scorer.
|
|
||||||
sub_scores?: {
|
|
||||||
cargo_green?: boolean;
|
|
||||||
anchor_grounding?: number;
|
|
||||||
schema_valid?: boolean;
|
|
||||||
pathway_replay_succeeded?: boolean;
|
|
||||||
observer_verdict?: "accept" | "reject" | "cycle";
|
|
||||||
[key: string]: unknown;
|
|
||||||
};
|
|
||||||
provenance: {
|
|
||||||
source_file: string;
|
|
||||||
line_offset?: number;
|
|
||||||
sig_hash: string;
|
|
||||||
recorded_at: string;
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
export function validateScoredRun(input: unknown): ValidationResult<ScoredRun> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
if (typeof input !== "object" || input === null) {
|
|
||||||
return { valid: false, errors: ["expected object"] };
|
|
||||||
}
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
if (r.schema_version !== SCORED_RUN_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${SCORED_RUN_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireString(r.evidence_run_id, "evidence_run_id", errors) && ok;
|
|
||||||
ok = requireString(r.evidence_task_id, "evidence_task_id", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(r.scored_at, "scored_at", errors) && ok;
|
|
||||||
ok = requireString(r.scorer_version, "scorer_version", errors) && ok;
|
|
||||||
ok = requireStringArray(r.reasons, "reasons", errors) && ok;
|
|
||||||
if (Array.isArray(r.reasons) && r.reasons.length === 0) {
|
|
||||||
errors.push("reasons: must be non-empty (every score must have at least one reason)");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (!SCORE_CATEGORIES.includes(r.category as ScoreCategory)) {
|
|
||||||
errors.push(`category: must be one of ${SCORE_CATEGORIES.join("|")}, got ${JSON.stringify(r.category)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireProvenance(r.provenance, "provenance", errors) && ok;
|
|
||||||
|
|
||||||
if (r.sub_scores !== undefined) {
|
|
||||||
if (typeof r.sub_scores !== "object" || r.sub_scores === null) {
|
|
||||||
errors.push("sub_scores: expected object when present");
|
|
||||||
ok = false;
|
|
||||||
} else {
|
|
||||||
const ss = r.sub_scores as Record<string, unknown>;
|
|
||||||
if (ss.anchor_grounding !== undefined) {
|
|
||||||
if (!requireNumber(ss.anchor_grounding, "sub_scores.anchor_grounding", errors)) ok = false;
|
|
||||||
else if ((ss.anchor_grounding as number) < 0 || (ss.anchor_grounding as number) > 1) {
|
|
||||||
errors.push("sub_scores.anchor_grounding: must be in [0, 1]");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (ss.observer_verdict !== undefined && !["accept", "reject", "cycle"].includes(ss.observer_verdict as string)) {
|
|
||||||
errors.push("sub_scores.observer_verdict: must be accept|reject|cycle");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as ScoredRun };
|
|
||||||
}
|
|
||||||
@@ -1,65 +0,0 @@
|
|||||||
// ScratchpadSummary — structured normalization of a tree-split or
|
|
||||||
// long-running scratchpad. Distinct from EvidenceRecord because a
|
|
||||||
// scratchpad accumulates across many calls; this schema captures the
|
|
||||||
// state at a checkpoint moment.
|
|
||||||
import {
|
|
||||||
ValidationResult, requireString, requireIsoTimestamp, requireProvenance, requireStringArray,
|
|
||||||
} from "./types";
|
|
||||||
|
|
||||||
export const SCRATCHPAD_SCHEMA_VERSION = 1;
|
|
||||||
|
|
||||||
export interface ScratchpadSummary {
|
|
||||||
schema_version: number;
|
|
||||||
run_id: string;
|
|
||||||
current_objective: string;
|
|
||||||
completed_steps: string[];
|
|
||||||
failed_steps: string[];
|
|
||||||
pending_steps: string[];
|
|
||||||
important_paths: string[]; // file paths the scratchpad references
|
|
||||||
decisions: string[]; // architectural/scope decisions made
|
|
||||||
unresolved_questions: string[];
|
|
||||||
validation_status: "pass" | "fail" | "partial" | "pending";
|
|
||||||
next_command?: string; // recommendation for next action
|
|
||||||
source_scratchpad_hash: string; // sha256 of the full source scratchpad text — diff detection
|
|
||||||
summarized_at: string; // ISO 8601
|
|
||||||
provenance: { source_file: string; line_offset?: number; sig_hash: string; recorded_at: string };
|
|
||||||
}
|
|
||||||
|
|
||||||
const STATUS = ["pass", "fail", "partial", "pending"];
|
|
||||||
|
|
||||||
export function validateScratchpadSummary(input: unknown): ValidationResult<ScratchpadSummary> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
if (typeof input !== "object" || input === null) return { valid: false, errors: ["expected object"] };
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
|
|
||||||
if (r.schema_version !== SCRATCHPAD_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${SCRATCHPAD_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireString(r.run_id, "run_id", errors) && ok;
|
|
||||||
ok = requireString(r.current_objective, "current_objective", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(r.summarized_at, "summarized_at", errors) && ok;
|
|
||||||
if (typeof r.source_scratchpad_hash !== "string" || !/^[0-9a-f]{64}$/.test(r.source_scratchpad_hash as string)) {
|
|
||||||
errors.push("source_scratchpad_hash: must be hex sha256");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireStringArray(r.completed_steps, "completed_steps", errors) && ok;
|
|
||||||
ok = requireStringArray(r.failed_steps, "failed_steps", errors) && ok;
|
|
||||||
ok = requireStringArray(r.pending_steps, "pending_steps", errors) && ok;
|
|
||||||
ok = requireStringArray(r.important_paths, "important_paths", errors) && ok;
|
|
||||||
ok = requireStringArray(r.decisions, "decisions", errors) && ok;
|
|
||||||
ok = requireStringArray(r.unresolved_questions, "unresolved_questions", errors) && ok;
|
|
||||||
if (!STATUS.includes(r.validation_status as string)) {
|
|
||||||
errors.push(`validation_status: must be one of ${STATUS.join("|")}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (r.next_command !== undefined && typeof r.next_command !== "string") {
|
|
||||||
errors.push("next_command: expected string when present");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireProvenance(r.provenance, "provenance", errors) && ok;
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as ScratchpadSummary };
|
|
||||||
}
|
|
||||||
@@ -1,69 +0,0 @@
|
|||||||
// SftSample — entry in exports/sft/instruction_response.jsonl. Spec
|
|
||||||
// non-negotiable: ONLY accepted runs, never partial/rejected/needs_human.
|
|
||||||
// Validator enforces that invariant — exporters can't bypass.
|
|
||||||
import {
|
|
||||||
ValidationResult, requireString, requireIsoTimestamp, requireProvenance, requireNumber,
|
|
||||||
} from "./types";
|
|
||||||
|
|
||||||
export const SFT_SAMPLE_SCHEMA_VERSION = 1;
|
|
||||||
|
|
||||||
// SFT default: only `accepted` ships. With --include-partial CLI flag,
|
|
||||||
// `partially_accepted` becomes legal. `rejected` and `needs_human_review`
|
|
||||||
// NEVER ship to SFT — that's the contamination firewall.
|
|
||||||
export const SFT_QUALITY_SCORES = ["accepted", "partially_accepted"] as const;
|
|
||||||
export type SftQualityScore = (typeof SFT_QUALITY_SCORES)[number];
|
|
||||||
|
|
||||||
export interface SftSample {
|
|
||||||
schema_version: number;
|
|
||||||
id: string;
|
|
||||||
instruction: string; // the prompt / user message
|
|
||||||
context: string; // retrieved context that was visible (empty string allowed; null/undefined not)
|
|
||||||
response: string; // the model output that was accepted
|
|
||||||
source_run_id: string;
|
|
||||||
quality_score: SftQualityScore;
|
|
||||||
created_at: string;
|
|
||||||
provenance: { source_file: string; line_offset?: number; sig_hash: string; recorded_at: string };
|
|
||||||
}
|
|
||||||
|
|
||||||
export function validateSftSample(input: unknown): ValidationResult<SftSample> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
if (typeof input !== "object" || input === null) return { valid: false, errors: ["expected object"] };
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
|
|
||||||
if (r.schema_version !== SFT_SAMPLE_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${SFT_SAMPLE_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireString(r.id, "id", errors) && ok;
|
|
||||||
ok = requireString(r.instruction, "instruction", errors) && ok;
|
|
||||||
ok = requireString(r.response, "response", errors) && ok;
|
|
||||||
ok = requireString(r.source_run_id, "source_run_id", errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(r.created_at, "created_at", errors) && ok;
|
|
||||||
ok = requireProvenance(r.provenance, "provenance", errors) && ok;
|
|
||||||
|
|
||||||
// Empty pair guard.
|
|
||||||
if (typeof r.instruction === "string" && (r.instruction as string).trim().length === 0) {
|
|
||||||
errors.push("instruction: must be non-whitespace (no empty pairs)");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (typeof r.response === "string" && (r.response as string).trim().length === 0) {
|
|
||||||
errors.push("response: must be non-whitespace (no empty pairs)");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
// Context is required-string but empty is allowed (some SFT samples
|
|
||||||
// are pure instruction→response with no retrieval context).
|
|
||||||
if (typeof r.context !== "string") {
|
|
||||||
errors.push("context: expected string (use empty string for no-context samples)");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
// The non-negotiable: SFT samples MUST have quality_score in
|
|
||||||
// SFT_QUALITY_SCORES. Anything else is a leak.
|
|
||||||
if (!SFT_QUALITY_SCORES.includes(r.quality_score as SftQualityScore)) {
|
|
||||||
errors.push(`quality_score: must be one of ${SFT_QUALITY_SCORES.join("|")} (no rejected/needs_human leak into SFT — spec non-negotiable). Got ${JSON.stringify(r.quality_score)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as SftSample };
|
|
||||||
}
|
|
||||||
@@ -1,190 +0,0 @@
|
|||||||
// stage_receipt.ts — forensic-grade per-stage receipt.
|
|
||||||
//
|
|
||||||
// Distinct from auditor/schemas/distillation/receipt.ts (Phase 1):
|
|
||||||
// - Phase 1 Receipt is per-script invocation, format inherited from
|
|
||||||
// the early auditor wiring
|
|
||||||
// - StageReceipt (THIS file) matches the now.md Phase 5 spec exactly
|
|
||||||
// and is the canonical artifact for pipeline observability
|
|
||||||
//
|
|
||||||
// Every pipeline stage (collect, score, export-rag, export-sft,
|
|
||||||
// export-preference, future extract-playbooks/index) emits ONE
|
|
||||||
// StageReceipt per run. Receipts are joined by `run_id` (shared
|
|
||||||
// across all stages of a single `run-all` invocation) so a future
|
|
||||||
// query can aggregate across the whole pipeline.
|
|
||||||
|
|
||||||
import {
|
|
||||||
ValidationResult, requireString, requireNumber, requireIsoTimestamp, requireSha256,
|
|
||||||
requireStringArray,
|
|
||||||
} from "./types";
|
|
||||||
|
|
||||||
export const STAGE_RECEIPT_SCHEMA_VERSION = 1;
|
|
||||||
|
|
||||||
export const STAGE_NAMES = [
|
|
||||||
"collect", // build_evidence_index — materialize source jsonls → EvidenceRecord
|
|
||||||
"score", // score_runs — EvidenceRecord → ScoredRun
|
|
||||||
"export-rag", // exports/rag/playbooks.jsonl
|
|
||||||
"export-sft", // exports/sft/instruction_response.jsonl
|
|
||||||
"export-preference",// exports/preference/chosen_rejected.jsonl
|
|
||||||
// Reserved for future stages — accept them in the schema so a stage
|
|
||||||
// can be added without bumping schema_version.
|
|
||||||
"extract-playbooks",
|
|
||||||
"index",
|
|
||||||
] as const;
|
|
||||||
export type StageName = (typeof STAGE_NAMES)[number];
|
|
||||||
|
|
||||||
export interface StageFileRef {
|
|
||||||
path: string; // relative to repo root
|
|
||||||
sha256: string; // 64-char hex
|
|
||||||
bytes?: number;
|
|
||||||
record_count?: number; // line count for jsonl, when meaningful
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface StageIO {
|
|
||||||
files: StageFileRef[];
|
|
||||||
record_count: number;
|
|
||||||
hash: string; // 64-char hex — aggregate over all file hashes (sorted)
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface StageStats {
|
|
||||||
accepted: number; // rows that ended up in the stage's output
|
|
||||||
rejected: number; // explicit category=rejected (Score), invalid pairs (Preference), etc.
|
|
||||||
quarantined: number; // routed to exports/quarantine/* with structured reason
|
|
||||||
skipped: number; // parse failures, schema violations at write time
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface StageValidation {
|
|
||||||
passed: boolean; // explicit boolean — never inferred (spec non-negotiable)
|
|
||||||
errors: string[];
|
|
||||||
warnings: string[];
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface StageReceipt {
|
|
||||||
schema_version: number;
|
|
||||||
run_id: string; // shared across all stages of one pipeline run
|
|
||||||
stage: StageName;
|
|
||||||
timestamp: string; // ISO 8601 — stage start
|
|
||||||
git_commit: string; // 40-char hex
|
|
||||||
inputs: StageIO;
|
|
||||||
outputs: StageIO;
|
|
||||||
stats: StageStats;
|
|
||||||
validation: StageValidation;
|
|
||||||
duration_ms: number;
|
|
||||||
}
|
|
||||||
|
|
||||||
function validateStageIO(v: unknown, field: string, errors: string[]): boolean {
|
|
||||||
if (typeof v !== "object" || v === null) {
|
|
||||||
errors.push(`${field}: expected object`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
const io = v as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
if (!Array.isArray(io.files)) {
|
|
||||||
errors.push(`${field}.files: expected array`);
|
|
||||||
ok = false;
|
|
||||||
} else {
|
|
||||||
for (let i = 0; i < io.files.length; i++) {
|
|
||||||
const f = io.files[i] as Record<string, unknown>;
|
|
||||||
if (typeof f !== "object" || f === null) {
|
|
||||||
errors.push(`${field}.files[${i}]: expected object`);
|
|
||||||
ok = false;
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
ok = requireString(f.path, `${field}.files[${i}].path`, errors) && ok;
|
|
||||||
ok = requireSha256(f.sha256, `${field}.files[${i}].sha256`, errors) && ok;
|
|
||||||
if (f.bytes !== undefined && typeof f.bytes !== "number") {
|
|
||||||
errors.push(`${field}.files[${i}].bytes: expected number when present`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (f.record_count !== undefined && typeof f.record_count !== "number") {
|
|
||||||
errors.push(`${field}.files[${i}].record_count: expected number when present`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
ok = requireNumber(io.record_count, `${field}.record_count`, errors) && ok;
|
|
||||||
ok = requireSha256(io.hash, `${field}.hash`, errors) && ok;
|
|
||||||
return ok;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function validateStageReceipt(input: unknown): ValidationResult<StageReceipt> {
|
|
||||||
const errors: string[] = [];
|
|
||||||
if (typeof input !== "object" || input === null) {
|
|
||||||
return { valid: false, errors: ["expected object"] };
|
|
||||||
}
|
|
||||||
const r = input as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
|
|
||||||
if (r.schema_version !== STAGE_RECEIPT_SCHEMA_VERSION) {
|
|
||||||
errors.push(`schema_version: expected ${STAGE_RECEIPT_SCHEMA_VERSION}, got ${JSON.stringify(r.schema_version)}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireString(r.run_id, "run_id", errors) && ok;
|
|
||||||
if (typeof r.run_id === "string" && r.run_id.length < 8) {
|
|
||||||
errors.push("run_id: too short — expect uuid-like");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (typeof r.stage !== "string" || !STAGE_NAMES.includes(r.stage as StageName)) {
|
|
||||||
errors.push(`stage: must be one of ${STAGE_NAMES.join("|")}`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
ok = requireIsoTimestamp(r.timestamp, "timestamp", errors) && ok;
|
|
||||||
if (typeof r.git_commit !== "string" || !/^[0-9a-f]{40}$/.test(r.git_commit as string)) {
|
|
||||||
errors.push("git_commit: must be 40-char hex");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (typeof r.duration_ms !== "number") {
|
|
||||||
errors.push("duration_ms: expected number");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (typeof r.inputs !== "object" || r.inputs === null) {
|
|
||||||
errors.push("inputs: expected object");
|
|
||||||
ok = false;
|
|
||||||
} else {
|
|
||||||
ok = validateStageIO(r.inputs, "inputs", errors) && ok;
|
|
||||||
}
|
|
||||||
if (typeof r.outputs !== "object" || r.outputs === null) {
|
|
||||||
errors.push("outputs: expected object");
|
|
||||||
ok = false;
|
|
||||||
} else {
|
|
||||||
ok = validateStageIO(r.outputs, "outputs", errors) && ok;
|
|
||||||
}
|
|
||||||
if (typeof r.stats !== "object" || r.stats === null) {
|
|
||||||
errors.push("stats: expected object");
|
|
||||||
ok = false;
|
|
||||||
} else {
|
|
||||||
const s = r.stats as Record<string, unknown>;
|
|
||||||
for (const k of ["accepted", "rejected", "quarantined", "skipped"]) {
|
|
||||||
if (typeof s[k] !== "number") { errors.push(`stats.${k}: expected number`); ok = false; }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (typeof r.validation !== "object" || r.validation === null) {
|
|
||||||
errors.push("validation: expected object");
|
|
||||||
ok = false;
|
|
||||||
} else {
|
|
||||||
const v = r.validation as Record<string, unknown>;
|
|
||||||
if (typeof v.passed !== "boolean") {
|
|
||||||
errors.push("validation.passed: must be boolean (explicit, never inferred)");
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
if (!Array.isArray(v.errors)) { errors.push("validation.errors: expected array"); ok = false; }
|
|
||||||
if (!Array.isArray(v.warnings)) { errors.push("validation.warnings: expected array"); ok = false; }
|
|
||||||
if (Array.isArray(v.errors)) ok = requireStringArray(v.errors, "validation.errors", errors) && ok;
|
|
||||||
if (Array.isArray(v.warnings)) ok = requireStringArray(v.warnings, "validation.warnings", errors) && ok;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!ok) return { valid: false, errors };
|
|
||||||
return { valid: true, value: r as unknown as StageReceipt };
|
|
||||||
}
|
|
||||||
|
|
||||||
// Compute the canonical aggregate hash over a list of file refs.
|
|
||||||
// Sorted by path so order-of-iteration doesn't drift the hash.
|
|
||||||
// Each entry contributes "<path>|<sha256>|<record_count>" so two
|
|
||||||
// files with identical content but different paths produce distinct
|
|
||||||
// digests (real difference = real hash difference).
|
|
||||||
export async function aggregateIoHash(files: StageFileRef[]): Promise<string> {
|
|
||||||
const sorted = [...files].sort((a, b) => a.path.localeCompare(b.path));
|
|
||||||
const parts = sorted.map(f => `${f.path}|${f.sha256}|${f.record_count ?? 0}`);
|
|
||||||
const h = new Bun.CryptoHasher("sha256");
|
|
||||||
h.update(parts.join("\n"));
|
|
||||||
return h.digest("hex");
|
|
||||||
}
|
|
||||||
@@ -1,141 +0,0 @@
|
|||||||
// Shared types for distillation schemas. Hand-rolled validators (no Zod
|
|
||||||
// dependency) — bun:test runs them; runtime cost is one tiny function
|
|
||||||
// per record. Pattern: each schema exports `validate(x): ValidationResult`
|
|
||||||
// returning `{valid: true, value}` or `{valid: false, errors}`.
|
|
||||||
//
|
|
||||||
// Why hand-rolled: the auditor + scrum + observer pipelines emit JSONL
|
|
||||||
// rows in shapes that already work; we want to ENFORCE those shapes
|
|
||||||
// without adding a 100KB dependency or rewriting producers. The
|
|
||||||
// validators codify what we already produce.
|
|
||||||
//
|
|
||||||
// Naming: schemas live as nouns (`EvidenceRecord`), validators as
|
|
||||||
// `validate<Noun>`. Each schema file exports both the type and the
|
|
||||||
// validator.
|
|
||||||
|
|
||||||
export interface Provenance {
|
|
||||||
// Path to the JSONL or other source where this row came from. Always
|
|
||||||
// relative to /home/profit/lakehouse so receipts are reproducible
|
|
||||||
// across deploys with the same repo layout.
|
|
||||||
source_file: string;
|
|
||||||
|
|
||||||
// Optional byte offset / line number into the source file. Lets a
|
|
||||||
// future "open the source row" UI jump directly to the line. Some
|
|
||||||
// sources (single-row JSON files like _playbook_lessons/*.json) don't
|
|
||||||
// need this.
|
|
||||||
line_offset?: number;
|
|
||||||
|
|
||||||
// SHA-256 of the canonical JSON of the source row (sorted keys, no
|
|
||||||
// whitespace). This is the dedup key — running distillation twice on
|
|
||||||
// the same source produces identical sig_hash, so duplicates are
|
|
||||||
// detectable without full row comparison.
|
|
||||||
sig_hash: string;
|
|
||||||
|
|
||||||
// ISO 8601 of when this provenance link was recorded — usually the
|
|
||||||
// moment the unified Evidence Index ran. Distinct from the source
|
|
||||||
// row's own timestamp, which lives on the EvidenceRecord itself.
|
|
||||||
recorded_at: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returned by every schema validator. The shape is `{valid: true, value}`
|
|
||||||
// for success (so callers can use `value` with the right type narrowed)
|
|
||||||
// or `{valid: false, errors}` for failure (so callers can surface
|
|
||||||
// every error at once, not just the first).
|
|
||||||
export type ValidationResult<T> =
|
|
||||||
| { valid: true; value: T }
|
|
||||||
| { valid: false; errors: string[] };
|
|
||||||
|
|
||||||
// Standard helpers used by every schema. Centralized so naming +
|
|
||||||
// error message format stay consistent across schemas.
|
|
||||||
|
|
||||||
export function requireString(v: unknown, field: string, errors: string[]): v is string {
|
|
||||||
if (typeof v !== "string") {
|
|
||||||
errors.push(`${field}: expected string, got ${typeof v}`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
if (v.length === 0) {
|
|
||||||
errors.push(`${field}: must be non-empty`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function requireNumber(v: unknown, field: string, errors: string[]): v is number {
|
|
||||||
if (typeof v !== "number" || !Number.isFinite(v)) {
|
|
||||||
errors.push(`${field}: expected finite number, got ${typeof v}`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function requireIsoTimestamp(v: unknown, field: string, errors: string[]): v is string {
|
|
||||||
if (!requireString(v, field, errors)) return false;
|
|
||||||
// Permissive ISO 8601: YYYY-MM-DDTHH:MM:SS(.fraction)?(Z|±HH:MM)?
|
|
||||||
const re = /^\d{4}-\d{2}-\d{2}T\d{2}:\d{2}:\d{2}(?:\.\d+)?(?:Z|[+-]\d{2}:?\d{2})?$/;
|
|
||||||
if (!re.test(v as string)) {
|
|
||||||
errors.push(`${field}: not a valid ISO 8601 timestamp: ${(v as string).slice(0, 60)}`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function requireSha256(v: unknown, field: string, errors: string[]): v is string {
|
|
||||||
if (!requireString(v, field, errors)) return false;
|
|
||||||
if (!/^[0-9a-f]{64}$/.test(v as string)) {
|
|
||||||
errors.push(`${field}: not a valid hex sha256: ${(v as string).slice(0, 80)}`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function requireProvenance(v: unknown, field: string, errors: string[]): v is Provenance {
|
|
||||||
if (typeof v !== "object" || v === null) {
|
|
||||||
errors.push(`${field}: expected object, got ${v === null ? "null" : typeof v}`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
const p = v as Record<string, unknown>;
|
|
||||||
let ok = true;
|
|
||||||
ok = requireString(p.source_file, `${field}.source_file`, errors) && ok;
|
|
||||||
ok = requireSha256(p.sig_hash, `${field}.sig_hash`, errors) && ok;
|
|
||||||
ok = requireIsoTimestamp(p.recorded_at, `${field}.recorded_at`, errors) && ok;
|
|
||||||
if (p.line_offset !== undefined && typeof p.line_offset !== "number") {
|
|
||||||
errors.push(`${field}.line_offset: expected number when present`);
|
|
||||||
ok = false;
|
|
||||||
}
|
|
||||||
return ok;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function requireStringArray(v: unknown, field: string, errors: string[]): v is string[] {
|
|
||||||
if (!Array.isArray(v)) {
|
|
||||||
errors.push(`${field}: expected array, got ${typeof v}`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
for (let i = 0; i < v.length; i++) {
|
|
||||||
if (typeof v[i] !== "string") {
|
|
||||||
errors.push(`${field}[${i}]: expected string, got ${typeof v[i]}`);
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Compute the canonical sha256 used for sig_hash. Sorts keys so the
|
|
||||||
// hash is stable regardless of producer's serialization order. Uses
|
|
||||||
// Bun.CryptoHasher (sync, fast) rather than node:crypto — matches the
|
|
||||||
// rest of the auditor.
|
|
||||||
export async function canonicalSha256(obj: unknown): Promise<string> {
|
|
||||||
const ordered = orderKeys(obj);
|
|
||||||
const json = JSON.stringify(ordered);
|
|
||||||
const hasher = new Bun.CryptoHasher("sha256");
|
|
||||||
hasher.update(json);
|
|
||||||
return hasher.digest("hex");
|
|
||||||
}
|
|
||||||
|
|
||||||
function orderKeys(v: unknown): unknown {
|
|
||||||
if (v === null || typeof v !== "object") return v;
|
|
||||||
if (Array.isArray(v)) return v.map(orderKeys);
|
|
||||||
const out: Record<string, unknown> = {};
|
|
||||||
for (const k of Object.keys(v as object).sort()) {
|
|
||||||
out[k] = orderKeys((v as Record<string, unknown>)[k]);
|
|
||||||
}
|
|
||||||
return out;
|
|
||||||
}
|
|
||||||
@@ -1,72 +0,0 @@
|
|||||||
// Shared types for the claim-auditor. Every field exists for a reason;
|
|
||||||
// if something can't be verified from a check, it goes into `evidence`
|
|
||||||
// so the verdict is inspectable, not a black box.
|
|
||||||
|
|
||||||
export type CheckKind = "static" | "dynamic" | "inference" | "kb_query" | "kimi_architect";
|
|
||||||
|
|
||||||
export type Severity = "info" | "warn" | "block";
|
|
||||||
|
|
||||||
export interface Claim {
|
|
||||||
// Verbatim phrase that raised the claim — e.g. "Phase 38 shipped",
|
|
||||||
// "verified end-to-end", "works after restart". Used as the "what
|
|
||||||
// does the author assert" input to downstream checks.
|
|
||||||
text: string;
|
|
||||||
// Where it came from. `commit_sha` is the short hash; `location`
|
|
||||||
// is a file:line for in-diff claims, or "pr_body" / "commit_message".
|
|
||||||
commit_sha: string;
|
|
||||||
location: string;
|
|
||||||
// Heuristic rating of how strong the claim is. "green+tested"
|
|
||||||
// is strong; "should work" is weak. Drives sensitivity — stronger
|
|
||||||
// claims get harder-blocked on weak evidence.
|
|
||||||
//
|
|
||||||
// "empirical" is a separate class: runtime measurements like
|
|
||||||
// "N cloud calls" / "306s end-to-end" / "accepted on attempt N".
|
|
||||||
// These cannot be verified from a static diff — only from the test
|
|
||||||
// output that produced them. Inference skips diff-verification for
|
|
||||||
// empirical claims; they become info-level context unless a future
|
|
||||||
// runtime_evidence check contradicts them.
|
|
||||||
strength: "weak" | "moderate" | "strong" | "empirical";
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface Finding {
|
|
||||||
check: CheckKind;
|
|
||||||
severity: Severity;
|
|
||||||
claim_text?: string;
|
|
||||||
// Free-form short description: "field added but never read", "no
|
|
||||||
// test covers this code path", "cloud model says placeholder".
|
|
||||||
summary: string;
|
|
||||||
// Concrete evidence: file paths, line numbers, log excerpts, test
|
|
||||||
// output, cloud-model verdict. No handwaving.
|
|
||||||
evidence: string[];
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface Verdict {
|
|
||||||
pr_number: number;
|
|
||||||
head_sha: string;
|
|
||||||
audited_at: string;
|
|
||||||
overall: "approve" | "request_changes" | "block";
|
|
||||||
findings: Finding[];
|
|
||||||
// Real numbers that downstream policy can gate on. e.g. if the
|
|
||||||
// hybrid test produced latency numbers or token counts, they
|
|
||||||
// surface here so /auditor/history is queryable.
|
|
||||||
metrics: Record<string, number>;
|
|
||||||
// Short one-line justification for the `overall` verdict. What
|
|
||||||
// gets posted as the commit-status description in Gitea (max 140
|
|
||||||
// chars) must fit here.
|
|
||||||
one_liner: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface PrSnapshot {
|
|
||||||
number: number;
|
|
||||||
head_sha: string;
|
|
||||||
base_sha: string;
|
|
||||||
title: string;
|
|
||||||
body: string;
|
|
||||||
state: "open" | "closed" | "merged";
|
|
||||||
author: string;
|
|
||||||
// Array of commit messages in the PR (not diffs — those are
|
|
||||||
// fetched on-demand per-check).
|
|
||||||
commits: Array<{ sha: string; message: string; author: string }>;
|
|
||||||
// File paths touched by the PR, with lines-added / lines-removed.
|
|
||||||
files: Array<{ path: string; additions: number; deletions: number }>;
|
|
||||||
}
|
|
||||||
-127
@@ -1,127 +0,0 @@
|
|||||||
# Lakehouse PR-Bot
|
|
||||||
|
|
||||||
A local sub-agent that reads the PRD, asks a cloud model for a small change
|
|
||||||
proposal, applies it, runs tests, and opens a draft PR on Gitea. Manual-only
|
|
||||||
right now — no systemd, no cron. Run one cycle at a time and watch.
|
|
||||||
|
|
||||||
## Run one cycle
|
|
||||||
|
|
||||||
```bash
|
|
||||||
cd /home/profit/lakehouse
|
|
||||||
bun run bot/cycle.ts
|
|
||||||
```
|
|
||||||
|
|
||||||
Prerequisites:
|
|
||||||
- Working tree must be clean (`git status` shows nothing). The bot refuses on a dirty tree so its changes don't mix with in-flight work.
|
|
||||||
- Sidecar running on :3200, gateway on :3100, observer on :3800.
|
|
||||||
- At least one PRD line tagged `[bot-eligible]` (see below).
|
|
||||||
- Gitea PAT configured in `~/.git-credentials` (already set up).
|
|
||||||
|
|
||||||
## Tag a gap as bot-eligible
|
|
||||||
|
|
||||||
Add `[bot-eligible]` to any PRD line the bot is allowed to work on:
|
|
||||||
|
|
||||||
```md
|
|
||||||
- [ ] Add a unit test for parse_city_state covering "South Bend, IN" edge case [bot-eligible]
|
|
||||||
```
|
|
||||||
|
|
||||||
The bot scans `docs/PRD.md` for these tags. Each tagged line becomes a candidate.
|
|
||||||
Start small — one tag at a time — until you trust the loop.
|
|
||||||
|
|
||||||
## Stop it mid-cycle
|
|
||||||
|
|
||||||
Create the pause file:
|
|
||||||
|
|
||||||
```bash
|
|
||||||
touch /home/profit/lakehouse/bot.paused
|
|
||||||
```
|
|
||||||
|
|
||||||
The next `bot/cycle.ts` invocation exits immediately with `skipped_pause`.
|
|
||||||
(It does NOT kill a cycle already in-flight — use `Ctrl-C` or `pkill -f bot/cycle.ts` for that.)
|
|
||||||
|
|
||||||
## Budget
|
|
||||||
|
|
||||||
- **20 cloud calls/day, 160k tokens/day** (hard ceiling, see `bot/cost.ts`).
|
|
||||||
- Tracked in `data/_bot/cost-YYYY-MM-DD.json`.
|
|
||||||
- Resets at UTC midnight.
|
|
||||||
|
|
||||||
## Cycle outcomes
|
|
||||||
|
|
||||||
Every run writes a result to `data/_bot/cycles/{cycle_id}.json` and POSTs an event to the observer on :3800.
|
|
||||||
Possible outcomes:
|
|
||||||
|
|
||||||
| Outcome | Meaning |
|
|
||||||
|---|---|
|
|
||||||
| `ok` | PR opened |
|
|
||||||
| `cycle_noop` | proposal applied, every file was **identical to current content** (Mem0 NOOP); no test run, no PR |
|
|
||||||
| `skipped_pause` | pause file present |
|
|
||||||
| `skipped_cost` | daily budget exhausted |
|
|
||||||
| `skipped_policy` | `policy.shouldRunCycle` said no |
|
|
||||||
| `skipped_dirty_tree` | uncommitted changes present |
|
|
||||||
| `skipped_no_gap` | no `[bot-eligible]` tags in PRD |
|
|
||||||
| `model_failed` | sidecar/cloud model errored or returned unparseable JSON |
|
|
||||||
| `proposal_rejected` | `policy.scoreProposal` rejected it (size, path, etc.) |
|
|
||||||
| `apply_failed` | file write errored |
|
|
||||||
| `tests_failed` | cargo or bun test red |
|
|
||||||
| `pr_skipped_by_policy` | green tests, but `policy.shouldOpenPR` said no |
|
|
||||||
| `pr_failed` | Gitea API or git push errored |
|
|
||||||
|
|
||||||
## Mem0-aligned apply semantics
|
|
||||||
|
|
||||||
`apply.ts` categorizes every proposed file into one of three modes:
|
|
||||||
|
|
||||||
| Mode | Trigger | Action |
|
|
||||||
|---|---|---|
|
|
||||||
| **ADD** | `is_new: true` and file doesn't exist | Create the file |
|
|
||||||
| **UPDATE** | `is_new: false`, file exists, content **differs** from current | Overwrite |
|
|
||||||
| **NOOP** | `is_new: false`, file exists, content **matches** current exactly | Skip (no write, no diff) |
|
|
||||||
|
|
||||||
If every file in the proposal is NOOP, the cycle short-circuits to `cycle_noop` **before** running tests or opening a PR. Mismatched shapes (`is_new:true` but file exists, or `is_new:false` but file missing) become `apply_failed` — model state confusion is surfaced, not papered over.
|
|
||||||
|
|
||||||
PR bodies report the three counts separately so reviewers see what actually changed vs. what was confirmed identical.
|
|
||||||
|
|
||||||
## How the bot compounds over cycles
|
|
||||||
|
|
||||||
Every finished cycle persists a `CycleResult` to `data/_bot/cycles/{cycle_id}.json`. At the **start** of the next cycle, `bot/kb.ts::loadHistory(gap_id)` scans that directory, filters to prior cycles on the same gap, and returns the five most recent outcomes (`ok`, `tests_failed`, `proposal_rejected`, `cycle_noop`, etc.) with their reasons and touched files.
|
|
||||||
|
|
||||||
Those outcomes are summarized into a compact block and **injected into the cloud prompt** before asking for a new proposal. The model sees things like:
|
|
||||||
|
|
||||||
```
|
|
||||||
Prior attempts on this gap (3 most recent):
|
|
||||||
- 2026-04-22 03:15 UTC — tests_failed
|
|
||||||
reason: cargo test -p vectord::lance failed on field_type_coerce
|
|
||||||
- 2026-04-22 02:48 UTC — proposal_rejected
|
|
||||||
reason: touched forbidden path (docs/ADR-): docs/ADR-019-update.md
|
|
||||||
- 2026-04-22 01:23 UTC — ok PR: https://git.agentview.dev/profit/lakehouse/pulls/142
|
|
||||||
reason: PR #142 opened
|
|
||||||
|
|
||||||
Learn from these: build on what worked, avoid paths that failed.
|
|
||||||
```
|
|
||||||
|
|
||||||
This is the same compounding pattern `scenario.ts` uses via `kb.loadRecommendation` — the bot's cycles are the bot's memory. No embedding, no separate jsonl, no cross-run orchestration required. First cycle on a new gap skips the block cleanly.
|
|
||||||
|
|
||||||
The observer events POSTed on every cycle carry the same data, so `GET :3800/stats?source=bot` aggregates "% of bot cycles on similar gaps that landed a PR" without extra plumbing.
|
|
||||||
|
|
||||||
## Where YOU edit
|
|
||||||
|
|
||||||
`bot/policy.ts` — four small functions that define what the bot does. The rest
|
|
||||||
(`propose.ts`, `apply.ts`, `test.ts`, `pr.ts`, `cycle.ts`, `kb.ts`) is mechanical
|
|
||||||
orchestration — you shouldn't need to touch it unless a pipeline changes.
|
|
||||||
|
|
||||||
One policy upgrade the history opens up: in `shouldRunCycle`, you can now bail
|
|
||||||
out if the same gap has failed N times in a row. Example addition:
|
|
||||||
|
|
||||||
```ts
|
|
||||||
import { loadHistory, statsFor } from "./kb.ts";
|
|
||||||
// inside shouldRunCycle — but you'd need the gap, which is picked later.
|
|
||||||
// A more natural place is scoreProposal: if prior N failures on this
|
|
||||||
// gap's path+summary pattern, reject before testing.
|
|
||||||
```
|
|
||||||
|
|
||||||
## Hard-coded guardrails (not in policy — can't be disabled)
|
|
||||||
|
|
||||||
- Bot **never deletes files** (`apply.ts` has no delete path).
|
|
||||||
- Bot **never touches** `.git/`, `secrets`, `lakehouse.toml`, `docs/ADR-*`, `docs/DECISIONS.md`, `docs/PRD.md`, `/etc/`, `/root/`, `Cargo.lock`.
|
|
||||||
- All paths validated for traversal (`path/../`) and repo-escape.
|
|
||||||
- PRs always open as **draft** — never auto-merge.
|
|
||||||
- Budget check is before the policy function runs — no way to override the daily cap from `policy.ts`.
|
|
||||||
@@ -1,86 +0,0 @@
|
|||||||
// Apply a proposal to disk with Mem0-aligned ADD / UPDATE / NOOP
|
|
||||||
// semantics. Whole-file writes only — never deletes. All paths
|
|
||||||
// validated repo-relative + path-traversal-free.
|
|
||||||
//
|
|
||||||
// Three outcomes per file:
|
|
||||||
// ADD — file didn't exist, new content written (is_new must be true)
|
|
||||||
// UPDATE — file existed, content differs from current, overwritten
|
|
||||||
// NOOP — file existed, content identical to current, nothing written
|
|
||||||
//
|
|
||||||
// The NOOP case is important: a cloud proposal that "re-derives" an
|
|
||||||
// existing file shouldn't churn the repo or burn test cycles.
|
|
||||||
|
|
||||||
import { writeFile, readFile, mkdir, access } from "node:fs/promises";
|
|
||||||
import { dirname, resolve, relative } from "node:path";
|
|
||||||
import type { ApplyOutcome, Proposal } from "./types.ts";
|
|
||||||
|
|
||||||
const REPO_ROOT = "/home/profit/lakehouse";
|
|
||||||
|
|
||||||
export async function applyProposal(p: Proposal): Promise<ApplyOutcome> {
|
|
||||||
const added: string[] = [];
|
|
||||||
const updated: string[] = [];
|
|
||||||
const noop: string[] = [];
|
|
||||||
const errors: string[] = [];
|
|
||||||
|
|
||||||
for (const f of p.files) {
|
|
||||||
const err = validatePath(f.path);
|
|
||||||
if (err) {
|
|
||||||
errors.push(`${f.path}: ${err}`);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
const abs = resolve(REPO_ROOT, f.path);
|
|
||||||
try {
|
|
||||||
const exists = await fileExists(abs);
|
|
||||||
|
|
||||||
if (f.is_new && exists) {
|
|
||||||
errors.push(`${f.path}: is_new=true but file exists`);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
if (!f.is_new && !exists) {
|
|
||||||
// Proposal claims to update a file that doesn't exist.
|
|
||||||
// Refuse rather than silently ADD — model is confused about
|
|
||||||
// repo state, and we want that surfaced, not papered over.
|
|
||||||
errors.push(`${f.path}: is_new=false but file does not exist`);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!f.is_new) {
|
|
||||||
// UPDATE candidate — compare to detect NOOP.
|
|
||||||
const current = await readFile(abs, "utf8");
|
|
||||||
if (current === f.content) {
|
|
||||||
noop.push(f.path);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
await writeFile(abs, f.content);
|
|
||||||
updated.push(f.path);
|
|
||||||
} else {
|
|
||||||
// ADD — file doesn't exist yet.
|
|
||||||
await mkdir(dirname(abs), { recursive: true });
|
|
||||||
await writeFile(abs, f.content);
|
|
||||||
added.push(f.path);
|
|
||||||
}
|
|
||||||
} catch (e) {
|
|
||||||
errors.push(`${f.path}: ${(e as Error).message}`);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return { added, updated, noop, errors };
|
|
||||||
}
|
|
||||||
|
|
||||||
function validatePath(p: string): string | null {
|
|
||||||
if (!p) return "empty path";
|
|
||||||
if (p.startsWith("/")) return "must be repo-relative";
|
|
||||||
if (p.startsWith("..") || p.includes("/../")) return "path traversal";
|
|
||||||
const abs = resolve(REPO_ROOT, p);
|
|
||||||
const rel = relative(REPO_ROOT, abs);
|
|
||||||
if (rel.startsWith("..")) return "resolves outside repo";
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
|
|
||||||
async function fileExists(abs: string): Promise<boolean> {
|
|
||||||
try {
|
|
||||||
await access(abs);
|
|
||||||
return true;
|
|
||||||
} catch {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
-52
@@ -1,52 +0,0 @@
|
|||||||
// Daily cost tracker. Resets at UTC midnight by keying the file by date.
|
|
||||||
// Hard ceilings are the policy surface — the bot refuses to call the
|
|
||||||
// cloud once the budget is exhausted for the day.
|
|
||||||
|
|
||||||
import { readFile, writeFile, mkdir } from "node:fs/promises";
|
|
||||||
import { join } from "node:path";
|
|
||||||
import type { CostState } from "./types.ts";
|
|
||||||
|
|
||||||
const COST_DIR = "/home/profit/lakehouse/data/_bot";
|
|
||||||
|
|
||||||
export const DAILY_CALLS_BUDGET = 20;
|
|
||||||
export const DAILY_TOKENS_BUDGET = 8000 * DAILY_CALLS_BUDGET; // 160k tokens/day ceiling
|
|
||||||
|
|
||||||
function todayUtc(): string {
|
|
||||||
return new Date().toISOString().slice(0, 10);
|
|
||||||
}
|
|
||||||
|
|
||||||
function costFile(date: string): string {
|
|
||||||
return join(COST_DIR, `cost-${date}.json`);
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function readCost(): Promise<CostState> {
|
|
||||||
const date = todayUtc();
|
|
||||||
try {
|
|
||||||
const raw = await readFile(costFile(date), "utf8");
|
|
||||||
return JSON.parse(raw) as CostState;
|
|
||||||
} catch {
|
|
||||||
return { date, calls: 0, tokens: 0 };
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function recordCost(calls: number, tokens: number): Promise<CostState> {
|
|
||||||
await mkdir(COST_DIR, { recursive: true });
|
|
||||||
const current = await readCost();
|
|
||||||
const updated: CostState = {
|
|
||||||
date: current.date,
|
|
||||||
calls: current.calls + calls,
|
|
||||||
tokens: current.tokens + tokens,
|
|
||||||
};
|
|
||||||
await writeFile(costFile(updated.date), JSON.stringify(updated, null, 2));
|
|
||||||
return updated;
|
|
||||||
}
|
|
||||||
|
|
||||||
export function budgetCheck(c: CostState): { ok: boolean; reason: string } {
|
|
||||||
if (c.calls >= DAILY_CALLS_BUDGET) {
|
|
||||||
return { ok: false, reason: `daily call budget exhausted (${c.calls}/${DAILY_CALLS_BUDGET})` };
|
|
||||||
}
|
|
||||||
if (c.tokens >= DAILY_TOKENS_BUDGET) {
|
|
||||||
return { ok: false, reason: `daily token budget exhausted (${c.tokens}/${DAILY_TOKENS_BUDGET})` };
|
|
||||||
}
|
|
||||||
return { ok: true, reason: `${c.calls}/${DAILY_CALLS_BUDGET} calls, ${c.tokens}/${DAILY_TOKENS_BUDGET} tokens used today` };
|
|
||||||
}
|
|
||||||
-345
@@ -1,345 +0,0 @@
|
|||||||
// Single-cycle orchestrator. This is the manual entry point:
|
|
||||||
// bun run bot/cycle.ts
|
|
||||||
//
|
|
||||||
// Steps (each step can short-circuit with a clear outcome):
|
|
||||||
// 1. Pause-file check → skipped_pause
|
|
||||||
// 2. Cost budget check → skipped_cost
|
|
||||||
// 3. Gather CycleContext (dirty tree, last cycle, autotune status)
|
|
||||||
// 4. policy.shouldRunCycle → skipped_policy
|
|
||||||
// 5. findGaps + policy.pickGap → skipped_no_gap
|
|
||||||
// 6. generateProposal → model_failed
|
|
||||||
// 7. policy.scoreProposal → proposal_rejected
|
|
||||||
// 8. git checkout new branch
|
|
||||||
// 9. applyProposal → apply_failed
|
|
||||||
// 10. runTests → tests_failed
|
|
||||||
// 11. policy.shouldOpenPR → pr_skipped_by_policy
|
|
||||||
// 12. git commit + push
|
|
||||||
// 13. openPr → pr_failed / ok
|
|
||||||
// 14. recordCost + postEvent (every outcome)
|
|
||||||
// 15. write cycle result to data/_bot/cycles/{cycle_id}.json
|
|
||||||
|
|
||||||
import { readFile, writeFile, mkdir, access } from "node:fs/promises";
|
|
||||||
import { createHash, randomUUID } from "node:crypto";
|
|
||||||
import { spawnSync } from "node:child_process";
|
|
||||||
import { join } from "node:path";
|
|
||||||
|
|
||||||
import type { CycleContext, CycleResult, CycleOutcome, Proposal } from "./types.ts";
|
|
||||||
import * as policy from "./policy.ts";
|
|
||||||
import { readCost, recordCost, budgetCheck, DAILY_CALLS_BUDGET, DAILY_TOKENS_BUDGET } from "./cost.ts";
|
|
||||||
import { findGaps, generateProposal } from "./propose.ts";
|
|
||||||
import { applyProposal } from "./apply.ts";
|
|
||||||
import { runTests } from "./test.ts";
|
|
||||||
import { openPr } from "./pr.ts";
|
|
||||||
import { postEvent } from "./observer.ts";
|
|
||||||
import { loadHistory, summarizeHistory, statsFor } from "./kb.ts";
|
|
||||||
|
|
||||||
const REPO_ROOT = "/home/profit/lakehouse";
|
|
||||||
const PAUSE_FILE = `${REPO_ROOT}/bot.paused`;
|
|
||||||
const CYCLES_DIR = `${REPO_ROOT}/data/_bot/cycles`;
|
|
||||||
const GATEWAY_URL = process.env.LH_GATEWAY_URL ?? "http://localhost:3100";
|
|
||||||
|
|
||||||
function log(msg: string) { console.log(`[bot] ${msg}`); }
|
|
||||||
|
|
||||||
async function fileExists(p: string): Promise<boolean> {
|
|
||||||
try { await access(p); return true; } catch { return false; }
|
|
||||||
}
|
|
||||||
|
|
||||||
function git(args: string[]): { code: number; stdout: string; stderr: string } {
|
|
||||||
const r = spawnSync("git", args, { cwd: REPO_ROOT, encoding: "utf8" });
|
|
||||||
return { code: r.status ?? -1, stdout: r.stdout ?? "", stderr: r.stderr ?? "" };
|
|
||||||
}
|
|
||||||
|
|
||||||
async function gatherContext(cost: { calls: number; tokens: number }): Promise<CycleContext> {
|
|
||||||
// Last cycle: newest file in CYCLES_DIR.
|
|
||||||
let lastCycleAt: string | null = null;
|
|
||||||
let lastCycleGapId: string | null = null;
|
|
||||||
try {
|
|
||||||
const { readdir, stat } = await import("node:fs/promises");
|
|
||||||
const entries = await readdir(CYCLES_DIR).catch(() => [] as string[]);
|
|
||||||
let newestTs = 0;
|
|
||||||
let newestPath: string | null = null;
|
|
||||||
for (const e of entries) {
|
|
||||||
if (!e.endsWith(".json")) continue;
|
|
||||||
const p = join(CYCLES_DIR, e);
|
|
||||||
const s = await stat(p);
|
|
||||||
if (s.mtimeMs > newestTs) { newestTs = s.mtimeMs; newestPath = p; }
|
|
||||||
}
|
|
||||||
if (newestPath) {
|
|
||||||
const r = JSON.parse(await readFile(newestPath, "utf8")) as CycleResult;
|
|
||||||
lastCycleAt = r.started_at;
|
|
||||||
lastCycleGapId = r.gap?.id ?? null;
|
|
||||||
}
|
|
||||||
} catch {}
|
|
||||||
|
|
||||||
// Autotune status — if the agent is busy, skip this cycle to avoid
|
|
||||||
// contention on shared Ollama GPU memory.
|
|
||||||
let autotuneBusy = false;
|
|
||||||
try {
|
|
||||||
const r = await fetch(`${GATEWAY_URL}/vectors/agent/status`, { signal: AbortSignal.timeout(2000) });
|
|
||||||
if (r.ok) {
|
|
||||||
const j = await r.json() as any;
|
|
||||||
autotuneBusy = Boolean(j.running) && (j.queue_depth ?? 0) > 0;
|
|
||||||
}
|
|
||||||
} catch {}
|
|
||||||
|
|
||||||
// Dirty tree check.
|
|
||||||
const status = git(["status", "--porcelain"]);
|
|
||||||
const workingTreeDirty = status.code === 0 && status.stdout.trim().length > 0;
|
|
||||||
|
|
||||||
return {
|
|
||||||
startedAt: new Date().toISOString(),
|
|
||||||
dailyCallsUsed: cost.calls,
|
|
||||||
dailyCallsBudget: DAILY_CALLS_BUDGET,
|
|
||||||
dailyTokensUsed: cost.tokens,
|
|
||||||
dailyTokensBudget: DAILY_TOKENS_BUDGET,
|
|
||||||
lastCycleAt,
|
|
||||||
lastCycleGapId,
|
|
||||||
autotuneBusy,
|
|
||||||
workingTreeDirty,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
async function persistResult(res: CycleResult): Promise<void> {
|
|
||||||
await mkdir(CYCLES_DIR, { recursive: true });
|
|
||||||
await writeFile(join(CYCLES_DIR, `${res.cycle_id}.json`), JSON.stringify(res, null, 2));
|
|
||||||
}
|
|
||||||
|
|
||||||
function sigHash(gap_id: string | null, proposalSummary: string): string {
|
|
||||||
const h = createHash("sha256");
|
|
||||||
h.update(gap_id ?? "no-gap");
|
|
||||||
h.update("|");
|
|
||||||
h.update(proposalSummary);
|
|
||||||
return h.digest("hex").slice(0, 16);
|
|
||||||
}
|
|
||||||
|
|
||||||
function emit(res: CycleResult): Promise<void> {
|
|
||||||
return postEvent({
|
|
||||||
source: "bot",
|
|
||||||
cycle_id: res.cycle_id,
|
|
||||||
sig_hash: sigHash(res.gap?.id ?? null, res.proposal?.summary ?? ""),
|
|
||||||
event_kind: res.outcome,
|
|
||||||
ok: res.outcome === "ok",
|
|
||||||
staffer_id: res.proposal?.model_used,
|
|
||||||
turns: res.cloud_calls,
|
|
||||||
duration_ms: new Date(res.ended_at).getTime() - new Date(res.started_at).getTime(),
|
|
||||||
extra: {
|
|
||||||
reason: res.reason,
|
|
||||||
pr_url: res.prUrl,
|
|
||||||
files_added: res.filesAdded,
|
|
||||||
files_updated: res.filesUpdated,
|
|
||||||
files_noop: res.filesNoop,
|
|
||||||
tests_green: res.testsGreen,
|
|
||||||
},
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
async function main() {
|
|
||||||
const cycle_id = `bot-${new Date().toISOString().replace(/[:.]/g, "-")}-${randomUUID().slice(0, 8)}`;
|
|
||||||
const started_at = new Date().toISOString();
|
|
||||||
log(`cycle ${cycle_id} starting`);
|
|
||||||
|
|
||||||
const finish = async (outcome: CycleOutcome, reason: string, extra: Partial<CycleResult> = {}): Promise<CycleResult> => {
|
|
||||||
const res: CycleResult = {
|
|
||||||
cycle_id,
|
|
||||||
started_at,
|
|
||||||
ended_at: new Date().toISOString(),
|
|
||||||
outcome,
|
|
||||||
reason,
|
|
||||||
gap: null,
|
|
||||||
proposal: null,
|
|
||||||
filesAdded: [],
|
|
||||||
filesUpdated: [],
|
|
||||||
filesNoop: [],
|
|
||||||
testsGreen: null,
|
|
||||||
testsOutput: "",
|
|
||||||
prUrl: null,
|
|
||||||
tokens_used: 0,
|
|
||||||
cloud_calls: 0,
|
|
||||||
...extra,
|
|
||||||
};
|
|
||||||
await persistResult(res);
|
|
||||||
await emit(res);
|
|
||||||
log(`→ ${outcome}: ${reason}`);
|
|
||||||
return res;
|
|
||||||
};
|
|
||||||
|
|
||||||
// 1. Pause.
|
|
||||||
if (await fileExists(PAUSE_FILE)) {
|
|
||||||
return finish("skipped_pause", `pause file at ${PAUSE_FILE}`);
|
|
||||||
}
|
|
||||||
|
|
||||||
// 2. Cost.
|
|
||||||
const cost = await readCost();
|
|
||||||
const bc = budgetCheck(cost);
|
|
||||||
if (!bc.ok) return finish("skipped_cost", bc.reason);
|
|
||||||
log(`cost: ${bc.reason}`);
|
|
||||||
|
|
||||||
// 3+4. Context + policy.shouldRunCycle.
|
|
||||||
const ctx = await gatherContext(cost);
|
|
||||||
const srq = policy.shouldRunCycle(ctx);
|
|
||||||
if (!srq.run) {
|
|
||||||
return finish(ctx.workingTreeDirty ? "skipped_dirty_tree" : "skipped_policy", srq.reason);
|
|
||||||
}
|
|
||||||
|
|
||||||
// 5. Gaps + policy.pickGap.
|
|
||||||
const gaps = await findGaps();
|
|
||||||
log(`found ${gaps.length} [bot-eligible] gap(s) in PRD`);
|
|
||||||
const gapPick = policy.pickGap(gaps);
|
|
||||||
if (!gapPick.gap) return finish("skipped_no_gap", gapPick.reason);
|
|
||||||
const gap = gapPick.gap;
|
|
||||||
log(`picked gap ${gap.id}: "${gap.prd_line.slice(0, 80)}"`);
|
|
||||||
|
|
||||||
// 6. KB lookup + Proposal.
|
|
||||||
// Bot cycles compound: prior cycles on this gap inform the current
|
|
||||||
// proposal. Summary is a compact block injected into the cloud prompt
|
|
||||||
// so the model can build on past successes and steer around past
|
|
||||||
// failures. Empty string when this is the first cycle on this gap.
|
|
||||||
const history = await loadHistory(gap.id, 5);
|
|
||||||
const stats = statsFor(history);
|
|
||||||
if (history.length > 0) {
|
|
||||||
log(`kb: ${stats.attempts} prior cycle(s) — ${stats.pr_opened} pr / ${stats.tests_failed} tests_failed / ${stats.proposal_rejected} rejected / ${stats.noop} noop`);
|
|
||||||
} else {
|
|
||||||
log(`kb: first cycle on this gap`);
|
|
||||||
}
|
|
||||||
const historySummary = summarizeHistory(history);
|
|
||||||
|
|
||||||
let proposal: Proposal;
|
|
||||||
try {
|
|
||||||
proposal = await generateProposal(gap, historySummary);
|
|
||||||
log(`proposal: ${proposal.summary} (${proposal.files.length} files, ~${proposal.estimated_loc} LOC, ${proposal.tokens_used} tokens)`);
|
|
||||||
} catch (e) {
|
|
||||||
await recordCost(1, 0);
|
|
||||||
return finish("model_failed", (e as Error).message, { gap, cloud_calls: 1 });
|
|
||||||
}
|
|
||||||
await recordCost(1, proposal.tokens_used);
|
|
||||||
|
|
||||||
// 7. Score.
|
|
||||||
const score = policy.scoreProposal(proposal);
|
|
||||||
if (!score.accept) {
|
|
||||||
return finish("proposal_rejected", score.reason, { gap, proposal, tokens_used: proposal.tokens_used, cloud_calls: 1 });
|
|
||||||
}
|
|
||||||
log(`proposal accepted: ${score.reason}`);
|
|
||||||
|
|
||||||
// 8. Branch.
|
|
||||||
const dayStamp = new Date().toISOString().slice(0, 10).replace(/-/g, "");
|
|
||||||
const branch = `bot/cycle-${dayStamp}-${gap.id}`;
|
|
||||||
// Branch must be fresh. If one already exists from a prior failed cycle
|
|
||||||
// for the same gap, bail — don't silently overwrite or reuse stale state.
|
|
||||||
const check = git(["rev-parse", "--verify", `refs/heads/${branch}`]);
|
|
||||||
if (check.code === 0) {
|
|
||||||
return finish("apply_failed",
|
|
||||||
`branch ${branch} already exists — delete it manually if you want a fresh cycle for this gap`,
|
|
||||||
{ gap, proposal, tokens_used: proposal.tokens_used, cloud_calls: 1 });
|
|
||||||
}
|
|
||||||
const co = git(["checkout", "-b", branch]);
|
|
||||||
if (co.code !== 0) {
|
|
||||||
return finish("apply_failed", `git checkout -b failed: ${co.stderr}`,
|
|
||||||
{ gap, proposal, tokens_used: proposal.tokens_used, cloud_calls: 1 });
|
|
||||||
}
|
|
||||||
log(`on branch ${branch}`);
|
|
||||||
|
|
||||||
// 9. Apply — Mem0 ADD/UPDATE/NOOP semantics.
|
|
||||||
const ap = await applyProposal(proposal);
|
|
||||||
if (ap.errors.length > 0) {
|
|
||||||
git(["checkout", "main"]);
|
|
||||||
git(["branch", "-D", branch]);
|
|
||||||
return finish("apply_failed", ap.errors.join("; "),
|
|
||||||
{ gap, proposal, tokens_used: proposal.tokens_used, cloud_calls: 1 });
|
|
||||||
}
|
|
||||||
const changed = [...ap.added, ...ap.updated];
|
|
||||||
log(`apply: ${ap.added.length} add, ${ap.updated.length} update, ${ap.noop.length} noop`);
|
|
||||||
|
|
||||||
// Short-circuit: if every proposed file was identical to what's on
|
|
||||||
// disk, there's nothing to test or PR. Clean up the branch and exit.
|
|
||||||
if (changed.length === 0) {
|
|
||||||
git(["checkout", "main"]);
|
|
||||||
git(["branch", "-D", branch]);
|
|
||||||
return finish("cycle_noop",
|
|
||||||
`all ${proposal.files.length} proposed file(s) were identical to current state`,
|
|
||||||
{ gap, proposal, filesNoop: ap.noop,
|
|
||||||
tokens_used: proposal.tokens_used, cloud_calls: 1 });
|
|
||||||
}
|
|
||||||
|
|
||||||
// 10. Test.
|
|
||||||
log(`running tests (this will take a while)...`);
|
|
||||||
const testRes = await runTests();
|
|
||||||
if (!testRes.green) {
|
|
||||||
git(["checkout", "."]);
|
|
||||||
git(["checkout", "main"]);
|
|
||||||
git(["branch", "-D", branch]);
|
|
||||||
return finish("tests_failed", "cargo or bun test failed", {
|
|
||||||
gap, proposal,
|
|
||||||
filesAdded: ap.added, filesUpdated: ap.updated, filesNoop: ap.noop,
|
|
||||||
testsGreen: false, testsOutput: testRes.output,
|
|
||||||
tokens_used: proposal.tokens_used, cloud_calls: 1,
|
|
||||||
});
|
|
||||||
}
|
|
||||||
log(`tests green`);
|
|
||||||
|
|
||||||
// 11. PR gate.
|
|
||||||
const partial: CycleResult = {
|
|
||||||
cycle_id, started_at,
|
|
||||||
ended_at: new Date().toISOString(),
|
|
||||||
outcome: "ok", reason: "",
|
|
||||||
gap, proposal,
|
|
||||||
filesAdded: ap.added, filesUpdated: ap.updated, filesNoop: ap.noop,
|
|
||||||
testsGreen: true, testsOutput: testRes.output,
|
|
||||||
prUrl: null, tokens_used: proposal.tokens_used, cloud_calls: 1,
|
|
||||||
};
|
|
||||||
const prGate = policy.shouldOpenPR(partial);
|
|
||||||
if (!prGate.open) {
|
|
||||||
git(["checkout", "main"]);
|
|
||||||
git(["branch", "-D", branch]);
|
|
||||||
return finish("pr_skipped_by_policy", prGate.reason, partial);
|
|
||||||
}
|
|
||||||
|
|
||||||
// 12. Commit + push.
|
|
||||||
git(["add", ...changed]);
|
|
||||||
const commitMsg = [
|
|
||||||
`bot: ${proposal.summary}`,
|
|
||||||
"",
|
|
||||||
proposal.rationale,
|
|
||||||
"",
|
|
||||||
`PRD gap: ${gap.prd_line}`,
|
|
||||||
`Cycle: ${cycle_id}`,
|
|
||||||
"",
|
|
||||||
`Co-Authored-By: ${proposal.model_used} (cloud) <bot@lakehouse.local>`,
|
|
||||||
].join("\n");
|
|
||||||
const ci = git(["commit", "-m", commitMsg]);
|
|
||||||
if (ci.code !== 0) {
|
|
||||||
return finish("pr_failed", `git commit failed: ${ci.stderr}`, partial);
|
|
||||||
}
|
|
||||||
const ps = git(["push", "-u", "origin", branch]);
|
|
||||||
if (ps.code !== 0) {
|
|
||||||
return finish("pr_failed", `git push failed: ${ps.stderr}`, partial);
|
|
||||||
}
|
|
||||||
|
|
||||||
// 13. Open PR.
|
|
||||||
try {
|
|
||||||
const pr = await openPr({
|
|
||||||
branch,
|
|
||||||
title: `bot: ${proposal.summary}`,
|
|
||||||
body: [
|
|
||||||
`**Gap** (PRD line ${gap.line_number}): ${gap.prd_line}`,
|
|
||||||
"",
|
|
||||||
`**Rationale**`,
|
|
||||||
proposal.rationale,
|
|
||||||
"",
|
|
||||||
`**Cycle**: \`${cycle_id}\``,
|
|
||||||
`**Model**: \`${proposal.model_used}\``,
|
|
||||||
`**Tokens**: ${proposal.tokens_used}`,
|
|
||||||
`**Added**: ${ap.added.map(f => `\`${f}\``).join(", ") || "_none_"}`,
|
|
||||||
`**Updated**: ${ap.updated.map(f => `\`${f}\``).join(", ") || "_none_"}`,
|
|
||||||
ap.noop.length > 0 ? `**NOOP (identical to current)**: ${ap.noop.map(f => `\`${f}\``).join(", ")}` : "",
|
|
||||||
].join("\n"),
|
|
||||||
});
|
|
||||||
return finish("ok", `PR #${pr.number} opened`, { ...partial, prUrl: pr.html_url });
|
|
||||||
} catch (e) {
|
|
||||||
return finish("pr_failed", (e as Error).message, partial);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
main().catch(e => {
|
|
||||||
console.error("[bot] fatal:", e);
|
|
||||||
process.exit(1);
|
|
||||||
});
|
|
||||||
@@ -1,101 +0,0 @@
|
|||||||
// Bot-local knowledge base. Every finished cycle already persists a
|
|
||||||
// CycleResult to data/_bot/cycles/{id}.json — that IS the outcome log.
|
|
||||||
// KB here just reads that dir, filters to prior cycles on the same gap,
|
|
||||||
// and produces a short summary the cloud model can condition on.
|
|
||||||
//
|
|
||||||
// No separate jsonl, no new write path, no embedding calls. The bot's
|
|
||||||
// "memory" is the same primary artifact that the observer consumes.
|
|
||||||
//
|
|
||||||
// Future: embedding-based neighbor matching across gaps (cheap once
|
|
||||||
// sidecar is local), cross-pollination with scenario KB's
|
|
||||||
// pathway_recommendations. Not required for the feedback loop to work
|
|
||||||
// on a single gap — that's the floor we're building first.
|
|
||||||
|
|
||||||
import { readdir, readFile } from "node:fs/promises";
|
|
||||||
import { join } from "node:path";
|
|
||||||
import type { CycleResult } from "./types.ts";
|
|
||||||
|
|
||||||
const CYCLES_DIR = "/home/profit/lakehouse/data/_bot/cycles";
|
|
||||||
|
|
||||||
export interface HistoryEntry {
|
|
||||||
cycle_id: string;
|
|
||||||
ended_at: string;
|
|
||||||
outcome: string;
|
|
||||||
reason: string;
|
|
||||||
pr_url: string | null;
|
|
||||||
tests_green: boolean | null;
|
|
||||||
files_added: string[];
|
|
||||||
files_updated: string[];
|
|
||||||
tokens_used: number;
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function loadHistory(gap_id: string, max: number = 5): Promise<HistoryEntry[]> {
|
|
||||||
let entries: string[] = [];
|
|
||||||
try {
|
|
||||||
entries = await readdir(CYCLES_DIR);
|
|
||||||
} catch {
|
|
||||||
return [];
|
|
||||||
}
|
|
||||||
const matches: HistoryEntry[] = [];
|
|
||||||
for (const e of entries) {
|
|
||||||
if (!e.endsWith(".json")) continue;
|
|
||||||
try {
|
|
||||||
const raw = await readFile(join(CYCLES_DIR, e), "utf8");
|
|
||||||
const r = JSON.parse(raw) as CycleResult;
|
|
||||||
if (r.gap?.id !== gap_id) continue;
|
|
||||||
matches.push({
|
|
||||||
cycle_id: r.cycle_id,
|
|
||||||
ended_at: r.ended_at,
|
|
||||||
outcome: r.outcome,
|
|
||||||
reason: r.reason,
|
|
||||||
pr_url: r.prUrl,
|
|
||||||
tests_green: r.testsGreen,
|
|
||||||
files_added: r.filesAdded ?? [],
|
|
||||||
files_updated: r.filesUpdated ?? [],
|
|
||||||
tokens_used: r.tokens_used,
|
|
||||||
});
|
|
||||||
} catch {
|
|
||||||
// Skip unreadable / malformed cycle files. Don't fail the current
|
|
||||||
// cycle because an old one is corrupt.
|
|
||||||
}
|
|
||||||
}
|
|
||||||
matches.sort((a, b) => b.ended_at.localeCompare(a.ended_at));
|
|
||||||
return matches.slice(0, max);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Compact prompt-ready summary. Empty string when there's no history —
|
|
||||||
// caller can skip the "prior attempts" block entirely.
|
|
||||||
export function summarizeHistory(h: HistoryEntry[]): string {
|
|
||||||
if (h.length === 0) return "";
|
|
||||||
const lines = h.map(e => {
|
|
||||||
const when = e.ended_at.slice(0, 16).replace("T", " ");
|
|
||||||
const files = [...e.files_added, ...e.files_updated];
|
|
||||||
const filesStr = files.length > 0 ? ` touched: ${files.join(", ")}` : "";
|
|
||||||
const prStr = e.pr_url ? ` PR: ${e.pr_url}` : "";
|
|
||||||
return `- ${when} UTC — ${e.outcome}${prStr}${filesStr}\n reason: ${e.reason}`;
|
|
||||||
});
|
|
||||||
return [
|
|
||||||
`Prior attempts on this gap (${h.length} most recent):`,
|
|
||||||
...lines,
|
|
||||||
"",
|
|
||||||
"Learn from these: build on what worked, avoid paths that failed.",
|
|
||||||
].join("\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
// Aggregate stats for telemetry — lets the bot expose "% of cycles on
|
|
||||||
// this gap that landed a PR" without re-parsing the raw history.
|
|
||||||
export function statsFor(h: HistoryEntry[]): {
|
|
||||||
attempts: number;
|
|
||||||
pr_opened: number;
|
|
||||||
tests_failed: number;
|
|
||||||
proposal_rejected: number;
|
|
||||||
noop: number;
|
|
||||||
} {
|
|
||||||
return {
|
|
||||||
attempts: h.length,
|
|
||||||
pr_opened: h.filter(e => e.outcome === "ok").length,
|
|
||||||
tests_failed: h.filter(e => e.outcome === "tests_failed").length,
|
|
||||||
proposal_rejected: h.filter(e => e.outcome === "proposal_rejected").length,
|
|
||||||
noop: h.filter(e => e.outcome === "cycle_noop").length,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
@@ -1,34 +0,0 @@
|
|||||||
// POST bot cycle outcomes to the observer on :3800 so they accumulate
|
|
||||||
// in the KB alongside scenario + autotune events. Non-fatal on failure:
|
|
||||||
// the cycle result is also written to disk so observability isn't a
|
|
||||||
// single point of failure.
|
|
||||||
|
|
||||||
const OBSERVER_URL = process.env.LH_OBSERVER_URL ?? "http://localhost:3800";
|
|
||||||
|
|
||||||
export interface BotObserverEvent {
|
|
||||||
source: "bot";
|
|
||||||
cycle_id: string;
|
|
||||||
sig_hash: string; // stable hash of the gap + proposal for dedup
|
|
||||||
event_kind: string; // cycle outcome (ok, tests_failed, ...)
|
|
||||||
ok: boolean;
|
|
||||||
staffer_id?: string; // the model used, e.g. "gpt-oss:120b"
|
|
||||||
turns?: number; // number of cloud calls this cycle
|
|
||||||
duration_ms?: number;
|
|
||||||
extra?: Record<string, any>;
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function postEvent(ev: BotObserverEvent): Promise<void> {
|
|
||||||
try {
|
|
||||||
const r = await fetch(`${OBSERVER_URL}/event`, {
|
|
||||||
method: "POST",
|
|
||||||
headers: { "content-type": "application/json" },
|
|
||||||
body: JSON.stringify(ev),
|
|
||||||
signal: AbortSignal.timeout(3000),
|
|
||||||
});
|
|
||||||
if (!r.ok) {
|
|
||||||
console.error(`[bot/observer] ${r.status}: ${await r.text()}`);
|
|
||||||
}
|
|
||||||
} catch (e) {
|
|
||||||
console.error(`[bot/observer] POST failed: ${(e as Error).message}`);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,70 +0,0 @@
|
|||||||
// ═══════════════════════════════════════════════════════════════════
|
|
||||||
// YOU WRITE THIS FILE. These four functions shape the bot's entire
|
|
||||||
// behavior. Defaults below are safe and intentionally conservative —
|
|
||||||
// redline to taste. Each function is ~5-10 lines.
|
|
||||||
// ═══════════════════════════════════════════════════════════════════
|
|
||||||
|
|
||||||
import type { CycleContext, CycleResult, Gap, Proposal } from "./types.ts";
|
|
||||||
|
|
||||||
// Should this cycle even fire right now?
|
|
||||||
// Called AFTER the pause-file check + cost-cap check have already passed.
|
|
||||||
// Use this for judgment calls (cooldown, shared-resource conflicts).
|
|
||||||
export function shouldRunCycle(ctx: CycleContext): { run: boolean; reason: string } {
|
|
||||||
if (ctx.workingTreeDirty) {
|
|
||||||
return { run: false, reason: "dirty working tree — commit or stash your work first" };
|
|
||||||
}
|
|
||||||
if (ctx.lastCycleAt) {
|
|
||||||
const minsAgo = (Date.now() - new Date(ctx.lastCycleAt).getTime()) / 60000;
|
|
||||||
if (minsAgo < 10) return { run: false, reason: `last cycle ${minsAgo.toFixed(1)}min ago (<10min cooldown)` };
|
|
||||||
}
|
|
||||||
if (ctx.autotuneBusy) {
|
|
||||||
return { run: false, reason: "autotune agent is running — avoid Ollama contention" };
|
|
||||||
}
|
|
||||||
return { run: true, reason: "ready" };
|
|
||||||
}
|
|
||||||
|
|
||||||
// Which [bot-eligible] gap from the PRD does this cycle attack?
|
|
||||||
// Default: first in document order. Alternatives: random for exploration,
|
|
||||||
// smallest-context, tag-priority (e.g. [bot-eligible:high] wins).
|
|
||||||
export function pickGap(gaps: Gap[]): { gap: Gap | null; reason: string } {
|
|
||||||
if (gaps.length === 0) return { gap: null, reason: "no [bot-eligible] gaps in PRD" };
|
|
||||||
return { gap: gaps[0], reason: "first eligible gap in document order" };
|
|
||||||
}
|
|
||||||
|
|
||||||
// Cheap gate BEFORE burning test cycles. Reject if proposal smells wrong.
|
|
||||||
// This catches runaway cloud proposals before we apply+test them.
|
|
||||||
export function scoreProposal(p: Proposal): { accept: boolean; reason: string } {
|
|
||||||
if (p.files.length === 0) return { accept: false, reason: "empty proposal" };
|
|
||||||
if (p.files.length > 5) return { accept: false, reason: `>5 files (${p.files.length})` };
|
|
||||||
if (p.estimated_loc > 200) return { accept: false, reason: `>200 LOC (${p.estimated_loc})` };
|
|
||||||
|
|
||||||
// Paths the bot is NEVER allowed to touch. Extend cautiously.
|
|
||||||
const forbidden = [
|
|
||||||
".git/", "secrets", "lakehouse.toml",
|
|
||||||
"docs/ADR-", "docs/DECISIONS.md", "docs/PRD.md",
|
|
||||||
"/etc/", "/root/", "Cargo.lock",
|
|
||||||
];
|
|
||||||
for (const f of p.files) {
|
|
||||||
const hit = forbidden.find(prefix => f.path.includes(prefix));
|
|
||||||
if (hit) return { accept: false, reason: `touches forbidden path (${hit}): ${f.path}` };
|
|
||||||
}
|
|
||||||
return { accept: true, reason: "passes size + path filters" };
|
|
||||||
}
|
|
||||||
|
|
||||||
// Tests are green and changes applied. Do we actually open a PR?
|
|
||||||
// Mem0-aligned: the cycle already short-circuited with `cycle_noop` if
|
|
||||||
// every file was identical to current state, so by the time we're here
|
|
||||||
// at least one file was actually added or updated.
|
|
||||||
//
|
|
||||||
// Stricter options below — uncomment to require a test file touched, etc.
|
|
||||||
export function shouldOpenPR(c: CycleResult): { open: boolean; reason: string } {
|
|
||||||
if (!c.testsGreen) return { open: false, reason: "tests red" };
|
|
||||||
const realChanges = c.filesAdded.length + c.filesUpdated.length;
|
|
||||||
if (realChanges === 0) return { open: false, reason: "nothing actually changed on disk" };
|
|
||||||
|
|
||||||
// Stricter option — require at least one test file in the diff:
|
|
||||||
// const hasTest = [...c.filesAdded, ...c.filesUpdated].some(f => /test|_tests/i.test(f));
|
|
||||||
// if (!hasTest) return { open: false, reason: "no test file touched" };
|
|
||||||
|
|
||||||
return { open: true, reason: `green + ${c.filesAdded.length} add / ${c.filesUpdated.length} update` };
|
|
||||||
}
|
|
||||||
@@ -1,58 +0,0 @@
|
|||||||
// Gitea PR open. Reads PAT from ~/.git-credentials (set up by the
|
|
||||||
// credential-helper flow). All PRs open as DRAFT so J reviews before
|
|
||||||
// merge — never auto-merge.
|
|
||||||
|
|
||||||
import { readFile } from "node:fs/promises";
|
|
||||||
|
|
||||||
const GITEA_HOST = "https://git.agentview.dev";
|
|
||||||
const REPO_OWNER = "profit";
|
|
||||||
const REPO_NAME = "lakehouse";
|
|
||||||
const CRED_FILE = "/home/profit/.git-credentials";
|
|
||||||
|
|
||||||
async function readPat(): Promise<string> {
|
|
||||||
const raw = await readFile(CRED_FILE, "utf8");
|
|
||||||
for (const line of raw.split("\n")) {
|
|
||||||
const m = line.match(/^https:\/\/[^:]+:([^@]+)@git\.agentview\.dev/);
|
|
||||||
if (m) return m[1];
|
|
||||||
}
|
|
||||||
throw new Error(`no Gitea PAT found in ${CRED_FILE}`);
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface OpenPrInput {
|
|
||||||
branch: string; // head branch (just pushed)
|
|
||||||
base?: string; // default "main"
|
|
||||||
title: string;
|
|
||||||
body: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface OpenPrResult {
|
|
||||||
number: number;
|
|
||||||
html_url: string;
|
|
||||||
}
|
|
||||||
|
|
||||||
export async function openPr(input: OpenPrInput): Promise<OpenPrResult> {
|
|
||||||
const pat = await readPat();
|
|
||||||
const url = `${GITEA_HOST}/api/v1/repos/${REPO_OWNER}/${REPO_NAME}/pulls`;
|
|
||||||
const payload = {
|
|
||||||
title: input.title,
|
|
||||||
body: input.body,
|
|
||||||
head: input.branch,
|
|
||||||
base: input.base ?? "main",
|
|
||||||
// Gitea uses "draft" flag — always on for bot PRs.
|
|
||||||
draft: true,
|
|
||||||
};
|
|
||||||
const r = await fetch(url, {
|
|
||||||
method: "POST",
|
|
||||||
headers: {
|
|
||||||
"content-type": "application/json",
|
|
||||||
"Authorization": `token ${pat}`,
|
|
||||||
},
|
|
||||||
body: JSON.stringify(payload),
|
|
||||||
signal: AbortSignal.timeout(30000),
|
|
||||||
});
|
|
||||||
if (!r.ok) {
|
|
||||||
throw new Error(`Gitea ${r.status}: ${await r.text()}`);
|
|
||||||
}
|
|
||||||
const j = await r.json() as any;
|
|
||||||
return { number: j.number, html_url: j.html_url };
|
|
||||||
}
|
|
||||||
-151
@@ -1,151 +0,0 @@
|
|||||||
// Gap detection + cloud proposal.
|
|
||||||
//
|
|
||||||
// Gap detection: scan docs/PRD.md for lines tagged [bot-eligible].
|
|
||||||
// Each match becomes a Gap with surrounding context.
|
|
||||||
//
|
|
||||||
// Proposal: one-shot call to the T3 cloud model via the Python sidecar's
|
|
||||||
// /generate endpoint. Asks for a structured JSON response with file
|
|
||||||
// contents. Truncation-resistant via Phase 21's generate_continuable —
|
|
||||||
// for now we pass max_tokens high and rely on the model completing in
|
|
||||||
// one pass; swap to the Rust continuation wrapper if we see truncation.
|
|
||||||
|
|
||||||
import { readFile } from "node:fs/promises";
|
|
||||||
import { createHash } from "node:crypto";
|
|
||||||
import type { Gap, Proposal } from "./types.ts";
|
|
||||||
|
|
||||||
// Phase 44 migration (2026-04-27): bot/propose.ts now flows through
|
|
||||||
// the gateway's /v1/chat instead of hitting the sidecar's /generate
|
|
||||||
// directly. /v1/usage tracks the call, Langfuse traces it, observer
|
|
||||||
// sees it. Gateway owns the routing.
|
|
||||||
//
|
|
||||||
// 2026-04-28: gpt-oss:120b → deepseek-v3.2 via Ollama Pro. Newer
|
|
||||||
// DeepSeek revision, faster, still on the same OLLAMA_CLOUD_KEY.
|
|
||||||
const GATEWAY_URL = process.env.LH_GATEWAY_URL ?? "http://localhost:3100";
|
|
||||||
const REPO_ROOT = "/home/profit/lakehouse";
|
|
||||||
const PRD_PATH = `${REPO_ROOT}/docs/PRD.md`;
|
|
||||||
const CLOUD_MODEL = process.env.LH_BOT_MODEL ?? "deepseek-v3.2";
|
|
||||||
const MAX_TOKENS = 6000;
|
|
||||||
|
|
||||||
export async function findGaps(): Promise<Gap[]> {
|
|
||||||
const prd = await readFile(PRD_PATH, "utf8");
|
|
||||||
const lines = prd.split("\n");
|
|
||||||
const gaps: Gap[] = [];
|
|
||||||
for (let i = 0; i < lines.length; i++) {
|
|
||||||
if (!lines[i].includes("[bot-eligible]")) continue;
|
|
||||||
const contextLines = lines.slice(i, Math.min(i + 6, lines.length)).join("\n");
|
|
||||||
const id = createHash("sha256").update(lines[i]).digest("hex").slice(0, 12);
|
|
||||||
gaps.push({
|
|
||||||
id,
|
|
||||||
prd_line: lines[i].trim(),
|
|
||||||
context: contextLines,
|
|
||||||
source_file: "docs/PRD.md",
|
|
||||||
line_number: i + 1,
|
|
||||||
});
|
|
||||||
}
|
|
||||||
return gaps;
|
|
||||||
}
|
|
||||||
|
|
||||||
const SYSTEM_PROMPT = `You are an assistant that proposes small, testable code changes to the Lakehouse repo.
|
|
||||||
The Lakehouse is a Rust-first data platform with 13 crates + Bun/TypeScript test harness.
|
|
||||||
You will be given one PRD gap tagged [bot-eligible] and must respond with a STRICT JSON object — no prose.
|
|
||||||
|
|
||||||
Rules:
|
|
||||||
- Response MUST be a single JSON object, no markdown fences, no commentary.
|
|
||||||
- Change MUST be small: <200 lines total, ≤5 files.
|
|
||||||
- Include at least one test file (new or modified) that proves the change.
|
|
||||||
- NEVER touch .git/, secrets, lakehouse.toml, docs/ADR-*, docs/DECISIONS.md, docs/PRD.md, /etc/, /root/, Cargo.lock.
|
|
||||||
- Paths MUST be repo-relative (no leading /).
|
|
||||||
- Whole-file contents only — no patches, no diffs.
|
|
||||||
|
|
||||||
Response shape:
|
|
||||||
{
|
|
||||||
"summary": "one line",
|
|
||||||
"rationale": "why this addresses the gap",
|
|
||||||
"files": [ { "path": "crates/foo/src/bar.rs", "content": "<full file>", "is_new": false } ],
|
|
||||||
"estimated_loc": 42
|
|
||||||
}`;
|
|
||||||
|
|
||||||
export async function generateProposal(gap: Gap, historySummary: string = ""): Promise<Proposal> {
|
|
||||||
const sections = [
|
|
||||||
`PRD gap (line ${gap.line_number}):`,
|
|
||||||
"```",
|
|
||||||
gap.context,
|
|
||||||
"```",
|
|
||||||
"",
|
|
||||||
];
|
|
||||||
if (historySummary) {
|
|
||||||
sections.push(historySummary, "");
|
|
||||||
}
|
|
||||||
sections.push("Propose a small change that addresses this gap. Respond with the JSON object only.");
|
|
||||||
const userPrompt = sections.join("\n");
|
|
||||||
|
|
||||||
const r = await fetch(`${GATEWAY_URL}/v1/chat`, {
|
|
||||||
method: "POST",
|
|
||||||
headers: { "content-type": "application/json" },
|
|
||||||
body: JSON.stringify({
|
|
||||||
model: CLOUD_MODEL,
|
|
||||||
provider: "ollama_cloud",
|
|
||||||
messages: [
|
|
||||||
{ role: "system", content: SYSTEM_PROMPT },
|
|
||||||
{ role: "user", content: userPrompt },
|
|
||||||
],
|
|
||||||
temperature: 0.2,
|
|
||||||
max_tokens: MAX_TOKENS,
|
|
||||||
think: false,
|
|
||||||
}),
|
|
||||||
signal: AbortSignal.timeout(180000), // cloud T3 can be slow — 3 min
|
|
||||||
});
|
|
||||||
if (!r.ok) {
|
|
||||||
throw new Error(`gateway /v1/chat ${r.status}: ${await r.text()}`);
|
|
||||||
}
|
|
||||||
const j = await r.json() as any;
|
|
||||||
const raw: string = j?.choices?.[0]?.message?.content ?? "";
|
|
||||||
const usage = j.usage ?? {};
|
|
||||||
const tokens = (usage.prompt_tokens ?? 0) + (usage.completion_tokens ?? 0);
|
|
||||||
|
|
||||||
const parsed = extractJson(raw);
|
|
||||||
if (!parsed || typeof parsed !== "object") {
|
|
||||||
throw new Error(`model returned no JSON object. Raw head: ${raw.slice(0, 300)}`);
|
|
||||||
}
|
|
||||||
if (!Array.isArray(parsed.files)) {
|
|
||||||
throw new Error(`proposal.files not an array: ${JSON.stringify(parsed).slice(0, 200)}`);
|
|
||||||
}
|
|
||||||
|
|
||||||
return {
|
|
||||||
summary: String(parsed.summary ?? "").trim(),
|
|
||||||
rationale: String(parsed.rationale ?? "").trim(),
|
|
||||||
files: parsed.files.map((f: any) => ({
|
|
||||||
path: String(f.path ?? ""),
|
|
||||||
content: String(f.content ?? ""),
|
|
||||||
is_new: Boolean(f.is_new),
|
|
||||||
})).filter((f: any) => f.path && f.content !== undefined),
|
|
||||||
estimated_loc: Number(parsed.estimated_loc ?? 0),
|
|
||||||
model_used: CLOUD_MODEL,
|
|
||||||
tokens_used: tokens,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
// Find the first balanced JSON object in the string. Tolerates leading
|
|
||||||
// "```json" fences even though we asked the model not to emit them.
|
|
||||||
function extractJson(text: string): any | null {
|
|
||||||
const cleaned = text.replace(/^```(?:json)?\s*/i, "").replace(/```\s*$/i, "").trim();
|
|
||||||
let depth = 0;
|
|
||||||
let start = -1;
|
|
||||||
for (let i = 0; i < cleaned.length; i++) {
|
|
||||||
const c = cleaned[i];
|
|
||||||
if (c === "{") {
|
|
||||||
if (depth === 0) start = i;
|
|
||||||
depth++;
|
|
||||||
} else if (c === "}") {
|
|
||||||
depth--;
|
|
||||||
if (depth === 0 && start >= 0) {
|
|
||||||
try {
|
|
||||||
return JSON.parse(cleaned.slice(start, i + 1));
|
|
||||||
} catch {
|
|
||||||
start = -1;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
-46
@@ -1,46 +0,0 @@
|
|||||||
// Run the test gate: `cargo test --workspace` + `bun test`.
|
|
||||||
// Returns { green, output } — output is last ~4KB of combined stdout/stderr.
|
|
||||||
|
|
||||||
import { spawn } from "node:child_process";
|
|
||||||
|
|
||||||
const REPO_ROOT = "/home/profit/lakehouse";
|
|
||||||
const TEST_TIMEOUT_MS = 15 * 60 * 1000; // 15 min cargo + 2 min bun, generous
|
|
||||||
|
|
||||||
export async function runTests(): Promise<{ green: boolean; output: string }> {
|
|
||||||
const cargoOut = await runCmd("cargo", ["test", "--workspace", "--quiet", "--", "--test-threads=1"], REPO_ROOT, TEST_TIMEOUT_MS);
|
|
||||||
if (cargoOut.code !== 0) {
|
|
||||||
return { green: false, output: tail(`cargo test (${cargoOut.code}):\n${cargoOut.combined}`) };
|
|
||||||
}
|
|
||||||
|
|
||||||
const bunOut = await runCmd("bun", ["test", "tests/multi-agent"], REPO_ROOT, 120000);
|
|
||||||
const bunGreen = bunOut.code === 0;
|
|
||||||
const combined = [
|
|
||||||
`cargo test: OK`,
|
|
||||||
`bun test (${bunOut.code}):`,
|
|
||||||
bunOut.combined,
|
|
||||||
].join("\n");
|
|
||||||
return { green: bunGreen, output: tail(combined) };
|
|
||||||
}
|
|
||||||
|
|
||||||
function tail(s: string, n = 4096): string {
|
|
||||||
return s.length > n ? "…" + s.slice(-n) : s;
|
|
||||||
}
|
|
||||||
|
|
||||||
function runCmd(
|
|
||||||
cmd: string,
|
|
||||||
args: string[],
|
|
||||||
cwd: string,
|
|
||||||
timeoutMs: number,
|
|
||||||
): Promise<{ code: number; combined: string }> {
|
|
||||||
return new Promise(resolveP => {
|
|
||||||
const child = spawn(cmd, args, { cwd, env: { ...process.env } });
|
|
||||||
let combined = "";
|
|
||||||
child.stdout.on("data", d => { combined += d.toString(); });
|
|
||||||
child.stderr.on("data", d => { combined += d.toString(); });
|
|
||||||
const timer = setTimeout(() => child.kill("SIGKILL"), timeoutMs);
|
|
||||||
child.on("close", code => {
|
|
||||||
clearTimeout(timer);
|
|
||||||
resolveP({ code: code ?? -1, combined });
|
|
||||||
});
|
|
||||||
});
|
|
||||||
}
|
|
||||||
@@ -1,88 +0,0 @@
|
|||||||
// Shared types for the PR-bot. Small and explicit — the bot's behavior
|
|
||||||
// should be readable from these shapes alone.
|
|
||||||
|
|
||||||
export interface Gap {
|
|
||||||
id: string; // hash of prd_line — stable key for dedup
|
|
||||||
prd_line: string; // the [bot-eligible]-tagged line, verbatim
|
|
||||||
context: string; // surrounding context from the PRD (next ~5 lines)
|
|
||||||
source_file: string; // e.g. "docs/PRD.md"
|
|
||||||
line_number: number;
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface ProposalFile {
|
|
||||||
path: string; // repo-relative (no leading slash)
|
|
||||||
content: string; // full file content — the bot writes whole files, not patches
|
|
||||||
is_new: boolean; // true = create, false = overwrite existing
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface Proposal {
|
|
||||||
summary: string; // one-line
|
|
||||||
rationale: string; // why this change addresses the gap
|
|
||||||
files: ProposalFile[];
|
|
||||||
estimated_loc: number; // total added+changed lines across all files
|
|
||||||
model_used: string;
|
|
||||||
tokens_used: number;
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface CycleContext {
|
|
||||||
startedAt: string; // ISO
|
|
||||||
dailyCallsUsed: number;
|
|
||||||
dailyCallsBudget: number;
|
|
||||||
dailyTokensUsed: number;
|
|
||||||
dailyTokensBudget: number;
|
|
||||||
lastCycleAt: string | null;
|
|
||||||
lastCycleGapId: string | null;
|
|
||||||
autotuneBusy: boolean;
|
|
||||||
workingTreeDirty: boolean;
|
|
||||||
}
|
|
||||||
|
|
||||||
export type CycleOutcome =
|
|
||||||
| "ok" // PR opened
|
|
||||||
| "skipped_pause"
|
|
||||||
| "skipped_cost"
|
|
||||||
| "skipped_policy"
|
|
||||||
| "skipped_no_gap"
|
|
||||||
| "skipped_dirty_tree"
|
|
||||||
| "proposal_rejected"
|
|
||||||
| "apply_failed"
|
|
||||||
| "cycle_noop" // proposal applied but every file was identical to what's on disk
|
|
||||||
| "tests_failed"
|
|
||||||
| "pr_skipped_by_policy"
|
|
||||||
| "pr_failed"
|
|
||||||
| "model_failed";
|
|
||||||
|
|
||||||
// Mem0-aligned apply outcomes. Three shapes instead of the binary
|
|
||||||
// "written" / "errored". NOOP is a first-class outcome — identical
|
|
||||||
// content shouldn't waste test cycles or open an empty PR.
|
|
||||||
export type ApplyMode = "add" | "update" | "noop";
|
|
||||||
|
|
||||||
export interface ApplyOutcome {
|
|
||||||
added: string[];
|
|
||||||
updated: string[];
|
|
||||||
noop: string[];
|
|
||||||
errors: string[];
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface CycleResult {
|
|
||||||
cycle_id: string;
|
|
||||||
started_at: string;
|
|
||||||
ended_at: string;
|
|
||||||
outcome: CycleOutcome;
|
|
||||||
reason: string;
|
|
||||||
gap: Gap | null;
|
|
||||||
proposal: Proposal | null;
|
|
||||||
filesAdded: string[];
|
|
||||||
filesUpdated: string[];
|
|
||||||
filesNoop: string[];
|
|
||||||
testsGreen: boolean | null; // null = not run
|
|
||||||
testsOutput: string;
|
|
||||||
prUrl: string | null;
|
|
||||||
tokens_used: number;
|
|
||||||
cloud_calls: number;
|
|
||||||
}
|
|
||||||
|
|
||||||
export interface CostState {
|
|
||||||
date: string; // YYYY-MM-DD UTC
|
|
||||||
calls: number;
|
|
||||||
tokens: number;
|
|
||||||
}
|
|
||||||
@@ -1,18 +0,0 @@
|
|||||||
{
|
|
||||||
"lockfileVersion": 1,
|
|
||||||
"configVersion": 1,
|
|
||||||
"workspaces": {
|
|
||||||
"": {
|
|
||||||
"dependencies": {
|
|
||||||
"langfuse": "^3.38.20",
|
|
||||||
},
|
|
||||||
},
|
|
||||||
},
|
|
||||||
"packages": {
|
|
||||||
"langfuse": ["langfuse@3.38.20", "", { "dependencies": { "langfuse-core": "^3.38.20" } }, "sha512-MAmBAASSzJtmK1O9HQegA1mFsQhT8Yf+OJRGvE7FXkyv3g/eiBE0glLD0Ohg3pkxhoPdggM5SejK7ue9ctlaMA=="],
|
|
||||||
|
|
||||||
"langfuse-core": ["langfuse-core@3.38.20", "", { "dependencies": { "mustache": "^4.2.0" } }, "sha512-zBKVmQN/1oT5VWZUBYlWzvokIlkC/6mnpgr/2atMyTeAm+jR3ia7w2iJMjlrF5/oG8ukO1s8+LDRCzJpF1QeEA=="],
|
|
||||||
|
|
||||||
"mustache": ["mustache@4.2.0", "", { "bin": { "mustache": "bin/mustache" } }, "sha512-71ippSywq5Yb7/tVYyGbkBggbU8H3u5Rz56fH60jGFgr8uHwxs+aSKeqmluIVzM0m0kB7xQjKS6qPfd0b2ZoqQ=="],
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,193 +0,0 @@
|
|||||||
{
|
|
||||||
"_description": "Lakehouse model matrix — authoritative routing for all agent tiers. Local models do the heavy lifting; cloud models are consulted sparingly for overview, strategic, and gatekeeper decisions. Read by tests/multi-agent/scenario.ts and mcp-server/index.ts.",
|
|
||||||
"version": 1,
|
|
||||||
"updated": "2026-04-21",
|
|
||||||
"providers": {
|
|
||||||
"ollama_local": {
|
|
||||||
"base_url": "http://localhost:11434",
|
|
||||||
"key_env": null
|
|
||||||
},
|
|
||||||
"ollama_cloud": {
|
|
||||||
"base_url": "https://ollama.com",
|
|
||||||
"key_env": "OLLAMA_CLOUD_KEY",
|
|
||||||
"key_source": "/root/llm_team_config.json → providers.ollama_cloud.api_key",
|
|
||||||
"rate_budget": {
|
|
||||||
"calls_per_hour": 200,
|
|
||||||
"calls_per_day": 2000,
|
|
||||||
"notes": "Paid tier — generous. Policy: keep overview calls ≤ 3/scenario, strategic ≤ 10/day, gatekeeper ≤ 5/day."
|
|
||||||
}
|
|
||||||
}
|
|
||||||
},
|
|
||||||
"tiers": {
|
|
||||||
"t1_hot": {
|
|
||||||
"purpose": "Per tool call — SQL generation, hybrid_search, sql(). Runs 50-200 times per scenario. Latency-sensitive.",
|
|
||||||
"kind": "local_fast",
|
|
||||||
"primary": { "model": "qwen3.5:latest", "provider": "ollama_local", "context_window": 262144 },
|
|
||||||
"fallback": { "model": "qwen2.5:latest", "provider": "ollama_local", "context_window": 32768 },
|
|
||||||
"max_tokens": 1000,
|
|
||||||
"temperature": 0.3,
|
|
||||||
"never_route_cloud": true,
|
|
||||||
"context_budget": {
|
|
||||||
"system_prompt_cap": 4000,
|
|
||||||
"prior_context_cap": 6000,
|
|
||||||
"tool_results_cap": 8000,
|
|
||||||
"safety_margin": 2000,
|
|
||||||
"overflow_policy": "summarize_oldest_tool_results_via_t3"
|
|
||||||
},
|
|
||||||
"rationale": "qwen3.5:latest is a 9.7B thinking model with 262K context that emits clean JSON (verified 2026-04-21 after mistral A/B wipeout). Thinking budget requires max_tokens ≥ 400; we hold 1000 to keep propose_done payloads intact. qwen2.5 stays as fallback."
|
|
||||||
},
|
|
||||||
"t2_review": {
|
|
||||||
"purpose": "Per step consensus — executor ↔ reviewer loop critique. 5-14 calls per event.",
|
|
||||||
"kind": "local_balanced",
|
|
||||||
"primary": { "model": "qwen3:latest", "provider": "ollama_local", "context_window": 40960 },
|
|
||||||
"fallback": { "model": "qwen2.5:latest", "provider": "ollama_local", "context_window": 32768 },
|
|
||||||
"max_tokens": 800,
|
|
||||||
"temperature": 0.3,
|
|
||||||
"never_route_cloud": true,
|
|
||||||
"context_budget": {
|
|
||||||
"system_prompt_cap": 2000,
|
|
||||||
"recent_turns_cap": 4000,
|
|
||||||
"safety_margin": 1000
|
|
||||||
},
|
|
||||||
"rationale": "Reviewer only needs to detect schema violations and drift — a 7B model is sufficient."
|
|
||||||
},
|
|
||||||
"t3_overview": {
|
|
||||||
"purpose": "Mid-day checkpoint after every misplacement + every Nth event, and cross-day lesson. 1-3 calls per scenario.",
|
|
||||||
"kind": "thinking_cloud",
|
|
||||||
"primary": { "model": "gpt-oss:120b", "provider": "ollama_cloud", "context_window": 131072 },
|
|
||||||
"local_fallback": { "model": "gpt-oss:20b", "provider": "ollama_local", "context_window": 131072 },
|
|
||||||
"max_tokens": 900,
|
|
||||||
"temperature": 0.2,
|
|
||||||
"cloud_budget_per_scenario": 5,
|
|
||||||
"env_flag": "LH_OVERVIEW_CLOUD=1",
|
|
||||||
"context_budget": {
|
|
||||||
"event_digest_cap": 30000,
|
|
||||||
"checkpoint_cap": 8000,
|
|
||||||
"lesson_corpus_cap": 40000,
|
|
||||||
"safety_margin": 8000,
|
|
||||||
"overflow_policy": "chunk_lessons_via_cosine_topk"
|
|
||||||
},
|
|
||||||
"rationale": "Same prompt family as local 20b (gpt-oss series) — prompts port directly. 120b is faster via cloud than 20b local in practice, and lessons are noticeably more specific."
|
|
||||||
},
|
|
||||||
"t4_strategic": {
|
|
||||||
"purpose": "Daily playbook board re-ranking, weekly gap audit, pattern discovery across accumulated playbooks. 1-10 calls per day.",
|
|
||||||
"kind": "thinking_cloud_large",
|
|
||||||
"primary": { "model": "kimi-k2.6", "provider": "ollama_cloud", "context_window": 200000 },
|
|
||||||
"secondary": { "model": "qwen3.5:397b", "provider": "ollama_cloud", "context_window": 131072 },
|
|
||||||
"fallback": { "model": "glm-4.7", "provider": "ollama_cloud", "context_window": 131072 },
|
|
||||||
"local_fallback": { "model": "gpt-oss:20b", "provider": "ollama_local", "context_window": 131072 },
|
|
||||||
"max_tokens": 2000,
|
|
||||||
"temperature": 0.2,
|
|
||||||
"cloud_budget_per_day": 10,
|
|
||||||
"context_budget": {
|
|
||||||
"playbook_corpus_cap": 80000,
|
|
||||||
"pattern_history_cap": 20000,
|
|
||||||
"safety_margin": 16000,
|
|
||||||
"overflow_policy": "two_pass_map_reduce"
|
|
||||||
},
|
|
||||||
"rationale": "J named qwen3.5 specifically. GLM-4.7 is a promising alternate for debate phase. Runs after all scenarios complete for the day."
|
|
||||||
},
|
|
||||||
"t5_gatekeeper": {
|
|
||||||
"purpose": "MUST route here: architecture changes, new client onboarding, schema migrations, playbook retirements, index rebuilds, autotune config changes.",
|
|
||||||
"kind": "thinking_cloud_deepest",
|
|
||||||
"primary": { "model": "kimi-k2-thinking", "provider": "ollama_cloud", "context_window": 200000 },
|
|
||||||
"fallback": { "model": "deepseek-v3.1:671b", "provider": "ollama_cloud", "context_window": 131072 },
|
|
||||||
"secondary_fallback": { "model": "qwen3.5:397b", "provider": "ollama_cloud", "context_window": 131072 },
|
|
||||||
"local_fallback": { "model": "gpt-oss:20b", "provider": "ollama_local", "context_window": 131072 },
|
|
||||||
"max_tokens": 4000,
|
|
||||||
"temperature": 0.1,
|
|
||||||
"cloud_budget_per_day": 5,
|
|
||||||
"audit_log": true,
|
|
||||||
"context_budget": {
|
|
||||||
"decision_doc_cap": 50000,
|
|
||||||
"evidence_bundle_cap": 100000,
|
|
||||||
"prior_gatekeeper_decisions_cap": 20000,
|
|
||||||
"safety_margin": 20000,
|
|
||||||
"overflow_policy": "escalate_to_kimi_k2_1t_or_split_decision"
|
|
||||||
},
|
|
||||||
"rationale": "Highest-stakes decisions — reasoning depth matters more than latency. Audit log so J can always see what the gatekeeper was asked and what it answered. No human approval required today; escalate later if mis-decisions show up."
|
|
||||||
}
|
|
||||||
},
|
|
||||||
|
|
||||||
"embeddings": {
|
|
||||||
"_description": "Vector embedding models for hybrid search + playbook_memory similarity. Always local — embedding calls are too high-volume for cloud. qwen3-embedding is the new primary (2026-04-21); nomic-embed-text-v2-moe is the MoE alternative for corpus-scale embedding; original nomic-embed-text stays as legacy fallback while vectord indexes are being re-embedded.",
|
|
||||||
"primary": { "model": "qwen3-embedding", "provider": "ollama_local", "dim": 1024, "context_window": 32768 },
|
|
||||||
"alternate": { "model": "nomic-embed-text-v2-moe", "provider": "ollama_local", "dim": 768, "context_window": 2048, "notes": "MoE variant — better for long documents, slower per-call, roughly matches nomic-embed-text on short text." },
|
|
||||||
"legacy": { "model": "nomic-embed-text:latest", "provider": "ollama_local", "dim": 768, "context_window": 8192, "notes": "Used by existing vectord indexes. Do NOT switch live until indexes are rebuilt, or hybrid search recall will crater." },
|
|
||||||
"migration_plan": "Re-embed workers_500k (and all production indexes) with qwen3-embedding, keep the old index under a _v1 suffix for rollback, flip the profile pointer only after recall benchmarks match or exceed legacy. Touches vectord::agent + autotune."
|
|
||||||
},
|
|
||||||
|
|
||||||
"context_management": {
|
|
||||||
"_description": "Rule zero: NEVER call a model with more tokens than its context_window minus safety_margin. Every call goes through the budget checker first. If over budget → chunk, summarize, or escalate. This is the stability floor.",
|
|
||||||
"token_estimator": {
|
|
||||||
"method": "chars_div_4",
|
|
||||||
"note": "Rough, biased safe by ~15%. For production, swap to tiktoken or the provider's tokenizer endpoint."
|
|
||||||
},
|
|
||||||
"overflow_policies": {
|
|
||||||
"summarize_oldest_tool_results_via_t3": {
|
|
||||||
"when": "T1 conversation history + tool results exceed context_budget.tool_results_cap",
|
|
||||||
"how": "Send oldest N tool results to T3 with prompt 'summarize these into 500 tokens that preserve what the executor needs to know'; replace them with the summary in the running conversation."
|
|
||||||
},
|
|
||||||
"chunk_lessons_via_cosine_topk": {
|
|
||||||
"when": "lesson corpus in data/_playbook_lessons/*.json exceeds lesson_corpus_cap",
|
|
||||||
"how": "Embed the current scenario spec, cosine-rank all lessons, take top-K until budget exhausted. Fall back to date-sorted if embeddings unavailable."
|
|
||||||
},
|
|
||||||
"two_pass_map_reduce": {
|
|
||||||
"when": "T4 playbook corpus exceeds playbook_corpus_cap",
|
|
||||||
"how": "Pass 1: chunk playbooks into ≤30K token shards, run primary model on each shard to emit 'shard summary'. Pass 2: feed all summaries to primary model for global synthesis. Logged as two audit entries."
|
|
||||||
},
|
|
||||||
"escalate_to_kimi_k2_1t_or_split_decision": {
|
|
||||||
"when": "T5 decision evidence exceeds decision_doc_cap + evidence_bundle_cap",
|
|
||||||
"how": "Prefer kimi-k2:1t which has 1M context. If still over, split decision into sub-decisions (e.g. 'retire playbooks by city' instead of 'retire playbooks globally') and loop."
|
|
||||||
}
|
|
||||||
},
|
|
||||||
"chunking_cache": {
|
|
||||||
"_description": "Precomputed shards of the playbook corpus, indexed by (corpus_version, shard_id). Avoids re-chunking on every T4 run.",
|
|
||||||
"location": "data/_chunk_cache/",
|
|
||||||
"invalidation": "Key includes corpus hash. When playbook_memory changes, the hash changes, the cache misses, and chunks regenerate.",
|
|
||||||
"implementation_status": "SPEC — next sprint."
|
|
||||||
},
|
|
||||||
"implementation_status": "context_window + context_budget fields WIRED in config. Enforcement helper NOT yet wired in agent.ts. Next: add estimateTokens() + budgetCheck() helpers, route all generate() calls through them, emit a metric when overflow policy fires."
|
|
||||||
},
|
|
||||||
"experimental_rotation": {
|
|
||||||
"enabled": false,
|
|
||||||
"purpose": "Sample newer models on a schedule to collect comparison data without rate-limit risk.",
|
|
||||||
"candidates": [
|
|
||||||
{ "model": "minimax-m2.7", "notes": "Newer minimax; unknown output stability" },
|
|
||||||
{ "model": "glm-5", "notes": "GLM next-gen; larger context" },
|
|
||||||
{ "model": "glm-5.1", "notes": "Incremental on GLM-5" },
|
|
||||||
{ "model": "qwen3-next:80b", "notes": "Qwen's experimental successor; smaller than 3.5" },
|
|
||||||
{ "model": "qwen3-coder-next", "notes": "Coder-optimized — good for SQL gen T1 experiments" },
|
|
||||||
{ "model": "deepseek-v3.2", "notes": "Smaller deepseek; reasoning/coding" },
|
|
||||||
{ "model": "nemotron-3-super", "notes": "NVIDIA 230B; general" },
|
|
||||||
{ "model": "cogito-2.1:671b", "notes": "671B general" },
|
|
||||||
{ "model": "mistral-large-3:675b", "notes": "Mistral's flagship; good T3 candidate" }
|
|
||||||
],
|
|
||||||
"rotation": "weekly",
|
|
||||||
"sample_rate": 0.1,
|
|
||||||
"apply_to_tier": "t4_strategic",
|
|
||||||
"notes": "When enabled, T4 routes 10% of calls to a rotating experimental model. Log comparison in /data/_model_eval/ — if the experimental consistently beats primary across 3 rotations, promote it to primary."
|
|
||||||
},
|
|
||||||
"playbook_versioning": {
|
|
||||||
"enabled": true,
|
|
||||||
"purpose": "A playbook can work, then break when architecture changes. Versioning lets us pin which change retired which playbook.",
|
|
||||||
"dataset": "playbook_memory",
|
|
||||||
"schema_additions": {
|
|
||||||
"version": "integer — auto-increment per operation",
|
|
||||||
"parent_id": "string — previous version entry_id for same operation (null for v1)",
|
|
||||||
"retired_at": "timestamp — set when success_rate drops or architecture changes",
|
|
||||||
"retirement_reason": "string — e.g. 'schema_migration:workers_500k 2026-05-03'",
|
|
||||||
"architecture_snapshot": "object — crate versions, index name, schema fingerprint at seed time"
|
|
||||||
},
|
|
||||||
"retire_triggers": [
|
|
||||||
"success_rate < 0.3 over last 20 citations",
|
|
||||||
"schema_fingerprint mismatch detected at retrieval time",
|
|
||||||
"architecture change event emitted by ingestd/vectord",
|
|
||||||
"T5 gatekeeper explicitly retires via /vectors/playbook_memory/retire"
|
|
||||||
],
|
|
||||||
"read_back_policy": "retrieval returns only non-retired versions. History endpoint /vectors/playbook_memory/history/{operation} returns the full chain.",
|
|
||||||
"ui_surface": "mcp-server to render a diff view: side-by-side of playbook versions with a timeline of what changed and when.",
|
|
||||||
"implementation_status": "SPEC — not yet wired. Target: next sprint. Touches gateway + catalogd + mcp-server."
|
|
||||||
},
|
|
||||||
"matrix_index_hybrid_search_note": "Phase 22 candidate: elevate the hybrid_search T1 tool to consult T3 when a pool returns <3 matches OR when the same (role, city) combo has failed N times in 24h. Consult result is a reformulated sql_filter the executor retries with. Keeps T1 fast on the happy path, escalates to T3 only on low-recall signals."
|
|
||||||
}
|
|
||||||
@@ -1,91 +0,0 @@
|
|||||||
# Mode router config — task_class → mode mapping
|
|
||||||
#
|
|
||||||
# `preferred_mode` is the first choice for a task class; `fallback_modes`
|
|
||||||
# get tried in order if the preferred one isn't available (LLM Team can
|
|
||||||
# return Unknown mode for some, OR the matrix has stronger signal for a
|
|
||||||
# fallback). `default_model` seeds the mode runner's model field if the
|
|
||||||
# caller doesn't override.
|
|
||||||
#
|
|
||||||
# Modes are dispatched against LLM Team UI (localhost:5000/api/run) for
|
|
||||||
# now; future Rust-native runners will short-circuit before the proxy.
|
|
||||||
# See crates/gateway/src/v1/mode.rs for the dispatch path.
|
|
||||||
|
|
||||||
[[task_class]]
|
|
||||||
name = "scrum_review"
|
|
||||||
# 2026-04-26 pass5 variance test (5 reps × 4 conditions, grok-4.1-fast,
|
|
||||||
# pathway_memory.rs): composed corpus LOST 5/5 vs isolation (Δ −1.8
|
|
||||||
# grounded findings, p=0.031). See docs/MODE_RUNNER_TUNING_PLAN.md.
|
|
||||||
# Default is now isolation — bug fingerprints + adversarial framing +
|
|
||||||
# file content carries strong models without matrix noise. The
|
|
||||||
# `codereview_lakehouse` matrix path remains available via force_mode
|
|
||||||
# (auto-downgrades to isolation on strong models — see the
|
|
||||||
# is_strong_model gate in crates/gateway/src/v1/mode.rs).
|
|
||||||
preferred_mode = "codereview_isolation"
|
|
||||||
fallback_modes = ["codereview_lakehouse", "codereview", "consensus", "ladder"]
|
|
||||||
default_model = "qwen3-coder:480b"
|
|
||||||
# Corpora kept defined so experimental modes (codereview_matrix_only,
|
|
||||||
# pass2/pass5 sweeps) and weak-model rescue rungs can still pull them.
|
|
||||||
# scrum_findings_v1 is built but EXCLUDED — bake-off showed 24% OOB
|
|
||||||
# line citations from cross-file drift, only safe with same-file gating.
|
|
||||||
matrix_corpus = ["lakehouse_arch_v1", "lakehouse_symbols_v1"]
|
|
||||||
|
|
||||||
[[task_class]]
|
|
||||||
name = "contract_analysis"
|
|
||||||
preferred_mode = "deep_analysis"
|
|
||||||
fallback_modes = ["research", "extract"]
|
|
||||||
default_model = "kimi-k2:1t"
|
|
||||||
matrix_corpus = "chicago_permits_v1"
|
|
||||||
|
|
||||||
[[task_class]]
|
|
||||||
name = "staffing_inference"
|
|
||||||
# Staffing-domain native enrichment runner — Pass 4 (2026-04-26).
|
|
||||||
# Same composer architecture as codereview_lakehouse but with staffing
|
|
||||||
# framing + workers corpus. Validates that the modes-as-prompt-molders
|
|
||||||
# pattern generalizes beyond code review.
|
|
||||||
preferred_mode = "staffing_inference_lakehouse"
|
|
||||||
fallback_modes = ["ladder", "consensus", "pipeline"]
|
|
||||||
# 2026-04-28: gpt-oss-120b:free → kimi-k2.6 via Ollama Pro. Coding-
|
|
||||||
# specialized, faster than gpt-oss, on the same OLLAMA_CLOUD_KEY so
|
|
||||||
# no extra provider hop.
|
|
||||||
default_model = "kimi-k2.6"
|
|
||||||
matrix_corpus = "workers_500k_v8"
|
|
||||||
|
|
||||||
[[task_class]]
|
|
||||||
name = "fact_extract"
|
|
||||||
preferred_mode = "extract"
|
|
||||||
fallback_modes = ["distill"]
|
|
||||||
default_model = "qwen2.5"
|
|
||||||
matrix_corpus = "kb_team_runs_v1"
|
|
||||||
|
|
||||||
[[task_class]]
|
|
||||||
name = "doc_drift_check"
|
|
||||||
preferred_mode = "drift"
|
|
||||||
fallback_modes = ["validator"]
|
|
||||||
# 2026-04-28: gpt-oss:120b → gemini-3-flash-preview via Ollama Pro.
|
|
||||||
# Speed leader on factual checking, same OLLAMA_CLOUD_KEY.
|
|
||||||
default_model = "gemini-3-flash-preview"
|
|
||||||
matrix_corpus = "distilled_factual_v20260423095819"
|
|
||||||
|
|
||||||
[[task_class]]
|
|
||||||
name = "pr_audit"
|
|
||||||
# Auditor's claim-vs-diff verification mode (2026-04-26 rebuild).
|
|
||||||
# Replaces the auditor's hand-rolled inference check with the mode-runner
|
|
||||||
# composer: pathway memory (PR-level patterns) + lakehouse_answers_v1
|
|
||||||
# corpus (prior accepted reviews + observer escalations) + adversarial
|
|
||||||
# JSON-shaped framing. Default model is paid Ollama Cloud kimi-k2:1t for
|
|
||||||
# strong claim-grounding; tie-breaker via auditor-side env override.
|
|
||||||
preferred_mode = "pr_audit"
|
|
||||||
fallback_modes = ["consensus", "ladder"]
|
|
||||||
# kimi-k2:1t broken upstream 2026-04-27 (Ollama Cloud 500 ISE, multi-hour
|
|
||||||
# sustained outage verified by repeated probes). deepseek-v3.1:671b is
|
|
||||||
# the drop-in substitute — proven working end-to-end through pr_audit
|
|
||||||
# during Phase 5 distillation acceptance testing.
|
|
||||||
default_model = "deepseek-v3.1:671b"
|
|
||||||
matrix_corpus = "lakehouse_answers_v1"
|
|
||||||
|
|
||||||
# Fallback when task_class isn't in the table — useful for ad-hoc calls
|
|
||||||
# during development that don't yet have a mapped mode.
|
|
||||||
[default]
|
|
||||||
preferred_mode = "pipeline"
|
|
||||||
fallback_modes = ["consensus", "ladder"]
|
|
||||||
default_model = "qwen3.5:latest"
|
|
||||||
@@ -1,106 +0,0 @@
|
|||||||
# Phase 39: Provider Registry
|
|
||||||
#
|
|
||||||
# Per-provider base_url, auth scheme, and default model. The gateway's
|
|
||||||
# /v1/chat dispatcher reads this file at boot to populate its provider
|
|
||||||
# table. Secrets (API keys) come from /etc/lakehouse/secrets.toml or
|
|
||||||
# environment variables — NEVER inline a key here.
|
|
||||||
#
|
|
||||||
# Adding a new provider:
|
|
||||||
# 1. New [[provider]] block with name, base_url, auth, default_model
|
|
||||||
# 2. Matching adapter at crates/aibridge/src/providers/<name>.rs
|
|
||||||
# implementing the ProviderAdapter trait (chat + embed + unload)
|
|
||||||
# 3. Route arm in crates/gateway/src/v1/mod.rs matching on `name`
|
|
||||||
# 4. Model-prefix routing hint in resolve_provider() if the provider
|
|
||||||
# uses an "<name>/..." model prefix (e.g. "openrouter/...")
|
|
||||||
|
|
||||||
[[provider]]
|
|
||||||
name = "ollama"
|
|
||||||
base_url = "http://localhost:11434"
|
|
||||||
auth = "none"
|
|
||||||
default_model = "qwen3.5:latest"
|
|
||||||
# Hot-path local inference. No bearer needed — direct to Ollama as of
|
|
||||||
# 2026-05-02 (Python sidecar's pass-through wrapper retired). Model
|
|
||||||
# names are bare (e.g. "qwen3.5:latest", not "ollama/qwen3.5:latest").
|
|
||||||
|
|
||||||
[[provider]]
|
|
||||||
name = "ollama_cloud"
|
|
||||||
base_url = "https://ollama.com"
|
|
||||||
auth = "bearer"
|
|
||||||
auth_env = "OLLAMA_CLOUD_KEY"
|
|
||||||
default_model = "deepseek-v3.2"
|
|
||||||
# Cloud-tier Ollama (Pro plan as of 2026-04-28). Key resolved from
|
|
||||||
# OLLAMA_CLOUD_KEY at gateway boot; Pro tier upgraded the account so
|
|
||||||
# rate limits + model access widen without a key change. Model-prefix
|
|
||||||
# routing: "cloud/<model>" auto-routes here. 39-model fleet now
|
|
||||||
# includes deepseek-v3.2, deepseek-v4-{flash,pro}, gemini-3-flash-
|
|
||||||
# preview, glm-{5,5.1}, kimi-k2.6, qwen3-coder-next.
|
|
||||||
# 2026-04-28: default upgraded gpt-oss:120b → deepseek-v3.2 (newest
|
|
||||||
# DeepSeek revision). NOTE: kimi-k2:1t is upstream-broken (HTTP 500
|
|
||||||
# on Ollama Pro probe 2026-04-28) — do not route to it. Use kimi-k2.6
|
|
||||||
# instead, which is what staffing_inference points at.
|
|
||||||
|
|
||||||
[[provider]]
|
|
||||||
name = "openrouter"
|
|
||||||
base_url = "https://openrouter.ai/api/v1"
|
|
||||||
auth = "bearer"
|
|
||||||
auth_env = "OPENROUTER_API_KEY"
|
|
||||||
auth_fallback_files = ["/home/profit/.env", "/root/llm_team_config.json"]
|
|
||||||
default_model = "x-ai/grok-4.1-fast"
|
|
||||||
# Multi-provider gateway. Covers Anthropic, Google, OpenAI, MiniMax,
|
|
||||||
# Qwen, Gemma, etc. Key resolved via crates/gateway/src/v1/openrouter.rs
|
|
||||||
# resolve_openrouter_key() — env first, then fallback files.
|
|
||||||
# Model-prefix routing: "openrouter/<vendor>/<model>" auto-routes here,
|
|
||||||
# prefix stripped before upstream call.
|
|
||||||
|
|
||||||
[[provider]]
|
|
||||||
name = "opencode"
|
|
||||||
base_url = "https://opencode.ai/zen/v1"
|
|
||||||
# Unified endpoint — covers BOTH Zen (pay-per-token Anthropic/OpenAI/
|
|
||||||
# Gemini frontier) AND Go (flat-sub Kimi/GLM/DeepSeek/Qwen/Minimax).
|
|
||||||
# Upstream bills per-model: Zen models hit Zen balance, Go models hit
|
|
||||||
# Go subscription cap. /zen/go/v1 is the Go-only sub-path (rejects
|
|
||||||
# Zen models), kept for reference but not used by this provider.
|
|
||||||
auth = "bearer"
|
|
||||||
auth_env = "OPENCODE_API_KEY"
|
|
||||||
default_model = "claude-opus-4-7"
|
|
||||||
# OpenCode (Zen + GO unified endpoint). One sk-* key reaches Claude
|
|
||||||
# Opus 4.7, GPT-5.5-pro, Gemini 3.1-pro, Kimi K2.6, DeepSeek, GLM,
|
|
||||||
# Qwen, plus 4 free-tier models. OpenAI-compatible Chat Completions
|
|
||||||
# at /v1/chat/completions. Model-prefix routing: "opencode/<name>"
|
|
||||||
# auto-routes here, prefix stripped before upstream call.
|
|
||||||
# Key file: /etc/lakehouse/opencode.env (loaded via systemd EnvironmentFile).
|
|
||||||
# Model catalog: curl -H "Authorization: Bearer ..." https://opencode.ai/zen/v1/models
|
|
||||||
# Note: /zen/go/v1 is the GO-only sub-path (Kimi/GLM/DeepSeek tier);
|
|
||||||
# /zen/v1 covers everything including Anthropic (which /zen/go/v1 rejects).
|
|
||||||
|
|
||||||
[[provider]]
|
|
||||||
name = "kimi"
|
|
||||||
base_url = "https://api.kimi.com/coding/v1"
|
|
||||||
auth = "bearer"
|
|
||||||
auth_env = "KIMI_API_KEY"
|
|
||||||
default_model = "kimi-for-coding"
|
|
||||||
# Direct Kimi For Coding provider. `api.kimi.com` is a SEPARATE account
|
|
||||||
# system from `api.moonshot.ai` and `api.moonshot.cn` — keys are NOT
|
|
||||||
# interchangeable. Used as a fallback when Ollama Cloud's kimi-k2.6 is
|
|
||||||
# unavailable and OpenRouter's `moonshotai/kimi-k2.6` is rate-limited.
|
|
||||||
# (Was `kimi-k2:1t` here pre-2026-05-03 — that model is upstream-broken
|
|
||||||
# and removed from operator guidance.)
|
|
||||||
# Model id: `kimi-for-coding` (kimi-k2.6 underneath).
|
|
||||||
# Key file: /etc/lakehouse/kimi.env (loaded via systemd EnvironmentFile).
|
|
||||||
# Model-prefix routing: "kimi/<model>" auto-routes here, prefix stripped.
|
|
||||||
|
|
||||||
# Planned (Phase 40 long-horizon — adapters not yet shipped):
|
|
||||||
#
|
|
||||||
# [[provider]]
|
|
||||||
# name = "gemini"
|
|
||||||
# base_url = "https://generativelanguage.googleapis.com/v1beta"
|
|
||||||
# auth = "api_key_query"
|
|
||||||
# auth_env = "GEMINI_API_KEY"
|
|
||||||
# default_model = "gemini-2.0-flash"
|
|
||||||
#
|
|
||||||
# [[provider]]
|
|
||||||
# name = "claude"
|
|
||||||
# base_url = "https://api.anthropic.com/v1"
|
|
||||||
# auth = "x_api_key"
|
|
||||||
# auth_env = "ANTHROPIC_API_KEY"
|
|
||||||
# default_model = "claude-3-5-sonnet-latest"
|
|
||||||
@@ -1,61 +0,0 @@
|
|||||||
# Phase 40: Routing Engine Configuration
|
|
||||||
#
|
|
||||||
# Human-editable rules for model → provider routing.
|
|
||||||
# Matching order: first match wins.
|
|
||||||
|
|
||||||
[[rule]]
|
|
||||||
model_pattern = "gpt-4*"
|
|
||||||
provider = "openrouter"
|
|
||||||
max_tokens = 4096
|
|
||||||
temperature = 0.7
|
|
||||||
|
|
||||||
[[rule]]
|
|
||||||
model_pattern = "claude*"
|
|
||||||
provider = "claude"
|
|
||||||
max_tokens = 4096
|
|
||||||
temperature = 0.7
|
|
||||||
|
|
||||||
[[rule]]
|
|
||||||
model_pattern = "gemini*"
|
|
||||||
provider = "gemini"
|
|
||||||
max_tokens = 8192
|
|
||||||
temperature = 0.9
|
|
||||||
|
|
||||||
[[rule]]
|
|
||||||
model_pattern = "qwen3.5*"
|
|
||||||
provider = "ollama"
|
|
||||||
max_tokens = 4096
|
|
||||||
temperature = 0.3
|
|
||||||
|
|
||||||
[[rule]]
|
|
||||||
model_pattern = "qwen3*"
|
|
||||||
provider = "ollama"
|
|
||||||
max_tokens = 2048
|
|
||||||
temperature = 0.3
|
|
||||||
|
|
||||||
[[rule]]
|
|
||||||
model_pattern = "gpt-oss*"
|
|
||||||
provider = "ollama"
|
|
||||||
temperature = 0.1
|
|
||||||
|
|
||||||
[[rule]]
|
|
||||||
model_pattern = "*"
|
|
||||||
provider = "ollama"
|
|
||||||
temperature = 0.5
|
|
||||||
|
|
||||||
# Fallback chain: if primary fails, try these in order
|
|
||||||
fallback = ["ollama", "openrouter"]
|
|
||||||
|
|
||||||
# Cost gating (tokens = cents per 1M)
|
|
||||||
[cost]
|
|
||||||
ollama = 0
|
|
||||||
openrouter = 15
|
|
||||||
claude = 15
|
|
||||||
gemini = 0
|
|
||||||
|
|
||||||
# Daily budget per provider (cents)
|
|
||||||
[daily_budget]
|
|
||||||
ollama = 0
|
|
||||||
openrouter = 1000
|
|
||||||
claude = 500
|
|
||||||
gemini = 0
|
|
||||||
@@ -11,5 +11,3 @@ serde = { workspace = true }
|
|||||||
serde_json = { workspace = true }
|
serde_json = { workspace = true }
|
||||||
tracing = { workspace = true }
|
tracing = { workspace = true }
|
||||||
reqwest = { version = "0.12", default-features = false, features = ["json", "rustls-tls"] }
|
reqwest = { version = "0.12", default-features = false, features = ["json", "rustls-tls"] }
|
||||||
async-trait = "0.1"
|
|
||||||
lru = "0.12"
|
|
||||||
|
|||||||
+26
-533
@@ -1,74 +1,12 @@
|
|||||||
use lru::LruCache;
|
|
||||||
use reqwest::Client;
|
use reqwest::Client;
|
||||||
use serde::{Deserialize, Serialize};
|
use serde::{Deserialize, Serialize};
|
||||||
use std::num::NonZeroUsize;
|
|
||||||
use std::sync::Mutex;
|
|
||||||
use std::sync::atomic::{AtomicU64, Ordering};
|
|
||||||
use std::sync::Arc;
|
|
||||||
use std::time::Duration;
|
use std::time::Duration;
|
||||||
|
|
||||||
/// HTTP client for Ollama (post-2026-05-02 — sidecar dropped).
|
/// HTTP client for the Python AI sidecar.
|
||||||
///
|
|
||||||
/// `base_url` was historically the Python sidecar at `:3200`, which
|
|
||||||
/// pass-through-proxied to Ollama at `:11434`. The sidecar added zero
|
|
||||||
/// logic on the hot path (embed.py + generate.py + rerank.py +
|
|
||||||
/// admin.py = ~120 LOC of pure Ollama wrappers), so this client now
|
|
||||||
/// talks to Ollama directly and the sidecar process can be retired.
|
|
||||||
///
|
|
||||||
/// What stayed Python: `lab_ui.py` + `pipeline_lab.py` (~888 LOC of
|
|
||||||
/// dev-mode Streamlit-shape UIs) — those aren't on the runtime hot
|
|
||||||
/// path and continue running for prompt experimentation.
|
|
||||||
///
|
|
||||||
/// `generate()` has two transport modes:
|
|
||||||
/// - When `gateway_url` is None (default), posts directly to Ollama's
|
|
||||||
/// `${base_url}/api/generate`.
|
|
||||||
/// - When `gateway_url` is `Some(url)`, posts to `${url}/v1/chat`
|
|
||||||
/// with `provider="ollama"` so the call appears in `/v1/usage` and
|
|
||||||
/// Langfuse traces.
|
|
||||||
///
|
|
||||||
/// `embed()`, `rerank()`, and admin methods always go direct to
|
|
||||||
/// Ollama — no `/v1` equivalent for those surfaces yet.
|
|
||||||
///
|
|
||||||
/// Phase 44 part 2 (2026-04-27): the gateway URL is wired in by
|
|
||||||
/// callers that want observability (vectord modules); it's left
|
|
||||||
/// unset by callers that ARE the gateway internals (avoids self-loops
|
|
||||||
/// + redundant hops).
|
|
||||||
/// Per-text embed cache key. We key on (model, text) so different
|
|
||||||
/// model selections produce distinct cache lines — a query embedded
|
|
||||||
/// under nomic-embed-text-v2-moe must NOT collide with the same
|
|
||||||
/// query under nomic-embed-text v1.
|
|
||||||
#[derive(Eq, PartialEq, Hash, Clone)]
|
|
||||||
struct EmbedCacheKey {
|
|
||||||
model: String,
|
|
||||||
text: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Default LRU cache size — 4096 entries × ~6KB per 768-d f64
|
|
||||||
/// vector ≈ 24MB. Sized for typical staffing-domain repetition
|
|
||||||
/// (coordinator workflows have query repetition rates around 70-90%
|
|
||||||
/// per session). Tunable via [aibridge].embed_cache_size in the
|
|
||||||
/// config; 0 disables the cache entirely.
|
|
||||||
const DEFAULT_EMBED_CACHE_SIZE: usize = 4096;
|
|
||||||
|
|
||||||
#[derive(Clone)]
|
#[derive(Clone)]
|
||||||
pub struct AiClient {
|
pub struct AiClient {
|
||||||
client: Client,
|
client: Client,
|
||||||
base_url: String,
|
base_url: String,
|
||||||
gateway_url: Option<String>,
|
|
||||||
/// Closes the 63× perf gap with Go side. Mirrors the shape of
|
|
||||||
/// Go's internal/embed/cached.go::CachedProvider — same
|
|
||||||
/// (model, text) → vector caching, same nil-disable semantics.
|
|
||||||
/// None = caching disabled (cache_size=0); Some = bounded LRU.
|
|
||||||
embed_cache: Option<Arc<Mutex<LruCache<EmbedCacheKey, Vec<f64>>>>>,
|
|
||||||
/// Hit / miss counters for /admin observability + load-test
|
|
||||||
/// validation. Atomic so Clone'd AiClients share the same counts.
|
|
||||||
embed_cache_hits: Arc<AtomicU64>,
|
|
||||||
embed_cache_misses: Arc<AtomicU64>,
|
|
||||||
/// Pinned at construction time so the EmbedResponse can carry
|
|
||||||
/// dimension consistently even when every text was a cache hit
|
|
||||||
/// (no fresh upstream call to learn the dim from). Set on first
|
|
||||||
/// successful Ollama embed; checked on every cache hit.
|
|
||||||
cached_dim: Arc<AtomicU64>,
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// -- Request/Response types --
|
// -- Request/Response types --
|
||||||
@@ -87,7 +25,7 @@ pub struct EmbedResponse {
|
|||||||
pub dimensions: usize,
|
pub dimensions: usize,
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Clone, Serialize, Deserialize)]
|
#[derive(Serialize, Deserialize)]
|
||||||
pub struct GenerateRequest {
|
pub struct GenerateRequest {
|
||||||
pub prompt: String,
|
pub prompt: String,
|
||||||
#[serde(skip_serializing_if = "Option::is_none")]
|
#[serde(skip_serializing_if = "Option::is_none")]
|
||||||
@@ -98,14 +36,6 @@ pub struct GenerateRequest {
|
|||||||
pub temperature: Option<f64>,
|
pub temperature: Option<f64>,
|
||||||
#[serde(skip_serializing_if = "Option::is_none")]
|
#[serde(skip_serializing_if = "Option::is_none")]
|
||||||
pub max_tokens: Option<u32>,
|
pub max_tokens: Option<u32>,
|
||||||
/// Phase 21 — per-call opt-out of hidden reasoning. Thinking models
|
|
||||||
/// (qwen3.5, gpt-oss, etc) burn tokens on reasoning before the
|
|
||||||
/// visible response starts; setting this to `false` on hot-path
|
|
||||||
/// JSON emitters avoids empty returns when the budget is tight.
|
|
||||||
/// Sidecar forwards this to Ollama's `think` parameter; if the
|
|
||||||
/// sidecar drops an unknown field the request still succeeds.
|
|
||||||
#[serde(skip_serializing_if = "Option::is_none")]
|
|
||||||
pub think: Option<bool>,
|
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Deserialize, Serialize, Clone)]
|
#[derive(Deserialize, Serialize, Clone)]
|
||||||
@@ -141,504 +71,67 @@ pub struct RerankResponse {
|
|||||||
|
|
||||||
impl AiClient {
|
impl AiClient {
|
||||||
pub fn new(base_url: &str) -> Self {
|
pub fn new(base_url: &str) -> Self {
|
||||||
Self::with_embed_cache(base_url, DEFAULT_EMBED_CACHE_SIZE)
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Constructs an AiClient with an explicit embed-cache size.
|
|
||||||
/// Pass 0 to disable the cache entirely (matches Go-side
|
|
||||||
/// CachedProvider's nil-cache semantics).
|
|
||||||
pub fn with_embed_cache(base_url: &str, cache_size: usize) -> Self {
|
|
||||||
let client = Client::builder()
|
let client = Client::builder()
|
||||||
.timeout(Duration::from_secs(120))
|
.timeout(Duration::from_secs(120))
|
||||||
.build()
|
.build()
|
||||||
.expect("failed to build HTTP client");
|
.expect("failed to build HTTP client");
|
||||||
let embed_cache = if cache_size > 0 {
|
|
||||||
// SAFETY: cache_size > 0 just verified, NonZeroUsize::new
|
|
||||||
// returns Some.
|
|
||||||
let cap = NonZeroUsize::new(cache_size).expect("cache_size > 0");
|
|
||||||
Some(Arc::new(Mutex::new(LruCache::new(cap))))
|
|
||||||
} else {
|
|
||||||
None
|
|
||||||
};
|
|
||||||
Self {
|
Self {
|
||||||
client,
|
client,
|
||||||
base_url: base_url.trim_end_matches('/').to_string(),
|
base_url: base_url.trim_end_matches('/').to_string(),
|
||||||
gateway_url: None,
|
|
||||||
embed_cache,
|
|
||||||
embed_cache_hits: Arc::new(AtomicU64::new(0)),
|
|
||||||
embed_cache_misses: Arc::new(AtomicU64::new(0)),
|
|
||||||
cached_dim: Arc::new(AtomicU64::new(0)),
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Cache hit/miss/size snapshot. Useful for /admin endpoints +
|
|
||||||
/// load-test validation ("did the cache fire as expected?").
|
|
||||||
pub fn embed_cache_stats(&self) -> (u64, u64, usize) {
|
|
||||||
let hits = self.embed_cache_hits.load(Ordering::Relaxed);
|
|
||||||
let misses = self.embed_cache_misses.load(Ordering::Relaxed);
|
|
||||||
let len = self
|
|
||||||
.embed_cache
|
|
||||||
.as_ref()
|
|
||||||
.map(|c| c.lock().map(|g| g.len()).unwrap_or(0))
|
|
||||||
.unwrap_or(0);
|
|
||||||
(hits, misses, len)
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Same as `new`, but every `generate()` is routed through
|
|
||||||
/// `${gateway_url}/v1/chat` (provider=ollama) for observability.
|
|
||||||
/// Use this for callers OUTSIDE the gateway. Inside the gateway
|
|
||||||
/// itself, prefer `new()` — calling /v1/chat from /v1/chat works
|
|
||||||
/// (no infinite loop, ollama_arm doesn't use AiClient) but adds
|
|
||||||
/// a wasted localhost hop.
|
|
||||||
pub fn new_with_gateway(base_url: &str, gateway_url: &str) -> Self {
|
|
||||||
let mut c = Self::new(base_url);
|
|
||||||
c.gateway_url = Some(gateway_url.trim_end_matches('/').to_string());
|
|
||||||
c
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Reachability + version check. Hits Ollama's `/api/version`,
|
|
||||||
/// returns a sidecar-shaped envelope so callers reading
|
|
||||||
/// `.status` / `.ollama_url` don't break across the
|
|
||||||
/// pre-/post-2026-05-02 cutover.
|
|
||||||
pub async fn health(&self) -> Result<serde_json::Value, String> {
|
pub async fn health(&self) -> Result<serde_json::Value, String> {
|
||||||
let resp = self.client
|
let resp = self.client
|
||||||
.get(format!("{}/api/version", self.base_url))
|
.get(format!("{}/health", self.base_url))
|
||||||
.send()
|
.send()
|
||||||
.await
|
.await
|
||||||
.map_err(|e| format!("ollama unreachable: {e}"))?;
|
.map_err(|e| format!("sidecar unreachable: {e}"))?;
|
||||||
let body: serde_json::Value = resp.json().await
|
resp.json().await.map_err(|e| format!("invalid response: {e}"))
|
||||||
.map_err(|e| format!("invalid response: {e}"))?;
|
|
||||||
Ok(serde_json::json!({
|
|
||||||
"status": "ok",
|
|
||||||
"ollama_url": &self.base_url,
|
|
||||||
"ollama_version": body.get("version"),
|
|
||||||
}))
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Embed with per-text LRU caching. Mirrors Go-side
|
|
||||||
/// CachedProvider behavior: cache key is (model, text);
|
|
||||||
/// cache-hit texts skip the sidecar; cache-miss texts batch
|
|
||||||
/// into a single sidecar call; results are interleaved in the
|
|
||||||
/// caller's input order.
|
|
||||||
///
|
|
||||||
/// Closes ~95% of the load-test perf gap vs Go side (loadgen
|
|
||||||
/// 2026-05-01: Rust 128 RPS → with cache ≥ 7000 RPS expected
|
|
||||||
/// for warm-cache workloads). Cold-cache behavior unchanged
|
|
||||||
/// (every text is a miss → single sidecar call, identical to
|
|
||||||
/// pre-cache).
|
|
||||||
pub async fn embed(&self, req: EmbedRequest) -> Result<EmbedResponse, String> {
|
pub async fn embed(&self, req: EmbedRequest) -> Result<EmbedResponse, String> {
|
||||||
let model_key = req.model.clone().unwrap_or_default();
|
let resp = self.client
|
||||||
|
.post(format!("{}/embed", self.base_url))
|
||||||
|
.json(&req)
|
||||||
|
.send()
|
||||||
|
.await
|
||||||
|
.map_err(|e| format!("embed request failed: {e}"))?;
|
||||||
|
|
||||||
// Fast path: cache disabled → original behavior.
|
if !resp.status().is_success() {
|
||||||
let Some(cache) = self.embed_cache.as_ref() else {
|
let text = resp.text().await.unwrap_or_default();
|
||||||
return self.embed_uncached(&req).await;
|
return Err(format!("embed error ({}): {text}", text.len()));
|
||||||
};
|
|
||||||
if req.texts.is_empty() {
|
|
||||||
return self.embed_uncached(&req).await;
|
|
||||||
}
|
}
|
||||||
|
resp.json().await.map_err(|e| format!("embed parse error: {e}"))
|
||||||
// First pass: check cache for each text. Track which positions
|
|
||||||
// need a sidecar fetch.
|
|
||||||
let mut embeddings: Vec<Option<Vec<f64>>> = vec![None; req.texts.len()];
|
|
||||||
let mut miss_indices: Vec<usize> = Vec::new();
|
|
||||||
let mut miss_texts: Vec<String> = Vec::new();
|
|
||||||
{
|
|
||||||
let mut guard = cache.lock().map_err(|e| format!("cache lock poisoned: {e}"))?;
|
|
||||||
for (i, text) in req.texts.iter().enumerate() {
|
|
||||||
let key = EmbedCacheKey { model: model_key.clone(), text: text.clone() };
|
|
||||||
if let Some(vec) = guard.get(&key) {
|
|
||||||
embeddings[i] = Some(vec.clone());
|
|
||||||
self.embed_cache_hits.fetch_add(1, Ordering::Relaxed);
|
|
||||||
} else {
|
|
||||||
miss_indices.push(i);
|
|
||||||
miss_texts.push(text.clone());
|
|
||||||
self.embed_cache_misses.fetch_add(1, Ordering::Relaxed);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// All hit? Return immediately. Use cached_dim to populate
|
|
||||||
// the response dimension (no sidecar to ask).
|
|
||||||
if miss_indices.is_empty() {
|
|
||||||
let dim = self.cached_dim.load(Ordering::Relaxed) as usize;
|
|
||||||
let dim = if dim == 0 { embeddings[0].as_ref().map(|v| v.len()).unwrap_or(0) } else { dim };
|
|
||||||
return Ok(EmbedResponse {
|
|
||||||
embeddings: embeddings.into_iter().map(|opt| opt.expect("filled")).collect(),
|
|
||||||
model: req.model.unwrap_or_else(|| "nomic-embed-text".to_string()),
|
|
||||||
dimensions: dim,
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
// Second pass: fetch the misses in one sidecar call.
|
|
||||||
let miss_req = EmbedRequest { texts: miss_texts.clone(), model: req.model.clone() };
|
|
||||||
let resp = self.embed_uncached(&miss_req).await?;
|
|
||||||
if resp.embeddings.len() != miss_texts.len() {
|
|
||||||
return Err(format!(
|
|
||||||
"embed cache: sidecar returned {} embeddings for {} texts",
|
|
||||||
resp.embeddings.len(),
|
|
||||||
miss_texts.len()
|
|
||||||
));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Pin cached_dim on first successful response.
|
|
||||||
if resp.dimensions > 0 {
|
|
||||||
self.cached_dim.store(resp.dimensions as u64, Ordering::Relaxed);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Insert misses into cache + fill response slots.
|
|
||||||
{
|
|
||||||
let mut guard = cache.lock().map_err(|e| format!("cache lock poisoned: {e}"))?;
|
|
||||||
for (j, idx) in miss_indices.iter().enumerate() {
|
|
||||||
let key = EmbedCacheKey {
|
|
||||||
model: model_key.clone(),
|
|
||||||
text: miss_texts[j].clone(),
|
|
||||||
};
|
|
||||||
let vec = resp.embeddings[j].clone();
|
|
||||||
guard.put(key, vec.clone());
|
|
||||||
embeddings[*idx] = Some(vec);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
Ok(EmbedResponse {
|
|
||||||
embeddings: embeddings.into_iter().map(|opt| opt.expect("filled")).collect(),
|
|
||||||
model: resp.model,
|
|
||||||
dimensions: resp.dimensions,
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Direct Ollama call — used internally by embed() for cache-miss
|
|
||||||
/// batches and as the transparent fallback when the cache is
|
|
||||||
/// disabled. Loops per-text against `${base_url}/api/embed`,
|
|
||||||
/// matching the sidecar's pre-2026-05-02 behavior. Ollama 0.4+
|
|
||||||
/// supports batch input but per-text keeps compatibility broader
|
|
||||||
/// + lets cache-miss-only batches share the loop with cold runs.
|
|
||||||
async fn embed_uncached(&self, req: &EmbedRequest) -> Result<EmbedResponse, String> {
|
|
||||||
let model = req.model.clone().unwrap_or_else(|| "nomic-embed-text".to_string());
|
|
||||||
let mut embeddings: Vec<Vec<f64>> = Vec::with_capacity(req.texts.len());
|
|
||||||
|
|
||||||
for text in &req.texts {
|
|
||||||
let resp = self.client
|
|
||||||
.post(format!("{}/api/embed", self.base_url))
|
|
||||||
.json(&serde_json::json!({
|
|
||||||
"model": &model,
|
|
||||||
"input": text,
|
|
||||||
}))
|
|
||||||
.send()
|
|
||||||
.await
|
|
||||||
.map_err(|e| format!("embed request failed: {e}"))?;
|
|
||||||
|
|
||||||
if !resp.status().is_success() {
|
|
||||||
let body = resp.text().await.unwrap_or_default();
|
|
||||||
return Err(format!("ollama embed error: {body}"));
|
|
||||||
}
|
|
||||||
// Ollama returns {"embeddings": [[...]], "model": "...", ...}.
|
|
||||||
// The outer `embeddings` is always a list; for a scalar input
|
|
||||||
// we get a single inner vector.
|
|
||||||
let parsed: serde_json::Value = resp.json().await
|
|
||||||
.map_err(|e| format!("embed parse error: {e}"))?;
|
|
||||||
let arr = parsed.get("embeddings")
|
|
||||||
.and_then(|v| v.as_array())
|
|
||||||
.ok_or_else(|| format!("ollama embed: missing 'embeddings' field in {parsed}"))?;
|
|
||||||
if arr.is_empty() {
|
|
||||||
return Err("ollama embed: empty embeddings array".to_string());
|
|
||||||
}
|
|
||||||
let first = arr[0].as_array()
|
|
||||||
.ok_or_else(|| "ollama embed: embeddings[0] not an array".to_string())?;
|
|
||||||
let vec: Vec<f64> = first.iter()
|
|
||||||
.filter_map(|n| n.as_f64())
|
|
||||||
.collect();
|
|
||||||
if vec.is_empty() {
|
|
||||||
return Err("ollama embed: numeric coercion produced empty vector".to_string());
|
|
||||||
}
|
|
||||||
embeddings.push(vec);
|
|
||||||
}
|
|
||||||
|
|
||||||
let dimensions = embeddings.first().map(|v| v.len()).unwrap_or(0);
|
|
||||||
Ok(EmbedResponse {
|
|
||||||
embeddings,
|
|
||||||
model,
|
|
||||||
dimensions,
|
|
||||||
})
|
|
||||||
}
|
}
|
||||||
|
|
||||||
pub async fn generate(&self, req: GenerateRequest) -> Result<GenerateResponse, String> {
|
pub async fn generate(&self, req: GenerateRequest) -> Result<GenerateResponse, String> {
|
||||||
if let Some(gw) = self.gateway_url.as_deref() {
|
|
||||||
return self.generate_via_gateway(gw, req).await;
|
|
||||||
}
|
|
||||||
// Direct Ollama path. Used by gateway internals (so the ollama
|
|
||||||
// provider can call upstream without a self-loop through
|
|
||||||
// /v1/chat) and by any consumer that wants raw transport
|
|
||||||
// without /v1/usage accounting.
|
|
||||||
let model = req.model.clone().unwrap_or_else(|| "qwen3.5:latest".to_string());
|
|
||||||
let mut body = serde_json::json!({
|
|
||||||
"model": &model,
|
|
||||||
"prompt": &req.prompt,
|
|
||||||
"stream": false,
|
|
||||||
});
|
|
||||||
let mut options = serde_json::Map::new();
|
|
||||||
if let Some(t) = req.temperature {
|
|
||||||
options.insert("temperature".to_string(), serde_json::json!(t));
|
|
||||||
}
|
|
||||||
if let Some(mt) = req.max_tokens {
|
|
||||||
options.insert("num_predict".to_string(), serde_json::json!(mt));
|
|
||||||
}
|
|
||||||
if !options.is_empty() {
|
|
||||||
body["options"] = serde_json::Value::Object(options);
|
|
||||||
}
|
|
||||||
if let Some(sys) = &req.system {
|
|
||||||
body["system"] = serde_json::json!(sys);
|
|
||||||
}
|
|
||||||
if let Some(th) = req.think {
|
|
||||||
body["think"] = serde_json::json!(th);
|
|
||||||
}
|
|
||||||
|
|
||||||
let resp = self.client
|
let resp = self.client
|
||||||
.post(format!("{}/api/generate", self.base_url))
|
.post(format!("{}/generate", self.base_url))
|
||||||
.json(&body)
|
.json(&req)
|
||||||
.send()
|
.send()
|
||||||
.await
|
.await
|
||||||
.map_err(|e| format!("generate request failed: {e}"))?;
|
.map_err(|e| format!("generate request failed: {e}"))?;
|
||||||
|
|
||||||
if !resp.status().is_success() {
|
if !resp.status().is_success() {
|
||||||
let text = resp.text().await.unwrap_or_default();
|
let text = resp.text().await.unwrap_or_default();
|
||||||
return Err(format!("ollama generate error: {text}"));
|
return Err(format!("generate error: {text}"));
|
||||||
}
|
}
|
||||||
let parsed: serde_json::Value = resp.json().await
|
resp.json().await.map_err(|e| format!("generate parse error: {e}"))
|
||||||
.map_err(|e| format!("generate parse error: {e}"))?;
|
|
||||||
|
|
||||||
Ok(GenerateResponse {
|
|
||||||
text: parsed.get("response").and_then(|v| v.as_str()).unwrap_or("").to_string(),
|
|
||||||
model,
|
|
||||||
tokens_evaluated: parsed.get("prompt_eval_count").and_then(|v| v.as_u64()),
|
|
||||||
tokens_generated: parsed.get("eval_count").and_then(|v| v.as_u64()),
|
|
||||||
})
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Phase 44 part 2: route generate() through the gateway's
|
pub async fn rerank(&self, req: RerankRequest) -> Result<RerankResponse, String> {
|
||||||
/// /v1/chat with provider="ollama" so the call lands in
|
|
||||||
/// /v1/usage + Langfuse. Translates between the sidecar
|
|
||||||
/// GenerateRequest/Response shape and the OpenAI-compat
|
|
||||||
/// chat shape on the wire.
|
|
||||||
async fn generate_via_gateway(&self, gateway_url: &str, req: GenerateRequest) -> Result<GenerateResponse, String> {
|
|
||||||
let mut messages = Vec::with_capacity(2);
|
|
||||||
if let Some(sys) = &req.system {
|
|
||||||
messages.push(serde_json::json!({"role": "system", "content": sys}));
|
|
||||||
}
|
|
||||||
messages.push(serde_json::json!({"role": "user", "content": req.prompt}));
|
|
||||||
let mut body = serde_json::json!({
|
|
||||||
"messages": messages,
|
|
||||||
"provider": "ollama",
|
|
||||||
});
|
|
||||||
if let Some(m) = &req.model { body["model"] = serde_json::json!(m); }
|
|
||||||
if let Some(t) = req.temperature { body["temperature"] = serde_json::json!(t); }
|
|
||||||
if let Some(mt) = req.max_tokens { body["max_tokens"] = serde_json::json!(mt); }
|
|
||||||
if let Some(th) = req.think { body["think"] = serde_json::json!(th); }
|
|
||||||
|
|
||||||
let resp = self.client
|
let resp = self.client
|
||||||
.post(format!("{}/v1/chat", gateway_url))
|
.post(format!("{}/rerank", self.base_url))
|
||||||
.json(&body)
|
.json(&req)
|
||||||
.send()
|
.send()
|
||||||
.await
|
.await
|
||||||
.map_err(|e| format!("/v1/chat request failed: {e}"))?;
|
.map_err(|e| format!("rerank request failed: {e}"))?;
|
||||||
|
|
||||||
if !resp.status().is_success() {
|
if !resp.status().is_success() {
|
||||||
let text = resp.text().await.unwrap_or_default();
|
let text = resp.text().await.unwrap_or_default();
|
||||||
return Err(format!("/v1/chat error: {text}"));
|
return Err(format!("rerank error: {text}"));
|
||||||
}
|
}
|
||||||
let parsed: serde_json::Value = resp.json().await
|
resp.json().await.map_err(|e| format!("rerank parse error: {e}"))
|
||||||
.map_err(|e| format!("/v1/chat parse error: {e}"))?;
|
|
||||||
|
|
||||||
let text = parsed
|
|
||||||
.pointer("/choices/0/message/content")
|
|
||||||
.and_then(|v| v.as_str())
|
|
||||||
.unwrap_or("")
|
|
||||||
.to_string();
|
|
||||||
let model = parsed.get("model")
|
|
||||||
.and_then(|v| v.as_str())
|
|
||||||
.unwrap_or_else(|| req.model.as_deref().unwrap_or(""))
|
|
||||||
.to_string();
|
|
||||||
let prompt_tokens = parsed.pointer("/usage/prompt_tokens").and_then(|v| v.as_u64());
|
|
||||||
let completion_tokens = parsed.pointer("/usage/completion_tokens").and_then(|v| v.as_u64());
|
|
||||||
|
|
||||||
Ok(GenerateResponse {
|
|
||||||
text,
|
|
||||||
model,
|
|
||||||
tokens_evaluated: prompt_tokens,
|
|
||||||
tokens_generated: completion_tokens,
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Cross-encoder reranking via Ollama generate. Asks the model to
|
|
||||||
/// rate each document's relevance to the query 0-10, then sorts
|
|
||||||
/// descending. Mirrors the sidecar's pre-2026-05-02 algorithm
|
|
||||||
/// exactly so callers see the same scores.
|
|
||||||
pub async fn rerank(&self, req: RerankRequest) -> Result<RerankResponse, String> {
|
|
||||||
let model = req.model.clone().unwrap_or_else(|| "qwen3.5:latest".to_string());
|
|
||||||
let mut scored: Vec<ScoredDocument> = Vec::with_capacity(req.documents.len());
|
|
||||||
|
|
||||||
for (i, doc) in req.documents.iter().enumerate() {
|
|
||||||
let prompt = format!(
|
|
||||||
"Rate the relevance of the following document to the query on a scale of 0 to 10. \
|
|
||||||
Respond with ONLY a number.\n\n\
|
|
||||||
Query: {}\n\n\
|
|
||||||
Document: {}\n\n\
|
|
||||||
Score:",
|
|
||||||
req.query, doc,
|
|
||||||
);
|
|
||||||
let resp = self.client
|
|
||||||
.post(format!("{}/api/generate", self.base_url))
|
|
||||||
.json(&serde_json::json!({
|
|
||||||
"model": &model,
|
|
||||||
"prompt": prompt,
|
|
||||||
"stream": false,
|
|
||||||
"options": {"temperature": 0.0, "num_predict": 8},
|
|
||||||
}))
|
|
||||||
.send()
|
|
||||||
.await
|
|
||||||
.map_err(|e| format!("rerank request failed: {e}"))?;
|
|
||||||
|
|
||||||
if !resp.status().is_success() {
|
|
||||||
let body = resp.text().await.unwrap_or_default();
|
|
||||||
return Err(format!("ollama rerank error: {body}"));
|
|
||||||
}
|
|
||||||
let parsed: serde_json::Value = resp.json().await
|
|
||||||
.map_err(|e| format!("rerank parse error: {e}"))?;
|
|
||||||
let text = parsed.get("response").and_then(|v| v.as_str()).unwrap_or("").trim();
|
|
||||||
// Parse the leading number; tolerate "7", "7.5", "7 — strong match".
|
|
||||||
let score = text.split_whitespace().next()
|
|
||||||
.and_then(|t| t.parse::<f64>().ok())
|
|
||||||
.unwrap_or(0.0)
|
|
||||||
.clamp(0.0, 10.0);
|
|
||||||
|
|
||||||
scored.push(ScoredDocument {
|
|
||||||
index: i,
|
|
||||||
text: doc.clone(),
|
|
||||||
score,
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
scored.sort_by(|a, b| b.score.partial_cmp(&a.score).unwrap_or(std::cmp::Ordering::Equal));
|
|
||||||
if let Some(k) = req.top_k {
|
|
||||||
scored.truncate(k);
|
|
||||||
}
|
|
||||||
Ok(RerankResponse { results: scored, model })
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Force Ollama to unload the named model from VRAM (keep_alive=0).
|
|
||||||
/// Used for predictable profile swaps — without this, Ollama holds a
|
|
||||||
/// model for its configured TTL (default 5min) and the previous
|
|
||||||
/// profile's model can linger in VRAM next to the new one.
|
|
||||||
pub async fn unload_model(&self, model: &str) -> Result<serde_json::Value, String> {
|
|
||||||
let resp = self.client
|
|
||||||
.post(format!("{}/api/generate", self.base_url))
|
|
||||||
.json(&serde_json::json!({
|
|
||||||
"model": model,
|
|
||||||
"prompt": "",
|
|
||||||
"keep_alive": 0,
|
|
||||||
"stream": false,
|
|
||||||
}))
|
|
||||||
.send().await
|
|
||||||
.map_err(|e| format!("unload request failed: {e}"))?;
|
|
||||||
if !resp.status().is_success() {
|
|
||||||
let text = resp.text().await.unwrap_or_default();
|
|
||||||
return Err(format!("ollama unload error: {text}"));
|
|
||||||
}
|
|
||||||
// Ollama returns 200 with the empty-prompt response shape.
|
|
||||||
// Fold into the legacy {"unloaded": "<model>"} envelope so
|
|
||||||
// callers' parsing doesn't break.
|
|
||||||
Ok(serde_json::json!({ "unloaded": model }))
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Ask Ollama to load the named model into VRAM proactively. Makes
|
|
||||||
/// the first real request after profile activation fast (no cold-load
|
|
||||||
/// latency). Empty prompts confuse some models, so we send a single
|
|
||||||
/// space + cap num_predict=1 (matches the sidecar's prior behavior).
|
|
||||||
pub async fn preload_model(&self, model: &str) -> Result<serde_json::Value, String> {
|
|
||||||
let resp = self.client
|
|
||||||
.post(format!("{}/api/generate", self.base_url))
|
|
||||||
.json(&serde_json::json!({
|
|
||||||
"model": model,
|
|
||||||
"prompt": " ",
|
|
||||||
"keep_alive": "5m",
|
|
||||||
"stream": false,
|
|
||||||
"options": {"num_predict": 1},
|
|
||||||
}))
|
|
||||||
.send().await
|
|
||||||
.map_err(|e| format!("preload request failed: {e}"))?;
|
|
||||||
if !resp.status().is_success() {
|
|
||||||
let text = resp.text().await.unwrap_or_default();
|
|
||||||
return Err(format!("ollama preload error: {text}"));
|
|
||||||
}
|
|
||||||
let parsed: serde_json::Value = resp.json().await
|
|
||||||
.map_err(|e| format!("preload parse error: {e}"))?;
|
|
||||||
Ok(serde_json::json!({
|
|
||||||
"preloaded": model,
|
|
||||||
"load_duration_ns": parsed.get("load_duration"),
|
|
||||||
"total_duration_ns": parsed.get("total_duration"),
|
|
||||||
}))
|
|
||||||
}
|
|
||||||
|
|
||||||
/// GPU + loaded-model snapshot. Combines nvidia-smi output (when
|
|
||||||
/// available) with Ollama's /api/ps. Same shape as the prior
|
|
||||||
/// sidecar /admin/vram endpoint so callers don't need updating.
|
|
||||||
pub async fn vram_snapshot(&self) -> Result<serde_json::Value, String> {
|
|
||||||
let resp = self.client
|
|
||||||
.get(format!("{}/api/ps", self.base_url))
|
|
||||||
.send().await
|
|
||||||
.map_err(|e| format!("ollama ps request failed: {e}"))?;
|
|
||||||
let loaded: Vec<serde_json::Value> = if resp.status().is_success() {
|
|
||||||
let parsed: serde_json::Value = resp.json().await.unwrap_or(serde_json::Value::Null);
|
|
||||||
parsed.get("models")
|
|
||||||
.and_then(|v| v.as_array())
|
|
||||||
.map(|arr| arr.iter().map(|m| serde_json::json!({
|
|
||||||
"name": m.get("name"),
|
|
||||||
"size_vram_mib": m.get("size_vram").and_then(|v| v.as_u64()).map(|n| n / (1024 * 1024)),
|
|
||||||
"expires_at": m.get("expires_at"),
|
|
||||||
})).collect())
|
|
||||||
.unwrap_or_default()
|
|
||||||
} else {
|
|
||||||
Vec::new()
|
|
||||||
};
|
|
||||||
|
|
||||||
let gpu = nvidia_smi_snapshot();
|
|
||||||
|
|
||||||
Ok(serde_json::json!({
|
|
||||||
"gpu": gpu,
|
|
||||||
"ollama_loaded": loaded,
|
|
||||||
}))
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/// One-shot nvidia-smi poll. Returns Null if the tool isn't on PATH
|
|
||||||
/// or the call fails. Mirrors the sidecar's `_nvidia_smi_snapshot`
|
|
||||||
/// shape exactly so callers reading vram_snapshot don't break.
|
|
||||||
fn nvidia_smi_snapshot() -> serde_json::Value {
|
|
||||||
use std::process::Command;
|
|
||||||
let out = Command::new("nvidia-smi")
|
|
||||||
.args([
|
|
||||||
"--query-gpu=memory.used,memory.total,utilization.gpu,name",
|
|
||||||
"--format=csv,noheader,nounits",
|
|
||||||
])
|
|
||||||
.output();
|
|
||||||
let stdout = match out {
|
|
||||||
Ok(o) if o.status.success() => o.stdout,
|
|
||||||
_ => return serde_json::Value::Null,
|
|
||||||
};
|
|
||||||
let line = String::from_utf8_lossy(&stdout);
|
|
||||||
let line = line.trim();
|
|
||||||
if line.is_empty() {
|
|
||||||
return serde_json::Value::Null;
|
|
||||||
}
|
|
||||||
let parts: Vec<&str> = line.split(',').map(|s| s.trim()).collect();
|
|
||||||
if parts.len() < 4 {
|
|
||||||
return serde_json::Value::Null;
|
|
||||||
}
|
|
||||||
let used = parts[0].parse::<u64>().unwrap_or(0);
|
|
||||||
let total = parts[1].parse::<u64>().unwrap_or(0);
|
|
||||||
let util = parts[2].parse::<u64>().unwrap_or(0);
|
|
||||||
serde_json::json!({
|
|
||||||
"name": parts[3],
|
|
||||||
"used_mib": used,
|
|
||||||
"total_mib": total,
|
|
||||||
"utilization_pct": util,
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|||||||
@@ -1,188 +0,0 @@
|
|||||||
//! Phase 21 — context-budget accounting for model calls.
|
|
||||||
//!
|
|
||||||
//! Ports `assertContextBudget` + `estimateTokens` + `CONTEXT_WINDOWS`
|
|
||||||
//! from `tests/multi-agent/agent.ts` so Rust-side callers (gateway
|
|
||||||
//! tool surfaces, future Rust agents) get the same loud-fail behavior
|
|
||||||
//! on window overflow instead of silent truncation.
|
|
||||||
//!
|
|
||||||
//! The token estimator is deliberately the same chars/4 heuristic as
|
|
||||||
//! the TS side. It's biased ~15% safe — pessimistic on English, correct
|
|
||||||
//! within a factor of 2 on code. Swap to a provider tokenizer only when
|
|
||||||
//! the estimator drives a decision (we're nowhere near that yet).
|
|
||||||
|
|
||||||
use std::collections::HashMap;
|
|
||||||
use std::sync::OnceLock;
|
|
||||||
|
|
||||||
// `estimate_tokens` moved to `shared::model_matrix::ModelMatrix::estimate_tokens`
|
|
||||||
// (cdc24d8). All callers migrated; the deprecated wrapper that stood in its
|
|
||||||
// place has been removed since it had zero external consumers.
|
|
||||||
|
|
||||||
/// Phase 21 — per-model context windows, mirroring the TS table in
|
|
||||||
/// `tests/multi-agent/agent.ts`. Anchored on each model's documented
|
|
||||||
/// max; unknown models fall back to `DEFAULT_CONTEXT_WINDOW`.
|
|
||||||
pub const DEFAULT_CONTEXT_WINDOW: usize = 32_768;
|
|
||||||
pub const DEFAULT_SAFETY_MARGIN: usize = 2_000;
|
|
||||||
pub const DEFAULT_MAX_TOKENS: usize = 800;
|
|
||||||
|
|
||||||
fn known_windows() -> &'static HashMap<&'static str, usize> {
|
|
||||||
static TABLE: OnceLock<HashMap<&'static str, usize>> = OnceLock::new();
|
|
||||||
TABLE.get_or_init(|| {
|
|
||||||
let mut m = HashMap::new();
|
|
||||||
m.insert("mistral:latest", 32_768);
|
|
||||||
m.insert("qwen2.5:latest", 32_768);
|
|
||||||
m.insert("qwen3:latest", 40_960);
|
|
||||||
m.insert("qwen3.5:latest", 262_144);
|
|
||||||
m.insert("qwen3-embedding", 32_768);
|
|
||||||
m.insert("nomic-embed-text-v2-moe", 2_048);
|
|
||||||
m.insert("gpt-oss:20b", 131_072);
|
|
||||||
m.insert("gpt-oss:120b", 131_072);
|
|
||||||
m.insert("qwen3.5:397b", 131_072);
|
|
||||||
m.insert("kimi-k2-thinking", 200_000);
|
|
||||||
m.insert("kimi-k2.6", 200_000);
|
|
||||||
m.insert("kimi-k2:1t", 1_048_576);
|
|
||||||
m.insert("deepseek-v3.1:671b", 131_072);
|
|
||||||
m.insert("glm-4.7", 131_072);
|
|
||||||
m
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn context_window_for(model: &str) -> usize {
|
|
||||||
known_windows().get(model).copied().unwrap_or(DEFAULT_CONTEXT_WINDOW)
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Result of a budget check — exposes the numbers so callers can log
|
|
||||||
/// how much headroom remains without re-running the estimator.
|
|
||||||
#[derive(Debug, Clone, Copy)]
|
|
||||||
pub struct BudgetCheck {
|
|
||||||
pub estimated: usize,
|
|
||||||
pub window: usize,
|
|
||||||
pub remaining: i64,
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Inputs to `assert_context_budget`. `bypass` exists for call sites
|
|
||||||
/// that handle their own overflow (continuation's second pass already
|
|
||||||
/// counted the partial; T5 gatekeeper prompts have a separate policy).
|
|
||||||
#[derive(Debug, Clone, Default)]
|
|
||||||
pub struct BudgetOpts<'a> {
|
|
||||||
pub system: Option<&'a str>,
|
|
||||||
pub max_tokens: Option<usize>,
|
|
||||||
pub safety_margin: Option<usize>,
|
|
||||||
pub bypass: bool,
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Phase 21's loud-fail primitive. Returns a `BudgetCheck` on success
|
|
||||||
/// and the same struct plus over-by count on failure. The whole point
|
|
||||||
/// is to stop silent truncation — callers that expect overflow should
|
|
||||||
/// chunk BEFORE calling or set `bypass: true`.
|
|
||||||
pub fn assert_context_budget(
|
|
||||||
model: &str,
|
|
||||||
prompt: &str,
|
|
||||||
opts: BudgetOpts,
|
|
||||||
) -> Result<BudgetCheck, (BudgetCheck, usize)> {
|
|
||||||
let window = context_window_for(model);
|
|
||||||
let safety = opts.safety_margin.unwrap_or(DEFAULT_SAFETY_MARGIN);
|
|
||||||
let max_tokens = opts.max_tokens.unwrap_or(DEFAULT_MAX_TOKENS);
|
|
||||||
let sys_tokens = opts.system.map(shared::model_matrix::ModelMatrix::estimate_tokens).unwrap_or(0);
|
|
||||||
let estimated = shared::model_matrix::ModelMatrix::estimate_tokens(prompt) + sys_tokens + max_tokens;
|
|
||||||
let remaining = window as i64 - estimated as i64 - safety as i64;
|
|
||||||
let check = BudgetCheck { estimated, window, remaining };
|
|
||||||
if remaining < 0 && !opts.bypass {
|
|
||||||
return Err((check, (-remaining) as usize));
|
|
||||||
}
|
|
||||||
Ok(check)
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Convenience — format an overflow error the same way the TS side
|
|
||||||
/// does. Exposed so downstream crates render consistent messages.
|
|
||||||
pub fn overflow_message(model: &str, check: &BudgetCheck, over_by: usize, safety: usize) -> String {
|
|
||||||
format!(
|
|
||||||
"context overflow: model={} est={}t window={}t safety={}t over={}t. \
|
|
||||||
Chunk the prompt (see config/models.json overflow_policies) or set \
|
|
||||||
bypass:true if you know the risk.",
|
|
||||||
model, check.estimated, check.window, safety, over_by,
|
|
||||||
)
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use super::*;
|
|
||||||
|
|
||||||
// Deprecated-function behavior is now canonically tested in
|
|
||||||
// crates/shared/src/model_matrix.rs. This test was the legacy
|
|
||||||
// pin that preceded the migration; delete when the deprecated
|
|
||||||
// wrapper itself goes (see the #[deprecated] attribute).
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn context_window_known_and_fallback() {
|
|
||||||
assert_eq!(context_window_for("qwen3.5:latest"), 262_144);
|
|
||||||
assert_eq!(context_window_for("kimi-k2:1t"), 1_048_576);
|
|
||||||
assert_eq!(context_window_for("some-unreleased-model"), DEFAULT_CONTEXT_WINDOW);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn budget_passes_well_under_window() {
|
|
||||||
let check = assert_context_budget(
|
|
||||||
"qwen3:latest",
|
|
||||||
&"x".repeat(4_000), // ~1000 tokens
|
|
||||||
BudgetOpts { max_tokens: Some(500), ..Default::default() },
|
|
||||||
).expect("well under 40K window");
|
|
||||||
assert!(check.remaining > 30_000);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn budget_fails_when_prompt_overflows_window() {
|
|
||||||
let huge = "x".repeat(200_000); // ~50K tokens, over qwen3's 40K
|
|
||||||
let err = assert_context_budget(
|
|
||||||
"qwen3:latest",
|
|
||||||
&huge,
|
|
||||||
BudgetOpts::default(),
|
|
||||||
).expect_err("should overflow qwen3's 40K window");
|
|
||||||
assert!(err.1 > 0, "over_by must be positive");
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn budget_bypass_returns_ok_even_over() {
|
|
||||||
let huge = "x".repeat(200_000);
|
|
||||||
let check = assert_context_budget(
|
|
||||||
"qwen3:latest",
|
|
||||||
&huge,
|
|
||||||
BudgetOpts { bypass: true, ..Default::default() },
|
|
||||||
).expect("bypass must suppress the error");
|
|
||||||
assert!(check.remaining < 0, "check still reports negative remaining");
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn budget_counts_system_prompt() {
|
|
||||||
// 10K-char system prompt → ~2500 tokens. With a big max_tokens
|
|
||||||
// this should push us closer to the window.
|
|
||||||
let sys = "s".repeat(10_000);
|
|
||||||
let prompt = "p".repeat(4_000);
|
|
||||||
let with_sys = assert_context_budget(
|
|
||||||
"qwen3:latest",
|
|
||||||
&prompt,
|
|
||||||
BudgetOpts {
|
|
||||||
system: Some(&sys),
|
|
||||||
max_tokens: Some(500),
|
|
||||||
..Default::default()
|
|
||||||
},
|
|
||||||
).unwrap();
|
|
||||||
let without_sys = assert_context_budget(
|
|
||||||
"qwen3:latest",
|
|
||||||
&prompt,
|
|
||||||
BudgetOpts { max_tokens: Some(500), ..Default::default() },
|
|
||||||
).unwrap();
|
|
||||||
assert!(with_sys.estimated > without_sys.estimated,
|
|
||||||
"system prompt should raise estimate");
|
|
||||||
assert_eq!(with_sys.estimated - without_sys.estimated, shared::model_matrix::ModelMatrix::estimate_tokens(&sys));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn overflow_message_includes_numbers() {
|
|
||||||
let check = BudgetCheck { estimated: 42_000, window: 40_960, remaining: -1_040 };
|
|
||||||
let msg = overflow_message("qwen3:latest", &check, 3_040, 2_000);
|
|
||||||
assert!(msg.contains("qwen3:latest"));
|
|
||||||
assert!(msg.contains("42000t"));
|
|
||||||
assert!(msg.contains("40960t"));
|
|
||||||
assert!(msg.contains("3040t"));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,464 +0,0 @@
|
|||||||
//! Phase 21 — OUTPUT-overflow handler. Ports `generateContinuable`
|
|
||||||
//! from `tests/multi-agent/agent.ts`.
|
|
||||||
//!
|
|
||||||
//! Two failure modes to repair:
|
|
||||||
//!
|
|
||||||
//! * EMPTY response — thinking model ate the entire budget on hidden
|
|
||||||
//! reasoning before emitting a token. Fix: retry the original prompt
|
|
||||||
//! with 2× the budget, geometric up to `BUDGET_CAP`.
|
|
||||||
//!
|
|
||||||
//! * TRUNCATED non-empty — model got most of the way but hit
|
|
||||||
//! max_tokens before closing the structure. Fix: continue with the
|
|
||||||
//! partial response in the prompt as scratchpad, so the model knows
|
|
||||||
//! where to pick up without restarting.
|
|
||||||
//!
|
|
||||||
//! `TextGenerator` abstracts the sidecar so tests can inject canned
|
|
||||||
//! responses without a live Ollama.
|
|
||||||
|
|
||||||
use std::future::Future;
|
|
||||||
|
|
||||||
use crate::client::{AiClient, GenerateRequest, GenerateResponse};
|
|
||||||
|
|
||||||
/// Shape classifier for `is_structurally_complete`. JSON responses
|
|
||||||
/// must parse; text responses just need to be non-empty.
|
|
||||||
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
|
|
||||||
pub enum ResponseShape {
|
|
||||||
Json,
|
|
||||||
Text,
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Trait that `generate_continuable` + `generate_tree_split` call. The
|
|
||||||
/// real implementation forwards to `AiClient::generate`; tests supply a
|
|
||||||
/// mock with a scripted sequence of responses.
|
|
||||||
pub trait TextGenerator: Send + Sync {
|
|
||||||
fn generate_text(
|
|
||||||
&self,
|
|
||||||
req: GenerateRequest,
|
|
||||||
) -> impl Future<Output = Result<GenerateResponse, String>> + Send;
|
|
||||||
}
|
|
||||||
|
|
||||||
impl TextGenerator for AiClient {
|
|
||||||
fn generate_text(
|
|
||||||
&self,
|
|
||||||
req: GenerateRequest,
|
|
||||||
) -> impl Future<Output = Result<GenerateResponse, String>> + Send {
|
|
||||||
self.generate(req)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Strip a surrounding ```json``` fence if present. Leaves the inner
|
|
||||||
/// content alone otherwise. Returns a slice of `s`.
|
|
||||||
fn strip_json_fence(s: &str) -> &str {
|
|
||||||
let t = s.trim();
|
|
||||||
if let Some(rest) = t.strip_prefix("```json") {
|
|
||||||
rest.trim_start_matches('\n').strip_suffix("```").unwrap_or(rest).trim()
|
|
||||||
} else if let Some(rest) = t.strip_prefix("```") {
|
|
||||||
rest.trim_start_matches('\n').strip_suffix("```").unwrap_or(rest).trim()
|
|
||||||
} else {
|
|
||||||
t
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Port of the TS brace-balance + JSON.parse check. Returns true when
|
|
||||||
/// the outermost `{...}` block is balanced and parses. Text shape is
|
|
||||||
/// satisfied by any non-empty, non-whitespace payload.
|
|
||||||
pub fn is_structurally_complete(text: &str, shape: ResponseShape) -> bool {
|
|
||||||
if text.trim().is_empty() { return false; }
|
|
||||||
if shape == ResponseShape::Text { return true; }
|
|
||||||
|
|
||||||
let s = strip_json_fence(text);
|
|
||||||
let Some(start) = s.find('{') else { return false };
|
|
||||||
let Some(end) = s.rfind('}') else { return false };
|
|
||||||
if end <= start { return false; }
|
|
||||||
let slice = &s[start..=end];
|
|
||||||
|
|
||||||
// Balance check — cheaper than parse, catches truncated nests.
|
|
||||||
// String state tracked because `{` inside a string doesn't count.
|
|
||||||
let mut depth: i32 = 0;
|
|
||||||
let mut in_str = false;
|
|
||||||
let mut esc = false;
|
|
||||||
for c in slice.chars() {
|
|
||||||
if esc { esc = false; continue; }
|
|
||||||
if c == '\\' { esc = true; continue; }
|
|
||||||
if c == '"' { in_str = !in_str; continue; }
|
|
||||||
if in_str { continue; }
|
|
||||||
if c == '{' { depth += 1; }
|
|
||||||
else if c == '}' {
|
|
||||||
depth -= 1;
|
|
||||||
if depth < 0 { return false; }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if depth != 0 { return false; }
|
|
||||||
// Parse check is the tie-breaker — balanced but invalid JSON (e.g.
|
|
||||||
// trailing comma before `}`) shouldn't count as complete.
|
|
||||||
serde_json::from_str::<serde_json::Value>(slice).is_ok()
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Knobs for `generate_continuable`. All optional with sensible
|
|
||||||
/// defaults that match the TS version.
|
|
||||||
#[derive(Debug, Clone)]
|
|
||||||
pub struct ContinuableOpts {
|
|
||||||
pub model: String,
|
|
||||||
pub max_tokens: Option<u32>,
|
|
||||||
pub temperature: Option<f64>,
|
|
||||||
pub system: Option<String>,
|
|
||||||
pub shape: ResponseShape,
|
|
||||||
pub max_continuations: usize,
|
|
||||||
pub think: Option<bool>,
|
|
||||||
/// Geometric-backoff ceiling for the empty-response retry path.
|
|
||||||
/// Matches TS's `budgetCap = 8000`.
|
|
||||||
pub budget_cap: u32,
|
|
||||||
/// Maximum empty-response retries before giving up. Matches TS's
|
|
||||||
/// hardcoded `retry < 3`.
|
|
||||||
pub max_empty_retries: usize,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl ContinuableOpts {
|
|
||||||
pub fn new(model: impl Into<String>) -> Self {
|
|
||||||
Self {
|
|
||||||
model: model.into(),
|
|
||||||
max_tokens: None,
|
|
||||||
temperature: None,
|
|
||||||
system: None,
|
|
||||||
shape: ResponseShape::Json,
|
|
||||||
max_continuations: 3,
|
|
||||||
think: None,
|
|
||||||
budget_cap: 8_000,
|
|
||||||
max_empty_retries: 3,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Outcome of a `generate_continuable` call. Carries the combined
|
|
||||||
/// text plus diagnostic counters so observability downstream can
|
|
||||||
/// report "how many continuations did that query cost".
|
|
||||||
#[derive(Debug, Clone)]
|
|
||||||
pub struct ContinuableOutcome {
|
|
||||||
pub text: String,
|
|
||||||
pub empty_retries: usize,
|
|
||||||
pub continuations: usize,
|
|
||||||
pub final_complete: bool,
|
|
||||||
/// Sum of `prompt_tokens` across every generator call made to
|
|
||||||
/// produce this outcome — including empty retries and continuations.
|
|
||||||
/// Lets callers (gateway execution loop, observability) stamp
|
|
||||||
/// accurate per-task usage without second-guessing the retry fan-out.
|
|
||||||
pub prompt_tokens: u32,
|
|
||||||
/// Sum of `completion_tokens` across every generator call.
|
|
||||||
pub completion_tokens: u32,
|
|
||||||
/// Total number of generator calls. `1 + empty_retries +
|
|
||||||
/// continuations` in the normal case; the field is explicit so
|
|
||||||
/// callers don't have to re-derive it.
|
|
||||||
pub calls: u32,
|
|
||||||
}
|
|
||||||
|
|
||||||
fn make_request(opts: &ContinuableOpts, prompt: String, current_max: u32) -> GenerateRequest {
|
|
||||||
GenerateRequest {
|
|
||||||
prompt,
|
|
||||||
model: Some(opts.model.clone()),
|
|
||||||
system: opts.system.clone(),
|
|
||||||
temperature: opts.temperature,
|
|
||||||
max_tokens: Some(current_max),
|
|
||||||
think: opts.think,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn continuation_prompt(original: &str, partial: &str) -> String {
|
|
||||||
format!(
|
|
||||||
"{original}\n\n\
|
|
||||||
PARTIAL RESPONSE SO FAR (continue from here — do NOT restart, \
|
|
||||||
do NOT repeat what's already there, emit ONLY the remaining \
|
|
||||||
tokens to close the structure):\n{partial}"
|
|
||||||
)
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Phase 21 — output-overflow safe generate. See module docs for the
|
|
||||||
/// two failure modes repaired. On final-still-incomplete, returns the
|
|
||||||
/// combined text with `final_complete: false` so the caller's parser
|
|
||||||
/// can throw with the raw text for forensics rather than silently
|
|
||||||
/// truncating.
|
|
||||||
pub async fn generate_continuable<G: TextGenerator>(
|
|
||||||
generator: &G,
|
|
||||||
prompt: &str,
|
|
||||||
opts: &ContinuableOpts,
|
|
||||||
) -> Result<ContinuableOutcome, String> {
|
|
||||||
let initial_max = opts.max_tokens.unwrap_or(800);
|
|
||||||
let mut current_max = initial_max;
|
|
||||||
let mut combined = String::new();
|
|
||||||
let mut empty_retries = 0usize;
|
|
||||||
let mut continuations = 0usize;
|
|
||||||
let mut prompt_tokens: u32 = 0;
|
|
||||||
let mut completion_tokens: u32 = 0;
|
|
||||||
let mut calls: u32 = 0;
|
|
||||||
|
|
||||||
// Phase 21(a) — empty-response backoff loop.
|
|
||||||
for retry in 0..opts.max_empty_retries {
|
|
||||||
let req = make_request(opts, prompt.to_string(), current_max);
|
|
||||||
let resp = generator.generate_text(req).await?;
|
|
||||||
calls += 1;
|
|
||||||
// u32::try_from saturates at u32::MAX instead of silently
|
|
||||||
// truncating bits when tokens_evaluated/_generated comes back
|
|
||||||
// as a u64 > 4 billion. Caught 2026-04-27 by Opus self-audit.
|
|
||||||
prompt_tokens = prompt_tokens.saturating_add(u32::try_from(resp.tokens_evaluated.unwrap_or(0)).unwrap_or(u32::MAX));
|
|
||||||
completion_tokens = completion_tokens.saturating_add(u32::try_from(resp.tokens_generated.unwrap_or(0)).unwrap_or(u32::MAX));
|
|
||||||
if !resp.text.trim().is_empty() {
|
|
||||||
combined = resp.text;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
empty_retries = retry + 1;
|
|
||||||
current_max = (current_max.saturating_mul(2)).min(opts.budget_cap);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Phase 21(b) — structural-completion continuation loop.
|
|
||||||
for _ in 0..opts.max_continuations {
|
|
||||||
if is_structurally_complete(&combined, opts.shape) {
|
|
||||||
return Ok(ContinuableOutcome {
|
|
||||||
text: combined,
|
|
||||||
empty_retries,
|
|
||||||
continuations,
|
|
||||||
final_complete: true,
|
|
||||||
prompt_tokens,
|
|
||||||
completion_tokens,
|
|
||||||
calls,
|
|
||||||
});
|
|
||||||
}
|
|
||||||
if combined.trim().is_empty() {
|
|
||||||
// Nothing to continue from — continuing "" is identical to
|
|
||||||
// the initial call and would loop.
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
let cont_prompt = continuation_prompt(prompt, &combined);
|
|
||||||
let req = make_request(opts, cont_prompt, current_max.min(opts.budget_cap));
|
|
||||||
let resp = generator.generate_text(req).await?;
|
|
||||||
calls += 1;
|
|
||||||
prompt_tokens = prompt_tokens.saturating_add(u32::try_from(resp.tokens_evaluated.unwrap_or(0)).unwrap_or(u32::MAX));
|
|
||||||
completion_tokens = completion_tokens.saturating_add(u32::try_from(resp.tokens_generated.unwrap_or(0)).unwrap_or(u32::MAX));
|
|
||||||
combined.push_str(&resp.text);
|
|
||||||
continuations += 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
let final_complete = is_structurally_complete(&combined, opts.shape);
|
|
||||||
Ok(ContinuableOutcome {
|
|
||||||
text: combined,
|
|
||||||
empty_retries,
|
|
||||||
continuations,
|
|
||||||
final_complete,
|
|
||||||
prompt_tokens,
|
|
||||||
completion_tokens,
|
|
||||||
calls,
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Scripted generator for unit tests. Returns responses from `script`
|
|
||||||
/// in order; extra calls reuse the last entry so tests don't have to
|
|
||||||
/// count past what they actually assert on.
|
|
||||||
#[cfg(test)]
|
|
||||||
pub struct ScriptedGenerator {
|
|
||||||
script: Vec<Result<String, String>>,
|
|
||||||
calls: std::sync::Arc<std::sync::Mutex<Vec<GenerateRequest>>>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
impl ScriptedGenerator {
|
|
||||||
pub fn new<I>(script: I) -> Self
|
|
||||||
where
|
|
||||||
I: IntoIterator<Item = Result<String, String>>,
|
|
||||||
{
|
|
||||||
Self {
|
|
||||||
script: script.into_iter().collect(),
|
|
||||||
calls: std::sync::Arc::new(std::sync::Mutex::new(Vec::new())),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn calls(&self) -> Vec<GenerateRequest> {
|
|
||||||
self.calls.lock().unwrap().clone()
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn call_count(&self) -> usize {
|
|
||||||
self.calls.lock().unwrap().len()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
impl TextGenerator for ScriptedGenerator {
|
|
||||||
fn generate_text(
|
|
||||||
&self,
|
|
||||||
req: GenerateRequest,
|
|
||||||
) -> impl Future<Output = Result<GenerateResponse, String>> + Send {
|
|
||||||
let i = {
|
|
||||||
let mut calls = self.calls.lock().unwrap();
|
|
||||||
let i = calls.len();
|
|
||||||
calls.push(req.clone());
|
|
||||||
i
|
|
||||||
};
|
|
||||||
let model = req.model.clone().unwrap_or_default();
|
|
||||||
let entry = self.script.get(i)
|
|
||||||
.cloned()
|
|
||||||
.unwrap_or_else(|| self.script.last().cloned().unwrap_or(Ok(String::new())));
|
|
||||||
async move {
|
|
||||||
entry.map(|text| GenerateResponse {
|
|
||||||
text,
|
|
||||||
model,
|
|
||||||
tokens_evaluated: None,
|
|
||||||
tokens_generated: None,
|
|
||||||
})
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use super::*;
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn structural_complete_rejects_empty_and_text_mismatch() {
|
|
||||||
assert!(!is_structurally_complete("", ResponseShape::Text));
|
|
||||||
assert!(!is_structurally_complete(" ", ResponseShape::Text));
|
|
||||||
assert!(is_structurally_complete("any content", ResponseShape::Text));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn structural_complete_handles_balanced_json() {
|
|
||||||
assert!(is_structurally_complete(r#"{"a": 1}"#, ResponseShape::Json));
|
|
||||||
assert!(is_structurally_complete(
|
|
||||||
r#"```json
|
|
||||||
{"a": 1, "b": [1, 2, 3]}
|
|
||||||
```"#,
|
|
||||||
ResponseShape::Json,
|
|
||||||
));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn structural_complete_rejects_truncated_json() {
|
|
||||||
assert!(!is_structurally_complete(r#"{"a": 1"#, ResponseShape::Json));
|
|
||||||
assert!(!is_structurally_complete(r#"{"a": {"b": 1"#, ResponseShape::Json));
|
|
||||||
// Trailing comma — balanced but unparseable
|
|
||||||
assert!(!is_structurally_complete(r#"{"a": 1,}"#, ResponseShape::Json));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn structural_complete_ignores_braces_inside_strings() {
|
|
||||||
assert!(is_structurally_complete(r#"{"s": "has } inside"}"#, ResponseShape::Json));
|
|
||||||
assert!(is_structurally_complete(r#"{"s": "escaped \" quote"}"#, ResponseShape::Json));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn continuable_returns_first_response_when_complete() {
|
|
||||||
let generator = ScriptedGenerator::new(vec![Ok(r#"{"ok": true}"#.to_string())]);
|
|
||||||
let opts = ContinuableOpts::new("qwen3:latest");
|
|
||||||
let out = generate_continuable(&generator, "test", &opts).await.unwrap();
|
|
||||||
assert!(out.final_complete);
|
|
||||||
assert_eq!(out.empty_retries, 0);
|
|
||||||
assert_eq!(out.continuations, 0);
|
|
||||||
assert_eq!(generator.call_count(), 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn continuable_retries_on_empty_with_doubled_budget() {
|
|
||||||
// Two empties, then a good response. Third call should see 4×
|
|
||||||
// the initial budget (2× twice).
|
|
||||||
let generator = ScriptedGenerator::new(vec![
|
|
||||||
Ok("".to_string()),
|
|
||||||
Ok("".to_string()),
|
|
||||||
Ok(r#"{"ok": true}"#.to_string()),
|
|
||||||
]);
|
|
||||||
let mut opts = ContinuableOpts::new("qwen3:latest");
|
|
||||||
opts.max_tokens = Some(100);
|
|
||||||
let out = generate_continuable(&generator, "test", &opts).await.unwrap();
|
|
||||||
assert!(out.final_complete);
|
|
||||||
assert_eq!(out.empty_retries, 2);
|
|
||||||
|
|
||||||
let calls = generator.calls();
|
|
||||||
assert_eq!(calls.len(), 3);
|
|
||||||
assert_eq!(calls[0].max_tokens, Some(100));
|
|
||||||
assert_eq!(calls[1].max_tokens, Some(200));
|
|
||||||
assert_eq!(calls[2].max_tokens, Some(400));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn continuable_caps_budget_at_budget_cap() {
|
|
||||||
let generator = ScriptedGenerator::new(vec![
|
|
||||||
Ok("".to_string()),
|
|
||||||
Ok("".to_string()),
|
|
||||||
Ok(r#"{"ok":1}"#.to_string()),
|
|
||||||
]);
|
|
||||||
let mut opts = ContinuableOpts::new("qwen3:latest");
|
|
||||||
opts.max_tokens = Some(5_000);
|
|
||||||
opts.budget_cap = 7_000;
|
|
||||||
let out = generate_continuable(&generator, "test", &opts).await.unwrap();
|
|
||||||
assert!(out.final_complete);
|
|
||||||
let calls = generator.calls();
|
|
||||||
// 5000 → doubled would be 10000; cap pulls it to 7000.
|
|
||||||
assert_eq!(calls[1].max_tokens, Some(7_000));
|
|
||||||
assert_eq!(calls[2].max_tokens, Some(7_000));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn continuable_glues_truncated_response() {
|
|
||||||
// First call returns balanced-open `{...`; continuation closes
|
|
||||||
// it with `...}`. Combined must parse.
|
|
||||||
let generator = ScriptedGenerator::new(vec![
|
|
||||||
Ok(r#"{"fills": [{"candidate_id": "C-001""#.to_string()),
|
|
||||||
Ok(r#", "name": "Alice"}]}"#.to_string()),
|
|
||||||
]);
|
|
||||||
let opts = ContinuableOpts::new("qwen3:latest");
|
|
||||||
let out = generate_continuable(&generator, "ORIGINAL", &opts).await.unwrap();
|
|
||||||
assert!(out.final_complete, "combined must parse: {}", out.text);
|
|
||||||
assert_eq!(out.continuations, 1);
|
|
||||||
|
|
||||||
let calls = generator.calls();
|
|
||||||
assert_eq!(calls.len(), 2);
|
|
||||||
// Continuation prompt must contain the partial — that's the
|
|
||||||
// scratchpad primitive J called out.
|
|
||||||
let cont_prompt = &calls[1].prompt;
|
|
||||||
assert!(cont_prompt.contains("ORIGINAL"),
|
|
||||||
"continuation must include original prompt");
|
|
||||||
assert!(cont_prompt.contains(r#"{"fills": [{"candidate_id": "C-001""#),
|
|
||||||
"continuation must include partial");
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn continuable_does_not_loop_on_persistent_empty() {
|
|
||||||
// All three retries return empty; we must NOT then enter the
|
|
||||||
// continuation loop with an empty partial (would burn 3 more
|
|
||||||
// calls continuing from "").
|
|
||||||
let generator = ScriptedGenerator::new(vec![
|
|
||||||
Ok("".to_string()),
|
|
||||||
Ok("".to_string()),
|
|
||||||
Ok("".to_string()),
|
|
||||||
]);
|
|
||||||
let opts = ContinuableOpts::new("qwen3:latest");
|
|
||||||
let out = generate_continuable(&generator, "test", &opts).await.unwrap();
|
|
||||||
assert!(!out.final_complete);
|
|
||||||
assert_eq!(out.empty_retries, 3);
|
|
||||||
assert_eq!(out.continuations, 0, "must not continue from empty");
|
|
||||||
assert_eq!(generator.call_count(), 3);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn continuable_returns_raw_on_exhausted_continuations() {
|
|
||||||
// Three continuations that never complete — caller's parser
|
|
||||||
// will throw. We must return the combined text so forensics
|
|
||||||
// has the raw content, not a lossy truncation.
|
|
||||||
let generator = ScriptedGenerator::new(vec![
|
|
||||||
Ok(r#"{"a": ["#.to_string()),
|
|
||||||
Ok("1,".to_string()),
|
|
||||||
Ok("2,".to_string()),
|
|
||||||
Ok("3,".to_string()),
|
|
||||||
]);
|
|
||||||
let mut opts = ContinuableOpts::new("qwen3:latest");
|
|
||||||
opts.max_continuations = 3;
|
|
||||||
let out = generate_continuable(&generator, "test", &opts).await.unwrap();
|
|
||||||
assert!(!out.final_complete);
|
|
||||||
assert_eq!(out.continuations, 3);
|
|
||||||
assert!(out.text.contains(r#"{"a": ["#));
|
|
||||||
assert!(out.text.contains("3,"));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn continuable_propagates_generator_errors() {
|
|
||||||
let generator = ScriptedGenerator::new(vec![Err("sidecar 503".to_string())]);
|
|
||||||
let opts = ContinuableOpts::new("qwen3:latest");
|
|
||||||
let err = generate_continuable(&generator, "test", &opts).await.unwrap_err();
|
|
||||||
assert!(err.contains("503"));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,8 +1,2 @@
|
|||||||
pub mod client;
|
pub mod client;
|
||||||
pub mod context;
|
|
||||||
pub mod continuation;
|
|
||||||
pub mod provider;
|
|
||||||
pub mod providers;
|
|
||||||
pub mod routing;
|
|
||||||
pub mod service;
|
pub mod service;
|
||||||
pub mod tree_split;
|
|
||||||
|
|||||||
@@ -1,39 +0,0 @@
|
|||||||
use async_trait::async_trait;
|
|
||||||
use crate::client::{GenerateRequest, GenerateResponse, EmbedRequest, EmbedResponse};
|
|
||||||
|
|
||||||
#[async_trait]
|
|
||||||
pub trait ProviderAdapter: Send + Sync {
|
|
||||||
/// Name for routing (ollama, openrouter, etc.)
|
|
||||||
fn name(&self) -> &str;
|
|
||||||
|
|
||||||
/// Chat completion — returns text, model, token counts
|
|
||||||
async fn chat(&self, req: GenerateRequest) -> Result<GenerateResponse, String>;
|
|
||||||
|
|
||||||
/// Embeddings — returns vectors, model, dimensions
|
|
||||||
async fn embed(&self, req: EmbedRequest) -> Result<EmbedResponse, String>;
|
|
||||||
|
|
||||||
/// Unload model from VRAM (optional, no-op if not supported)
|
|
||||||
async fn unload(&self, _model: &str) -> Result<(), String> {
|
|
||||||
Ok(())
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Health check
|
|
||||||
async fn health(&self) -> Result<serde_json::Value, String>;
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Routing key extracted from model name.
|
|
||||||
/// - "qwen3.5:latest" → "ollama"
|
|
||||||
/// - "openrouter/anthropic/claude-3.5-sonnet" → "openrouter"
|
|
||||||
/// - "gpt-4o" → "ollama" (default)
|
|
||||||
pub fn provider_key(model: &str) -> &'static str {
|
|
||||||
let lower = model.to_lowercase();
|
|
||||||
if lower.starts_with("openrouter/") {
|
|
||||||
"openrouter"
|
|
||||||
} else if lower.starts_with("gemini") {
|
|
||||||
"gemini"
|
|
||||||
} else if lower.starts_with("claude") {
|
|
||||||
"claude"
|
|
||||||
} else {
|
|
||||||
"ollama" // default: local Ollama
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,2 +0,0 @@
|
|||||||
pub mod ollama;
|
|
||||||
pub mod openrouter;
|
|
||||||
@@ -1,37 +0,0 @@
|
|||||||
use async_trait::async_trait;
|
|
||||||
use crate::client::{AiClient, GenerateRequest, GenerateResponse, EmbedRequest, EmbedResponse};
|
|
||||||
use crate::provider::ProviderAdapter;
|
|
||||||
|
|
||||||
pub struct OllamaAdapter {
|
|
||||||
client: AiClient,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl OllamaAdapter {
|
|
||||||
pub fn new(client: AiClient) -> Self {
|
|
||||||
Self { client }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[async_trait]
|
|
||||||
impl ProviderAdapter for OllamaAdapter {
|
|
||||||
fn name(&self) -> &str {
|
|
||||||
"ollama"
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn chat(&self, req: GenerateRequest) -> Result<GenerateResponse, String> {
|
|
||||||
self.client.generate(req).await
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn embed(&self, req: EmbedRequest) -> Result<EmbedResponse, String> {
|
|
||||||
self.client.embed(req).await
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn unload(&self, model: &str) -> Result<(), String> {
|
|
||||||
let _: serde_json::Value = self.client.unload_model(model).await?;
|
|
||||||
Ok(())
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn health(&self) -> Result<serde_json::Value, String> {
|
|
||||||
self.client.health().await
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,152 +0,0 @@
|
|||||||
use async_trait::async_trait;
|
|
||||||
use reqwest::Client;
|
|
||||||
use serde::{Deserialize, Serialize};
|
|
||||||
use std::time::Duration;
|
|
||||||
|
|
||||||
use crate::client::{GenerateRequest, GenerateResponse, EmbedRequest, EmbedResponse};
|
|
||||||
use crate::provider::ProviderAdapter;
|
|
||||||
|
|
||||||
pub struct OpenRouterAdapter {
|
|
||||||
client: Client,
|
|
||||||
base_url: String,
|
|
||||||
api_key: String,
|
|
||||||
default_model: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct OpenRouterChatRequest {
|
|
||||||
model: String,
|
|
||||||
messages: Vec<OpenRouterMessage>,
|
|
||||||
temperature: Option<f64>,
|
|
||||||
max_tokens: Option<u32>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct OpenRouterMessage {
|
|
||||||
role: String,
|
|
||||||
content: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct OpenRouterChatResponse {
|
|
||||||
choices: Vec<OpenRouterChoice>,
|
|
||||||
usage: OpenRouterUsage,
|
|
||||||
model: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct OpenRouterChoice {
|
|
||||||
message: OpenRouterMessageOut,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
#[allow(dead_code)]
|
|
||||||
struct OpenRouterMessageOut {
|
|
||||||
role: String,
|
|
||||||
content: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
#[allow(dead_code)]
|
|
||||||
struct OpenRouterUsage {
|
|
||||||
prompt_tokens: Option<u32>,
|
|
||||||
completion_tokens: Option<u32>,
|
|
||||||
total_tokens: Option<u32>,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl OpenRouterAdapter {
|
|
||||||
pub fn new(base_url: &str, api_key: String, default_model: &str) -> Self {
|
|
||||||
let client = Client::builder()
|
|
||||||
.timeout(Duration::from_secs(180))
|
|
||||||
.build()
|
|
||||||
.expect("failed to build HTTP client");
|
|
||||||
Self {
|
|
||||||
client,
|
|
||||||
base_url: base_url.trim_end_matches('/').to_string(),
|
|
||||||
api_key,
|
|
||||||
default_model: default_model.to_string(),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn chat_model(&self, model: &str) -> String {
|
|
||||||
// Strip "openrouter/" prefix if present
|
|
||||||
let m = model.trim_start_matches("openrouter/");
|
|
||||||
if m.is_empty() || m == model {
|
|
||||||
self.default_model.clone()
|
|
||||||
} else {
|
|
||||||
m.to_string()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn to_openrouter_messages(req: &GenerateRequest) -> Vec<OpenRouterMessage> {
|
|
||||||
let mut out = vec![];
|
|
||||||
if let Some(sys) = &req.system {
|
|
||||||
out.push(OpenRouterMessage { role: "system".into(), content: sys.clone() });
|
|
||||||
}
|
|
||||||
out.push(OpenRouterMessage {
|
|
||||||
role: "user".into(),
|
|
||||||
content: req.prompt.clone(),
|
|
||||||
});
|
|
||||||
out
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[async_trait]
|
|
||||||
impl ProviderAdapter for OpenRouterAdapter {
|
|
||||||
fn name(&self) -> &str {
|
|
||||||
"openrouter"
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn chat(&self, req: GenerateRequest) -> Result<GenerateResponse, String> {
|
|
||||||
let model = self.chat_model(req.model.as_deref().unwrap_or(""));
|
|
||||||
let or_req = OpenRouterChatRequest {
|
|
||||||
model: model.clone(),
|
|
||||||
messages: OpenRouterAdapter::to_openrouter_messages(&req),
|
|
||||||
temperature: req.temperature,
|
|
||||||
max_tokens: req.max_tokens,
|
|
||||||
};
|
|
||||||
|
|
||||||
let resp = self.client
|
|
||||||
.post(format!("{}/chat/completions", self.base_url))
|
|
||||||
.header("Authorization", format!("Bearer {}", self.api_key))
|
|
||||||
.header("Content-Type", "application/json")
|
|
||||||
.json(&or_req)
|
|
||||||
.send()
|
|
||||||
.await
|
|
||||||
.map_err(|e| format!("openrouter request failed: {e}"))?;
|
|
||||||
|
|
||||||
let status = resp.status();
|
|
||||||
let body = resp.text().await.unwrap_or_default();
|
|
||||||
|
|
||||||
if !status.is_success() {
|
|
||||||
return Err(format!("openrouter error ({}): {}", status, body));
|
|
||||||
}
|
|
||||||
|
|
||||||
let or_resp: OpenRouterChatResponse = serde_json::from_str(&body)
|
|
||||||
.map_err(|e| format!("openrouter parse error: {e}"))?;
|
|
||||||
|
|
||||||
let choice = or_resp.choices.into_iter().next()
|
|
||||||
.ok_or("no completion choice returned")?;
|
|
||||||
let usage = or_resp.usage;
|
|
||||||
|
|
||||||
Ok(GenerateResponse {
|
|
||||||
text: choice.message.content,
|
|
||||||
model: or_resp.model,
|
|
||||||
tokens_evaluated: usage.prompt_tokens.map(|n| n as u64),
|
|
||||||
tokens_generated: usage.completion_tokens.map(|n| n as u64),
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn embed(&self, _req: EmbedRequest) -> Result<EmbedResponse, String> {
|
|
||||||
Err("openrouter: embed not implemented".into())
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn health(&self) -> Result<serde_json::Value, String> {
|
|
||||||
// OpenRouter doesn't have a dedicated health endpoint,
|
|
||||||
// so we just return a healthy response if the client works.
|
|
||||||
Ok(serde_json::json!({
|
|
||||||
"status": "ok",
|
|
||||||
"provider": "openrouter",
|
|
||||||
}))
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,119 +0,0 @@
|
|||||||
use serde::{Deserialize, Serialize};
|
|
||||||
|
|
||||||
#[derive(Clone, Debug, Deserialize, Serialize)]
|
|
||||||
pub struct RoutingRule {
|
|
||||||
pub model_pattern: String,
|
|
||||||
pub provider: String,
|
|
||||||
pub max_tokens: Option<u32>,
|
|
||||||
pub temperature: Option<f64>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Clone, Default)]
|
|
||||||
pub struct RoutingEngine {
|
|
||||||
rules: Vec<RoutingRule>,
|
|
||||||
fallback_chain: Vec<String>,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl RoutingEngine {
|
|
||||||
pub fn new() -> Self {
|
|
||||||
Self::default()
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn with_rules(mut self, rules: Vec<RoutingRule>) -> Self {
|
|
||||||
self.rules = rules;
|
|
||||||
self
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn with_fallback(mut self, chain: Vec<String>) -> Self {
|
|
||||||
self.fallback_chain = chain;
|
|
||||||
self
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn route(&self, model: &str) -> RouteDecision {
|
|
||||||
let lower = model.to_lowercase();
|
|
||||||
|
|
||||||
for rule in &self.rules {
|
|
||||||
if glob_match(&rule.model_pattern.to_lowercase(), &lower) {
|
|
||||||
return RouteDecision {
|
|
||||||
provider: rule.provider.clone(),
|
|
||||||
model: model.to_string(),
|
|
||||||
max_tokens: rule.max_tokens,
|
|
||||||
temperature: rule.temperature,
|
|
||||||
};
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if let Some(first) = self.fallback_chain.first() {
|
|
||||||
RouteDecision {
|
|
||||||
provider: first.clone(),
|
|
||||||
model: model.to_string(),
|
|
||||||
max_tokens: None,
|
|
||||||
temperature: None,
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
RouteDecision {
|
|
||||||
provider: "ollama".to_string(),
|
|
||||||
model: model.to_string(),
|
|
||||||
max_tokens: None,
|
|
||||||
temperature: None,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Clone, Debug)]
|
|
||||||
pub struct RouteDecision {
|
|
||||||
pub provider: String,
|
|
||||||
pub model: String,
|
|
||||||
pub max_tokens: Option<u32>,
|
|
||||||
pub temperature: Option<f64>,
|
|
||||||
}
|
|
||||||
|
|
||||||
fn glob_match(pattern: &str, name: &str) -> bool {
|
|
||||||
if !pattern.contains('*') { return pattern == name; }
|
|
||||||
let parts: Vec<&str> = pattern.split('*').collect();
|
|
||||||
// Multi-* support: first must be prefix, last must be suffix, each
|
|
||||||
// interior piece must appear in order. Fixes the iter-9 finding
|
|
||||||
// where gpt-*-large* silently fell through to an exact-match path.
|
|
||||||
// Also removes the dead `parts.len() == 1` branch that accessed
|
|
||||||
// parts[1] and would panic if ever reached (unreachable today
|
|
||||||
// since split('*') on a string containing '*' always yields ≥2).
|
|
||||||
if !name.starts_with(parts[0]) || !name.ends_with(parts.last().unwrap()) { return false; }
|
|
||||||
let mut cursor = parts[0].len();
|
|
||||||
parts[1..parts.len() - 1].iter().all(|mid| {
|
|
||||||
name[cursor..].find(mid).map(|pos| { cursor += pos + mid.len(); true }).unwrap_or(false)
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|
||||||
impl Default for RoutingRule {
|
|
||||||
fn default() -> Self {
|
|
||||||
Self {
|
|
||||||
model_pattern: "*".to_string(),
|
|
||||||
provider: "ollama".to_string(),
|
|
||||||
max_tokens: None,
|
|
||||||
temperature: None,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod glob_match_tests {
|
|
||||||
use super::glob_match;
|
|
||||||
|
|
||||||
#[test] fn exact_match() { assert!(glob_match("gpt-oss:120b", "gpt-oss:120b")); }
|
|
||||||
#[test] fn exact_mismatch() { assert!(!glob_match("a", "b")); }
|
|
||||||
#[test] fn leading_wildcard() { assert!(glob_match("*:120b", "gpt-oss:120b")); }
|
|
||||||
#[test] fn trailing_wildcard() { assert!(glob_match("gpt-oss:*", "gpt-oss:120b")); }
|
|
||||||
#[test] fn bare_wildcard() { assert!(glob_match("*", "anything")); }
|
|
||||||
#[test] fn multi_wildcard_in_order() { assert!(glob_match("gpt-*-oss-*", "gpt-4-oss-120b")); }
|
|
||||||
#[test] fn multi_wildcard_wrong_order() { assert!(!glob_match("b*a*", "abba")); }
|
|
||||||
#[test] fn multi_wildcard_panic_safety() {
|
|
||||||
// Regression: earlier impl had an unreachable `parts.len() == 1`
|
|
||||||
// branch that indexed parts[1] — would panic if ever hit. Now
|
|
||||||
// the split('*') invariant guarantees ≥2 parts when * present,
|
|
||||||
// and we handle all N-part cases explicitly.
|
|
||||||
assert!(glob_match("a*b*c", "abc"));
|
|
||||||
assert!(glob_match("a*b*c", "axxxbxxxc"));
|
|
||||||
assert!(!glob_match("a*b*c", "xxxbxxx"));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -16,17 +16,9 @@ pub fn router(client: AiClient) -> Router {
|
|||||||
.route("/embed", post(embed))
|
.route("/embed", post(embed))
|
||||||
.route("/generate", post(generate))
|
.route("/generate", post(generate))
|
||||||
.route("/rerank", post(rerank))
|
.route("/rerank", post(rerank))
|
||||||
.route("/vram", get(vram))
|
|
||||||
.with_state(client)
|
.with_state(client)
|
||||||
}
|
}
|
||||||
|
|
||||||
async fn vram(State(client): State<AiClient>) -> impl IntoResponse {
|
|
||||||
match client.vram_snapshot().await {
|
|
||||||
Ok(snap) => Ok(Json(snap)),
|
|
||||||
Err(e) => Err((StatusCode::BAD_GATEWAY, e)),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn health(State(client): State<AiClient>) -> impl IntoResponse {
|
async fn health(State(client): State<AiClient>) -> impl IntoResponse {
|
||||||
match client.health().await {
|
match client.health().await {
|
||||||
Ok(info) => Ok(Json(info)),
|
Ok(info) => Ok(Json(info)),
|
||||||
|
|||||||
@@ -1,327 +0,0 @@
|
|||||||
//! Phase 21 — INPUT-overflow handler. Ports `generateTreeSplit` from
|
|
||||||
//! `tests/multi-agent/agent.ts`.
|
|
||||||
//!
|
|
||||||
//! When the input corpus exceeds the model's window (200 playbooks
|
|
||||||
//! pasted into a T4 strategic prompt, a long retrospective digest, a
|
|
||||||
//! cross-corpus summarization), raising `max_tokens` doesn't help —
|
|
||||||
//! the prompt itself is the problem. The answer is map-reduce:
|
|
||||||
//!
|
|
||||||
//! 1. Caller shards the input at semantic boundaries (records,
|
|
||||||
//! paragraphs, playbook entries).
|
|
||||||
//! 2. For each shard, build a map prompt that includes the running
|
|
||||||
//! scratchpad and run it through `generate_continuable`.
|
|
||||||
//! 3. Append the map output to the scratchpad (oldest-first
|
|
||||||
//! truncation when it outgrows `scratchpad_budget`).
|
|
||||||
//! 4. Build a reduce prompt from the final scratchpad and run it.
|
|
||||||
//!
|
|
||||||
//! Every shard prompt and the reduce prompt go through
|
|
||||||
//! `assert_context_budget` first — if a single shard still overflows
|
|
||||||
//! we bubble the error up rather than silently truncating. That's the
|
|
||||||
//! whole point of Phase 21.
|
|
||||||
|
|
||||||
use crate::context::{assert_context_budget, BudgetOpts, overflow_message,
|
|
||||||
DEFAULT_MAX_TOKENS, DEFAULT_SAFETY_MARGIN};
|
|
||||||
use shared::model_matrix::ModelMatrix;
|
|
||||||
use crate::continuation::{generate_continuable, ContinuableOpts, ResponseShape, TextGenerator};
|
|
||||||
|
|
||||||
/// Callback signatures — caller supplies closures that stitch the
|
|
||||||
/// scratchpad into each shard's prompt and build the final reduce
|
|
||||||
/// prompt. Kept as `Fn` (not `FnMut`) so the map loop can call them
|
|
||||||
/// by reference.
|
|
||||||
pub type MapPromptFn<'a> = dyn Fn(&str, &str) -> String + Send + Sync + 'a;
|
|
||||||
pub type ReducePromptFn<'a> = dyn Fn(&str) -> String + Send + Sync + 'a;
|
|
||||||
|
|
||||||
/// Knobs for `generate_tree_split`.
|
|
||||||
#[derive(Debug, Clone)]
|
|
||||||
pub struct TreeSplitOpts {
|
|
||||||
pub model: String,
|
|
||||||
pub system: Option<String>,
|
|
||||||
pub temperature: Option<f64>,
|
|
||||||
/// max_tokens for map AND reduce (reduce defaults are usually
|
|
||||||
/// higher; caller overrides for just reduce by calling through
|
|
||||||
/// continuable directly if needed).
|
|
||||||
pub max_tokens: Option<u32>,
|
|
||||||
pub reduce_max_tokens: Option<u32>,
|
|
||||||
pub think: Option<bool>,
|
|
||||||
/// Soft ceiling on scratchpad size (estimated tokens). When it
|
|
||||||
/// grows past this, the oldest shard digest gets dropped. Default
|
|
||||||
/// 6000, matching the TS implementation.
|
|
||||||
pub scratchpad_budget: usize,
|
|
||||||
pub safety_margin: Option<usize>,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl TreeSplitOpts {
|
|
||||||
pub fn new(model: impl Into<String>) -> Self {
|
|
||||||
Self {
|
|
||||||
model: model.into(),
|
|
||||||
system: None,
|
|
||||||
temperature: None,
|
|
||||||
max_tokens: None,
|
|
||||||
reduce_max_tokens: None,
|
|
||||||
think: None,
|
|
||||||
scratchpad_budget: 6_000,
|
|
||||||
safety_margin: None,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Result — final reduce response plus the accumulated scratchpad so
|
|
||||||
/// the caller can inspect what was kept vs truncated.
|
|
||||||
#[derive(Debug, Clone)]
|
|
||||||
pub struct TreeSplitResult {
|
|
||||||
pub response: String,
|
|
||||||
pub scratchpad: String,
|
|
||||||
pub shards_processed: usize,
|
|
||||||
pub scratchpad_truncations: usize,
|
|
||||||
pub total_continuations: usize,
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Drop shard-digest blocks from the head of `scratchpad` until its
|
|
||||||
/// estimated-token count fits the budget. Digest blocks are delimited
|
|
||||||
/// by `\n— shard N/M digest —\n` so we can find the first one and
|
|
||||||
/// chop everything before its successor.
|
|
||||||
fn truncate_scratchpad(scratchpad: &mut String, budget_tokens: usize) -> bool {
|
|
||||||
if ModelMatrix::estimate_tokens(scratchpad) <= budget_tokens { return false; }
|
|
||||||
// Find the second delimiter — everything before it gets dropped.
|
|
||||||
const DELIM_PREFIX: &str = "\n— shard ";
|
|
||||||
let mut cursor = 0;
|
|
||||||
let mut truncated = false;
|
|
||||||
while ModelMatrix::estimate_tokens(&scratchpad[cursor..]) > budget_tokens {
|
|
||||||
// Skip past a leading delimiter (if we're sitting on one from
|
|
||||||
// a previous iteration), then find the next.
|
|
||||||
let search_from = cursor + if scratchpad[cursor..].starts_with(DELIM_PREFIX) {
|
|
||||||
DELIM_PREFIX.len()
|
|
||||||
} else { 0 };
|
|
||||||
let Some(rel_next) = scratchpad[search_from..].find(DELIM_PREFIX) else { break };
|
|
||||||
cursor = search_from + rel_next;
|
|
||||||
truncated = true;
|
|
||||||
}
|
|
||||||
if cursor > 0 {
|
|
||||||
scratchpad.drain(..cursor);
|
|
||||||
}
|
|
||||||
truncated
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Phase 21 — map-reduce over shards with a running scratchpad. See
|
|
||||||
/// module docs.
|
|
||||||
pub async fn generate_tree_split<G: TextGenerator>(
|
|
||||||
generator: &G,
|
|
||||||
shards: &[String],
|
|
||||||
map_prompt: &MapPromptFn<'_>,
|
|
||||||
reduce_prompt: &ReducePromptFn<'_>,
|
|
||||||
opts: &TreeSplitOpts,
|
|
||||||
) -> Result<TreeSplitResult, String> {
|
|
||||||
let mut scratchpad = String::new();
|
|
||||||
let safety = opts.safety_margin.unwrap_or(DEFAULT_SAFETY_MARGIN);
|
|
||||||
let map_max = opts.max_tokens.unwrap_or(DEFAULT_MAX_TOKENS as u32);
|
|
||||||
let reduce_max = opts.reduce_max_tokens.unwrap_or(1_500);
|
|
||||||
let mut truncations = 0usize;
|
|
||||||
let mut total_continuations = 0usize;
|
|
||||||
|
|
||||||
for (i, shard) in shards.iter().enumerate() {
|
|
||||||
let shard_prompt = map_prompt(shard, &scratchpad);
|
|
||||||
// Loud-fail on per-shard overflow — caller sharded too
|
|
||||||
// coarsely. Silent truncation is exactly the mode J rejected.
|
|
||||||
let budget = BudgetOpts {
|
|
||||||
system: opts.system.as_deref(),
|
|
||||||
max_tokens: Some(map_max as usize),
|
|
||||||
safety_margin: Some(safety),
|
|
||||||
bypass: false,
|
|
||||||
};
|
|
||||||
let check = assert_context_budget(&opts.model, &shard_prompt, budget)
|
|
||||||
.map_err(|(c, over)| overflow_message(&opts.model, &c, over, safety))?;
|
|
||||||
let _ = check;
|
|
||||||
|
|
||||||
let mut cont_opts = ContinuableOpts::new(&opts.model);
|
|
||||||
cont_opts.max_tokens = Some(map_max);
|
|
||||||
cont_opts.temperature = opts.temperature;
|
|
||||||
cont_opts.system = opts.system.clone();
|
|
||||||
cont_opts.shape = ResponseShape::Text;
|
|
||||||
cont_opts.think = opts.think;
|
|
||||||
|
|
||||||
let outcome = generate_continuable(generator, &shard_prompt, &cont_opts).await?;
|
|
||||||
total_continuations += outcome.continuations;
|
|
||||||
|
|
||||||
// Append this shard's digest and, if needed, drop oldest.
|
|
||||||
scratchpad.push_str(&format!(
|
|
||||||
"\n— shard {}/{} digest —\n{}",
|
|
||||||
i + 1, shards.len(), outcome.text.trim(),
|
|
||||||
));
|
|
||||||
if truncate_scratchpad(&mut scratchpad, opts.scratchpad_budget) {
|
|
||||||
truncations += 1;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Reduce pass. Budget check first — if the scratchpad is still too
|
|
||||||
// big for the reduce prompt we fail loud with numbers.
|
|
||||||
let reduce_p = reduce_prompt(&scratchpad);
|
|
||||||
let budget = BudgetOpts {
|
|
||||||
system: opts.system.as_deref(),
|
|
||||||
max_tokens: Some(reduce_max as usize),
|
|
||||||
safety_margin: Some(safety),
|
|
||||||
bypass: false,
|
|
||||||
};
|
|
||||||
assert_context_budget(&opts.model, &reduce_p, budget)
|
|
||||||
.map_err(|(c, over)| overflow_message(&opts.model, &c, over, safety))?;
|
|
||||||
|
|
||||||
let mut cont_opts = ContinuableOpts::new(&opts.model);
|
|
||||||
cont_opts.max_tokens = Some(reduce_max);
|
|
||||||
cont_opts.temperature = opts.temperature;
|
|
||||||
cont_opts.system = opts.system.clone();
|
|
||||||
cont_opts.shape = ResponseShape::Text;
|
|
||||||
cont_opts.think = opts.think;
|
|
||||||
|
|
||||||
let outcome = generate_continuable(generator, &reduce_p, &cont_opts).await?;
|
|
||||||
total_continuations += outcome.continuations;
|
|
||||||
|
|
||||||
Ok(TreeSplitResult {
|
|
||||||
response: outcome.text,
|
|
||||||
scratchpad,
|
|
||||||
shards_processed: shards.len(),
|
|
||||||
scratchpad_truncations: truncations,
|
|
||||||
total_continuations,
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use super::*;
|
|
||||||
use crate::continuation::ScriptedGenerator;
|
|
||||||
|
|
||||||
fn simple_map(shard: &str, scratchpad: &str) -> String {
|
|
||||||
format!("SCRATCHPAD:\n{scratchpad}\n---\nSHARD:\n{shard}\n---\nDIGEST:")
|
|
||||||
}
|
|
||||||
|
|
||||||
fn simple_reduce(scratchpad: &str) -> String {
|
|
||||||
format!("SCRATCHPAD:\n{scratchpad}\n---\nFINAL:")
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn tree_split_runs_map_then_reduce() {
|
|
||||||
// 3 shards → 3 map calls → 1 reduce call = 4 responses scripted.
|
|
||||||
let generator = ScriptedGenerator::new(vec![
|
|
||||||
Ok("digest-1".to_string()),
|
|
||||||
Ok("digest-2".to_string()),
|
|
||||||
Ok("digest-3".to_string()),
|
|
||||||
Ok("FINAL ANSWER".to_string()),
|
|
||||||
]);
|
|
||||||
let shards: Vec<String> = ["a", "b", "c"].iter().map(|s| s.to_string()).collect();
|
|
||||||
let opts = TreeSplitOpts::new("qwen3:latest");
|
|
||||||
let map_fn: &MapPromptFn = &simple_map;
|
|
||||||
let reduce_fn: &ReducePromptFn = &simple_reduce;
|
|
||||||
let result = generate_tree_split(&generator, &shards, map_fn, reduce_fn, &opts)
|
|
||||||
.await
|
|
||||||
.unwrap();
|
|
||||||
assert_eq!(result.shards_processed, 3);
|
|
||||||
assert_eq!(result.response, "FINAL ANSWER");
|
|
||||||
assert_eq!(generator.call_count(), 4);
|
|
||||||
// Scratchpad must carry all three digests in order.
|
|
||||||
assert!(result.scratchpad.contains("digest-1"));
|
|
||||||
assert!(result.scratchpad.contains("digest-2"));
|
|
||||||
assert!(result.scratchpad.contains("digest-3"));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn tree_split_reduce_prompt_sees_full_scratchpad() {
|
|
||||||
let generator = ScriptedGenerator::new(vec![
|
|
||||||
Ok("summary-A".to_string()),
|
|
||||||
Ok("summary-B".to_string()),
|
|
||||||
Ok("REDUCED".to_string()),
|
|
||||||
]);
|
|
||||||
let shards = vec!["input-one".to_string(), "input-two".to_string()];
|
|
||||||
let opts = TreeSplitOpts::new("qwen3:latest");
|
|
||||||
let _ = generate_tree_split(&generator, &shards, &simple_map, &simple_reduce, &opts)
|
|
||||||
.await
|
|
||||||
.unwrap();
|
|
||||||
// Third call = reduce. Its prompt must include both digests.
|
|
||||||
let calls = generator.calls();
|
|
||||||
let reduce_prompt = &calls[2].prompt;
|
|
||||||
assert!(reduce_prompt.contains("summary-A"),
|
|
||||||
"reduce prompt must see first shard digest");
|
|
||||||
assert!(reduce_prompt.contains("summary-B"),
|
|
||||||
"reduce prompt must see second shard digest");
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn tree_split_loud_fails_on_shard_overflow() {
|
|
||||||
let generator = ScriptedGenerator::new(vec![Ok("digest".to_string())]);
|
|
||||||
// One gigantic shard — well over qwen3's 40K window even as a
|
|
||||||
// prompt. The budget check must reject before any generate call.
|
|
||||||
let shards = vec!["x".repeat(200_000)];
|
|
||||||
let opts = TreeSplitOpts::new("qwen3:latest");
|
|
||||||
let err = generate_tree_split(&generator, &shards, &simple_map, &simple_reduce, &opts)
|
|
||||||
.await
|
|
||||||
.expect_err("shard-sized overflow must be rejected");
|
|
||||||
assert!(err.contains("overflow"), "error should mention overflow: {err}");
|
|
||||||
assert_eq!(generator.call_count(), 0, "generate must not be called on overflow");
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn tree_split_truncates_scratchpad_when_over_budget() {
|
|
||||||
// Tight budget so each shard trips truncation. qwen3's 40K
|
|
||||||
// window is fine; the budget we care about is the scratchpad
|
|
||||||
// cap, not the model window.
|
|
||||||
let generator = ScriptedGenerator::new(vec![
|
|
||||||
Ok("A".repeat(2_000)),
|
|
||||||
Ok("B".repeat(2_000)),
|
|
||||||
Ok("C".repeat(2_000)),
|
|
||||||
Ok("D".repeat(2_000)),
|
|
||||||
Ok("FINAL".to_string()),
|
|
||||||
]);
|
|
||||||
let shards: Vec<String> = (0..4).map(|i| format!("shard{i}")).collect();
|
|
||||||
let mut opts = TreeSplitOpts::new("qwen3:latest");
|
|
||||||
opts.scratchpad_budget = 1_000; // ~4000 chars — one digest barely fits
|
|
||||||
let result = generate_tree_split(&generator, &shards, &simple_map, &simple_reduce, &opts)
|
|
||||||
.await
|
|
||||||
.unwrap();
|
|
||||||
assert!(result.scratchpad_truncations > 0,
|
|
||||||
"tight budget must trigger truncation");
|
|
||||||
// Scratchpad should still fit roughly within the budget
|
|
||||||
// (post-truncation); the estimator uses chars/4 so the bound
|
|
||||||
// is ~budget*4 chars. Give some slack for the delimiter.
|
|
||||||
let scratchpad_tokens = ModelMatrix::estimate_tokens(&result.scratchpad);
|
|
||||||
assert!(scratchpad_tokens <= opts.scratchpad_budget * 2,
|
|
||||||
"scratchpad {} tokens vs budget {}", scratchpad_tokens, opts.scratchpad_budget);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn tree_split_reports_continuations_from_map_and_reduce() {
|
|
||||||
// First shard: truncated-then-continued. Reduce: truncated-then-continued.
|
|
||||||
// 1 shard: 2 map calls (initial + continuation), then 2 reduce calls.
|
|
||||||
let generator = ScriptedGenerator::new(vec![
|
|
||||||
Ok("partial".to_string()), // map shape=text, non-empty → complete on first pass
|
|
||||||
Ok("reduce-out".to_string()),
|
|
||||||
]);
|
|
||||||
let shards = vec!["only".to_string()];
|
|
||||||
let opts = TreeSplitOpts::new("qwen3:latest");
|
|
||||||
let result = generate_tree_split(&generator, &shards, &simple_map, &simple_reduce, &opts)
|
|
||||||
.await
|
|
||||||
.unwrap();
|
|
||||||
// Text shape treats non-empty as complete → 0 continuations.
|
|
||||||
assert_eq!(result.total_continuations, 0);
|
|
||||||
assert_eq!(result.shards_processed, 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn truncate_scratchpad_noop_when_under_budget() {
|
|
||||||
let mut s = "\n— shard 1/1 digest —\nshort".to_string();
|
|
||||||
let truncated = truncate_scratchpad(&mut s, 1_000);
|
|
||||||
assert!(!truncated);
|
|
||||||
assert!(s.contains("short"));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn truncate_scratchpad_drops_oldest_first() {
|
|
||||||
let mut s = format!(
|
|
||||||
"\n— shard 1/3 digest —\n{}\n— shard 2/3 digest —\n{}\n— shard 3/3 digest —\nshort",
|
|
||||||
"x".repeat(4_000), // ~1000 tokens
|
|
||||||
"y".repeat(4_000), // ~1000 tokens
|
|
||||||
);
|
|
||||||
let truncated = truncate_scratchpad(&mut s, 500); // ~2000 chars
|
|
||||||
assert!(truncated);
|
|
||||||
assert!(!s.contains(&"x".repeat(4_000)),
|
|
||||||
"oldest digest should be dropped");
|
|
||||||
assert!(s.contains("short"),
|
|
||||||
"newest digest should survive");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -15,6 +15,5 @@ bytes = { workspace = true }
|
|||||||
chrono = { workspace = true }
|
chrono = { workspace = true }
|
||||||
uuid = { workspace = true }
|
uuid = { workspace = true }
|
||||||
object_store = { workspace = true }
|
object_store = { workspace = true }
|
||||||
arrow = { workspace = true }
|
|
||||||
proto = { path = "../proto" }
|
proto = { path = "../proto" }
|
||||||
tonic = { workspace = true }
|
tonic = { workspace = true }
|
||||||
|
|||||||
@@ -54,16 +54,7 @@ impl CatalogService for CatalogGrpc {
|
|||||||
let manifest = self.registry
|
let manifest = self.registry
|
||||||
.register(req.name, SchemaFingerprint(req.schema_fingerprint), objects)
|
.register(req.name, SchemaFingerprint(req.schema_fingerprint), objects)
|
||||||
.await
|
.await
|
||||||
.map_err(|e| {
|
.map_err(|e| Status::internal(e))?;
|
||||||
// Mirror the HTTP side's 409 mapping: schema drift is a
|
|
||||||
// precondition failure, not a server error. Keeps gRPC
|
|
||||||
// and HTTP callers seeing the same diagnostic signal.
|
|
||||||
if e.contains("different schema") {
|
|
||||||
Status::failed_precondition(e)
|
|
||||||
} else {
|
|
||||||
Status::internal(e)
|
|
||||||
}
|
|
||||||
})?;
|
|
||||||
|
|
||||||
Ok(Response::new(manifest_to_proto(&manifest)))
|
Ok(Response::new(manifest_to_proto(&manifest)))
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1,4 +1,3 @@
|
|||||||
pub mod registry;
|
pub mod registry;
|
||||||
pub mod service;
|
pub mod service;
|
||||||
pub mod grpc;
|
pub mod grpc;
|
||||||
pub mod tombstones;
|
|
||||||
|
|||||||
@@ -1,9 +1,7 @@
|
|||||||
use shared::types::{
|
use shared::types::{
|
||||||
AiView, ColumnMeta, DatasetId, DatasetManifest, FreshnessContract, Lineage, ModelProfile,
|
DatasetId, DatasetManifest, ObjectRef, SchemaFingerprint,
|
||||||
ObjectRef, RefreshPolicy, SchemaFingerprint, Sensitivity, Tombstone,
|
ColumnMeta, Lineage, FreshnessContract, Sensitivity,
|
||||||
};
|
};
|
||||||
|
|
||||||
use crate::tombstones::TombstoneStore;
|
|
||||||
use std::collections::HashMap;
|
use std::collections::HashMap;
|
||||||
use std::sync::Arc;
|
use std::sync::Arc;
|
||||||
use tokio::sync::RwLock;
|
use tokio::sync::RwLock;
|
||||||
@@ -11,44 +9,6 @@ use tokio::sync::RwLock;
|
|||||||
use storaged::ops;
|
use storaged::ops;
|
||||||
use object_store::ObjectStore;
|
use object_store::ObjectStore;
|
||||||
|
|
||||||
/// Make a view name safe for use as an object storage key.
|
|
||||||
/// Allows letters, digits, `_`, `-`, `.`. Anything else becomes `_`.
|
|
||||||
fn sanitize_view_name(name: &str) -> String {
|
|
||||||
name.chars()
|
|
||||||
.map(|c| if c.is_ascii_alphanumeric() || c == '_' || c == '-' || c == '.' { c } else { '_' })
|
|
||||||
.collect()
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Debug, Clone, Default, serde::Serialize)]
|
|
||||||
pub struct MigrateBucketsReport {
|
|
||||||
pub refs_examined: usize,
|
|
||||||
pub refs_renamed: usize, // legacy "data"/"local" → "primary"
|
|
||||||
pub refs_stamped: usize, // empty → "primary"
|
|
||||||
pub refs_unchanged: usize, // already canonical
|
|
||||||
pub manifests_persisted: usize,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Debug, Clone, Default, serde::Serialize)]
|
|
||||||
pub struct DedupeReport {
|
|
||||||
pub groups: usize,
|
|
||||||
pub removed: usize,
|
|
||||||
pub kept: Vec<DedupeKept>,
|
|
||||||
pub errors: Vec<DedupeError>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Debug, Clone, serde::Serialize)]
|
|
||||||
pub struct DedupeKept {
|
|
||||||
pub name: String,
|
|
||||||
pub kept_id: String,
|
|
||||||
pub removed: usize,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Debug, Clone, serde::Serialize)]
|
|
||||||
pub struct DedupeError {
|
|
||||||
pub manifest_id: String,
|
|
||||||
pub error: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Partial metadata update — only set fields are applied.
|
/// Partial metadata update — only set fields are applied.
|
||||||
#[derive(Debug, Clone, Default, serde::Deserialize)]
|
#[derive(Debug, Clone, Default, serde::Deserialize)]
|
||||||
pub struct MetadataUpdate {
|
pub struct MetadataUpdate {
|
||||||
@@ -60,23 +20,14 @@ pub struct MetadataUpdate {
|
|||||||
pub lineage: Option<Lineage>,
|
pub lineage: Option<Lineage>,
|
||||||
pub freshness: Option<FreshnessContract>,
|
pub freshness: Option<FreshnessContract>,
|
||||||
pub row_count: Option<u64>,
|
pub row_count: Option<u64>,
|
||||||
// Phase C embedding freshness
|
|
||||||
pub embedding_refresh_policy: Option<RefreshPolicy>,
|
|
||||||
}
|
}
|
||||||
|
|
||||||
const MANIFEST_PREFIX: &str = "_catalog/manifests";
|
const MANIFEST_PREFIX: &str = "_catalog/manifests";
|
||||||
const VIEW_PREFIX: &str = "_catalog/views";
|
|
||||||
const PROFILE_PREFIX: &str = "_catalog/profiles";
|
|
||||||
|
|
||||||
/// In-memory dataset registry backed by manifest persistence in object storage.
|
/// In-memory dataset registry backed by manifest persistence in object storage.
|
||||||
/// Also tracks AiViews (Phase D) — safe projections over base datasets.
|
|
||||||
/// And tombstones (Phase E) — soft-delete markers applied at query time.
|
|
||||||
#[derive(Clone)]
|
#[derive(Clone)]
|
||||||
pub struct Registry {
|
pub struct Registry {
|
||||||
datasets: Arc<RwLock<HashMap<DatasetId, DatasetManifest>>>,
|
datasets: Arc<RwLock<HashMap<DatasetId, DatasetManifest>>>,
|
||||||
views: Arc<RwLock<HashMap<String, AiView>>>,
|
|
||||||
profiles: Arc<RwLock<HashMap<String, ModelProfile>>>,
|
|
||||||
tombstones: TombstoneStore,
|
|
||||||
store: Arc<dyn ObjectStore>,
|
store: Arc<dyn ObjectStore>,
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -84,47 +35,11 @@ impl Registry {
|
|||||||
pub fn new(store: Arc<dyn ObjectStore>) -> Self {
|
pub fn new(store: Arc<dyn ObjectStore>) -> Self {
|
||||||
Self {
|
Self {
|
||||||
datasets: Arc::new(RwLock::new(HashMap::new())),
|
datasets: Arc::new(RwLock::new(HashMap::new())),
|
||||||
views: Arc::new(RwLock::new(HashMap::new())),
|
|
||||||
profiles: Arc::new(RwLock::new(HashMap::new())),
|
|
||||||
tombstones: TombstoneStore::new(store.clone()),
|
|
||||||
store,
|
store,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn tombstones(&self) -> &TombstoneStore {
|
/// Rebuild in-memory index from persisted manifests on startup.
|
||||||
&self.tombstones
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Add a tombstone for a dataset row. Validates that the dataset
|
|
||||||
/// exists. Idempotent at the endpoint layer — callers dedup if needed.
|
|
||||||
pub async fn add_tombstone(
|
|
||||||
&self,
|
|
||||||
dataset: &str,
|
|
||||||
row_key_column: &str,
|
|
||||||
row_key_value: &str,
|
|
||||||
actor: &str,
|
|
||||||
reason: &str,
|
|
||||||
) -> Result<Tombstone, String> {
|
|
||||||
if self.get_by_name(dataset).await.is_none() {
|
|
||||||
return Err(format!("dataset not found: {dataset}"));
|
|
||||||
}
|
|
||||||
let ts = Tombstone {
|
|
||||||
dataset: dataset.to_string(),
|
|
||||||
row_key_column: row_key_column.to_string(),
|
|
||||||
row_key_value: row_key_value.to_string(),
|
|
||||||
deleted_at: chrono::Utc::now(),
|
|
||||||
actor: actor.to_string(),
|
|
||||||
reason: reason.to_string(),
|
|
||||||
};
|
|
||||||
self.tombstones.append(&ts).await?;
|
|
||||||
Ok(ts)
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn list_tombstones(&self, dataset: &str) -> Result<Vec<Tombstone>, String> {
|
|
||||||
self.tombstones.list(dataset).await
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Rebuild in-memory index from persisted manifests + views on startup.
|
|
||||||
pub async fn rebuild(&self) -> Result<usize, String> {
|
pub async fn rebuild(&self) -> Result<usize, String> {
|
||||||
let keys = ops::list(&self.store, Some(MANIFEST_PREFIX)).await?;
|
let keys = ops::list(&self.store, Some(MANIFEST_PREFIX)).await?;
|
||||||
let mut datasets = self.datasets.write().await;
|
let mut datasets = self.datasets.write().await;
|
||||||
@@ -137,161 +52,16 @@ impl Registry {
|
|||||||
}
|
}
|
||||||
let count = datasets.len();
|
let count = datasets.len();
|
||||||
tracing::info!("catalog rebuilt: {count} datasets loaded");
|
tracing::info!("catalog rebuilt: {count} datasets loaded");
|
||||||
|
|
||||||
// Phase D: load AiView definitions alongside manifests.
|
|
||||||
let view_keys = ops::list(&self.store, Some(VIEW_PREFIX)).await.unwrap_or_default();
|
|
||||||
let mut views = self.views.write().await;
|
|
||||||
views.clear();
|
|
||||||
for key in &view_keys {
|
|
||||||
if !key.ends_with(".json") { continue; }
|
|
||||||
let data = match ops::get(&self.store, key).await {
|
|
||||||
Ok(d) => d,
|
|
||||||
Err(e) => {
|
|
||||||
tracing::warn!("view '{key}': read failed: {e}");
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
match serde_json::from_slice::<AiView>(&data) {
|
|
||||||
Ok(view) => { views.insert(view.name.clone(), view); }
|
|
||||||
Err(e) => tracing::warn!("view '{key}': parse failed: {e}"),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if !views.is_empty() {
|
|
||||||
tracing::info!("catalog: {} views loaded", views.len());
|
|
||||||
}
|
|
||||||
|
|
||||||
// Phase 17: load model profiles.
|
|
||||||
let profile_keys = ops::list(&self.store, Some(PROFILE_PREFIX)).await.unwrap_or_default();
|
|
||||||
let mut profiles = self.profiles.write().await;
|
|
||||||
profiles.clear();
|
|
||||||
for key in &profile_keys {
|
|
||||||
if !key.ends_with(".json") { continue; }
|
|
||||||
let data = match ops::get(&self.store, key).await {
|
|
||||||
Ok(d) => d,
|
|
||||||
Err(e) => { tracing::warn!("profile '{key}': read failed: {e}"); continue; }
|
|
||||||
};
|
|
||||||
match serde_json::from_slice::<ModelProfile>(&data) {
|
|
||||||
Ok(p) => { profiles.insert(p.id.clone(), p); }
|
|
||||||
Err(e) => tracing::warn!("profile '{key}': parse failed: {e}"),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if !profiles.is_empty() {
|
|
||||||
tracing::info!("catalog: {} model profiles loaded", profiles.len());
|
|
||||||
}
|
|
||||||
|
|
||||||
Ok(count)
|
Ok(count)
|
||||||
}
|
}
|
||||||
|
|
||||||
// --- Phase 17: Model profiles ---
|
/// Register a new dataset. Persists manifest to storage before updating memory.
|
||||||
|
|
||||||
/// Create or replace a model profile. Validates id slug + ensures
|
|
||||||
/// every bound_dataset exists (as either a raw dataset or an AiView).
|
|
||||||
pub async fn put_profile(&self, profile: ModelProfile) -> Result<ModelProfile, String> {
|
|
||||||
if profile.id.is_empty() {
|
|
||||||
return Err("profile id is empty".into());
|
|
||||||
}
|
|
||||||
if !profile.id.chars().all(|c| c.is_ascii_alphanumeric() || c == '-' || c == '_') {
|
|
||||||
return Err(format!(
|
|
||||||
"profile id '{}' must be alphanumeric + '-' or '_' only", profile.id,
|
|
||||||
));
|
|
||||||
}
|
|
||||||
for binding in &profile.bound_datasets {
|
|
||||||
let exists = self.get_by_name(binding).await.is_some()
|
|
||||||
|| self.get_view(binding).await.is_some();
|
|
||||||
if !exists {
|
|
||||||
return Err(format!(
|
|
||||||
"bound dataset '{}' not found as dataset or view", binding,
|
|
||||||
));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
let key = format!("{PROFILE_PREFIX}/{}.json", profile.id);
|
|
||||||
let json = serde_json::to_vec_pretty(&profile).map_err(|e| e.to_string())?;
|
|
||||||
ops::put(&self.store, &key, json.into()).await?;
|
|
||||||
|
|
||||||
let mut profiles = self.profiles.write().await;
|
|
||||||
profiles.insert(profile.id.clone(), profile.clone());
|
|
||||||
tracing::info!(
|
|
||||||
"profile registered: {} -> ollama={} bindings={:?}",
|
|
||||||
profile.id, profile.ollama_name, profile.bound_datasets,
|
|
||||||
);
|
|
||||||
Ok(profile)
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn get_profile(&self, id: &str) -> Option<ModelProfile> {
|
|
||||||
self.profiles.read().await.get(id).cloned()
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn list_profiles(&self) -> Vec<ModelProfile> {
|
|
||||||
self.profiles.read().await.values().cloned().collect()
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn delete_profile(&self, id: &str) -> Result<(), String> {
|
|
||||||
let key = format!("{PROFILE_PREFIX}/{id}.json");
|
|
||||||
ops::delete(&self.store, &key).await?;
|
|
||||||
self.profiles.write().await.remove(id);
|
|
||||||
Ok(())
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Register a dataset. Idempotent on `name`:
|
|
||||||
/// - No existing dataset by this name → create new manifest.
|
|
||||||
/// - Exists with same schema fingerprint → update objects + `updated_at`
|
|
||||||
/// in place (re-ingest of identical-shape data).
|
|
||||||
/// - Exists with different schema fingerprint → reject as `Err`
|
|
||||||
/// (callers map to HTTP 409 / gRPC FAILED_PRECONDITION). Schema
|
|
||||||
/// evolution is not yet exposed as an HTTP endpoint; callers must
|
|
||||||
/// register under a new name or delete the existing manifest first.
|
|
||||||
///
|
|
||||||
/// Concurrency: the write lock is held across the storage write. That
|
|
||||||
/// serializes concurrent registers but is correctness-mandatory —
|
|
||||||
/// dropping the lock across the check→insert sequence creates a TOCTOU
|
|
||||||
/// window where two callers with the same name both see "no existing"
|
|
||||||
/// and both insert, reintroducing the duplicate-manifest bug this
|
|
||||||
/// function exists to prevent. Register is a metadata-only hop on the
|
|
||||||
/// ingest path, so the serialization cost is acceptable. Precedent:
|
|
||||||
/// `update_metadata` also holds the write lock across its I/O.
|
|
||||||
///
|
|
||||||
/// Legacy state: if multiple manifests with the same name already exist
|
|
||||||
/// (from before this was idempotent), the most recently updated one is
|
|
||||||
/// treated as canonical. Run `dedupe_by_name` to clean up the rest.
|
|
||||||
pub async fn register(
|
pub async fn register(
|
||||||
&self,
|
&self,
|
||||||
name: String,
|
name: String,
|
||||||
schema_fingerprint: SchemaFingerprint,
|
schema_fingerprint: SchemaFingerprint,
|
||||||
objects: Vec<ObjectRef>,
|
objects: Vec<ObjectRef>,
|
||||||
) -> Result<DatasetManifest, String> {
|
) -> Result<DatasetManifest, String> {
|
||||||
let mut datasets = self.datasets.write().await;
|
|
||||||
|
|
||||||
let existing = datasets
|
|
||||||
.values()
|
|
||||||
.filter(|d| d.name == name)
|
|
||||||
.max_by_key(|d| d.updated_at)
|
|
||||||
.cloned();
|
|
||||||
|
|
||||||
if let Some(mut manifest) = existing {
|
|
||||||
if manifest.schema_fingerprint != schema_fingerprint {
|
|
||||||
return Err(format!(
|
|
||||||
"dataset '{}' already exists with a different schema \
|
|
||||||
(existing fingerprint: {}, new: {}). Schema-evolution \
|
|
||||||
migration is not yet exposed as an HTTP endpoint; \
|
|
||||||
register under a new name or delete the existing \
|
|
||||||
manifest first.",
|
|
||||||
name, manifest.schema_fingerprint.0, schema_fingerprint.0,
|
|
||||||
));
|
|
||||||
}
|
|
||||||
manifest.objects = objects;
|
|
||||||
manifest.updated_at = chrono::Utc::now();
|
|
||||||
|
|
||||||
let manifest_key = format!("{MANIFEST_PREFIX}/{}.json", manifest.id);
|
|
||||||
let json = serde_json::to_vec_pretty(&manifest).map_err(|e| e.to_string())?;
|
|
||||||
ops::put(&self.store, &manifest_key, json.into()).await?;
|
|
||||||
|
|
||||||
datasets.insert(manifest.id.clone(), manifest.clone());
|
|
||||||
|
|
||||||
tracing::info!("re-registered (idempotent): {} ({})", manifest.name, manifest.id);
|
|
||||||
return Ok(manifest);
|
|
||||||
}
|
|
||||||
|
|
||||||
let now = chrono::Utc::now();
|
let now = chrono::Utc::now();
|
||||||
let manifest = DatasetManifest {
|
let manifest = DatasetManifest {
|
||||||
id: DatasetId::new(),
|
id: DatasetId::new(),
|
||||||
@@ -308,15 +78,14 @@ impl Registry {
|
|||||||
freshness: None,
|
freshness: None,
|
||||||
tags: vec![],
|
tags: vec![],
|
||||||
row_count: None,
|
row_count: None,
|
||||||
last_embedded_at: None,
|
|
||||||
embedding_stale_since: None,
|
|
||||||
embedding_refresh_policy: None,
|
|
||||||
};
|
};
|
||||||
|
|
||||||
|
// Write-ahead: persist before in-memory update
|
||||||
let manifest_key = format!("{MANIFEST_PREFIX}/{}.json", manifest.id);
|
let manifest_key = format!("{MANIFEST_PREFIX}/{}.json", manifest.id);
|
||||||
let json = serde_json::to_vec_pretty(&manifest).map_err(|e| e.to_string())?;
|
let json = serde_json::to_vec_pretty(&manifest).map_err(|e| e.to_string())?;
|
||||||
ops::put(&self.store, &manifest_key, json.into()).await?;
|
ops::put(&self.store, &manifest_key, json.into()).await?;
|
||||||
|
|
||||||
|
let mut datasets = self.datasets.write().await;
|
||||||
datasets.insert(manifest.id.clone(), manifest.clone());
|
datasets.insert(manifest.id.clone(), manifest.clone());
|
||||||
|
|
||||||
tracing::info!("registered dataset: {} ({})", manifest.name, manifest.id);
|
tracing::info!("registered dataset: {} ({})", manifest.name, manifest.id);
|
||||||
@@ -342,7 +111,6 @@ impl Registry {
|
|||||||
if let Some(lineage) = updates.lineage { manifest.lineage = Some(lineage); }
|
if let Some(lineage) = updates.lineage { manifest.lineage = Some(lineage); }
|
||||||
if let Some(freshness) = updates.freshness { manifest.freshness = Some(freshness); }
|
if let Some(freshness) = updates.freshness { manifest.freshness = Some(freshness); }
|
||||||
if let Some(count) = updates.row_count { manifest.row_count = Some(count); }
|
if let Some(count) = updates.row_count { manifest.row_count = Some(count); }
|
||||||
if let Some(policy) = updates.embedding_refresh_policy { manifest.embedding_refresh_policy = Some(policy); }
|
|
||||||
manifest.updated_at = chrono::Utc::now();
|
manifest.updated_at = chrono::Utc::now();
|
||||||
|
|
||||||
// Persist
|
// Persist
|
||||||
@@ -372,370 +140,6 @@ impl Registry {
|
|||||||
datasets.values().cloned().collect()
|
datasets.values().cloned().collect()
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Re-read the parquet footer(s) for a dataset and repopulate `row_count`
|
|
||||||
/// and `columns` from reality. Use this to repair manifests whose
|
|
||||||
/// metadata was lost (e.g. migrated from a pre-Phase 10 catalog).
|
|
||||||
///
|
|
||||||
/// Does NOT touch owner/description/sensitivity/lineage/tags — only
|
|
||||||
/// the structural facts that parquet can tell us authoritatively.
|
|
||||||
/// The existing `schema_fingerprint` is updated if the recomputed one
|
|
||||||
/// differs; a warning is logged so drift is visible.
|
|
||||||
pub async fn resync_from_parquet(&self, name: &str) -> Result<DatasetManifest, String> {
|
|
||||||
use shared::arrow_helpers::{fingerprint_schema, parquet_to_record_batches};
|
|
||||||
|
|
||||||
// Snapshot the target manifest so we don't hold the write lock during IO.
|
|
||||||
let (id, objects, old_fp) = {
|
|
||||||
let datasets = self.datasets.read().await;
|
|
||||||
let m = datasets
|
|
||||||
.values()
|
|
||||||
.find(|d| d.name == name)
|
|
||||||
.ok_or_else(|| format!("dataset not found: {name}"))?;
|
|
||||||
(m.id.clone(), m.objects.clone(), m.schema_fingerprint.clone())
|
|
||||||
};
|
|
||||||
|
|
||||||
if objects.is_empty() {
|
|
||||||
return Err(format!("dataset '{name}' has no object references to resync from"));
|
|
||||||
}
|
|
||||||
|
|
||||||
let mut total_rows: u64 = 0;
|
|
||||||
let mut first_schema: Option<arrow::datatypes::SchemaRef> = None;
|
|
||||||
for obj in &objects {
|
|
||||||
let data = ops::get(&self.store, &obj.key).await
|
|
||||||
.map_err(|e| format!("read {}: {e}", obj.key))?;
|
|
||||||
let (schema, batches) = parquet_to_record_batches(&data)
|
|
||||||
.map_err(|e| format!("parse {}: {e}", obj.key))?;
|
|
||||||
let rows: u64 = batches.iter().map(|b| b.num_rows() as u64).sum();
|
|
||||||
total_rows += rows;
|
|
||||||
if first_schema.is_none() {
|
|
||||||
first_schema = Some(schema);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
let schema = first_schema.ok_or("no schema recovered")?;
|
|
||||||
let new_fp = fingerprint_schema(&schema);
|
|
||||||
if new_fp != old_fp {
|
|
||||||
tracing::warn!(
|
|
||||||
"dataset '{}' schema fingerprint drift: {} -> {} (updating to match parquet reality)",
|
|
||||||
name, old_fp.0, new_fp.0,
|
|
||||||
);
|
|
||||||
}
|
|
||||||
|
|
||||||
let columns: Vec<ColumnMeta> = schema
|
|
||||||
.fields()
|
|
||||||
.iter()
|
|
||||||
.map(|f| ColumnMeta {
|
|
||||||
name: f.name().clone(),
|
|
||||||
data_type: f.data_type().to_string(),
|
|
||||||
sensitivity: None,
|
|
||||||
description: String::new(),
|
|
||||||
is_pii: false,
|
|
||||||
})
|
|
||||||
.collect();
|
|
||||||
|
|
||||||
// Apply updates.
|
|
||||||
let mut datasets = self.datasets.write().await;
|
|
||||||
let manifest = datasets
|
|
||||||
.get_mut(&id)
|
|
||||||
.ok_or_else(|| format!("dataset disappeared during resync: {name}"))?;
|
|
||||||
manifest.row_count = Some(total_rows);
|
|
||||||
manifest.columns = columns;
|
|
||||||
manifest.schema_fingerprint = new_fp;
|
|
||||||
manifest.updated_at = chrono::Utc::now();
|
|
||||||
|
|
||||||
// Persist.
|
|
||||||
let manifest_key = format!("{MANIFEST_PREFIX}/{}.json", manifest.id);
|
|
||||||
let json = serde_json::to_vec_pretty(manifest).map_err(|e| e.to_string())?;
|
|
||||||
ops::put(&self.store, &manifest_key, json.into()).await?;
|
|
||||||
|
|
||||||
tracing::info!("resynced '{name}': row_count={total_rows}, {} columns", manifest.columns.len());
|
|
||||||
Ok(manifest.clone())
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Collapse duplicate manifests that share a `name`. Winner per group:
|
|
||||||
/// 1. Prefer a manifest with a non-null `row_count` (already resynced).
|
|
||||||
/// 2. Break ties by newest `updated_at`.
|
|
||||||
/// Losers are removed from the in-memory registry AND their manifest
|
|
||||||
/// JSON is deleted from object storage. Datasets with a single manifest
|
|
||||||
/// are untouched. Parquet data files are never touched — only catalog
|
|
||||||
/// metadata. See `register` for the prevention side of this fix.
|
|
||||||
///
|
|
||||||
/// Operator-only. Do not run while ingest is active: a concurrent
|
|
||||||
/// `register` between the snapshot and the delete sweep can create a
|
|
||||||
/// new manifest under a name we just deduped, producing a transient
|
|
||||||
/// count of 2 until the next dedupe run. Safe outside ingest windows.
|
|
||||||
pub async fn dedupe_by_name(&self) -> DedupeReport {
|
|
||||||
let groups: Vec<(String, Vec<DatasetManifest>)> = {
|
|
||||||
let datasets = self.datasets.read().await;
|
|
||||||
let mut by_name: HashMap<String, Vec<DatasetManifest>> = HashMap::new();
|
|
||||||
for m in datasets.values() {
|
|
||||||
by_name.entry(m.name.clone()).or_default().push(m.clone());
|
|
||||||
}
|
|
||||||
by_name.into_iter().filter(|(_, v)| v.len() > 1).collect()
|
|
||||||
};
|
|
||||||
|
|
||||||
let mut report = DedupeReport::default();
|
|
||||||
let mut to_delete: Vec<DatasetId> = Vec::new();
|
|
||||||
|
|
||||||
for (name, mut manifests) in groups {
|
|
||||||
report.groups += 1;
|
|
||||||
manifests.sort_by(|a, b| {
|
|
||||||
b.row_count.is_some().cmp(&a.row_count.is_some())
|
|
||||||
.then(b.updated_at.cmp(&a.updated_at))
|
|
||||||
});
|
|
||||||
let winner = &manifests[0];
|
|
||||||
report.kept.push(DedupeKept {
|
|
||||||
name: name.clone(),
|
|
||||||
kept_id: winner.id.to_string(),
|
|
||||||
removed: manifests.len() - 1,
|
|
||||||
});
|
|
||||||
for loser in &manifests[1..] {
|
|
||||||
to_delete.push(loser.id.clone());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
{
|
|
||||||
let mut datasets = self.datasets.write().await;
|
|
||||||
for id in &to_delete {
|
|
||||||
datasets.remove(id);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
for id in &to_delete {
|
|
||||||
let key = format!("{MANIFEST_PREFIX}/{}.json", id);
|
|
||||||
match ops::delete(&self.store, &key).await {
|
|
||||||
Ok(_) => report.removed += 1,
|
|
||||||
Err(e) => report.errors.push(DedupeError {
|
|
||||||
manifest_id: id.to_string(),
|
|
||||||
error: e,
|
|
||||||
}),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
tracing::info!(
|
|
||||||
"dedupe: {} groups collapsed, {} manifests removed, {} errors",
|
|
||||||
report.groups, report.removed, report.errors.len(),
|
|
||||||
);
|
|
||||||
report
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Resync every dataset that currently has a null row_count.
|
|
||||||
/// Returns (successes, failures) where each entry is (name, detail).
|
|
||||||
pub async fn resync_missing(&self) -> (Vec<(String, u64)>, Vec<(String, String)>) {
|
|
||||||
let names: Vec<String> = {
|
|
||||||
let datasets = self.datasets.read().await;
|
|
||||||
datasets
|
|
||||||
.values()
|
|
||||||
.filter(|d| d.row_count.is_none() || d.columns.is_empty())
|
|
||||||
.map(|d| d.name.clone())
|
|
||||||
.collect()
|
|
||||||
};
|
|
||||||
|
|
||||||
let mut ok = Vec::new();
|
|
||||||
let mut err = Vec::new();
|
|
||||||
for name in names {
|
|
||||||
match self.resync_from_parquet(&name).await {
|
|
||||||
Ok(m) => ok.push((name, m.row_count.unwrap_or(0))),
|
|
||||||
Err(e) => err.push((name, e)),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
(ok, err)
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Mark a dataset's embeddings as stale (row-level data has been written
|
|
||||||
/// since the last embedding refresh). Idempotent — setting stale when
|
|
||||||
/// already stale is a no-op. Only marks stale if the dataset has been
|
|
||||||
/// embedded before — a never-embedded dataset doesn't need a stale flag
|
|
||||||
/// (it just needs an initial index build). Called from the ingest path.
|
|
||||||
pub async fn mark_embeddings_stale(&self, name: &str) -> Result<(), String> {
|
|
||||||
let mut datasets = self.datasets.write().await;
|
|
||||||
let manifest = datasets
|
|
||||||
.values_mut()
|
|
||||||
.find(|d| d.name == name)
|
|
||||||
.ok_or_else(|| format!("dataset not found: {name}"))?;
|
|
||||||
|
|
||||||
if manifest.last_embedded_at.is_none() {
|
|
||||||
return Ok(()); // never embedded -> no stale semantics yet
|
|
||||||
}
|
|
||||||
if manifest.embedding_stale_since.is_none() {
|
|
||||||
manifest.embedding_stale_since = Some(chrono::Utc::now());
|
|
||||||
manifest.updated_at = chrono::Utc::now();
|
|
||||||
|
|
||||||
let key = format!("{MANIFEST_PREFIX}/{}.json", manifest.id);
|
|
||||||
let json = serde_json::to_vec_pretty(manifest).map_err(|e| e.to_string())?;
|
|
||||||
ops::put(&self.store, &key, json.into()).await?;
|
|
||||||
tracing::info!("marked embeddings stale for dataset '{name}'");
|
|
||||||
}
|
|
||||||
Ok(())
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Clear the stale marker and set `last_embedded_at = now`.
|
|
||||||
/// Called by the embedding refresh pipeline once it finishes.
|
|
||||||
pub async fn clear_embeddings_stale(&self, name: &str) -> Result<(), String> {
|
|
||||||
let mut datasets = self.datasets.write().await;
|
|
||||||
let manifest = datasets
|
|
||||||
.values_mut()
|
|
||||||
.find(|d| d.name == name)
|
|
||||||
.ok_or_else(|| format!("dataset not found: {name}"))?;
|
|
||||||
|
|
||||||
let now = chrono::Utc::now();
|
|
||||||
manifest.embedding_stale_since = None;
|
|
||||||
manifest.last_embedded_at = Some(now);
|
|
||||||
manifest.updated_at = now;
|
|
||||||
|
|
||||||
let key = format!("{MANIFEST_PREFIX}/{}.json", manifest.id);
|
|
||||||
let json = serde_json::to_vec_pretty(manifest).map_err(|e| e.to_string())?;
|
|
||||||
ops::put(&self.store, &key, json.into()).await?;
|
|
||||||
Ok(())
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Federation layer 2: stamp `bucket = "primary"` on every ObjectRef
|
|
||||||
/// whose `bucket` field is empty or matches a legacy value (`"data"`,
|
|
||||||
/// `"local"`). One-shot migration; re-running is a safe no-op once
|
|
||||||
/// every ref is canonical.
|
|
||||||
pub async fn migrate_buckets_to_primary(&self) -> Result<MigrateBucketsReport, String> {
|
|
||||||
let mut datasets = self.datasets.write().await;
|
|
||||||
let mut report = MigrateBucketsReport::default();
|
|
||||||
let mut to_persist: Vec<(DatasetId, DatasetManifest)> = Vec::new();
|
|
||||||
|
|
||||||
for manifest in datasets.values_mut() {
|
|
||||||
let mut changed = false;
|
|
||||||
for obj in manifest.objects.iter_mut() {
|
|
||||||
report.refs_examined += 1;
|
|
||||||
if obj.bucket.is_empty() {
|
|
||||||
obj.bucket = "primary".to_string();
|
|
||||||
report.refs_stamped += 1;
|
|
||||||
changed = true;
|
|
||||||
} else if obj.bucket == "data" || obj.bucket == "local" {
|
|
||||||
obj.bucket = "primary".to_string();
|
|
||||||
report.refs_renamed += 1;
|
|
||||||
changed = true;
|
|
||||||
} else {
|
|
||||||
report.refs_unchanged += 1;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if changed {
|
|
||||||
manifest.updated_at = chrono::Utc::now();
|
|
||||||
to_persist.push((manifest.id.clone(), manifest.clone()));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Persist updated manifests after we've finished mutating the map.
|
|
||||||
for (id, manifest) in to_persist {
|
|
||||||
let key = format!("{MANIFEST_PREFIX}/{}.json", id);
|
|
||||||
let json = serde_json::to_vec_pretty(&manifest).map_err(|e| e.to_string())?;
|
|
||||||
ops::put(&self.store, &key, json.into()).await?;
|
|
||||||
report.manifests_persisted += 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
tracing::info!(
|
|
||||||
"bucket migration: examined {} refs, renamed {}, stamped {}, unchanged {}, persisted {} manifests",
|
|
||||||
report.refs_examined,
|
|
||||||
report.refs_renamed,
|
|
||||||
report.refs_stamped,
|
|
||||||
report.refs_unchanged,
|
|
||||||
report.manifests_persisted,
|
|
||||||
);
|
|
||||||
Ok(report)
|
|
||||||
}
|
|
||||||
|
|
||||||
// --- Phase D: AI-safe views ---
|
|
||||||
|
|
||||||
/// Create or replace a named view. Validates that the base dataset
|
|
||||||
/// exists and that the column whitelist is non-empty. Persists to
|
|
||||||
/// `_catalog/views/{name}.json`.
|
|
||||||
pub async fn put_view(&self, mut view: AiView) -> Result<AiView, String> {
|
|
||||||
if view.name.is_empty() {
|
|
||||||
return Err("view name is empty".into());
|
|
||||||
}
|
|
||||||
if view.columns.is_empty() {
|
|
||||||
return Err("view must whitelist at least one column".into());
|
|
||||||
}
|
|
||||||
// Base dataset must exist (read-side will fail anyway, fail-fast here
|
|
||||||
// so operators don't end up with dangling views).
|
|
||||||
if self.get_by_name(&view.base_dataset).await.is_none() {
|
|
||||||
return Err(format!(
|
|
||||||
"base dataset '{}' not found in catalog",
|
|
||||||
view.base_dataset
|
|
||||||
));
|
|
||||||
}
|
|
||||||
if view.created_at.timestamp() == 0 {
|
|
||||||
view.created_at = chrono::Utc::now();
|
|
||||||
}
|
|
||||||
|
|
||||||
let key = format!("{VIEW_PREFIX}/{}.json", sanitize_view_name(&view.name));
|
|
||||||
let json = serde_json::to_vec_pretty(&view).map_err(|e| e.to_string())?;
|
|
||||||
ops::put(&self.store, &key, json.into()).await?;
|
|
||||||
|
|
||||||
let mut views = self.views.write().await;
|
|
||||||
views.insert(view.name.clone(), view.clone());
|
|
||||||
tracing::info!("view registered: {} over '{}'", view.name, view.base_dataset);
|
|
||||||
Ok(view)
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn get_view(&self, name: &str) -> Option<AiView> {
|
|
||||||
self.views.read().await.get(name).cloned()
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn list_views(&self) -> Vec<AiView> {
|
|
||||||
self.views.read().await.values().cloned().collect()
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn delete_view(&self, name: &str) -> Result<(), String> {
|
|
||||||
let key = format!("{VIEW_PREFIX}/{}.json", sanitize_view_name(name));
|
|
||||||
ops::delete(&self.store, &key).await?;
|
|
||||||
self.views.write().await.remove(name);
|
|
||||||
Ok(())
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Remove a dataset from the catalog by name. Deletes the manifest
|
|
||||||
/// from both the in-memory registry and object storage.
|
|
||||||
///
|
|
||||||
/// Scope is metadata-only: the underlying parquet files, vector
|
|
||||||
/// indexes, tombstones, trial journals, and AiViews that reference
|
|
||||||
/// this dataset are NOT touched. Caller is responsible for any
|
|
||||||
/// cascade cleanup. This mirrors how a DROP TABLE in a typical
|
|
||||||
/// warehouse separates "forget about this dataset" from "actually
|
|
||||||
/// reclaim the bytes".
|
|
||||||
///
|
|
||||||
/// Returns Ok(()) when the dataset existed and was removed; an Err
|
|
||||||
/// with "dataset not found" when no manifest by that name exists.
|
|
||||||
/// Legacy state with duplicate names: all matching manifests are
|
|
||||||
/// removed (effectively a post-hoc dedupe on that name).
|
|
||||||
pub async fn delete_dataset(&self, name: &str) -> Result<usize, String> {
|
|
||||||
let ids_to_remove: Vec<DatasetId> = {
|
|
||||||
let datasets = self.datasets.read().await;
|
|
||||||
datasets.values().filter(|d| d.name == name).map(|d| d.id.clone()).collect()
|
|
||||||
};
|
|
||||||
if ids_to_remove.is_empty() {
|
|
||||||
return Err(format!("dataset not found: {name}"));
|
|
||||||
}
|
|
||||||
|
|
||||||
for id in &ids_to_remove {
|
|
||||||
let key = format!("{MANIFEST_PREFIX}/{}.json", id);
|
|
||||||
if let Err(e) = ops::delete(&self.store, &key).await {
|
|
||||||
// Storage delete failed — log and keep going. The in-memory
|
|
||||||
// remove below is still correct; on restart, the missing
|
|
||||||
// storage object just means nothing to rehydrate.
|
|
||||||
tracing::warn!("delete_dataset '{name}': storage delete of {key} failed: {e}");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
let mut datasets = self.datasets.write().await;
|
|
||||||
for id in &ids_to_remove {
|
|
||||||
datasets.remove(id);
|
|
||||||
}
|
|
||||||
tracing::info!("deleted dataset '{}' ({} manifest(s))", name, ids_to_remove.len());
|
|
||||||
Ok(ids_to_remove.len())
|
|
||||||
}
|
|
||||||
|
|
||||||
/// List datasets whose `embedding_stale_since` is set — they need a refresh.
|
|
||||||
pub async fn stale_datasets(&self) -> Vec<DatasetManifest> {
|
|
||||||
let datasets = self.datasets.read().await;
|
|
||||||
datasets
|
|
||||||
.values()
|
|
||||||
.filter(|d| d.embedding_stale_since.is_some())
|
|
||||||
.cloned()
|
|
||||||
.collect()
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Add objects to an existing dataset.
|
/// Add objects to an existing dataset.
|
||||||
pub async fn add_objects(
|
pub async fn add_objects(
|
||||||
&self,
|
&self,
|
||||||
@@ -756,275 +160,3 @@ impl Registry {
|
|||||||
Ok(manifest.clone())
|
Ok(manifest.clone())
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use super::*;
|
|
||||||
use object_store::memory::InMemory;
|
|
||||||
|
|
||||||
fn fixture() -> Registry {
|
|
||||||
Registry::new(Arc::new(InMemory::new()))
|
|
||||||
}
|
|
||||||
|
|
||||||
fn fp(s: &str) -> SchemaFingerprint {
|
|
||||||
SchemaFingerprint(s.to_string())
|
|
||||||
}
|
|
||||||
|
|
||||||
fn obj(key: &str) -> ObjectRef {
|
|
||||||
ObjectRef {
|
|
||||||
bucket: "primary".to_string(),
|
|
||||||
key: key.to_string(),
|
|
||||||
size_bytes: 100,
|
|
||||||
created_at: chrono::Utc::now(),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn fresh_register_creates_new_manifest() {
|
|
||||||
let reg = fixture();
|
|
||||||
let m = reg.register("a".into(), fp("f1"), vec![obj("a.parquet")]).await.unwrap();
|
|
||||||
assert_eq!(m.name, "a");
|
|
||||||
assert_eq!(m.schema_fingerprint, fp("f1"));
|
|
||||||
assert_eq!(reg.list().await.len(), 1);
|
|
||||||
assert_eq!(reg.get_by_name("a").await.unwrap().id, m.id);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn re_register_same_fingerprint_is_idempotent() {
|
|
||||||
let reg = fixture();
|
|
||||||
let first = reg.register("a".into(), fp("f1"), vec![obj("old.parquet")]).await.unwrap();
|
|
||||||
let second = reg.register("a".into(), fp("f1"), vec![obj("new.parquet")]).await.unwrap();
|
|
||||||
|
|
||||||
assert_eq!(first.id, second.id, "same name+fp should reuse ID");
|
|
||||||
assert_eq!(reg.list().await.len(), 1, "no duplicate manifest created");
|
|
||||||
let fetched = reg.get_by_name("a").await.unwrap();
|
|
||||||
assert_eq!(fetched.objects[0].key, "new.parquet", "objects replaced");
|
|
||||||
assert!(fetched.updated_at >= first.updated_at, "updated_at bumped");
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn re_register_different_fingerprint_rejects() {
|
|
||||||
let reg = fixture();
|
|
||||||
reg.register("a".into(), fp("f1"), vec![obj("a.parquet")]).await.unwrap();
|
|
||||||
let err = reg.register("a".into(), fp("f2"), vec![obj("a.parquet")]).await.unwrap_err();
|
|
||||||
|
|
||||||
assert!(err.contains("different schema"), "error mentions schema drift: {err}");
|
|
||||||
assert_eq!(reg.list().await.len(), 1, "failed register did not mutate state");
|
|
||||||
assert_eq!(reg.get_by_name("a").await.unwrap().schema_fingerprint, fp("f1"));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn delete_dataset_removes_manifest_and_in_memory_entry() {
|
|
||||||
let reg = fixture();
|
|
||||||
reg.register("to_delete".into(), fp("f1"), vec![obj("d.parquet")]).await.unwrap();
|
|
||||||
reg.register("keepme".into(), fp("f2"), vec![obj("k.parquet")]).await.unwrap();
|
|
||||||
assert_eq!(reg.list().await.len(), 2);
|
|
||||||
|
|
||||||
let removed = reg.delete_dataset("to_delete").await.unwrap();
|
|
||||||
assert_eq!(removed, 1, "one manifest removed");
|
|
||||||
assert!(reg.get_by_name("to_delete").await.is_none());
|
|
||||||
assert!(reg.get_by_name("keepme").await.is_some(), "unrelated dataset untouched");
|
|
||||||
assert_eq!(reg.list().await.len(), 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn delete_dataset_404s_on_unknown_name() {
|
|
||||||
let reg = fixture();
|
|
||||||
let err = reg.delete_dataset("nope").await.unwrap_err();
|
|
||||||
assert!(err.starts_with("dataset not found"), "error wording: {err}");
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn delete_dataset_removes_all_dupes_with_matching_name() {
|
|
||||||
// Legacy zombies: direct insert so we can seed duplicates,
|
|
||||||
// mirroring pre-idempotent-register state. delete_dataset should
|
|
||||||
// sweep every manifest sharing that name in a single call.
|
|
||||||
let reg = fixture();
|
|
||||||
let now = chrono::Utc::now();
|
|
||||||
for _ in 0..3 {
|
|
||||||
let m = DatasetManifest {
|
|
||||||
id: DatasetId::new(),
|
|
||||||
name: "zombie".into(),
|
|
||||||
schema_fingerprint: fp("fp"),
|
|
||||||
objects: vec![obj("z.parquet")],
|
|
||||||
created_at: now, updated_at: now,
|
|
||||||
row_count: None, description: String::new(), owner: String::new(),
|
|
||||||
sensitivity: None, columns: vec![], lineage: None, freshness: None,
|
|
||||||
tags: vec![], last_embedded_at: None, embedding_stale_since: None,
|
|
||||||
embedding_refresh_policy: None,
|
|
||||||
};
|
|
||||||
reg.datasets.write().await.insert(m.id.clone(), m);
|
|
||||||
}
|
|
||||||
assert_eq!(reg.list().await.len(), 3);
|
|
||||||
|
|
||||||
let removed = reg.delete_dataset("zombie").await.unwrap();
|
|
||||||
assert_eq!(removed, 3, "all three manifests removed in one sweep");
|
|
||||||
assert_eq!(reg.list().await.len(), 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn dedupe_no_duplicates_is_noop() {
|
|
||||||
let reg = fixture();
|
|
||||||
reg.register("a".into(), fp("f1"), vec![obj("a.parquet")]).await.unwrap();
|
|
||||||
reg.register("b".into(), fp("f2"), vec![obj("b.parquet")]).await.unwrap();
|
|
||||||
|
|
||||||
let report = reg.dedupe_by_name().await;
|
|
||||||
assert_eq!(report.groups, 0);
|
|
||||||
assert_eq!(report.removed, 0);
|
|
||||||
assert_eq!(reg.list().await.len(), 2);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test(flavor = "multi_thread", worker_threads = 8)]
|
|
||||||
async fn concurrent_register_stress_many_workers_one_manifest() {
|
|
||||||
// Stress variant: fire 32 concurrent registers for the same new
|
|
||||||
// name across 8 worker threads. Single-manifest invariant must
|
|
||||||
// hold regardless of how the scheduler interleaves them. This
|
|
||||||
// catches race regressions the 2-call variant below might miss
|
|
||||||
// under a forgiving scheduler.
|
|
||||||
let reg = fixture();
|
|
||||||
let mut handles = Vec::new();
|
|
||||||
for i in 0..32 {
|
|
||||||
let r = reg.clone();
|
|
||||||
handles.push(tokio::spawn(async move {
|
|
||||||
r.register(
|
|
||||||
"stress".into(),
|
|
||||||
fp("stress-fp"),
|
|
||||||
vec![obj(&format!("{i}.parquet"))],
|
|
||||||
).await
|
|
||||||
}));
|
|
||||||
}
|
|
||||||
for h in handles {
|
|
||||||
h.await.unwrap().expect("each register succeeds (idempotent)");
|
|
||||||
}
|
|
||||||
let all = reg.list().await;
|
|
||||||
let stress_manifests: Vec<_> = all.iter().filter(|d| d.name == "stress").collect();
|
|
||||||
assert_eq!(stress_manifests.len(), 1,
|
|
||||||
"32 concurrent registers produced {} manifests for 'stress' — expected 1",
|
|
||||||
stress_manifests.len());
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test(flavor = "multi_thread", worker_threads = 4)]
|
|
||||||
async fn concurrent_register_same_new_name_collapses_to_one_manifest() {
|
|
||||||
// Pins the TOCTOU fix: without the write-lock held across the
|
|
||||||
// check→insert sequence, two parallel registers of the same
|
|
||||||
// previously-unknown name would both see "no existing" and both
|
|
||||||
// insert. Multi-thread flavor is required to actually exercise
|
|
||||||
// the race — under single-threaded tokio the scheduler doesn't
|
|
||||||
// preempt between awaits on the same task's critical section.
|
|
||||||
// Under the current impl, whichever acquires the write lock
|
|
||||||
// first creates the manifest; the second observes it and takes
|
|
||||||
// the idempotent-update branch.
|
|
||||||
let reg = fixture();
|
|
||||||
let a = reg.clone();
|
|
||||||
let b = reg.clone();
|
|
||||||
|
|
||||||
let (ra, rb) = tokio::join!(
|
|
||||||
async move {
|
|
||||||
a.register("race".into(), fp("shared-fp"), vec![obj("a.parquet")]).await
|
|
||||||
},
|
|
||||||
async move {
|
|
||||||
b.register("race".into(), fp("shared-fp"), vec![obj("b.parquet")]).await
|
|
||||||
},
|
|
||||||
);
|
|
||||||
|
|
||||||
let m_a = ra.expect("first register succeeds");
|
|
||||||
let m_b = rb.expect("second register succeeds (same fp = idempotent)");
|
|
||||||
assert_eq!(m_a.id, m_b.id, "both calls resolve to a single DatasetId");
|
|
||||||
assert_eq!(reg.list().await.len(), 1, "no duplicate manifest created");
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test(flavor = "multi_thread", worker_threads = 4)]
|
|
||||||
async fn concurrent_register_same_name_different_fp_one_wins_one_rejects() {
|
|
||||||
// Reverse case: concurrent registers with conflicting fingerprints.
|
|
||||||
// Deterministic outcome: one call's fingerprint gets persisted as
|
|
||||||
// canonical, the other is rejected on seeing the now-established
|
|
||||||
// fingerprint. Which one wins is scheduler-dependent — we only
|
|
||||||
// assert exactly one success and exactly one rejection.
|
|
||||||
let reg = fixture();
|
|
||||||
let a = reg.clone();
|
|
||||||
let b = reg.clone();
|
|
||||||
|
|
||||||
let (ra, rb) = tokio::join!(
|
|
||||||
async move { a.register("race".into(), fp("fp1"), vec![obj("a.parquet")]).await },
|
|
||||||
async move { b.register("race".into(), fp("fp2"), vec![obj("b.parquet")]).await },
|
|
||||||
);
|
|
||||||
|
|
||||||
let successes = [&ra, &rb].iter().filter(|r| r.is_ok()).count();
|
|
||||||
let rejections = [&ra, &rb].iter().filter(|r| r.is_err()).count();
|
|
||||||
assert_eq!(successes, 1, "exactly one register wins");
|
|
||||||
assert_eq!(rejections, 1, "the other is rejected on fingerprint");
|
|
||||||
let rejection_msg = [&ra, &rb].iter()
|
|
||||||
.find_map(|r| r.as_ref().err())
|
|
||||||
.unwrap();
|
|
||||||
assert!(rejection_msg.contains("different schema"));
|
|
||||||
assert_eq!(reg.list().await.len(), 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn dedupe_collapses_dupes_preferring_non_null_row_count() {
|
|
||||||
let reg = fixture();
|
|
||||||
|
|
||||||
// Simulate legacy pre-idempotent-register state by inserting
|
|
||||||
// manifests with the same `name` directly. Mirrors what happened
|
|
||||||
// with the 308× successful_playbooks duplication.
|
|
||||||
let now = chrono::Utc::now();
|
|
||||||
let old_with_rows = DatasetManifest {
|
|
||||||
id: DatasetId::new(),
|
|
||||||
name: "dupes".into(),
|
|
||||||
schema_fingerprint: fp("f1"),
|
|
||||||
objects: vec![obj("dupes.parquet")],
|
|
||||||
created_at: now - chrono::Duration::hours(2),
|
|
||||||
updated_at: now - chrono::Duration::hours(2),
|
|
||||||
row_count: Some(42),
|
|
||||||
description: String::new(),
|
|
||||||
owner: String::new(),
|
|
||||||
sensitivity: None,
|
|
||||||
columns: vec![],
|
|
||||||
lineage: None,
|
|
||||||
freshness: None,
|
|
||||||
tags: vec![],
|
|
||||||
last_embedded_at: None,
|
|
||||||
embedding_stale_since: None,
|
|
||||||
embedding_refresh_policy: None,
|
|
||||||
};
|
|
||||||
let newer_no_rows = DatasetManifest {
|
|
||||||
id: DatasetId::new(),
|
|
||||||
updated_at: now, // newer, but null row_count
|
|
||||||
row_count: None,
|
|
||||||
..old_with_rows.clone()
|
|
||||||
};
|
|
||||||
let oldest = DatasetManifest {
|
|
||||||
id: DatasetId::new(),
|
|
||||||
updated_at: now - chrono::Duration::hours(5),
|
|
||||||
row_count: None,
|
|
||||||
..old_with_rows.clone()
|
|
||||||
};
|
|
||||||
|
|
||||||
let kept_id = old_with_rows.id.clone();
|
|
||||||
let loser_a = newer_no_rows.id.clone();
|
|
||||||
let loser_b = oldest.id.clone();
|
|
||||||
|
|
||||||
{
|
|
||||||
let mut d = reg.datasets.write().await;
|
|
||||||
d.insert(old_with_rows.id.clone(), old_with_rows);
|
|
||||||
d.insert(newer_no_rows.id.clone(), newer_no_rows);
|
|
||||||
d.insert(oldest.id.clone(), oldest);
|
|
||||||
}
|
|
||||||
assert_eq!(reg.list().await.len(), 3);
|
|
||||||
|
|
||||||
let report = reg.dedupe_by_name().await;
|
|
||||||
assert_eq!(report.groups, 1);
|
|
||||||
assert_eq!(report.removed, 2);
|
|
||||||
assert_eq!(report.errors.len(), 0);
|
|
||||||
assert_eq!(report.kept.len(), 1);
|
|
||||||
assert_eq!(report.kept[0].name, "dupes");
|
|
||||||
assert_eq!(report.kept[0].kept_id, kept_id.to_string(),
|
|
||||||
"should keep the manifest with non-null row_count");
|
|
||||||
|
|
||||||
let remaining = reg.list().await;
|
|
||||||
assert_eq!(remaining.len(), 1);
|
|
||||||
assert_eq!(remaining[0].id, kept_id);
|
|
||||||
assert!(reg.get(&loser_a).await.is_none());
|
|
||||||
assert!(reg.get(&loser_b).await.is_none());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|||||||
@@ -17,24 +17,8 @@ pub fn router(registry: Registry) -> Router {
|
|||||||
.route("/datasets", post(create_dataset))
|
.route("/datasets", post(create_dataset))
|
||||||
.route("/datasets", get(list_datasets))
|
.route("/datasets", get(list_datasets))
|
||||||
.route("/datasets/{id}", get(get_dataset))
|
.route("/datasets/{id}", get(get_dataset))
|
||||||
.route("/datasets/by-name/{name}", get(get_dataset_by_name).delete(delete_dataset_by_name))
|
.route("/datasets/by-name/{name}", get(get_dataset_by_name))
|
||||||
.route("/datasets/by-name/{name}/metadata", post(update_metadata))
|
.route("/datasets/by-name/{name}/metadata", post(update_metadata))
|
||||||
.route("/datasets/by-name/{name}/resync", post(resync_dataset))
|
|
||||||
.route("/resync-missing", post(resync_all_missing))
|
|
||||||
.route("/migrate-buckets", post(migrate_buckets))
|
|
||||||
.route("/dedupe", post(dedupe_by_name))
|
|
||||||
// Phase D: AI-safe views
|
|
||||||
.route("/views", post(create_view).get(list_views))
|
|
||||||
.route("/views/{name}", get(get_view).delete(delete_view))
|
|
||||||
// Phase E: soft-delete tombstones
|
|
||||||
.route("/datasets/by-name/{name}/tombstone", post(tombstone_rows).get(list_tombstones))
|
|
||||||
// Phase 17: model profiles
|
|
||||||
.route("/profiles", post(create_profile).get(list_profiles))
|
|
||||||
.route("/profiles/{id}", get(get_profile).delete(delete_profile))
|
|
||||||
// Phase 41: profile-type routes
|
|
||||||
.route("/profiles/retrieval", get(list_retrieval_profiles))
|
|
||||||
.route("/profiles/memory", get(list_memory_profiles))
|
|
||||||
.route("/profiles/observer", get(list_observer_profiles))
|
|
||||||
.with_state(registry)
|
.with_state(registry)
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -126,14 +110,7 @@ async fn create_dataset(
|
|||||||
let resp = DatasetResponse::from(&manifest);
|
let resp = DatasetResponse::from(&manifest);
|
||||||
Ok((StatusCode::CREATED, Json(resp)))
|
Ok((StatusCode::CREATED, Json(resp)))
|
||||||
}
|
}
|
||||||
Err(e) => {
|
Err(e) => Err((StatusCode::INTERNAL_SERVER_ERROR, e)),
|
||||||
let status = if e.contains("different schema") {
|
|
||||||
StatusCode::CONFLICT
|
|
||||||
} else {
|
|
||||||
StatusCode::INTERNAL_SERVER_ERROR
|
|
||||||
};
|
|
||||||
Err((status, e))
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -165,25 +142,6 @@ async fn get_dataset_by_name(
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Remove a dataset manifest by name. Metadata only — parquet files,
|
|
||||||
/// vector indexes, and tombstones are NOT cascade-deleted. See
|
|
||||||
/// `Registry::delete_dataset` for the full scope.
|
|
||||||
async fn delete_dataset_by_name(
|
|
||||||
State(registry): State<Registry>,
|
|
||||||
Path(name): Path<String>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
match registry.delete_dataset(&name).await {
|
|
||||||
Ok(removed) => {
|
|
||||||
let body = serde_json::json!({ "name": name, "manifests_removed": removed });
|
|
||||||
Ok(Json(body))
|
|
||||||
}
|
|
||||||
Err(e) if e.starts_with("dataset not found") => {
|
|
||||||
Err((StatusCode::NOT_FOUND, e))
|
|
||||||
}
|
|
||||||
Err(e) => Err((StatusCode::INTERNAL_SERVER_ERROR, e)),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn update_metadata(
|
async fn update_metadata(
|
||||||
State(registry): State<Registry>,
|
State(registry): State<Registry>,
|
||||||
Path(name): Path<String>,
|
Path(name): Path<String>,
|
||||||
@@ -194,282 +152,3 @@ async fn update_metadata(
|
|||||||
Err(e) => Err((StatusCode::INTERNAL_SERVER_ERROR, e)),
|
Err(e) => Err((StatusCode::INTERNAL_SERVER_ERROR, e)),
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Re-read parquet footers for a single dataset and repopulate row_count
|
|
||||||
/// and columns from reality. Useful for repairing manifests whose metadata
|
|
||||||
/// was lost or never backfilled.
|
|
||||||
async fn resync_dataset(
|
|
||||||
State(registry): State<Registry>,
|
|
||||||
Path(name): Path<String>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
match registry.resync_from_parquet(&name).await {
|
|
||||||
Ok(manifest) => Ok(Json(DatasetResponse::from(&manifest))),
|
|
||||||
Err(e) => Err((StatusCode::INTERNAL_SERVER_ERROR, e)),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct ResyncAllResponse {
|
|
||||||
succeeded: Vec<ResyncOk>,
|
|
||||||
failed: Vec<ResyncErr>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct ResyncOk {
|
|
||||||
name: String,
|
|
||||||
row_count: u64,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct ResyncErr {
|
|
||||||
name: String,
|
|
||||||
error: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Resync every dataset that currently has null row_count or empty columns.
|
|
||||||
async fn resync_all_missing(State(registry): State<Registry>) -> impl IntoResponse {
|
|
||||||
let (ok, err) = registry.resync_missing().await;
|
|
||||||
Json(ResyncAllResponse {
|
|
||||||
succeeded: ok.into_iter().map(|(name, row_count)| ResyncOk { name, row_count }).collect(),
|
|
||||||
failed: err.into_iter().map(|(name, error)| ResyncErr { name, error }).collect(),
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Federation layer 2 one-shot: normalize every ObjectRef.bucket field
|
|
||||||
/// to the canonical "primary" value. Idempotent — re-running once
|
|
||||||
/// everything is canonical is a safe no-op.
|
|
||||||
async fn migrate_buckets(State(registry): State<Registry>) -> impl IntoResponse {
|
|
||||||
match registry.migrate_buckets_to_primary().await {
|
|
||||||
Ok(report) => Ok(Json(report)),
|
|
||||||
Err(e) => Err((StatusCode::INTERNAL_SERVER_ERROR, e)),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Collapse duplicate manifests by `name` — see `Registry::dedupe_by_name`.
|
|
||||||
/// Safe to run repeatedly; single-manifest datasets are untouched.
|
|
||||||
async fn dedupe_by_name(State(registry): State<Registry>) -> impl IntoResponse {
|
|
||||||
Json(registry.dedupe_by_name().await)
|
|
||||||
}
|
|
||||||
|
|
||||||
// --- Phase D: AI-safe views ---
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct CreateViewRequest {
|
|
||||||
name: String,
|
|
||||||
base_dataset: String,
|
|
||||||
columns: Vec<String>,
|
|
||||||
#[serde(default)]
|
|
||||||
row_filter: Option<String>,
|
|
||||||
#[serde(default)]
|
|
||||||
column_redactions: std::collections::HashMap<String, shared::types::Redaction>,
|
|
||||||
#[serde(default)]
|
|
||||||
description: String,
|
|
||||||
#[serde(default)]
|
|
||||||
created_by: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn create_view(
|
|
||||||
State(registry): State<Registry>,
|
|
||||||
Json(req): Json<CreateViewRequest>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
let view = shared::types::AiView {
|
|
||||||
name: req.name,
|
|
||||||
base_dataset: req.base_dataset,
|
|
||||||
columns: req.columns,
|
|
||||||
row_filter: req.row_filter,
|
|
||||||
column_redactions: req.column_redactions,
|
|
||||||
created_at: chrono::Utc::now(),
|
|
||||||
created_by: req.created_by,
|
|
||||||
description: req.description,
|
|
||||||
};
|
|
||||||
match registry.put_view(view).await {
|
|
||||||
Ok(v) => Ok((StatusCode::CREATED, Json(v))),
|
|
||||||
Err(e) => Err((StatusCode::BAD_REQUEST, e)),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn list_views(State(registry): State<Registry>) -> impl IntoResponse {
|
|
||||||
Json(registry.list_views().await)
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn get_view(
|
|
||||||
State(registry): State<Registry>,
|
|
||||||
Path(name): Path<String>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
match registry.get_view(&name).await {
|
|
||||||
Some(v) => Ok(Json(v)),
|
|
||||||
None => Err((StatusCode::NOT_FOUND, format!("view not found: {name}"))),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn delete_view(
|
|
||||||
State(registry): State<Registry>,
|
|
||||||
Path(name): Path<String>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
match registry.delete_view(&name).await {
|
|
||||||
Ok(()) => Ok(StatusCode::NO_CONTENT),
|
|
||||||
Err(e) => Err((StatusCode::INTERNAL_SERVER_ERROR, e)),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// --- Phase E: soft-delete tombstones ---
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct TombstoneRequest {
|
|
||||||
row_key_column: String,
|
|
||||||
row_key_values: Vec<String>,
|
|
||||||
#[serde(default)]
|
|
||||||
actor: String,
|
|
||||||
#[serde(default)]
|
|
||||||
reason: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct TombstoneResponse {
|
|
||||||
dataset: String,
|
|
||||||
row_key_column: String,
|
|
||||||
rows_tombstoned: usize,
|
|
||||||
failures: Vec<String>,
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn tombstone_rows(
|
|
||||||
State(registry): State<Registry>,
|
|
||||||
Path(name): Path<String>,
|
|
||||||
Json(req): Json<TombstoneRequest>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
if req.row_key_values.is_empty() {
|
|
||||||
return Err((StatusCode::BAD_REQUEST, "row_key_values is empty".to_string()));
|
|
||||||
}
|
|
||||||
|
|
||||||
let mut ok = 0;
|
|
||||||
let mut failures = Vec::new();
|
|
||||||
for value in &req.row_key_values {
|
|
||||||
match registry
|
|
||||||
.add_tombstone(&name, &req.row_key_column, value, &req.actor, &req.reason)
|
|
||||||
.await
|
|
||||||
{
|
|
||||||
Ok(_) => ok += 1,
|
|
||||||
Err(e) => failures.push(format!("{value}: {e}")),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
let status = if ok > 0 && failures.is_empty() {
|
|
||||||
StatusCode::CREATED
|
|
||||||
} else if ok > 0 {
|
|
||||||
StatusCode::MULTI_STATUS
|
|
||||||
} else {
|
|
||||||
StatusCode::BAD_REQUEST
|
|
||||||
};
|
|
||||||
|
|
||||||
Ok((status, Json(TombstoneResponse {
|
|
||||||
dataset: name,
|
|
||||||
row_key_column: req.row_key_column,
|
|
||||||
rows_tombstoned: ok,
|
|
||||||
failures,
|
|
||||||
})))
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn list_tombstones(
|
|
||||||
State(registry): State<Registry>,
|
|
||||||
Path(name): Path<String>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
match registry.list_tombstones(&name).await {
|
|
||||||
Ok(ts) => Ok(Json(ts)),
|
|
||||||
Err(e) => Err((StatusCode::INTERNAL_SERVER_ERROR, e)),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// --- Phase 17: Model profiles ---
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct CreateProfileRequest {
|
|
||||||
id: String,
|
|
||||||
ollama_name: String,
|
|
||||||
#[serde(default)]
|
|
||||||
description: String,
|
|
||||||
bound_datasets: Vec<String>,
|
|
||||||
#[serde(default)]
|
|
||||||
hnsw_config: shared::types::ProfileHnswConfig,
|
|
||||||
#[serde(default = "default_embed_model_req")]
|
|
||||||
embed_model: String,
|
|
||||||
#[serde(default)]
|
|
||||||
created_by: String,
|
|
||||||
/// Federation: optional per-profile bucket (`profile:{id}` by convention).
|
|
||||||
/// Omitting keeps artifacts in primary.
|
|
||||||
#[serde(default)]
|
|
||||||
bucket: Option<String>,
|
|
||||||
/// ADR-019 hybrid: which vector backend to route this profile's
|
|
||||||
/// indexes to. Defaults to Parquet+HNSW.
|
|
||||||
#[serde(default)]
|
|
||||||
vector_backend: shared::types::VectorBackend,
|
|
||||||
/// Phase 41: Profile type for routing + activation behavior.
|
|
||||||
#[serde(default)]
|
|
||||||
profile_type: shared::types::ProfileType,
|
|
||||||
}
|
|
||||||
|
|
||||||
fn default_embed_model_req() -> String { "nomic-embed-text".to_string() }
|
|
||||||
|
|
||||||
async fn create_profile(
|
|
||||||
State(registry): State<Registry>,
|
|
||||||
Json(req): Json<CreateProfileRequest>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
let profile = shared::types::ModelProfile {
|
|
||||||
id: req.id,
|
|
||||||
ollama_name: req.ollama_name,
|
|
||||||
description: req.description,
|
|
||||||
bound_datasets: req.bound_datasets,
|
|
||||||
hnsw_config: req.hnsw_config,
|
|
||||||
embed_model: req.embed_model,
|
|
||||||
created_at: chrono::Utc::now(),
|
|
||||||
created_by: req.created_by,
|
|
||||||
bucket: req.bucket,
|
|
||||||
vector_backend: req.vector_backend,
|
|
||||||
profile_type: req.profile_type,
|
|
||||||
};
|
|
||||||
match registry.put_profile(profile).await {
|
|
||||||
Ok(p) => Ok((StatusCode::CREATED, Json(p))),
|
|
||||||
Err(e) => Err((StatusCode::BAD_REQUEST, e)),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn list_profiles(State(registry): State<Registry>) -> impl IntoResponse {
|
|
||||||
Json(registry.list_profiles().await)
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn list_retrieval_profiles(State(registry): State<Registry>) -> impl IntoResponse {
|
|
||||||
let all = registry.list_profiles().await;
|
|
||||||
let retrieval: Vec<_> = all.into_iter().filter(|p| p.profile_type == shared::types::ProfileType::Retrieval).collect();
|
|
||||||
Json(retrieval)
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn list_memory_profiles(State(registry): State<Registry>) -> impl IntoResponse {
|
|
||||||
let all = registry.list_profiles().await;
|
|
||||||
let memory: Vec<_> = all.into_iter().filter(|p| p.profile_type == shared::types::ProfileType::Memory).collect();
|
|
||||||
Json(memory)
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn list_observer_profiles(State(registry): State<Registry>) -> impl IntoResponse {
|
|
||||||
let all = registry.list_profiles().await;
|
|
||||||
let observer: Vec<_> = all.into_iter().filter(|p| p.profile_type == shared::types::ProfileType::Observer).collect();
|
|
||||||
Json(observer)
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn get_profile(
|
|
||||||
State(registry): State<Registry>,
|
|
||||||
Path(id): Path<String>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
match registry.get_profile(&id).await {
|
|
||||||
Some(p) => Ok(Json(p)),
|
|
||||||
None => Err((StatusCode::NOT_FOUND, format!("profile not found: {id}"))),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn delete_profile(
|
|
||||||
State(registry): State<Registry>,
|
|
||||||
Path(id): Path<String>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
match registry.delete_profile(&id).await {
|
|
||||||
Ok(()) => Ok(StatusCode::NO_CONTENT),
|
|
||||||
Err(e) => Err((StatusCode::INTERNAL_SERVER_ERROR, e)),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|||||||
@@ -1,151 +0,0 @@
|
|||||||
//! Soft-delete tombstone storage (Phase E).
|
|
||||||
//!
|
|
||||||
//! One append-log per dataset at `_catalog/tombstones/{dataset}/batch_*.jsonl`.
|
|
||||||
//! Uses the shared `storaged::append_log::AppendLog` pattern so appends
|
|
||||||
//! are write-once (never rewrites existing files) and can be compacted.
|
|
||||||
//!
|
|
||||||
//! The store exposes a per-dataset cache of active tombstones for the
|
|
||||||
//! hot path (queryd filter construction) — that's why events are pulled
|
|
||||||
//! into an in-memory map on every call rather than scanning object
|
|
||||||
//! storage repeatedly.
|
|
||||||
|
|
||||||
use object_store::ObjectStore;
|
|
||||||
use shared::types::Tombstone;
|
|
||||||
use std::collections::HashMap;
|
|
||||||
use std::sync::Arc;
|
|
||||||
use storaged::append_log::{AppendLog, CompactStats};
|
|
||||||
use tokio::sync::RwLock;
|
|
||||||
|
|
||||||
const TOMBSTONE_PREFIX: &str = "_catalog/tombstones";
|
|
||||||
|
|
||||||
#[derive(Clone)]
|
|
||||||
pub struct TombstoneStore {
|
|
||||||
store: Arc<dyn ObjectStore>,
|
|
||||||
logs: Arc<RwLock<HashMap<String, Arc<AppendLog>>>>,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl TombstoneStore {
|
|
||||||
pub fn new(store: Arc<dyn ObjectStore>) -> Self {
|
|
||||||
Self {
|
|
||||||
store,
|
|
||||||
logs: Arc::new(RwLock::new(HashMap::new())),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn prefix_for(dataset: &str) -> String {
|
|
||||||
// Sanitize dataset name for filesystem safety.
|
|
||||||
let safe: String = dataset
|
|
||||||
.chars()
|
|
||||||
.map(|c| if c.is_ascii_alphanumeric() || c == '_' || c == '-' { c } else { '_' })
|
|
||||||
.collect();
|
|
||||||
format!("{TOMBSTONE_PREFIX}/{}", safe)
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn log_for(&self, dataset: &str) -> Arc<AppendLog> {
|
|
||||||
if let Some(log) = self.logs.read().await.get(dataset) {
|
|
||||||
return log.clone();
|
|
||||||
}
|
|
||||||
let mut guard = self.logs.write().await;
|
|
||||||
if let Some(log) = guard.get(dataset) {
|
|
||||||
return log.clone();
|
|
||||||
}
|
|
||||||
// Threshold of 1 — every tombstone is high-value. Compliance/audit
|
|
||||||
// doesn't tolerate "lost on restart"; we trade a small file count
|
|
||||||
// for guaranteed durability. Compaction merges later if volume grows.
|
|
||||||
let log = Arc::new(
|
|
||||||
AppendLog::new(self.store.clone(), Self::prefix_for(dataset))
|
|
||||||
.with_flush_threshold(1),
|
|
||||||
);
|
|
||||||
guard.insert(dataset.to_string(), log.clone());
|
|
||||||
log
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Append one tombstone. Validates that the `row_key_column` matches
|
|
||||||
/// the column already used for this dataset (all tombstones for a
|
|
||||||
/// dataset share one key column so the query filter is well-defined).
|
|
||||||
/// Forces a flush so the tombstone is durable before this call returns.
|
|
||||||
pub async fn append(&self, ts: &Tombstone) -> Result<(), String> {
|
|
||||||
let existing = self.list(&ts.dataset).await?;
|
|
||||||
if let Some(prior) = existing.first() {
|
|
||||||
if prior.row_key_column != ts.row_key_column {
|
|
||||||
return Err(format!(
|
|
||||||
"dataset '{}' already uses '{}' as tombstone key; cannot mix with '{}'",
|
|
||||||
ts.dataset, prior.row_key_column, ts.row_key_column,
|
|
||||||
));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
let line = serde_json::to_vec(ts).map_err(|e| e.to_string())?;
|
|
||||||
let log = self.log_for(&ts.dataset).await;
|
|
||||||
log.append(line).await?;
|
|
||||||
// Belt-and-suspenders: explicit flush in case the threshold is
|
|
||||||
// ever raised. Tombstones must be durable on return.
|
|
||||||
log.flush().await
|
|
||||||
}
|
|
||||||
|
|
||||||
/// All tombstones for a dataset (chronological).
|
|
||||||
pub async fn list(&self, dataset: &str) -> Result<Vec<Tombstone>, String> {
|
|
||||||
let log = self.log_for(dataset).await;
|
|
||||||
let lines = log.read_all().await?;
|
|
||||||
let mut out = Vec::with_capacity(lines.len());
|
|
||||||
for line in lines {
|
|
||||||
match serde_json::from_slice::<Tombstone>(&line) {
|
|
||||||
Ok(t) => out.push(t),
|
|
||||||
Err(e) => tracing::warn!("tombstones/{}: skip malformed entry: {e}", dataset),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
Ok(out)
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Per-dataset grouped view used by queryd — returns a map of
|
|
||||||
/// `{dataset -> (row_key_column, set_of_values)}` for every dataset
|
|
||||||
/// that has any tombstones.
|
|
||||||
pub async fn all_grouped(
|
|
||||||
&self,
|
|
||||||
datasets: &[String],
|
|
||||||
) -> Result<HashMap<String, (String, Vec<String>)>, String> {
|
|
||||||
let mut grouped = HashMap::new();
|
|
||||||
for dataset in datasets {
|
|
||||||
let ts = match self.list(dataset).await {
|
|
||||||
Ok(ts) => ts,
|
|
||||||
Err(_) => continue,
|
|
||||||
};
|
|
||||||
if ts.is_empty() { continue; }
|
|
||||||
let col = ts[0].row_key_column.clone();
|
|
||||||
let values: Vec<String> = ts.iter().map(|t| t.row_key_value.clone()).collect();
|
|
||||||
grouped.insert(dataset.clone(), (col, values));
|
|
||||||
}
|
|
||||||
Ok(grouped)
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn compact(&self, dataset: &str) -> Result<CompactStats, String> {
|
|
||||||
let log = self.log_for(dataset).await;
|
|
||||||
log.compact().await
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Remove every tombstone for a dataset. Called after a successful
|
|
||||||
/// parquet compaction has physically deleted those rows — the
|
|
||||||
/// tombstones have done their job and the journal can be cleared.
|
|
||||||
///
|
|
||||||
/// Implementation: drop the per-dataset AppendLog from the cache and
|
|
||||||
/// delete all its batch files. Next write starts fresh.
|
|
||||||
pub async fn clear(&self, dataset: &str) -> Result<usize, String> {
|
|
||||||
let prefix = format!("{}/", Self::prefix_for(dataset));
|
|
||||||
let keys = storaged::ops::list(&self.store, Some(&prefix)).await?;
|
|
||||||
let matching: Vec<String> = keys
|
|
||||||
.into_iter()
|
|
||||||
.filter(|k| {
|
|
||||||
let basename = k.rsplit('/').next().unwrap_or(k);
|
|
||||||
basename.starts_with("batch_") && basename.ends_with(".jsonl")
|
|
||||||
})
|
|
||||||
.collect();
|
|
||||||
let count = matching.len();
|
|
||||||
for key in &matching {
|
|
||||||
let _ = storaged::ops::delete(&self.store, key).await;
|
|
||||||
}
|
|
||||||
self.logs.write().await.remove(dataset);
|
|
||||||
if count > 0 {
|
|
||||||
tracing::info!("cleared {count} tombstone batch files for '{}'", dataset);
|
|
||||||
}
|
|
||||||
Ok(count)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -12,8 +12,6 @@ aibridge = { path = "../aibridge" }
|
|||||||
ingestd = { path = "../ingestd" }
|
ingestd = { path = "../ingestd" }
|
||||||
vectord = { path = "../vectord" }
|
vectord = { path = "../vectord" }
|
||||||
journald = { path = "../journald" }
|
journald = { path = "../journald" }
|
||||||
truth = { path = "../truth" }
|
|
||||||
validator = { path = "../validator" }
|
|
||||||
tokio = { workspace = true }
|
tokio = { workspace = true }
|
||||||
axum = { workspace = true }
|
axum = { workspace = true }
|
||||||
serde = { workspace = true }
|
serde = { workspace = true }
|
||||||
@@ -30,5 +28,3 @@ opentelemetry-stdout = { workspace = true }
|
|||||||
tracing-opentelemetry = { workspace = true }
|
tracing-opentelemetry = { workspace = true }
|
||||||
arrow = { workspace = true }
|
arrow = { workspace = true }
|
||||||
chrono = { workspace = true }
|
chrono = { workspace = true }
|
||||||
reqwest = { version = "0.12", default-features = false, features = ["json", "rustls-tls"] }
|
|
||||||
toml = { workspace = true }
|
|
||||||
|
|||||||
@@ -93,7 +93,7 @@ impl AccessControl {
|
|||||||
self.roles.write().await.insert(role.agent_name.clone(), role);
|
self.roles.write().await.insert(role.agent_name.clone(), role);
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Get an agent's role. Called by `GET /access/roles/{agent}`.
|
/// Get an agent's role.
|
||||||
pub async fn get_role(&self, agent: &str) -> Option<AgentRole> {
|
pub async fn get_role(&self, agent: &str) -> Option<AgentRole> {
|
||||||
self.roles.read().await.get(agent).cloned()
|
self.roles.read().await.get(agent).cloned()
|
||||||
}
|
}
|
||||||
@@ -113,7 +113,6 @@ impl AccessControl {
|
|||||||
}
|
}
|
||||||
|
|
||||||
/// Determine which fields should be masked for an agent.
|
/// Determine which fields should be masked for an agent.
|
||||||
#[allow(dead_code)]
|
|
||||||
pub async fn masked_fields(
|
pub async fn masked_fields(
|
||||||
&self,
|
&self,
|
||||||
agent: &str,
|
agent: &str,
|
||||||
@@ -139,7 +138,6 @@ impl AccessControl {
|
|||||||
}
|
}
|
||||||
|
|
||||||
/// Log a query for audit.
|
/// Log a query for audit.
|
||||||
#[allow(dead_code)]
|
|
||||||
pub async fn log_query(&self, audit: QueryAudit) {
|
pub async fn log_query(&self, audit: QueryAudit) {
|
||||||
self.audit_log.write().await.push(audit);
|
self.audit_log.write().await.push(audit);
|
||||||
}
|
}
|
||||||
@@ -151,9 +149,6 @@ impl AccessControl {
|
|||||||
log[start..].iter().rev().cloned().collect()
|
log[start..].iter().rev().cloned().collect()
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Reports whether access-control enforcement is active.
|
|
||||||
/// Called by `GET /access/enabled` — ops tooling / dashboards poll
|
|
||||||
/// this to confirm the auth posture of the running gateway.
|
|
||||||
pub fn is_enabled(&self) -> bool {
|
pub fn is_enabled(&self) -> bool {
|
||||||
self.enabled
|
self.enabled
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1,6 +1,6 @@
|
|||||||
use axum::{
|
use axum::{
|
||||||
Json, Router,
|
Json, Router,
|
||||||
extract::{Path, Query, State},
|
extract::{Query, State},
|
||||||
http::StatusCode,
|
http::StatusCode,
|
||||||
response::IntoResponse,
|
response::IntoResponse,
|
||||||
routing::{get, post},
|
routing::{get, post},
|
||||||
@@ -13,12 +13,6 @@ pub fn router(ac: AccessControl) -> Router {
|
|||||||
Router::new()
|
Router::new()
|
||||||
.route("/roles", get(list_roles))
|
.route("/roles", get(list_roles))
|
||||||
.route("/roles", post(set_role))
|
.route("/roles", post(set_role))
|
||||||
// Scrum iter 11 / P13-001 finding: get_role was #[allow(dead_code)]
|
|
||||||
// because nothing called it — dead until exposed. Route activates it.
|
|
||||||
// Returns 404 when the agent isn't registered so clients can
|
|
||||||
// distinguish "missing role" from "access denied."
|
|
||||||
.route("/roles/{agent}", get(get_role))
|
|
||||||
.route("/enabled", get(enabled_status))
|
|
||||||
.route("/audit", get(query_audit))
|
.route("/audit", get(query_audit))
|
||||||
.route("/check", post(check_access))
|
.route("/check", post(check_access))
|
||||||
.with_state(ac)
|
.with_state(ac)
|
||||||
@@ -66,17 +60,3 @@ async fn check_access(
|
|||||||
"allowed": allowed,
|
"allowed": allowed,
|
||||||
}))
|
}))
|
||||||
}
|
}
|
||||||
|
|
||||||
async fn get_role(
|
|
||||||
State(ac): State<AccessControl>,
|
|
||||||
Path(agent): Path<String>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
match ac.get_role(&agent).await {
|
|
||||||
Some(role) => Ok(Json(role)),
|
|
||||||
None => Err((StatusCode::NOT_FOUND, format!("no role registered for agent '{agent}'"))),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn enabled_status(State(ac): State<AccessControl>) -> impl IntoResponse {
|
|
||||||
Json(serde_json::json!({ "enabled": ac.is_enabled() }))
|
|
||||||
}
|
|
||||||
|
|||||||
+15
-36
@@ -5,51 +5,30 @@ use axum::{
|
|||||||
response::Response,
|
response::Response,
|
||||||
};
|
};
|
||||||
|
|
||||||
// API key auth middleware. Checks X-API-Key header against configured key.
|
/// API key auth middleware. Checks X-API-Key header against configured key.
|
||||||
// Fixed P5-001 (2026-04-23): previously #[allow(dead_code)] — the function
|
|
||||||
// existed but was never layered onto the router, so [auth] enabled=true
|
|
||||||
// silently enforced nothing. Now wired via from_fn_with_state in main.rs.
|
|
||||||
pub async fn api_key_auth(
|
pub async fn api_key_auth(
|
||||||
axum::extract::State(expected): axum::extract::State<ApiKey>,
|
|
||||||
request: Request,
|
request: Request,
|
||||||
next: Next,
|
next: Next,
|
||||||
) -> Result<Response, StatusCode> {
|
) -> Result<Response, StatusCode> {
|
||||||
// /health stays public (LB/systemd probes). Every other route is gated.
|
// Get the expected key from the request extensions (set by the layer)
|
||||||
if request.uri().path() == "/health" {
|
let expected_key = request.extensions().get::<ApiKey>().cloned();
|
||||||
return Ok(next.run(request).await);
|
|
||||||
}
|
|
||||||
|
|
||||||
let provided = request
|
if let Some(expected) = expected_key {
|
||||||
.headers()
|
let provided = request
|
||||||
.get("x-api-key")
|
.headers()
|
||||||
.and_then(|v| v.to_str().ok());
|
.get("x-api-key")
|
||||||
|
.and_then(|v| v.to_str().ok());
|
||||||
|
|
||||||
// Constant-time-ish eq on the raw bytes; good enough for a shared-secret
|
match provided {
|
||||||
// X-API-Key. Timing-attack resistance here matters less than the
|
Some(key) if key == expected.0 => {}
|
||||||
// equivalent HMAC check would; adopt subtle crate if key-space grows.
|
_ => {
|
||||||
match provided {
|
tracing::warn!("unauthorized request: missing or invalid API key");
|
||||||
Some(key) if eq_ct(key.as_bytes(), expected.0.as_bytes()) => {
|
return Err(StatusCode::UNAUTHORIZED);
|
||||||
Ok(next.run(request).await)
|
}
|
||||||
}
|
|
||||||
_ => {
|
|
||||||
tracing::warn!(
|
|
||||||
path = %request.uri().path(),
|
|
||||||
"unauthorized request: missing or invalid API key",
|
|
||||||
);
|
|
||||||
Err(StatusCode::UNAUTHORIZED)
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
|
||||||
|
|
||||||
fn eq_ct(a: &[u8], b: &[u8]) -> bool {
|
Ok(next.run(request).await)
|
||||||
if a.len() != b.len() {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
let mut diff: u8 = 0;
|
|
||||||
for (x, y) in a.iter().zip(b.iter()) {
|
|
||||||
diff |= x ^ y;
|
|
||||||
}
|
|
||||||
diff == 0
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Wrapper type for the API key, stored in request extensions.
|
/// Wrapper type for the API key, stored in request extensions.
|
||||||
|
|||||||
@@ -1,37 +0,0 @@
|
|||||||
//! Cross-runtime parity helper for `extract_json`.
|
|
||||||
//!
|
|
||||||
//! Reads a single model-output string from stdin, runs the Rust
|
|
||||||
//! extract_json, prints `{"matched": bool, "value": <object|null>}`
|
|
||||||
//! to stdout as JSON. Exit 0 on success, exit 1 on internal error.
|
|
||||||
//!
|
|
||||||
//! The Go counterpart lives at
|
|
||||||
//! `golangLAKEHOUSE/internal/validator/iterate.go::ExtractJSON`. The
|
|
||||||
//! parity probe at
|
|
||||||
//! `golangLAKEHOUSE/scripts/cutover/parity/extract_json_parity.sh`
|
|
||||||
//! feeds the same fixtures through both and diffs the outputs.
|
|
||||||
//!
|
|
||||||
//! Usage:
|
|
||||||
//! echo '<raw model output>' | parity_extract_json
|
|
||||||
//! parity_extract_json <<< '...'
|
|
||||||
|
|
||||||
use std::io::Read;
|
|
||||||
|
|
||||||
fn main() {
|
|
||||||
let mut buf = String::new();
|
|
||||||
if let Err(e) = std::io::stdin().read_to_string(&mut buf) {
|
|
||||||
eprintln!("read stdin: {e}");
|
|
||||||
std::process::exit(1);
|
|
||||||
}
|
|
||||||
let result = gateway::v1::iterate::extract_json(&buf);
|
|
||||||
let body = serde_json::json!({
|
|
||||||
"matched": result.is_some(),
|
|
||||||
"value": result.unwrap_or(serde_json::Value::Null),
|
|
||||||
});
|
|
||||||
match serde_json::to_string(&body) {
|
|
||||||
Ok(s) => println!("{s}"),
|
|
||||||
Err(e) => {
|
|
||||||
eprintln!("serialize result: {e}");
|
|
||||||
std::process::exit(1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,71 +0,0 @@
|
|||||||
//! Cross-runtime parity helper for `SessionRecord` JSON shape.
|
|
||||||
//!
|
|
||||||
//! Reads a fixture JSON on stdin, builds a `SessionRecord`, emits
|
|
||||||
//! one JSONL row on stdout. Used by
|
|
||||||
//! `golangLAKEHOUSE/scripts/cutover/parity/session_log_parity.sh`
|
|
||||||
//! to verify the Rust gateway's session log shape stays byte-equal
|
|
||||||
//! to the Go-side validatord's `validator.SessionRecord` (commit
|
|
||||||
//! 1a3a82a in golangLAKEHOUSE).
|
|
||||||
|
|
||||||
use gateway::v1::session_log::{SessionAttemptRecord, SessionRecord, SESSION_RECORD_SCHEMA};
|
|
||||||
use serde::Deserialize;
|
|
||||||
use std::io::Read;
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct FixtureInput {
|
|
||||||
session_id: String,
|
|
||||||
kind: String,
|
|
||||||
model: String,
|
|
||||||
provider: String,
|
|
||||||
prompt: String,
|
|
||||||
iterations: u32,
|
|
||||||
max_iterations: u32,
|
|
||||||
final_verdict: String,
|
|
||||||
attempts: Vec<SessionAttemptRecord>,
|
|
||||||
#[serde(default)]
|
|
||||||
artifact: Option<serde_json::Value>,
|
|
||||||
#[serde(default)]
|
|
||||||
grounded_in_roster: Option<bool>,
|
|
||||||
duration_ms: u64,
|
|
||||||
}
|
|
||||||
|
|
||||||
fn main() {
|
|
||||||
let mut buf = String::new();
|
|
||||||
if let Err(e) = std::io::stdin().read_to_string(&mut buf) {
|
|
||||||
eprintln!("read stdin: {e}");
|
|
||||||
std::process::exit(1);
|
|
||||||
}
|
|
||||||
let input: FixtureInput = match serde_json::from_str(&buf) {
|
|
||||||
Ok(v) => v,
|
|
||||||
Err(e) => {
|
|
||||||
eprintln!("parse stdin: {e}");
|
|
||||||
std::process::exit(1);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
let rec = SessionRecord {
|
|
||||||
schema: SESSION_RECORD_SCHEMA.to_string(),
|
|
||||||
session_id: input.session_id,
|
|
||||||
// Pinned timestamp so both runtimes' rows compare byte-equal
|
|
||||||
// when the test wrapper normalizes on `daemon` only.
|
|
||||||
timestamp: "2026-01-01T00:00:00+00:00".to_string(),
|
|
||||||
daemon: "gateway".to_string(),
|
|
||||||
kind: input.kind,
|
|
||||||
model: input.model,
|
|
||||||
provider: input.provider,
|
|
||||||
prompt: input.prompt,
|
|
||||||
iterations: input.iterations,
|
|
||||||
max_iterations: input.max_iterations,
|
|
||||||
final_verdict: input.final_verdict,
|
|
||||||
attempts: input.attempts,
|
|
||||||
artifact: input.artifact,
|
|
||||||
grounded_in_roster: input.grounded_in_roster,
|
|
||||||
duration_ms: input.duration_ms,
|
|
||||||
};
|
|
||||||
match serde_json::to_string(&rec) {
|
|
||||||
Ok(s) => println!("{s}"),
|
|
||||||
Err(e) => {
|
|
||||||
eprintln!("marshal: {e}");
|
|
||||||
std::process::exit(1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,388 +0,0 @@
|
|||||||
//! KB context loader — reads recent signal from `data/_kb/*.jsonl` for
|
|
||||||
//! a given sig_hash + task_class and returns a compact summary.
|
|
||||||
//!
|
|
||||||
//! This is the "pipe to the overviewer" from the 2026-04-23 session:
|
|
||||||
//! the overseer tier (T3, gpt-oss:120b) consumes this context before
|
|
||||||
//! generating a correction, so its suggestions are informed by
|
|
||||||
//! historical cost / latency / outcome / prior-correction patterns
|
|
||||||
//! across ALL profiles that have run this task class — not just the
|
|
||||||
//! single current loop.
|
|
||||||
//!
|
|
||||||
//! Hot-swap profiles read the SAME pool. When a profile activates and
|
|
||||||
//! starts iterating, its KB context is the shared surface — one
|
|
||||||
//! profile's learning becomes every profile's starting point.
|
|
||||||
//!
|
|
||||||
//! Best-effort throughout: missing files, corrupt rows, empty
|
|
||||||
//! directories all produce an empty KbContext. The overseer works
|
|
||||||
//! fine with no history; we just can't seed it then.
|
|
||||||
|
|
||||||
use serde::Serialize;
|
|
||||||
use std::path::Path;
|
|
||||||
use tokio::io::AsyncBufReadExt;
|
|
||||||
|
|
||||||
/// Compact summary returned to the overseer. Bounded size — recent
|
|
||||||
/// outcomes + corrections plus rolled-up rates. Goal is to fit in a
|
|
||||||
/// prompt without eating the overseer's context budget.
|
|
||||||
#[derive(Debug, Clone, Default, Serialize)]
|
|
||||||
pub struct KbContext {
|
|
||||||
pub sig_hash: String,
|
|
||||||
pub task_class: String,
|
|
||||||
pub recent_outcomes: Vec<OutcomeSummary>,
|
|
||||||
pub recent_corrections: Vec<CorrectionSummary>,
|
|
||||||
pub success_rate: Option<f64>,
|
|
||||||
pub avg_turns: Option<f64>,
|
|
||||||
pub avg_latency_ms: Option<u64>,
|
|
||||||
pub total_observed: u32,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Debug, Clone, Serialize)]
|
|
||||||
pub struct OutcomeSummary {
|
|
||||||
pub created_at: String,
|
|
||||||
pub ok: bool,
|
|
||||||
pub polarity: String,
|
|
||||||
pub turns: u32,
|
|
||||||
pub latency_ms: u64,
|
|
||||||
pub total_tokens: u64,
|
|
||||||
pub error: Option<String>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Debug, Clone, Serialize)]
|
|
||||||
pub struct CorrectionSummary {
|
|
||||||
pub created_at: String,
|
|
||||||
pub reason: String,
|
|
||||||
pub correction_preview: String, // first 300 chars
|
|
||||||
pub applied_at_turn: u32,
|
|
||||||
}
|
|
||||||
|
|
||||||
const OUTCOMES_PATH: &str = "data/_kb/outcomes.jsonl";
|
|
||||||
const CORRECTIONS_PATH: &str = "data/_kb/overseer_corrections.jsonl";
|
|
||||||
const RECENT_OUTCOME_LIMIT: usize = 5;
|
|
||||||
const RECENT_CORRECTION_LIMIT: usize = 3;
|
|
||||||
const AGGREGATE_WINDOW: usize = 50;
|
|
||||||
|
|
||||||
impl KbContext {
|
|
||||||
/// Build context from the default KB paths.
|
|
||||||
pub async fn load_for(sig_hash: &str, task_class: &str) -> Self {
|
|
||||||
Self::load_from(
|
|
||||||
sig_hash, task_class,
|
|
||||||
Path::new(OUTCOMES_PATH), Path::new(CORRECTIONS_PATH),
|
|
||||||
).await
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Path-taking variant — tests inject tmp files without touching
|
|
||||||
/// the real KB directory (same pattern as append_outcomes_row_at).
|
|
||||||
pub async fn load_from(
|
|
||||||
sig_hash: &str,
|
|
||||||
task_class: &str,
|
|
||||||
outcomes_path: &Path,
|
|
||||||
corrections_path: &Path,
|
|
||||||
) -> Self {
|
|
||||||
let mut ctx = KbContext {
|
|
||||||
sig_hash: sig_hash.to_string(),
|
|
||||||
task_class: task_class.to_string(),
|
|
||||||
..Default::default()
|
|
||||||
};
|
|
||||||
|
|
||||||
// Scan outcomes — matches on sig_hash primary, task_class
|
|
||||||
// secondary (so different geos for the same task_class still
|
|
||||||
// contribute to aggregate rates even though they won't make
|
|
||||||
// the top-5 recent). The bounded window keeps scan cost
|
|
||||||
// linear in file size — we're reading tail only.
|
|
||||||
let outcome_rows = tail_matching(
|
|
||||||
outcomes_path, AGGREGATE_WINDOW * 4,
|
|
||||||
|row| {
|
|
||||||
let row_sig = row.get("sig_hash").and_then(|v| v.as_str()).unwrap_or("");
|
|
||||||
let row_tc = row.get("task_class").and_then(|v| v.as_str()).unwrap_or("");
|
|
||||||
row_sig == sig_hash || row_tc == task_class
|
|
||||||
},
|
|
||||||
).await;
|
|
||||||
|
|
||||||
// Recent outcomes: exact sig_hash match first (strongest
|
|
||||||
// signal), then task_class fallback up to the limit.
|
|
||||||
let mut exact: Vec<OutcomeSummary> = Vec::new();
|
|
||||||
let mut loose: Vec<OutcomeSummary> = Vec::new();
|
|
||||||
for row in &outcome_rows {
|
|
||||||
let row_sig = row.get("sig_hash").and_then(|v| v.as_str()).unwrap_or("");
|
|
||||||
let summary = summarize_outcome(row);
|
|
||||||
if row_sig == sig_hash { exact.push(summary); }
|
|
||||||
else { loose.push(summary); }
|
|
||||||
}
|
|
||||||
ctx.recent_outcomes = exact.into_iter().rev().take(RECENT_OUTCOME_LIMIT).collect();
|
|
||||||
if ctx.recent_outcomes.len() < RECENT_OUTCOME_LIMIT {
|
|
||||||
let need = RECENT_OUTCOME_LIMIT - ctx.recent_outcomes.len();
|
|
||||||
ctx.recent_outcomes.extend(loose.into_iter().rev().take(need));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Aggregate rates across the full matched window (both
|
|
||||||
// sig_hash and task_class matches — gives a stable rate even
|
|
||||||
// on sparse sig_hash history).
|
|
||||||
let window = outcome_rows.iter().rev().take(AGGREGATE_WINDOW);
|
|
||||||
let mut ok_count = 0u32;
|
|
||||||
let mut total = 0u32;
|
|
||||||
let mut turn_sum = 0u32;
|
|
||||||
let mut latency_sum = 0u64;
|
|
||||||
for row in window {
|
|
||||||
total += 1;
|
|
||||||
if row.get("ok").and_then(|v| v.as_bool()).unwrap_or(false) { ok_count += 1; }
|
|
||||||
turn_sum += row.get("turns").and_then(|v| v.as_u64()).unwrap_or(0) as u32;
|
|
||||||
latency_sum += row.get("usage")
|
|
||||||
.and_then(|u| u.get("latency_ms"))
|
|
||||||
.and_then(|v| v.as_u64()).unwrap_or(0);
|
|
||||||
}
|
|
||||||
if total > 0 {
|
|
||||||
ctx.total_observed = total;
|
|
||||||
ctx.success_rate = Some(ok_count as f64 / total as f64);
|
|
||||||
ctx.avg_turns = Some(turn_sum as f64 / total as f64);
|
|
||||||
ctx.avg_latency_ms = Some(latency_sum / total as u64);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Overseer corrections. Prefer sig_hash match; fall back to
|
|
||||||
// task_class. The overseer reading its OWN prior corrections
|
|
||||||
// is the main point — if the last 3 attempts produced
|
|
||||||
// corrections X, Y, Z, the new correction should acknowledge
|
|
||||||
// those patterns rather than suggest X for the fourth time.
|
|
||||||
let correction_rows = tail_matching(
|
|
||||||
corrections_path, RECENT_CORRECTION_LIMIT * 4,
|
|
||||||
|row| {
|
|
||||||
let row_sig = row.get("sig_hash").and_then(|v| v.as_str()).unwrap_or("");
|
|
||||||
let row_tc = row.get("task_class").and_then(|v| v.as_str()).unwrap_or("");
|
|
||||||
row_sig == sig_hash || row_tc == task_class
|
|
||||||
},
|
|
||||||
).await;
|
|
||||||
let mut c_exact: Vec<CorrectionSummary> = Vec::new();
|
|
||||||
let mut c_loose: Vec<CorrectionSummary> = Vec::new();
|
|
||||||
for row in &correction_rows {
|
|
||||||
let row_sig = row.get("sig_hash").and_then(|v| v.as_str()).unwrap_or("");
|
|
||||||
let summary = summarize_correction(row);
|
|
||||||
if row_sig == sig_hash { c_exact.push(summary); }
|
|
||||||
else { c_loose.push(summary); }
|
|
||||||
}
|
|
||||||
ctx.recent_corrections = c_exact.into_iter().rev().take(RECENT_CORRECTION_LIMIT).collect();
|
|
||||||
if ctx.recent_corrections.len() < RECENT_CORRECTION_LIMIT {
|
|
||||||
let need = RECENT_CORRECTION_LIMIT - ctx.recent_corrections.len();
|
|
||||||
ctx.recent_corrections.extend(c_loose.into_iter().rev().take(need));
|
|
||||||
}
|
|
||||||
|
|
||||||
ctx
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Compact string form for the overseer prompt. Deterministic
|
|
||||||
/// ordering + bounded length so prompt caching stays stable
|
|
||||||
/// across iterations on the same task.
|
|
||||||
pub fn to_prompt_section(&self) -> String {
|
|
||||||
let mut s = String::new();
|
|
||||||
s.push_str("## Knowledge Base Context\n");
|
|
||||||
if let (Some(rate), Some(turns), Some(lat)) = (self.success_rate, self.avg_turns, self.avg_latency_ms) {
|
|
||||||
s.push_str(&format!(
|
|
||||||
"Across {} prior similar runs: success_rate={:.1}%, avg_turns={:.1}, avg_latency_ms={}\n",
|
|
||||||
self.total_observed, rate * 100.0, turns, lat,
|
|
||||||
));
|
|
||||||
} else {
|
|
||||||
s.push_str("No prior similar runs recorded.\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
if !self.recent_outcomes.is_empty() {
|
|
||||||
s.push_str(&format!("\nRecent {} outcomes:\n", self.recent_outcomes.len()));
|
|
||||||
for o in &self.recent_outcomes {
|
|
||||||
let err = o.error.as_deref().map(|e| format!(" — {}", truncate(e, 80))).unwrap_or_default();
|
|
||||||
s.push_str(&format!(
|
|
||||||
" [{}] ok={} turns={} tokens={} lat={}ms{}\n",
|
|
||||||
&o.created_at[..19.min(o.created_at.len())],
|
|
||||||
o.ok, o.turns, o.total_tokens, o.latency_ms, err,
|
|
||||||
));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if !self.recent_corrections.is_empty() {
|
|
||||||
s.push_str(&format!("\nRecent {} overseer corrections (yours — don't repeat):\n", self.recent_corrections.len()));
|
|
||||||
for c in &self.recent_corrections {
|
|
||||||
s.push_str(&format!(
|
|
||||||
" [{}] turn={} reason={} correction={}\n",
|
|
||||||
&c.created_at[..19.min(c.created_at.len())],
|
|
||||||
c.applied_at_turn,
|
|
||||||
truncate(&c.reason, 40),
|
|
||||||
truncate(&c.correction_preview, 200),
|
|
||||||
));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
s
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn summarize_outcome(row: &serde_json::Value) -> OutcomeSummary {
|
|
||||||
OutcomeSummary {
|
|
||||||
created_at: row.get("created_at").and_then(|v| v.as_str()).unwrap_or("").to_string(),
|
|
||||||
ok: row.get("ok").and_then(|v| v.as_bool()).unwrap_or(false),
|
|
||||||
polarity: row.get("polarity").and_then(|v| v.as_str()).unwrap_or("").to_string(),
|
|
||||||
turns: row.get("turns").and_then(|v| v.as_u64()).unwrap_or(0) as u32,
|
|
||||||
latency_ms: row.get("usage").and_then(|u| u.get("latency_ms"))
|
|
||||||
.and_then(|v| v.as_u64()).unwrap_or(0),
|
|
||||||
total_tokens: row.get("usage").and_then(|u| u.get("total_tokens"))
|
|
||||||
.and_then(|v| v.as_u64()).unwrap_or(0),
|
|
||||||
error: row.get("error").and_then(|v| v.as_str()).map(String::from),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn summarize_correction(row: &serde_json::Value) -> CorrectionSummary {
|
|
||||||
let preview = row.get("correction").and_then(|v| v.as_str()).unwrap_or("");
|
|
||||||
CorrectionSummary {
|
|
||||||
created_at: row.get("created_at").and_then(|v| v.as_str()).unwrap_or("").to_string(),
|
|
||||||
reason: row.get("reason").and_then(|v| v.as_str()).unwrap_or("").to_string(),
|
|
||||||
correction_preview: truncate(preview, 300),
|
|
||||||
applied_at_turn: row.get("applied_at_turn").and_then(|v| v.as_u64()).unwrap_or(0) as u32,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn truncate(s: &str, n: usize) -> String {
|
|
||||||
if s.len() <= n { s.to_string() } else { format!("{}…", &s[..n]) }
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Read a JSONL file from the tail, returning at most `limit` rows
|
|
||||||
/// that match `filter`. Missing file returns empty. Corrupt lines are
|
|
||||||
/// skipped. Limit is honored from the tail — a full-file scan with an
|
|
||||||
/// in-memory ring would be wasteful for large outcomes histories, but
|
|
||||||
/// we cap at reading the whole file and filtering post-hoc for now
|
|
||||||
/// (reverse-seek line iteration is a real engineering task and the
|
|
||||||
/// file is bounded by ingest rate; revisit when it bites).
|
|
||||||
async fn tail_matching<F>(
|
|
||||||
path: &Path,
|
|
||||||
limit: usize,
|
|
||||||
filter: F,
|
|
||||||
) -> Vec<serde_json::Value>
|
|
||||||
where
|
|
||||||
F: Fn(&serde_json::Value) -> bool,
|
|
||||||
{
|
|
||||||
let Ok(file) = tokio::fs::File::open(path).await else { return Vec::new(); };
|
|
||||||
let reader = tokio::io::BufReader::new(file);
|
|
||||||
let mut lines = reader.lines();
|
|
||||||
let mut matches: Vec<serde_json::Value> = Vec::new();
|
|
||||||
while let Ok(Some(line)) = lines.next_line().await {
|
|
||||||
let Ok(v) = serde_json::from_str::<serde_json::Value>(&line) else { continue };
|
|
||||||
if filter(&v) {
|
|
||||||
matches.push(v);
|
|
||||||
if matches.len() > limit {
|
|
||||||
// Keep the most-recent window only — drop from the
|
|
||||||
// front as we go rather than buffering everything.
|
|
||||||
matches.remove(0);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
matches
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use super::*;
|
|
||||||
use tokio::io::AsyncWriteExt;
|
|
||||||
|
|
||||||
async fn write_fixture(path: &Path, rows: Vec<serde_json::Value>) {
|
|
||||||
if let Some(dir) = path.parent() {
|
|
||||||
tokio::fs::create_dir_all(dir).await.unwrap();
|
|
||||||
}
|
|
||||||
let mut f = tokio::fs::OpenOptions::new()
|
|
||||||
.create(true).write(true).truncate(true).open(path).await.unwrap();
|
|
||||||
for r in rows {
|
|
||||||
let mut line = serde_json::to_string(&r).unwrap();
|
|
||||||
line.push('\n');
|
|
||||||
f.write_all(line.as_bytes()).await.unwrap();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn tmp_path(name: &str) -> std::path::PathBuf {
|
|
||||||
let nanos = std::time::SystemTime::now().duration_since(std::time::UNIX_EPOCH).unwrap().as_nanos();
|
|
||||||
std::env::temp_dir().join(format!("lh_kb_ctx_{}_{}_{}", std::process::id(), nanos, name))
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn empty_files_produce_empty_context() {
|
|
||||||
let op = tmp_path("outcomes.jsonl");
|
|
||||||
let cp = tmp_path("corrections.jsonl");
|
|
||||||
let ctx = KbContext::load_from("sig123", "staffing.fill", &op, &cp).await;
|
|
||||||
assert!(ctx.recent_outcomes.is_empty());
|
|
||||||
assert!(ctx.recent_corrections.is_empty());
|
|
||||||
assert!(ctx.success_rate.is_none());
|
|
||||||
assert_eq!(ctx.total_observed, 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn exact_sig_hash_matches_take_priority() {
|
|
||||||
let op = tmp_path("outcomes.jsonl");
|
|
||||||
let cp = tmp_path("corrections.jsonl");
|
|
||||||
write_fixture(&op, vec![
|
|
||||||
// Other sig_hash, same task_class — loose match
|
|
||||||
serde_json::json!({
|
|
||||||
"sig_hash": "other", "task_class": "staffing.fill",
|
|
||||||
"ok": false, "polarity": "failure_pattern", "turns": 1,
|
|
||||||
"usage": {"latency_ms": 1000, "total_tokens": 100},
|
|
||||||
"created_at": "2026-04-22T10:00:00Z",
|
|
||||||
}),
|
|
||||||
// Exact sig_hash — should lead
|
|
||||||
serde_json::json!({
|
|
||||||
"sig_hash": "sig123", "task_class": "staffing.fill",
|
|
||||||
"ok": true, "polarity": "success_confirmation", "turns": 3,
|
|
||||||
"usage": {"latency_ms": 2000, "total_tokens": 500},
|
|
||||||
"created_at": "2026-04-23T10:00:00Z",
|
|
||||||
}),
|
|
||||||
]).await;
|
|
||||||
write_fixture(&cp, vec![]).await;
|
|
||||||
|
|
||||||
let ctx = KbContext::load_from("sig123", "staffing.fill", &op, &cp).await;
|
|
||||||
assert_eq!(ctx.recent_outcomes.len(), 2);
|
|
||||||
assert_eq!(ctx.recent_outcomes[0].created_at, "2026-04-23T10:00:00Z");
|
|
||||||
assert_eq!(ctx.recent_outcomes[0].ok, true);
|
|
||||||
assert_eq!(ctx.total_observed, 2);
|
|
||||||
assert!((ctx.success_rate.unwrap() - 0.5).abs() < 0.001);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn corrupt_rows_are_skipped() {
|
|
||||||
let op = tmp_path("outcomes.jsonl");
|
|
||||||
let cp = tmp_path("corrections.jsonl");
|
|
||||||
// Mix valid + invalid — invalid should be silently skipped.
|
|
||||||
if let Some(dir) = op.parent() { tokio::fs::create_dir_all(dir).await.unwrap(); }
|
|
||||||
tokio::fs::write(&op, "not json\n{\"sig_hash\":\"sig1\",\"task_class\":\"tc\",\"ok\":true,\"turns\":1,\"usage\":{}}\ngarbage\n").await.unwrap();
|
|
||||||
write_fixture(&cp, vec![]).await;
|
|
||||||
let ctx = KbContext::load_from("sig1", "tc", &op, &cp).await;
|
|
||||||
assert_eq!(ctx.recent_outcomes.len(), 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[tokio::test]
|
|
||||||
async fn corrections_preview_is_truncated() {
|
|
||||||
let op = tmp_path("outcomes.jsonl");
|
|
||||||
let cp = tmp_path("corrections.jsonl");
|
|
||||||
let long = "x".repeat(500);
|
|
||||||
write_fixture(&op, vec![]).await;
|
|
||||||
write_fixture(&cp, vec![serde_json::json!({
|
|
||||||
"sig_hash": "sig1", "task_class": "tc",
|
|
||||||
"reason": "abort", "correction": long, "applied_at_turn": 3,
|
|
||||||
"created_at": "2026-04-23T10:00:00Z",
|
|
||||||
})]).await;
|
|
||||||
let ctx = KbContext::load_from("sig1", "tc", &op, &cp).await;
|
|
||||||
assert_eq!(ctx.recent_corrections.len(), 1);
|
|
||||||
// 300-char cap + 3-byte UTF-8 ellipsis character = 303-byte worst case.
|
|
||||||
assert!(ctx.recent_corrections[0].correction_preview.len() <= 303);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn prompt_section_is_stable_for_empty_context() {
|
|
||||||
let ctx = KbContext::default();
|
|
||||||
let s = ctx.to_prompt_section();
|
|
||||||
assert!(s.contains("No prior similar runs recorded"));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn prompt_section_reports_aggregate_rates() {
|
|
||||||
let ctx = KbContext {
|
|
||||||
total_observed: 10,
|
|
||||||
success_rate: Some(0.7),
|
|
||||||
avg_turns: Some(4.2),
|
|
||||||
avg_latency_ms: Some(45000),
|
|
||||||
..Default::default()
|
|
||||||
};
|
|
||||||
let s = ctx.to_prompt_section();
|
|
||||||
assert!(s.contains("success_rate=70.0%"));
|
|
||||||
assert!(s.contains("avg_turns=4.2"));
|
|
||||||
assert!(s.contains("avg_latency_ms=45000"));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
File diff suppressed because it is too large
Load Diff
@@ -1,19 +0,0 @@
|
|||||||
//! Library facade for the gateway crate so sub-binaries (e.g.
|
|
||||||
//! `parity_extract_json`) can reuse the same modules the gateway
|
|
||||||
//! binary uses.
|
|
||||||
//!
|
|
||||||
//! Added 2026-05-02 to support the cross-runtime parity probe at
|
|
||||||
//! `golangLAKEHOUSE/scripts/cutover/parity/extract_json_parity.sh`.
|
|
||||||
//! `extract_json` is the load-bearing public surface for that probe.
|
|
||||||
//!
|
|
||||||
//! main.rs still uses local `mod foo;` declarations independently —
|
|
||||||
//! adding this file is purely additive (the binary's module tree is
|
|
||||||
//! unchanged).
|
|
||||||
|
|
||||||
pub mod access;
|
|
||||||
pub mod access_service;
|
|
||||||
pub mod auth;
|
|
||||||
pub mod execution_loop;
|
|
||||||
pub mod observability;
|
|
||||||
pub mod tools;
|
|
||||||
pub mod v1;
|
|
||||||
+23
-321
@@ -1,10 +1,8 @@
|
|||||||
mod access;
|
mod access;
|
||||||
mod access_service;
|
mod access_service;
|
||||||
mod auth;
|
mod auth;
|
||||||
mod execution_loop;
|
|
||||||
mod observability;
|
mod observability;
|
||||||
mod tools;
|
mod tools;
|
||||||
mod v1;
|
|
||||||
|
|
||||||
use axum::{Router, extract::DefaultBodyLimit, routing::get};
|
use axum::{Router, extract::DefaultBodyLimit, routing::get};
|
||||||
use proto::lakehouse::catalog_service_server::CatalogServiceServer;
|
use proto::lakehouse::catalog_service_server::CatalogServiceServer;
|
||||||
@@ -26,30 +24,8 @@ async fn main() {
|
|||||||
tracing::info!("config loaded: gateway={}:{}, storage={}",
|
tracing::info!("config loaded: gateway={}:{}, storage={}",
|
||||||
config.gateway.host, config.gateway.port, config.storage.root);
|
config.gateway.host, config.gateway.port, config.storage.root);
|
||||||
|
|
||||||
// Secrets provider
|
// Storage backend
|
||||||
let secrets = std::sync::Arc::new(shared::secrets::FileSecretsProvider::from_env());
|
let store = storaged::backend::init_local(&config.storage.root);
|
||||||
if let Err(e) = secrets.load().await {
|
|
||||||
tracing::warn!("secrets load: {e} — bucket credentials may be missing");
|
|
||||||
}
|
|
||||||
|
|
||||||
// Federation: bucket registry (primary + any [[storage.buckets]] entries + rescue)
|
|
||||||
let bucket_registry = std::sync::Arc::new(
|
|
||||||
storaged::registry::BucketRegistry::from_config(&config.storage, secrets.clone())
|
|
||||||
.await
|
|
||||||
.expect("bucket registry init failed")
|
|
||||||
);
|
|
||||||
let buckets = bucket_registry.list().await;
|
|
||||||
tracing::info!(
|
|
||||||
"bucket registry: {} buckets [{}], rescue={:?}",
|
|
||||||
buckets.len(),
|
|
||||||
buckets.iter().map(|b| format!("{}:{}", b.name, b.backend)).collect::<Vec<_>>().join(", "),
|
|
||||||
bucket_registry.rescue_name(),
|
|
||||||
);
|
|
||||||
|
|
||||||
// Back-compat: existing components that expect a single Arc<ObjectStore>
|
|
||||||
// get the primary bucket's store. As we migrate call sites to be bucket-
|
|
||||||
// aware, they'll call bucket_registry.get(name) directly.
|
|
||||||
let store = bucket_registry.default_store();
|
|
||||||
|
|
||||||
// Catalog
|
// Catalog
|
||||||
let registry = catalogd::registry::Registry::new(store.clone());
|
let registry = catalogd::registry::Registry::new(store.clone());
|
||||||
@@ -59,7 +35,7 @@ async fn main() {
|
|||||||
|
|
||||||
// Query engine with 16GB memory cache
|
// Query engine with 16GB memory cache
|
||||||
let cache = queryd::cache::MemCache::new(16 * 1024 * 1024 * 1024);
|
let cache = queryd::cache::MemCache::new(16 * 1024 * 1024 * 1024);
|
||||||
let engine = queryd::context::QueryEngine::new(registry.clone(), bucket_registry.clone(), cache);
|
let engine = queryd::context::QueryEngine::new(registry.clone(), store.clone(), cache);
|
||||||
|
|
||||||
// Event journal — append-only mutation log (flush every 100 events)
|
// Event journal — append-only mutation log (flush every 100 events)
|
||||||
let journal = journald::journal::Journal::new(store.clone(), 100);
|
let journal = journald::journal::Journal::new(store.clone(), 100);
|
||||||
@@ -68,338 +44,64 @@ async fn main() {
|
|||||||
let access = access::AccessControl::new(config.auth.enabled);
|
let access = access::AccessControl::new(config.auth.enabled);
|
||||||
access.register_defaults().await;
|
access.register_defaults().await;
|
||||||
|
|
||||||
// Phase 42 — file-backed truth rules. Probes the `truth/` directory
|
|
||||||
// at repo root (or $LAKEHOUSE_TRUTH_DIR override) and logs how many
|
|
||||||
// rules load. Current request paths still build their own stores
|
|
||||||
// via truth::default_truth_store() / truth::sql_query_guard_store();
|
|
||||||
// the composed-at-boot store gets plumbed through V1State in a
|
|
||||||
// follow-up. This boot probe catches parse errors + duplicate-ID
|
|
||||||
// collisions early rather than at first request.
|
|
||||||
{
|
|
||||||
let truth_dir = std::env::var("LAKEHOUSE_TRUTH_DIR")
|
|
||||||
.unwrap_or_else(|_| "/home/profit/lakehouse/truth".to_string());
|
|
||||||
if std::path::Path::new(&truth_dir).exists() {
|
|
||||||
let mut probe_store = truth::default_truth_store();
|
|
||||||
match truth::loader::load_from_dir(&mut probe_store, &truth_dir) {
|
|
||||||
Ok(n) => tracing::info!("truth: loaded {n} file-backed rule(s) from {truth_dir}"),
|
|
||||||
Err(e) => tracing::warn!("truth: failed to load rules from {truth_dir}: {e}"),
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
tracing::debug!("truth: no rule dir at {truth_dir}, skipping file-backed load");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Workspace manager for agent-specific overlays
|
// Workspace manager for agent-specific overlays
|
||||||
let workspace_mgr = queryd::workspace::WorkspaceManager::new(store.clone());
|
let workspace_mgr = queryd::workspace::WorkspaceManager::new(store.clone());
|
||||||
if let Err(e) = workspace_mgr.rebuild().await {
|
if let Err(e) = workspace_mgr.rebuild().await {
|
||||||
tracing::warn!("workspace rebuild: {e}");
|
tracing::warn!("workspace rebuild: {e}");
|
||||||
}
|
}
|
||||||
|
|
||||||
// AI sidecar clients — Phase 44 part 3 (2026-04-27).
|
// AI sidecar client
|
||||||
//
|
let ai_client = aibridge::client::AiClient::new(&config.sidecar.url);
|
||||||
// Two flavors of the same client:
|
|
||||||
// - `ai_client_direct` posts directly to ${sidecar}/generate. Used
|
|
||||||
// inside the gateway by V1State + the legacy /ai proxy. These
|
|
||||||
// call sites are themselves the implementation of /v1/chat
|
|
||||||
// (or its sidecar shim), so routing them through /v1/chat
|
|
||||||
// would self-loop.
|
|
||||||
// - `ai_client_observable` posts via ${gateway}/v1/chat with
|
|
||||||
// provider="ollama". Used by vectord modules (autotune agent,
|
|
||||||
// /vectors service) so their LLM calls land in /v1/usage and
|
|
||||||
// Langfuse traces. Adds one localhost HTTP hop per call (~ms);
|
|
||||||
// accepted for the observability gain.
|
|
||||||
//
|
|
||||||
// The gateway can call its own /v1/chat over localhost during
|
|
||||||
// boot's transient period because we don't fire any LLM calls
|
|
||||||
// until the listener is up — the observable client is just
|
|
||||||
// configured here, not exercised.
|
|
||||||
let ai_client_direct = aibridge::client::AiClient::new(&config.sidecar.url);
|
|
||||||
let gateway_self_url = format!("http://{}:{}", config.gateway.host, config.gateway.port);
|
|
||||||
let ai_client_observable = aibridge::client::AiClient::new_with_gateway(
|
|
||||||
&config.sidecar.url,
|
|
||||||
&gateway_self_url,
|
|
||||||
);
|
|
||||||
// Backwards-compat alias for the (many) existing references in this file.
|
|
||||||
// Defaults to direct so the existing wiring (V1State, /ai proxy)
|
|
||||||
// keeps its non-self-loop transport. New vectord wiring below
|
|
||||||
// explicitly uses ai_client_observable.
|
|
||||||
let ai_client = ai_client_direct.clone();
|
|
||||||
|
|
||||||
// Vector service components — built before the router because both the
|
|
||||||
// /vectors service AND ingestd need the agent handle to enqueue triggers.
|
|
||||||
let index_reg = vectord::index_registry::IndexRegistry::new(store.clone());
|
|
||||||
let _ = index_reg.rebuild().await;
|
|
||||||
let hnsw = vectord::hnsw::HnswStore::new();
|
|
||||||
let emb_cache = vectord::embedding_cache::EmbeddingCache::new(store.clone());
|
|
||||||
// Phase B (federation layer 2): trial journals + promotion files now
|
|
||||||
// live in each index's recorded bucket (IndexMeta.bucket), not always
|
|
||||||
// primary. Journal / registry resolve per-call via the bucket registry.
|
|
||||||
let tj = vectord::trial::TrialJournal::new(bucket_registry.clone(), index_reg.clone());
|
|
||||||
let pr = vectord::promotion::PromotionRegistry::new(bucket_registry.clone(), index_reg.clone());
|
|
||||||
let hs = vectord::harness::HarnessStore::new(bucket_registry.clone(), index_reg.clone());
|
|
||||||
// Phase 19: playbook memory. Load cached state; empty-on-miss is fine,
|
|
||||||
// operators call POST /vectors/playbook_memory/rebuild to populate.
|
|
||||||
let pbm = vectord::playbook_memory::PlaybookMemory::new(store.clone());
|
|
||||||
let _ = pbm.load_from_storage().await;
|
|
||||||
// Pathway memory — consensus-designed sidecar for full-context
|
|
||||||
// backtracking + hot-swap of successful review pathways. Same
|
|
||||||
// load-on-boot pattern as playbook_memory: empty state is fine,
|
|
||||||
// operators start populating via scrum_master_pipeline.ts.
|
|
||||||
let pwm = vectord::pathway_memory::PathwayMemory::new(store.clone());
|
|
||||||
let _ = pwm.load_from_storage().await;
|
|
||||||
|
|
||||||
// Phase 16.2: spawn the autotune agent. When config.agent.enabled=false
|
|
||||||
// this returns a handle that drops triggers silently — no surprise load.
|
|
||||||
let agent_cfg = vectord::agent::AgentConfig {
|
|
||||||
enabled: config.agent.enabled,
|
|
||||||
cycle_interval_secs: config.agent.cycle_interval_secs,
|
|
||||||
cooldown_between_trials_secs: config.agent.cooldown_between_trials_secs,
|
|
||||||
min_recall: config.agent.min_recall,
|
|
||||||
max_trials_per_hour: config.agent.max_trials_per_hour,
|
|
||||||
};
|
|
||||||
let agent_handle = vectord::agent::spawn(
|
|
||||||
agent_cfg,
|
|
||||||
vectord::agent::AgentDeps {
|
|
||||||
store: store.clone(),
|
|
||||||
// Observable: autotune agent's LLM calls go through
|
|
||||||
// /v1/chat for /v1/usage + Langfuse visibility.
|
|
||||||
ai_client: ai_client_observable.clone(),
|
|
||||||
catalog: registry.clone(),
|
|
||||||
index_registry: index_reg.clone(),
|
|
||||||
hnsw_store: hnsw.clone(),
|
|
||||||
embedding_cache: emb_cache.clone(),
|
|
||||||
trial_journal: tj.clone(),
|
|
||||||
promotion_registry: pr.clone(),
|
|
||||||
harness_store: hs.clone(),
|
|
||||||
},
|
|
||||||
);
|
|
||||||
|
|
||||||
// HTTP router
|
// HTTP router
|
||||||
let mut app = Router::new()
|
let mut app = Router::new()
|
||||||
.route("/health", get(health))
|
.route("/health", get(health))
|
||||||
.nest("/storage", storaged::service::router(store.clone())
|
.nest("/storage", storaged::service::router(store.clone()))
|
||||||
.merge(storaged::federation_service::router(bucket_registry.clone())))
|
|
||||||
.nest("/catalog", catalogd::service::router(registry.clone()))
|
.nest("/catalog", catalogd::service::router(registry.clone()))
|
||||||
.nest("/query", queryd::service::router(engine.clone()))
|
.nest("/query", queryd::service::router(engine.clone()))
|
||||||
.nest("/ai", aibridge::service::router(ai_client.clone()))
|
.nest("/ai", aibridge::service::router(ai_client.clone()))
|
||||||
;
|
|
||||||
|
|
||||||
// Phase E: scheduled ingest
|
|
||||||
let sched_store = ingestd::schedule::ScheduleStore::new(store.clone());
|
|
||||||
if let Ok(n) = sched_store.rebuild().await {
|
|
||||||
if n > 0 { tracing::info!("rebuilt {n} persisted schedule(s)"); }
|
|
||||||
}
|
|
||||||
let scheduler = ingestd::schedule::Scheduler {
|
|
||||||
store: sched_store.clone(),
|
|
||||||
ingest: ingestd::schedule::SchedulerIngestDeps {
|
|
||||||
store: store.clone(),
|
|
||||||
registry: registry.clone(),
|
|
||||||
buckets: bucket_registry.clone(),
|
|
||||||
agent_handle: Some(agent_handle.clone()),
|
|
||||||
index_registry: index_reg.clone(),
|
|
||||||
},
|
|
||||||
tick_secs: 10,
|
|
||||||
};
|
|
||||||
scheduler.spawn();
|
|
||||||
|
|
||||||
app = app
|
|
||||||
.nest("/ingest", ingestd::service::router(ingestd::service::IngestState {
|
.nest("/ingest", ingestd::service::router(ingestd::service::IngestState {
|
||||||
store: store.clone(),
|
store: store.clone(),
|
||||||
registry: registry.clone(),
|
registry: registry.clone(),
|
||||||
buckets: bucket_registry.clone(),
|
|
||||||
agent_handle: agent_handle.clone(),
|
|
||||||
index_registry: index_reg.clone(),
|
|
||||||
schedules: sched_store,
|
|
||||||
// P9-001 fix 2026-04-23: journal reference flows into ingest so
|
|
||||||
// successful uploads emit a record_ingest event. Journal is Clone
|
|
||||||
// (Arc<RwLock> inside) so the /journal nest below still sees the
|
|
||||||
// same buffer + persistence.
|
|
||||||
journal: Some(journal.clone()),
|
|
||||||
}))
|
}))
|
||||||
.nest("/vectors", vectord::service::router(vectord::service::VectorState {
|
.nest("/vectors", vectord::service::router({
|
||||||
store: store.clone(),
|
let index_reg = vectord::index_registry::IndexRegistry::new(store.clone());
|
||||||
// Observable: /vectors service's LLM calls (RAG, summary,
|
let _ = index_reg.rebuild().await;
|
||||||
// playbook synthesis, etc.) flow through /v1/chat.
|
vectord::service::VectorState {
|
||||||
ai_client: ai_client_observable.clone(),
|
store: store.clone(),
|
||||||
job_tracker: vectord::jobs::JobTracker::new(),
|
ai_client: ai_client.clone(),
|
||||||
index_registry: index_reg.clone(),
|
job_tracker: vectord::jobs::JobTracker::new(),
|
||||||
hnsw_store: hnsw,
|
index_registry: index_reg,
|
||||||
embedding_cache: emb_cache,
|
hnsw_store: vectord::hnsw::HnswStore::new(),
|
||||||
trial_journal: tj,
|
}
|
||||||
harness_store: hs,
|
|
||||||
catalog: registry.clone(),
|
|
||||||
promotion_registry: pr,
|
|
||||||
agent_handle,
|
|
||||||
bucket_registry: bucket_registry.clone(),
|
|
||||||
active_profile: std::sync::Arc::new(tokio::sync::RwLock::new(None)),
|
|
||||||
lance: vectord::lance_backend::LanceRegistry::new(
|
|
||||||
bucket_registry.clone(), index_reg.clone(),
|
|
||||||
),
|
|
||||||
playbook_memory: pbm,
|
|
||||||
pathway_memory: pwm,
|
|
||||||
embed_semaphore: std::sync::Arc::new(tokio::sync::Semaphore::new(1)),
|
|
||||||
}))
|
}))
|
||||||
.nest("/workspaces", queryd::workspace_service::router(workspace_mgr))
|
.nest("/workspaces", queryd::workspace_service::router(workspace_mgr))
|
||||||
.nest("/journal", journald::service::router(journal))
|
.nest("/journal", journald::service::router(journal))
|
||||||
.nest("/access", access_service::router(access))
|
.nest("/access", access_service::router(access))
|
||||||
.nest("/tools", tools::service::router({
|
.nest("/tools", tools::service::router({
|
||||||
let tool_reg = tools::registry::ToolRegistry::new();
|
let tool_reg = tools::registry::ToolRegistry::new_with_defaults();
|
||||||
tool_reg.register_defaults().await;
|
tool_reg.register_defaults().await;
|
||||||
tools::ToolState {
|
tools::ToolState {
|
||||||
registry: tool_reg,
|
registry: tool_reg,
|
||||||
query_fn: tools::QueryExecutor::new(engine.clone()),
|
query_fn: tools::QueryExecutor::new(engine.clone()),
|
||||||
truth: std::sync::Arc::new(truth::sql_query_guard_store()),
|
|
||||||
}
|
}
|
||||||
}))
|
|
||||||
// Phase 38 — Universal API skeleton. Thin OpenAI-compatible
|
|
||||||
// surface over the existing aibridge → Ollama path. Future
|
|
||||||
// phases add provider adapters (39), routing engine (40),
|
|
||||||
// session state (41), etc. All without changing this mount.
|
|
||||||
.nest("/v1", v1::router(v1::V1State {
|
|
||||||
ai_client: ai_client.clone(),
|
|
||||||
usage: std::sync::Arc::new(tokio::sync::RwLock::new(v1::Usage::default())),
|
|
||||||
// Phase 39 first slice — Ollama Cloud adapter. Key resolved
|
|
||||||
// from OLLAMA_CLOUD_KEY env, then /root/llm_team_config.json,
|
|
||||||
// then OLLAMA_CLOUD_API_KEY env. None = cloud routes 503.
|
|
||||||
ollama_cloud_key: {
|
|
||||||
let k = v1::ollama_cloud::resolve_cloud_key();
|
|
||||||
if k.is_some() {
|
|
||||||
tracing::info!("v1: Ollama Cloud key loaded — /v1/chat provider=ollama_cloud enabled");
|
|
||||||
} else {
|
|
||||||
tracing::warn!("v1: no Ollama Cloud key in env or /root/llm_team_config.json — cloud routes will 503");
|
|
||||||
}
|
|
||||||
k
|
|
||||||
},
|
|
||||||
openrouter_key: {
|
|
||||||
// 2026-04-24 free-tier rescue rung for iter 5+. Shares
|
|
||||||
// the LLM Team UI's OPENROUTER_API_KEY so both systems
|
|
||||||
// draw from one quota.
|
|
||||||
let k = v1::openrouter::resolve_openrouter_key();
|
|
||||||
if k.is_some() {
|
|
||||||
tracing::info!("v1: OpenRouter key loaded — /v1/chat provider=openrouter enabled");
|
|
||||||
} else {
|
|
||||||
tracing::warn!("v1: no OpenRouter key — openrouter rescue rung will 503");
|
|
||||||
}
|
|
||||||
k
|
|
||||||
},
|
|
||||||
gemini_key: {
|
|
||||||
// Phase 40 provider. GEMINI_API_KEY in env or .env.
|
|
||||||
let k = v1::gemini::resolve_gemini_key();
|
|
||||||
if k.is_some() {
|
|
||||||
tracing::info!("v1: Gemini key loaded — /v1/chat provider=gemini enabled");
|
|
||||||
} else {
|
|
||||||
tracing::debug!("v1: no Gemini key — provider=gemini will 503");
|
|
||||||
}
|
|
||||||
k
|
|
||||||
},
|
|
||||||
claude_key: {
|
|
||||||
// Phase 40 provider. ANTHROPIC_API_KEY in env or .env.
|
|
||||||
let k = v1::claude::resolve_claude_key();
|
|
||||||
if k.is_some() {
|
|
||||||
tracing::info!("v1: Claude key loaded — /v1/chat provider=claude enabled");
|
|
||||||
} else {
|
|
||||||
tracing::debug!("v1: no Claude key — provider=claude will 503");
|
|
||||||
}
|
|
||||||
k
|
|
||||||
},
|
|
||||||
kimi_key: {
|
|
||||||
// Direct Kimi For Coding (api.kimi.com) — bypasses the
|
|
||||||
// broken-upstream kimi-k2:1t and OpenRouter rate caps.
|
|
||||||
// Key from /etc/lakehouse/kimi.env (KIMI_API_KEY=sk-kimi-…).
|
|
||||||
let k = v1::kimi::resolve_kimi_key();
|
|
||||||
if k.is_some() {
|
|
||||||
tracing::info!("v1: Kimi key loaded — /v1/chat provider=kimi enabled (model=kimi-for-coding)");
|
|
||||||
} else {
|
|
||||||
tracing::debug!("v1: no Kimi key — provider=kimi will 503");
|
|
||||||
}
|
|
||||||
k
|
|
||||||
},
|
|
||||||
opencode_key: {
|
|
||||||
// OpenCode GO multi-vendor gateway — Claude Opus 4.7,
|
|
||||||
// GPT-5.5-pro, Gemini 3.1-pro, Kimi K2.6, DeepSeek, GLM,
|
|
||||||
// Qwen + free-tier. Key from /etc/lakehouse/opencode.env.
|
|
||||||
let k = v1::opencode::resolve_opencode_key();
|
|
||||||
if k.is_some() {
|
|
||||||
tracing::info!("v1: OpenCode key loaded — /v1/chat provider=opencode enabled (40 models)");
|
|
||||||
} else {
|
|
||||||
tracing::debug!("v1: no OpenCode key — provider=opencode will 503");
|
|
||||||
}
|
|
||||||
k
|
|
||||||
},
|
|
||||||
validate_workers: {
|
|
||||||
// Load workers_500k.parquet snapshot for /v1/validate.
|
|
||||||
// Path overridable via LH_WORKERS_PARQUET env. Missing
|
|
||||||
// file is non-fatal — validators run schema/PII checks
|
|
||||||
// unaffected; only worker-existence checks fail clean.
|
|
||||||
let path_str = std::env::var("LH_WORKERS_PARQUET")
|
|
||||||
.unwrap_or_else(|_| "/home/profit/lakehouse/data/datasets/workers_500k.parquet".into());
|
|
||||||
let path = std::path::Path::new(&path_str);
|
|
||||||
if path.exists() {
|
|
||||||
match validator::staffing::parquet_lookup::load_workers_parquet(path) {
|
|
||||||
Ok(lookup) => {
|
|
||||||
tracing::info!("v1: workers parquet loaded from {} — /v1/validate worker-existence checks enabled", path_str);
|
|
||||||
lookup
|
|
||||||
}
|
|
||||||
Err(e) => {
|
|
||||||
tracing::warn!("v1: workers parquet at {} unreadable ({e}) — /v1/validate worker-existence checks will fail Consistency", path_str);
|
|
||||||
std::sync::Arc::new(validator::InMemoryWorkerLookup::new())
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
tracing::warn!("v1: workers parquet at {} not found — /v1/validate worker-existence checks will fail Consistency", path_str);
|
|
||||||
std::sync::Arc::new(validator::InMemoryWorkerLookup::new())
|
|
||||||
}
|
|
||||||
},
|
|
||||||
// Phase 40 early deliverable — Langfuse trace emitter.
|
|
||||||
// Defaults match mcp-server/tracing.ts conventions so
|
|
||||||
// gateway traces land in the same staffing project.
|
|
||||||
langfuse: {
|
|
||||||
let c = v1::langfuse_trace::LangfuseClient::from_env_or_defaults();
|
|
||||||
if c.is_some() {
|
|
||||||
tracing::info!("v1: Langfuse tracing enabled — /v1/chat calls will appear at localhost:3001");
|
|
||||||
} else {
|
|
||||||
tracing::warn!("v1: Langfuse keys missing — /v1/chat calls will not be traced");
|
|
||||||
}
|
|
||||||
c
|
|
||||||
},
|
|
||||||
// Coordinator session JSONL — one row per /v1/iterate
|
|
||||||
// session for offline DuckDB analysis. Cross-runtime
|
|
||||||
// parity with Go-side validatord (commit 1a3a82a).
|
|
||||||
session_log: {
|
|
||||||
let path = &config.gateway.session_log_path;
|
|
||||||
let s = v1::session_log::SessionLogger::from_path(path);
|
|
||||||
if s.is_some() {
|
|
||||||
tracing::info!(
|
|
||||||
"v1: session log enabled — coordinator sessions written to {}",
|
|
||||||
path
|
|
||||||
);
|
|
||||||
} else {
|
|
||||||
tracing::info!("v1: session log disabled (set [gateway].session_log_path to enable)");
|
|
||||||
}
|
|
||||||
s
|
|
||||||
},
|
|
||||||
}));
|
}));
|
||||||
|
|
||||||
// Auth middleware (if enabled) — P5-001 fix 2026-04-23:
|
// Auth middleware (if enabled)
|
||||||
// previously only inserted the ApiKey as an extension and never layered
|
|
||||||
// the middleware, so auth.enabled=true enforced nothing. Now wraps the
|
|
||||||
// router with from_fn_with_state, which calls api_key_auth on every
|
|
||||||
// request. /health is exempted inside the middleware (LB probes).
|
|
||||||
if config.auth.enabled {
|
if config.auth.enabled {
|
||||||
if let Some(ref key) = config.auth.api_key {
|
if let Some(ref key) = config.auth.api_key {
|
||||||
tracing::info!("API key auth enabled — enforcing on all routes except /health");
|
tracing::info!("API key auth enabled");
|
||||||
let api_key = auth::ApiKey(key.clone());
|
let api_key = auth::ApiKey(key.clone());
|
||||||
app = app.layer(axum::middleware::from_fn_with_state(
|
app = app.layer(axum::Extension(api_key));
|
||||||
api_key,
|
// Note: auth middleware applied per-route in production
|
||||||
auth::api_key_auth,
|
// For now, the ApiKey extension is available for handlers to check
|
||||||
));
|
|
||||||
} else {
|
} else {
|
||||||
tracing::warn!("auth enabled but no api_key set — all requests allowed");
|
tracing::warn!("auth enabled but no api_key set — all requests allowed");
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
app = app
|
app = app
|
||||||
.layer(DefaultBodyLimit::max(512 * 1024 * 1024)) // 512MB — supports 500K worker CSV
|
.layer(DefaultBodyLimit::max(256 * 1024 * 1024)) // 256MB
|
||||||
.layer(CorsLayer::new()
|
.layer(CorsLayer::new()
|
||||||
.allow_origin(Any)
|
.allow_origin(Any)
|
||||||
.allow_methods(Any)
|
.allow_methods(Any)
|
||||||
|
|||||||
@@ -3,18 +3,12 @@ pub mod service;
|
|||||||
|
|
||||||
use queryd::context::QueryEngine;
|
use queryd::context::QueryEngine;
|
||||||
use arrow::json::writer::{JsonArray, Writer as JsonWriter};
|
use arrow::json::writer::{JsonArray, Writer as JsonWriter};
|
||||||
use std::sync::Arc;
|
|
||||||
use truth::TruthStore;
|
|
||||||
|
|
||||||
/// State for the tool system.
|
/// State for the tool system.
|
||||||
#[derive(Clone)]
|
#[derive(Clone)]
|
||||||
pub struct ToolState {
|
pub struct ToolState {
|
||||||
pub registry: registry::ToolRegistry,
|
pub registry: registry::ToolRegistry,
|
||||||
pub query_fn: QueryExecutor,
|
pub query_fn: QueryExecutor,
|
||||||
/// SQL guard (shared with queryd). Mirrors the queryd /sql truth
|
|
||||||
/// gate from P42-002 (9cc0ceb) — tools also execute model-
|
|
||||||
/// originated SQL, need the same destructive-verb block.
|
|
||||||
pub truth: Arc<TruthStore>,
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Wraps QueryEngine to provide a simple execute interface for tools.
|
/// Wraps QueryEngine to provide a simple execute interface for tools.
|
||||||
|
|||||||
@@ -67,14 +67,24 @@ pub struct ToolRegistry {
|
|||||||
}
|
}
|
||||||
|
|
||||||
impl ToolRegistry {
|
impl ToolRegistry {
|
||||||
/// Build an empty registry. Callers in an async context should follow
|
|
||||||
/// this with `.register_defaults().await` if they want the built-in
|
|
||||||
/// staffing tools pre-installed — main.rs does exactly that.
|
|
||||||
pub fn new() -> Self {
|
pub fn new() -> Self {
|
||||||
Self {
|
let registry = Self {
|
||||||
tools: Arc::new(RwLock::new(HashMap::new())),
|
tools: Arc::new(RwLock::new(HashMap::new())),
|
||||||
audit_log: Arc::new(RwLock::new(Vec::new())),
|
audit_log: Arc::new(RwLock::new(Vec::new())),
|
||||||
}
|
};
|
||||||
|
// Register built-in staffing tools
|
||||||
|
tokio::task::block_in_place(|| {
|
||||||
|
tokio::runtime::Handle::current().block_on(registry.register_defaults())
|
||||||
|
});
|
||||||
|
registry
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn new_with_defaults() -> Self {
|
||||||
|
let registry = Self {
|
||||||
|
tools: Arc::new(RwLock::new(HashMap::new())),
|
||||||
|
audit_log: Arc::new(RwLock::new(Vec::new())),
|
||||||
|
};
|
||||||
|
registry
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Register default staffing tools.
|
/// Register default staffing tools.
|
||||||
@@ -93,7 +103,7 @@ impl ToolRegistry {
|
|||||||
ParamDef { name: "limit".into(), param_type: "integer".into(), required: false, description: "Max results".into(), default: Some(serde_json::json!(20)) },
|
ParamDef { name: "limit".into(), param_type: "integer".into(), required: false, description: "Max results".into(), default: Some(serde_json::json!(20)) },
|
||||||
],
|
],
|
||||||
returns: "List of candidates with id, name, phone, email, skills, experience".into(),
|
returns: "List of candidates with id, name, phone, email, skills, experience".into(),
|
||||||
sql_template: "SELECT candidate_id, first_name, last_name, phone, email, city, state, skills, years_experience, status FROM candidates WHERE 1=1 {skills_filter} {city_filter} {state_filter} {years_filter} {status_filter} ORDER BY years_experience DESC LIMIT {limit}".into(),
|
sql_template: "SELECT candidate_id, first_name, last_name, phone, email, city, state, zip, vertical, skills, years_experience FROM candidates WHERE 1=1 {skills_filter} {city_filter} {state_filter} {years_filter} {status_filter} ORDER BY years_experience DESC LIMIT {limit}".into(),
|
||||||
category: "candidates".into(),
|
category: "candidates".into(),
|
||||||
},
|
},
|
||||||
ToolDef {
|
ToolDef {
|
||||||
|
|||||||
@@ -7,7 +7,7 @@ use axum::{
|
|||||||
};
|
};
|
||||||
use serde::Deserialize;
|
use serde::Deserialize;
|
||||||
|
|
||||||
use super::registry::{ToolInvocation, ToolRegistry};
|
use super::registry::{Permission, ToolInvocation, ToolRegistry};
|
||||||
use crate::tools::ToolState;
|
use crate::tools::ToolState;
|
||||||
|
|
||||||
pub fn router(state: ToolState) -> Router {
|
pub fn router(state: ToolState) -> Router {
|
||||||
@@ -92,32 +92,6 @@ async fn call_tool(
|
|||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
// Truth gate — same contract as queryd /sql (P42-002). Rejects
|
|
||||||
// destructive verbs + empty SQL. Scrum iter 11 CF-1 + CF-2 on this
|
|
||||||
// file: tools executed model-provided SQL parameters without any
|
|
||||||
// validation. Close the gap here so the parallel surface has the
|
|
||||||
// same safety floor as queryd.
|
|
||||||
let ctx = serde_json::json!({ "sql": sql });
|
|
||||||
for outcome in state.truth.evaluate("sql_query", &ctx) {
|
|
||||||
if outcome.passed {
|
|
||||||
if let truth::RuleAction::Reject { message } | truth::RuleAction::Block { message } = &outcome.action {
|
|
||||||
tracing::warn!("tool {name}: SQL blocked by truth gate ({}): {message}", outcome.rule_id);
|
|
||||||
state.registry.log_invocation(ToolInvocation {
|
|
||||||
id: format!("inv-{}", chrono::Utc::now().timestamp_millis()),
|
|
||||||
tool_name: name.clone(),
|
|
||||||
agent: req.agent.clone(),
|
|
||||||
params: req.params.clone(),
|
|
||||||
permission: tool.permission.clone(),
|
|
||||||
timestamp: chrono::Utc::now(),
|
|
||||||
success: false,
|
|
||||||
error: Some(format!("truth gate: {message}")),
|
|
||||||
rows_returned: None,
|
|
||||||
}).await;
|
|
||||||
return Err((StatusCode::FORBIDDEN, message.clone()));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Execute via query engine
|
// Execute via query engine
|
||||||
let result = state.query_fn.execute(&sql).await;
|
let result = state.query_fn.execute(&sql).await;
|
||||||
|
|
||||||
|
|||||||
@@ -1,222 +0,0 @@
|
|||||||
//! Claude (Anthropic) adapter.
|
|
||||||
//!
|
|
||||||
//! POST `https://api.anthropic.com/v1/messages`. Auth via `x-api-key`
|
|
||||||
//! header (not bearer) + required `anthropic-version` header. Payload
|
|
||||||
//! is NOT OpenAI-compatible — response text lives at
|
|
||||||
//! `content[0].text`. Phase 40 deliverable. System prompts travel in
|
|
||||||
//! a top-level `system` field, separate from the `messages` array.
|
|
||||||
|
|
||||||
use std::time::Duration;
|
|
||||||
use serde::{Deserialize, Serialize};
|
|
||||||
|
|
||||||
use super::{ChatRequest, ChatResponse, Choice, Message, UsageBlock};
|
|
||||||
|
|
||||||
const CLAUDE_BASE_URL: &str = "https://api.anthropic.com/v1";
|
|
||||||
const CLAUDE_API_VERSION: &str = "2023-06-01";
|
|
||||||
const CLAUDE_TIMEOUT_SECS: u64 = 180;
|
|
||||||
|
|
||||||
pub fn resolve_claude_key() -> Option<String> {
|
|
||||||
if let Ok(k) = std::env::var("ANTHROPIC_API_KEY") {
|
|
||||||
if !k.trim().is_empty() { return Some(k.trim().to_string()); }
|
|
||||||
}
|
|
||||||
for path in ["/home/profit/.env", "/root/.env"] {
|
|
||||||
if let Ok(raw) = std::fs::read_to_string(path) {
|
|
||||||
for line in raw.lines() {
|
|
||||||
if let Some(rest) = line.strip_prefix("ANTHROPIC_API_KEY=") {
|
|
||||||
let k = rest.trim().trim_matches('"').trim_matches('\'');
|
|
||||||
if !k.is_empty() { return Some(k.to_string()); }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
None
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn chat(
|
|
||||||
key: &str,
|
|
||||||
req: &ChatRequest,
|
|
||||||
) -> Result<ChatResponse, String> {
|
|
||||||
// Strip the "claude/" prefix if the caller used the namespaced form.
|
|
||||||
let model = req.model.strip_prefix("claude/").unwrap_or(&req.model).to_string();
|
|
||||||
|
|
||||||
// Anthropic carries system prompts outside the messages array.
|
|
||||||
// Concatenate any system-role messages into a single system string;
|
|
||||||
// keep user + assistant messages in `messages`.
|
|
||||||
let mut system_parts: Vec<String> = Vec::new();
|
|
||||||
let mut msgs: Vec<AnMessage> = Vec::new();
|
|
||||||
for m in &req.messages {
|
|
||||||
if m.role == "system" {
|
|
||||||
system_parts.push(m.text());
|
|
||||||
} else {
|
|
||||||
// Anthropic expects strictly "user" or "assistant"; anything
|
|
||||||
// else we normalize to "user".
|
|
||||||
let role = if m.role == "assistant" { "assistant" } else { "user" };
|
|
||||||
msgs.push(AnMessage { role: role.to_string(), content: m.text() });
|
|
||||||
}
|
|
||||||
}
|
|
||||||
let system = if system_parts.is_empty() {
|
|
||||||
None
|
|
||||||
} else {
|
|
||||||
Some(system_parts.join("\n\n"))
|
|
||||||
};
|
|
||||||
|
|
||||||
let body = AnChatBody {
|
|
||||||
model: model.clone(),
|
|
||||||
messages: msgs,
|
|
||||||
max_tokens: req.max_tokens.unwrap_or(800),
|
|
||||||
temperature: req.temperature.unwrap_or(0.3),
|
|
||||||
system,
|
|
||||||
};
|
|
||||||
|
|
||||||
let client = reqwest::Client::builder()
|
|
||||||
.timeout(Duration::from_secs(CLAUDE_TIMEOUT_SECS))
|
|
||||||
.build()
|
|
||||||
.map_err(|e| format!("build client: {e}"))?;
|
|
||||||
|
|
||||||
let t0 = std::time::Instant::now();
|
|
||||||
let resp = client
|
|
||||||
.post(format!("{}/messages", CLAUDE_BASE_URL))
|
|
||||||
.header("x-api-key", key)
|
|
||||||
.header("anthropic-version", CLAUDE_API_VERSION)
|
|
||||||
.json(&body)
|
|
||||||
.send()
|
|
||||||
.await
|
|
||||||
.map_err(|e| format!("api.anthropic.com unreachable: {e}"))?;
|
|
||||||
|
|
||||||
let status = resp.status();
|
|
||||||
if !status.is_success() {
|
|
||||||
let body = resp.text().await.unwrap_or_else(|_| "?".into());
|
|
||||||
return Err(format!("claude {}: {}", status, body));
|
|
||||||
}
|
|
||||||
|
|
||||||
let parsed: AnChatResponse = resp.json().await
|
|
||||||
.map_err(|e| format!("invalid claude response: {e}"))?;
|
|
||||||
|
|
||||||
let latency_ms = t0.elapsed().as_millis();
|
|
||||||
let text = parsed.content.into_iter()
|
|
||||||
.find(|b| b.block_type == "text")
|
|
||||||
.map(|b| b.text)
|
|
||||||
.unwrap_or_default();
|
|
||||||
|
|
||||||
let prompt_tokens = parsed.usage.as_ref().map(|u| u.input_tokens).unwrap_or_else(|| {
|
|
||||||
let chars: usize = req.messages.iter().map(|m| m.text().chars().count()).sum();
|
|
||||||
((chars + 3) / 4) as u32
|
|
||||||
});
|
|
||||||
let completion_tokens = parsed.usage.as_ref().map(|u| u.output_tokens).unwrap_or_else(|| {
|
|
||||||
((text.chars().count() + 3) / 4) as u32
|
|
||||||
});
|
|
||||||
|
|
||||||
tracing::info!(
|
|
||||||
target: "v1.chat",
|
|
||||||
provider = "claude",
|
|
||||||
model = %model,
|
|
||||||
prompt_tokens,
|
|
||||||
completion_tokens,
|
|
||||||
latency_ms = latency_ms as u64,
|
|
||||||
"claude chat completed",
|
|
||||||
);
|
|
||||||
|
|
||||||
Ok(ChatResponse {
|
|
||||||
id: format!("chatcmpl-{}", chrono::Utc::now().timestamp_nanos_opt().unwrap_or(0)),
|
|
||||||
object: "chat.completion",
|
|
||||||
created: chrono::Utc::now().timestamp(),
|
|
||||||
model,
|
|
||||||
choices: vec![Choice {
|
|
||||||
index: 0,
|
|
||||||
message: Message::new_text("assistant", text),
|
|
||||||
finish_reason: parsed.stop_reason.unwrap_or_else(|| "stop".into()),
|
|
||||||
}],
|
|
||||||
usage: UsageBlock {
|
|
||||||
prompt_tokens,
|
|
||||||
completion_tokens,
|
|
||||||
total_tokens: prompt_tokens + completion_tokens,
|
|
||||||
},
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|
||||||
// -- Anthropic Messages API wire shapes --
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct AnChatBody {
|
|
||||||
model: String,
|
|
||||||
messages: Vec<AnMessage>,
|
|
||||||
max_tokens: u32,
|
|
||||||
temperature: f64,
|
|
||||||
#[serde(skip_serializing_if = "Option::is_none")]
|
|
||||||
system: Option<String>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct AnMessage { role: String, content: String }
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct AnChatResponse {
|
|
||||||
content: Vec<AnContentBlock>,
|
|
||||||
#[serde(default, rename = "stop_reason")]
|
|
||||||
stop_reason: Option<String>,
|
|
||||||
#[serde(default)]
|
|
||||||
usage: Option<AnUsage>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct AnContentBlock {
|
|
||||||
#[serde(rename = "type")]
|
|
||||||
block_type: String,
|
|
||||||
#[serde(default)]
|
|
||||||
text: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct AnUsage { input_tokens: u32, output_tokens: u32 }
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use super::*;
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn resolve_claude_key_does_not_panic() {
|
|
||||||
let _ = resolve_claude_key();
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn chat_body_serializes_with_separate_system() {
|
|
||||||
let body = AnChatBody {
|
|
||||||
model: "claude-3-5-sonnet-latest".into(),
|
|
||||||
messages: vec![
|
|
||||||
AnMessage { role: "user".into(), content: "hi".into() },
|
|
||||||
],
|
|
||||||
max_tokens: 800,
|
|
||||||
temperature: 0.3,
|
|
||||||
system: Some("You are helpful.".into()),
|
|
||||||
};
|
|
||||||
let json = serde_json::to_string(&body).unwrap();
|
|
||||||
assert!(json.contains("\"system\":\"You are helpful.\""));
|
|
||||||
assert!(json.contains("\"messages\""));
|
|
||||||
assert!(json.contains("\"max_tokens\":800"));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn body_omits_system_when_none() {
|
|
||||||
let body = AnChatBody {
|
|
||||||
model: "claude-3-5-sonnet-latest".into(),
|
|
||||||
messages: vec![AnMessage { role: "user".into(), content: "hi".into() }],
|
|
||||||
max_tokens: 800,
|
|
||||||
temperature: 0.3,
|
|
||||||
system: None,
|
|
||||||
};
|
|
||||||
let json = serde_json::to_string(&body).unwrap();
|
|
||||||
assert!(!json.contains("\"system\""), "system field should be skipped when None: {json}");
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn model_prefix_strip_preserves_bare_names() {
|
|
||||||
let cases = [
|
|
||||||
("claude/claude-3-5-sonnet-latest", "claude-3-5-sonnet-latest"),
|
|
||||||
("claude-3-5-sonnet-latest", "claude-3-5-sonnet-latest"),
|
|
||||||
];
|
|
||||||
for (input, expected) in cases {
|
|
||||||
let out = input.strip_prefix("claude/").unwrap_or(input);
|
|
||||||
assert_eq!(out, expected);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,230 +0,0 @@
|
|||||||
//! Gemini adapter — Google's Generative Language API.
|
|
||||||
//!
|
|
||||||
//! POST `https://generativelanguage.googleapis.com/v1beta/models/
|
|
||||||
//! {model}:generateContent?key=<API_KEY>`. Auth via query-string key
|
|
||||||
//! (not bearer). Payload shape is NOT OpenAI-compatible — we map
|
|
||||||
//! messages → contents + parts, extract response from `candidates[0]
|
|
||||||
//! .content.parts[0].text`. Phase 40 deliverable; gate: `/v1/chat`
|
|
||||||
//! with a prefixed or explicit gemini model returns normally.
|
|
||||||
|
|
||||||
use std::time::Duration;
|
|
||||||
use serde::{Deserialize, Serialize};
|
|
||||||
|
|
||||||
use super::{ChatRequest, ChatResponse, Choice, Message, UsageBlock};
|
|
||||||
|
|
||||||
const GEMINI_BASE_URL: &str = "https://generativelanguage.googleapis.com/v1beta";
|
|
||||||
const GEMINI_TIMEOUT_SECS: u64 = 180;
|
|
||||||
|
|
||||||
pub fn resolve_gemini_key() -> Option<String> {
|
|
||||||
if let Ok(k) = std::env::var("GEMINI_API_KEY") {
|
|
||||||
if !k.trim().is_empty() { return Some(k.trim().to_string()); }
|
|
||||||
}
|
|
||||||
for path in ["/home/profit/.env", "/root/.env"] {
|
|
||||||
if let Ok(raw) = std::fs::read_to_string(path) {
|
|
||||||
for line in raw.lines() {
|
|
||||||
if let Some(rest) = line.strip_prefix("GEMINI_API_KEY=") {
|
|
||||||
let k = rest.trim().trim_matches('"').trim_matches('\'');
|
|
||||||
if !k.is_empty() { return Some(k.to_string()); }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
None
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn chat(
|
|
||||||
key: &str,
|
|
||||||
req: &ChatRequest,
|
|
||||||
) -> Result<ChatResponse, String> {
|
|
||||||
// Strip the "gemini/" prefix if the caller used the namespaced form.
|
|
||||||
let model = req.model.strip_prefix("gemini/").unwrap_or(&req.model).to_string();
|
|
||||||
|
|
||||||
// Gemini splits system prompt from conversation differently.
|
|
||||||
// Simplest working mapping: concatenate any system messages at the
|
|
||||||
// top of a single user turn, then append user/assistant turns as
|
|
||||||
// separate contents entries. Covers the common single-turn case
|
|
||||||
// the scrum pipeline uses.
|
|
||||||
let mut contents: Vec<GmContent> = Vec::new();
|
|
||||||
for m in &req.messages {
|
|
||||||
let role = match m.role.as_str() {
|
|
||||||
"system" | "user" => "user",
|
|
||||||
_ => "model",
|
|
||||||
};
|
|
||||||
contents.push(GmContent {
|
|
||||||
role: role.to_string(),
|
|
||||||
parts: vec![GmPart { text: m.text() }],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
let body = GmChatBody {
|
|
||||||
contents,
|
|
||||||
generation_config: GmGenerationConfig {
|
|
||||||
temperature: req.temperature.unwrap_or(0.3),
|
|
||||||
max_output_tokens: req.max_tokens.unwrap_or(800),
|
|
||||||
},
|
|
||||||
};
|
|
||||||
|
|
||||||
let client = reqwest::Client::builder()
|
|
||||||
.timeout(Duration::from_secs(GEMINI_TIMEOUT_SECS))
|
|
||||||
.build()
|
|
||||||
.map_err(|e| format!("build client: {e}"))?;
|
|
||||||
|
|
||||||
let url = format!("{}/models/{}:generateContent?key={}", GEMINI_BASE_URL, model, key);
|
|
||||||
let t0 = std::time::Instant::now();
|
|
||||||
let resp = client
|
|
||||||
.post(&url)
|
|
||||||
.json(&body)
|
|
||||||
.send()
|
|
||||||
.await
|
|
||||||
.map_err(|e| format!("generativelanguage.googleapis.com unreachable: {e}"))?;
|
|
||||||
|
|
||||||
let status = resp.status();
|
|
||||||
if !status.is_success() {
|
|
||||||
let body = resp.text().await.unwrap_or_else(|_| "?".into());
|
|
||||||
return Err(format!("gemini {}: {}", status, body));
|
|
||||||
}
|
|
||||||
|
|
||||||
let parsed: GmChatResponse = resp.json().await
|
|
||||||
.map_err(|e| format!("invalid gemini response: {e}"))?;
|
|
||||||
|
|
||||||
let latency_ms = t0.elapsed().as_millis();
|
|
||||||
let candidate = parsed.candidates.into_iter().next()
|
|
||||||
.ok_or_else(|| "gemini returned no candidates".to_string())?;
|
|
||||||
let text = candidate.content.parts.into_iter()
|
|
||||||
.next()
|
|
||||||
.map(|p| p.text)
|
|
||||||
.unwrap_or_default();
|
|
||||||
|
|
||||||
let prompt_tokens = parsed.usage_metadata.as_ref()
|
|
||||||
.map(|u| u.prompt_token_count)
|
|
||||||
.unwrap_or_else(|| {
|
|
||||||
let chars: usize = req.messages.iter().map(|m| m.text().chars().count()).sum();
|
|
||||||
((chars + 3) / 4) as u32
|
|
||||||
});
|
|
||||||
let completion_tokens = parsed.usage_metadata.as_ref()
|
|
||||||
.map(|u| u.candidates_token_count)
|
|
||||||
.unwrap_or_else(|| ((text.chars().count() + 3) / 4) as u32);
|
|
||||||
|
|
||||||
tracing::info!(
|
|
||||||
target: "v1.chat",
|
|
||||||
provider = "gemini",
|
|
||||||
model = %model,
|
|
||||||
prompt_tokens,
|
|
||||||
completion_tokens,
|
|
||||||
latency_ms = latency_ms as u64,
|
|
||||||
"gemini chat completed",
|
|
||||||
);
|
|
||||||
|
|
||||||
Ok(ChatResponse {
|
|
||||||
id: format!("chatcmpl-{}", chrono::Utc::now().timestamp_nanos_opt().unwrap_or(0)),
|
|
||||||
object: "chat.completion",
|
|
||||||
created: chrono::Utc::now().timestamp(),
|
|
||||||
model,
|
|
||||||
choices: vec![Choice {
|
|
||||||
index: 0,
|
|
||||||
message: Message::new_text("assistant", text),
|
|
||||||
finish_reason: candidate.finish_reason.unwrap_or_else(|| "stop".into()),
|
|
||||||
}],
|
|
||||||
usage: UsageBlock {
|
|
||||||
prompt_tokens,
|
|
||||||
completion_tokens,
|
|
||||||
total_tokens: prompt_tokens + completion_tokens,
|
|
||||||
},
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|
||||||
// -- Gemini wire shapes --
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct GmChatBody {
|
|
||||||
contents: Vec<GmContent>,
|
|
||||||
#[serde(rename = "generationConfig")]
|
|
||||||
generation_config: GmGenerationConfig,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct GmContent {
|
|
||||||
role: String,
|
|
||||||
parts: Vec<GmPart>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct GmPart { text: String }
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
#[serde(rename_all = "camelCase")]
|
|
||||||
struct GmGenerationConfig {
|
|
||||||
temperature: f64,
|
|
||||||
max_output_tokens: u32,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct GmChatResponse {
|
|
||||||
candidates: Vec<GmCandidate>,
|
|
||||||
#[serde(default, rename = "usageMetadata")]
|
|
||||||
usage_metadata: Option<GmUsage>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct GmCandidate {
|
|
||||||
content: GmContentResp,
|
|
||||||
#[serde(default, rename = "finishReason")]
|
|
||||||
finish_reason: Option<String>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct GmContentResp { parts: Vec<GmPartResp> }
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct GmPartResp { #[serde(default)] text: String }
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
#[serde(rename_all = "camelCase")]
|
|
||||||
struct GmUsage {
|
|
||||||
prompt_token_count: u32,
|
|
||||||
candidates_token_count: u32,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use super::*;
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn resolve_gemini_key_does_not_panic() {
|
|
||||||
let _ = resolve_gemini_key();
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn chat_body_serializes_to_gemini_shape() {
|
|
||||||
let body = GmChatBody {
|
|
||||||
contents: vec![
|
|
||||||
GmContent {
|
|
||||||
role: "user".into(),
|
|
||||||
parts: vec![GmPart { text: "hello".into() }],
|
|
||||||
},
|
|
||||||
],
|
|
||||||
generation_config: GmGenerationConfig {
|
|
||||||
temperature: 0.3,
|
|
||||||
max_output_tokens: 800,
|
|
||||||
},
|
|
||||||
};
|
|
||||||
let json = serde_json::to_string(&body).unwrap();
|
|
||||||
assert!(json.contains("\"contents\""));
|
|
||||||
assert!(json.contains("\"parts\""));
|
|
||||||
// camelCase per Gemini API
|
|
||||||
assert!(json.contains("\"generationConfig\""));
|
|
||||||
assert!(json.contains("\"maxOutputTokens\":800"));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn model_prefix_strip_preserves_bare_names() {
|
|
||||||
let cases = [
|
|
||||||
("gemini/gemini-2.0-flash", "gemini-2.0-flash"),
|
|
||||||
("gemini-2.0-flash", "gemini-2.0-flash"),
|
|
||||||
];
|
|
||||||
for (input, expected) in cases {
|
|
||||||
let out = input.strip_prefix("gemini/").unwrap_or(input);
|
|
||||||
assert_eq!(out, expected);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,543 +0,0 @@
|
|||||||
//! /v1/iterate — the Phase 43 PRD's "generate → validate → correct → retry" loop.
|
|
||||||
//!
|
|
||||||
//! Closes the "0→85% with iteration" thesis structurally. A caller
|
|
||||||
//! posts a prompt + artifact kind + validation context; the gateway:
|
|
||||||
//! 1. Generates a JSON artifact via /v1/chat (any provider/model)
|
|
||||||
//! 2. Extracts the JSON object from the model output
|
|
||||||
//! 3. Validates via /v1/validate (FillValidator / EmailValidator /
|
|
||||||
//! PlaybookValidator with the shared WorkerLookup)
|
|
||||||
//! 4. On ValidationError, appends the error to the prompt and
|
|
||||||
//! retries up to `max_iterations` (default 3)
|
|
||||||
//! 5. Returns the accepted artifact + Report on success, OR the
|
|
||||||
//! attempt history + final error on max-iter exhaustion
|
|
||||||
//!
|
|
||||||
//! Internal calls go via HTTP loopback to localhost:gateway_port so
|
|
||||||
//! the same /v1/usage tracking and Langfuse traces apply. A small
|
|
||||||
//! latency cost (~1-3ms per loopback hop) for clean separation of
|
|
||||||
//! concerns and observability.
|
|
||||||
//!
|
|
||||||
//! 2026-04-27 Phase 43 v3 part 3: this endpoint makes the iteration
|
|
||||||
//! loop a first-class lakehouse capability rather than a per-caller
|
|
||||||
//! re-implementation. Staffing executors, agent loops, and future
|
|
||||||
//! validators all reach the same code path.
|
|
||||||
|
|
||||||
use axum::{extract::State, http::{HeaderMap, StatusCode}, response::IntoResponse, Json};
|
|
||||||
use serde::{Deserialize, Serialize};
|
|
||||||
|
|
||||||
const DEFAULT_MAX_ITERATIONS: u32 = 3;
|
|
||||||
const LOOPBACK_TIMEOUT_SECS: u64 = 240;
|
|
||||||
|
|
||||||
/// Header name used to propagate a Langfuse parent trace id across
|
|
||||||
/// daemon boundaries. Matches Go's `shared.TraceIDHeader` constant
|
|
||||||
/// byte-for-byte (commit d6d2fdf in golangLAKEHOUSE) — same wire
|
|
||||||
/// format means a Go caller can hit Rust's /v1/iterate (or vice
|
|
||||||
/// versa) and the resulting Langfuse trees nest correctly.
|
|
||||||
pub const TRACE_ID_HEADER: &str = "x-lakehouse-trace-id";
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
pub struct IterateRequest {
|
|
||||||
/// "fill" | "email" | "playbook" — picks which validator runs.
|
|
||||||
pub kind: String,
|
|
||||||
/// The prompt to seed generation. Validation errors from prior
|
|
||||||
/// attempts are appended on retry.
|
|
||||||
pub prompt: String,
|
|
||||||
/// Provider/model passed through to /v1/chat. e.g. "ollama_cloud"
|
|
||||||
/// + "kimi-k2.6", or "opencode" + "claude-haiku-4-5".
|
|
||||||
pub provider: String,
|
|
||||||
pub model: String,
|
|
||||||
/// Optional system prompt — sent to /v1/chat as the system message.
|
|
||||||
#[serde(default)]
|
|
||||||
pub system: Option<String>,
|
|
||||||
/// Validation context (target_count, city, state, role, client_id
|
|
||||||
/// for fills; candidate_id for emails). Forwarded to /v1/validate.
|
|
||||||
#[serde(default)]
|
|
||||||
pub context: Option<serde_json::Value>,
|
|
||||||
/// Cap on iteration count. Defaults to 3 per the Phase 43 PRD.
|
|
||||||
#[serde(default)]
|
|
||||||
pub max_iterations: Option<u32>,
|
|
||||||
/// Forwarded to /v1/chat. Defaults to 0.2 if unset.
|
|
||||||
#[serde(default)]
|
|
||||||
pub temperature: Option<f64>,
|
|
||||||
/// Forwarded to /v1/chat. Defaults to 4096 if unset.
|
|
||||||
#[serde(default)]
|
|
||||||
pub max_tokens: Option<u32>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
pub struct IterateAttempt {
|
|
||||||
pub iteration: u32,
|
|
||||||
pub raw: String,
|
|
||||||
pub status: AttemptStatus,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
#[serde(tag = "kind", rename_all = "snake_case")]
|
|
||||||
pub enum AttemptStatus {
|
|
||||||
/// Model output didn't contain extractable JSON.
|
|
||||||
NoJson,
|
|
||||||
/// JSON extracted but failed validation; carries the error.
|
|
||||||
ValidationFailed { error: serde_json::Value },
|
|
||||||
/// Validation passed (last attempt's terminal status).
|
|
||||||
Accepted,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
pub struct IterateResponse {
|
|
||||||
pub artifact: serde_json::Value,
|
|
||||||
pub validation: serde_json::Value,
|
|
||||||
pub iterations: u32,
|
|
||||||
pub history: Vec<IterateAttempt>,
|
|
||||||
/// Echoes the resolved trace id (caller-forwarded header, body
|
|
||||||
/// field, langfuse-middleware mint, or local fallback). Operators
|
|
||||||
/// pivot from this id straight into Langfuse + the
|
|
||||||
/// coordinator_sessions.jsonl join key. Cross-runtime parity with
|
|
||||||
/// Go's `validator.IterateResponse` (commit 6847bbc in
|
|
||||||
/// golangLAKEHOUSE).
|
|
||||||
#[serde(skip_serializing_if = "Option::is_none")]
|
|
||||||
pub trace_id: Option<String>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
pub struct IterateFailure {
|
|
||||||
pub error: String,
|
|
||||||
pub iterations: u32,
|
|
||||||
pub history: Vec<IterateAttempt>,
|
|
||||||
#[serde(skip_serializing_if = "Option::is_none")]
|
|
||||||
pub trace_id: Option<String>,
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn iterate(
|
|
||||||
State(state): State<super::V1State>,
|
|
||||||
headers: HeaderMap,
|
|
||||||
Json(req): Json<IterateRequest>,
|
|
||||||
) -> impl IntoResponse {
|
|
||||||
let max_iter = req.max_iterations.unwrap_or(DEFAULT_MAX_ITERATIONS).max(1);
|
|
||||||
let temperature = req.temperature.unwrap_or(0.2);
|
|
||||||
let max_tokens = req.max_tokens.unwrap_or(4096);
|
|
||||||
let mut history: Vec<IterateAttempt> = Vec::with_capacity(max_iter as usize);
|
|
||||||
let mut attempt_records: Vec<super::session_log::SessionAttemptRecord> = Vec::with_capacity(max_iter as usize);
|
|
||||||
let mut current_prompt = req.prompt.clone();
|
|
||||||
|
|
||||||
// Resolve the parent Langfuse trace id. Caller-forwarded header
|
|
||||||
// wins (cross-daemon tree linkage); otherwise mint a fresh id so
|
|
||||||
// the iterate session is its own tree. Same shape as the Go-side
|
|
||||||
// validatord trace propagation.
|
|
||||||
let trace_id: String = headers
|
|
||||||
.get(TRACE_ID_HEADER)
|
|
||||||
.and_then(|v| v.to_str().ok())
|
|
||||||
.filter(|s| !s.is_empty())
|
|
||||||
.map(|s| s.to_string())
|
|
||||||
.unwrap_or_else(new_trace_id);
|
|
||||||
|
|
||||||
let client = match reqwest::Client::builder()
|
|
||||||
.timeout(std::time::Duration::from_secs(LOOPBACK_TIMEOUT_SECS))
|
|
||||||
.build() {
|
|
||||||
Ok(c) => c,
|
|
||||||
Err(e) => {
|
|
||||||
// Even infrastructure failures get a session row so a
|
|
||||||
// missing /v1/iterate event never silently disappears
|
|
||||||
// from the longitudinal log.
|
|
||||||
write_infra_error(&state, &req, &trace_id, max_iter, 0, format!("client build: {e}")).await;
|
|
||||||
return (StatusCode::INTERNAL_SERVER_ERROR, format!("client build: {e}")).into_response();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
// Self-loopback to the gateway port. Carries gateway internal
|
|
||||||
// calls through /v1/chat + /v1/validate so /v1/usage tracks them.
|
|
||||||
let gateway = "http://127.0.0.1:3100";
|
|
||||||
let t0 = std::time::Instant::now();
|
|
||||||
|
|
||||||
for iteration in 0..max_iter {
|
|
||||||
let attempt_started = chrono::Utc::now();
|
|
||||||
// ── Generate ──
|
|
||||||
let mut messages = Vec::with_capacity(2);
|
|
||||||
if let Some(sys) = &req.system {
|
|
||||||
messages.push(serde_json::json!({"role": "system", "content": sys}));
|
|
||||||
}
|
|
||||||
messages.push(serde_json::json!({"role": "user", "content": current_prompt}));
|
|
||||||
let chat_body = serde_json::json!({
|
|
||||||
"messages": messages,
|
|
||||||
"provider": req.provider,
|
|
||||||
"model": req.model,
|
|
||||||
"temperature": temperature,
|
|
||||||
"max_tokens": max_tokens,
|
|
||||||
});
|
|
||||||
let raw = match call_chat(&client, gateway, &chat_body, &trace_id).await {
|
|
||||||
Ok(r) => r,
|
|
||||||
Err(e) => {
|
|
||||||
write_infra_error(&state, &req, &trace_id, max_iter, t0.elapsed().as_millis() as u64, format!("/v1/chat hop failed at iter {iteration}: {e}")).await;
|
|
||||||
return (StatusCode::BAD_GATEWAY, format!("/v1/chat hop failed at iter {iteration}: {e}")).into_response();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// ── Extract JSON ──
|
|
||||||
let artifact = match extract_json(&raw) {
|
|
||||||
Some(a) => a,
|
|
||||||
None => {
|
|
||||||
let span_id = emit_attempt_span(
|
|
||||||
&state, &trace_id, iteration, &req, ¤t_prompt, &raw, "no_json", None,
|
|
||||||
attempt_started, chrono::Utc::now(),
|
|
||||||
);
|
|
||||||
history.push(IterateAttempt {
|
|
||||||
iteration,
|
|
||||||
raw: raw.chars().take(2000).collect(),
|
|
||||||
status: AttemptStatus::NoJson,
|
|
||||||
});
|
|
||||||
attempt_records.push(super::session_log::SessionAttemptRecord {
|
|
||||||
iteration,
|
|
||||||
verdict_kind: "no_json".to_string(),
|
|
||||||
error: None,
|
|
||||||
span_id,
|
|
||||||
});
|
|
||||||
current_prompt = format!(
|
|
||||||
"{}\n\nYour previous attempt did not contain a JSON object. Reply with ONLY a valid JSON object matching the requested artifact shape.",
|
|
||||||
req.prompt,
|
|
||||||
);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// ── Validate ──
|
|
||||||
let validate_body = serde_json::json!({
|
|
||||||
"kind": req.kind,
|
|
||||||
"artifact": artifact,
|
|
||||||
"context": req.context.clone().unwrap_or(serde_json::Value::Null),
|
|
||||||
});
|
|
||||||
match call_validate(&client, gateway, &validate_body, &trace_id).await {
|
|
||||||
Ok(report) => {
|
|
||||||
let span_id = emit_attempt_span(
|
|
||||||
&state, &trace_id, iteration, &req, ¤t_prompt, &raw, "accepted", None,
|
|
||||||
attempt_started, chrono::Utc::now(),
|
|
||||||
);
|
|
||||||
history.push(IterateAttempt {
|
|
||||||
iteration,
|
|
||||||
raw: raw.chars().take(2000).collect(),
|
|
||||||
status: AttemptStatus::Accepted,
|
|
||||||
});
|
|
||||||
attempt_records.push(super::session_log::SessionAttemptRecord {
|
|
||||||
iteration,
|
|
||||||
verdict_kind: "accepted".to_string(),
|
|
||||||
error: None,
|
|
||||||
span_id,
|
|
||||||
});
|
|
||||||
let duration_ms = t0.elapsed().as_millis() as u64;
|
|
||||||
let grounded = grounded_in_roster(&state, &req.kind, &artifact);
|
|
||||||
write_session_accepted(&state, &req, &trace_id, iteration + 1, max_iter, attempt_records, &artifact, grounded, duration_ms).await;
|
|
||||||
return (StatusCode::OK, Json(IterateResponse {
|
|
||||||
artifact,
|
|
||||||
validation: report,
|
|
||||||
iterations: iteration + 1,
|
|
||||||
history,
|
|
||||||
trace_id: Some(trace_id.clone()),
|
|
||||||
})).into_response();
|
|
||||||
}
|
|
||||||
Err(err) => {
|
|
||||||
let err_summary = err.to_string();
|
|
||||||
let span_id = emit_attempt_span(
|
|
||||||
&state, &trace_id, iteration, &req, ¤t_prompt, &raw, "validation_failed",
|
|
||||||
Some(err_summary.clone()),
|
|
||||||
attempt_started, chrono::Utc::now(),
|
|
||||||
);
|
|
||||||
history.push(IterateAttempt {
|
|
||||||
iteration,
|
|
||||||
raw: raw.chars().take(2000).collect(),
|
|
||||||
status: AttemptStatus::ValidationFailed {
|
|
||||||
error: serde_json::to_value(&err_summary).unwrap_or(serde_json::Value::Null),
|
|
||||||
},
|
|
||||||
});
|
|
||||||
attempt_records.push(super::session_log::SessionAttemptRecord {
|
|
||||||
iteration,
|
|
||||||
verdict_kind: "validation_failed".to_string(),
|
|
||||||
error: Some(err_summary.clone()),
|
|
||||||
span_id,
|
|
||||||
});
|
|
||||||
// Append validation feedback to prompt for next iter.
|
|
||||||
// The model sees concrete failure mode + retries with
|
|
||||||
// corrective context. This is the "observer correction"
|
|
||||||
// in Phase 43 PRD shape, simplified — the validator
|
|
||||||
// itself IS the observer for now.
|
|
||||||
current_prompt = format!(
|
|
||||||
"{}\n\nPrior attempt failed validation:\n{}\n\nFix the specific issue above and respond with a corrected JSON object.",
|
|
||||||
req.prompt, err_summary,
|
|
||||||
);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
let duration_ms = t0.elapsed().as_millis() as u64;
|
|
||||||
write_session_failure(&state, &req, &trace_id, max_iter, max_iter, attempt_records, duration_ms).await;
|
|
||||||
(StatusCode::UNPROCESSABLE_ENTITY, Json(IterateFailure {
|
|
||||||
error: format!("max iterations reached ({max_iter}) without passing validation"),
|
|
||||||
iterations: max_iter,
|
|
||||||
history,
|
|
||||||
trace_id: Some(trace_id.clone()),
|
|
||||||
})).into_response()
|
|
||||||
}
|
|
||||||
|
|
||||||
// ─── Helpers — Langfuse spans + session log + roster check ─────────
|
|
||||||
|
|
||||||
fn emit_attempt_span(
|
|
||||||
state: &super::V1State,
|
|
||||||
trace_id: &str,
|
|
||||||
iteration: u32,
|
|
||||||
req: &IterateRequest,
|
|
||||||
prompt: &str,
|
|
||||||
raw: &str,
|
|
||||||
verdict: &str,
|
|
||||||
error: Option<String>,
|
|
||||||
started: chrono::DateTime<chrono::Utc>,
|
|
||||||
ended: chrono::DateTime<chrono::Utc>,
|
|
||||||
) -> Option<String> {
|
|
||||||
let lf = state.langfuse.as_ref()?;
|
|
||||||
Some(lf.emit_attempt_span(super::langfuse_trace::AttemptSpan {
|
|
||||||
trace_id: trace_id.to_string(),
|
|
||||||
iteration,
|
|
||||||
model: req.model.clone(),
|
|
||||||
provider: req.provider.clone(),
|
|
||||||
prompt: prompt.to_string(),
|
|
||||||
raw: raw.to_string(),
|
|
||||||
verdict: verdict.to_string(),
|
|
||||||
error,
|
|
||||||
start_time: started.to_rfc3339(),
|
|
||||||
end_time: ended.to_rfc3339(),
|
|
||||||
}))
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Verify every fill artifact's candidate IDs exist in the roster.
|
|
||||||
/// Returns Some(true)/Some(false) on the fill kind, None otherwise
|
|
||||||
/// (other kinds don't have worker IDs to ground). Same semantics as
|
|
||||||
/// Go's `handlers.rosterCheckFor("fill")`.
|
|
||||||
fn grounded_in_roster(
|
|
||||||
state: &super::V1State,
|
|
||||||
kind: &str,
|
|
||||||
artifact: &serde_json::Value,
|
|
||||||
) -> Option<bool> {
|
|
||||||
if kind != "fill" {
|
|
||||||
return None;
|
|
||||||
}
|
|
||||||
let fills = artifact.get("fills").and_then(|v| v.as_array())?;
|
|
||||||
for f in fills {
|
|
||||||
let id = match f.get("candidate_id").and_then(|v| v.as_str()) {
|
|
||||||
Some(s) if !s.is_empty() => s,
|
|
||||||
_ => return Some(false),
|
|
||||||
};
|
|
||||||
if state.validate_workers.find(id).is_none() {
|
|
||||||
return Some(false);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
Some(true)
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn write_session_accepted(
|
|
||||||
state: &super::V1State,
|
|
||||||
req: &IterateRequest,
|
|
||||||
trace_id: &str,
|
|
||||||
iterations: u32,
|
|
||||||
max_iter: u32,
|
|
||||||
attempts: Vec<super::session_log::SessionAttemptRecord>,
|
|
||||||
artifact: &serde_json::Value,
|
|
||||||
grounded: Option<bool>,
|
|
||||||
duration_ms: u64,
|
|
||||||
) {
|
|
||||||
let Some(logger) = state.session_log.as_ref() else { return };
|
|
||||||
let rec = build_session_record(req, trace_id, "accepted", iterations, max_iter, attempts, Some(artifact.clone()), grounded, duration_ms);
|
|
||||||
logger.append(rec).await;
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn write_session_failure(
|
|
||||||
state: &super::V1State,
|
|
||||||
req: &IterateRequest,
|
|
||||||
trace_id: &str,
|
|
||||||
iterations: u32,
|
|
||||||
max_iter: u32,
|
|
||||||
attempts: Vec<super::session_log::SessionAttemptRecord>,
|
|
||||||
duration_ms: u64,
|
|
||||||
) {
|
|
||||||
let Some(logger) = state.session_log.as_ref() else { return };
|
|
||||||
let rec = build_session_record(req, trace_id, "max_iter_exhausted", iterations, max_iter, attempts, None, None, duration_ms);
|
|
||||||
logger.append(rec).await;
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn write_infra_error(
|
|
||||||
state: &super::V1State,
|
|
||||||
req: &IterateRequest,
|
|
||||||
trace_id: &str,
|
|
||||||
max_iter: u32,
|
|
||||||
duration_ms: u64,
|
|
||||||
error: String,
|
|
||||||
) {
|
|
||||||
let Some(logger) = state.session_log.as_ref() else { return };
|
|
||||||
let attempts = vec![super::session_log::SessionAttemptRecord {
|
|
||||||
iteration: 0,
|
|
||||||
verdict_kind: "infra_error".to_string(),
|
|
||||||
error: Some(error),
|
|
||||||
span_id: None,
|
|
||||||
}];
|
|
||||||
let rec = build_session_record(req, trace_id, "infra_error", 0, max_iter, attempts, None, None, duration_ms);
|
|
||||||
logger.append(rec).await;
|
|
||||||
}
|
|
||||||
|
|
||||||
fn build_session_record(
|
|
||||||
req: &IterateRequest,
|
|
||||||
trace_id: &str,
|
|
||||||
final_verdict: &str,
|
|
||||||
iterations: u32,
|
|
||||||
max_iter: u32,
|
|
||||||
attempts: Vec<super::session_log::SessionAttemptRecord>,
|
|
||||||
artifact: Option<serde_json::Value>,
|
|
||||||
grounded: Option<bool>,
|
|
||||||
duration_ms: u64,
|
|
||||||
) -> super::session_log::SessionRecord {
|
|
||||||
super::session_log::SessionRecord {
|
|
||||||
schema: super::session_log::SESSION_RECORD_SCHEMA.to_string(),
|
|
||||||
session_id: trace_id.to_string(),
|
|
||||||
timestamp: chrono::Utc::now().to_rfc3339(),
|
|
||||||
daemon: "gateway".to_string(),
|
|
||||||
kind: req.kind.clone(),
|
|
||||||
model: req.model.clone(),
|
|
||||||
provider: req.provider.clone(),
|
|
||||||
prompt: super::session_log::truncate(&req.prompt, 4000),
|
|
||||||
iterations,
|
|
||||||
max_iterations: max_iter,
|
|
||||||
final_verdict: final_verdict.to_string(),
|
|
||||||
attempts,
|
|
||||||
artifact,
|
|
||||||
grounded_in_roster: grounded,
|
|
||||||
duration_ms,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Generate a fresh trace id when no parent was forwarded. Same
|
|
||||||
/// time-ordered hex shape Langfuse already accepts elsewhere in this
|
|
||||||
/// crate (see `langfuse_trace::uuid_v7_like`).
|
|
||||||
fn new_trace_id() -> String {
|
|
||||||
let ts = chrono::Utc::now().timestamp_nanos_opt().unwrap_or(0);
|
|
||||||
let rand = std::time::SystemTime::now()
|
|
||||||
.duration_since(std::time::UNIX_EPOCH)
|
|
||||||
.map(|d| d.subsec_nanos())
|
|
||||||
.unwrap_or(0);
|
|
||||||
format!("{:016x}-{:08x}", ts, rand)
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn call_chat(client: &reqwest::Client, gateway: &str, body: &serde_json::Value, trace_id: &str) -> Result<String, String> {
|
|
||||||
let mut req = client.post(format!("{gateway}/v1/chat")).json(body);
|
|
||||||
if !trace_id.is_empty() {
|
|
||||||
req = req.header(TRACE_ID_HEADER, trace_id);
|
|
||||||
}
|
|
||||||
let resp = req.send().await.map_err(|e| format!("chat hop: {e}"))?;
|
|
||||||
let status = resp.status();
|
|
||||||
if !status.is_success() {
|
|
||||||
let body = resp.text().await.unwrap_or_default();
|
|
||||||
return Err(format!("chat {}: {}", status, body.chars().take(300).collect::<String>()));
|
|
||||||
}
|
|
||||||
let parsed: serde_json::Value = resp.json().await.map_err(|e| format!("chat parse: {e}"))?;
|
|
||||||
Ok(parsed.pointer("/choices/0/message/content")
|
|
||||||
.and_then(|v| v.as_str())
|
|
||||||
.unwrap_or("")
|
|
||||||
.to_string())
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn call_validate(client: &reqwest::Client, gateway: &str, body: &serde_json::Value, trace_id: &str) -> Result<serde_json::Value, String> {
|
|
||||||
let mut req = client.post(format!("{gateway}/v1/validate")).json(body);
|
|
||||||
if !trace_id.is_empty() {
|
|
||||||
req = req.header(TRACE_ID_HEADER, trace_id);
|
|
||||||
}
|
|
||||||
let resp = req.send().await.map_err(|e| format!("validate hop: {e}"))?;
|
|
||||||
let status = resp.status();
|
|
||||||
let parsed: serde_json::Value = resp.json().await.map_err(|e| format!("validate parse: {e}"))?;
|
|
||||||
if status.is_success() {
|
|
||||||
Ok(parsed)
|
|
||||||
} else {
|
|
||||||
// The /v1/validate endpoint returns a ValidationError JSON
|
|
||||||
// on 422; surface its structure verbatim so the prompt-
|
|
||||||
// appending step gets specific failure detail.
|
|
||||||
Err(serde_json::to_string(&parsed).unwrap_or_else(|_| format!("validation {} (unparseable body)", status)))
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Extract the first JSON object from a model's output. Handles
|
|
||||||
/// fenced code blocks (```json ... ```), bare braces, and stray
|
|
||||||
/// prose around the JSON. Returns None on no extractable object.
|
|
||||||
///
|
|
||||||
/// Made `pub` 2026-05-02 to support the cross-runtime parity probe
|
|
||||||
/// at `golangLAKEHOUSE/scripts/cutover/parity/extract_json_parity.sh`.
|
|
||||||
/// The Go counterpart lives at `internal/validator/iterate.go::ExtractJSON`;
|
|
||||||
/// when either runtime's algorithm changes the parity probe surfaces
|
|
||||||
/// the divergence.
|
|
||||||
pub fn extract_json(raw: &str) -> Option<serde_json::Value> {
|
|
||||||
// Try fenced first.
|
|
||||||
let candidates: Vec<String> = {
|
|
||||||
let mut out = vec![];
|
|
||||||
let mut s = raw;
|
|
||||||
while let Some(start) = s.find("```") {
|
|
||||||
let after = &s[start + 3..];
|
|
||||||
// Skip optional language tag (json, etc.)
|
|
||||||
let body_start = after.find('\n').map(|n| n + 1).unwrap_or(0);
|
|
||||||
let body = &after[body_start..];
|
|
||||||
if let Some(end) = body.find("```") {
|
|
||||||
out.push(body[..end].trim().to_string());
|
|
||||||
s = &body[end + 3..];
|
|
||||||
} else { break; }
|
|
||||||
}
|
|
||||||
out
|
|
||||||
};
|
|
||||||
for c in &candidates {
|
|
||||||
if let Ok(v) = serde_json::from_str::<serde_json::Value>(c) {
|
|
||||||
if v.is_object() { return Some(v); }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
// Fall back to outermost {...} balance.
|
|
||||||
let bytes = raw.as_bytes();
|
|
||||||
let mut depth = 0i32;
|
|
||||||
let mut start: Option<usize> = None;
|
|
||||||
for (i, &b) in bytes.iter().enumerate() {
|
|
||||||
match b {
|
|
||||||
b'{' => { if start.is_none() { start = Some(i); } depth += 1; }
|
|
||||||
b'}' => {
|
|
||||||
depth -= 1;
|
|
||||||
if depth == 0 {
|
|
||||||
if let Some(s) = start {
|
|
||||||
let slice = &raw[s..=i];
|
|
||||||
if let Ok(v) = serde_json::from_str::<serde_json::Value>(slice) {
|
|
||||||
if v.is_object() { return Some(v); }
|
|
||||||
}
|
|
||||||
start = None;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
_ => {}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
None
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use super::*;
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn extract_json_from_fenced_block() {
|
|
||||||
let raw = "Here's my answer:\n```json\n{\"fills\": [{\"candidate_id\": \"W-1\"}]}\n```\nDone.";
|
|
||||||
let v = extract_json(raw).unwrap();
|
|
||||||
assert!(v.get("fills").is_some());
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn extract_json_from_bare_braces() {
|
|
||||||
let raw = "Here you go: {\"fills\": [{\"candidate_id\": \"W-2\"}]}";
|
|
||||||
let v = extract_json(raw).unwrap();
|
|
||||||
assert!(v.get("fills").is_some());
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn extract_json_returns_none_on_no_object() {
|
|
||||||
assert!(extract_json("just prose, no json").is_none());
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn extract_json_picks_first_balanced() {
|
|
||||||
let raw = "{\"a\":1} then {\"b\":2}";
|
|
||||||
let v = extract_json(raw).unwrap();
|
|
||||||
assert_eq!(v.get("a").and_then(|v| v.as_i64()), Some(1));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,227 +0,0 @@
|
|||||||
//! Kimi For Coding adapter — direct provider for `kimi-for-coding`
|
|
||||||
//! (kimi-k2.6 underneath). Used when Ollama Cloud's `kimi-k2:1t` is
|
|
||||||
//! returning sustained 5xx (broken upstream) and OpenRouter's
|
|
||||||
//! `moonshotai/kimi-k2.6` is rate-limited.
|
|
||||||
//!
|
|
||||||
//! Endpoint per `kimi.com/code/docs` and `moonshotai.github.io/kimi-cli`:
|
|
||||||
//! base_url: https://api.kimi.com/coding/v1
|
|
||||||
//! model id: kimi-for-coding
|
|
||||||
//! auth: Bearer sk-kimi-…
|
|
||||||
//! protocol: OpenAI Chat Completions compatible
|
|
||||||
//!
|
|
||||||
//! IMPORTANT: `api.kimi.com` is a separate account system from
|
|
||||||
//! `api.moonshot.ai` and `api.moonshot.cn`. Keys are NOT interchangeable.
|
|
||||||
//! This adapter is for `sk-kimi-*` keys provisioned via the Kimi
|
|
||||||
//! membership console only.
|
|
||||||
//!
|
|
||||||
//! Key sourcing priority:
|
|
||||||
//! 1. Env var `KIMI_API_KEY` (loaded from /etc/lakehouse/kimi.env via
|
|
||||||
//! systemd EnvironmentFile=)
|
|
||||||
//! 2. /etc/lakehouse/kimi.env directly (rescue path if env not loaded)
|
|
||||||
//!
|
|
||||||
//! First hit wins. Resolved once at gateway startup, stored on
|
|
||||||
//! `V1State.kimi_key`.
|
|
||||||
|
|
||||||
use std::time::Duration;
|
|
||||||
use serde::{Deserialize, Serialize};
|
|
||||||
|
|
||||||
use super::{ChatRequest, ChatResponse, Choice, Message, UsageBlock};
|
|
||||||
|
|
||||||
const KIMI_BASE_URL: &str = "https://api.kimi.com/coding/v1";
|
|
||||||
// Default 600s — kimi-for-coding is a reasoning model; on large
|
|
||||||
// code-audit prompts (~50KB+ input + 8K output) it routinely needs
|
|
||||||
// 3-8 min to think + emit. Override with KIMI_TIMEOUT_SECS env var.
|
|
||||||
const KIMI_TIMEOUT_SECS_DEFAULT: u64 = 600;
|
|
||||||
|
|
||||||
fn kimi_timeout_secs() -> u64 {
|
|
||||||
std::env::var("KIMI_TIMEOUT_SECS")
|
|
||||||
.ok()
|
|
||||||
.and_then(|s| s.trim().parse::<u64>().ok())
|
|
||||||
.filter(|&n| n > 0)
|
|
||||||
.unwrap_or(KIMI_TIMEOUT_SECS_DEFAULT)
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn resolve_kimi_key() -> Option<String> {
|
|
||||||
if let Ok(k) = std::env::var("KIMI_API_KEY") {
|
|
||||||
if !k.trim().is_empty() { return Some(k.trim().to_string()); }
|
|
||||||
}
|
|
||||||
if let Ok(raw) = std::fs::read_to_string("/etc/lakehouse/kimi.env") {
|
|
||||||
for line in raw.lines() {
|
|
||||||
if let Some(rest) = line.strip_prefix("KIMI_API_KEY=") {
|
|
||||||
let k = rest.trim().trim_matches('"').trim_matches('\'');
|
|
||||||
if !k.is_empty() { return Some(k.to_string()); }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
None
|
|
||||||
}
|
|
||||||
|
|
||||||
pub async fn chat(
|
|
||||||
key: &str,
|
|
||||||
req: &ChatRequest,
|
|
||||||
) -> Result<ChatResponse, String> {
|
|
||||||
// Strip the "kimi/" namespace prefix if the caller used it so the
|
|
||||||
// upstream API sees the bare model id (e.g. "kimi-for-coding").
|
|
||||||
let model = req.model.strip_prefix("kimi/").unwrap_or(&req.model).to_string();
|
|
||||||
|
|
||||||
// Flatten content to a plain String. api.kimi.com is text-only on
|
|
||||||
// the coding endpoint; the OpenAI multimodal array shape
|
|
||||||
// ([{type:"text",text:"..."},{type:"image_url",...}]) returns 400.
|
|
||||||
// Message::text() concats text-parts and drops non-text. Caught
|
|
||||||
// 2026-04-27 by Kimi's self-audit (kimi.rs:137 — content as raw
|
|
||||||
// serde_json::Value risked upstream rejection).
|
|
||||||
let body = KimiChatBody {
|
|
||||||
model: model.clone(),
|
|
||||||
messages: req.messages.iter().map(|m| KimiMessage {
|
|
||||||
role: m.role.clone(),
|
|
||||||
content: serde_json::Value::String(m.text()),
|
|
||||||
}).collect(),
|
|
||||||
max_tokens: req.max_tokens.unwrap_or(800),
|
|
||||||
temperature: req.temperature.unwrap_or(0.3),
|
|
||||||
stream: false,
|
|
||||||
};
|
|
||||||
|
|
||||||
let client = reqwest::Client::builder()
|
|
||||||
.timeout(Duration::from_secs(kimi_timeout_secs()))
|
|
||||||
.build()
|
|
||||||
.map_err(|e| format!("build client: {e}"))?;
|
|
||||||
|
|
||||||
let t0 = std::time::Instant::now();
|
|
||||||
let resp = client
|
|
||||||
.post(format!("{}/chat/completions", KIMI_BASE_URL))
|
|
||||||
.bearer_auth(key)
|
|
||||||
// api.kimi.com gates this endpoint by User-Agent — only sanctioned
|
|
||||||
// coding agents (Claude Code, Kimi CLI, Roo Code, Kilo Code) get
|
|
||||||
// through. Generic clients receive 403 access_terminated_error.
|
|
||||||
// J accepted the TOS risk on 2026-04-27; revisit if Moonshot
|
|
||||||
// tightens enforcement.
|
|
||||||
.header("User-Agent", "claude-code/1.0.0")
|
|
||||||
.json(&body)
|
|
||||||
.send()
|
|
||||||
.await
|
|
||||||
.map_err(|e| format!("api.kimi.com unreachable: {e}"))?;
|
|
||||||
|
|
||||||
let status = resp.status();
|
|
||||||
if !status.is_success() {
|
|
||||||
let body = resp.text().await.unwrap_or_else(|_| "?".into());
|
|
||||||
return Err(format!("api.kimi.com {}: {}", status, body));
|
|
||||||
}
|
|
||||||
|
|
||||||
let parsed: KimiChatResponse = resp.json().await
|
|
||||||
.map_err(|e| format!("invalid kimi response: {e}"))?;
|
|
||||||
|
|
||||||
let latency_ms = t0.elapsed().as_millis();
|
|
||||||
let choice = parsed.choices.into_iter().next()
|
|
||||||
.ok_or_else(|| "kimi returned no choices".to_string())?;
|
|
||||||
let text = choice.message.content;
|
|
||||||
|
|
||||||
let prompt_tokens = parsed.usage.as_ref().map(|u| u.prompt_tokens).unwrap_or_else(|| {
|
|
||||||
let chars: usize = req.messages.iter().map(|m| m.text().chars().count()).sum();
|
|
||||||
((chars + 3) / 4) as u32
|
|
||||||
});
|
|
||||||
let completion_tokens = parsed.usage.as_ref().map(|u| u.completion_tokens).unwrap_or_else(|| {
|
|
||||||
((text.chars().count() + 3) / 4) as u32
|
|
||||||
});
|
|
||||||
|
|
||||||
tracing::info!(
|
|
||||||
target: "v1.chat",
|
|
||||||
provider = "kimi",
|
|
||||||
model = %model,
|
|
||||||
prompt_tokens,
|
|
||||||
completion_tokens,
|
|
||||||
latency_ms = latency_ms as u64,
|
|
||||||
"kimi chat completed",
|
|
||||||
);
|
|
||||||
|
|
||||||
Ok(ChatResponse {
|
|
||||||
id: format!("chatcmpl-{}", chrono::Utc::now().timestamp_nanos_opt().unwrap_or(0)),
|
|
||||||
object: "chat.completion",
|
|
||||||
created: chrono::Utc::now().timestamp(),
|
|
||||||
model,
|
|
||||||
choices: vec![Choice {
|
|
||||||
index: 0,
|
|
||||||
message: Message { role: "assistant".into(), content: serde_json::Value::String(text) },
|
|
||||||
finish_reason: choice.finish_reason.unwrap_or_else(|| "stop".into()),
|
|
||||||
}],
|
|
||||||
usage: UsageBlock {
|
|
||||||
prompt_tokens,
|
|
||||||
completion_tokens,
|
|
||||||
total_tokens: prompt_tokens + completion_tokens,
|
|
||||||
},
|
|
||||||
})
|
|
||||||
}
|
|
||||||
|
|
||||||
// -- Kimi wire shapes (OpenAI-compatible) --
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct KimiChatBody {
|
|
||||||
model: String,
|
|
||||||
messages: Vec<KimiMessage>,
|
|
||||||
max_tokens: u32,
|
|
||||||
temperature: f64,
|
|
||||||
stream: bool,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct KimiMessage { role: String, content: serde_json::Value }
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct KimiChatResponse {
|
|
||||||
choices: Vec<KimiChoice>,
|
|
||||||
#[serde(default)]
|
|
||||||
usage: Option<KimiUsage>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct KimiChoice {
|
|
||||||
message: KimiMessageResp,
|
|
||||||
#[serde(default)]
|
|
||||||
finish_reason: Option<String>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct KimiMessageResp { content: String }
|
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
|
||||||
struct KimiUsage { prompt_tokens: u32, completion_tokens: u32 }
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use super::*;
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn resolve_kimi_key_does_not_panic() {
|
|
||||||
let _ = resolve_kimi_key();
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn chat_body_serializes_to_openai_shape() {
|
|
||||||
let body = KimiChatBody {
|
|
||||||
model: "kimi-for-coding".into(),
|
|
||||||
messages: vec![
|
|
||||||
KimiMessage { role: "user".into(), content: "review this".into() },
|
|
||||||
],
|
|
||||||
max_tokens: 800,
|
|
||||||
temperature: 0.3,
|
|
||||||
stream: false,
|
|
||||||
};
|
|
||||||
let json = serde_json::to_string(&body).unwrap();
|
|
||||||
assert!(json.contains("\"model\":\"kimi-for-coding\""));
|
|
||||||
assert!(json.contains("\"messages\""));
|
|
||||||
assert!(json.contains("\"max_tokens\":800"));
|
|
||||||
assert!(json.contains("\"stream\":false"));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn model_prefix_strip() {
|
|
||||||
let cases = [
|
|
||||||
("kimi/kimi-for-coding", "kimi-for-coding"),
|
|
||||||
("kimi-for-coding", "kimi-for-coding"),
|
|
||||||
("kimi/kimi-k2.6", "kimi-k2.6"),
|
|
||||||
];
|
|
||||||
for (input, expected) in cases {
|
|
||||||
let out = input.strip_prefix("kimi/").unwrap_or(input);
|
|
||||||
assert_eq!(out, expected, "{input} should become {expected}");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,318 +0,0 @@
|
|||||||
//! Phase 40 (early deliverable) — Langfuse tracing from the Rust gateway.
|
|
||||||
//!
|
|
||||||
//! Langfuse is already running at `http://localhost:3001` with the
|
|
||||||
//! staffing project — `mcp-server/tracing.ts` has been emitting traces
|
|
||||||
//! for months. This file bridges the gap: every `/v1/chat` call now
|
|
||||||
//! appears in the same Langfuse project, alongside traces from the
|
|
||||||
//! Bun side.
|
|
||||||
//!
|
|
||||||
//! Design:
|
|
||||||
//! - Fire-and-forget — emit spawns a tokio task. Response to client
|
|
||||||
//! never waits on Langfuse, never fails because of it. If Langfuse
|
|
||||||
//! is down or slow, we silently drop traces (and `tracing::warn!`).
|
|
||||||
//! - Two events per call — `trace-create` + `generation-create`. The
|
|
||||||
//! generation nests under the trace so Langfuse UI shows the whole
|
|
||||||
//! thing as one clickable row.
|
|
||||||
//! - No SDK — plain HTTP POST to `/api/public/ingestion` with Basic
|
|
||||||
//! auth. Keeps the Rust dependency graph small.
|
|
||||||
|
|
||||||
use serde::Serialize;
|
|
||||||
use std::sync::Arc;
|
|
||||||
use std::time::Duration;
|
|
||||||
|
|
||||||
use super::Message;
|
|
||||||
|
|
||||||
const INGESTION_PATH: &str = "/api/public/ingestion";
|
|
||||||
const EMIT_TIMEOUT_SECS: u64 = 5;
|
|
||||||
|
|
||||||
#[derive(Clone)]
|
|
||||||
pub struct LangfuseClient {
|
|
||||||
inner: Arc<Inner>,
|
|
||||||
}
|
|
||||||
|
|
||||||
struct Inner {
|
|
||||||
base_url: String,
|
|
||||||
public_key: String,
|
|
||||||
secret_key: String,
|
|
||||||
http: reqwest::Client,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl LangfuseClient {
|
|
||||||
pub fn new(base_url: String, public_key: String, secret_key: String) -> Self {
|
|
||||||
let http = reqwest::Client::builder()
|
|
||||||
.timeout(Duration::from_secs(EMIT_TIMEOUT_SECS))
|
|
||||||
.build()
|
|
||||||
.expect("langfuse client init");
|
|
||||||
Self { inner: Arc::new(Inner { base_url, public_key, secret_key, http }) }
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Resolve a LangfuseClient from the same conventions the TS side
|
|
||||||
/// already uses. Returns None if keys are missing — caller logs a
|
|
||||||
/// warning and omits tracing (non-fatal).
|
|
||||||
///
|
|
||||||
/// Sources checked in order:
|
|
||||||
/// 1. LANGFUSE_URL + LANGFUSE_PUBLIC_KEY + LANGFUSE_SECRET_KEY env
|
|
||||||
/// 2. /root/llm_team_config.json (if it carries langfuse keys)
|
|
||||||
/// 3. Hardcoded staffing-project defaults matching mcp-server
|
|
||||||
/// (pk-lf-staffing / sk-lf-staffing-secret / localhost:3001)
|
|
||||||
pub fn from_env_or_defaults() -> Option<Self> {
|
|
||||||
let base = std::env::var("LANGFUSE_URL")
|
|
||||||
.unwrap_or_else(|_| "http://localhost:3001".to_string());
|
|
||||||
let pk = std::env::var("LANGFUSE_PUBLIC_KEY")
|
|
||||||
.unwrap_or_else(|_| "pk-lf-staffing".to_string());
|
|
||||||
let sk = std::env::var("LANGFUSE_SECRET_KEY")
|
|
||||||
.unwrap_or_else(|_| "sk-lf-staffing-secret".to_string());
|
|
||||||
if pk.trim().is_empty() || sk.trim().is_empty() { return None; }
|
|
||||||
Some(Self::new(base, pk, sk))
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Fire-and-forget emit. Never blocks, never errors upward.
|
|
||||||
pub fn emit_chat(&self, ev: ChatTrace) {
|
|
||||||
let this = self.clone();
|
|
||||||
tokio::spawn(async move {
|
|
||||||
if let Err(e) = this.emit_chat_inner(ev).await {
|
|
||||||
tracing::warn!(target: "v1.langfuse", "trace drop: {e}");
|
|
||||||
}
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Fire-and-forget per-iteration span emit. Returns the generated
|
|
||||||
/// span id synchronously so the caller can stamp it on
|
|
||||||
/// `IterateAttempt.span_id` before the network round-trip resolves.
|
|
||||||
/// Mirrors Go's `validator.Tracer` callback shape.
|
|
||||||
pub fn emit_attempt_span(&self, sp: AttemptSpan) -> String {
|
|
||||||
let span_id = uuid_v7_like();
|
|
||||||
let span_id_for_caller = span_id.clone();
|
|
||||||
let this = self.clone();
|
|
||||||
tokio::spawn(async move {
|
|
||||||
if let Err(e) = this.emit_attempt_span_inner(span_id, sp).await {
|
|
||||||
tracing::warn!(target: "v1.langfuse", "iterate span drop: {e}");
|
|
||||||
}
|
|
||||||
});
|
|
||||||
span_id_for_caller
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn emit_attempt_span_inner(&self, span_id: String, sp: AttemptSpan) -> Result<(), String> {
|
|
||||||
let level = if sp.verdict == "accepted" { "DEFAULT" } else { "WARNING" };
|
|
||||||
let batch = IngestionBatch {
|
|
||||||
batch: vec![IngestionEvent {
|
|
||||||
id: uuid_v7_like(),
|
|
||||||
timestamp: sp.end_time.clone(),
|
|
||||||
kind: "span-create",
|
|
||||||
body: serde_json::json!({
|
|
||||||
"id": span_id,
|
|
||||||
"traceId": sp.trace_id,
|
|
||||||
"name": format!("iterate.attempt[{}]", sp.iteration),
|
|
||||||
"input": serde_json::json!({
|
|
||||||
"iteration": sp.iteration,
|
|
||||||
"model": sp.model,
|
|
||||||
"provider": sp.provider,
|
|
||||||
"prompt": truncate(&sp.prompt, 4000),
|
|
||||||
}),
|
|
||||||
"output": serde_json::json!({
|
|
||||||
"verdict": sp.verdict,
|
|
||||||
"error": sp.error,
|
|
||||||
"raw": truncate(&sp.raw, 4000),
|
|
||||||
}),
|
|
||||||
"level": level,
|
|
||||||
"startTime": sp.start_time,
|
|
||||||
"endTime": sp.end_time,
|
|
||||||
}),
|
|
||||||
}],
|
|
||||||
};
|
|
||||||
self.post_batch(batch).await
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn post_batch(&self, batch: IngestionBatch) -> Result<(), String> {
|
|
||||||
let url = format!("{}{}", self.inner.base_url.trim_end_matches('/'), INGESTION_PATH);
|
|
||||||
let resp = self.inner.http
|
|
||||||
.post(url)
|
|
||||||
.basic_auth(&self.inner.public_key, Some(&self.inner.secret_key))
|
|
||||||
.json(&batch)
|
|
||||||
.send()
|
|
||||||
.await
|
|
||||||
.map_err(|e| format!("POST failed: {e}"))?;
|
|
||||||
if !resp.status().is_success() {
|
|
||||||
return Err(format!("{}: {}", resp.status(), resp.text().await.unwrap_or_default()));
|
|
||||||
}
|
|
||||||
Ok(())
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn emit_chat_inner(&self, ev: ChatTrace) -> Result<(), String> {
|
|
||||||
// When the caller forwarded a parent trace id (via the
|
|
||||||
// X-Lakehouse-Trace-Id header → V1State plumbing), attach the
|
|
||||||
// generation as a child of that trace. Without a parent we
|
|
||||||
// mint a new top-level trace per call (Phase 40 default).
|
|
||||||
let trace_id = ev.parent_trace_id.clone().unwrap_or_else(uuid_v7_like);
|
|
||||||
let nested = ev.parent_trace_id.is_some();
|
|
||||||
let gen_id = uuid_v7_like();
|
|
||||||
let trace_ts = ev.start_time.clone();
|
|
||||||
|
|
||||||
let mut events = Vec::with_capacity(2);
|
|
||||||
if !nested {
|
|
||||||
// Only mint a fresh trace-create when we don't have a parent.
|
|
||||||
// Reusing a parent trace id without re-creating it is the
|
|
||||||
// contract that lets validatord's iterate-session show up
|
|
||||||
// as one tree in Langfuse.
|
|
||||||
events.push(IngestionEvent {
|
|
||||||
id: uuid_v7_like(),
|
|
||||||
timestamp: trace_ts.clone(),
|
|
||||||
kind: "trace-create",
|
|
||||||
body: serde_json::json!({
|
|
||||||
"id": trace_id,
|
|
||||||
"name": format!("v1.chat:{}", ev.provider),
|
|
||||||
"input": serde_json::json!({
|
|
||||||
"model": ev.model,
|
|
||||||
"messages": ev.input,
|
|
||||||
}),
|
|
||||||
"metadata": serde_json::json!({
|
|
||||||
"provider": ev.provider,
|
|
||||||
"think": ev.think,
|
|
||||||
}),
|
|
||||||
}),
|
|
||||||
});
|
|
||||||
}
|
|
||||||
events.push(IngestionEvent {
|
|
||||||
id: uuid_v7_like(),
|
|
||||||
timestamp: ev.end_time.clone(),
|
|
||||||
kind: "generation-create",
|
|
||||||
body: serde_json::json!({
|
|
||||||
"id": gen_id,
|
|
||||||
"traceId": trace_id,
|
|
||||||
"name": "chat",
|
|
||||||
"model": ev.model,
|
|
||||||
"modelParameters": serde_json::json!({
|
|
||||||
"temperature": ev.temperature,
|
|
||||||
"max_tokens": ev.max_tokens,
|
|
||||||
"think": ev.think,
|
|
||||||
}),
|
|
||||||
"input": ev.input,
|
|
||||||
"output": ev.output,
|
|
||||||
"usage": serde_json::json!({
|
|
||||||
"input": ev.prompt_tokens,
|
|
||||||
"output": ev.completion_tokens,
|
|
||||||
"total": ev.prompt_tokens + ev.completion_tokens,
|
|
||||||
"unit": "TOKENS",
|
|
||||||
}),
|
|
||||||
"startTime": ev.start_time,
|
|
||||||
"endTime": ev.end_time,
|
|
||||||
"metadata": serde_json::json!({
|
|
||||||
"provider": ev.provider,
|
|
||||||
"latency_ms": ev.latency_ms,
|
|
||||||
}),
|
|
||||||
}),
|
|
||||||
});
|
|
||||||
|
|
||||||
self.post_batch(IngestionBatch { batch: events }).await
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Truncate a string to at most `n` chars (NOT bytes). Matches the Go
|
|
||||||
/// `trim` helper used in session log + attempt-span emission so an
|
|
||||||
/// operator reading two cross-runtime traces sees the same boundary.
|
|
||||||
fn truncate(s: &str, n: usize) -> String {
|
|
||||||
s.chars().take(n).collect()
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Everything the v1.chat handler collects for one completed call.
|
|
||||||
pub struct ChatTrace {
|
|
||||||
pub provider: String,
|
|
||||||
pub model: String,
|
|
||||||
pub input: Vec<Message>,
|
|
||||||
pub output: String,
|
|
||||||
pub prompt_tokens: u32,
|
|
||||||
pub completion_tokens: u32,
|
|
||||||
pub temperature: Option<f64>,
|
|
||||||
pub max_tokens: Option<u32>,
|
|
||||||
pub think: Option<bool>,
|
|
||||||
pub start_time: String,
|
|
||||||
pub end_time: String,
|
|
||||||
pub latency_ms: u64,
|
|
||||||
/// When set, attach this chat trace as a child of the named
|
|
||||||
/// Langfuse trace instead of starting a new top-level trace. Used
|
|
||||||
/// by `/v1/iterate` to nest its inner /v1/chat hops under the
|
|
||||||
/// iterate-session trace so a multi-call session shows in
|
|
||||||
/// Langfuse as ONE trace tree, not N+1 disconnected traces.
|
|
||||||
/// Matches the Go-side `X-Lakehouse-Trace-Id` propagation
|
|
||||||
/// (commit d6d2fdf in golangLAKEHOUSE).
|
|
||||||
pub parent_trace_id: Option<String>,
|
|
||||||
}
|
|
||||||
|
|
||||||
/// One iteration attempt inside `/v1/iterate`'s loop. Becomes one
|
|
||||||
/// span on the parent trace when emitted via `emit_attempt_span`.
|
|
||||||
/// Matches Go's `validator.AttemptSpan` shape so the cross-runtime
|
|
||||||
/// observability surface is consistent.
|
|
||||||
pub struct AttemptSpan {
|
|
||||||
pub trace_id: String,
|
|
||||||
pub iteration: u32,
|
|
||||||
pub model: String,
|
|
||||||
pub provider: String,
|
|
||||||
pub prompt: String,
|
|
||||||
pub raw: String,
|
|
||||||
/// Verdict kind: "no_json" | "validation_failed" | "accepted"
|
|
||||||
pub verdict: String,
|
|
||||||
pub error: Option<String>,
|
|
||||||
pub start_time: String,
|
|
||||||
pub end_time: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct IngestionBatch {
|
|
||||||
batch: Vec<IngestionEvent>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
struct IngestionEvent {
|
|
||||||
id: String,
|
|
||||||
timestamp: String,
|
|
||||||
#[serde(rename = "type")]
|
|
||||||
kind: &'static str,
|
|
||||||
body: serde_json::Value,
|
|
||||||
}
|
|
||||||
|
|
||||||
/// UUIDv7-ish identifier — not strictly UUIDv7 but time-ordered and
|
|
||||||
/// unique enough for event deduplication. Avoids a uuid crate dep.
|
|
||||||
fn uuid_v7_like() -> String {
|
|
||||||
let ts = chrono::Utc::now().timestamp_nanos_opt().unwrap_or(0);
|
|
||||||
let rand = std::time::SystemTime::now()
|
|
||||||
.duration_since(std::time::UNIX_EPOCH)
|
|
||||||
.map(|d| d.subsec_nanos())
|
|
||||||
.unwrap_or(0);
|
|
||||||
format!("{:016x}-{:08x}", ts, rand)
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use super::*;
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn from_env_or_defaults_returns_some_when_defaults_present() {
|
|
||||||
// Defaults are hardcoded non-empty — should always produce Some.
|
|
||||||
let c = LangfuseClient::from_env_or_defaults();
|
|
||||||
assert!(c.is_some());
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn uuid_v7_like_produces_distinct_ids() {
|
|
||||||
let a = uuid_v7_like();
|
|
||||||
// Different nanosecond timestamps — but they might collide on
|
|
||||||
// back-to-back calls. Loop a bit to ensure uniqueness surface.
|
|
||||||
let b = uuid_v7_like();
|
|
||||||
let c = uuid_v7_like();
|
|
||||||
assert!(a != b || b != c, "three consecutive ids should have at least one distinct pair");
|
|
||||||
assert!(a.contains('-'));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn ingestion_batch_serializes_with_rename() {
|
|
||||||
let ev = IngestionEvent {
|
|
||||||
id: "e1".into(),
|
|
||||||
timestamp: "2026-04-22T00:00:00Z".into(),
|
|
||||||
kind: "trace-create",
|
|
||||||
body: serde_json::json!({"name": "t"}),
|
|
||||||
};
|
|
||||||
let json = serde_json::to_string(&IngestionBatch { batch: vec![ev] }).unwrap();
|
|
||||||
assert!(json.contains("\"type\":\"trace-create\""));
|
|
||||||
assert!(json.contains("\"batch\":["));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,684 +0,0 @@
|
|||||||
//! Phase 38 — Universal API skeleton (`/v1/*`).
|
|
||||||
//!
|
|
||||||
//! OpenAI-compatible shape on top of the existing aibridge → Ollama
|
|
||||||
//! path. This is the thin slice: single provider, stateless, no
|
|
||||||
//! streaming. Phase 39 replaces the direct Ollama call with a
|
|
||||||
//! `ProviderAdapter` trait dispatch; Phase 40 adds routing + fallback.
|
|
||||||
//!
|
|
||||||
//! The shape matches OpenAI's `/v1/chat/completions` closely enough
|
|
||||||
//! that clients using openai-compatible SDKs can point at us with the
|
|
||||||
//! URL swap alone. We keep the endpoint path `/v1/chat` (not
|
|
||||||
//! `/v1/chat/completions`) because our PRD declares the terser form;
|
|
||||||
//! adding the alias is one line in Phase 39 when it matters.
|
|
||||||
|
|
||||||
pub mod ollama;
|
|
||||||
pub mod ollama_cloud;
|
|
||||||
pub mod openrouter;
|
|
||||||
pub mod gemini;
|
|
||||||
pub mod claude;
|
|
||||||
pub mod kimi;
|
|
||||||
pub mod opencode;
|
|
||||||
pub mod validate;
|
|
||||||
pub mod iterate;
|
|
||||||
pub mod langfuse_trace;
|
|
||||||
pub mod session_log;
|
|
||||||
pub mod mode;
|
|
||||||
pub mod respond;
|
|
||||||
pub mod truth;
|
|
||||||
|
|
||||||
use axum::{
|
|
||||||
Router,
|
|
||||||
extract::State,
|
|
||||||
http::StatusCode,
|
|
||||||
response::IntoResponse,
|
|
||||||
routing::{get, post},
|
|
||||||
Json,
|
|
||||||
};
|
|
||||||
use serde::{Deserialize, Serialize};
|
|
||||||
use std::sync::Arc;
|
|
||||||
use tokio::sync::RwLock;
|
|
||||||
|
|
||||||
#[derive(Clone)]
|
|
||||||
pub struct V1State {
|
|
||||||
pub ai_client: aibridge::client::AiClient,
|
|
||||||
pub usage: Arc<RwLock<Usage>>,
|
|
||||||
/// Ollama Cloud bearer token. Loaded at startup via
|
|
||||||
/// `ollama_cloud::resolve_cloud_key()`. None = cloud routes 503.
|
|
||||||
pub ollama_cloud_key: Option<String>,
|
|
||||||
/// OpenRouter bearer token — free-tier rescue rung. Loaded at
|
|
||||||
/// startup via `openrouter::resolve_openrouter_key()`. None means
|
|
||||||
/// provider="openrouter" calls 503 rather than attempt. Same key
|
|
||||||
/// sourcing as LLM Team UI so the two share one API quota.
|
|
||||||
pub openrouter_key: Option<String>,
|
|
||||||
/// Gemini API key (Google Generative Language). Loaded at startup
|
|
||||||
/// via `gemini::resolve_gemini_key()`. None = provider="gemini"
|
|
||||||
/// calls 503. Phase 40 deliverable.
|
|
||||||
pub gemini_key: Option<String>,
|
|
||||||
/// Anthropic Claude API key. Loaded at startup via
|
|
||||||
/// `claude::resolve_claude_key()`. None = provider="claude" calls
|
|
||||||
/// 503. Phase 40 deliverable.
|
|
||||||
pub claude_key: Option<String>,
|
|
||||||
/// Kimi For Coding (api.kimi.com) bearer token — direct provider
|
|
||||||
/// for `kimi-for-coding`. Used when Ollama Cloud's `kimi-k2:1t` is
|
|
||||||
/// upstream-broken. Loaded at startup via `kimi::resolve_kimi_key()`
|
|
||||||
/// from `KIMI_API_KEY` env or `/etc/lakehouse/kimi.env`. None =
|
|
||||||
/// provider="kimi" calls 503.
|
|
||||||
pub kimi_key: Option<String>,
|
|
||||||
/// OpenCode GO (opencode.ai) bearer token — multi-vendor curated
|
|
||||||
/// gateway. One sk-* key reaches Claude Opus 4.7, GPT-5.5-pro,
|
|
||||||
/// Gemini 3.1-pro, Kimi K2.6, DeepSeek, GLM, Qwen + free-tier.
|
|
||||||
/// Loaded at startup via `opencode::resolve_opencode_key()` from
|
|
||||||
/// `OPENCODE_API_KEY` env or `/etc/lakehouse/opencode.env`. None =
|
|
||||||
/// provider="opencode" calls 503.
|
|
||||||
pub opencode_key: Option<String>,
|
|
||||||
/// Shared WorkerLookup loaded once at startup from
|
|
||||||
/// workers_500k.parquet (path: LH_WORKERS_PARQUET env, default
|
|
||||||
/// data/datasets/workers_500k.parquet). Used by /v1/validate to
|
|
||||||
/// run FillValidator/EmailValidator with worker-existence checks.
|
|
||||||
/// Falls back to an empty InMemoryWorkerLookup if the file is
|
|
||||||
/// missing — validators still run schema/PII checks but every
|
|
||||||
/// worker-existence check fails (Consistency error), which is
|
|
||||||
/// the correct behavior when the roster isn't configured.
|
|
||||||
pub validate_workers: std::sync::Arc<dyn validator::WorkerLookup>,
|
|
||||||
/// Phase 40 early deliverable — Langfuse client. None = tracing
|
|
||||||
/// disabled (keys missing or container unreachable). Traces are
|
|
||||||
/// fire-and-forget: never block the response path.
|
|
||||||
pub langfuse: Option<langfuse_trace::LangfuseClient>,
|
|
||||||
/// Coordinator session JSONL writer (path from
|
|
||||||
/// `[gateway].session_log_path`). One row per `/v1/iterate`
|
|
||||||
/// session for offline DuckDB analysis. None = disabled.
|
|
||||||
/// Cross-runtime parity with the Go-side `validatord`
|
|
||||||
/// `[validatord].session_log_path` (commit 1a3a82a in
|
|
||||||
/// golangLAKEHOUSE).
|
|
||||||
pub session_log: Option<session_log::SessionLogger>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Default, Clone, Serialize)]
|
|
||||||
pub struct Usage {
|
|
||||||
pub requests: u64,
|
|
||||||
pub prompt_tokens: u64,
|
|
||||||
pub completion_tokens: u64,
|
|
||||||
pub total_tokens: u64,
|
|
||||||
#[serde(default)]
|
|
||||||
pub by_provider: std::collections::HashMap<String, ProviderUsage>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Default, Clone, Serialize)]
|
|
||||||
pub struct ProviderUsage {
|
|
||||||
pub requests: u64,
|
|
||||||
pub prompt_tokens: u64,
|
|
||||||
pub completion_tokens: u64,
|
|
||||||
pub total_tokens: u64,
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn router(state: V1State) -> Router {
|
|
||||||
Router::new()
|
|
||||||
.route("/chat", post(chat))
|
|
||||||
// Canonical OpenAI path alias — lets any client built on the
|
|
||||||
// openai SDK (pi-ai, langchain-js, etc.) treat the gateway as
|
|
||||||
// a drop-in middleware via OPENAI_BASE_URL=http://gw/v1 alone.
|
|
||||||
// Same handler as /chat; same OpenAI-compatible request shape.
|
|
||||||
.route("/chat/completions", post(chat))
|
|
||||||
.route("/respond", post(respond::respond))
|
|
||||||
.route("/usage", get(usage))
|
|
||||||
.route("/sessions", get(sessions))
|
|
||||||
.route("/context", get(truth::context))
|
|
||||||
.route("/mode", post(mode::route))
|
|
||||||
.route("/mode/list", get(mode::list))
|
|
||||||
.route("/mode/execute", post(mode::execute))
|
|
||||||
.route("/validate", post(validate::validate))
|
|
||||||
.route("/iterate", post(iterate::iterate))
|
|
||||||
.route("/health", get(health))
|
|
||||||
.with_state(state)
|
|
||||||
}
|
|
||||||
|
|
||||||
// -- Shared types (OpenAI-compatible) --
|
|
||||||
|
|
||||||
/// OpenAI-compatible message. `content` accepts either a plain string or
|
|
||||||
/// an array of content parts (the modern multimodal shape:
|
|
||||||
/// `[{type:"text", text:"..."}, {type:"image_url", ...}]`). We store as
|
|
||||||
/// `serde_json::Value` to preserve client shape on forward; downstream
|
|
||||||
/// providers can take it verbatim. `Message::text()` flattens for
|
|
||||||
/// places that need a plain string (Ollama prompt assembly, char
|
|
||||||
/// counts, the assistant's own response synthesis).
|
|
||||||
#[derive(Serialize, Deserialize, Clone, Debug)]
|
|
||||||
pub struct Message {
|
|
||||||
pub role: String,
|
|
||||||
pub content: serde_json::Value,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl Message {
|
|
||||||
/// Construct a plain text message — the common shape for callers
|
|
||||||
/// that don't need multimodal content. Wraps the body in
|
|
||||||
/// `serde_json::Value::String` so downstream serializers see the
|
|
||||||
/// canonical OpenAI shape.
|
|
||||||
pub fn new_text(role: impl Into<String>, body: impl Into<String>) -> Self {
|
|
||||||
Self {
|
|
||||||
role: role.into(),
|
|
||||||
content: serde_json::Value::String(body.into()),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
/// Flatten content to a plain string. Strings pass through; content-
|
|
||||||
/// part arrays concatenate the `text` fields with newlines and skip
|
|
||||||
/// non-text parts (images etc.) — Phase 38/39 callers are text-only,
|
|
||||||
/// real multimodal forwarding is queued.
|
|
||||||
pub fn text(&self) -> String {
|
|
||||||
match &self.content {
|
|
||||||
serde_json::Value::String(s) => s.clone(),
|
|
||||||
serde_json::Value::Array(parts) => {
|
|
||||||
let mut out = String::new();
|
|
||||||
for p in parts {
|
|
||||||
if let Some(t) = p.get("text").and_then(|v| v.as_str()) {
|
|
||||||
if !out.is_empty() { out.push('\n'); }
|
|
||||||
out.push_str(t);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
out
|
|
||||||
}
|
|
||||||
other => other.to_string(),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Deserialize, Debug, Clone)]
|
|
||||||
pub struct ChatRequest {
|
|
||||||
pub model: String,
|
|
||||||
pub messages: Vec<Message>,
|
|
||||||
#[serde(default)]
|
|
||||||
pub temperature: Option<f64>,
|
|
||||||
#[serde(default)]
|
|
||||||
pub max_tokens: Option<u32>,
|
|
||||||
/// Accepted for shape-compat but ignored in the thin slice —
|
|
||||||
/// Phase 38 returns non-streaming even when the client asked for it.
|
|
||||||
/// Phase 39+ wires real streaming.
|
|
||||||
#[serde(default)]
|
|
||||||
pub stream: Option<bool>,
|
|
||||||
/// Non-OpenAI extension. Passes through to the provider's thinking
|
|
||||||
/// toggle. Default: **false** — hot-path discipline for thinking
|
|
||||||
/// models (qwen3.5, qwen3, gpt-oss) that otherwise burn the token
|
|
||||||
/// budget on hidden reasoning before visible output starts,
|
|
||||||
/// producing empty responses. Set true explicitly when calling an
|
|
||||||
/// overseer / reasoning-heavy path.
|
|
||||||
#[serde(default)]
|
|
||||||
pub think: Option<bool>,
|
|
||||||
/// Non-OpenAI extension. Selects the provider adapter. Accepted:
|
|
||||||
/// - None / "ollama" / "local" → local Ollama via sidecar (default)
|
|
||||||
/// - "ollama_cloud" / "cloud" → Ollama Cloud direct HTTPS
|
|
||||||
/// Phase 40 adds a routing engine that picks this automatically
|
|
||||||
/// from the model name; Phase 38/39 requires explicit selection.
|
|
||||||
#[serde(default)]
|
|
||||||
pub provider: Option<String>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
pub struct ChatResponse {
|
|
||||||
pub id: String,
|
|
||||||
pub object: &'static str,
|
|
||||||
pub created: i64,
|
|
||||||
pub model: String,
|
|
||||||
pub choices: Vec<Choice>,
|
|
||||||
pub usage: UsageBlock,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize)]
|
|
||||||
pub struct Choice {
|
|
||||||
pub index: u32,
|
|
||||||
pub message: Message,
|
|
||||||
pub finish_reason: String,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Serialize, Deserialize, Clone)]
|
|
||||||
pub struct UsageBlock {
|
|
||||||
pub prompt_tokens: u32,
|
|
||||||
pub completion_tokens: u32,
|
|
||||||
pub total_tokens: u32,
|
|
||||||
}
|
|
||||||
|
|
||||||
// -- Handlers --
|
|
||||||
|
|
||||||
/// Phase 39: resolve (provider, effective_model) from a ChatRequest.
|
|
||||||
///
|
|
||||||
/// Explicit `req.provider` wins. If absent, infer from a model-name
|
|
||||||
/// prefix: "openrouter/..." → openrouter (strip prefix), "cloud/..." →
|
|
||||||
/// ollama_cloud (strip prefix). Bare names default to "ollama".
|
|
||||||
///
|
|
||||||
/// The stripped model is what the upstream adapter expects:
|
|
||||||
/// OpenRouter's API wants "openai/gpt-4o-mini", not
|
|
||||||
/// "openrouter/openai/gpt-4o-mini".
|
|
||||||
fn resolve_provider(req: &ChatRequest) -> (String, String) {
|
|
||||||
if let Some(p) = req.provider.as_deref() {
|
|
||||||
return (p.to_ascii_lowercase(), req.model.clone());
|
|
||||||
}
|
|
||||||
if let Some(rest) = req.model.strip_prefix("openrouter/") {
|
|
||||||
return ("openrouter".to_string(), rest.to_string());
|
|
||||||
}
|
|
||||||
if let Some(rest) = req.model.strip_prefix("cloud/") {
|
|
||||||
return ("ollama_cloud".to_string(), rest.to_string());
|
|
||||||
}
|
|
||||||
if let Some(rest) = req.model.strip_prefix("gemini/") {
|
|
||||||
return ("gemini".to_string(), rest.to_string());
|
|
||||||
}
|
|
||||||
if let Some(rest) = req.model.strip_prefix("claude/") {
|
|
||||||
return ("claude".to_string(), rest.to_string());
|
|
||||||
}
|
|
||||||
if let Some(rest) = req.model.strip_prefix("kimi/") {
|
|
||||||
return ("kimi".to_string(), rest.to_string());
|
|
||||||
}
|
|
||||||
if let Some(rest) = req.model.strip_prefix("opencode/") {
|
|
||||||
return ("opencode".to_string(), rest.to_string());
|
|
||||||
}
|
|
||||||
// Bare `vendor/model` shape (e.g. `x-ai/grok-4.1-fast`,
|
|
||||||
// `moonshotai/kimi-k2`, `openai/gpt-oss-120b:free`) → OpenRouter.
|
|
||||||
// This makes the gateway a drop-in OpenAI-compatible middleware:
|
|
||||||
// clients using the official `openai` SDK only set OPENAI_BASE_URL
|
|
||||||
// + a model name and get correct upstream routing without needing
|
|
||||||
// our custom `provider` field. Ollama models in J's stack use
|
|
||||||
// `model:tag` form with NO slash (`qwen3.5:latest`, `kimi-k2:1t`),
|
|
||||||
// so a slash here unambiguously means "namespaced provider/model".
|
|
||||||
if req.model.contains('/') {
|
|
||||||
return ("openrouter".to_string(), req.model.clone());
|
|
||||||
}
|
|
||||||
// Vendor-bare model names (no slash, no colon) — `gpt-4o-mini`,
|
|
||||||
// `claude-3-5-sonnet-20241022`, etc. Tools like pi-ai validate
|
|
||||||
// models against an OpenAI-style catalog (no namespace prefix),
|
|
||||||
// so they send the bare name. Map to OpenRouter's namespaced form
|
|
||||||
// by inferring the vendor from the leading token. Falls through to
|
|
||||||
// ollama if no pattern matches — preserves existing behavior.
|
|
||||||
if !req.model.contains(':') && !req.model.contains('/') {
|
|
||||||
let m = req.model.as_str();
|
|
||||||
if m.starts_with("gpt-") || m.starts_with("o1-") || m.starts_with("o3-") || m.starts_with("o4-") || m == "o1" || m == "o3" || m == "o4-mini" {
|
|
||||||
return ("openrouter".to_string(), format!("openai/{}", m));
|
|
||||||
}
|
|
||||||
if m.starts_with("claude-") {
|
|
||||||
return ("openrouter".to_string(), format!("anthropic/{}", m));
|
|
||||||
}
|
|
||||||
if m.starts_with("grok-") {
|
|
||||||
return ("openrouter".to_string(), format!("x-ai/{}", m));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
("ollama".to_string(), req.model.clone())
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod resolve_provider_tests {
|
|
||||||
use super::*;
|
|
||||||
|
|
||||||
fn mk_req(provider: Option<&str>, model: &str) -> ChatRequest {
|
|
||||||
ChatRequest {
|
|
||||||
model: model.to_string(),
|
|
||||||
messages: vec![],
|
|
||||||
temperature: None,
|
|
||||||
max_tokens: None,
|
|
||||||
stream: None,
|
|
||||||
think: None,
|
|
||||||
provider: provider.map(|s| s.to_string()),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn explicit_provider_wins() {
|
|
||||||
let r = mk_req(Some("openrouter"), "qwen3.5:latest");
|
|
||||||
assert_eq!(resolve_provider(&r), ("openrouter".into(), "qwen3.5:latest".into()));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn bare_model_defaults_to_ollama() {
|
|
||||||
let r = mk_req(None, "qwen3.5:latest");
|
|
||||||
assert_eq!(resolve_provider(&r), ("ollama".into(), "qwen3.5:latest".into()));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn openrouter_prefix_infers_and_strips() {
|
|
||||||
let r = mk_req(None, "openrouter/openai/gpt-4o-mini");
|
|
||||||
assert_eq!(resolve_provider(&r), ("openrouter".into(), "openai/gpt-4o-mini".into()));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn cloud_prefix_infers_and_strips() {
|
|
||||||
let r = mk_req(None, "cloud/kimi-k2:1t");
|
|
||||||
assert_eq!(resolve_provider(&r), ("ollama_cloud".into(), "kimi-k2:1t".into()));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn explicit_provider_preserves_full_model_even_with_prefix() {
|
|
||||||
// If caller provides both provider and a model with a prefix,
|
|
||||||
// trust them — don't strip. The adapter will get the full model
|
|
||||||
// string as-is.
|
|
||||||
let r = mk_req(Some("openrouter"), "openrouter/openai/gpt-4o-mini");
|
|
||||||
assert_eq!(resolve_provider(&r), ("openrouter".into(), "openrouter/openai/gpt-4o-mini".into()));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn gemini_prefix_infers_and_strips() {
|
|
||||||
let r = mk_req(None, "gemini/gemini-2.0-flash");
|
|
||||||
assert_eq!(resolve_provider(&r), ("gemini".into(), "gemini-2.0-flash".into()));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn claude_prefix_infers_and_strips() {
|
|
||||||
let r = mk_req(None, "claude/claude-3-5-sonnet-latest");
|
|
||||||
assert_eq!(resolve_provider(&r), ("claude".into(), "claude-3-5-sonnet-latest".into()));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn kimi_prefix_infers_and_strips() {
|
|
||||||
let r = mk_req(None, "kimi/kimi-for-coding");
|
|
||||||
assert_eq!(resolve_provider(&r), ("kimi".into(), "kimi-for-coding".into()));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn chat(
|
|
||||||
State(state): State<V1State>,
|
|
||||||
headers: axum::http::HeaderMap,
|
|
||||||
Json(req): Json<ChatRequest>,
|
|
||||||
) -> Result<Json<ChatResponse>, (StatusCode, String)> {
|
|
||||||
if req.messages.is_empty() {
|
|
||||||
return Err((StatusCode::BAD_REQUEST, "messages must be non-empty".into()));
|
|
||||||
}
|
|
||||||
if req.stream.unwrap_or(false) {
|
|
||||||
tracing::warn!("/v1/chat: stream=true requested but Phase 38 returns non-streaming");
|
|
||||||
}
|
|
||||||
|
|
||||||
// Provider resolution: explicit `req.provider` wins; otherwise
|
|
||||||
// infer from a model-name prefix. Phase 39 PRD gate example:
|
|
||||||
// `model: "openrouter/openai/gpt-4o-mini"` → provider "openrouter",
|
|
||||||
// adapter gets the stripped "openai/gpt-4o-mini".
|
|
||||||
let (provider, effective_model) = resolve_provider(&req);
|
|
||||||
let start_time = chrono::Utc::now();
|
|
||||||
let start_instant = std::time::Instant::now();
|
|
||||||
|
|
||||||
// If we stripped a prefix, clone req with the effective model so
|
|
||||||
// the adapter sees what the upstream provider expects (OpenRouter
|
|
||||||
// wants "openai/gpt-4o-mini", not "openrouter/openai/gpt-4o-mini").
|
|
||||||
let req_for_adapter: std::borrow::Cow<'_, ChatRequest> =
|
|
||||||
if effective_model == req.model {
|
|
||||||
std::borrow::Cow::Borrowed(&req)
|
|
||||||
} else {
|
|
||||||
let mut cloned = req.clone();
|
|
||||||
cloned.model = effective_model.clone();
|
|
||||||
std::borrow::Cow::Owned(cloned)
|
|
||||||
};
|
|
||||||
|
|
||||||
let (resp, used_provider) = match provider.as_str() {
|
|
||||||
"ollama" | "local" | "" => {
|
|
||||||
let r = ollama::chat(&state.ai_client, &*req_for_adapter)
|
|
||||||
.await
|
|
||||||
.map_err(|e| (StatusCode::BAD_GATEWAY, format!("ollama local: {e}")))?;
|
|
||||||
(r, "ollama".to_string())
|
|
||||||
}
|
|
||||||
"ollama_cloud" | "cloud" => {
|
|
||||||
let key = state.ollama_cloud_key.as_deref().ok_or((
|
|
||||||
StatusCode::SERVICE_UNAVAILABLE,
|
|
||||||
"OLLAMA_CLOUD_KEY not configured".to_string(),
|
|
||||||
))?;
|
|
||||||
let r = ollama_cloud::chat(key, &*req_for_adapter)
|
|
||||||
.await
|
|
||||||
.map_err(|e| (StatusCode::BAD_GATEWAY, format!("ollama cloud: {e}")))?;
|
|
||||||
(r, "ollama_cloud".to_string())
|
|
||||||
}
|
|
||||||
"openrouter" | "openrouter_free" => {
|
|
||||||
// Free-tier rescue rung. Added 2026-04-24 after iter 5
|
|
||||||
// repeated Ollama Cloud 502s on kimi-k2:1t — OpenRouter
|
|
||||||
// gives a different provider backbone as fallback.
|
|
||||||
let key = state.openrouter_key.as_deref().ok_or((
|
|
||||||
StatusCode::SERVICE_UNAVAILABLE,
|
|
||||||
"OPENROUTER_API_KEY not configured".to_string(),
|
|
||||||
))?;
|
|
||||||
let r = openrouter::chat(key, &*req_for_adapter)
|
|
||||||
.await
|
|
||||||
.map_err(|e| (StatusCode::BAD_GATEWAY, format!("openrouter: {e}")))?;
|
|
||||||
(r, "openrouter".to_string())
|
|
||||||
}
|
|
||||||
"gemini" => {
|
|
||||||
// Phase 40 provider adapter. Google Generative Language
|
|
||||||
// API via query-string key auth (not bearer).
|
|
||||||
let key = state.gemini_key.as_deref().ok_or((
|
|
||||||
StatusCode::SERVICE_UNAVAILABLE,
|
|
||||||
"GEMINI_API_KEY not configured".to_string(),
|
|
||||||
))?;
|
|
||||||
let r = gemini::chat(key, &*req_for_adapter)
|
|
||||||
.await
|
|
||||||
.map_err(|e| (StatusCode::BAD_GATEWAY, format!("gemini: {e}")))?;
|
|
||||||
(r, "gemini".to_string())
|
|
||||||
}
|
|
||||||
"claude" | "anthropic" => {
|
|
||||||
// Phase 40 provider adapter. Anthropic Messages API via
|
|
||||||
// x-api-key header + anthropic-version:2023-06-01.
|
|
||||||
let key = state.claude_key.as_deref().ok_or((
|
|
||||||
StatusCode::SERVICE_UNAVAILABLE,
|
|
||||||
"ANTHROPIC_API_KEY not configured".to_string(),
|
|
||||||
))?;
|
|
||||||
let r = claude::chat(key, &*req_for_adapter)
|
|
||||||
.await
|
|
||||||
.map_err(|e| (StatusCode::BAD_GATEWAY, format!("claude: {e}")))?;
|
|
||||||
(r, "claude".to_string())
|
|
||||||
}
|
|
||||||
"kimi" => {
|
|
||||||
// Direct Kimi For Coding provider — bypasses Ollama Cloud's
|
|
||||||
// upstream-broken kimi-k2:1t and OpenRouter's rate-limited
|
|
||||||
// moonshotai/kimi-k2.6. Uses sk-kimi-* keys from the Kimi
|
|
||||||
// membership console.
|
|
||||||
let key = state.kimi_key.as_deref().ok_or((
|
|
||||||
StatusCode::SERVICE_UNAVAILABLE,
|
|
||||||
"KIMI_API_KEY not configured".to_string(),
|
|
||||||
))?;
|
|
||||||
let r = kimi::chat(key, &*req_for_adapter)
|
|
||||||
.await
|
|
||||||
.map_err(|e| (StatusCode::BAD_GATEWAY, format!("kimi: {e}")))?;
|
|
||||||
(r, "kimi".to_string())
|
|
||||||
}
|
|
||||||
"opencode" => {
|
|
||||||
// OpenCode GO multi-vendor gateway — Claude Opus 4.7,
|
|
||||||
// GPT-5.5-pro, Gemini 3.1-pro, Kimi K2.6, DeepSeek, GLM,
|
|
||||||
// Qwen, free-tier. OpenAI-compat at opencode.ai/zen/go/v1.
|
|
||||||
let key = state.opencode_key.as_deref().ok_or((
|
|
||||||
StatusCode::SERVICE_UNAVAILABLE,
|
|
||||||
"OPENCODE_API_KEY not configured".to_string(),
|
|
||||||
))?;
|
|
||||||
let r = opencode::chat(key, &*req_for_adapter)
|
|
||||||
.await
|
|
||||||
.map_err(|e| (StatusCode::BAD_GATEWAY, format!("opencode: {e}")))?;
|
|
||||||
(r, "opencode".to_string())
|
|
||||||
}
|
|
||||||
other => {
|
|
||||||
return Err((
|
|
||||||
StatusCode::BAD_REQUEST,
|
|
||||||
format!("unknown provider '{other}' — supported: ollama, ollama_cloud, openrouter, gemini, claude, kimi, opencode"),
|
|
||||||
));
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
let end_time = chrono::Utc::now();
|
|
||||||
let latency_ms = start_instant.elapsed().as_millis() as u64;
|
|
||||||
|
|
||||||
// Phase 40 — emit Langfuse trace. Fire-and-forget: the clone is
|
|
||||||
// cheap (Arc inside), the tokio::spawn never blocks us, a dead
|
|
||||||
// Langfuse just logs a warn. Client-visible response latency is
|
|
||||||
// untouched.
|
|
||||||
if let Some(lf) = &state.langfuse {
|
|
||||||
let output = resp.choices.first()
|
|
||||||
.map(|c| c.message.text())
|
|
||||||
.unwrap_or_default();
|
|
||||||
// Cross-runtime trace linkage. When a caller (validatord on
|
|
||||||
// Go side, /v1/iterate on Rust side) forwards a parent trace
|
|
||||||
// id via X-Lakehouse-Trace-Id, attach this generation to that
|
|
||||||
// trace so the iterate session and its inner chat hops show
|
|
||||||
// up as ONE trace tree in Langfuse. Header name matches the
|
|
||||||
// Go-side `shared.TraceIDHeader` constant byte-for-byte.
|
|
||||||
let parent_trace_id = headers
|
|
||||||
.get(crate::v1::iterate::TRACE_ID_HEADER)
|
|
||||||
.and_then(|v| v.to_str().ok())
|
|
||||||
.map(|s| s.to_string())
|
|
||||||
.filter(|s| !s.is_empty());
|
|
||||||
lf.emit_chat(langfuse_trace::ChatTrace {
|
|
||||||
provider: used_provider.clone(),
|
|
||||||
model: resp.model.clone(),
|
|
||||||
input: req.messages.clone(),
|
|
||||||
output,
|
|
||||||
prompt_tokens: resp.usage.prompt_tokens,
|
|
||||||
completion_tokens: resp.usage.completion_tokens,
|
|
||||||
temperature: req.temperature,
|
|
||||||
max_tokens: req.max_tokens,
|
|
||||||
think: req.think,
|
|
||||||
start_time: start_time.to_rfc3339(),
|
|
||||||
end_time: end_time.to_rfc3339(),
|
|
||||||
latency_ms,
|
|
||||||
parent_trace_id,
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
// Phase 40 part 2 — fire-and-forget /event to observer at :3800.
|
|
||||||
// Same ring-buffer that scrum + scenario events land in, so any
|
|
||||||
// tool-routed-through-our-gateway (Pi, Archon, openai SDK clients)
|
|
||||||
// shows up alongside scrum_master events for KB consolidation +
|
|
||||||
// pathway-memory + bug-fingerprint compounding. Best-effort:
|
|
||||||
// observer being down doesn't block the chat response.
|
|
||||||
{
|
|
||||||
let provider = used_provider.clone();
|
|
||||||
let model = resp.model.clone();
|
|
||||||
let prompt_tokens = resp.usage.prompt_tokens;
|
|
||||||
let completion_tokens = resp.usage.completion_tokens;
|
|
||||||
let success = true;
|
|
||||||
tokio::spawn(async move {
|
|
||||||
let body = serde_json::json!({
|
|
||||||
"endpoint": "/v1/chat",
|
|
||||||
"source": "v1.chat",
|
|
||||||
"event_kind": "chat_completion",
|
|
||||||
"input_summary": format!(
|
|
||||||
"{} {} prompt={}t",
|
|
||||||
provider, model, prompt_tokens
|
|
||||||
),
|
|
||||||
"output_summary": format!(
|
|
||||||
"completion={}t {}ms",
|
|
||||||
completion_tokens, latency_ms
|
|
||||||
),
|
|
||||||
"success": success,
|
|
||||||
"duration_ms": latency_ms,
|
|
||||||
});
|
|
||||||
let client = reqwest::Client::builder()
|
|
||||||
.timeout(std::time::Duration::from_secs(2))
|
|
||||||
.build()
|
|
||||||
.unwrap_or_else(|_| reqwest::Client::new());
|
|
||||||
let _ = client
|
|
||||||
.post("http://localhost:3800/event")
|
|
||||||
.json(&body)
|
|
||||||
.send()
|
|
||||||
.await;
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
// Phase 40: per-provider usage tracking
|
|
||||||
{
|
|
||||||
let mut u = state.usage.write().await;
|
|
||||||
u.requests += 1;
|
|
||||||
u.prompt_tokens += resp.usage.prompt_tokens as u64;
|
|
||||||
u.completion_tokens += resp.usage.completion_tokens as u64;
|
|
||||||
u.total_tokens += resp.usage.total_tokens as u64;
|
|
||||||
|
|
||||||
let provider_usage = u.by_provider.entry(used_provider).or_default();
|
|
||||||
provider_usage.requests += 1;
|
|
||||||
provider_usage.prompt_tokens += resp.usage.prompt_tokens as u64;
|
|
||||||
provider_usage.completion_tokens += resp.usage.completion_tokens as u64;
|
|
||||||
provider_usage.total_tokens += resp.usage.total_tokens as u64;
|
|
||||||
}
|
|
||||||
|
|
||||||
Ok(Json(resp))
|
|
||||||
}
|
|
||||||
|
|
||||||
async fn usage(State(state): State<V1State>) -> impl IntoResponse {
|
|
||||||
let snapshot = state.usage.read().await.clone();
|
|
||||||
Json(snapshot)
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Production operational health endpoint.
|
|
||||||
///
|
|
||||||
/// `/v1/health` reports per-subsystem status as a JSON object so an
|
|
||||||
/// operator (or the lakehouse-auditor service, or a load balancer)
|
|
||||||
/// can verify the gateway is fully booted, has its provider keys
|
|
||||||
/// loaded, the worker roster is hot, and Langfuse is reachable.
|
|
||||||
/// Returns 200 always — fields are observed-state, not pass/fail
|
|
||||||
/// gates. A monitoring tool should evaluate the booleans + counts
|
|
||||||
/// against its own thresholds.
|
|
||||||
async fn health(State(state): State<V1State>) -> impl IntoResponse {
|
|
||||||
// Honest worker count via WorkerLookup::len. Production switchover
|
|
||||||
// verification: after swapping workers_500k.parquet → real Chicago
|
|
||||||
// data and restarting, this number should match the row count of
|
|
||||||
// the new file. 0 means the file was missing / unreadable / had a
|
|
||||||
// schema mismatch and the gateway booted with the empty fallback.
|
|
||||||
let workers_count = state.validate_workers.len();
|
|
||||||
let providers_configured = serde_json::json!({
|
|
||||||
"ollama_cloud": state.ollama_cloud_key.is_some(),
|
|
||||||
"openrouter": state.openrouter_key.is_some(),
|
|
||||||
"kimi": state.kimi_key.is_some(),
|
|
||||||
"opencode": state.opencode_key.is_some(),
|
|
||||||
"gemini": state.gemini_key.is_some(),
|
|
||||||
"claude": state.claude_key.is_some(),
|
|
||||||
});
|
|
||||||
let langfuse_configured = state.langfuse.is_some();
|
|
||||||
let usage_snapshot = state.usage.read().await.clone();
|
|
||||||
Json(serde_json::json!({
|
|
||||||
"status": "ok",
|
|
||||||
"workers_count": workers_count,
|
|
||||||
"workers_loaded": workers_count > 0,
|
|
||||||
"providers_configured": providers_configured,
|
|
||||||
"langfuse_configured": langfuse_configured,
|
|
||||||
"usage_total_requests": usage_snapshot.requests,
|
|
||||||
"usage_by_provider": usage_snapshot.by_provider.keys().collect::<Vec<_>>(),
|
|
||||||
}))
|
|
||||||
}
|
|
||||||
|
|
||||||
// Phase 38 is stateless — no session persistence yet. Return an empty
|
|
||||||
// list in OpenAI-ish shape so clients that probe this endpoint don't
|
|
||||||
// 404. Real session state lands in Phase 41 with the profile-system
|
|
||||||
// expansion.
|
|
||||||
async fn sessions() -> impl IntoResponse {
|
|
||||||
Json(serde_json::json!({
|
|
||||||
"data": [],
|
|
||||||
"object": "list",
|
|
||||||
"note": "Phase 38: stateless. Session state lands in Phase 41.",
|
|
||||||
}))
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use super::*;
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn chat_request_parses_openai_shape() {
|
|
||||||
let raw = r#"{
|
|
||||||
"model": "qwen3.5:latest",
|
|
||||||
"messages": [
|
|
||||||
{"role": "system", "content": "You are helpful."},
|
|
||||||
{"role": "user", "content": "Hi"}
|
|
||||||
],
|
|
||||||
"temperature": 0.2,
|
|
||||||
"max_tokens": 100
|
|
||||||
}"#;
|
|
||||||
let r: ChatRequest = serde_json::from_str(raw).unwrap();
|
|
||||||
assert_eq!(r.model, "qwen3.5:latest");
|
|
||||||
assert_eq!(r.messages.len(), 2);
|
|
||||||
assert_eq!(r.messages[0].role, "system");
|
|
||||||
assert_eq!(r.messages[1].text(), "Hi");
|
|
||||||
assert_eq!(r.temperature, Some(0.2));
|
|
||||||
assert_eq!(r.max_tokens, Some(100));
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn chat_request_accepts_minimal() {
|
|
||||||
let raw = r#"{
|
|
||||||
"model": "any",
|
|
||||||
"messages": [{"role": "user", "content": "hi"}]
|
|
||||||
}"#;
|
|
||||||
let r: ChatRequest = serde_json::from_str(raw).unwrap();
|
|
||||||
assert_eq!(r.temperature, None);
|
|
||||||
assert_eq!(r.max_tokens, None);
|
|
||||||
assert_eq!(r.stream, None);
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn usage_counter_default_is_zero() {
|
|
||||||
let u = Usage::default();
|
|
||||||
assert_eq!(u.requests, 0);
|
|
||||||
assert_eq!(u.total_tokens, 0);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user