@objectstack/knowledge-memory 6.4.0

package/.turbo/turbo-build.log

@@ -0,0 +1,22 @@
+
+> @objectstack/knowledge-memory@6.4.0 build /home/runner/work/framework/framework/packages/plugins/knowledge-memory
+> tsup --config ../../../tsup.config.ts
+
+CLI Building entry: src/index.ts
+CLI Using tsconfig: tsconfig.json
+CLI tsup v8.5.1
+CLI Using tsup config: /home/runner/work/framework/framework/tsup.config.ts
+CLI Target: es2020
+CLI Cleaning output folder
+ESM Build start
+CJS Build start
+ESM dist/index.mjs     4.55 KB
+ESM dist/index.mjs.map 10.79 KB
+ESM ⚡️ Build success in 74ms
+CJS dist/index.js     5.63 KB
+CJS dist/index.js.map 10.83 KB
+CJS ⚡️ Build success in 76ms
+DTS Build start
+DTS ⚡️ Build success in 9029ms
+DTS dist/index.d.mts 1.69 KB
+DTS dist/index.d.ts  1.69 KB

package/CHANGELOG.md

@@ -0,0 +1,28 @@
+# @objectstack/knowledge-memory
+
+## 6.4.0
+
+### Minor Changes
+
+- f8651cc: Knowledge Protocol MVP — protocol-first RAG via adapter plugins.
+
+  **What's new:**
+
+  - `@objectstack/spec` — new `KnowledgeSource` / `KnowledgeDocument` / `KnowledgeChunk` / `KnowledgeHit` schemas (under `@objectstack/spec/ai`) and `IKnowledgeService` / `IKnowledgeAdapter` contracts (under `@objectstack/spec/contracts`).
+  - `@objectstack/service-knowledge` — `KnowledgeService` orchestrator + `KnowledgeServicePlugin`. Routes search/index calls to the appropriate adapter, runs **permission-aware retrieval** by re-checking every hit's `sourceRecordId` against the caller's `ExecutionContext` via `IDataEngine` (same RLS that gates plain ObjectQL), and subscribes to `IRealtimeService` for inline record→adapter sync.
+  - `@objectstack/knowledge-memory` — deterministic, dependency-free in-memory adapter for dev/tests/reference. Hash-token embedder + brute-force cosine + paragraph chunking.
+  - `@objectstack/knowledge-ragflow` — production-grade adapter against the Apache-2.0 [RAGFlow](https://github.com/infiniflow/ragflow) REST API. Plug in your dataset id; ObjectStack handles permission filtering after retrieval.
+  - `@objectstack/service-ai` — new `search_knowledge` tool wired through the registry. Threads the LLM caller's actor into `KnowledgeService.search` so retrieval honours RLS automatically.
+
+  **Why this design:** ObjectStack does NOT own chunking / embedding / vector storage / rerank — those are commodity capabilities best handled by mature OSS (RAGFlow, LlamaIndex, Dify, …). What ObjectStack uniquely owns is the protocol + permission-aware orchestration on top.
+
+  See `content/docs/protocol/knowledge.mdx` for the full design.
+
+### Patch Changes
+
+- Updated dependencies [f8651cc]
+- Updated dependencies [f8651cc]
+- Updated dependencies [0bf6f9a]
+  - @objectstack/spec@6.4.0
+  - @objectstack/service-knowledge@6.4.0
+  - @objectstack/core@6.4.0

package/LICENSE

@@ -0,0 +1,202 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute
+          must include a readable copy of the attribution notices
+          contained within such NOTICE file, excluding those notices
+          that do not pertain to any part of the Derivative Works,
+          in at least one of the following places: within a NOTICE
+          text file distributed as part of the Derivative Works; within
+          the Source form or documentation, if provided along with
+          the Derivative Works; or, within a display generated by the
+          Derivative Works, if and wherever such third-party notices
+          normally appear. The contents of the NOTICE file are for
+          informational purposes only and do not modify the License.
+          You may add Your own attribution notices within Derivative
+          Works that You distribute, alongside or as an addendum to
+          the NOTICE text from the Work, provided that such additional
+          attribution notices cannot be construed as modifying the
+          License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 ObjectStack
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,18 @@
+# @objectstack/knowledge-memory
+
+In-memory `IKnowledgeAdapter` for ObjectStack — chunks documents, embeds with a deterministic hash-based embedder, and answers `search()` via brute-force cosine similarity.
+
+**Purpose**: dev environments, tests, and the reference implementation for the Knowledge Protocol. **Not for production** — there is no persistence, no real semantic understanding, and recall is bounded by simple token overlap.
+
+```ts
+import { ObjectKernel } from '@objectstack/core';
+import { KnowledgeServicePlugin } from '@objectstack/service-knowledge';
+import { KnowledgeMemoryPlugin } from '@objectstack/knowledge-memory';
+
+const kernel = new ObjectKernel();
+kernel.use(new KnowledgeServicePlugin({
+  sources: [{ id: 'task_notes', label: 'Notes', adapter: 'memory',
+    source: { kind: 'object', object: 'task', contentFields: ['notes'] }}],
+}));
+kernel.use(new KnowledgeMemoryPlugin());
+```

package/dist/index.d.mts

@@ -0,0 +1,45 @@
+import { IKnowledgeAdapter, AdapterContext, AdapterSearchOptions } from '@objectstack/spec/contracts';
+import { KnowledgeDocument, KnowledgeHit } from '@objectstack/spec/ai';
+import { Plugin, PluginContext } from '@objectstack/core';
+
+/**
+ * In-memory knowledge adapter. Stores per-source document maps,
+ * chunks documents naively on paragraph boundaries (with a soft 800-char
+ * cap), embeds each chunk as a sparse token-frequency vector, and
+ * answers `search()` via brute-force cosine similarity.
+ *
+ * Deterministic — same input always produces the same hits — so it's
+ * great for tests and reference implementations. **Don't use in prod.**
+ */
+declare class KnowledgeMemoryAdapter implements IKnowledgeAdapter {
+    readonly id: string;
+    private readonly store;
+    constructor(id?: string);
+    upsert(docs: KnowledgeDocument[], ctx: AdapterContext): Promise<void>;
+    delete(documentIds: string[], ctx: AdapterContext): Promise<void>;
+    search(query: string, opts: AdapterSearchOptions): Promise<KnowledgeHit[]>;
+    healthCheck(): Promise<{
+        ok: boolean;
+        message?: string;
+    }>;
+}
+
+interface KnowledgeMemoryPluginOptions {
+    /** Adapter id. @default 'memory' */
+    id?: string;
+}
+/**
+ * `KnowledgeMemoryPlugin` — registers a `KnowledgeMemoryAdapter` with
+ * the host's `IKnowledgeService` during `start()`.
+ */
+declare class KnowledgeMemoryPlugin implements Plugin {
+    name: string;
+    version: string;
+    type: string;
+    private readonly adapter;
+    constructor(opts?: KnowledgeMemoryPluginOptions);
+    init(_ctx: PluginContext): Promise<void>;
+    start(ctx: PluginContext): Promise<void>;
+}
+
+export { KnowledgeMemoryAdapter, KnowledgeMemoryPlugin, type KnowledgeMemoryPluginOptions };

package/dist/index.d.ts

@@ -0,0 +1,45 @@
+import { IKnowledgeAdapter, AdapterContext, AdapterSearchOptions } from '@objectstack/spec/contracts';
+import { KnowledgeDocument, KnowledgeHit } from '@objectstack/spec/ai';
+import { Plugin, PluginContext } from '@objectstack/core';
+
+/**
+ * In-memory knowledge adapter. Stores per-source document maps,
+ * chunks documents naively on paragraph boundaries (with a soft 800-char
+ * cap), embeds each chunk as a sparse token-frequency vector, and
+ * answers `search()` via brute-force cosine similarity.
+ *
+ * Deterministic — same input always produces the same hits — so it's
+ * great for tests and reference implementations. **Don't use in prod.**
+ */
+declare class KnowledgeMemoryAdapter implements IKnowledgeAdapter {
+    readonly id: string;
+    private readonly store;
+    constructor(id?: string);
+    upsert(docs: KnowledgeDocument[], ctx: AdapterContext): Promise<void>;
+    delete(documentIds: string[], ctx: AdapterContext): Promise<void>;
+    search(query: string, opts: AdapterSearchOptions): Promise<KnowledgeHit[]>;
+    healthCheck(): Promise<{
+        ok: boolean;
+        message?: string;
+    }>;
+}
+
+interface KnowledgeMemoryPluginOptions {
+    /** Adapter id. @default 'memory' */
+    id?: string;
+}
+/**
+ * `KnowledgeMemoryPlugin` — registers a `KnowledgeMemoryAdapter` with
+ * the host's `IKnowledgeService` during `start()`.
+ */
+declare class KnowledgeMemoryPlugin implements Plugin {
+    name: string;
+    version: string;
+    type: string;
+    private readonly adapter;
+    constructor(opts?: KnowledgeMemoryPluginOptions);
+    init(_ctx: PluginContext): Promise<void>;
+    start(ctx: PluginContext): Promise<void>;
+}
+
+export { KnowledgeMemoryAdapter, KnowledgeMemoryPlugin, type KnowledgeMemoryPluginOptions };

package/dist/index.js

@@ -0,0 +1,182 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/index.ts
+var index_exports = {};
+__export(index_exports, {
+  KnowledgeMemoryAdapter: () => KnowledgeMemoryAdapter,
+  KnowledgeMemoryPlugin: () => KnowledgeMemoryPlugin
+});
+module.exports = __toCommonJS(index_exports);
+var import_contracts = require("@objectstack/spec/contracts");
+var KnowledgeMemoryAdapter = class {
+  constructor(id = "memory") {
+    this.store = /* @__PURE__ */ new Map();
+    this.id = id;
+  }
+  async upsert(docs, ctx) {
+    const sourceId = ctx.source.id;
+    const existing = this.store.get(sourceId) ?? [];
+    const byDoc = /* @__PURE__ */ new Map();
+    for (const c of existing) {
+      const arr = byDoc.get(c.documentId) ?? [];
+      arr.push(c);
+      byDoc.set(c.documentId, arr);
+    }
+    for (const doc of docs) {
+      byDoc.set(doc.id, chunkAndEmbed(doc));
+    }
+    this.store.set(sourceId, Array.from(byDoc.values()).flat());
+  }
+  async delete(documentIds, ctx) {
+    const sourceId = ctx.source.id;
+    const chunks = this.store.get(sourceId);
+    if (!chunks) return;
+    const dropSet = new Set(documentIds);
+    this.store.set(
+      sourceId,
+      chunks.filter((c) => !dropSet.has(c.documentId))
+    );
+  }
+  async search(query, opts) {
+    const chunks = this.store.get(opts.source.id) ?? [];
+    if (chunks.length === 0) return [];
+    const qVec = embedTokens(tokenize(query));
+    const qNorm = vectorNorm(qVec);
+    if (qNorm === 0) return [];
+    const filter = opts.filter ?? {};
+    const filtered = Object.keys(filter).length ? chunks.filter((c) => matchesFilter(c.metadata, filter)) : chunks;
+    const scored = filtered.map((c) => ({
+      chunk: c,
+      score: cosineSimilarity(qVec, c.vector, qNorm, c.vectorNorm)
+    }));
+    scored.sort((a, b) => b.score - a.score);
+    const top = scored.slice(0, opts.topK).filter((s) => s.score > 0);
+    return top.map(({ chunk, score }) => ({
+      chunkId: chunk.chunkId,
+      documentId: chunk.documentId,
+      sourceId: opts.source.id,
+      sourceRecordId: chunk.sourceRecordId,
+      score,
+      snippet: chunk.content,
+      title: chunk.title,
+      metadata: chunk.metadata
+    }));
+  }
+  async healthCheck() {
+    return { ok: true, message: `memory adapter (${this.store.size} sources)` };
+  }
+};
+var CHUNK_TARGET = 800;
+function chunkAndEmbed(doc) {
+  const paragraphs = doc.content.split(/\n{2,}/).map((p) => p.trim()).filter(Boolean);
+  const chunks = [];
+  let buf = "";
+  for (const p of paragraphs.length ? paragraphs : [doc.content]) {
+    if (buf && buf.length + p.length + 2 > CHUNK_TARGET) {
+      chunks.push(buf);
+      buf = "";
+    }
+    if (p.length > CHUNK_TARGET) {
+      if (buf) {
+        chunks.push(buf);
+        buf = "";
+      }
+      for (let i = 0; i < p.length; i += CHUNK_TARGET) {
+        chunks.push(p.slice(i, i + CHUNK_TARGET));
+      }
+    } else {
+      buf = buf ? `${buf}
+
+${p}` : p;
+    }
+  }
+  if (buf) chunks.push(buf);
+  return chunks.map((content, idx) => {
+    const vec = embedTokens(tokenize(content));
+    return {
+      chunkId: `${doc.id}#${idx}`,
+      documentId: doc.id,
+      sourceRecordId: doc.sourceRecordId,
+      content,
+      title: doc.title,
+      metadata: doc.metadata ?? {},
+      vector: vec,
+      vectorNorm: vectorNorm(vec)
+    };
+  });
+}
+function tokenize(text) {
+  return text.toLowerCase().split(/[^a-z0-9\u4e00-\u9fff]+/i).filter((t) => t.length > 1);
+}
+function embedTokens(tokens) {
+  const vec = /* @__PURE__ */ new Map();
+  for (const t of tokens) vec.set(t, (vec.get(t) ?? 0) + 1);
+  return vec;
+}
+function vectorNorm(v) {
+  let s = 0;
+  for (const x of v.values()) s += x * x;
+  return Math.sqrt(s);
+}
+function cosineSimilarity(a, b, aNorm = vectorNorm(a), bNorm = vectorNorm(b)) {
+  if (aNorm === 0 || bNorm === 0) return 0;
+  const [small, big] = a.size < b.size ? [a, b] : [b, a];
+  let dot = 0;
+  for (const [k, v] of small) {
+    const w = big.get(k);
+    if (w) dot += v * w;
+  }
+  return dot / (aNorm * bNorm);
+}
+function matchesFilter(metadata, filter) {
+  for (const [k, v] of Object.entries(filter)) {
+    if (metadata[k] !== v) return false;
+  }
+  return true;
+}
+var KnowledgeMemoryPlugin = class {
+  constructor(opts = {}) {
+    this.name = "com.objectstack.plugin.knowledge-memory";
+    this.version = "0.1.0";
+    this.type = "standard";
+    this.adapter = new KnowledgeMemoryAdapter(opts.id ?? "memory");
+  }
+  async init(_ctx) {
+  }
+  async start(ctx) {
+    let svc;
+    try {
+      svc = ctx.getService(import_contracts.KNOWLEDGE_SERVICE);
+    } catch {
+      ctx.logger.warn?.(
+        "KnowledgeMemoryPlugin: IKnowledgeService not registered \u2014 install KnowledgeServicePlugin first."
+      );
+      return;
+    }
+    svc.registerAdapter(this.adapter.id, this.adapter);
+    ctx.logger.info?.(`KnowledgeMemoryPlugin: adapter '${this.adapter.id}' registered.`);
+  }
+};
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  KnowledgeMemoryAdapter,
+  KnowledgeMemoryPlugin
+});
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts"],"sourcesContent":["// Copyright (c) 2025 ObjectStack. Licensed under the Apache-2.0 license.\n\nimport type {\n  IKnowledgeAdapter,\n  IKnowledgeService,\n  AdapterContext,\n  AdapterSearchOptions,\n} from '@objectstack/spec/contracts';\nimport type {\n  KnowledgeDocument,\n  KnowledgeHit,\n} from '@objectstack/spec/ai';\nimport { KNOWLEDGE_SERVICE } from '@objectstack/spec/contracts';\n\n/**\n * In-memory knowledge adapter. Stores per-source document maps,\n * chunks documents naively on paragraph boundaries (with a soft 800-char\n * cap), embeds each chunk as a sparse token-frequency vector, and\n * answers `search()` via brute-force cosine similarity.\n *\n * Deterministic — same input always produces the same hits — so it's\n * great for tests and reference implementations. **Don't use in prod.**\n */\nexport class KnowledgeMemoryAdapter implements IKnowledgeAdapter {\n  readonly id: string;\n  private readonly store = new Map<string, ChunkRecord[]>();\n\n  constructor(id = 'memory') {\n    this.id = id;\n  }\n\n  async upsert(docs: KnowledgeDocument[], ctx: AdapterContext): Promise<void> {\n    const sourceId = ctx.source.id;\n    const existing = this.store.get(sourceId) ?? [];\n    const byDoc = new Map<string, ChunkRecord[]>();\n    for (const c of existing) {\n      const arr = byDoc.get(c.documentId) ?? [];\n      arr.push(c);\n      byDoc.set(c.documentId, arr);\n    }\n    for (const doc of docs) {\n      byDoc.set(doc.id, chunkAndEmbed(doc));\n    }\n    this.store.set(sourceId, Array.from(byDoc.values()).flat());\n  }\n\n  async delete(documentIds: string[], ctx: AdapterContext): Promise<void> {\n    const sourceId = ctx.source.id;\n    const chunks = this.store.get(sourceId);\n    if (!chunks) return;\n    const dropSet = new Set(documentIds);\n    this.store.set(\n      sourceId,\n      chunks.filter((c) => !dropSet.has(c.documentId)),\n    );\n  }\n\n  async search(query: string, opts: AdapterSearchOptions): Promise<KnowledgeHit[]> {\n    const chunks = this.store.get(opts.source.id) ?? [];\n    if (chunks.length === 0) return [];\n    const qVec = embedTokens(tokenize(query));\n    const qNorm = vectorNorm(qVec);\n    if (qNorm === 0) return [];\n\n    const filter = opts.filter ?? {};\n    const filtered = Object.keys(filter).length\n      ? chunks.filter((c) => matchesFilter(c.metadata, filter))\n      : chunks;\n\n    const scored = filtered.map((c) => ({\n      chunk: c,\n      score: cosineSimilarity(qVec, c.vector, qNorm, c.vectorNorm),\n    }));\n    scored.sort((a, b) => b.score - a.score);\n    const top = scored.slice(0, opts.topK).filter((s) => s.score > 0);\n    return top.map<KnowledgeHit>(({ chunk, score }) => ({\n      chunkId: chunk.chunkId,\n      documentId: chunk.documentId,\n      sourceId: opts.source.id,\n      sourceRecordId: chunk.sourceRecordId,\n      score,\n      snippet: chunk.content,\n      title: chunk.title,\n      metadata: chunk.metadata,\n    }));\n  }\n\n  async healthCheck(): Promise<{ ok: boolean; message?: string }> {\n    return { ok: true, message: `memory adapter (${this.store.size} sources)` };\n  }\n}\n\ninterface ChunkRecord {\n  chunkId: string;\n  documentId: string;\n  sourceRecordId?: string;\n  content: string;\n  title?: string;\n  metadata: Record<string, unknown>;\n  vector: Map<string, number>;\n  vectorNorm: number;\n}\n\nconst CHUNK_TARGET = 800;\n\nfunction chunkAndEmbed(doc: KnowledgeDocument): ChunkRecord[] {\n  const paragraphs = doc.content\n    .split(/\\n{2,}/)\n    .map((p) => p.trim())\n    .filter(Boolean);\n  const chunks: string[] = [];\n  let buf = '';\n  for (const p of paragraphs.length ? paragraphs : [doc.content]) {\n    if (buf && buf.length + p.length + 2 > CHUNK_TARGET) {\n      chunks.push(buf);\n      buf = '';\n    }\n    if (p.length > CHUNK_TARGET) {\n      if (buf) {\n        chunks.push(buf);\n        buf = '';\n      }\n      for (let i = 0; i < p.length; i += CHUNK_TARGET) {\n        chunks.push(p.slice(i, i + CHUNK_TARGET));\n      }\n    } else {\n      buf = buf ? `${buf}\\n\\n${p}` : p;\n    }\n  }\n  if (buf) chunks.push(buf);\n  return chunks.map((content, idx) => {\n    const vec = embedTokens(tokenize(content));\n    return {\n      chunkId: `${doc.id}#${idx}`,\n      documentId: doc.id,\n      sourceRecordId: doc.sourceRecordId,\n      content,\n      title: doc.title,\n      metadata: doc.metadata ?? {},\n      vector: vec,\n      vectorNorm: vectorNorm(vec),\n    };\n  });\n}\n\nfunction tokenize(text: string): string[] {\n  return text\n    .toLowerCase()\n    .split(/[^a-z0-9\\u4e00-\\u9fff]+/i)\n    .filter((t) => t.length > 1);\n}\n\nfunction embedTokens(tokens: string[]): Map<string, number> {\n  const vec = new Map<string, number>();\n  for (const t of tokens) vec.set(t, (vec.get(t) ?? 0) + 1);\n  return vec;\n}\n\nfunction vectorNorm(v: Map<string, number>): number {\n  let s = 0;\n  for (const x of v.values()) s += x * x;\n  return Math.sqrt(s);\n}\n\nfunction cosineSimilarity(\n  a: Map<string, number>,\n  b: Map<string, number>,\n  aNorm = vectorNorm(a),\n  bNorm = vectorNorm(b),\n): number {\n  if (aNorm === 0 || bNorm === 0) return 0;\n  // iterate smaller map\n  const [small, big] = a.size < b.size ? [a, b] : [b, a];\n  let dot = 0;\n  for (const [k, v] of small) {\n    const w = big.get(k);\n    if (w) dot += v * w;\n  }\n  return dot / (aNorm * bNorm);\n}\n\nfunction matchesFilter(\n  metadata: Record<string, unknown>,\n  filter: Record<string, unknown>,\n): boolean {\n  for (const [k, v] of Object.entries(filter)) {\n    if (metadata[k] !== v) return false;\n  }\n  return true;\n}\n\n/* ---------------------------------------------------------------- */\n/* Kernel plugin glue                                               */\n/* ---------------------------------------------------------------- */\n\nimport type { Plugin, PluginContext } from '@objectstack/core';\n\nexport interface KnowledgeMemoryPluginOptions {\n  /** Adapter id. @default 'memory' */\n  id?: string;\n}\n\n/**\n * `KnowledgeMemoryPlugin` — registers a `KnowledgeMemoryAdapter` with\n * the host's `IKnowledgeService` during `start()`.\n */\nexport class KnowledgeMemoryPlugin implements Plugin {\n  name = 'com.objectstack.plugin.knowledge-memory';\n  version = '0.1.0';\n  type = 'standard';\n\n  private readonly adapter: KnowledgeMemoryAdapter;\n\n  constructor(opts: KnowledgeMemoryPluginOptions = {}) {\n    this.adapter = new KnowledgeMemoryAdapter(opts.id ?? 'memory');\n  }\n\n  async init(_ctx: PluginContext): Promise<void> {\n    // No-op: registration happens in start() once IKnowledgeService is up.\n  }\n\n  async start(ctx: PluginContext): Promise<void> {\n    let svc: IKnowledgeService | undefined;\n    try {\n      svc = ctx.getService<IKnowledgeService>(KNOWLEDGE_SERVICE);\n    } catch {\n      ctx.logger.warn?.(\n        'KnowledgeMemoryPlugin: IKnowledgeService not registered — install KnowledgeServicePlugin first.',\n      );\n      return;\n    }\n    svc.registerAdapter(this.adapter.id, this.adapter);\n    ctx.logger.info?.(`KnowledgeMemoryPlugin: adapter '${this.adapter.id}' registered.`);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYA,uBAAkC;AAW3B,IAAM,yBAAN,MAA0D;AAAA,EAI/D,YAAY,KAAK,UAAU;AAF3B,SAAiB,QAAQ,oBAAI,IAA2B;AAGtD,SAAK,KAAK;AAAA,EACZ;AAAA,EAEA,MAAM,OAAO,MAA2B,KAAoC;AAC1E,UAAM,WAAW,IAAI,OAAO;AAC5B,UAAM,WAAW,KAAK,MAAM,IAAI,QAAQ,KAAK,CAAC;AAC9C,UAAM,QAAQ,oBAAI,IAA2B;AAC7C,eAAW,KAAK,UAAU;AACxB,YAAM,MAAM,MAAM,IAAI,EAAE,UAAU,KAAK,CAAC;AACxC,UAAI,KAAK,CAAC;AACV,YAAM,IAAI,EAAE,YAAY,GAAG;AAAA,IAC7B;AACA,eAAW,OAAO,MAAM;AACtB,YAAM,IAAI,IAAI,IAAI,cAAc,GAAG,CAAC;AAAA,IACtC;AACA,SAAK,MAAM,IAAI,UAAU,MAAM,KAAK,MAAM,OAAO,CAAC,EAAE,KAAK,CAAC;AAAA,EAC5D;AAAA,EAEA,MAAM,OAAO,aAAuB,KAAoC;AACtE,UAAM,WAAW,IAAI,OAAO;AAC5B,UAAM,SAAS,KAAK,MAAM,IAAI,QAAQ;AACtC,QAAI,CAAC,OAAQ;AACb,UAAM,UAAU,IAAI,IAAI,WAAW;AACnC,SAAK,MAAM;AAAA,MACT;AAAA,MACA,OAAO,OAAO,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,UAAU,CAAC;AAAA,IACjD;AAAA,EACF;AAAA,EAEA,MAAM,OAAO,OAAe,MAAqD;AAC/E,UAAM,SAAS,KAAK,MAAM,IAAI,KAAK,OAAO,EAAE,KAAK,CAAC;AAClD,QAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AACjC,UAAM,OAAO,YAAY,SAAS,KAAK,CAAC;AACxC,UAAM,QAAQ,WAAW,IAAI;AAC7B,QAAI,UAAU,EAAG,QAAO,CAAC;AAEzB,UAAM,SAAS,KAAK,UAAU,CAAC;AAC/B,UAAM,WAAW,OAAO,KAAK,MAAM,EAAE,SACjC,OAAO,OAAO,CAAC,MAAM,cAAc,EAAE,UAAU,MAAM,CAAC,IACtD;AAEJ,UAAM,SAAS,SAAS,IAAI,CAAC,OAAO;AAAA,MAClC,OAAO;AAAA,MACP,OAAO,iBAAiB,MAAM,EAAE,QAAQ,OAAO,EAAE,UAAU;AAAA,IAC7D,EAAE;AACF,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACvC,UAAM,MAAM,OAAO,MAAM,GAAG,KAAK,IAAI,EAAE,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC;AAChE,WAAO,IAAI,IAAkB,CAAC,EAAE,OAAO,MAAM,OAAO;AAAA,MAClD,SAAS,MAAM;AAAA,MACf,YAAY,MAAM;AAAA,MAClB,UAAU,KAAK,OAAO;AAAA,MACtB,gBAAgB,MAAM;AAAA,MACtB;AAAA,MACA,SAAS,MAAM;AAAA,MACf,OAAO,MAAM;AAAA,MACb,UAAU,MAAM;AAAA,IAClB,EAAE;AAAA,EACJ;AAAA,EAEA,MAAM,cAA0D;AAC9D,WAAO,EAAE,IAAI,MAAM,SAAS,mBAAmB,KAAK,MAAM,IAAI,YAAY;AAAA,EAC5E;AACF;AAaA,IAAM,eAAe;AAErB,SAAS,cAAc,KAAuC;AAC5D,QAAM,aAAa,IAAI,QACpB,MAAM,QAAQ,EACd,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,OAAO;AACjB,QAAM,SAAmB,CAAC;AAC1B,MAAI,MAAM;AACV,aAAW,KAAK,WAAW,SAAS,aAAa,CAAC,IAAI,OAAO,GAAG;AAC9D,QAAI,OAAO,IAAI,SAAS,EAAE,SAAS,IAAI,cAAc;AACnD,aAAO,KAAK,GAAG;AACf,YAAM;AAAA,IACR;AACA,QAAI,EAAE,SAAS,cAAc;AAC3B,UAAI,KAAK;AACP,eAAO,KAAK,GAAG;AACf,cAAM;AAAA,MACR;AACA,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,cAAc;AAC/C,eAAO,KAAK,EAAE,MAAM,GAAG,IAAI,YAAY,CAAC;AAAA,MAC1C;AAAA,IACF,OAAO;AACL,YAAM,MAAM,GAAG,GAAG;AAAA;AAAA,EAAO,CAAC,KAAK;AAAA,IACjC;AAAA,EACF;AACA,MAAI,IAAK,QAAO,KAAK,GAAG;AACxB,SAAO,OAAO,IAAI,CAAC,SAAS,QAAQ;AAClC,UAAM,MAAM,YAAY,SAAS,OAAO,CAAC;AACzC,WAAO;AAAA,MACL,SAAS,GAAG,IAAI,EAAE,IAAI,GAAG;AAAA,MACzB,YAAY,IAAI;AAAA,MAChB,gBAAgB,IAAI;AAAA,MACpB;AAAA,MACA,OAAO,IAAI;AAAA,MACX,UAAU,IAAI,YAAY,CAAC;AAAA,MAC3B,QAAQ;AAAA,MACR,YAAY,WAAW,GAAG;AAAA,IAC5B;AAAA,EACF,CAAC;AACH;AAEA,SAAS,SAAS,MAAwB;AACxC,SAAO,KACJ,YAAY,EACZ,MAAM,0BAA0B,EAChC,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC/B;AAEA,SAAS,YAAY,QAAuC;AAC1D,QAAM,MAAM,oBAAI,IAAoB;AACpC,aAAW,KAAK,OAAQ,KAAI,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC;AACxD,SAAO;AACT;AAEA,SAAS,WAAW,GAAgC;AAClD,MAAI,IAAI;AACR,aAAW,KAAK,EAAE,OAAO,EAAG,MAAK,IAAI;AACrC,SAAO,KAAK,KAAK,CAAC;AACpB;AAEA,SAAS,iBACP,GACA,GACA,QAAQ,WAAW,CAAC,GACpB,QAAQ,WAAW,CAAC,GACZ;AACR,MAAI,UAAU,KAAK,UAAU,EAAG,QAAO;AAEvC,QAAM,CAAC,OAAO,GAAG,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AACrD,MAAI,MAAM;AACV,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO;AAC1B,UAAM,IAAI,IAAI,IAAI,CAAC;AACnB,QAAI,EAAG,QAAO,IAAI;AAAA,EACpB;AACA,SAAO,OAAO,QAAQ;AACxB;AAEA,SAAS,cACP,UACA,QACS;AACT,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC3C,QAAI,SAAS,CAAC,MAAM,EAAG,QAAO;AAAA,EAChC;AACA,SAAO;AACT;AAiBO,IAAM,wBAAN,MAA8C;AAAA,EAOnD,YAAY,OAAqC,CAAC,GAAG;AANrD,gBAAO;AACP,mBAAU;AACV,gBAAO;AAKL,SAAK,UAAU,IAAI,uBAAuB,KAAK,MAAM,QAAQ;AAAA,EAC/D;AAAA,EAEA,MAAM,KAAK,MAAoC;AAAA,EAE/C;AAAA,EAEA,MAAM,MAAM,KAAmC;AAC7C,QAAI;AACJ,QAAI;AACF,YAAM,IAAI,WAA8B,kCAAiB;AAAA,IAC3D,QAAQ;AACN,UAAI,OAAO;AAAA,QACT;AAAA,MACF;AACA;AAAA,IACF;AACA,QAAI,gBAAgB,KAAK,QAAQ,IAAI,KAAK,OAAO;AACjD,QAAI,OAAO,OAAO,mCAAmC,KAAK,QAAQ,EAAE,eAAe;AAAA,EACrF;AACF;","names":[]}

