imprnt 0.1.3 → 0.1.4-edge.74

package/README.md

@@ -123,14 +123,10 @@ asking ("add the anti-slop plugin"), each a separate `imprnt-plugin-*` package:
 
 | Package | What it gives your assistant |
 |---------|------------------------------|
-| `imprnt-plugin-character` | A voice and standards to write in. "Scribe" is the default you copy and personalize. |
 | `imprnt-plugin-anti-slop` | Rules that keep its prose from reading like AI. |
-| `imprnt-plugin-whenful` | A local mirror of your [Whenful](https://whenful.com) tasks, shown inline at read. |
-| `imprnt-plugin-kleinanzeigen` | A watcher for your Kleinanzeigen inbox: regex triage of buyer messages, drafts, a phone digest. You press send. |
-| `imprnt-plugin-session-host` | A warm browser holding your logged-in sessions, providing the authed-session capability. You enroll each site once. Not yet on npm: install from a repo checkout with `imprnt plugin add session-host --from <dir>`. |
-| `imprnt-plugin-timemachine` | Snapshots your work before each change so you can recover what the agent breaks. |
+| `imprnt-plugin-character` | A voice and standards to write in. "Scribe" is the default you copy and personalize. |
 | `imprnt-plugin-statusline` | A customizable status line: model, branch, context, cost, rate limits, clock. |
-| `imprnt-plugin-telegram` | Your vault from your phone: text a bot, the answer comes from your notes. |
+| `imprnt-plugin-timemachine` | Snapshots your work before each change so you can recover what the agent breaks. |
 
 Adding one copies it into your project and wires it into `CLAUDE.local.md`, the per-machine file
 your assistant loads each session. A fresh setup loads zero plugins until you add them. The full
@@ -180,3 +176,7 @@ only, never needed by people who use it through their assistant). Clone, `bun in
 ## License
 
 MIT (c) 2026 Aleksandr Bogdanov
+
+---
+
+<img src=".github/mark.svg" height="15" alt=""> built by [bogdanov.wtf](https://bogdanov.wtf)

package/dist/cli.js

@@ -1879,6 +1879,28 @@ var init_tags = __esm(() => {
 var exports_recall = {};
 import { lstatSync as lstatSync2, readdirSync as readdirSync6, readFileSync as readFileSync11 } from "node:fs";
 import { basename as basename4, join as join12, relative as relative4 } from "node:path";
+function stemWord(w) {
+  if (w.length <= 3)
+    return w;
+  if (/[a-z]$/.test(w) === false)
+    return w;
+  if (w.endsWith("sses"))
+    return w.slice(0, -2);
+  if (w.endsWith("ies") && w.length > 4)
+    return w.slice(0, -3) + "y";
+  if (w.endsWith("ss") || w.endsWith("us") || w.endsWith("is")) {} else if (w.endsWith("s") && !w.endsWith("ous"))
+    w = w.slice(0, -1);
+  if (w.length > 4 && w.endsWith("ing")) {
+    const base = w.slice(0, -3);
+    if (base.length >= 3)
+      w = /([bdfglmnprt])\1$/.test(base) ? base.slice(0, -1) : base;
+  } else if (w.length > 3 && w.endsWith("ed")) {
+    const base = w.slice(0, -2);
+    if (base.length >= 3)
+      w = /([bdfglmnprt])\1$/.test(base) ? base.slice(0, -1) : base;
+  }
+  return w;
+}
 function walk2(dir2) {
   const out = [];
   for (const entry of readdirSync6(dir2)) {
@@ -1902,7 +1924,53 @@ function walk2(dir2) {
   }
   return out;
 }
-var args2, vault2, limit = 15, positional2, query, vocab, MAX_SYNONYM_NGRAM, STOPWORDS, tokenize = (text2) => text2.normalize("NFC").toLowerCase().replace(/['’]/gu, "").split(/[^\p{L}\p{N}]+/u).filter(Boolean), phraseSynonymTokens = (q) => {
+function bestPassages(absPath, n) {
+  let raw = "";
+  try {
+    raw = stripBom(readFileSync11(absPath, "utf8"));
+  } catch {
+    return [];
+  }
+  const fmMatch = raw.match(/^---\r?\n([\s\S]*?)\r?\n---/);
+  const body2 = fmMatch ? raw.slice(fmMatch.index + fmMatch[0].length) : raw;
+  const paras = body2.split(/\n\s*\n/).map((p) => p.trim()).filter((p) => p.length > 0);
+  if (paras.length <= n)
+    return paras;
+  const scoredParas = paras.map((p) => {
+    const tf = new Map;
+    for (const t of tokenize(p))
+      tf.set(t, (tf.get(t) ?? 0) + 1);
+    let plen = 0;
+    for (const c of tf.values())
+      plen += c;
+    let sc = 0;
+    const used = new Set;
+    for (const group of scoringGroups) {
+      let best = 0, bv = "";
+      for (const v of group) {
+        if (used.has(v))
+          continue;
+        const x = bm25Term(tf.get(v) ?? 0, plen, variantIdf.get(v) ?? 0);
+        if (x > best) {
+          best = x;
+          bv = v;
+        }
+      }
+      if (best > 0) {
+        sc += best;
+        used.add(bv);
+      }
+    }
+    return { p, sc };
+  });
+  const keep = new Set(scoredParas.slice().sort((a, b) => b.sc - a.sc).slice(0, n).filter((x) => x.sc > 0).map((x) => x.p));
+  const out = paras.filter((p) => keep.has(p));
+  return out.length ? out : paras.slice(0, n);
+}
+var args2, vault2, limit = 15, gap = 0, passages = 0, proximity = false, coverage = false, stem = false, positional2, query, vocab, MAX_SYNONYM_NGRAM, STOPWORDS, tokenize = (text2) => {
+  const raw = text2.normalize("NFC").toLowerCase().replace(/['’]/gu, "").split(/[^\p{L}\p{N}]+/u).filter(Boolean);
+  return stem ? raw.map(stemWord) : raw;
+}, phraseSynonymTokens = (q) => {
   const out = [];
   const words = q.normalize("NFC").toLowerCase().split(/[\s-]+/).map((w) => w.replace(/^[^\p{L}\p{N}]+|[^\p{L}\p{N}]+$/gu, "")).filter(Boolean);
   for (let n = Math.min(words.length, MAX_SYNONYM_NGRAM);n >= 2; n--) {
@@ -1916,14 +1984,14 @@ var args2, vault2, limit = 15, positional2, query, vocab, MAX_SYNONYM_NGRAM, STO
     }
   }
   return out;
-}, rawTerms, contentTerms, baseTerms, queryTerms, CONTROL2, files, TITLE_BOOST = 3, TAG_BOOST = 2, SUMMARY_BOOST = 1, BODY_BOOST = 1, docs, df, N, avgdl, K1 = 1.5, B = 0.75, idf = (term) => {
+}, rawTerms, contentTerms, baseTerms, queryTerms, queryVariantSet, CONTROL2, files, TITLE_BOOST = 3, TAG_BOOST = 2, SUMMARY_BOOST = 1, BODY_BOOST = 1, docs, df, N, avgdl, K1 = 1.5, B = 0.75, PROX_WINDOW = 25, PROX_WEIGHT = 0.35, idf = (term) => {
   const n = df.get(term) ?? 0;
   return Math.max(0, Math.log(1 + (N - n + 0.5) / (n + 0.5)));
 }, bm25Term = (tf, dl, termIdf) => {
   if (tf <= 0)
     return 0;
   return termIdf * (tf * (K1 + 1)) / (tf + K1 * (1 - B + B * (dl / avgdl)));
-}, variantIdf, hits, scoringGroups, shown, expanded;
+}, variantIdf, hits, scoringGroups, cut, shown, expanded;
 var init_recall = __esm(() => {
   init_tags();
   init_moc();
@@ -1950,12 +2018,42 @@ var init_recall = __esm(() => {
         process.exit(1);
       }
       limit = n;
+    } else if (args2[i] === "--proximity") {
+      proximity = true;
+    } else if (args2[i] === "--coverage") {
+      coverage = true;
+    } else if (args2[i] === "--stem") {
+      stem = true;
+    } else if (args2[i] === "--passages") {
+      const tok = args2[++i];
+      if (tok === undefined || !/^[0-9]+$/.test(tok)) {
+        console.error("--passages must be a positive integer");
+        process.exit(1);
+      }
+      const n = parseInt(tok, 10);
+      if (!Number.isFinite(n) || n <= 0) {
+        console.error("--passages must be a positive integer");
+        process.exit(1);
+      }
+      passages = n;
+    } else if (args2[i] === "--gap") {
+      const tok = args2[++i];
+      if (tok === undefined || !/^0?\.[0-9]+$/.test(tok)) {
+        console.error("--gap must be a ratio between 0 and 1 (e.g. 0.25)");
+        process.exit(1);
+      }
+      const g = parseFloat(tok);
+      if (!Number.isFinite(g) || g <= 0 || g >= 1) {
+        console.error("--gap must be a ratio between 0 and 1 (e.g. 0.25)");
+        process.exit(1);
+      }
+      gap = g;
     } else
       positional2.push(args2[i]);
   }
   query = positional2.join(" ").trim();
   if (!query) {
-    console.error('usage: imprnt recall "<query>" [--vault DIR] [--limit N]');
+    console.error('usage: imprnt recall "<query>" [--vault DIR] [--limit N] [--gap R] [--passages N] [--proximity] [--coverage] [--stem]');
     process.exit(1);
   }
   vocab = loadTags(vault2);
@@ -2063,6 +2161,7 @@ var init_recall = __esm(() => {
   contentTerms = rawTerms.filter((w) => !STOPWORDS.has(w));
   baseTerms = contentTerms.length ? contentTerms : rawTerms;
   queryTerms = baseTerms.map((w) => [...new Set([w, ...tokenize(normalize(vocab, w))])]);
+  queryVariantSet = new Set(queryTerms.flat());
   for (const t of phraseSynonymTokens(query)) {
     if (!STOPWORDS.has(t))
       queryTerms.push([t]);
@@ -2099,11 +2198,26 @@ var init_recall = __esm(() => {
     add(tokenize(aliases), TITLE_BOOST);
     add(tags.flatMap(tokenize), TAG_BOOST);
     add(tokenize(summary), SUMMARY_BOOST);
-    add(tokenize(body2), BODY_BOOST);
+    const bodyTokens = tokenize(body2);
+    add(bodyTokens, BODY_BOOST);
+    let pos;
+    if (proximity) {
+      pos = new Map;
+      for (let bi = 0;bi < bodyTokens.length; bi++) {
+        const t = bodyTokens[bi];
+        if (!queryVariantSet.has(t))
+          continue;
+        const arr = pos.get(t);
+        if (arr)
+          arr.push(bi);
+        else
+          pos.set(t, [bi]);
+      }
+    }
     let len = 0;
     for (const c of tf.values())
       len += c;
-    docs.push({ path, tf, len });
+    docs.push({ path, tf, len, pos });
     for (const term of tf.keys())
       df.set(term, (df.get(term) ?? 0) + 1);
   }
@@ -2136,23 +2250,69 @@ var init_recall = __esm(() => {
         scored.add(bestVariant);
       }
     }
-    if (score > 0)
+    if (score > 0) {
+      if (coverage && scoringGroups.length > 1) {
+        score *= 0.5 + 0.5 * (scored.size / scoringGroups.length);
+      }
+      if (proximity && d.pos && scored.size > 1) {
+        const present = [...scored].filter((t) => d.pos.has(t));
+        let bonus = 0;
+        for (let x = 0;x < present.length; x++) {
+          for (let y = x + 1;y < present.length; y++) {
+            const a = d.pos.get(present[x]), b = d.pos.get(present[y]);
+            let best = Infinity;
+            for (let ia = 0, ib = 0;ia < a.length && ib < b.length; ) {
+              const dist = Math.abs(a[ia] - b[ib]);
+              if (dist < best)
+                best = dist;
+              if (a[ia] < b[ib])
+                ia++;
+              else
+                ib++;
+            }
+            if (best < PROX_WINDOW) {
+              const w = Math.min(variantIdf.get(present[x]) ?? 0, variantIdf.get(present[y]) ?? 0);
+              bonus += PROX_WEIGHT * w * (1 - best / PROX_WINDOW);
+            }
+          }
+        }
+        score += bonus;
+      }
       hits.push({ path: relative4(vault2, d.path), score: Math.round(score * 100) / 100 });
+    }
   }
   hits.sort((a, b) => b.score - a.score || a.path.localeCompare(b.path));
   if (!hits.length) {
     console.log(`no matches for "${query}" in ${vault2}`);
     process.exit(0);
   }
-  shown = hits.slice(0, limit);
+  cut = Math.min(limit, hits.length);
+  if (gap > 0) {
+    for (let i = 1;i < cut; i++) {
+      if (hits[i].score < gap * hits[i - 1].score) {
+        cut = i;
+        break;
+      }
+    }
+  }
+  shown = hits.slice(0, cut);
   expanded = queryTerms.map((g) => g.join("|")).join(" ");
-  console.log(`recall "${query}" [${expanded}] — ${hits.length} match(es)${hits.length > shown.length ? `, showing top ${shown.length}` : ""}, BM25-ranked:
+  console.log(`recall "${query}" [${expanded}] - ${hits.length} match(es)${hits.length > shown.length ? `, showing top ${shown.length}` : ""}, BM25-ranked:
 `);
