@chatpanel/events 0.102.0 → 0.103.1

package/knowledge-derive.js

@@ -1,267 +1 @@
-// DERIVING briefs — the pass that turns a corpus into the derived layer.
-//
-// Separate from `knowledge.js` (the model) because the costs are not alike: reading a brief
-// needs its shape and its renderer; building one walks every record, resolves entities and
-// runs the deterministic maintenance passes. Only pages ever build. The MV3 service worker
-// only ever reads — it syncs stored briefs onward — so keeping this out of `knowledge.js`
-// keeps it off the worker's cold start entirely, rather than relying on nobody importing it.
-//
-// Everything here is class R: no model, no network, and `now` is injected rather than read,
-// so a rebuild is reproducible. That is what makes invariant I-K2 true — deriveBriefs() is
-// the ONLY way a brief is ever created, so throwing them all away can never lose anything.
-
-import { makeRef } from './ref.js';
-import {
-  DEFAULT_THRESHOLD, MAX_SUBJECTS, normalizeSubject, rankSubjects, resolveSubjects,
-} from './entity.js';
-import { mentionsFrom, normalizeRecords, wantedPages } from './curate.js';
-import { MAX_CLAIMS, MAX_CLAIM_REFS, MAX_BRIEF_RECORDS, briefId, contentHash } from './knowledge.js';
-
-/** Records are addressed `chat:x` / `meeting:y` / `note:z` — the ref kind is the prefix. */
-function refForRecord(rec) {
-  const [kind, ...rest] = String(rec.id).split(':');
-  const id = rest.join(':') || rec.id;
-  const known = kind === 'chat' || kind === 'meeting' || kind === 'note' || kind === 'page';
-  return makeRef({ kind: known ? kind : 'result', id: known ? id : rec.id, hash: contentHash(rec.text) });
-}
-
-function claim({ id, kind, text, refs, at = 0, confidence = 1 }) {
-  return {
-    id,
-    kind,
-    text,
-    // I-K1 lives here: a claim is CONSTRUCTED with its refs, and `checkKnowledgeInvariants`
-    // refuses one that arrives without them. There is no path that writes a claim first and
-    // attaches provenance later, because that path is how provenance goes missing.
-    refs: refs.slice(0, MAX_CLAIM_REFS),
-    firstSeen: at,
-    lastConfirmed: at,
-    confidence,
-    cls: 'R', // class R — derived, not written. W3's prose claims carry 'C'.
-  };
-}
-
-const plural = (n, one, many = `${one}s`) => `${n} ${n === 1 ? one : many}`;
-const isoDay = (ms) => (ms ? new Date(ms).toISOString().slice(0, 10) : '');
-
-// How many co-occurring subjects a `together` claim names. Past a handful it stops being a
-// statement and becomes a tag cloud.
-const TOGETHER_LIMIT = 5;
-
-/**
- * Memories that are ABOUT this subject become its highest-confidence claims.
- *
- * This is how the existing memory layer folds in, and the direction matters. `identity` and
- * `preference` memories are AMBIENT — they ride every turn already, and copying them onto a
- * brief would say them twice. The other three kinds (`project`, `fact`, `reference`) are
- * retrieved rather than ambient, and a retrieved durable statement about a subject is
- * exactly what a claim is — except the user said it themselves, so it outranks anything
- * derived from co-occurrence.
- *
- * The reverse never happens automatically: a brief must not write itself into memory. Memory
- * is bounded because it is ambient; a corpus flowing into it would unbound the one thing in
- * the product that is deliberately small.
- */
-function statedClaims(subject, memories, seq) {
-  const out = [];
-  const names = [subject.canonical, ...subject.aliases].filter(Boolean);
-  for (const mem of memories) {
-    if (!mem?.text || !mem.id) continue;
-    if (mem.kind === 'identity' || mem.kind === 'preference') continue; // already ambient
-    const hay = normalizeSubject(mem.text);
-    // Whole-token containment, so "pricing" does not match "repricing" and a one-word
-    // subject cannot claim every memory that happens to contain it as a substring.
-    const hit = names.some((n) => n && (hay === n || hay.includes(` ${n} `) || hay.startsWith(`${n} `) || hay.endsWith(` ${n}`)));
-    if (!hit) continue;
-    out.push(claim({
-      id: `${seq()}`,
-      kind: 'stated',
-      text: mem.text,
-      refs: [makeRef({ kind: 'memory', id: mem.id, hash: contentHash(mem.text) })],
-      at: Number(mem.updatedAt || mem.createdAt) || 0,
-      confidence: Number(mem.confidence) || 1,
-    }));
-  }
-  return out;
-}
-
-/**
- * One subject + the records that mention it → a brief.
- *
- * Every claim here is a restatement of something the corpus already holds, which is what
- * makes the phase free and what makes I-K3's auto-promotion defensible: none of it is an
- * opinion, so there is nothing for a reviewer to review.
- */
-export function deriveBrief(subject, { records, byId, cooccurring = [], memories = [], wanted = null, now = 0 } = {}) {
-  const recs = [...(subject.records instanceof Set ? subject.records : subject.records || [])]
-    .map((id) => byId.get(id)).filter(Boolean)
-    .sort((a, b) => (a.date || 0) - (b.date || 0));
-  if (!recs.length && !wanted) return null;
-
-  let n = 0;
-  const seq = () => { n += 1; return `c${n}`; };
-  const claims = [];
-
-  if (recs.length) {
-    const byType = {};
-    for (const r of recs) byType[r.type] = (byType[r.type] || 0) + 1;
-    const parts = Object.entries(byType).sort((a, b) => b[1] - a[1]).map(([t, c]) => plural(c, t));
-    claims.push(claim({
-      id: seq(),
-      kind: 'presence',
-      text: `Appears in ${plural(recs.length, 'record')} — ${parts.join(', ')}.`,
-      // The most recent records, because that is what a reader checks first — and the
-      // newest is also the one most likely to still resolve.
-      refs: recs.slice(-MAX_CLAIM_REFS).reverse().map(refForRecord),
-      at: now,
-    }));
-
-    const first = recs.find((r) => r.date);
-    const last = [...recs].reverse().find((r) => r.date);
-    if (first && last && first !== last) {
-      claims.push(claim({
-        id: seq(),
-        kind: 'timeline',
-        text: `Runs from ${isoDay(first.date)} to ${isoDay(last.date)} — ${first.title || 'untitled'} → ${last.title || 'untitled'}.`,
-        refs: [refForRecord(first), refForRecord(last)],
-        at: now,
-      }));
-    }
-  }
-
-  if (cooccurring.length) {
-    claims.push(claim({
-      id: seq(),
-      kind: 'together',
-      text: `Usually alongside ${cooccurring.slice(0, TOGETHER_LIMIT).map((c) => c.name).join(', ')}.`,
-      refs: recs.slice(-MAX_CLAIM_REFS).map(refForRecord),
-      at: now,
-    }));
-  }
-
-  if (wanted) {
-    // A [[link]] that resolves to nothing is the corpus asking for a page: a human already
-    // decided the subject was worth naming. Saying so on the brief is more useful than
-    // hiding it, because it tells the reader the page is thin BECAUSE nobody wrote the
-    // source, not because the derivation failed.
-    claims.push(claim({
-      id: seq(),
-      kind: 'wanted',
-      text: `Linked from ${plural(wanted.recordCount, 'record')} but no record carries this title.`,
-      refs: recs.slice(0, MAX_CLAIM_REFS).map(refForRecord),
-      at: now,
-    }));
-  }
-
-  claims.push(...statedClaims(subject, memories, seq));
-
-  const capped = claims.slice(0, MAX_CLAIMS);
-  const dates = recs.map((r) => r.date || 0).filter(Boolean);
-  return {
-    id: briefId(subject.key),
-    key: subject.key,
-    kind: subject.kind,
-    subject: { name: subject.name, aliases: [...(subject.aliases || [])] },
-    // Class R may auto-promote (I-K3): nothing above is an opinion, so there is nothing a
-    // reviewer could accept or reject. W3's prose arrives as `proposed` beside it.
-    state: 'promoted',
-    cls: 'R',
-    claims: capped,
-    records: recs.slice(-MAX_BRIEF_RECORDS).map((r) => ({ id: r.id, type: r.type, title: r.title, date: r.date })),
-    stats: {
-      records: recs.length,
-      mentions: subject.mentions,
-      claims: capped.length,
-      first: dates.length ? Math.min(...dates) : 0,
-      last: dates.length ? Math.max(...dates) : 0,
-      wanted: !!wanted,
-    },
-    createdAt: now,
-    updatedAt: now,
-  };
-}
-
-/**
- * The whole corpus → the briefs it earns. This IS invariant I-K2: it is the only way a
- * brief is ever created, so throwing them all away can never lose anything.
- *
- * `now` is injected rather than read, so a rebuild is reproducible and testable — the same
- * rule loop.js and schedule.js follow.
- */
-export function deriveBriefs(records = [], {
-  memories = [], merges = null, self = '', threshold = DEFAULT_THRESHOLD,
-  limit = MAX_SUBJECTS, now = 0,
-} = {}) {
-  const recs = normalizeRecords(records);
-  const byId = new Map(recs.map((r) => [r.id, r]));
-  const mentions = mentionsFrom(recs);
-  // `merges` and `self` are corrections the USER made, and they are applied here — as inputs
-  // to the pass, never as edits to its output. That is what keeps I-K2 true: a rebuild
-  // re-applies them, where a rebuild that erased them would teach the user not to bother.
-  const subjects = resolveSubjects(mentions, { merges, self });
-  const ranked = rankSubjects(subjects, { threshold, limit });
-
-  // Which subjects share records with which — the `together` claim, computed once for the
-  // whole corpus rather than per subject, so this stays linear in mentions rather than
-  // quadratic in subjects.
-  const perRecord = new Map();
-  for (const s of ranked) {
-    for (const id of s.records) {
-      if (!perRecord.has(id)) perRecord.set(id, []);
-      perRecord.get(id).push(s.key);
-    }
-  }
-  const pairs = new Map();
-  for (const keys of perRecord.values()) {
-    for (const a of keys) for (const b of keys) {
-      if (a === b) continue;
-      const m = pairs.get(a) || new Map();
-      m.set(b, (m.get(b) || 0) + 1);
-      pairs.set(a, m);
-    }
-  }
-  const byKey = new Map(ranked.map((s) => [s.key, s]));
-  const wantedByNorm = new Map(wantedPages(recs).map((w) => [w.norm, w]));
-
-  const out = [];
-  for (const s of ranked) {
-    const co = [...(pairs.get(s.key) || new Map()).entries()]
-      .sort((a, b) => b[1] - a[1] || a[0].localeCompare(b[0]))
-      .map(([key, count]) => ({ key, count, name: byKey.get(key)?.name || key }))
-      .filter((c) => c.count > 1);
-    const brief = deriveBrief(s, {
-      byId,
-      cooccurring: co,
-      memories,
-      wanted: s.kind === 'title' ? wantedByNorm.get(s.canonical) || null : null,
-      now,
-    });
-    if (brief) out.push(brief);
-  }
-  return out;
-}
-
-/**
- * Which refs no longer resolve to what they cited.
- *
- * This is where `ref.js`'s `drifted` finally earns its existence: a claim saying "cutover
- * moved to Q4, see meeting m_8812" is worthless if m_8812 has since been edited into
- * something else, and a maintenance pass that cannot tell is a maintenance pass that lies.
- */
-export function driftedRefs(brief, records = []) {
-  const hashes = new Map();
-  for (const r of normalizeRecords(records)) {
-    const [kind, ...rest] = r.id.split(':');
-    hashes.set(`${kind}:${rest.join(':') || r.id}`, contentHash(r.text));
-  }
-  const out = [];
-  for (const c of brief?.claims || []) {
-    for (const ref of c.refs || []) {
-      if (ref.kind === 'memory') continue; // memories are not records; they drift by edit, not by hash
-      const now = hashes.get(`${ref.kind}:${ref.id}`);
-      if (now === undefined) out.push({ claim: c.id, ref, resolution: 'verified-but-unavailable' });
-      else if (now !== ref.hash) out.push({ claim: c.id, ref, resolution: 'drifted' });
-    }
-  }
-  return out;
-}
+import{makeRef as C}from"./ref.js";import{DEFAULT_THRESHOLD as _,MAX_SUBJECTS as w,normalizeSubject as T,rankSubjects as b,resolveSubjects as L}from"./entity.js";import{mentionsFrom as D,normalizeRecords as E,wantedPages as F}from"./curate.js";import{MAX_CLAIMS as O,MAX_CLAIM_REFS as A,MAX_BRIEF_RECORDS as H,briefId as X,contentHash as v}from"./knowledge.js";function x(e){const[r,...d]=String(e.id).split(":"),c=d.join(":")||e.id,o=r==="chat"||r==="meeting"||r==="note"||r==="page";return C({kind:o?r:"result",id:o?c:e.id,hash:v(e.text)})}function R({id:e,kind:r,text:d,refs:c,at:o=0,confidence:n=1}){return{id:e,kind:r,text:d,refs:c.slice(0,A),firstSeen:o,lastConfirmed:o,confidence:n,cls:"R"}}const B=(e,r,d=`${r}s`)=>`${e} ${e===1?r:d}`,I=e=>e?new Date(e).toISOString().slice(0,10):"",N=5;function U(e,r,d){const c=[],o=[e.canonical,...e.aliases].filter(Boolean);for(const n of r){if(!n?.text||!n.id||n.kind==="identity"||n.kind==="preference")continue;const s=T(n.text);o.some(m=>m&&(s===m||s.includes(` ${m} `)||s.startsWith(`${m} `)||s.endsWith(` ${m}`)))&&c.push(R({id:`${d()}`,kind:"stated",text:n.text,refs:[C({kind:"memory",id:n.id,hash:v(n.text)})],at:Number(n.updatedAt||n.createdAt)||0,confidence:Number(n.confidence)||1}))}return c}function z(e,{records:r,byId:d,cooccurring:c=[],memories:o=[],wanted:n=null,now:s=0}={}){const a=[...e.records instanceof Set?e.records:e.records||[]].map(i=>d.get(i)).filter(Boolean).sort((i,M)=>(i.date||0)-(M.date||0));if(!a.length&&!n)return null;let m=0;const k=()=>(m+=1,`c${m}`),u=[];if(a.length){const i={};for(const t of a)i[t.type]=(i[t.type]||0)+1;const M=Object.entries(i).sort((t,f)=>f[1]-t[1]).map(([t,f])=>B(f,t));u.push(R({id:k(),kind:"presence",text:`Appears in ${B(a.length,"record")} — ${M.join(", ")}.`,refs:a.slice(-A).reverse().map(x),at:s}));const g=a.find(t=>t.date),h=[...a].reverse().find(t=>t.date);g&&h&&g!==h&&u.push(R({id:k(),kind:"timeline",text:`Runs from ${I(g.date)} to ${I(h.date)} — ${g.title||"untitled"} → ${h.title||"untitled"}.`,refs:[x(g),x(h)],at:s}))}c.length&&u.push(R({id:k(),kind:"together",text:`Usually alongside ${c.slice(0,N).map(i=>i.name).join(", ")}.`,refs:a.slice(-A).map(x),at:s})),n&&u.push(R({id:k(),kind:"wanted",text:`Linked from ${B(n.recordCount,"record")} but no record carries this title.`,refs:a.slice(0,A).map(x),at:s})),u.push(...U(e,o,k));const y=u.slice(0,O),p=a.map(i=>i.date||0).filter(Boolean);return{id:X(e.key),key:e.key,kind:e.kind,subject:{name:e.name,aliases:[...e.aliases||[]]},state:"promoted",cls:"R",claims:y,records:a.slice(-H).map(i=>({id:i.id,type:i.type,title:i.title,date:i.date})),stats:{records:a.length,mentions:e.mentions,claims:y.length,first:p.length?Math.min(...p):0,last:p.length?Math.max(...p):0,wanted:!!n},createdAt:s,updatedAt:s}}function K(e=[],{memories:r=[],merges:d=null,self:c="",threshold:o=_,limit:n=w,now:s=0}={}){const a=E(e),m=new Map(a.map(t=>[t.id,t])),k=D(a),u=L(k,{merges:d,self:c}),y=b(u,{threshold:o,limit:n}),p=new Map;for(const t of y)for(const f of t.records)p.has(f)||p.set(f,[]),p.get(f).push(t.key);const i=new Map;for(const t of p.values())for(const f of t)for(const $ of t){if(f===$)continue;const l=i.get(f)||new Map;l.set($,(l.get($)||0)+1),i.set(f,l)}const M=new Map(y.map(t=>[t.key,t])),g=new Map(F(a).map(t=>[t.norm,t])),h=[];for(const t of y){const f=[...(i.get(t.key)||new Map).entries()].sort((l,S)=>S[1]-l[1]||l[0].localeCompare(S[0])).map(([l,S])=>({key:l,count:S,name:M.get(l)?.name||l})).filter(l=>l.count>1),$=z(t,{byId:m,cooccurring:f,memories:r,wanted:t.kind==="title"&&g.get(t.canonical)||null,now:s});$&&h.push($)}return h}function P(e,r=[]){const d=new Map;for(const o of E(r)){const[n,...s]=o.id.split(":");d.set(`${n}:${s.join(":")||o.id}`,v(o.text))}const c=[];for(const o of e?.claims||[])for(const n of o.refs||[]){if(n.kind==="memory")continue;const s=d.get(`${n.kind}:${n.id}`);s===void 0?c.push({claim:o.id,ref:n,resolution:"verified-but-unavailable"}):s!==n.hash&&c.push({claim:o.id,ref:n,resolution:"drifted"})}return c}export{z as deriveBrief,K as deriveBriefs,P as driftedRefs};