package/dist/index.mjs

@@ -0,0 +1,156 @@
+// src/index.ts
+import { KNOWLEDGE_SERVICE } from "@objectstack/spec/contracts";
+var KnowledgeMemoryAdapter = class {
+  constructor(id = "memory") {
+    this.store = /* @__PURE__ */ new Map();
+    this.id = id;
+  }
+  async upsert(docs, ctx) {
+    const sourceId = ctx.source.id;
+    const existing = this.store.get(sourceId) ?? [];
+    const byDoc = /* @__PURE__ */ new Map();
+    for (const c of existing) {
+      const arr = byDoc.get(c.documentId) ?? [];
+      arr.push(c);
+      byDoc.set(c.documentId, arr);
+    }
+    for (const doc of docs) {
+      byDoc.set(doc.id, chunkAndEmbed(doc));
+    }
+    this.store.set(sourceId, Array.from(byDoc.values()).flat());
+  }
+  async delete(documentIds, ctx) {
+    const sourceId = ctx.source.id;
+    const chunks = this.store.get(sourceId);
+    if (!chunks) return;
+    const dropSet = new Set(documentIds);
+    this.store.set(
+      sourceId,
+      chunks.filter((c) => !dropSet.has(c.documentId))
+    );
+  }
+  async search(query, opts) {
+    const chunks = this.store.get(opts.source.id) ?? [];
+    if (chunks.length === 0) return [];
+    const qVec = embedTokens(tokenize(query));
+    const qNorm = vectorNorm(qVec);
+    if (qNorm === 0) return [];
+    const filter = opts.filter ?? {};
+    const filtered = Object.keys(filter).length ? chunks.filter((c) => matchesFilter(c.metadata, filter)) : chunks;
+    const scored = filtered.map((c) => ({
+      chunk: c,
+      score: cosineSimilarity(qVec, c.vector, qNorm, c.vectorNorm)
+    }));
+    scored.sort((a, b) => b.score - a.score);
+    const top = scored.slice(0, opts.topK).filter((s) => s.score > 0);
+    return top.map(({ chunk, score }) => ({
+      chunkId: chunk.chunkId,
+      documentId: chunk.documentId,
+      sourceId: opts.source.id,
+      sourceRecordId: chunk.sourceRecordId,
+      score,
+      snippet: chunk.content,
+      title: chunk.title,
+      metadata: chunk.metadata
+    }));
+  }
+  async healthCheck() {
+    return { ok: true, message: `memory adapter (${this.store.size} sources)` };
+  }
+};
+var CHUNK_TARGET = 800;
+function chunkAndEmbed(doc) {
+  const paragraphs = doc.content.split(/\n{2,}/).map((p) => p.trim()).filter(Boolean);
+  const chunks = [];
+  let buf = "";
+  for (const p of paragraphs.length ? paragraphs : [doc.content]) {
+    if (buf && buf.length + p.length + 2 > CHUNK_TARGET) {
+      chunks.push(buf);
+      buf = "";
+    }
+    if (p.length > CHUNK_TARGET) {
+      if (buf) {
+        chunks.push(buf);
+        buf = "";
+      }
+      for (let i = 0; i < p.length; i += CHUNK_TARGET) {
+        chunks.push(p.slice(i, i + CHUNK_TARGET));
+      }
+    } else {
+      buf = buf ? `${buf}
+
+${p}` : p;
+    }
+  }
+  if (buf) chunks.push(buf);
+  return chunks.map((content, idx) => {
+    const vec = embedTokens(tokenize(content));
+    return {
+      chunkId: `${doc.id}#${idx}`,
+      documentId: doc.id,
+      sourceRecordId: doc.sourceRecordId,
+      content,
+      title: doc.title,
+      metadata: doc.metadata ?? {},
+      vector: vec,
+      vectorNorm: vectorNorm(vec)
+    };
+  });
+}
+function tokenize(text) {
+  return text.toLowerCase().split(/[^a-z0-9\u4e00-\u9fff]+/i).filter((t) => t.length > 1);
+}
+function embedTokens(tokens) {
+  const vec = /* @__PURE__ */ new Map();
+  for (const t of tokens) vec.set(t, (vec.get(t) ?? 0) + 1);
+  return vec;
+}
+function vectorNorm(v) {
+  let s = 0;
+  for (const x of v.values()) s += x * x;
+  return Math.sqrt(s);
+}
+function cosineSimilarity(a, b, aNorm = vectorNorm(a), bNorm = vectorNorm(b)) {
+  if (aNorm === 0 || bNorm === 0) return 0;
+  const [small, big] = a.size < b.size ? [a, b] : [b, a];
+  let dot = 0;
+  for (const [k, v] of small) {
+    const w = big.get(k);
+    if (w) dot += v * w;
+  }
+  return dot / (aNorm * bNorm);
+}
+function matchesFilter(metadata, filter) {
+  for (const [k, v] of Object.entries(filter)) {
+    if (metadata[k] !== v) return false;
+  }
+  return true;
+}
+var KnowledgeMemoryPlugin = class {
+  constructor(opts = {}) {
+    this.name = "com.objectstack.plugin.knowledge-memory";
+    this.version = "0.1.0";
+    this.type = "standard";
+    this.adapter = new KnowledgeMemoryAdapter(opts.id ?? "memory");
+  }
+  async init(_ctx) {
+  }
+  async start(ctx) {
+    let svc;
+    try {
+      svc = ctx.getService(KNOWLEDGE_SERVICE);
+    } catch {
+      ctx.logger.warn?.(
+        "KnowledgeMemoryPlugin: IKnowledgeService not registered \u2014 install KnowledgeServicePlugin first."
+      );
+      return;
+    }
+    svc.registerAdapter(this.adapter.id, this.adapter);
+    ctx.logger.info?.(`KnowledgeMemoryPlugin: adapter '${this.adapter.id}' registered.`);
+  }
+};
+export {
+  KnowledgeMemoryAdapter,
+  KnowledgeMemoryPlugin
+};
+//# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts"],"sourcesContent":["// Copyright (c) 2025 ObjectStack. Licensed under the Apache-2.0 license.\n\nimport type {\n  IKnowledgeAdapter,\n  IKnowledgeService,\n  AdapterContext,\n  AdapterSearchOptions,\n} from '@objectstack/spec/contracts';\nimport type {\n  KnowledgeDocument,\n  KnowledgeHit,\n} from '@objectstack/spec/ai';\nimport { KNOWLEDGE_SERVICE } from '@objectstack/spec/contracts';\n\n/**\n * In-memory knowledge adapter. Stores per-source document maps,\n * chunks documents naively on paragraph boundaries (with a soft 800-char\n * cap), embeds each chunk as a sparse token-frequency vector, and\n * answers `search()` via brute-force cosine similarity.\n *\n * Deterministic — same input always produces the same hits — so it's\n * great for tests and reference implementations. **Don't use in prod.**\n */\nexport class KnowledgeMemoryAdapter implements IKnowledgeAdapter {\n  readonly id: string;\n  private readonly store = new Map<string, ChunkRecord[]>();\n\n  constructor(id = 'memory') {\n    this.id = id;\n  }\n\n  async upsert(docs: KnowledgeDocument[], ctx: AdapterContext): Promise<void> {\n    const sourceId = ctx.source.id;\n    const existing = this.store.get(sourceId) ?? [];\n    const byDoc = new Map<string, ChunkRecord[]>();\n    for (const c of existing) {\n      const arr = byDoc.get(c.documentId) ?? [];\n      arr.push(c);\n      byDoc.set(c.documentId, arr);\n    }\n    for (const doc of docs) {\n      byDoc.set(doc.id, chunkAndEmbed(doc));\n    }\n    this.store.set(sourceId, Array.from(byDoc.values()).flat());\n  }\n\n  async delete(documentIds: string[], ctx: AdapterContext): Promise<void> {\n    const sourceId = ctx.source.id;\n    const chunks = this.store.get(sourceId);\n    if (!chunks) return;\n    const dropSet = new Set(documentIds);\n    this.store.set(\n      sourceId,\n      chunks.filter((c) => !dropSet.has(c.documentId)),\n    );\n  }\n\n  async search(query: string, opts: AdapterSearchOptions): Promise<KnowledgeHit[]> {\n    const chunks = this.store.get(opts.source.id) ?? [];\n    if (chunks.length === 0) return [];\n    const qVec = embedTokens(tokenize(query));\n    const qNorm = vectorNorm(qVec);\n    if (qNorm === 0) return [];\n\n    const filter = opts.filter ?? {};\n    const filtered = Object.keys(filter).length\n      ? chunks.filter((c) => matchesFilter(c.metadata, filter))\n      : chunks;\n\n    const scored = filtered.map((c) => ({\n      chunk: c,\n      score: cosineSimilarity(qVec, c.vector, qNorm, c.vectorNorm),\n    }));\n    scored.sort((a, b) => b.score - a.score);\n    const top = scored.slice(0, opts.topK).filter((s) => s.score > 0);\n    return top.map<KnowledgeHit>(({ chunk, score }) => ({\n      chunkId: chunk.chunkId,\n      documentId: chunk.documentId,\n      sourceId: opts.source.id,\n      sourceRecordId: chunk.sourceRecordId,\n      score,\n      snippet: chunk.content,\n      title: chunk.title,\n      metadata: chunk.metadata,\n    }));\n  }\n\n  async healthCheck(): Promise<{ ok: boolean; message?: string }> {\n    return { ok: true, message: `memory adapter (${this.store.size} sources)` };\n  }\n}\n\ninterface ChunkRecord {\n  chunkId: string;\n  documentId: string;\n  sourceRecordId?: string;\n  content: string;\n  title?: string;\n  metadata: Record<string, unknown>;\n  vector: Map<string, number>;\n  vectorNorm: number;\n}\n\nconst CHUNK_TARGET = 800;\n\nfunction chunkAndEmbed(doc: KnowledgeDocument): ChunkRecord[] {\n  const paragraphs = doc.content\n    .split(/\\n{2,}/)\n    .map((p) => p.trim())\n    .filter(Boolean);\n  const chunks: string[] = [];\n  let buf = '';\n  for (const p of paragraphs.length ? paragraphs : [doc.content]) {\n    if (buf && buf.length + p.length + 2 > CHUNK_TARGET) {\n      chunks.push(buf);\n      buf = '';\n    }\n    if (p.length > CHUNK_TARGET) {\n      if (buf) {\n        chunks.push(buf);\n        buf = '';\n      }\n      for (let i = 0; i < p.length; i += CHUNK_TARGET) {\n        chunks.push(p.slice(i, i + CHUNK_TARGET));\n      }\n    } else {\n      buf = buf ? `${buf}\\n\\n${p}` : p;\n    }\n  }\n  if (buf) chunks.push(buf);\n  return chunks.map((content, idx) => {\n    const vec = embedTokens(tokenize(content));\n    return {\n      chunkId: `${doc.id}#${idx}`,\n      documentId: doc.id,\n      sourceRecordId: doc.sourceRecordId,\n      content,\n      title: doc.title,\n      metadata: doc.metadata ?? {},\n      vector: vec,\n      vectorNorm: vectorNorm(vec),\n    };\n  });\n}\n\nfunction tokenize(text: string): string[] {\n  return text\n    .toLowerCase()\n    .split(/[^a-z0-9\\u4e00-\\u9fff]+/i)\n    .filter((t) => t.length > 1);\n}\n\nfunction embedTokens(tokens: string[]): Map<string, number> {\n  const vec = new Map<string, number>();\n  for (const t of tokens) vec.set(t, (vec.get(t) ?? 0) + 1);\n  return vec;\n}\n\nfunction vectorNorm(v: Map<string, number>): number {\n  let s = 0;\n  for (const x of v.values()) s += x * x;\n  return Math.sqrt(s);\n}\n\nfunction cosineSimilarity(\n  a: Map<string, number>,\n  b: Map<string, number>,\n  aNorm = vectorNorm(a),\n  bNorm = vectorNorm(b),\n): number {\n  if (aNorm === 0 || bNorm === 0) return 0;\n  // iterate smaller map\n  const [small, big] = a.size < b.size ? [a, b] : [b, a];\n  let dot = 0;\n  for (const [k, v] of small) {\n    const w = big.get(k);\n    if (w) dot += v * w;\n  }\n  return dot / (aNorm * bNorm);\n}\n\nfunction matchesFilter(\n  metadata: Record<string, unknown>,\n  filter: Record<string, unknown>,\n): boolean {\n  for (const [k, v] of Object.entries(filter)) {\n    if (metadata[k] !== v) return false;\n  }\n  return true;\n}\n\n/* ---------------------------------------------------------------- */\n/* Kernel plugin glue                                               */\n/* ---------------------------------------------------------------- */\n\nimport type { Plugin, PluginContext } from '@objectstack/core';\n\nexport interface KnowledgeMemoryPluginOptions {\n  /** Adapter id. @default 'memory' */\n  id?: string;\n}\n\n/**\n * `KnowledgeMemoryPlugin` — registers a `KnowledgeMemoryAdapter` with\n * the host's `IKnowledgeService` during `start()`.\n */\nexport class KnowledgeMemoryPlugin implements Plugin {\n  name = 'com.objectstack.plugin.knowledge-memory';\n  version = '0.1.0';\n  type = 'standard';\n\n  private readonly adapter: KnowledgeMemoryAdapter;\n\n  constructor(opts: KnowledgeMemoryPluginOptions = {}) {\n    this.adapter = new KnowledgeMemoryAdapter(opts.id ?? 'memory');\n  }\n\n  async init(_ctx: PluginContext): Promise<void> {\n    // No-op: registration happens in start() once IKnowledgeService is up.\n  }\n\n  async start(ctx: PluginContext): Promise<void> {\n    let svc: IKnowledgeService | undefined;\n    try {\n      svc = ctx.getService<IKnowledgeService>(KNOWLEDGE_SERVICE);\n    } catch {\n      ctx.logger.warn?.(\n        'KnowledgeMemoryPlugin: IKnowledgeService not registered — install KnowledgeServicePlugin first.',\n      );\n      return;\n    }\n    svc.registerAdapter(this.adapter.id, this.adapter);\n    ctx.logger.info?.(`KnowledgeMemoryPlugin: adapter '${this.adapter.id}' registered.`);\n  }\n}\n"],"mappings":";AAYA,SAAS,yBAAyB;AAW3B,IAAM,yBAAN,MAA0D;AAAA,EAI/D,YAAY,KAAK,UAAU;AAF3B,SAAiB,QAAQ,oBAAI,IAA2B;AAGtD,SAAK,KAAK;AAAA,EACZ;AAAA,EAEA,MAAM,OAAO,MAA2B,KAAoC;AAC1E,UAAM,WAAW,IAAI,OAAO;AAC5B,UAAM,WAAW,KAAK,MAAM,IAAI,QAAQ,KAAK,CAAC;AAC9C,UAAM,QAAQ,oBAAI,IAA2B;AAC7C,eAAW,KAAK,UAAU;AACxB,YAAM,MAAM,MAAM,IAAI,EAAE,UAAU,KAAK,CAAC;AACxC,UAAI,KAAK,CAAC;AACV,YAAM,IAAI,EAAE,YAAY,GAAG;AAAA,IAC7B;AACA,eAAW,OAAO,MAAM;AACtB,YAAM,IAAI,IAAI,IAAI,cAAc,GAAG,CAAC;AAAA,IACtC;AACA,SAAK,MAAM,IAAI,UAAU,MAAM,KAAK,MAAM,OAAO,CAAC,EAAE,KAAK,CAAC;AAAA,EAC5D;AAAA,EAEA,MAAM,OAAO,aAAuB,KAAoC;AACtE,UAAM,WAAW,IAAI,OAAO;AAC5B,UAAM,SAAS,KAAK,MAAM,IAAI,QAAQ;AACtC,QAAI,CAAC,OAAQ;AACb,UAAM,UAAU,IAAI,IAAI,WAAW;AACnC,SAAK,MAAM;AAAA,MACT;AAAA,MACA,OAAO,OAAO,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,UAAU,CAAC;AAAA,IACjD;AAAA,EACF;AAAA,EAEA,MAAM,OAAO,OAAe,MAAqD;AAC/E,UAAM,SAAS,KAAK,MAAM,IAAI,KAAK,OAAO,EAAE,KAAK,CAAC;AAClD,QAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AACjC,UAAM,OAAO,YAAY,SAAS,KAAK,CAAC;AACxC,UAAM,QAAQ,WAAW,IAAI;AAC7B,QAAI,UAAU,EAAG,QAAO,CAAC;AAEzB,UAAM,SAAS,KAAK,UAAU,CAAC;AAC/B,UAAM,WAAW,OAAO,KAAK,MAAM,EAAE,SACjC,OAAO,OAAO,CAAC,MAAM,cAAc,EAAE,UAAU,MAAM,CAAC,IACtD;AAEJ,UAAM,SAAS,SAAS,IAAI,CAAC,OAAO;AAAA,MAClC,OAAO;AAAA,MACP,OAAO,iBAAiB,MAAM,EAAE,QAAQ,OAAO,EAAE,UAAU;AAAA,IAC7D,EAAE;AACF,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACvC,UAAM,MAAM,OAAO,MAAM,GAAG,KAAK,IAAI,EAAE,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC;AAChE,WAAO,IAAI,IAAkB,CAAC,EAAE,OAAO,MAAM,OAAO;AAAA,MAClD,SAAS,MAAM;AAAA,MACf,YAAY,MAAM;AAAA,MAClB,UAAU,KAAK,OAAO;AAAA,MACtB,gBAAgB,MAAM;AAAA,MACtB;AAAA,MACA,SAAS,MAAM;AAAA,MACf,OAAO,MAAM;AAAA,MACb,UAAU,MAAM;AAAA,IAClB,EAAE;AAAA,EACJ;AAAA,EAEA,MAAM,cAA0D;AAC9D,WAAO,EAAE,IAAI,MAAM,SAAS,mBAAmB,KAAK,MAAM,IAAI,YAAY;AAAA,EAC5E;AACF;AAaA,IAAM,eAAe;AAErB,SAAS,cAAc,KAAuC;AAC5D,QAAM,aAAa,IAAI,QACpB,MAAM,QAAQ,EACd,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,OAAO;AACjB,QAAM,SAAmB,CAAC;AAC1B,MAAI,MAAM;AACV,aAAW,KAAK,WAAW,SAAS,aAAa,CAAC,IAAI,OAAO,GAAG;AAC9D,QAAI,OAAO,IAAI,SAAS,EAAE,SAAS,IAAI,cAAc;AACnD,aAAO,KAAK,GAAG;AACf,YAAM;AAAA,IACR;AACA,QAAI,EAAE,SAAS,cAAc;AAC3B,UAAI,KAAK;AACP,eAAO,KAAK,GAAG;AACf,cAAM;AAAA,MACR;AACA,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,cAAc;AAC/C,eAAO,KAAK,EAAE,MAAM,GAAG,IAAI,YAAY,CAAC;AAAA,MAC1C;AAAA,IACF,OAAO;AACL,YAAM,MAAM,GAAG,GAAG;AAAA;AAAA,EAAO,CAAC,KAAK;AAAA,IACjC;AAAA,EACF;AACA,MAAI,IAAK,QAAO,KAAK,GAAG;AACxB,SAAO,OAAO,IAAI,CAAC,SAAS,QAAQ;AAClC,UAAM,MAAM,YAAY,SAAS,OAAO,CAAC;AACzC,WAAO;AAAA,MACL,SAAS,GAAG,IAAI,EAAE,IAAI,GAAG;AAAA,MACzB,YAAY,IAAI;AAAA,MAChB,gBAAgB,IAAI;AAAA,MACpB;AAAA,MACA,OAAO,IAAI;AAAA,MACX,UAAU,IAAI,YAAY,CAAC;AAAA,MAC3B,QAAQ;AAAA,MACR,YAAY,WAAW,GAAG;AAAA,IAC5B;AAAA,EACF,CAAC;AACH;AAEA,SAAS,SAAS,MAAwB;AACxC,SAAO,KACJ,YAAY,EACZ,MAAM,0BAA0B,EAChC,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC/B;AAEA,SAAS,YAAY,QAAuC;AAC1D,QAAM,MAAM,oBAAI,IAAoB;AACpC,aAAW,KAAK,OAAQ,KAAI,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC;AACxD,SAAO;AACT;AAEA,SAAS,WAAW,GAAgC;AAClD,MAAI,IAAI;AACR,aAAW,KAAK,EAAE,OAAO,EAAG,MAAK,IAAI;AACrC,SAAO,KAAK,KAAK,CAAC;AACpB;AAEA,SAAS,iBACP,GACA,GACA,QAAQ,WAAW,CAAC,GACpB,QAAQ,WAAW,CAAC,GACZ;AACR,MAAI,UAAU,KAAK,UAAU,EAAG,QAAO;AAEvC,QAAM,CAAC,OAAO,GAAG,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AACrD,MAAI,MAAM;AACV,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO;AAC1B,UAAM,IAAI,IAAI,IAAI,CAAC;AACnB,QAAI,EAAG,QAAO,IAAI;AAAA,EACpB;AACA,SAAO,OAAO,QAAQ;AACxB;AAEA,SAAS,cACP,UACA,QACS;AACT,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC3C,QAAI,SAAS,CAAC,MAAM,EAAG,QAAO;AAAA,EAChC;AACA,SAAO;AACT;AAiBO,IAAM,wBAAN,MAA8C;AAAA,EAOnD,YAAY,OAAqC,CAAC,GAAG;AANrD,gBAAO;AACP,mBAAU;AACV,gBAAO;AAKL,SAAK,UAAU,IAAI,uBAAuB,KAAK,MAAM,QAAQ;AAAA,EAC/D;AAAA,EAEA,MAAM,KAAK,MAAoC;AAAA,EAE/C;AAAA,EAEA,MAAM,MAAM,KAAmC;AAC7C,QAAI;AACJ,QAAI;AACF,YAAM,IAAI,WAA8B,iBAAiB;AAAA,IAC3D,QAAQ;AACN,UAAI,OAAO;AAAA,QACT;AAAA,MACF;AACA;AAAA,IACF;AACA,QAAI,gBAAgB,KAAK,QAAQ,IAAI,KAAK,OAAO;AACjD,QAAI,OAAO,OAAO,mCAAmC,KAAK,QAAQ,EAAE,eAAe;AAAA,EACrF;AACF;","names":[]}