-  for (const h of shown)
+  for (const h of shown) {
     console.log(`  [${h.score.toFixed(2)}] ${h.path}`);
+    if (passages > 0) {
+      for (const p of bestPassages(join12(vault2, h.path), passages)) {
+        for (const line of p.split(`
+`))
+          console.log(`      ${line}`);
+        console.log("");
+      }
+    }
+  }
   if (hits.length > shown.length) {
     console.log(`
-  … ${hits.length - shown.length} lower-ranked hit(s) hidden. Raise with --limit if needed; usually you don't.`);
+  ... ${hits.length - shown.length} lower-ranked hit(s) hidden. Raise with --limit if needed. Usually you do not.`);
   }
 });
 
@@ -2261,11 +2421,11 @@ var init_snapshot = __esm(() => {
         continue;
       }
       const ext = extname2(rel);
-      const stem = rel.slice(0, rel.length - ext.length);
-      let relD = `${stem}-${hash2.slice(0, 8)}${ext}`;
+      const stem2 = rel.slice(0, rel.length - ext.length);
+      let relD = `${stem2}-${hash2.slice(0, 8)}${ext}`;
       let n = 2;
       while (existsSync11(join13(destRoot, relD)) && Buffer.compare(readFileSync12(join13(destRoot, relD)), srcBytes2) !== 0) {
-        relD = `${stem}-${hash2.slice(0, 8)}-${n}${ext}`;
+        relD = `${stem2}-${hash2.slice(0, 8)}-${n}${ext}`;
         n++;
       }
       rawPath2 = join13(destRoot, relD);

package/dist/imp.js

@@ -1879,6 +1879,28 @@ var init_tags = __esm(() => {
 var exports_recall = {};
 import { lstatSync as lstatSync2, readdirSync as readdirSync6, readFileSync as readFileSync11 } from "node:fs";
 import { basename as basename4, join as join12, relative as relative4 } from "node:path";
+function stemWord(w) {
+  if (w.length <= 3)
+    return w;
+  if (/[a-z]$/.test(w) === false)
+    return w;
+  if (w.endsWith("sses"))
+    return w.slice(0, -2);
+  if (w.endsWith("ies") && w.length > 4)
+    return w.slice(0, -3) + "y";
+  if (w.endsWith("ss") || w.endsWith("us") || w.endsWith("is")) {} else if (w.endsWith("s") && !w.endsWith("ous"))
+    w = w.slice(0, -1);
+  if (w.length > 4 && w.endsWith("ing")) {
+    const base = w.slice(0, -3);
+    if (base.length >= 3)
+      w = /([bdfglmnprt])\1$/.test(base) ? base.slice(0, -1) : base;
+  } else if (w.length > 3 && w.endsWith("ed")) {
+    const base = w.slice(0, -2);
+    if (base.length >= 3)
+      w = /([bdfglmnprt])\1$/.test(base) ? base.slice(0, -1) : base;
+  }
+  return w;
+}
 function walk2(dir2) {
   const out = [];
   for (const entry of readdirSync6(dir2)) {
@@ -1902,7 +1924,53 @@ function walk2(dir2) {
   }
   return out;
 }
-var args2, vault2, limit = 15, positional2, query, vocab, MAX_SYNONYM_NGRAM, STOPWORDS, tokenize = (text2) => text2.normalize("NFC").toLowerCase().replace(/['’]/gu, "").split(/[^\p{L}\p{N}]+/u).filter(Boolean), phraseSynonymTokens = (q) => {
+function bestPassages(absPath, n) {
+  let raw = "";
+  try {
+    raw = stripBom(readFileSync11(absPath, "utf8"));
+  } catch {
+    return [];
+  }
+  const fmMatch = raw.match(/^---\r?\n([\s\S]*?)\r?\n---/);
+  const body2 = fmMatch ? raw.slice(fmMatch.index + fmMatch[0].length) : raw;
+  const paras = body2.split(/\n\s*\n/).map((p) => p.trim()).filter((p) => p.length > 0);
+  if (paras.length <= n)
+    return paras;
+  const scoredParas = paras.map((p) => {
+    const tf = new Map;
+    for (const t of tokenize(p))
+      tf.set(t, (tf.get(t) ?? 0) + 1);
+    let plen = 0;
+    for (const c of tf.values())
+      plen += c;
+    let sc = 0;
+    const used = new Set;
+    for (const group of scoringGroups) {
+      let best = 0, bv = "";
+      for (const v of group) {
+        if (used.has(v))
+          continue;
+        const x = bm25Term(tf.get(v) ?? 0, plen, variantIdf.get(v) ?? 0);
+        if (x > best) {
+          best = x;
+          bv = v;
+        }
+      }
+      if (best > 0) {
+        sc += best;
+        used.add(bv);
+      }
+    }
+    return { p, sc };
+  });
+  const keep = new Set(scoredParas.slice().sort((a, b) => b.sc - a.sc).slice(0, n).filter((x) => x.sc > 0).map((x) => x.p));
+  const out = paras.filter((p) => keep.has(p));
+  return out.length ? out : paras.slice(0, n);
+}
+var args2, vault2, limit = 15, gap = 0, passages = 0, proximity = false, coverage = false, stem = false, positional2, query, vocab, MAX_SYNONYM_NGRAM, STOPWORDS, tokenize = (text2) => {
+  const raw = text2.normalize("NFC").toLowerCase().replace(/['’]/gu, "").split(/[^\p{L}\p{N}]+/u).filter(Boolean);
+  return stem ? raw.map(stemWord) : raw;
+}, phraseSynonymTokens = (q) => {
   const out = [];
   const words = q.normalize("NFC").toLowerCase().split(/[\s-]+/).map((w) => w.replace(/^[^\p{L}\p{N}]+|[^\p{L}\p{N}]+$/gu, "")).filter(Boolean);
   for (let n = Math.min(words.length, MAX_SYNONYM_NGRAM);n >= 2; n--) {
@@ -1916,14 +1984,14 @@ var args2, vault2, limit = 15, positional2, query, vocab, MAX_SYNONYM_NGRAM, STO
     }
   }
   return out;
-}, rawTerms, contentTerms, baseTerms, queryTerms, CONTROL2, files, TITLE_BOOST = 3, TAG_BOOST = 2, SUMMARY_BOOST = 1, BODY_BOOST = 1, docs, df, N, avgdl, K1 = 1.5, B = 0.75, idf = (term) => {
+}, rawTerms, contentTerms, baseTerms, queryTerms, queryVariantSet, CONTROL2, files, TITLE_BOOST = 3, TAG_BOOST = 2, SUMMARY_BOOST = 1, BODY_BOOST = 1, docs, df, N, avgdl, K1 = 1.5, B = 0.75, PROX_WINDOW = 25, PROX_WEIGHT = 0.35, idf = (term) => {
   const n = df.get(term) ?? 0;
   return Math.max(0, Math.log(1 + (N - n + 0.5) / (n + 0.5)));
 }, bm25Term = (tf, dl, termIdf) => {
   if (tf <= 0)
     return 0;
   return termIdf * (tf * (K1 + 1)) / (tf + K1 * (1 - B + B * (dl / avgdl)));
-}, variantIdf, hits, scoringGroups, shown, expanded;
+}, variantIdf, hits, scoringGroups, cut, shown, expanded;
 var init_recall = __esm(() => {
   init_tags();
   init_moc();
@@ -1950,12 +2018,42 @@ var init_recall = __esm(() => {
         process.exit(1);
       }
       limit = n;
+    } else if (args2[i] === "--proximity") {
+      proximity = true;
+    } else if (args2[i] === "--coverage") {
+      coverage = true;
+    } else if (args2[i] === "--stem") {
+      stem = true;
+    } else if (args2[i] === "--passages") {
+      const tok = args2[++i];
+      if (tok === undefined || !/^[0-9]+$/.test(tok)) {
+        console.error("--passages must be a positive integer");
+        process.exit(1);
+      }
+      const n = parseInt(tok, 10);
+      if (!Number.isFinite(n) || n <= 0) {
+        console.error("--passages must be a positive integer");
+        process.exit(1);
+      }
+      passages = n;
+    } else if (args2[i] === "--gap") {
+      const tok = args2[++i];
+      if (tok === undefined || !/^0?\.[0-9]+$/.test(tok)) {
+        console.error("--gap must be a ratio between 0 and 1 (e.g. 0.25)");
+        process.exit(1);
+      }
+      const g = parseFloat(tok);
+      if (!Number.isFinite(g) || g <= 0 || g >= 1) {
+        console.error("--gap must be a ratio between 0 and 1 (e.g. 0.25)");
+        process.exit(1);
+      }
+      gap = g;
     } else
       positional2.push(args2[i]);
   }
   query = positional2.join(" ").trim();
   if (!query) {
-    console.error('usage: imprnt recall "<query>" [--vault DIR] [--limit N]');
+    console.error('usage: imprnt recall "<query>" [--vault DIR] [--limit N] [--gap R] [--passages N] [--proximity] [--coverage] [--stem]');
     process.exit(1);
   }
   vocab = loadTags(vault2);
@@ -2063,6 +2161,7 @@ var init_recall = __esm(() => {
   contentTerms = rawTerms.filter((w) => !STOPWORDS.has(w));
   baseTerms = contentTerms.length ? contentTerms : rawTerms;
   queryTerms = baseTerms.map((w) => [...new Set([w, ...tokenize(normalize(vocab, w))])]);
+  queryVariantSet = new Set(queryTerms.flat());
   for (const t of phraseSynonymTokens(query)) {
     if (!STOPWORDS.has(t))
       queryTerms.push([t]);
@@ -2099,11 +2198,26 @@ var init_recall = __esm(() => {
     add(tokenize(aliases), TITLE_BOOST);
     add(tags.flatMap(tokenize), TAG_BOOST);
     add(tokenize(summary), SUMMARY_BOOST);
-    add(tokenize(body2), BODY_BOOST);
+    const bodyTokens = tokenize(body2);
+    add(bodyTokens, BODY_BOOST);
+    let pos;
+    if (proximity) {
+      pos = new Map;
+      for (let bi = 0;bi < bodyTokens.length; bi++) {
+        const t = bodyTokens[bi];
+        if (!queryVariantSet.has(t))
+          continue;
+        const arr = pos.get(t);
+        if (arr)
+          arr.push(bi);
+        else
+          pos.set(t, [bi]);
+      }
+    }
     let len = 0;
     for (const c of tf.values())
       len += c;
-    docs.push({ path, tf, len });
+    docs.push({ path, tf, len, pos });
     for (const term of tf.keys())
       df.set(term, (df.get(term) ?? 0) + 1);
   }
@@ -2136,23 +2250,69 @@ var init_recall = __esm(() => {
         scored.add(bestVariant);
       }
     }
-    if (score > 0)
+    if (score > 0) {
+      if (coverage && scoringGroups.length > 1) {
+        score *= 0.5 + 0.5 * (scored.size / scoringGroups.length);
+      }
+      if (proximity && d.pos && scored.size > 1) {
+        const present = [...scored].filter((t) => d.pos.has(t));
+        let bonus = 0;
+        for (let x = 0;x < present.length; x++) {
+          for (let y = x + 1;y < present.length; y++) {
+            const a = d.pos.get(present[x]), b = d.pos.get(present[y]);
+            let best = Infinity;
+            for (let ia = 0, ib = 0;ia < a.length && ib < b.length; ) {
+              const dist = Math.abs(a[ia] - b[ib]);
+              if (dist < best)
+                best = dist;
+              if (a[ia] < b[ib])
+                ia++;
+              else
+                ib++;
+            }
+            if (best < PROX_WINDOW) {
+              const w = Math.min(variantIdf.get(present[x]) ?? 0, variantIdf.get(present[y]) ?? 0);
+              bonus += PROX_WEIGHT * w * (1 - best / PROX_WINDOW);
+            }
+          }
+        }
+        score += bonus;
+      }
       hits.push({ path: relative4(vault2, d.path), score: Math.round(score * 100) / 100 });
+    }
   }
   hits.sort((a, b) => b.score - a.score || a.path.localeCompare(b.path));
   if (!hits.length) {
     console.log(`no matches for "${query}" in ${vault2}`);
     process.exit(0);
   }
-  shown = hits.slice(0, limit);
+  cut = Math.min(limit, hits.length);
+  if (gap > 0) {
+    for (let i = 1;i < cut; i++) {
+      if (hits[i].score < gap * hits[i - 1].score) {
+        cut = i;
+        break;
+      }
+    }
+  }
+  shown = hits.slice(0, cut);
   expanded = queryTerms.map((g) => g.join("|")).join(" ");
-  console.log(`recall "${query}" [${expanded}] — ${hits.length} match(es)${hits.length > shown.length ? `, showing top ${shown.length}` : ""}, BM25-ranked:
+  console.log(`recall "${query}" [${expanded}] - ${hits.length} match(es)${hits.length > shown.length ? `, showing top ${shown.length}` : ""}, BM25-ranked:
 `);
-  for (const h of shown)
+  for (const h of shown) {
     console.log(`  [${h.score.toFixed(2)}] ${h.path}`);
+    if (passages > 0) {
+      for (const p of bestPassages(join12(vault2, h.path), passages)) {
+        for (const line of p.split(`
+`))
+          console.log(`      ${line}`);
+        console.log("");
+      }
+    }
+  }
   if (hits.length > shown.length) {
     console.log(`
-  … ${hits.length - shown.length} lower-ranked hit(s) hidden. Raise with --limit if needed; usually you don't.`);
+  ... ${hits.length - shown.length} lower-ranked hit(s) hidden. Raise with --limit if needed. Usually you do not.`);
   }
 });
 
@@ -2261,11 +2421,11 @@ var init_snapshot = __esm(() => {
         continue;
       }
       const ext = extname2(rel);
-      const stem = rel.slice(0, rel.length - ext.length);
-      let relD = `${stem}-${hash2.slice(0, 8)}${ext}`;
+      const stem2 = rel.slice(0, rel.length - ext.length);
+      let relD = `${stem2}-${hash2.slice(0, 8)}${ext}`;
       let n = 2;
       while (existsSync11(join13(destRoot, relD)) && Buffer.compare(readFileSync12(join13(destRoot, relD)), srcBytes2) !== 0) {
-        relD = `${stem}-${hash2.slice(0, 8)}-${n}${ext}`;
+        relD = `${stem2}-${hash2.slice(0, 8)}-${n}${ext}`;
         n++;
       }
       rawPath2 = join13(destRoot, relD);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "imprnt",
-  "version": "0.1.3",
+  "version": "0.1.4-edge.74",
   "stable": true,
   "description": "Deterministic-first, plain-markdown knowledge vault. Code does the bulk transform. The LLM only touches the irreducibly-semantic 20%. Native grep plus BM25 retrieval, zero MCP on the vault.",
   "type": "module",