@tangle-network/agent-knowledge 6.0.0 → 6.1.0

package/dist/sources/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}
+{"version":3,"file":"index.js","names":["BASE_URL","extractTitle"],"sources":["../../src/sources/html.ts","../../src/sources/http.ts","../../src/sources/cornell-lii.ts","../../src/sources/irs-publications.ts","../../src/sources/state-sos.ts"],"sourcesContent":["/**\n * Minimal HTML helpers used by the shipped sources.\n *\n * Deliberately not a full DOM parser: every authority we ship against\n * (Cornell LII, IRS.gov, state SOS portals) has well-behaved server-rendered\n * HTML where regex-based extraction is correct and cheap. Bringing in cheerio\n * would add a 1.5MB dependency to a package whose purpose is shipping\n * primitives, not parsing arbitrary web pages.\n *\n * If a future source needs real DOM traversal, it should depend on its own\n * parser locally rather than promoting one into the package-wide deps.\n *\n * @stable\n */\n\n/**\n * Strip HTML tags, collapse whitespace, decode common entities.\n *\n * Preserves paragraph and line breaks (`</p>`, `<br>`, `</li>`, `</div>`,\n * `</h*>`) as `\\n` so statute text retains its subsection structure.\n */\nexport function htmlToText(html: string): string {\n  return html\n    .replace(/<script[\\s\\S]*?<\\/script>/gi, '')\n    .replace(/<style[\\s\\S]*?<\\/style>/gi, '')\n    .replace(/<noscript[\\s\\S]*?<\\/noscript>/gi, '')\n    .replace(/<!--([\\s\\S]*?)-->/g, '')\n    .replace(/<\\s*br\\s*\\/?>/gi, '\\n')\n    .replace(/<\\/(p|li|div|tr|h[1-6]|blockquote|section|article)>/gi, '\\n')\n    .replace(/<[^>]+>/g, '')\n    .replace(/&nbsp;/gi, ' ')\n    .replace(/&amp;/gi, '&')\n    .replace(/&lt;/gi, '<')\n    .replace(/&gt;/gi, '>')\n    .replace(/&quot;/gi, '\"')\n    .replace(/&#39;/gi, \"'\")\n    .replace(/&sect;/gi, '§')\n    .replace(/&mdash;/gi, '—')\n    .replace(/&ndash;/gi, '–')\n    .replace(/&#(\\d+);/g, (_, code) => String.fromCodePoint(Number(code)))\n    .replace(/&#x([0-9a-f]+);/gi, (_, code) => String.fromCodePoint(Number.parseInt(code, 16)))\n    .split('\\n')\n    .map((line) => line.replace(/[\\t  ]+/g, ' ').trim())\n    .filter((line, idx, all) => !(line === '' && all[idx - 1] === ''))\n    .join('\\n')\n    .trim()\n}\n\n/** Extract the first match of a regex's first capture group, or undefined. */\nexport function firstMatch(html: string, pattern: RegExp): string | undefined {\n  return pattern.exec(html)?.[1]?.trim()\n}\n\n/** Extract the inner HTML of the first matching tag with id `id`. */\nexport function innerHtmlById(html: string, id: string): string | undefined {\n  const escaped = id.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&')\n  const tagPattern = new RegExp(\n    `<([a-z][a-z0-9]*)\\\\b[^>]*\\\\sid=[\"']${escaped}[\"'][^>]*>([\\\\s\\\\S]*?)<\\\\/\\\\1>`,\n    'i',\n  )\n  return tagPattern.exec(html)?.[2]\n}\n\n/**\n * Extract every (href, text) pair matching the URL regex.\n * Returns absolute URLs by resolving against `baseUrl`.\n */\nexport function extractLinks(\n  html: string,\n  hrefPattern: RegExp,\n  baseUrl: string,\n): { href: string; text: string }[] {\n  const out: { href: string; text: string }[] = []\n  const anchor = /<a\\b[^>]*\\shref=[\"']([^\"']+)[\"'][^>]*>([\\s\\S]*?)<\\/a>/gi\n  for (const match of html.matchAll(anchor)) {\n    const href = match[1]\n    const inner = match[2]\n    if (!href || !inner) continue\n    if (!hrefPattern.test(href)) continue\n    const text = htmlToText(inner)\n    if (!text) continue\n    try {\n      out.push({ href: new URL(href, baseUrl).toString(), text })\n    } catch {\n      /* skip malformed URL */\n    }\n  }\n  return out\n}\n","import { mkdir, readFile, stat, writeFile } from 'node:fs/promises'\nimport { dirname, join } from 'node:path'\nimport { sha256 } from '../ids'\n\n/**\n * Polite HTTP fetcher shared by remote sources.\n *\n * Independent sources share a per-origin throttle because rate-limited sites\n * may return block pages instead of 429 responses. Responses are cached by URL\n * because many publishers omit reliable ETag and Last-Modified headers. Bodies\n * are checked even after a 2xx response because captcha and block pages often\n * use successful status codes.\n */\n\n/** User-Agent string sent on every outbound request. */\nexport const POLITE_USER_AGENT =\n  'agent-knowledge (+https://github.com/tangle-network/agent-knowledge)'\n\n/** Minimum gap between successive requests to the same origin (ms). */\nexport const MIN_REQUEST_GAP_MS = 1_000\n\n/** Maximum response body we will buffer in memory (bytes). */\nexport const MAX_RESPONSE_BYTES = 8 * 1024 * 1024\n\nconst hostThrottle = new Map<string, Promise<void>>()\n\nexport interface PoliteFetchOptions {\n  signal?: AbortSignal\n  cacheDir?: string\n  /**\n   * Cache age beyond which we re-fetch. Default 1 hour, long enough to\n   * batch a cron sweep across many selectors, short enough that hourly\n   * authoritative-page changes get picked up next tick.\n   */\n  cacheTtlMs?: number\n  /**\n   * Extra request headers. The fetcher always sets `User-Agent` and\n   * `Accept`; callers can add `Accept-Language` etc.\n   */\n  headers?: Record<string, string>\n}\n\nexport interface PoliteFetchResult {\n  url: string\n  status: number\n  /** Decoded UTF-8 body. Truncated to `MAX_RESPONSE_BYTES`. */\n  body: string\n  /**\n   * Best-effort source-attested timestamp. Reads `Last-Modified`,\n   * falling back to `Date`, falling back to fetch time. Always ISO 8601.\n   */\n  sourceUpdatedAt: string\n  fetchedAt: string\n  /** True iff the response was satisfied from disk cache. */\n  fromCache: boolean\n  /**\n   * False on: non-2xx status, captcha/block page heuristic match, or\n   * decoded body below 200 chars from a host known to serve real content\n   * (Cornell, IRS, state SOS). `unverifiableReason` carries the why.\n   */\n  verifiable: boolean\n  unverifiableReason?: string\n}\n\n/**\n * Fetch one URL with per-host throttling, on-disk cache, and block-page\n * detection. Never throws on network/HTTP failure. It returns a result with\n * `verifiable: false` and `unverifiableReason` set so the caller can decide\n * whether to skip, retry, or surface.\n *\n * Throws ONLY on `AbortError` (caller asked to stop) and on cache-write\n * failures that indicate a misconfigured filesystem.\n */\nexport async function politeFetch(\n  url: string,\n  options: PoliteFetchOptions = {},\n): Promise<PoliteFetchResult> {\n  const cacheTtl = options.cacheTtlMs ?? 60 * 60 * 1000\n  const cached = options.cacheDir ? await readCache(options.cacheDir, url, cacheTtl) : undefined\n  if (cached) return cached\n\n  const host = safeHost(url)\n  await throttleHost(host)\n\n  const fetchedAt = new Date().toISOString()\n  let response: Response\n  try {\n    response = await fetch(url, {\n      signal: options.signal,\n      redirect: 'follow',\n      headers: {\n        'User-Agent': POLITE_USER_AGENT,\n        Accept: 'text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8',\n        'Accept-Language': 'en-US,en;q=0.9',\n        ...(options.headers ?? {}),\n      },\n    })\n  } catch (error) {\n    if ((error as { name?: string }).name === 'AbortError') throw error\n    const result: PoliteFetchResult = {\n      url,\n      status: 0,\n      body: '',\n      sourceUpdatedAt: fetchedAt,\n      fetchedAt,\n      fromCache: false,\n      verifiable: false,\n      unverifiableReason: `network error: ${(error as Error).message}`,\n    }\n    if (options.cacheDir) await writeCache(options.cacheDir, url, result)\n    return result\n  }\n\n  const text = await readBoundedText(response)\n  const lastModified = response.headers.get('last-modified')\n  const dateHeader = response.headers.get('date')\n  const sourceUpdatedAt = parseHttpDate(lastModified) ?? parseHttpDate(dateHeader) ?? fetchedAt\n\n  const result: PoliteFetchResult = {\n    url,\n    status: response.status,\n    body: text,\n    sourceUpdatedAt,\n    fetchedAt,\n    fromCache: false,\n    verifiable: true,\n  }\n\n  if (response.status < 200 || response.status >= 300) {\n    result.verifiable = false\n    result.unverifiableReason = `non-2xx status: ${response.status}`\n  } else if (looksLikeBlockPage(text)) {\n    result.verifiable = false\n    result.unverifiableReason = 'block-page heuristic matched'\n  } else if (text.length < 200 && knownLargeAuthority(host)) {\n    result.verifiable = false\n    result.unverifiableReason = `body shorter than expected (${text.length} chars)`\n  }\n\n  if (options.cacheDir) await writeCache(options.cacheDir, url, result)\n  return result\n}\n\n/** Reset the in-process throttle map. Test-only. */\nexport function __resetHttpThrottle(): void {\n  hostThrottle.clear()\n}\n\nfunction safeHost(url: string): string {\n  try {\n    return new URL(url).host\n  } catch {\n    return 'unknown'\n  }\n}\n\nasync function throttleHost(host: string): Promise<void> {\n  const prev = hostThrottle.get(host) ?? Promise.resolve()\n  let release: () => void = () => {}\n  const next = new Promise<void>((resolve) => {\n    release = resolve\n  })\n  hostThrottle.set(\n    host,\n    prev.then(() => next),\n  )\n  await prev\n  setTimeout(release, MIN_REQUEST_GAP_MS)\n}\n\nasync function readBoundedText(response: Response): Promise<string> {\n  if (!response.body) return ''\n  const reader = response.body.getReader()\n  const chunks: Uint8Array[] = []\n  let total = 0\n  while (true) {\n    const { done, value } = await reader.read()\n    if (done) break\n    if (!value) continue\n    total += value.length\n    if (total > MAX_RESPONSE_BYTES) {\n      // Stop reading; release the underlying connection.\n      await reader.cancel()\n      break\n    }\n    chunks.push(value)\n  }\n  const merged = new Uint8Array(Math.min(total, MAX_RESPONSE_BYTES))\n  let offset = 0\n  for (const chunk of chunks) {\n    const take = Math.min(chunk.length, merged.length - offset)\n    if (take <= 0) break\n    merged.set(chunk.subarray(0, take), offset)\n    offset += take\n  }\n  return new TextDecoder('utf-8', { fatal: false }).decode(merged)\n}\n\nfunction parseHttpDate(value: string | null): string | undefined {\n  if (!value) return undefined\n  const ms = Date.parse(value)\n  return Number.isFinite(ms) ? new Date(ms).toISOString() : undefined\n}\n\n/** Cheap heuristic that catches CAPTCHA, WAF block pages, and \"Just a moment\" interstitials. */\nexport function looksLikeBlockPage(body: string): boolean {\n  if (!body) return false\n  const lower = body.toLowerCase()\n  const markers = [\n    'verify you are human',\n    'please enable javascript and cookies',\n    'just a moment',\n    'access denied',\n    'request unsuccessful',\n    'cf-error-details',\n    'captcha',\n    'incapsula',\n    'pardon our interruption',\n  ]\n  for (const marker of markers) {\n    if (lower.includes(marker)) return true\n  }\n  return false\n}\n\nfunction knownLargeAuthority(host: string): boolean {\n  return (\n    host.endsWith('law.cornell.edu') ||\n    host.endsWith('irs.gov') ||\n    host.endsWith('sos.ca.gov') ||\n    host.endsWith('sos.state.tx.us') ||\n    host.endsWith('sos.state.us')\n  )\n}\n\nfunction cachePath(cacheDir: string, url: string): string {\n  const key = sha256(url)\n  return join(cacheDir, 'http', `${key.slice(0, 2)}`, `${key}.json`)\n}\n\nasync function readCache(\n  cacheDir: string,\n  url: string,\n  ttlMs: number,\n): Promise<PoliteFetchResult | undefined> {\n  const path = cachePath(cacheDir, url)\n  try {\n    const info = await stat(path)\n    if (Date.now() - info.mtimeMs > ttlMs) return undefined\n    const raw = await readFile(path, 'utf8')\n    const parsed = JSON.parse(raw) as PoliteFetchResult\n    return { ...parsed, fromCache: true }\n  } catch {\n    return undefined\n  }\n}\n\nasync function writeCache(cacheDir: string, url: string, value: PoliteFetchResult): Promise<void> {\n  const path = cachePath(cacheDir, url)\n  await mkdir(dirname(path), { recursive: true })\n  await writeFile(path, JSON.stringify(value), 'utf8')\n}\n","import { sha256 } from '../ids'\nimport { htmlToText, innerHtmlById } from './html'\nimport { politeFetch } from './http'\nimport type { FetchOpts, KnowledgeFragment, KnowledgeSource } from './types'\n\n/**\n * Cornell Legal Information Institute (LII) source.\n *\n * Pulls federal US Code sections and Wex encyclopedia entries — the two\n * Cornell LII surfaces an agent typically grounds against. The Wex\n * \"non-compete\" page is the canonical test case for the Ryan-LLC v. FTC\n * vacatur drift the continuous-ingestion story is designed to catch.\n *\n * @stable\n */\n\nconst BASE_URL = 'https://www.law.cornell.edu'\n\nexport interface CornellLiiSelector {\n  /** Either 'uscode' or 'wex'. */\n  kind: 'uscode' | 'wex'\n  /**\n   * For `uscode`: `<title>/<section>` (e.g. `'18/1836'` for DTSA).\n   * For `wex`: the slug (e.g. `'non-compete'`).\n   */\n  path: string\n  /**\n   * Optional pre-declared eval dimensions affected by this section. If\n   * omitted, defaults are chosen from `kind` + path heuristics.\n   */\n  dimensionHints?: string[]\n}\n\nexport interface CornellLiiSourceOptions {\n  /**\n   * Selectors to fetch on each `fetch()` call. The caller (a per-tenant\n   * workspace config, typically) lists exactly the authorities they need\n   * tracked. There is no auto-discovery; that would crawl Cornell at\n   * cron speed, which is what the polite-fetch contract exists to avoid.\n   */\n  selectors: CornellLiiSelector[]\n  /** Source id override; default is `'cornell-lii'`. */\n  id?: string\n}\n\n/**\n * Build a Cornell LII source for the listed selectors.\n *\n * Example: track DTSA + non-compete:\n * ```\n * createCornellLiiSource({\n *   selectors: [\n *     { kind: 'uscode', path: '18/1836' },\n *     { kind: 'wex', path: 'non-compete', dimensionHints: ['jurisdictional_accuracy'] },\n *   ],\n * })\n * ```\n */\nexport function createCornellLiiSource(options: CornellLiiSourceOptions): KnowledgeSource {\n  const id = options.id ?? 'cornell-lii'\n  return {\n    id,\n    name: 'Cornell Legal Information Institute',\n    description:\n      'Federal US Code sections (uscode/text/...) and Wex legal encyclopedia entries from law.cornell.edu.',\n    async fetch(opts: FetchOpts): Promise<KnowledgeFragment[]> {\n      const limit = opts.limit ?? options.selectors.length\n      const selectors = options.selectors.slice(0, limit)\n      const out: KnowledgeFragment[] = []\n      for (const selector of selectors) {\n        out.push(await fetchOne(id, selector, opts))\n      }\n      return out\n    },\n  }\n}\n\nasync function fetchOne(\n  sourceId: string,\n  selector: CornellLiiSelector,\n  opts: FetchOpts,\n): Promise<KnowledgeFragment> {\n  const path = selector.path.replace(/^\\/+/, '')\n  const url =\n    selector.kind === 'uscode' ? `${BASE_URL}/uscode/text/${path}` : `${BASE_URL}/wex/${path}`\n\n  const response = await politeFetch(url, {\n    signal: opts.signal,\n    cacheDir: opts.cacheDir,\n  })\n\n  const fragmentId = `${selector.kind}:${selector.path}`\n  const dimensionHints = selector.dimensionHints ?? defaultDimensionHints(selector)\n\n  if (!response.verifiable) {\n    return {\n      id: fragmentId,\n      title: `Cornell LII ${selector.kind} ${selector.path}`,\n      body: '',\n      bodyHash: sha256(''),\n      provenance: {\n        url,\n        sourceUpdatedAt: response.sourceUpdatedAt,\n        fetchedAt: response.fetchedAt,\n        jurisdiction: 'US-FED',\n        verifiable: false,\n        unverifiableReason: response.unverifiableReason,\n      },\n      dimensionHints,\n      metadata: { sourceId, status: response.status, fromCache: response.fromCache },\n    }\n  }\n\n  const html = response.body\n  const title = extractTitle(html, selector)\n  const body = extractBody(html, selector)\n  const effective = extractEffectiveDate(html) ?? response.sourceUpdatedAt\n\n  const verifiable = body.length > 50\n  return {\n    id: fragmentId,\n    title,\n    body,\n    bodyHash: sha256(body),\n    provenance: {\n      url,\n      sourceUpdatedAt: effective,\n      fetchedAt: response.fetchedAt,\n      jurisdiction: 'US-FED',\n      verifiable,\n      unverifiableReason: verifiable ? undefined : 'extracted body too short',\n    },\n    dimensionHints,\n    metadata: { sourceId, status: response.status, fromCache: response.fromCache },\n  }\n}\n\nfunction extractTitle(html: string, selector: CornellLiiSelector): string {\n  const h1 = /<h1[^>]*\\bid=[\"']page_title[\"'][^>]*>([\\s\\S]*?)<\\/h1>/i.exec(html)?.[1]\n  if (h1) return htmlToText(h1)\n  const t = /<title>([\\s\\S]*?)<\\/title>/i.exec(html)?.[1]\n  if (t) return htmlToText(t).split(' | ')[0] ?? `Cornell LII ${selector.path}`\n  return `Cornell LII ${selector.kind} ${selector.path}`\n}\n\nfunction extractBody(html: string, selector: CornellLiiSelector): string {\n  if (selector.kind === 'uscode') {\n    // The statute text lives inside a <text><div class=\"text\">…</div></text>\n    // block on US Code section pages. Prefer it; fall back to #tab_default_1\n    // which always contains the section body.\n    const text = /<text>([\\s\\S]*?)<\\/text>/i.exec(html)?.[1]\n    if (text) return htmlToText(text)\n    const tab = innerHtmlById(html, 'tab_default_1')\n    if (tab) return htmlToText(tab)\n  }\n  // Wex pages wrap the encyclopedia entry under <div id=\"main-content\"> (newer\n  // Drupal template) or directly inside <div id=\"extracted-content\"> (older\n  // template). Try both — lazy regex matching against a nested-div container\n  // returns the wrong (shorter) slice, so we anchor on the leaf containers.\n  const mainContent = innerHtmlById(html, 'main-content')\n  if (mainContent) {\n    return htmlToText(mainContent.replace(/<h1[\\s\\S]*?<\\/h1>/i, ''))\n  }\n  const extracted = innerHtmlById(html, 'extracted-content')\n  if (extracted) {\n    return htmlToText(extracted.replace(/<h1[\\s\\S]*?<\\/h1>/i, ''))\n  }\n  return htmlToText(html)\n}\n\nfunction extractEffectiveDate(html: string): string | undefined {\n  // Cornell LII includes \"Editorial Notes\" / \"Amendments\" blocks with\n  // dates; the most reliable machine-readable signal is the last\n  // amendment year embedded near the section text.\n  const amend = /Amendments[\\s\\S]{0,200}?(\\d{4})/i.exec(html)?.[1]\n  if (amend) {\n    const y = Number.parseInt(amend, 10)\n    if (Number.isFinite(y) && y > 1900 && y <= new Date().getUTCFullYear() + 1) {\n      return new Date(Date.UTC(y, 11, 31)).toISOString()\n    }\n  }\n  return undefined\n}\n\nfunction defaultDimensionHints(selector: CornellLiiSelector): string[] {\n  if (selector.kind === 'uscode') return ['jurisdictional_accuracy', 'citation_hygiene']\n  return ['citation_hygiene']\n}\n","import { sha256 } from '../ids'\nimport { htmlToText } from './html'\nimport { politeFetch } from './http'\nimport type { FetchOpts, KnowledgeFragment, KnowledgeSource } from './types'\n\n/**\n * IRS publications source.\n *\n * Two surfaces:\n *\n *   1. The publications index at https://www.irs.gov/publications enumerates\n *      every active publication with its revision year — a single fragment\n *      with the full table lets change detection notice when a publication\n *      year flips (e.g. Pub 15 (2025) → Pub 15 (2026)).\n *\n *   2. Individual publication landing pages at /publications/p<N>[<suffix>]\n *      return one fragment per publication with summary text. Callers list\n *      the publications they need tracked via `selectors`.\n *\n * Revenue procedures are fetched under their numbered URLs; the IRS does\n * not maintain a stable HTML index of rev-procs, so the caller passes the\n * specific rev-proc paths they care about.\n *\n * @stable\n */\n\nconst BASE_URL = 'https://www.irs.gov'\nconst INDEX_URL = `${BASE_URL}/publications`\n\nexport interface IrsPublicationsSourceOptions {\n  /**\n   * Specific publication slugs to fetch (e.g. `['p15', 'p17', 'p463']`).\n   * When `includeIndex` is true (default), the publications index page is\n   * also fetched as a single fragment so change detection can notice\n   * year/revision shifts across the whole catalogue.\n   */\n  publications?: string[]\n  /**\n   * Revenue procedure paths to fetch (e.g. `['/irb/2024-31_IRB']`). The\n   * caller passes the exact path; this source does not auto-discover.\n   */\n  revenueProcedures?: string[]\n  includeIndex?: boolean\n  id?: string\n}\n\n/** Default eval dimensions for IRS-sourced fragments. */\nexport const IRS_DIMENSION_HINTS = ['tax_compliance', 'regulatory_currency', 'citation_hygiene']\n\nexport function createIrsPublicationsSource(\n  options: IrsPublicationsSourceOptions = {},\n): KnowledgeSource {\n  const id = options.id ?? 'irs-publications'\n  const includeIndex = options.includeIndex ?? true\n  return {\n    id,\n    name: 'IRS Publications',\n    description:\n      'Internal Revenue Service publications index and individual publication landing pages from irs.gov.',\n    async fetch(opts: FetchOpts): Promise<KnowledgeFragment[]> {\n      const out: KnowledgeFragment[] = []\n      const limit = opts.limit ?? Number.POSITIVE_INFINITY\n\n      if (includeIndex && out.length < limit) {\n        out.push(await fetchIndex(id, opts))\n      }\n      for (const slug of options.publications ?? []) {\n        if (out.length >= limit) break\n        out.push(await fetchPublication(id, slug, opts))\n      }\n      for (const path of options.revenueProcedures ?? []) {\n        if (out.length >= limit) break\n        out.push(await fetchRevenueProcedure(id, path, opts))\n      }\n      return out\n    },\n  }\n}\n\nasync function fetchIndex(sourceId: string, opts: FetchOpts): Promise<KnowledgeFragment> {\n  const response = await politeFetch(INDEX_URL, { signal: opts.signal, cacheDir: opts.cacheDir })\n  const tablePattern = /<table[\\s\\S]*?<\\/table>/gi\n  const matches = response.body.match(tablePattern) ?? []\n  // Extract the table that lists current-year publications. IRS publishes\n  // one table per year on the index; the most recent table is always the\n  // first that mentions a year ≥ current.\n  const tables = matches.map((t) => htmlToText(t))\n  const body = tables\n    .filter((t) => /Publication\\s*\\d+/i.test(t))\n    .join('\\n\\n')\n    .slice(0, 200_000)\n\n  const verifiable = response.verifiable && body.length > 200\n  return {\n    id: 'index',\n    title: 'IRS Publications Index',\n    body,\n    bodyHash: sha256(body),\n    provenance: {\n      url: INDEX_URL,\n      sourceUpdatedAt: response.sourceUpdatedAt,\n      fetchedAt: response.fetchedAt,\n      jurisdiction: 'US-FED',\n      verifiable,\n      unverifiableReason:\n        response.unverifiableReason ?? (verifiable ? undefined : 'no publication rows extracted'),\n    },\n    dimensionHints: IRS_DIMENSION_HINTS,\n    metadata: { sourceId, status: response.status, fromCache: response.fromCache, kind: 'index' },\n  }\n}\n\nasync function fetchPublication(\n  sourceId: string,\n  slug: string,\n  opts: FetchOpts,\n): Promise<KnowledgeFragment> {\n  const url = `${BASE_URL}/publications/${slug.replace(/^\\/+/, '')}`\n  const response = await politeFetch(url, { signal: opts.signal, cacheDir: opts.cacheDir })\n\n  const title = extractTitle(response.body, `IRS Publication ${slug}`)\n  const body = extractMainContent(response.body)\n  const verifiable = response.verifiable && body.length > 200\n\n  return {\n    id: `publication:${slug}`,\n    title,\n    body,\n    bodyHash: sha256(body),\n    provenance: {\n      url,\n      sourceUpdatedAt: extractRevisionDate(response.body) ?? response.sourceUpdatedAt,\n      fetchedAt: response.fetchedAt,\n      jurisdiction: 'US-FED',\n      verifiable,\n      unverifiableReason:\n        response.unverifiableReason ?? (verifiable ? undefined : 'no publication body extracted'),\n    },\n    dimensionHints: IRS_DIMENSION_HINTS,\n    metadata: {\n      sourceId,\n      status: response.status,\n      fromCache: response.fromCache,\n      kind: 'publication',\n      slug,\n    },\n  }\n}\n\nasync function fetchRevenueProcedure(\n  sourceId: string,\n  path: string,\n  opts: FetchOpts,\n): Promise<KnowledgeFragment> {\n  const url = `${BASE_URL}${path.startsWith('/') ? path : `/${path}`}`\n  const response = await politeFetch(url, { signal: opts.signal, cacheDir: opts.cacheDir })\n  const body = extractMainContent(response.body)\n  const verifiable = response.verifiable && body.length > 200\n  return {\n    id: `rev-proc:${path}`,\n    title: extractTitle(response.body, `IRS Revenue Procedure ${path}`),\n    body,\n    bodyHash: sha256(body),\n    provenance: {\n      url,\n      sourceUpdatedAt: response.sourceUpdatedAt,\n      fetchedAt: response.fetchedAt,\n      jurisdiction: 'US-FED',\n      verifiable,\n      unverifiableReason:\n        response.unverifiableReason ??\n        (verifiable ? undefined : 'no revenue-procedure body extracted'),\n    },\n    dimensionHints: [...IRS_DIMENSION_HINTS, 'procedural_currency'],\n    metadata: {\n      sourceId,\n      status: response.status,\n      fromCache: response.fromCache,\n      kind: 'rev-proc',\n      path,\n    },\n  }\n}\n\nfunction extractTitle(html: string, fallback: string): string {\n  const og = /<meta\\s+property=[\"']og:title[\"']\\s+content=[\"']([^\"']+)[\"']/i.exec(html)?.[1]\n  if (og) return decodeHtml(og)\n  const title = /<title>([\\s\\S]*?)<\\/title>/i.exec(html)?.[1]\n  if (title) return htmlToText(title).split(' | ')[0] ?? fallback\n  return fallback\n}\n\nfunction extractMainContent(html: string): string {\n  // IRS uses Drupal — the main publication body is inside <main role=\"main\">\n  // or under .field--name-body. We try main first; on miss, body.\n  const main = /<main\\b[\\s\\S]*?<\\/main>/i.exec(html)?.[0]\n  if (main) {\n    const noNav = main\n      .replace(/<nav[\\s\\S]*?<\\/nav>/gi, '')\n      .replace(/<header[\\s\\S]*?<\\/header>/gi, '')\n      .replace(/<footer[\\s\\S]*?<\\/footer>/gi, '')\n    return htmlToText(noNav).slice(0, 200_000)\n  }\n  const body = /<body\\b[\\s\\S]*?<\\/body>/i.exec(html)?.[0]\n  return body ? htmlToText(body).slice(0, 200_000) : htmlToText(html).slice(0, 200_000)\n}\n\nfunction extractRevisionDate(html: string): string | undefined {\n  // IRS publication pages typically show \"Publication X (YYYY)\" in the title;\n  // pulling the year gives a stable revision marker.\n  const m = /Publication\\s+\\S+\\s*\\((\\d{4})\\)/i.exec(html)\n  if (m?.[1]) {\n    const year = Number.parseInt(m[1], 10)\n    if (Number.isFinite(year) && year >= 2000 && year <= new Date().getUTCFullYear() + 1) {\n      return new Date(Date.UTC(year, 0, 1)).toISOString()\n    }\n  }\n  return undefined\n}\n\nfunction decodeHtml(value: string): string {\n  return htmlToText(value)\n}\n","import { sha256 } from '../ids'\nimport { htmlToText } from './html'\nimport { politeFetch } from './http'\nimport type { FetchOpts, KnowledgeFragment, KnowledgeSource } from './types'\n\n/**\n * Generic Secretary-of-State source.\n *\n * Every US state SOS surfaces LLC/Corp formation requirements differently\n * (CA via static forms pages, DE via division of corporations pages, TX\n * via SOSDirect content pages). Rather than baking 50 state-specific\n * parsers into this package, the source takes a config that names the URL\n * pattern + CSS-equivalent selector + jurisdiction tag. Callers supply one\n * config per state they need tracked.\n *\n * The selector is interpreted as a substring/regex of an HTML element id\n * or class — see `StateSosSourceConfig` for the contract. This is\n * intentionally minimal; richer extraction belongs in a state-specific\n * adapter the consumer authors.\n *\n * @experimental Interface will likely grow as we add more state coverage.\n */\n\nexport interface StateSosEntity {\n  /** Stable id for this fragment within the state (e.g. 'llc-formation', 'corp-formation'). */\n  id: string\n  /** Path under the configured `baseUrl` for this entity. */\n  path: string\n  /**\n   * Extraction selector. Choose one:\n   *   - `{ kind: 'id', value: 'main-content' }` — innermost match of element with that id\n   *   - `{ kind: 'class', value: 'field--name-body' }` — innermost match of element with that class\n   *   - `{ kind: 'regex', value: /<article[\\s\\S]*?<\\/article>/i }` — raw regex\n   *   - `{ kind: 'whole' }` — full body, tags stripped (fallback for unstructured pages)\n   */\n  selector:\n    | { kind: 'id'; value: string }\n    | { kind: 'class'; value: string }\n    | { kind: 'regex'; value: RegExp }\n    | { kind: 'whole' }\n  title: string\n  /** Eval dimensions this entity feeds. */\n  dimensionHints?: string[]\n}\n\nexport interface StateSosSourceConfig {\n  /** US state postal code, e.g. 'CA', 'DE', 'TX'. */\n  state: string\n  /** Base URL for the state SOS — e.g. 'https://www.sos.ca.gov'. */\n  baseUrl: string\n  /** Entities this state exposes (LLC, Corp, etc). */\n  entities: StateSosEntity[]\n  /** Source id; default `state-sos:<state>`. */\n  id?: string\n  /** Display name; default `<state> Secretary of State`. */\n  name?: string\n}\n\nexport function createStateSosSource(config: StateSosSourceConfig): KnowledgeSource {\n  const id = config.id ?? `state-sos:${config.state.toLowerCase()}`\n  const name = config.name ?? `${config.state} Secretary of State`\n  return {\n    id,\n    name,\n    description: `${config.state} Secretary of State filings and formation guidance pages.`,\n    async fetch(opts: FetchOpts): Promise<KnowledgeFragment[]> {\n      const limit = opts.limit ?? config.entities.length\n      const entities = config.entities.slice(0, limit)\n      const out: KnowledgeFragment[] = []\n      for (const entity of entities) {\n        out.push(await fetchEntity(id, config, entity, opts))\n      }\n      return out\n    },\n  }\n}\n\nasync function fetchEntity(\n  sourceId: string,\n  config: StateSosSourceConfig,\n  entity: StateSosEntity,\n  opts: FetchOpts,\n): Promise<KnowledgeFragment> {\n  const url = joinUrl(config.baseUrl, entity.path)\n  const response = await politeFetch(url, { signal: opts.signal, cacheDir: opts.cacheDir })\n\n  const body = response.verifiable ? extractBySelector(response.body, entity.selector) : ''\n  const verifiable = response.verifiable && body.length > 100\n\n  return {\n    id: entity.id,\n    title: entity.title,\n    body,\n    bodyHash: sha256(body),\n    provenance: {\n      url,\n      sourceUpdatedAt: response.sourceUpdatedAt,\n      fetchedAt: response.fetchedAt,\n      jurisdiction: `US-${config.state.toUpperCase()}`,\n      verifiable,\n      unverifiableReason:\n        response.unverifiableReason ?? (verifiable ? undefined : 'extracted body too short'),\n    },\n    dimensionHints: entity.dimensionHints ?? [\n      'jurisdictional_accuracy',\n      'corporate_formation',\n      'citation_hygiene',\n    ],\n    metadata: {\n      sourceId,\n      status: response.status,\n      fromCache: response.fromCache,\n      state: config.state,\n    },\n  }\n}\n\nfunction extractBySelector(html: string, selector: StateSosEntity['selector']): string {\n  if (selector.kind === 'whole') {\n    const main = /<main\\b[\\s\\S]*?<\\/main>/i.exec(html)?.[0]\n    return htmlToText(main ?? html).slice(0, 200_000)\n  }\n  if (selector.kind === 'regex') {\n    const m = selector.value.exec(html)?.[0]\n    return m ? htmlToText(m).slice(0, 200_000) : ''\n  }\n  if (selector.kind === 'id') {\n    const escaped = selector.value.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&')\n    const pattern = new RegExp(\n      `<([a-z][a-z0-9]*)\\\\b[^>]*\\\\sid=[\"']${escaped}[\"'][^>]*>([\\\\s\\\\S]*?)<\\\\/\\\\1>`,\n      'i',\n    )\n    const inner = pattern.exec(html)?.[2]\n    return inner ? htmlToText(inner).slice(0, 200_000) : ''\n  }\n  const escaped = selector.value.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&')\n  const pattern = new RegExp(\n    `<([a-z][a-z0-9]*)\\\\b[^>]*\\\\sclass=[\"'][^\"']*\\\\b${escaped}\\\\b[^\"']*[\"'][^>]*>([\\\\s\\\\S]*?)<\\\\/\\\\1>`,\n    'i',\n  )\n  const inner = pattern.exec(html)?.[2]\n  return inner ? htmlToText(inner).slice(0, 200_000) : ''\n}\n\nfunction joinUrl(base: string, path: string): string {\n  try {\n    return new URL(path, base.endsWith('/') ? base : `${base}/`).toString()\n  } catch {\n    return `${base.replace(/\\/+$/, '')}/${path.replace(/^\\/+/, '')}`\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,WAAW,MAAsB;CAC/C,OAAO,KACJ,QAAQ,+BAA+B,EAAE,CAAC,CAC1C,QAAQ,6BAA6B,EAAE,CAAC,CACxC,QAAQ,mCAAmC,EAAE,CAAC,CAC9C,QAAQ,sBAAsB,EAAE,CAAC,CACjC,QAAQ,mBAAmB,IAAI,CAAC,CAChC,QAAQ,yDAAyD,IAAI,CAAC,CACtE,QAAQ,YAAY,EAAE,CAAC,CACvB,QAAQ,YAAY,GAAG,CAAC,CACxB,QAAQ,WAAW,GAAG,CAAC,CACvB,QAAQ,UAAU,GAAG,CAAC,CACtB,QAAQ,UAAU,GAAG,CAAC,CACtB,QAAQ,YAAY,IAAG,CAAC,CACxB,QAAQ,WAAW,GAAG,CAAC,CACvB,QAAQ,YAAY,GAAG,CAAC,CACxB,QAAQ,aAAa,GAAG,CAAC,CACzB,QAAQ,aAAa,GAAG,CAAC,CACzB,QAAQ,cAAc,GAAG,SAAS,OAAO,cAAc,OAAO,IAAI,CAAC,CAAC,CAAC,CACrE,QAAQ,sBAAsB,GAAG,SAAS,OAAO,cAAc,OAAO,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC,CAC1F,MAAM,IAAI,CAAC,CACX,KAAK,SAAS,KAAK,QAAQ,YAAY,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CACnD,QAAQ,MAAM,KAAK,QAAQ,EAAE,SAAS,MAAM,IAAI,MAAM,OAAO,GAAG,CAAC,CACjE,KAAK,IAAI,CAAC,CACV,KAAK;AACV;;AAGA,SAAgB,WAAW,MAAc,SAAqC;CAC5E,OAAO,QAAQ,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,KAAK;AACvC;;AAGA,SAAgB,cAAc,MAAc,IAAgC;CAC1E,MAAM,UAAU,GAAG,QAAQ,uBAAuB,MAAM;CAKxD,OAAO,IAJgB,OACrB,sCAAsC,QAAQ,iCAC9C,GAEc,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG;AACjC;;;;;AAMA,SAAgB,aACd,MACA,aACA,SACkC;CAClC,MAAM,MAAwC,CAAC;CAE/C,KAAK,MAAM,SAAS,KAAK,SAAS,yDAAM,GAAG;EACzC,MAAM,OAAO,MAAM;EACnB,MAAM,QAAQ,MAAM;EACpB,IAAI,CAAC,QAAQ,CAAC,OAAO;EACrB,IAAI,CAAC,YAAY,KAAK,IAAI,GAAG;EAC7B,MAAM,OAAO,WAAW,KAAK;EAC7B,IAAI,CAAC,MAAM;EACX,IAAI;GACF,IAAI,KAAK;IAAE,MAAM,IAAI,IAAI,MAAM,OAAO,CAAC,CAAC,SAAS;IAAG;GAAK,CAAC;EAC5D,QAAQ,CAER;CACF;CACA,OAAO;AACT;;;;;;;;;;;;;ACzEA,MAAa,oBACX;;AAGF,MAAa,qBAAqB;;AAGlC,MAAa,qBAAqB,IAAI,OAAO;AAE7C,MAAM,+BAAe,IAAI,IAA2B;;;;;;;;;;AAiDpD,eAAsB,YACpB,KACA,UAA8B,CAAC,GACH;CAC5B,MAAM,WAAW,QAAQ,cAAc,OAAU;CACjD,MAAM,SAAS,QAAQ,WAAW,MAAM,UAAU,QAAQ,UAAU,KAAK,QAAQ,IAAI,KAAA;CACrF,IAAI,QAAQ,OAAO;CAEnB,MAAM,OAAO,SAAS,GAAG;CACzB,MAAM,aAAa,IAAI;CAEvB,MAAM,6BAAY,IAAI,KAAK,EAAA,CAAE,YAAY;CACzC,IAAI;CACJ,IAAI;EACF,WAAW,MAAM,MAAM,KAAK;GAC1B,QAAQ,QAAQ;GAChB,UAAU;GACV,SAAS;IACP,cAAc;IACd,QAAQ;IACR,mBAAmB;IACnB,GAAI,QAAQ,WAAW,CAAC;GAC1B;EACF,CAAC;CACH,SAAS,OAAO;EACd,IAAK,MAA4B,SAAS,cAAc,MAAM;EAC9D,MAAM,SAA4B;GAChC;GACA,QAAQ;GACR,MAAM;GACN,iBAAiB;GACjB;GACA,WAAW;GACX,YAAY;GACZ,oBAAoB,kBAAmB,MAAgB;EACzD;EACA,IAAI,QAAQ,UAAU,MAAM,WAAW,QAAQ,UAAU,KAAK,MAAM;EACpE,OAAO;CACT;CAEA,MAAM,OAAO,MAAM,gBAAgB,QAAQ;CAC3C,MAAM,eAAe,SAAS,QAAQ,IAAI,eAAe;CACzD,MAAM,aAAa,SAAS,QAAQ,IAAI,MAAM;CAC9C,MAAM,kBAAkB,cAAc,YAAY,KAAK,cAAc,UAAU,KAAK;CAEpF,MAAM,SAA4B;EAChC;EACA,QAAQ,SAAS;EACjB,MAAM;EACN;EACA;EACA,WAAW;EACX,YAAY;CACd;CAEA,IAAI,SAAS,SAAS,OAAO,SAAS,UAAU,KAAK;EACnD,OAAO,aAAa;EACpB,OAAO,qBAAqB,mBAAmB,SAAS;CAC1D,OAAO,IAAI,mBAAmB,IAAI,GAAG;EACnC,OAAO,aAAa;EACpB,OAAO,qBAAqB;CAC9B,OAAO,IAAI,KAAK,SAAS,OAAO,oBAAoB,IAAI,GAAG;EACzD,OAAO,aAAa;EACpB,OAAO,qBAAqB,+BAA+B,KAAK,OAAO;CACzE;CAEA,IAAI,QAAQ,UAAU,MAAM,WAAW,QAAQ,UAAU,KAAK,MAAM;CACpE,OAAO;AACT;;AAGA,SAAgB,sBAA4B;CAC1C,aAAa,MAAM;AACrB;AAEA,SAAS,SAAS,KAAqB;CACrC,IAAI;EACF,OAAO,IAAI,IAAI,GAAG,CAAC,CAAC;CACtB,QAAQ;EACN,OAAO;CACT;AACF;AAEA,eAAe,aAAa,MAA6B;CACvD,MAAM,OAAO,aAAa,IAAI,IAAI,KAAK,QAAQ,QAAQ;CACvD,IAAI,gBAA4B,CAAC;CACjC,MAAM,OAAO,IAAI,SAAe,YAAY;EAC1C,UAAU;CACZ,CAAC;CACD,aAAa,IACX,MACA,KAAK,WAAW,IAAI,CACtB;CACA,MAAM;CACN,WAAW,SAAS,kBAAkB;AACxC;AAEA,eAAe,gBAAgB,UAAqC;CAClE,IAAI,CAAC,SAAS,MAAM,OAAO;CAC3B,MAAM,SAAS,SAAS,KAAK,UAAU;CACvC,MAAM,SAAuB,CAAC;CAC9B,IAAI,QAAQ;CACZ,OAAO,MAAM;EACX,MAAM,EAAE,MAAM,UAAU,MAAM,OAAO,KAAK;EAC1C,IAAI,MAAM;EACV,IAAI,CAAC,OAAO;EACZ,SAAS,MAAM;EACf,IAAI,QAAA,SAA4B;GAE9B,MAAM,OAAO,OAAO;GACpB;EACF;EACA,OAAO,KAAK,KAAK;CACnB;CACA,MAAM,SAAS,IAAI,WAAW,KAAK,IAAI,OAAO,kBAAkB,CAAC;CACjE,IAAI,SAAS;CACb,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,OAAO,KAAK,IAAI,MAAM,QAAQ,OAAO,SAAS,MAAM;EAC1D,IAAI,QAAQ,GAAG;EACf,OAAO,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,MAAM;EAC1C,UAAU;CACZ;CACA,OAAO,IAAI,YAAY,SAAS,EAAE,OAAO,MAAM,CAAC,CAAC,CAAC,OAAO,MAAM;AACjE;AAEA,SAAS,cAAc,OAA0C;CAC/D,IAAI,CAAC,OAAO,OAAO,KAAA;CACnB,MAAM,KAAK,KAAK,MAAM,KAAK;CAC3B,OAAO,OAAO,SAAS,EAAE,IAAI,IAAI,KAAK,EAAE,CAAC,CAAC,YAAY,IAAI,KAAA;AAC5D;;AAGA,SAAgB,mBAAmB,MAAuB;CACxD,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,QAAQ,KAAK,YAAY;CAY/B,KAAK,MAAM,UAAU;EAVnB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CAEyB,GACzB,IAAI,MAAM,SAAS,MAAM,GAAG,OAAO;CAErC,OAAO;AACT;AAEA,SAAS,oBAAoB,MAAuB;CAClD,OACE,KAAK,SAAS,iBAAiB,KAC/B,KAAK,SAAS,SAAS,KACvB,KAAK,SAAS,YAAY,KAC1B,KAAK,SAAS,iBAAiB,KAC/B,KAAK,SAAS,cAAc;AAEhC;AAEA,SAAS,UAAU,UAAkB,KAAqB;CACxD,MAAM,MAAM,OAAO,GAAG;CACtB,OAAO,KAAK,UAAU,QAAQ,GAAG,IAAI,MAAM,GAAG,CAAC,KAAK,GAAG,IAAI,MAAM;AACnE;AAEA,eAAe,UACb,UACA,KACA,OACwC;CACxC,MAAM,OAAO,UAAU,UAAU,GAAG;CACpC,IAAI;EACF,MAAM,OAAO,MAAM,KAAK,IAAI;EAC5B,IAAI,KAAK,IAAI,IAAI,KAAK,UAAU,OAAO,OAAO,KAAA;EAC9C,MAAM,MAAM,MAAM,SAAS,MAAM,MAAM;EAEvC,OAAO;GAAE,GADM,KAAK,MAAM,GACT;GAAG,WAAW;EAAK;CACtC,QAAQ;EACN;CACF;AACF;AAEA,eAAe,WAAW,UAAkB,KAAa,OAAyC;CAChG,MAAM,OAAO,UAAU,UAAU,GAAG;CACpC,MAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAC9C,MAAM,UAAU,MAAM,KAAK,UAAU,KAAK,GAAG,MAAM;AACrD;;;;;;;;;;;;;ACrPA,MAAMA,aAAW;;;;;;;;;;;;;;AA0CjB,SAAgB,uBAAuB,SAAmD;CACxF,MAAM,KAAK,QAAQ,MAAM;CACzB,OAAO;EACL;EACA,MAAM;EACN,aACE;EACF,MAAM,MAAM,MAA+C;GACzD,MAAM,QAAQ,KAAK,SAAS,QAAQ,UAAU;GAC9C,MAAM,YAAY,QAAQ,UAAU,MAAM,GAAG,KAAK;GAClD,MAAM,MAA2B,CAAC;GAClC,KAAK,MAAM,YAAY,WACrB,IAAI,KAAK,MAAM,SAAS,IAAI,UAAU,IAAI,CAAC;GAE7C,OAAO;EACT;CACF;AACF;AAEA,eAAe,SACb,UACA,UACA,MAC4B;CAC5B,MAAM,OAAO,SAAS,KAAK,QAAQ,QAAQ,EAAE;CAC7C,MAAM,MACJ,SAAS,SAAS,WAAW,GAAGA,WAAS,eAAe,SAAS,GAAGA,WAAS,OAAO;CAEtF,MAAM,WAAW,MAAM,YAAY,KAAK;EACtC,QAAQ,KAAK;EACb,UAAU,KAAK;CACjB,CAAC;CAED,MAAM,aAAa,GAAG,SAAS,KAAK,GAAG,SAAS;CAChD,MAAM,iBAAiB,SAAS,kBAAkB,sBAAsB,QAAQ;CAEhF,IAAI,CAAC,SAAS,YACZ,OAAO;EACL,IAAI;EACJ,OAAO,eAAe,SAAS,KAAK,GAAG,SAAS;EAChD,MAAM;EACN,UAAU,OAAO,EAAE;EACnB,YAAY;GACV;GACA,iBAAiB,SAAS;GAC1B,WAAW,SAAS;GACpB,cAAc;GACd,YAAY;GACZ,oBAAoB,SAAS;EAC/B;EACA;EACA,UAAU;GAAE;GAAU,QAAQ,SAAS;GAAQ,WAAW,SAAS;EAAU;CAC/E;CAGF,MAAM,OAAO,SAAS;CACtB,MAAM,QAAQC,eAAa,MAAM,QAAQ;CACzC,MAAM,OAAO,YAAY,MAAM,QAAQ;CACvC,MAAM,YAAY,qBAAqB,IAAI,KAAK,SAAS;CAEzD,MAAM,aAAa,KAAK,SAAS;CACjC,OAAO;EACL,IAAI;EACJ;EACA;EACA,UAAU,OAAO,IAAI;EACrB,YAAY;GACV;GACA,iBAAiB;GACjB,WAAW,SAAS;GACpB,cAAc;GACd;GACA,oBAAoB,aAAa,KAAA,IAAY;EAC/C;EACA;EACA,UAAU;GAAE;GAAU,QAAQ,SAAS;GAAQ,WAAW,SAAS;EAAU;CAC/E;AACF;AAEA,SAASA,eAAa,MAAc,UAAsC;CACxE,MAAM,KAAK,yDAAyD,KAAK,IAAI,CAAC,GAAG;CACjF,IAAI,IAAI,OAAO,WAAW,EAAE;CAC5B,MAAM,IAAI,8BAA8B,KAAK,IAAI,CAAC,GAAG;CACrD,IAAI,GAAG,OAAO,WAAW,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,eAAe,SAAS;CACvE,OAAO,eAAe,SAAS,KAAK,GAAG,SAAS;AAClD;AAEA,SAAS,YAAY,MAAc,UAAsC;CACvE,IAAI,SAAS,SAAS,UAAU;EAI9B,MAAM,OAAO,4BAA4B,KAAK,IAAI,CAAC,GAAG;EACtD,IAAI,MAAM,OAAO,WAAW,IAAI;EAChC,MAAM,MAAM,cAAc,MAAM,eAAe;EAC/C,IAAI,KAAK,OAAO,WAAW,GAAG;CAChC;CAKA,MAAM,cAAc,cAAc,MAAM,cAAc;CACtD,IAAI,aACF,OAAO,WAAW,YAAY,QAAQ,sBAAsB,EAAE,CAAC;CAEjE,MAAM,YAAY,cAAc,MAAM,mBAAmB;CACzD,IAAI,WACF,OAAO,WAAW,UAAU,QAAQ,sBAAsB,EAAE,CAAC;CAE/D,OAAO,WAAW,IAAI;AACxB;AAEA,SAAS,qBAAqB,MAAkC;CAI9D,MAAM,QAAQ,mCAAmC,KAAK,IAAI,CAAC,GAAG;CAC9D,IAAI,OAAO;EACT,MAAM,IAAI,OAAO,SAAS,OAAO,EAAE;EACnC,IAAI,OAAO,SAAS,CAAC,KAAK,IAAI,QAAQ,sBAAK,IAAI,KAAK,EAAA,CAAE,eAAe,IAAI,GACvE,OAAO,IAAI,KAAK,KAAK,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,YAAY;CAErD;AAEF;AAEA,SAAS,sBAAsB,UAAwC;CACrE,IAAI,SAAS,SAAS,UAAU,OAAO,CAAC,2BAA2B,kBAAkB;CACrF,OAAO,CAAC,kBAAkB;AAC5B;;;;;;;;;;;;;;;;;;;;;;;ACjKA,MAAM,WAAW;AACjB,MAAM,YAAY,GAAG,SAAS;;AAoB9B,MAAa,sBAAsB;CAAC;CAAkB;CAAuB;AAAkB;AAE/F,SAAgB,4BACd,UAAwC,CAAC,GACxB;CACjB,MAAM,KAAK,QAAQ,MAAM;CACzB,MAAM,eAAe,QAAQ,gBAAgB;CAC7C,OAAO;EACL;EACA,MAAM;EACN,aACE;EACF,MAAM,MAAM,MAA+C;GACzD,MAAM,MAA2B,CAAC;GAClC,MAAM,QAAQ,KAAK,SAAS,OAAO;GAEnC,IAAI,gBAAgB,IAAI,SAAS,OAC/B,IAAI,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC;GAErC,KAAK,MAAM,QAAQ,QAAQ,gBAAgB,CAAC,GAAG;IAC7C,IAAI,IAAI,UAAU,OAAO;IACzB,IAAI,KAAK,MAAM,iBAAiB,IAAI,MAAM,IAAI,CAAC;GACjD;GACA,KAAK,MAAM,QAAQ,QAAQ,qBAAqB,CAAC,GAAG;IAClD,IAAI,IAAI,UAAU,OAAO;IACzB,IAAI,KAAK,MAAM,sBAAsB,IAAI,MAAM,IAAI,CAAC;GACtD;GACA,OAAO;EACT;CACF;AACF;AAEA,eAAe,WAAW,UAAkB,MAA6C;CACvF,MAAM,WAAW,MAAM,YAAY,WAAW;EAAE,QAAQ,KAAK;EAAQ,UAAU,KAAK;CAAS,CAAC;CAO9F,MAAM,QALU,SAAS,KAAK,MAAM,2BAAY,KAAK,CAAC,EAAA,CAI/B,KAAK,MAAM,WAAW,CAAC,CAC5B,CAAC,CAChB,QAAQ,MAAM,qBAAqB,KAAK,CAAC,CAAC,CAAC,CAC3C,KAAK,MAAM,CAAC,CACZ,MAAM,GAAG,GAAO;CAEnB,MAAM,aAAa,SAAS,cAAc,KAAK,SAAS;CACxD,OAAO;EACL,IAAI;EACJ,OAAO;EACP;EACA,UAAU,OAAO,IAAI;EACrB,YAAY;GACV,KAAK;GACL,iBAAiB,SAAS;GAC1B,WAAW,SAAS;GACpB,cAAc;GACd;GACA,oBACE,SAAS,uBAAuB,aAAa,KAAA,IAAY;EAC7D;EACA,gBAAgB;EAChB,UAAU;GAAE;GAAU,QAAQ,SAAS;GAAQ,WAAW,SAAS;GAAW,MAAM;EAAQ;CAC9F;AACF;AAEA,eAAe,iBACb,UACA,MACA,MAC4B;CAC5B,MAAM,MAAM,GAAG,SAAS,gBAAgB,KAAK,QAAQ,QAAQ,EAAE;CAC/D,MAAM,WAAW,MAAM,YAAY,KAAK;EAAE,QAAQ,KAAK;EAAQ,UAAU,KAAK;CAAS,CAAC;CAExF,MAAM,QAAQ,aAAa,SAAS,MAAM,mBAAmB,MAAM;CACnE,MAAM,OAAO,mBAAmB,SAAS,IAAI;CAC7C,MAAM,aAAa,SAAS,cAAc,KAAK,SAAS;CAExD,OAAO;EACL,IAAI,eAAe;EACnB;EACA;EACA,UAAU,OAAO,IAAI;EACrB,YAAY;GACV;GACA,iBAAiB,oBAAoB,SAAS,IAAI,KAAK,SAAS;GAChE,WAAW,SAAS;GACpB,cAAc;GACd;GACA,oBACE,SAAS,uBAAuB,aAAa,KAAA,IAAY;EAC7D;EACA,gBAAgB;EAChB,UAAU;GACR;GACA,QAAQ,SAAS;GACjB,WAAW,SAAS;GACpB,MAAM;GACN;EACF;CACF;AACF;AAEA,eAAe,sBACb,UACA,MACA,MAC4B;CAC5B,MAAM,MAAM,GAAG,WAAW,KAAK,WAAW,GAAG,IAAI,OAAO,IAAI;CAC5D,MAAM,WAAW,MAAM,YAAY,KAAK;EAAE,QAAQ,KAAK;EAAQ,UAAU,KAAK;CAAS,CAAC;CACxF,MAAM,OAAO,mBAAmB,SAAS,IAAI;CAC7C,MAAM,aAAa,SAAS,cAAc,KAAK,SAAS;CACxD,OAAO;EACL,IAAI,YAAY;EAChB,OAAO,aAAa,SAAS,MAAM,yBAAyB,MAAM;EAClE;EACA,UAAU,OAAO,IAAI;EACrB,YAAY;GACV;GACA,iBAAiB,SAAS;GAC1B,WAAW,SAAS;GACpB,cAAc;GACd;GACA,oBACE,SAAS,uBACR,aAAa,KAAA,IAAY;EAC9B;EACA,gBAAgB,CAAC,GAAG,qBAAqB,qBAAqB;EAC9D,UAAU;GACR;GACA,QAAQ,SAAS;GACjB,WAAW,SAAS;GACpB,MAAM;GACN;EACF;CACF;AACF;AAEA,SAAS,aAAa,MAAc,UAA0B;CAC5D,MAAM,KAAK,gEAAgE,KAAK,IAAI,CAAC,GAAG;CACxF,IAAI,IAAI,OAAO,WAAW,EAAE;CAC5B,MAAM,QAAQ,8BAA8B,KAAK,IAAI,CAAC,GAAG;CACzD,IAAI,OAAO,OAAO,WAAW,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;CACvD,OAAO;AACT;AAEA,SAAS,mBAAmB,MAAsB;CAGhD,MAAM,OAAO,2BAA2B,KAAK,IAAI,CAAC,GAAG;CACrD,IAAI,MAKF,OAAO,WAJO,KACX,QAAQ,yBAAyB,EAAE,CAAC,CACpC,QAAQ,+BAA+B,EAAE,CAAC,CAC1C,QAAQ,+BAA+B,EACpB,CAAC,CAAC,CAAC,MAAM,GAAG,GAAO;CAE3C,MAAM,OAAO,2BAA2B,KAAK,IAAI,CAAC,GAAG;CACrD,OAAO,OAAO,WAAW,IAAI,CAAC,CAAC,MAAM,GAAG,GAAO,IAAI,WAAW,IAAI,CAAC,CAAC,MAAM,GAAG,GAAO;AACtF;AAEA,SAAS,oBAAoB,MAAkC;CAG7D,MAAM,IAAI,mCAAmC,KAAK,IAAI;CACtD,IAAI,IAAI,IAAI;EACV,MAAM,OAAO,OAAO,SAAS,EAAE,IAAI,EAAE;EACrC,IAAI,OAAO,SAAS,IAAI,KAAK,QAAQ,OAAQ,yBAAQ,IAAI,KAAK,EAAA,CAAE,eAAe,IAAI,GACjF,OAAO,IAAI,KAAK,KAAK,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY;CAEtD;AAEF;AAEA,SAAS,WAAW,OAAuB;CACzC,OAAO,WAAW,KAAK;AACzB;;;ACpKA,SAAgB,qBAAqB,QAA+C;CAClF,MAAM,KAAK,OAAO,MAAM,aAAa,OAAO,MAAM,YAAY;CAE9D,OAAO;EACL;EACA,MAHW,OAAO,QAAQ,GAAG,OAAO,MAAM;EAI1C,aAAa,GAAG,OAAO,MAAM;EAC7B,MAAM,MAAM,MAA+C;GACzD,MAAM,QAAQ,KAAK,SAAS,OAAO,SAAS;GAC5C,MAAM,WAAW,OAAO,SAAS,MAAM,GAAG,KAAK;GAC/C,MAAM,MAA2B,CAAC;GAClC,KAAK,MAAM,UAAU,UACnB,IAAI,KAAK,MAAM,YAAY,IAAI,QAAQ,QAAQ,IAAI,CAAC;GAEtD,OAAO;EACT;CACF;AACF;AAEA,eAAe,YACb,UACA,QACA,QACA,MAC4B;CAC5B,MAAM,MAAM,QAAQ,OAAO,SAAS,OAAO,IAAI;CAC/C,MAAM,WAAW,MAAM,YAAY,KAAK;EAAE,QAAQ,KAAK;EAAQ,UAAU,KAAK;CAAS,CAAC;CAExF,MAAM,OAAO,SAAS,aAAa,kBAAkB,SAAS,MAAM,OAAO,QAAQ,IAAI;CACvF,MAAM,aAAa,SAAS,cAAc,KAAK,SAAS;CAExD,OAAO;EACL,IAAI,OAAO;EACX,OAAO,OAAO;EACd;EACA,UAAU,OAAO,IAAI;EACrB,YAAY;GACV;GACA,iBAAiB,SAAS;GAC1B,WAAW,SAAS;GACpB,cAAc,MAAM,OAAO,MAAM,YAAY;GAC7C;GACA,oBACE,SAAS,uBAAuB,aAAa,KAAA,IAAY;EAC7D;EACA,gBAAgB,OAAO,kBAAkB;GACvC;GACA;GACA;EACF;EACA,UAAU;GACR;GACA,QAAQ,SAAS;GACjB,WAAW,SAAS;GACpB,OAAO,OAAO;EAChB;CACF;AACF;AAEA,SAAS,kBAAkB,MAAc,UAA8C;CACrF,IAAI,SAAS,SAAS,SAAS;EAC7B,MAAM,OAAO,2BAA2B,KAAK,IAAI,CAAC,GAAG;EACrD,OAAO,WAAW,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,GAAO;CAClD;CACA,IAAI,SAAS,SAAS,SAAS;EAC7B,MAAM,IAAI,SAAS,MAAM,KAAK,IAAI,CAAC,GAAG;EACtC,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,MAAM,GAAG,GAAO,IAAI;CAC/C;CACA,IAAI,SAAS,SAAS,MAAM;EAC1B,MAAM,UAAU,SAAS,MAAM,QAAQ,uBAAuB,MAAM;EAKpE,MAAM,QAAQ,IAJM,OAClB,sCAAsC,QAAQ,iCAC9C,GAEkB,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG;EACnC,OAAO,QAAQ,WAAW,KAAK,CAAC,CAAC,MAAM,GAAG,GAAO,IAAI;CACvD;CACA,MAAM,UAAU,SAAS,MAAM,QAAQ,uBAAuB,MAAM;CAKpE,MAAM,QAAQ,IAJM,OAClB,kDAAkD,QAAQ,0CAC1D,GAEkB,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG;CACnC,OAAO,QAAQ,WAAW,KAAK,CAAC,CAAC,MAAM,GAAG,GAAO,IAAI;AACvD;AAEA,SAAS,QAAQ,MAAc,MAAsB;CACnD,IAAI;EACF,OAAO,IAAI,IAAI,MAAM,KAAK,SAAS,GAAG,IAAI,OAAO,GAAG,KAAK,EAAE,CAAC,CAAC,SAAS;CACxE,QAAQ;EACN,OAAO,GAAG,KAAK,QAAQ,QAAQ,EAAE,EAAE,GAAG,KAAK,QAAQ,QAAQ,EAAE;CAC/D;AACF"}

package/dist/types-DcCCzreS.d.ts

@@ -0,0 +1,175 @@
+//#region src/types.d.ts
+type KnowledgeId = string;
+interface SourceAnchor {
+  id: string;
+  sourceId: string;
+  label?: string;
+  page?: number;
+  lineStart?: number;
+  lineEnd?: number;
+  charStart?: number;
+  charEnd?: number;
+  timestampMs?: number;
+  metadata?: Record<string, unknown>;
+}
+interface SourceRecord {
+  id: KnowledgeId;
+  uri: string;
+  title?: string;
+  mediaType?: string;
+  contentHash: string;
+  text?: string;
+  anchors?: SourceAnchor[];
+  /** ISO timestamp after which consumers should treat this source as stale. */
+  validUntil?: string;
+  /** ISO timestamp for the last successful source freshness verification. */
+  lastVerifiedAt?: string;
+  metadata?: Record<string, unknown>;
+  createdAt: string;
+}
+interface SourceRegistry {
+  generatedAt: string;
+  sources: SourceRecord[];
+}
+interface ClaimRef {
+  sourceId: string;
+  anchorId?: string;
+  quote?: string;
+}
+interface KnowledgeClaim {
+  id: KnowledgeId;
+  text: string;
+  refs: ClaimRef[];
+  confidence?: number;
+  status?: 'draft' | 'active' | 'superseded' | 'rejected';
+  metadata?: Record<string, unknown>;
+}
+interface KnowledgeRelation {
+  sourceId: KnowledgeId;
+  targetId: KnowledgeId;
+  predicate: string;
+  weight?: number;
+  metadata?: Record<string, unknown>;
+}
+interface KnowledgeUnit {
+  id: KnowledgeId;
+  title: string;
+  text: string;
+  claims?: KnowledgeClaim[];
+  relations?: KnowledgeRelation[];
+  sourceIds?: string[];
+  tags?: string[];
+  metadata?: Record<string, unknown>;
+  updatedAt?: string;
+}
+interface KnowledgePage {
+  id: KnowledgeId;
+  path: string;
+  title: string;
+  text: string;
+  frontmatter: Record<string, unknown>;
+  sourceIds: string[];
+  tags: string[];
+  outLinks: string[];
+}
+interface KnowledgeGraphNode {
+  id: KnowledgeId;
+  title: string;
+  path: string;
+  tags: string[];
+  sourceIds: string[];
+  outDegree: number;
+  inDegree: number;
+}
+interface KnowledgeGraphEdge {
+  source: KnowledgeId;
+  target: KnowledgeId;
+  weight: number;
+  reasons: string[];
+}
+interface KnowledgeGraph {
+  nodes: KnowledgeGraphNode[];
+  edges: KnowledgeGraphEdge[];
+}
+interface KnowledgeIndex {
+  root: string;
+  generatedAt: string;
+  sources: SourceRecord[];
+  pages: KnowledgePage[];
+  graph: KnowledgeGraph;
+}
+interface KnowledgeSearchResult {
+  page: KnowledgePage;
+  /**
+   * Raw reciprocal rank fusion score. Mathematically meaningful for ordering
+   * but not on a [0, 1] confidence scale — typical absolute values are in the
+   * 0.01–0.05 range. Equal to `rrfScore`; preserved as `score` for backward
+   * compatibility with consumers built against earlier releases.
+   */
+  score: number;
+  /** Alias of `score` — the raw RRF value. Use this when intent matters. */
+  rrfScore: number;
+  /**
+   * Score linearly normalized to [0, 1] relative to the top hit *in this
+   * result set*. The top hit is always 1 (when present); subsequent hits are
+   * `score / topScore`. Designed to match human intuition for "how confident
+   * is this match" — safe to compare against fixed thresholds. Note: this is
+   * a within-set ranking, not a cross-query absolute confidence.
+   */
+  normalizedScore: number;
+  rank: number;
+  snippet: string;
+  reasons: string[];
+}
+interface KnowledgeLintFinding {
+  type: 'broken-link' | 'orphan' | 'no-outlinks' | 'uncited-claim' | 'missing-source' | 'duplicate-title' | 'duplicate-page-id' | 'duplicate-source-hash' | 'missing-frontmatter';
+  severity: 'info' | 'warning' | 'error';
+  page?: string;
+  message: string;
+  metadata?: Record<string, unknown>;
+}
+interface KnowledgePolicy {
+  id: string;
+  description?: string;
+  requiredCitationRate?: number;
+  allowedPathPrefixes?: string[];
+  metadata?: Record<string, unknown>;
+}
+interface KnowledgeBaseCandidate {
+  id: KnowledgeId;
+  units: KnowledgeUnit[];
+  retrievalPolicy?: string;
+  synthesisPolicy?: string;
+  questionPolicy?: string;
+  updatePolicy?: string;
+  metadata?: Record<string, unknown>;
+}
+interface KnowledgeWriteBlock {
+  path: string;
+  content: string;
+}
+interface KnowledgeWriteParseResult {
+  blocks: KnowledgeWriteBlock[];
+  warnings: string[];
+}
+type KnowledgeEventType = 'source.added' | 'proposal.applied' | 'index.built' | 'lint.run' | 'research.iteration' | 'optimization.run' | 'release.promoted' | 'release.rejected';
+interface KnowledgeEvent {
+  id: string;
+  type: KnowledgeEventType;
+  createdAt: string;
+  actor?: string;
+  target?: string;
+  metadata?: Record<string, unknown>;
+}
+interface KnowledgeRelease {
+  id: string;
+  candidateId: string;
+  createdAt: string;
+  promoted: boolean;
+  scorecard?: unknown;
+  runRecordIds?: string[];
+  metadata?: Record<string, unknown>;
+}
+//#endregion
+export { SourceRegistry as S, KnowledgeUnit as _, KnowledgeEventType as a, SourceAnchor as b, KnowledgeGraphNode as c, KnowledgeLintFinding as d, KnowledgePage as f, KnowledgeSearchResult as g, KnowledgeRelease as h, KnowledgeEvent as i, KnowledgeId as l, KnowledgeRelation as m, KnowledgeBaseCandidate as n, KnowledgeGraph as o, KnowledgePolicy as p, KnowledgeClaim as r, KnowledgeGraphEdge as s, ClaimRef as t, KnowledgeIndex as u, KnowledgeWriteBlock as v, SourceRecord as x, KnowledgeWriteParseResult as y };
+//# sourceMappingURL=types-DcCCzreS.d.ts.map

package/dist/types-DcCCzreS.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types-DcCCzreS.d.ts","names":[],"sources":["../src/types.ts"],"mappings":";KAAY;UAEK;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,WAAW;;UAGI;EACf,IAAI;EACJ;EACA;EACA;EACA;EACA;EACA,UAAU;;EAEV;;EAEA;EACA,WAAW;EACX;;UAGe;EACf;EACA,SAAS;;UAGM;EACf;EACA;EACA;;UAGe;EACf,IAAI;EACJ;EACA,MAAM;EACN;EACA;EACA,WAAW;;UAGI;EACf,UAAU;EACV,UAAU;EACV;EACA;EACA,WAAW;;UAGI;EACf,IAAI;EACJ;EACA;EACA,SAAS;EACT,YAAY;EACZ;EACA;EACA,WAAW;EACX;;UAGe;EACf,IAAI;EACJ;EACA;EACA;EACA,aAAa;EACb;EACA;EACA;;UAGe;EACf,IAAI;EACJ;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf,QAAQ;EACR,QAAQ;EACR;EACA;;UAGe;EACf,OAAO;EACP,OAAO;;UAGQ;EACf;EACA;EACA,SAAS;EACT,OAAO;EACP,OAAO;;UAGQ;EACf,MAAM;;;;;;;EAON;;EAEA;;;;;;;;EAQA;EACA;EACA;EACA;;UAGe;EACf;EAUA;EACA;EACA;EACA,WAAW;;UAGI;EACf;EACA;EACA;EACA;EACA,WAAW;;UAGI;EACf,IAAI;EACJ,OAAO;EACP;EACA;EACA;EACA;EACA,WAAW;;UAGI;EACf;EACA;;UAGe;EACf,QAAQ;EACR;;KAGU;UAUK;EACf;EACA,MAAM;EACN;EACA;EACA;EACA,WAAW;;UAGI;EACf;EACA;EACA;EACA;EACA;EACA;EACA,WAAW"}

package/dist/viz/index.d.ts

@@ -1,37 +1,38 @@
-import { K as KnowledgeGraphEdge, a as KnowledgeGraphNode, b as KnowledgeGraph } from '../types-6x0OpfW6.js';
-
+import { c as KnowledgeGraphNode, o as KnowledgeGraph, s as KnowledgeGraphEdge } from "../types-DcCCzreS.js";
+//#region src/viz/index.d.ts
 interface KnowledgeVizNode extends KnowledgeGraphNode {
-    degree: number;
-    community: number;
+  degree: number;
+  community: number;
 }
 interface KnowledgeVizEdge extends KnowledgeGraphEdge {
-    id: string;
+  id: string;
 }
 interface KnowledgeCommunity {
-    id: number;
-    nodeIds: string[];
-    topTitles: string[];
-    cohesion: number;
+  id: number;
+  nodeIds: string[];
+  topTitles: string[];
+  cohesion: number;
 }
 interface KnowledgeVizGraph {
-    nodes: KnowledgeVizNode[];
-    edges: KnowledgeVizEdge[];
-    communities: KnowledgeCommunity[];
+  nodes: KnowledgeVizNode[];
+  edges: KnowledgeVizEdge[];
+  communities: KnowledgeCommunity[];
 }
 interface KnowledgeGap {
-    type: 'isolated-node' | 'sparse-community' | 'bridge-node';
-    title: string;
-    nodeIds: string[];
-    suggestion: string;
+  type: 'isolated-node' | 'sparse-community' | 'bridge-node';
+  title: string;
+  nodeIds: string[];
+  suggestion: string;
 }
 interface SurprisingConnection {
-    source: KnowledgeVizNode;
-    target: KnowledgeVizNode;
-    score: number;
-    reasons: string[];
+  source: KnowledgeVizNode;
+  target: KnowledgeVizNode;
+  score: number;
+  reasons: string[];
 }
 declare function toKnowledgeVizGraph(graph: KnowledgeGraph): KnowledgeVizGraph;
 declare function detectKnowledgeGaps(graph: KnowledgeVizGraph, limit?: number): KnowledgeGap[];
 declare function findSurprisingConnections(graph: KnowledgeVizGraph, limit?: number): SurprisingConnection[];
-
-export { type KnowledgeCommunity, type KnowledgeGap, type KnowledgeVizEdge, type KnowledgeVizGraph, type KnowledgeVizNode, type SurprisingConnection, detectKnowledgeGaps, findSurprisingConnections, toKnowledgeVizGraph };
+//#endregion
+export { KnowledgeCommunity, KnowledgeGap, KnowledgeVizEdge, KnowledgeVizGraph, KnowledgeVizNode, SurprisingConnection, detectKnowledgeGaps, findSurprisingConnections, toKnowledgeVizGraph };
+//# sourceMappingURL=index.d.ts.map

package/dist/viz/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","names":[],"sources":["../../src/viz/index.ts"],"mappings":";;UAEiB,yBAAyB;EACxC;EACA;;UAGe,yBAAyB;EACxC;;UAGe;EACf;EACA;EACA;EACA;;UAGe;EACf,OAAO;EACP,OAAO;EACP,aAAa;;UAGE;EACf;EACA;EACA;EACA;;UAGe;EACf,QAAQ;EACR,QAAQ;EACR;EACA;;iBAGc,oBAAoB,OAAO,iBAAiB;iBAmB5C,oBAAoB,OAAO,mBAAmB,iBAAa;iBA+C3D,0BACd,OAAO,mBACP,iBACC"}

package/dist/viz/index.js

@@ -1,11 +1,135 @@
-import {
-  detectKnowledgeGaps,
-  findSurprisingConnections,
-  toKnowledgeVizGraph
-} from "../chunk-4PNXQ2NT.js";
-export {
-  detectKnowledgeGaps,
-  findSurprisingConnections,
-  toKnowledgeVizGraph
-};
+//#region src/viz/index.ts
+function toKnowledgeVizGraph(graph) {
+	const adjacency = buildAdjacency(graph);
+	const communities = assignCommunities(graph.nodes, adjacency);
+	const communityByNode = /* @__PURE__ */ new Map();
+	communities.forEach((community) => {
+		for (const nodeId of community.nodeIds) communityByNode.set(hashNode(nodeId), community.id);
+	});
+	return {
+		nodes: graph.nodes.map((node) => ({
+			...node,
+			degree: node.inDegree + node.outDegree,
+			community: communityByNode.get(hashNode(node.id)) ?? 0
+		})),
+		edges: graph.edges.map((edge) => ({
+			...edge,
+			id: `${edge.source}->${edge.target}`
+		})),
+		communities
+	};
+}
+function detectKnowledgeGaps(graph, limit = 10) {
+	const gaps = [];
+	const isolated = graph.nodes.filter((node) => node.degree <= 1 && !isStructural(node.path));
+	if (isolated.length > 0) gaps.push({
+		type: "isolated-node",
+		title: `${isolated.length} isolated page${isolated.length === 1 ? "" : "s"}`,
+		nodeIds: isolated.map((node) => node.id),
+		suggestion: "Add cross-links, sources, or follow-up research to connect these pages to the knowledge graph."
+	});
+	for (const community of graph.communities) if (community.nodeIds.length >= 3 && community.cohesion < .15) gaps.push({
+		type: "sparse-community",
+		title: `Sparse cluster: ${community.topTitles[0] ?? `community ${community.id}`}`,
+		nodeIds: community.nodeIds,
+		suggestion: "This cluster has weak internal evidence. Add synthesis pages or relation links between its strongest concepts."
+	});
+	const byCommunityNeighbors = /* @__PURE__ */ new Map();
+	const nodeById = new Map(graph.nodes.map((node) => [node.id, node]));
+	for (const edge of graph.edges) {
+		const source = nodeById.get(edge.source);
+		const target = nodeById.get(edge.target);
+		if (!source || !target) continue;
+		if (!byCommunityNeighbors.has(source.id)) byCommunityNeighbors.set(source.id, /* @__PURE__ */ new Set());
+		if (!byCommunityNeighbors.has(target.id)) byCommunityNeighbors.set(target.id, /* @__PURE__ */ new Set());
+		byCommunityNeighbors.get(source.id).add(target.community);
+		byCommunityNeighbors.get(target.id).add(source.community);
+	}
+	for (const node of graph.nodes) if ((byCommunityNeighbors.get(node.id)?.size ?? 0) >= 3) gaps.push({
+		type: "bridge-node",
+		title: `Bridge page: ${node.title}`,
+		nodeIds: [node.id],
+		suggestion: "This page connects multiple knowledge areas. Keep it well cited and current."
+	});
+	return gaps.slice(0, limit);
+}
+function findSurprisingConnections(graph, limit = 10) {
+	const nodeById = new Map(graph.nodes.map((node) => [node.id, node]));
+	const scored = [];
+	for (const edge of graph.edges) {
+		const source = nodeById.get(edge.source);
+		const target = nodeById.get(edge.target);
+		if (!source || !target) continue;
+		let score = edge.weight;
+		const reasons = [...edge.reasons];
+		if (source.community !== target.community) {
+			score += 3;
+			reasons.push("cross-community");
+		}
+		if (source.tags.some((tag) => !target.tags.includes(tag))) {
+			score += 1;
+			reasons.push("cross-tag");
+		}
+		if (score >= 3) scored.push({
+			source,
+			target,
+			score,
+			reasons
+		});
+	}
+	return scored.sort((a, b) => b.score - a.score).slice(0, limit);
+}
+function buildAdjacency(graph) {
+	const out = /* @__PURE__ */ new Map();
+	for (const node of graph.nodes) out.set(node.id, /* @__PURE__ */ new Set());
+	for (const edge of graph.edges) {
+		out.get(edge.source)?.add(edge.target);
+		out.get(edge.target)?.add(edge.source);
+	}
+	return out;
+}
+function assignCommunities(nodes, adjacency) {
+	const seen = /* @__PURE__ */ new Set();
+	const communities = [];
+	for (const node of nodes) {
+		if (seen.has(node.id)) continue;
+		const queue = [node.id];
+		const ids = [];
+		seen.add(node.id);
+		while (queue.length > 0) {
+			const id = queue.shift();
+			ids.push(id);
+			for (const next of adjacency.get(id) ?? []) if (!seen.has(next)) {
+				seen.add(next);
+				queue.push(next);
+			}
+		}
+		const memberNodes = ids.map((id) => nodes.find((candidate) => candidate.id === id)).filter((item) => Boolean(item));
+		communities.push({
+			id: communities.length,
+			nodeIds: ids,
+			topTitles: memberNodes.sort((a, b) => b.inDegree + b.outDegree - (a.inDegree + a.outDegree)).slice(0, 5).map((item) => item.title),
+			cohesion: cohesion(ids, adjacency)
+		});
+	}
+	return communities.sort((a, b) => b.nodeIds.length - a.nodeIds.length);
+}
+function cohesion(ids, adjacency) {
+	if (ids.length < 2) return 0;
+	let edges = 0;
+	const idSet = new Set(ids);
+	for (const id of ids) for (const next of adjacency.get(id) ?? []) if (idSet.has(next)) edges++;
+	return edges / (ids.length * (ids.length - 1));
+}
+function hashNode(id) {
+	let hash = 0;
+	for (const char of id) hash = hash * 31 + char.charCodeAt(0) | 0;
+	return hash;
+}
+function isStructural(path) {
+	return path.endsWith("/index.md") || path.endsWith("/log.md");
+}
+//#endregion
+export { detectKnowledgeGaps, findSurprisingConnections, toKnowledgeVizGraph };
+
 //# sourceMappingURL=index.js.map

package/dist/viz/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}
+{"version":3,"file":"index.js","names":[],"sources":["../../src/viz/index.ts"],"sourcesContent":["import type { KnowledgeGraph, KnowledgeGraphEdge, KnowledgeGraphNode } from '../types'\n\nexport interface KnowledgeVizNode extends KnowledgeGraphNode {\n  degree: number\n  community: number\n}\n\nexport interface KnowledgeVizEdge extends KnowledgeGraphEdge {\n  id: string\n}\n\nexport interface KnowledgeCommunity {\n  id: number\n  nodeIds: string[]\n  topTitles: string[]\n  cohesion: number\n}\n\nexport interface KnowledgeVizGraph {\n  nodes: KnowledgeVizNode[]\n  edges: KnowledgeVizEdge[]\n  communities: KnowledgeCommunity[]\n}\n\nexport interface KnowledgeGap {\n  type: 'isolated-node' | 'sparse-community' | 'bridge-node'\n  title: string\n  nodeIds: string[]\n  suggestion: string\n}\n\nexport interface SurprisingConnection {\n  source: KnowledgeVizNode\n  target: KnowledgeVizNode\n  score: number\n  reasons: string[]\n}\n\nexport function toKnowledgeVizGraph(graph: KnowledgeGraph): KnowledgeVizGraph {\n  const adjacency = buildAdjacency(graph)\n  const communities = assignCommunities(graph.nodes, adjacency)\n  const communityByNode = new Map<number, number>()\n  communities.forEach((community) => {\n    for (const nodeId of community.nodeIds) communityByNode.set(hashNode(nodeId), community.id)\n  })\n  const nodes = graph.nodes.map((node) => ({\n    ...node,\n    degree: node.inDegree + node.outDegree,\n    community: communityByNode.get(hashNode(node.id)) ?? 0,\n  }))\n  return {\n    nodes,\n    edges: graph.edges.map((edge) => ({ ...edge, id: `${edge.source}->${edge.target}` })),\n    communities,\n  }\n}\n\nexport function detectKnowledgeGaps(graph: KnowledgeVizGraph, limit = 10): KnowledgeGap[] {\n  const gaps: KnowledgeGap[] = []\n  const isolated = graph.nodes.filter((node) => node.degree <= 1 && !isStructural(node.path))\n  if (isolated.length > 0) {\n    gaps.push({\n      type: 'isolated-node',\n      title: `${isolated.length} isolated page${isolated.length === 1 ? '' : 's'}`,\n      nodeIds: isolated.map((node) => node.id),\n      suggestion:\n        'Add cross-links, sources, or follow-up research to connect these pages to the knowledge graph.',\n    })\n  }\n  for (const community of graph.communities) {\n    if (community.nodeIds.length >= 3 && community.cohesion < 0.15) {\n      gaps.push({\n        type: 'sparse-community',\n        title: `Sparse cluster: ${community.topTitles[0] ?? `community ${community.id}`}`,\n        nodeIds: community.nodeIds,\n        suggestion:\n          'This cluster has weak internal evidence. Add synthesis pages or relation links between its strongest concepts.',\n      })\n    }\n  }\n  const byCommunityNeighbors = new Map<string, Set<number>>()\n  const nodeById = new Map(graph.nodes.map((node) => [node.id, node]))\n  for (const edge of graph.edges) {\n    const source = nodeById.get(edge.source)\n    const target = nodeById.get(edge.target)\n    if (!source || !target) continue\n    if (!byCommunityNeighbors.has(source.id)) byCommunityNeighbors.set(source.id, new Set())\n    if (!byCommunityNeighbors.has(target.id)) byCommunityNeighbors.set(target.id, new Set())\n    byCommunityNeighbors.get(source.id)!.add(target.community)\n    byCommunityNeighbors.get(target.id)!.add(source.community)\n  }\n  for (const node of graph.nodes) {\n    if ((byCommunityNeighbors.get(node.id)?.size ?? 0) >= 3) {\n      gaps.push({\n        type: 'bridge-node',\n        title: `Bridge page: ${node.title}`,\n        nodeIds: [node.id],\n        suggestion: 'This page connects multiple knowledge areas. Keep it well cited and current.',\n      })\n    }\n  }\n  return gaps.slice(0, limit)\n}\n\nexport function findSurprisingConnections(\n  graph: KnowledgeVizGraph,\n  limit = 10,\n): SurprisingConnection[] {\n  const nodeById = new Map(graph.nodes.map((node) => [node.id, node]))\n  const scored: SurprisingConnection[] = []\n  for (const edge of graph.edges) {\n    const source = nodeById.get(edge.source)\n    const target = nodeById.get(edge.target)\n    if (!source || !target) continue\n    let score = edge.weight\n    const reasons = [...edge.reasons]\n    if (source.community !== target.community) {\n      score += 3\n      reasons.push('cross-community')\n    }\n    if (source.tags.some((tag) => !target.tags.includes(tag))) {\n      score += 1\n      reasons.push('cross-tag')\n    }\n    if (score >= 3) scored.push({ source, target, score, reasons })\n  }\n  return scored.sort((a, b) => b.score - a.score).slice(0, limit)\n}\n\nfunction buildAdjacency(graph: KnowledgeGraph): Map<string, Set<string>> {\n  const out = new Map<string, Set<string>>()\n  for (const node of graph.nodes) out.set(node.id, new Set())\n  for (const edge of graph.edges) {\n    out.get(edge.source)?.add(edge.target)\n    out.get(edge.target)?.add(edge.source)\n  }\n  return out\n}\n\nfunction assignCommunities(\n  nodes: KnowledgeGraphNode[],\n  adjacency: Map<string, Set<string>>,\n): KnowledgeCommunity[] {\n  const seen = new Set<string>()\n  const communities: KnowledgeCommunity[] = []\n  for (const node of nodes) {\n    if (seen.has(node.id)) continue\n    const queue = [node.id]\n    const ids: string[] = []\n    seen.add(node.id)\n    while (queue.length > 0) {\n      const id = queue.shift()!\n      ids.push(id)\n      for (const next of adjacency.get(id) ?? []) {\n        if (!seen.has(next)) {\n          seen.add(next)\n          queue.push(next)\n        }\n      }\n    }\n    const memberNodes = ids\n      .map((id) => nodes.find((candidate) => candidate.id === id))\n      .filter((item): item is KnowledgeGraphNode => Boolean(item))\n    communities.push({\n      id: communities.length,\n      nodeIds: ids,\n      topTitles: memberNodes\n        .sort((a, b) => b.inDegree + b.outDegree - (a.inDegree + a.outDegree))\n        .slice(0, 5)\n        .map((item) => item.title),\n      cohesion: cohesion(ids, adjacency),\n    })\n  }\n  return communities.sort((a, b) => b.nodeIds.length - a.nodeIds.length)\n}\n\nfunction cohesion(ids: string[], adjacency: Map<string, Set<string>>): number {\n  if (ids.length < 2) return 0\n  let edges = 0\n  const idSet = new Set(ids)\n  for (const id of ids) {\n    for (const next of adjacency.get(id) ?? []) {\n      if (idSet.has(next)) edges++\n    }\n  }\n  return edges / (ids.length * (ids.length - 1))\n}\n\nfunction hashNode(id: string): number {\n  let hash = 0\n  for (const char of id) hash = (hash * 31 + char.charCodeAt(0)) | 0\n  return hash\n}\n\nfunction isStructural(path: string): boolean {\n  return path.endsWith('/index.md') || path.endsWith('/log.md')\n}\n"],"mappings":";AAsCA,SAAgB,oBAAoB,OAA0C;CAC5E,MAAM,YAAY,eAAe,KAAK;CACtC,MAAM,cAAc,kBAAkB,MAAM,OAAO,SAAS;CAC5D,MAAM,kCAAkB,IAAI,IAAoB;CAChD,YAAY,SAAS,cAAc;EACjC,KAAK,MAAM,UAAU,UAAU,SAAS,gBAAgB,IAAI,SAAS,MAAM,GAAG,UAAU,EAAE;CAC5F,CAAC;CAMD,OAAO;EACL,OANY,MAAM,MAAM,KAAK,UAAU;GACvC,GAAG;GACH,QAAQ,KAAK,WAAW,KAAK;GAC7B,WAAW,gBAAgB,IAAI,SAAS,KAAK,EAAE,CAAC,KAAK;EACvD,EAEM;EACJ,OAAO,MAAM,MAAM,KAAK,UAAU;GAAE,GAAG;GAAM,IAAI,GAAG,KAAK,OAAO,IAAI,KAAK;EAAS,EAAE;EACpF;CACF;AACF;AAEA,SAAgB,oBAAoB,OAA0B,QAAQ,IAAoB;CACxF,MAAM,OAAuB,CAAC;CAC9B,MAAM,WAAW,MAAM,MAAM,QAAQ,SAAS,KAAK,UAAU,KAAK,CAAC,aAAa,KAAK,IAAI,CAAC;CAC1F,IAAI,SAAS,SAAS,GACpB,KAAK,KAAK;EACR,MAAM;EACN,OAAO,GAAG,SAAS,OAAO,gBAAgB,SAAS,WAAW,IAAI,KAAK;EACvE,SAAS,SAAS,KAAK,SAAS,KAAK,EAAE;EACvC,YACE;CACJ,CAAC;CAEH,KAAK,MAAM,aAAa,MAAM,aAC5B,IAAI,UAAU,QAAQ,UAAU,KAAK,UAAU,WAAW,KACxD,KAAK,KAAK;EACR,MAAM;EACN,OAAO,mBAAmB,UAAU,UAAU,MAAM,aAAa,UAAU;EAC3E,SAAS,UAAU;EACnB,YACE;CACJ,CAAC;CAGL,MAAM,uCAAuB,IAAI,IAAyB;CAC1D,MAAM,WAAW,IAAI,IAAI,MAAM,MAAM,KAAK,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CACnE,KAAK,MAAM,QAAQ,MAAM,OAAO;EAC9B,MAAM,SAAS,SAAS,IAAI,KAAK,MAAM;EACvC,MAAM,SAAS,SAAS,IAAI,KAAK,MAAM;EACvC,IAAI,CAAC,UAAU,CAAC,QAAQ;EACxB,IAAI,CAAC,qBAAqB,IAAI,OAAO,EAAE,GAAG,qBAAqB,IAAI,OAAO,oBAAI,IAAI,IAAI,CAAC;EACvF,IAAI,CAAC,qBAAqB,IAAI,OAAO,EAAE,GAAG,qBAAqB,IAAI,OAAO,oBAAI,IAAI,IAAI,CAAC;EACvF,qBAAqB,IAAI,OAAO,EAAE,CAAC,CAAE,IAAI,OAAO,SAAS;EACzD,qBAAqB,IAAI,OAAO,EAAE,CAAC,CAAE,IAAI,OAAO,SAAS;CAC3D;CACA,KAAK,MAAM,QAAQ,MAAM,OACvB,KAAK,qBAAqB,IAAI,KAAK,EAAE,CAAC,EAAE,QAAQ,MAAM,GACpD,KAAK,KAAK;EACR,MAAM;EACN,OAAO,gBAAgB,KAAK;EAC5B,SAAS,CAAC,KAAK,EAAE;EACjB,YAAY;CACd,CAAC;CAGL,OAAO,KAAK,MAAM,GAAG,KAAK;AAC5B;AAEA,SAAgB,0BACd,OACA,QAAQ,IACgB;CACxB,MAAM,WAAW,IAAI,IAAI,MAAM,MAAM,KAAK,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CACnE,MAAM,SAAiC,CAAC;CACxC,KAAK,MAAM,QAAQ,MAAM,OAAO;EAC9B,MAAM,SAAS,SAAS,IAAI,KAAK,MAAM;EACvC,MAAM,SAAS,SAAS,IAAI,KAAK,MAAM;EACvC,IAAI,CAAC,UAAU,CAAC,QAAQ;EACxB,IAAI,QAAQ,KAAK;EACjB,MAAM,UAAU,CAAC,GAAG,KAAK,OAAO;EAChC,IAAI,OAAO,cAAc,OAAO,WAAW;GACzC,SAAS;GACT,QAAQ,KAAK,iBAAiB;EAChC;EACA,IAAI,OAAO,KAAK,MAAM,QAAQ,CAAC,OAAO,KAAK,SAAS,GAAG,CAAC,GAAG;GACzD,SAAS;GACT,QAAQ,KAAK,WAAW;EAC1B;EACA,IAAI,SAAS,GAAG,OAAO,KAAK;GAAE;GAAQ;GAAQ;GAAO;EAAQ,CAAC;CAChE;CACA,OAAO,OAAO,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,GAAG,KAAK;AAChE;AAEA,SAAS,eAAe,OAAiD;CACvE,MAAM,sBAAM,IAAI,IAAyB;CACzC,KAAK,MAAM,QAAQ,MAAM,OAAO,IAAI,IAAI,KAAK,oBAAI,IAAI,IAAI,CAAC;CAC1D,KAAK,MAAM,QAAQ,MAAM,OAAO;EAC9B,IAAI,IAAI,KAAK,MAAM,CAAC,EAAE,IAAI,KAAK,MAAM;EACrC,IAAI,IAAI,KAAK,MAAM,CAAC,EAAE,IAAI,KAAK,MAAM;CACvC;CACA,OAAO;AACT;AAEA,SAAS,kBACP,OACA,WACsB;CACtB,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,cAAoC,CAAC;CAC3C,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,IAAI,KAAK,EAAE,GAAG;EACvB,MAAM,QAAQ,CAAC,KAAK,EAAE;EACtB,MAAM,MAAgB,CAAC;EACvB,KAAK,IAAI,KAAK,EAAE;EAChB,OAAO,MAAM,SAAS,GAAG;GACvB,MAAM,KAAK,MAAM,MAAM;GACvB,IAAI,KAAK,EAAE;GACX,KAAK,MAAM,QAAQ,UAAU,IAAI,EAAE,KAAK,CAAC,GACvC,IAAI,CAAC,KAAK,IAAI,IAAI,GAAG;IACnB,KAAK,IAAI,IAAI;IACb,MAAM,KAAK,IAAI;GACjB;EAEJ;EACA,MAAM,cAAc,IACjB,KAAK,OAAO,MAAM,MAAM,cAAc,UAAU,OAAO,EAAE,CAAC,CAAC,CAC3D,QAAQ,SAAqC,QAAQ,IAAI,CAAC;EAC7D,YAAY,KAAK;GACf,IAAI,YAAY;GAChB,SAAS;GACT,WAAW,YACR,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,aAAa,EAAE,WAAW,EAAE,UAAU,CAAC,CACrE,MAAM,GAAG,CAAC,CAAC,CACX,KAAK,SAAS,KAAK,KAAK;GAC3B,UAAU,SAAS,KAAK,SAAS;EACnC,CAAC;CACH;CACA,OAAO,YAAY,MAAM,GAAG,MAAM,EAAE,QAAQ,SAAS,EAAE,QAAQ,MAAM;AACvE;AAEA,SAAS,SAAS,KAAe,WAA6C;CAC5E,IAAI,IAAI,SAAS,GAAG,OAAO;CAC3B,IAAI,QAAQ;CACZ,MAAM,QAAQ,IAAI,IAAI,GAAG;CACzB,KAAK,MAAM,MAAM,KACf,KAAK,MAAM,QAAQ,UAAU,IAAI,EAAE,KAAK,CAAC,GACvC,IAAI,MAAM,IAAI,IAAI,GAAG;CAGzB,OAAO,SAAS,IAAI,UAAU,IAAI,SAAS;AAC7C;AAEA,SAAS,SAAS,IAAoB;CACpC,IAAI,OAAO;CACX,KAAK,MAAM,QAAQ,IAAI,OAAQ,OAAO,KAAK,KAAK,WAAW,CAAC,IAAK;CACjE,OAAO;AACT;AAEA,SAAS,aAAa,MAAuB;CAC3C,OAAO,KAAK,SAAS,WAAW,KAAK,KAAK,SAAS,SAAS;AAC9D"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tangle-network/agent-knowledge",
-  "version": "6.0.0",
+  "version": "6.1.0",
   "description": "Build, search, evaluate, and improve source-backed knowledge bases.",
   "homepage": "https://github.com/tangle-network/agent-knowledge#readme",
   "repository": {
@@ -60,36 +60,47 @@
     "access": "public"
   },
   "scripts": {
-    "build": "tsup",
-    "dev": "tsup --watch",
+    "build": "tsdown",
+    "dev": "tsdown --watch",
     "prepublishOnly": "pnpm build",
     "test": "vitest run",
     "test:watch": "vitest",
-    "typecheck": "tsc --noEmit",
+    "typecheck": "pnpm run typecheck:src && pnpm run typecheck:contracts",
+    "typecheck:src": "tsc --noEmit",
+    "typecheck:contracts": "tsc --noEmit -p tsconfig.contracts.json",
     "lint": "biome check src tests",
     "format": "biome format --write src tests",
     "check:skills": "node scripts/check-skills.mjs",
-    "verify:package": "pnpm run check:skills && node scripts/verify-package.mjs",
+    "verify:package": "pnpm run check:skills && publint && attw --pack --profile esm-only . && node scripts/verify-package.mjs",
     "verify:official-optimizers": "node scripts/verify-official-optimizers.mjs"
   },
   "dependencies": {
-    "@tangle-network/agent-eval": "0.129.0",
-    "@tangle-network/agent-interface": "0.34.0",
+    "@tangle-network/agent-eval": "0.130.1",
+    "@tangle-network/agent-interface": "0.35.0",
     "proper-lockfile": "4.1.2",
     "zod": "^4.4.3"
   },
   "devDependencies": {
+    "@arethetypeswrong/cli": "^0.18.5",
     "@biomejs/biome": "^2.5.5",
     "@neo4j-labs/agent-memory": "0.4.1",
     "@types/node": "^26.1.1",
     "@types/proper-lockfile": "4.1.4",
-    "mem0ai": "3.1.1",
-    "tsup": "^8.0.0",
-    "typescript": "^6.0.3",
+    "mem0ai": "3.1.2",
+    "publint": "^0.3.22",
+    "tsdown": "^0.22.14",
+    "typescript": "^7.0.2",
     "vite": "8.1.5",
     "vitest": "^4.1.10"
   },
   "pnpm": {
+    "ignoredBuiltDependencies": [
+      "@ax-llm/ax",
+      "esbuild"
+    ],
+    "onlyBuiltDependencies": [
+      "better-sqlite3"
+    ],
     "minimumReleaseAge": 4320,
     "minimumReleaseAgeExclude": [
       "@tangle-network/agent-eval",
@@ -98,7 +109,7 @@
       "vite"
     ],
     "overrides": {
-      "@hono/node-server": "2.0.11",
+      "@hono/node-server": "2.0.12",
       "esbuild": "0.28.1",
       "hono": "4.12.32",
       "vite": "8.1.5",

package/dist/benchmarks/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}