package/package.json

@@ -0,0 +1,37 @@
+{
+  "name": "@objectstack/knowledge-memory",
+  "version": "6.4.0",
+  "license": "Apache-2.0",
+  "description": "In-memory knowledge adapter for ObjectStack (dev / test reference implementation).",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.mjs",
+      "require": "./dist/index.js"
+    }
+  },
+  "dependencies": {
+    "@objectstack/core": "6.4.0",
+    "@objectstack/service-knowledge": "6.4.0",
+    "@objectstack/spec": "6.4.0"
+  },
+  "devDependencies": {
+    "@types/node": "^25.9.1",
+    "typescript": "^6.0.3",
+    "vitest": "^4.1.7"
+  },
+  "keywords": [
+    "objectstack",
+    "knowledge",
+    "rag",
+    "memory",
+    "in-memory"
+  ],
+  "scripts": {
+    "build": "tsup --config ../../../tsup.config.ts",
+    "dev": "tsc -w",
+    "test": "vitest run"
+  }
+}

package/src/__tests__/memory-adapter.test.ts

@@ -0,0 +1,105 @@
+// Copyright (c) 2025 ObjectStack. Licensed under the Apache-2.0 license.
+
+import { describe, it, expect } from 'vitest';
+import { KnowledgeMemoryAdapter } from '../index';
+import type { KnowledgeDocument } from '@objectstack/spec/ai';
+import type { KnowledgeSource } from '@objectstack/spec/ai';
+
+const source: KnowledgeSource = {
+  id: 'src1',
+  label: 'Test source',
+  adapter: 'memory',
+  source: { kind: 'http', urls: ['https://example.com'] } as KnowledgeSource['source'],
+};
+
+const docs: KnowledgeDocument[] = [
+  {
+    id: 'd1',
+    sourceId: 'src1',
+    content: 'The quick brown fox jumps over the lazy dog. Foxes are clever animals.',
+    title: 'Fox facts',
+    metadata: { topic: 'animals' },
+  },
+  {
+    id: 'd2',
+    sourceId: 'src1',
+    content: 'Refunds require a receipt and must be processed within 30 days of purchase.',
+    title: 'Refund policy',
+    metadata: { topic: 'policy' },
+  },
+  {
+    id: 'd3',
+    sourceId: 'src1',
+    content: 'Customer support is available 24/7 by email at help@example.com.',
+    title: 'Support',
+    metadata: { topic: 'policy' },
+  },
+];
+
+describe('KnowledgeMemoryAdapter', () => {
+  it('upsert + search returns the semantically closest doc on top', async () => {
+    const a = new KnowledgeMemoryAdapter();
+    await a.upsert(docs, { source });
+    const hits = await a.search('how do refunds work', { source, topK: 3 });
+    expect(hits.length).toBeGreaterThan(0);
+    expect(hits[0].documentId).toBe('d2');
+    expect(hits[0].score).toBeGreaterThan(0);
+  });
+
+  it('respects topK', async () => {
+    const a = new KnowledgeMemoryAdapter();
+    await a.upsert(docs, { source });
+    const hits = await a.search('refund support fox', { source, topK: 1 });
+    expect(hits.length).toBe(1);
+  });
+
+  it('returns empty array when no token overlap', async () => {
+    const a = new KnowledgeMemoryAdapter();
+    await a.upsert(docs, { source });
+    const hits = await a.search('xyzzy plugh', { source, topK: 5 });
+    expect(hits).toEqual([]);
+  });
+
+  it('filters by metadata', async () => {
+    const a = new KnowledgeMemoryAdapter();
+    await a.upsert(docs, { source });
+    const hits = await a.search('fox', { source, topK: 5, filter: { topic: 'policy' } });
+    expect(hits.find((h) => h.documentId === 'd1')).toBeUndefined();
+  });
+
+  it('delete removes a document', async () => {
+    const a = new KnowledgeMemoryAdapter();
+    await a.upsert(docs, { source });
+    await a.delete(['d2'], { source });
+    const hits = await a.search('refund', { source, topK: 5 });
+    expect(hits.find((h) => h.documentId === 'd2')).toBeUndefined();
+  });
+
+  it('upsert replaces existing chunks for the same doc', async () => {
+    const a = new KnowledgeMemoryAdapter();
+    await a.upsert(docs, { source });
+    await a.upsert(
+      [{ id: 'd2', sourceId: 'src1', content: 'Pineapples are tropical fruit.', title: 'New' }],
+      { source },
+    );
+    const hits = await a.search('refund', { source, topK: 5 });
+    expect(hits.find((h) => h.documentId === 'd2')).toBeUndefined();
+    const tropical = await a.search('pineapple tropical', { source, topK: 5 });
+    expect(tropical[0]?.documentId).toBe('d2');
+  });
+
+  it('chunks long documents (snippet bounded)', async () => {
+    const a = new KnowledgeMemoryAdapter();
+    const long = 'lorem ipsum dolor sit amet '.repeat(200);
+    await a.upsert([{ id: 'long', sourceId: 'src1', content: long }], { source });
+    const hits = await a.search('lorem', { source, topK: 10 });
+    expect(hits.length).toBeGreaterThan(1);
+    for (const h of hits) expect(h.snippet.length).toBeLessThanOrEqual(900);
+  });
+
+  it('healthCheck returns ok', async () => {
+    const a = new KnowledgeMemoryAdapter();
+    const h = await a.healthCheck();
+    expect(h.ok).toBe(true);
+  });
+});

