@openweave/weave-graph 0.2.0 → 0.2.1

package/dist/synaptic-engine.js

@@ -0,0 +1,236 @@
+import { EdgeBuilder } from "./edge.js";
+const DEFAULT_THRESHOLD = 0.72;
+const DEFAULT_MAX_CONNECTIONS = 20;
+// ---------------------------------------------------------------------------
+// Stop-words (excluded from tokenization)
+// ---------------------------------------------------------------------------
+const STOP_WORDS = new Set([
+    "a", "an", "the", "is", "are", "was", "were", "be", "been", "being",
+    "have", "has", "had", "do", "does", "did", "will", "would", "could",
+    "should", "may", "might", "shall", "can", "need", "dare", "ought",
+    "for", "and", "nor", "but", "or", "yet", "so", "in", "on", "at",
+    "to", "of", "by", "up", "as", "if", "it", "its", "with", "this",
+    "that", "from", "not", "no", "vs", "via", "than", "then", "use",
+    "using", "used",
+]);
+// ---------------------------------------------------------------------------
+// Tokenizer
+// ---------------------------------------------------------------------------
+/**
+ * Tokenize a text string into a normalised set of meaningful tokens.
+ *
+ * - Splits camelCase / PascalCase boundaries before lowercasing
+ * - Splits on whitespace and common punctuation
+ * - Filters tokens shorter than 2 chars
+ * - Removes stop-words
+ *
+ * @example
+ * tokenize("TypeScript generics") → Set { "typescript", "generics" }
+ * tokenize("useContextManager")   → Set { "context", "manager" }
+ */
+export function tokenize(text) {
+    // Split camelCase: "useContext" → "use Context"
+    const expanded = text
+        .replace(/([a-z])([A-Z])/g, "$1 $2")
+        .replace(/([A-Z]+)([A-Z][a-z])/g, "$1 $2");
+    const tokens = expanded
+        .toLowerCase()
+        .split(/[\s\-_/\\.,;:()[\]{}'"!?@#$%^&*+=<>|~`]+/)
+        .filter((t) => t.length >= 2 && !STOP_WORDS.has(t));
+    return new Set(tokens);
+}
+// ---------------------------------------------------------------------------
+// Similarity
+// ---------------------------------------------------------------------------
+/**
+ * Jaccard similarity coefficient between two token sets.
+ * Returns 0 when both sets are empty.
+ *
+ * J(A,B) = |A ∩ B| / |A ∪ B|
+ */
+export function jaccardSimilarity(a, b) {
+    if (a.size === 0 && b.size === 0)
+        return 0;
+    let intersectionSize = 0;
+    for (const token of a) {
+        if (b.has(token))
+            intersectionSize++;
+    }
+    const unionSize = a.size + b.size - intersectionSize;
+    return intersectionSize / unionSize;
+}
+/**
+ * Cosine similarity between two dense embedding vectors.
+ * Returns a value in [−1, 1]. Returns 0 when either vector has zero magnitude.
+ *
+ * cos(θ) = (A · B) / (|A| × |B|)
+ */
+export function cosineSimilarity(a, b) {
+    if (a.length === 0 || b.length === 0)
+        return 0;
+    let dot = 0;
+    let magA = 0;
+    let magB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        magA += a[i] * a[i];
+        magB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(magA) * Math.sqrt(magB);
+    return denom === 0 ? 0 : dot / denom;
+}
+// ---------------------------------------------------------------------------
+// SynapticEngine
+// ---------------------------------------------------------------------------
+/**
+ * SynapticEngine — retroactive keyword-based linking between nodes.
+ *
+ * When a new node enters the graph, `linkRetroactively()` scans **all**
+ * existing nodes — regardless of when they were created — and creates
+ * RELATES edges wherever the Jaccard similarity between tokenised
+ * labels/descriptions meets the configured threshold.
+ *
+ * This gives WeaveGraph its neuronal behaviour: new concepts automatically
+ * form connections with historically relevant knowledge.
+ *
+ * Produced edges carry `metadata.synapse = true` so callers can distinguish
+ * auto-generated synaptic edges from manually created ones.
+ *
+ * @example
+ * ```ts
+ * const engine = new SynapticEngine({ threshold: 0.72, maxConnections: 20 });
+ *
+ * // Inject into ContextGraphManager
+ * graph.setSynapticEngine(engine);
+ *
+ * // From now on, every addNode() triggers retroactive linking automatically
+ * graph.addNode(NodeBuilder.concept("TypeScript generics"));
+ * ```
+ */
+export class SynapticEngine {
+    threshold;
+    maxConnections;
+    embeddingService;
+    constructor(options = {}) {
+        this.threshold = options.threshold ?? DEFAULT_THRESHOLD;
+        this.maxConnections = options.maxConnections ?? DEFAULT_MAX_CONNECTIONS;
+        this.embeddingService = options.embeddingService;
+    }
+    /** Read-only view of the resolved configuration. */
+    get config() {
+        return {
+            threshold: this.threshold,
+            maxConnections: this.maxConnections,
+            hasEmbeddings: this.embeddingService !== undefined,
+        };
+    }
+    /** Whether an embedding service is configured. */
+    get hasEmbeddingService() {
+        return this.embeddingService !== undefined;
+    }
+    /**
+     * Scan all existing nodes in `graph` and create RELATES edges to `newNode`
+     * wherever the Jaccard similarity between their tokenised text meets the
+     * threshold. At most `maxConnections` edges are created, selecting the
+     * highest-similarity candidates first.
+     *
+     * The new node itself **must already exist** in the graph before calling
+     * this method (so that `addEdge` can reference a valid node id).
+     *
+     * @returns The list of synaptic edges created and added to the graph.
+     */
+    linkRetroactively(newNode, graph) {
+        const existing = graph.getAllNodes().filter((n) => n.id !== newNode.id);
+        if (existing.length === 0)
+            return [];
+        const newTokens = tokenize(this._nodeText(newNode));
+        if (newTokens.size === 0)
+            return [];
+        // Score every existing node
+        const candidates = [];
+        for (const node of existing) {
+            const tokens = tokenize(this._nodeText(node));
+            const score = jaccardSimilarity(newTokens, tokens);
+            if (score >= this.threshold) {
+                candidates.push({ node, score });
+            }
+        }
+        // Select top-maxConnections by descending similarity
+        candidates.sort((a, b) => b.score - a.score);
+        const selected = candidates.slice(0, this.maxConnections);
+        const created = [];
+        for (const { node, score } of selected) {
+            const base = EdgeBuilder.relates(newNode.id, node.id, score);
+            const synapticEdge = {
+                ...base,
+                weight: score,
+                metadata: { synapse: true, similarity: score, mode: "keyword" },
+            };
+            graph.addEdge(synapticEdge);
+            created.push(synapticEdge);
+        }
+        return created;
+    }
+    /**
+     * Embedding-based retroactive linking (async).
+     *
+     * Requires an `embeddingService` to have been provided at construction time.
+     * If none is configured, falls back to keyword-based Jaccard similarity
+     * (identical to `linkRetroactively()`).
+     *
+     * Produced edges carry:
+     * - `metadata.synapse: true`
+     * - `metadata.similarity: number` — cosine similarity score
+     * - `metadata.mode: "embedding"` (or `"keyword"` on fallback)
+     *
+     * @returns The list of synaptic edges created and added to the graph.
+     */
+    async linkRetroactivelyEmbedding(newNode, graph) {
+        // No embedding service — fall back to keyword path
+        if (!this.embeddingService) {
+            return this.linkRetroactively(newNode, graph);
+        }
+        const existing = graph.getAllNodes().filter((n) => n.id !== newNode.id);
+        if (existing.length === 0)
+            return [];
+        const newText = this._nodeText(newNode);
+        if (newText.trim().length === 0)
+            return [];
+        // Embed new node + all existing nodes concurrently
+        const [newEmbed, ...existingEmbeds] = await Promise.all([
+            this.embeddingService.embed(newText),
+            ...existing.map((n) => this.embeddingService.embed(this._nodeText(n))),
+        ]);
+        // Score every existing node via cosine similarity
+        const candidates = [];
+        for (let i = 0; i < existing.length; i++) {
+            const score = cosineSimilarity(newEmbed.embedding, existingEmbeds[i].embedding);
+            if (score >= this.threshold) {
+                candidates.push({ node: existing[i], score });
+            }
+        }
+        // Select top-maxConnections by descending similarity
+        candidates.sort((a, b) => b.score - a.score);
+        const selected = candidates.slice(0, this.maxConnections);
+        const created = [];
+        for (const { node, score } of selected) {
+            const base = EdgeBuilder.relates(newNode.id, node.id, score);
+            const synapticEdge = {
+                ...base,
+                weight: score,
+                metadata: { synapse: true, similarity: score, mode: "embedding" },
+            };
+            graph.addEdge(synapticEdge);
+            created.push(synapticEdge);
+        }
+        return created;
+    }
+    // ------------------------------------------------------------------
+    // Private helpers
+    // ------------------------------------------------------------------
+    /** Combine label + description into a single text fingerprint for a node. */
+    _nodeText(node) {
+        return [node.label, node.description ?? ""].join(" ").trim();
+    }
+}
+//# sourceMappingURL=synaptic-engine.js.map

package/dist/synaptic-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"synaptic-engine.js","sourceRoot":"","sources":["../src/synaptic-engine.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AA6BxC,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAC/B,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAEnC,8EAA8E;AAC9E,0CAA0C;AAC1C,8EAA8E;AAE9E,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;IACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IACjE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;IAC/D,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;IAC/D,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK;IAC/D,OAAO,EAAE,MAAM;CAChB,CAAC,CAAC;AAeH,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,gDAAgD;IAChD,MAAM,QAAQ,GAAG,IAAI;SAClB,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC;SACnC,OAAO,CAAC,uBAAuB,EAAE,OAAO,CAAC,CAAC;IAE7C,MAAM,MAAM,GAAG,QAAQ;SACpB,WAAW,EAAE;SACb,KAAK,CAAC,0CAA0C,CAAC;SACjD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtD,OAAO,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;AACzB,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAc,EAAE,CAAc;IAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,gBAAgB,GAAG,CAAC,CAAC;IACzB,KAAK,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,gBAAgB,EAAE,CAAC;IACvC,CAAC;IACD,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,gBAAgB,CAAC;IACrD,OAAO,gBAAgB,GAAG,SAAS,CAAC;AACtC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;AACvC,CAAC;AAED,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,OAAO,cAAc;IACR,SAAS,CAAS;IAClB,cAAc,CAAS;IACvB,gBAAgB,CAA4B;IAE7D,YAAY,UAA2B,EAAE;QACvC,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,iBAAiB,CAAC;QACxD,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,uBAAuB,CAAC;QACxE,IAAI,CAAC,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC;IACnD,CAAC;IAED,oDAAoD;IACpD,IAAI,MAAM;QACR,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,aAAa,EAAE,IAAI,CAAC,gBAAgB,KAAK,SAAS;SACnD,CAAC;IACJ,CAAC;IAED,kDAAkD;IAClD,IAAI,mBAAmB;QACrB,OAAO,IAAI,CAAC,gBAAgB,KAAK,SAAS,CAAC;IAC7C,CAAC;IAED;;;;;;;;;;OAUG;IACH,iBAAiB,CAAC,OAAa,EAAE,KAAoB;QACnD,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,EAAE,CAAC,CAAC;QACxE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QACpD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEpC,4BAA4B;QAC5B,MAAM,UAAU,GAAyC,EAAE,CAAC;QAC5D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C,MAAM,KAAK,GAAG,iBAAiB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YACnD,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC5B,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QAE1D,MAAM,OAAO,GAAW,EAAE,CAAC;QAC3B,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,QAAQ,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,YAAY,GAAS;gBACzB,GAAG,IAAI;gBACP,MAAM,EAAE,KAAK;gBACb,QAAQ,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE;aAChE,CAAC;YACF,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC7B,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,0BAA0B,CAC9B,OAAa,EACb,KAAoB;QAEpB,mDAAmD;QACnD,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAChD,CAAC;QAED,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,EAAE,CAAC,CAAC;QACxE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAE3C,mDAAmD;QACnD,MAAM,CAAC,QAAQ,EAAE,GAAG,cAAc,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACtD,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,OAAO,CAAC;YACpC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,gBAAiB,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;SACxE,CAAC,CAAC;QAEH,kDAAkD;QAClD,MAAM,UAAU,GAAyC,EAAE,CAAC;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YAChF,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC5B,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QAE1D,MAAM,OAAO,GAAW,EAAE,CAAC;QAC3B,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,QAAQ,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,YAAY,GAAS;gBACzB,GAAG,IAAI;gBACP,MAAM,EAAE,KAAK;gBACb,QAAQ,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE;aAClE,CAAC;YACF,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC7B,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,qEAAqE;IACrE,kBAAkB;IAClB,qEAAqE;IAErE,6EAA6E;IACrE,SAAS,CAAC,IAAU;QAC1B,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/D,CAAC;CACF"}

package/package.json

@@ -1,11 +1,12 @@
 {
   "name": "@openweave/weave-graph",
-  "version": "0.2.0",
+  "version": "0.2.1",
   "description": "WeaveGraph — Persistent node & edge data model for AI agent context",
   "private": false,
   "license": "MIT",
   "type": "module",
-  "main": "./dist/index.js",
+  "main": "./dist/cjs/index.js",
+  "module": "./dist/index.js",
   "types": "./dist/index.d.ts",
   "files": [
     "dist",
@@ -13,6 +14,7 @@
   ],
   "exports": {
     ".": {
+      "require": "./dist/cjs/index.js",
       "import": "./dist/index.js",
       "types": "./dist/index.d.ts"
     }
@@ -30,10 +32,10 @@
     "vitest": "3.0.0"
   },
   "dependencies": {
-    "@openweave/weave-provider": "0.8.0"
+    "@openweave/weave-provider": "0.8.1"
   },
   "scripts": {
-    "build": "tsc",
+    "build": "tsc && tsc -p tsconfig.cjs.json && node -e \"require('fs').writeFileSync('dist/cjs/package.json', '{\\\"type\\\":\\\"commonjs\\\"}')\"",
     "dev": "tsc --watch",
     "test": "vitest",
     "lint": "eslint src --max-warnings 0",