package/knowledge.js

@@ -1,230 +1,3 @@
-// BRIEFS — the derived layer. A statement about a SUBJECT that accumulates across records.
-//
-// Everything else ChatPanel stores is a record of an event: a chat happened, a call
-// happened, a human wrote a note. Nothing is a synthesis, so every answer is re-derived
-// from scratch, every session, forever — and a multi-agent run's findings die with the run.
-// A brief is the thing that compounds.
-//
-// FOUR INVARIANTS, and they are the whole defence (see docs/knowledge-compounding.md §5.1):
-//
-//   I-K1  Every claim cites raw. A claim with no ref is a BUG, not a weak claim — it is
-//         refused on write. Derived text can then always be checked against, or rebuilt
-//         from, the immutable records under it.
-//   I-K2  A brief is REBUILDABLE. Delete every brief and this module reconstructs them from
-//         the record store. That makes a brief a projection — the same guarantee replay()
-//         gives the event log — and it makes "rebuild all" a cache clear, not data loss.
-//   I-K3  Nothing self-promotes. `draft` is free; `promoted` needs a gate. Class-R
-//         derivations may auto-promote (a backlink is not an opinion); model-written prose
-//         may not. Unreviewed agent writing compounding into confident nonsense is the
-//         failure mode that is undetectable six months later.
-//   I-K4  Bounded, or it is a second corpus. A brief has a size ceiling and the SET of
-//         briefs has a count ceiling driven by evidence — memory.js already made this
-//         argument for memory, and the same sentence applies here.
-//
-// This phase (W1) is entirely class R: no model, no network, no clock of its own. Every
-// claim is something the corpus already states — who was present, when, what co-occurs,
-// what the user themselves told us. Prose synthesis arrives in W3, behind the gate, and
-// lands as `proposed` beside these rather than replacing them.
-//
-// WHY THIS FILE IS THE MODEL AND `knowledge-derive.js` IS THE PASS. Reading a brief and
-// BUILDING one have very different costs: reading needs the shape and the renderer, while
-// building walks the whole corpus and needs entity resolution and the maintenance passes.
-// The MV3 service worker only ever reads — it syncs stored briefs to the gateway — so
-// putting both halves in one module would have put 60 KB of derivation on its cold start
-// for code it never runs. The split is what keeps that honest rather than remembered.
-
-// From subject-name.js, not entity.js: this module is on the MV3 service worker's graph and
-// needs exactly one string function, where entity.js also carries alias resolution and merge
-// suggestion. Same argument as the knowledge/knowledge-derive split, one level down.
-import { normalizeSubject } from './subject-name.js';
-
-/** draft → proposed → promoted → archived. `promotion.js` (W3) owns the transitions. */
-export const BRIEF_STATES = Object.freeze(['draft', 'proposed', 'promoted', 'archived']);
-
-/** What a claim is derived FROM. Class R throughout this phase. */
-export const CLAIM_KINDS = Object.freeze(['presence', 'timeline', 'together', 'wanted', 'stated']);
-
-// I-K4, made concrete. A brief that grows without bound is a document, and a document
-// needs its own summary, and then nothing has been gained.
-export const MAX_CLAIMS = 12;
-export const MAX_CLAIM_REFS = 8;
-export const MAX_BRIEF_RECORDS = 200;
-export const MAX_BRIEF_CHARS = 4000;
-
-// How many co-occurring subjects a `together` claim names. Past a handful it stops being a
-// statement and becomes a tag cloud.
-const TOGETHER_LIMIT = 5;
-
-/**
- * A stable, non-cryptographic content hash, computed SYNCHRONOUSLY.
- *
- * Deliberately not SHA-256, which `store.js` uses and which is async: derivation walks
- * every record in the corpus and runs in an MV3 service worker, so a hash per record has to
- * be synchronous or the whole pass becomes a promise storm. The job here is DRIFT
- * DETECTION — "has the record this claim cites changed since the claim was made" — not
- * tamper resistance, and FNV-1a answers that exactly as well while staying pure.
- */
-export function contentHash(text) {
-  const s = String(text ?? '');
-  let h1 = 0x811c9dc5, h2 = 0x01000193;
-  for (let i = 0; i < s.length; i += 1) {
-    const c = s.charCodeAt(i);
-    h1 = Math.imul(h1 ^ c, 0x01000193) >>> 0;
-    h2 = Math.imul(h2 ^ (c + i), 0x85ebca6b) >>> 0;
-  }
-  return `f${h1.toString(16).padStart(8, '0')}${h2.toString(16).padStart(8, '0')}`;
-}
-
-/** `person:alex rivera` → `brief:person-alex-rivera`. Safe as a storage key and a URL hash. */
-export function briefId(subjectKey) {
-  const [kind, ...rest] = String(subjectKey || '').split(':');
-  const slug = normalizeSubject(rest.join(':')).replace(/\s+/g, '-').replace(/-+/g, '-');
-  if (!kind || !slug) return '';
-  // The slug is TRUNCATED, so two long subjects can share one, and it is lossy, so two
-  // kinds can too. A hash of the CANONICAL key rides along to separate them. Canonical, not
-  // raw: "Alex Rivera" and "alex  rivera" are one subject and must land on one id, or a
-  // rebuild would fork the page in two — the exact failure I-K2 exists to make impossible.
-  const canonical = `${kind}:${normalizeSubject(rest.join(':'))}`;
-  return `brief:${kind}-${slug.slice(0, 48)}-${contentHash(canonical).slice(1, 7)}`;
-}
-
-/** Records are addressed `chat:x` / `meeting:y` / `note:z` — the ref kind is the prefix. */
-function refForRecord(rec) {
-  const [kind, ...rest] = String(rec.id).split(':');
-  const id = rest.join(':') || rec.id;
-  const known = kind === 'chat' || kind === 'meeting' || kind === 'note' || kind === 'page';
-  return makeRef({ kind: known ? kind : 'result', id: known ? id : rec.id, hash: contentHash(rec.text) });
-}
-
-function claim({ id, kind, text, refs, at = 0, confidence = 1 }) {
-  return {
-    id,
-    kind,
-    text,
-    // I-K1 lives here: a claim is CONSTRUCTED with its refs, and `checkKnowledgeInvariants`
-    // refuses one that arrives without them. There is no path that writes a claim first and
-    // attaches provenance later, because that path is how provenance goes missing.
-    refs: refs.slice(0, MAX_CLAIM_REFS),
-    firstSeen: at,
-    lastConfirmed: at,
-    confidence,
-    cls: 'R', // class R — derived, not written. W3's prose claims carry 'C'.
-  };
-}
-
-const plural = (n, one, many = `${one}s`) => `${n} ${n === 1 ? one : many}`;
-const isoDay = (ms) => (ms ? new Date(ms).toISOString().slice(0, 10) : '');
-
-/**
- * The searchable body. A brief is a SOURCE, ranked by the same engine as everything else
- * (design §7.6 — no second retrieval stack), so it has to render to text like one.
- */
-export function briefToText(brief) {
-  if (!brief?.subject?.name) return '';
-  // Every collection is read DEFENSIVELY. This used to assume the shape its own deriver
-  // produces, which was true while the only caller was that deriver — and stopped being true
-  // the moment briefs started arriving from a backup file, where a field can be absent
-  // because it was written by an older build. A missing `records` threw and took the whole
-  // restore's brief section with it.
-  const L = [`BRIEF: ${brief.subject.name}`];
-  const aliases = brief.subject.aliases;
-  if (Array.isArray(aliases) && aliases.length) L.push(`Also known as: ${aliases.join(', ')}`);
-  L.push(`Kind: ${brief.kind || 'topic'}`);
-  L.push('');
-  for (const c of brief.claims || []) {
-    if (!c?.text) continue;
-    L.push(`- ${c.supersededBy ? '[superseded] ' : ''}${c.text}`);
-    const refs = Array.isArray(c.refs) ? c.refs : [];
-    if (refs.length) L.push(`  (${refs.map((r) => `${r.kind}:${r.id}`).join(', ')})`);
-  }
-  const records = Array.isArray(brief.records) ? brief.records : [];
-  if (records.length) {
-    L.push('', 'RECORDS:');
-    for (const r of records.slice(-40).reverse()) L.push(`- ${r.type}: ${r.title || 'untitled'}`);
-  }
-  return L.join('\n').slice(0, MAX_BRIEF_CHARS);
-}
-
-/**
- * The inverse of `briefToText` — a brief's claims and refs read back out of the text form.
- *
- * Exists because the warm store holds RECORDS: `{ id, title, type, date, text }`, nothing
- * else. Briefs cross to the gateway as that shape, so an agent asking `get_brief` over MCP
- * can only be handed structure if the text form is stable enough to parse. It is: this
- * module writes both ends, and the claim line (`- text`) followed by its refs
- * (`  (kind:id, kind:id)`) is a grammar, not a rendering. Round-trips in the tests.
- *
- * Returns `null` for text that is not a brief, so a caller can tell "not a brief" from
- * "a brief with no claims".
- */
-export function parseBriefText(text) {
-  const lines = String(text ?? '').split('\n');
-  if (!/^BRIEF: /.test(lines[0] || '')) return null;
-  const out = { name: lines[0].slice('BRIEF: '.length).trim(), aliases: [], kind: '', claims: [], records: [] };
-  let section = 'head';
-  for (let i = 1; i < lines.length; i += 1) {
-    const line = lines[i];
-    if (section === 'head') {
-      if (line.startsWith('Also known as: ')) out.aliases = line.slice(15).split(',').map((a) => a.trim()).filter(Boolean);
-      else if (line.startsWith('Kind: ')) out.kind = line.slice(6).trim();
-      else if (line === '') section = 'claims';
-      continue;
-    }
-    if (line === 'RECORDS:') { section = 'records'; continue; }
-    if (section === 'claims' && line.startsWith('- ')) {
-      const claim = { text: line.slice(2), refs: [] };
-      const next = lines[i + 1] || '';
-      const m = /^  \((.*)\)$/.exec(next);
-      if (m) {
-        claim.refs = m[1].split(', ').map((r) => {
-          const idx = r.indexOf(':');
-          return idx > 0 ? { kind: r.slice(0, idx), id: r.slice(idx + 1) } : null;
-        }).filter(Boolean);
-        i += 1;
-      }
-      out.claims.push(claim);
-    } else if (section === 'records' && line.startsWith('- ')) {
-      const idx = line.indexOf(': ');
-      out.records.push(idx > 0 ? { type: line.slice(2, idx), title: line.slice(idx + 2) } : { type: '', title: line.slice(2) });
-    }
-  }
-  return out;
-}
-
-/** The other briefs this brief's accepted claims link to — the backlink graph's edges. */
-export function briefLinks(brief) {
-  const out = new Set();
-  for (const c of brief?.claims || []) for (const r of c.refs || []) if (r.kind === 'brief' && r.id) out.add(r.id);
-  return [...out];
-}
-
-/** Terms the graph and the search index rank a brief by — its subject and its neighbours. */
-export function briefTerms(brief) {
-  if (!brief) return [];
-  const together = brief.claims.find((c) => c.kind === 'together');
-  const names = together ? together.text.replace(/^Usually alongside /, '').replace(/\.$/, '').split(', ') : [];
-  return [...new Set([brief.subject.name, ...(brief.subject.aliases || []), ...names])].filter(Boolean);
-}
-
-/**
- * The invariants, as a check rather than a promise. Returns the failures; empty means clean.
- * Same shape as `invariants.js checkInvariants()`, for the same reason: an invariant nobody
- * can run is a comment.
- */
-export function checkKnowledgeInvariants(brief) {
-  const fail = [];
-  if (!brief || typeof brief !== 'object') return [{ invariant: 'I-K1', detail: 'not a brief' }];
-  if (!BRIEF_STATES.includes(brief.state)) fail.push({ invariant: 'I-K3', detail: `unknown state ${brief.state}` });
-  if (brief.state === 'promoted' && brief.cls === 'C') {
-    fail.push({ invariant: 'I-K3', detail: 'model-written prose cannot be promoted without the gate' });
-  }
-  for (const c of brief.claims || []) {
-    if (!c.refs?.length) fail.push({ invariant: 'I-K1', detail: `claim ${c.id} cites nothing` });
-    if (!CLAIM_KINDS.includes(c.kind) && c.cls !== 'C') {
-      fail.push({ invariant: 'I-K1', detail: `claim ${c.id} has unknown kind ${c.kind}` });
-    }
-  }
-  if ((brief.claims || []).length > MAX_CLAIMS) fail.push({ invariant: 'I-K4', detail: `${brief.claims.length} claims exceeds ${MAX_CLAIMS}` });
-  if (briefToText(brief).length >= MAX_BRIEF_CHARS) fail.push({ invariant: 'I-K4', detail: 'brief text is at the ceiling' });
-  return fail;
-}
+import{normalizeSubject as d}from"./subject-name.js";const m=Object.freeze(["draft","proposed","promoted","archived"]),x=Object.freeze(["presence","timeline","together","wanted","stated"]),u=12,g=8,I=200,f=4e3,k=5;function p(e){const t=String(e??"");let n=2166136261,s=16777619;for(let i=0;i<t.length;i+=1){const o=t.charCodeAt(i);n=Math.imul(n^o,16777619)>>>0,s=Math.imul(s^o+i,2246822507)>>>0}return`f${n.toString(16).padStart(8,"0")}${s.toString(16).padStart(8,"0")}`}function A(e){const[t,...n]=String(e||"").split(":"),s=d(n.join(":")).replace(/\s+/g,"-").replace(/-+/g,"-");if(!t||!s)return"";const i=`${t}:${d(n.join(":"))}`;return`brief:${t}-${s.slice(0,48)}-${p(i).slice(1,7)}`}function R(e){const[t,...n]=String(e.id).split(":"),s=n.join(":")||e.id,i=t==="chat"||t==="meeting"||t==="note"||t==="page";return makeRef({kind:i?t:"result",id:i?s:e.id,hash:p(e.text)})}function j({id:e,kind:t,text:n,refs:s,at:i=0,confidence:o=1}){return{id:e,kind:t,text:n,refs:s.slice(0,g),firstSeen:i,lastConfirmed:i,confidence:o,cls:"R"}}const y=(e,t,n=`${t}s`)=>`${e} ${e===1?t:n}`,E=e=>e?new Date(e).toISOString().slice(0,10):"";function $(e){if(!e?.subject?.name)return"";const t=[`BRIEF: ${e.subject.name}`],n=e.subject.aliases;Array.isArray(n)&&n.length&&t.push(`Also known as: ${n.join(", ")}`),t.push(`Kind: ${e.kind||"topic"}`),t.push("");for(const i of e.claims||[]){if(!i?.text)continue;t.push(`- ${i.supersededBy?"[superseded] ":""}${i.text}`);const o=Array.isArray(i.refs)?i.refs:[];o.length&&t.push(`  (${o.map(r=>`${r.kind}:${r.id}`).join(", ")})`)}const s=Array.isArray(e.records)?e.records:[];if(s.length){t.push("","RECORDS:");for(const i of s.slice(-40).reverse())t.push(`- ${i.type}: ${i.title||"untitled"}`)}return t.join(`
+`).slice(0,f)}function w(e){const t=String(e??"").split(`
+`);if(!/^BRIEF: /.test(t[0]||""))return null;const n={name:t[0].slice(7).trim(),aliases:[],kind:"",claims:[],records:[]};let s="head";for(let i=1;i<t.length;i+=1){const o=t[i];if(s==="head"){o.startsWith("Also known as: ")?n.aliases=o.slice(15).split(",").map(r=>r.trim()).filter(Boolean):o.startsWith("Kind: ")?n.kind=o.slice(6).trim():o===""&&(s="claims");continue}if(o==="RECORDS:"){s="records";continue}if(s==="claims"&&o.startsWith("- ")){const r={text:o.slice(2),refs:[]},h=t[i+1]||"",l=/^  \((.*)\)$/.exec(h);l&&(r.refs=l[1].split(", ").map(c=>{const a=c.indexOf(":");return a>0?{kind:c.slice(0,a),id:c.slice(a+1)}:null}).filter(Boolean),i+=1),n.claims.push(r)}else if(s==="records"&&o.startsWith("- ")){const r=o.indexOf(": ");n.records.push(r>0?{type:o.slice(2,r),title:o.slice(r+2)}:{type:"",title:o.slice(2)})}}return n}function B(e){const t=new Set;for(const n of e?.claims||[])for(const s of n.refs||[])s.kind==="brief"&&s.id&&t.add(s.id);return[...t]}function C(e){if(!e)return[];const t=e.claims.find(s=>s.kind==="together"),n=t?t.text.replace(/^Usually alongside /,"").replace(/\.$/,"").split(", "):[];return[...new Set([e.subject.name,...e.subject.aliases||[],...n])].filter(Boolean)}function K(e){const t=[];if(!e||typeof e!="object")return[{invariant:"I-K1",detail:"not a brief"}];m.includes(e.state)||t.push({invariant:"I-K3",detail:`unknown state ${e.state}`}),e.state==="promoted"&&e.cls==="C"&&t.push({invariant:"I-K3",detail:"model-written prose cannot be promoted without the gate"});for(const n of e.claims||[])n.refs?.length||t.push({invariant:"I-K1",detail:`claim ${n.id} cites nothing`}),!x.includes(n.kind)&&n.cls!=="C"&&t.push({invariant:"I-K1",detail:`claim ${n.id} has unknown kind ${n.kind}`});return(e.claims||[]).length>u&&t.push({invariant:"I-K4",detail:`${e.claims.length} claims exceeds ${u}`}),$(e).length>=f&&t.push({invariant:"I-K4",detail:"brief text is at the ceiling"}),t}export{m as BRIEF_STATES,x as CLAIM_KINDS,f as MAX_BRIEF_CHARS,I as MAX_BRIEF_RECORDS,u as MAX_CLAIMS,g as MAX_CLAIM_REFS,A as briefId,B as briefLinks,C as briefTerms,$ as briefToText,K as checkKnowledgeInvariants,p as contentHash,w as parseBriefText};