package/src/index.ts

@@ -0,0 +1,235 @@
+// Copyright (c) 2025 ObjectStack. Licensed under the Apache-2.0 license.
+
+import type {
+  IKnowledgeAdapter,
+  IKnowledgeService,
+  AdapterContext,
+  AdapterSearchOptions,
+} from '@objectstack/spec/contracts';
+import type {
+  KnowledgeDocument,
+  KnowledgeHit,
+} from '@objectstack/spec/ai';
+import { KNOWLEDGE_SERVICE } from '@objectstack/spec/contracts';
+
+/**
+ * In-memory knowledge adapter. Stores per-source document maps,
+ * chunks documents naively on paragraph boundaries (with a soft 800-char
+ * cap), embeds each chunk as a sparse token-frequency vector, and
+ * answers `search()` via brute-force cosine similarity.
+ *
+ * Deterministic — same input always produces the same hits — so it's
+ * great for tests and reference implementations. **Don't use in prod.**
+ */
+export class KnowledgeMemoryAdapter implements IKnowledgeAdapter {
+  readonly id: string;
+  private readonly store = new Map<string, ChunkRecord[]>();
+
+  constructor(id = 'memory') {
+    this.id = id;
+  }
+
+  async upsert(docs: KnowledgeDocument[], ctx: AdapterContext): Promise<void> {
+    const sourceId = ctx.source.id;
+    const existing = this.store.get(sourceId) ?? [];
+    const byDoc = new Map<string, ChunkRecord[]>();
+    for (const c of existing) {
+      const arr = byDoc.get(c.documentId) ?? [];
+      arr.push(c);
+      byDoc.set(c.documentId, arr);
+    }
+    for (const doc of docs) {
+      byDoc.set(doc.id, chunkAndEmbed(doc));
+    }
+    this.store.set(sourceId, Array.from(byDoc.values()).flat());
+  }
+
+  async delete(documentIds: string[], ctx: AdapterContext): Promise<void> {
+    const sourceId = ctx.source.id;
+    const chunks = this.store.get(sourceId);
+    if (!chunks) return;
+    const dropSet = new Set(documentIds);
+    this.store.set(
+      sourceId,
+      chunks.filter((c) => !dropSet.has(c.documentId)),
+    );
+  }
+
+  async search(query: string, opts: AdapterSearchOptions): Promise<KnowledgeHit[]> {
+    const chunks = this.store.get(opts.source.id) ?? [];
+    if (chunks.length === 0) return [];
+    const qVec = embedTokens(tokenize(query));
+    const qNorm = vectorNorm(qVec);
+    if (qNorm === 0) return [];
+
+    const filter = opts.filter ?? {};
+    const filtered = Object.keys(filter).length
+      ? chunks.filter((c) => matchesFilter(c.metadata, filter))
+      : chunks;
+
+    const scored = filtered.map((c) => ({
+      chunk: c,
+      score: cosineSimilarity(qVec, c.vector, qNorm, c.vectorNorm),
+    }));
+    scored.sort((a, b) => b.score - a.score);
+    const top = scored.slice(0, opts.topK).filter((s) => s.score > 0);
+    return top.map<KnowledgeHit>(({ chunk, score }) => ({
+      chunkId: chunk.chunkId,
+      documentId: chunk.documentId,
+      sourceId: opts.source.id,
+      sourceRecordId: chunk.sourceRecordId,
+      score,
+      snippet: chunk.content,
+      title: chunk.title,
+      metadata: chunk.metadata,
+    }));
+  }
+
+  async healthCheck(): Promise<{ ok: boolean; message?: string }> {
+    return { ok: true, message: `memory adapter (${this.store.size} sources)` };
+  }
+}
+
+interface ChunkRecord {
+  chunkId: string;
+  documentId: string;
+  sourceRecordId?: string;
+  content: string;
+  title?: string;
+  metadata: Record<string, unknown>;
+  vector: Map<string, number>;
+  vectorNorm: number;
+}
+
+const CHUNK_TARGET = 800;
+
+function chunkAndEmbed(doc: KnowledgeDocument): ChunkRecord[] {
+  const paragraphs = doc.content
+    .split(/\n{2,}/)
+    .map((p) => p.trim())
+    .filter(Boolean);
+  const chunks: string[] = [];
+  let buf = '';
+  for (const p of paragraphs.length ? paragraphs : [doc.content]) {
+    if (buf && buf.length + p.length + 2 > CHUNK_TARGET) {
+      chunks.push(buf);
+      buf = '';
+    }
+    if (p.length > CHUNK_TARGET) {
+      if (buf) {
+        chunks.push(buf);
+        buf = '';
+      }
+      for (let i = 0; i < p.length; i += CHUNK_TARGET) {
+        chunks.push(p.slice(i, i + CHUNK_TARGET));
+      }
+    } else {
+      buf = buf ? `${buf}\n\n${p}` : p;
+    }
+  }
+  if (buf) chunks.push(buf);
+  return chunks.map((content, idx) => {
+    const vec = embedTokens(tokenize(content));
+    return {
+      chunkId: `${doc.id}#${idx}`,
+      documentId: doc.id,
+      sourceRecordId: doc.sourceRecordId,
+      content,
+      title: doc.title,
+      metadata: doc.metadata ?? {},
+      vector: vec,
+      vectorNorm: vectorNorm(vec),
+    };
+  });
+}
+
+function tokenize(text: string): string[] {
+  return text
+    .toLowerCase()
+    .split(/[^a-z0-9\u4e00-\u9fff]+/i)
+    .filter((t) => t.length > 1);
+}
+
+function embedTokens(tokens: string[]): Map<string, number> {
+  const vec = new Map<string, number>();
+  for (const t of tokens) vec.set(t, (vec.get(t) ?? 0) + 1);
+  return vec;
+}
+
+function vectorNorm(v: Map<string, number>): number {
+  let s = 0;
+  for (const x of v.values()) s += x * x;
+  return Math.sqrt(s);
+}
+
+function cosineSimilarity(
+  a: Map<string, number>,
+  b: Map<string, number>,
+  aNorm = vectorNorm(a),
+  bNorm = vectorNorm(b),
+): number {
+  if (aNorm === 0 || bNorm === 0) return 0;
+  // iterate smaller map
+  const [small, big] = a.size < b.size ? [a, b] : [b, a];
+  let dot = 0;
+  for (const [k, v] of small) {
+    const w = big.get(k);
+    if (w) dot += v * w;
+  }
+  return dot / (aNorm * bNorm);
+}
+
+function matchesFilter(
+  metadata: Record<string, unknown>,
+  filter: Record<string, unknown>,
+): boolean {
+  for (const [k, v] of Object.entries(filter)) {
+    if (metadata[k] !== v) return false;
+  }
+  return true;
+}
+
+/* ---------------------------------------------------------------- */
+/* Kernel plugin glue                                               */
+/* ---------------------------------------------------------------- */
+
+import type { Plugin, PluginContext } from '@objectstack/core';
+
+export interface KnowledgeMemoryPluginOptions {
+  /** Adapter id. @default 'memory' */
+  id?: string;
+}
+
+/**
+ * `KnowledgeMemoryPlugin` — registers a `KnowledgeMemoryAdapter` with
+ * the host's `IKnowledgeService` during `start()`.
+ */
+export class KnowledgeMemoryPlugin implements Plugin {
+  name = 'com.objectstack.plugin.knowledge-memory';
+  version = '0.1.0';
+  type = 'standard';
+
+  private readonly adapter: KnowledgeMemoryAdapter;
+
+  constructor(opts: KnowledgeMemoryPluginOptions = {}) {
+    this.adapter = new KnowledgeMemoryAdapter(opts.id ?? 'memory');
+  }
+
+  async init(_ctx: PluginContext): Promise<void> {
+    // No-op: registration happens in start() once IKnowledgeService is up.
+  }
+
+  async start(ctx: PluginContext): Promise<void> {
+    let svc: IKnowledgeService | undefined;
+    try {
+      svc = ctx.getService<IKnowledgeService>(KNOWLEDGE_SERVICE);
+    } catch {
+      ctx.logger.warn?.(
+        'KnowledgeMemoryPlugin: IKnowledgeService not registered — install KnowledgeServicePlugin first.',
+      );
+      return;
+    }
+    svc.registerAdapter(this.adapter.id, this.adapter);
+    ctx.logger.info?.(`KnowledgeMemoryPlugin: adapter '${this.adapter.id}' registered.`);
+  }
+}

package/tsconfig.json

@@ -0,0 +1,20 @@
+{
+  "extends": "../../../tsconfig.json",
+  "compilerOptions": {
+    "target": "ES2020",
+    "module": "ES2020",
+    "moduleResolution": "bundler",
+    "declaration": true,
+    "outDir": "./dist",
+    "strict": true,
+    "esModuleInterop": true,
+    "skipLibCheck": true,
+    "noUnusedLocals": false,
+    "noUnusedParameters": false,
+    "forceConsistentCasingInFileNames": true,
+    "types": ["node"],
+    "rootDir": "./src"
+  },
+  "include": ["src/**/*"],
+  "exclude": ["node_modules", "dist"]
+}

package/vitest.config.ts

@@ -0,0 +1,23 @@
+// Copyright (c) 2025 ObjectStack. Licensed under the Apache-2.0 license.
+
+import { defineConfig } from 'vitest/config';
+import path from 'path';
+
+export default defineConfig({
+  test: {
+    globals: true,
+    environment: 'node',
+  },
+  resolve: {
+    alias: {
+      '@objectstack/core': path.resolve(__dirname, '../../core/src/index.ts'),
+      '@objectstack/service-knowledge': path.resolve(__dirname, '../../services/service-knowledge/src/index.ts'),
+      '@objectstack/spec/ai': path.resolve(__dirname, '../../spec/src/ai/index.ts'),
+      '@objectstack/spec/contracts': path.resolve(__dirname, '../../spec/src/contracts/index.ts'),
+      '@objectstack/spec/data': path.resolve(__dirname, '../../spec/src/data/index.ts'),
+      '@objectstack/spec/kernel': path.resolve(__dirname, '../../spec/src/kernel/index.ts'),
+      '@objectstack/spec/system': path.resolve(__dirname, '../../spec/src/system/index.ts'),
+      '@objectstack/spec': path.resolve(__dirname, '../../spec/src/index.ts'),
+    },
+  },
+});