0agent 1.0.0

package/packages/core/dist/bootstrap/BootstrapProtocol.d.ts

@@ -0,0 +1,37 @@
+import type { KnowledgeGraph } from '../graph/KnowledgeGraph.js';
+import type { GraphConstructor } from './GraphConstructor.js';
+import type { StagedMutationStore } from './StagedMutations.js';
+import type { HypothesisManager } from './HypothesisManager.js';
+export declare class BootstrapProtocol {
+    private graph;
+    private constructor_;
+    private mutations;
+    private hypotheses;
+    constructor(graph: KnowledgeGraph, constructor_: GraphConstructor, mutations: StagedMutationStore, hypotheses: HypothesisManager);
+    /**
+     * Check if the graph is in bootstrap mode (< 10 nodes).
+     */
+    shouldBootstrap(): boolean;
+    /**
+     * Run the bootstrap protocol for a task:
+     * 1. Use GraphConstructor to generate a proposal from LLM
+     * 2. Store as StagedMutation
+     * 3. Register proposed nodes as hypotheses
+     * Returns mutation ID, or null if proposal generation failed.
+     */
+    bootstrap(task: string, traceId: string, graphId?: string): Promise<string | null>;
+    /**
+     * Called when a trace outcome is received.
+     * If positive: commit the staged mutation to live graph.
+     * If negative: discard the mutation.
+     */
+    resolveOutcome(traceId: string, positive: boolean): Promise<void>;
+    /**
+     * Run maintenance: prune expired hypotheses and mutations.
+     */
+    runMaintenance(): {
+        hypothesesPruned: number;
+        mutationsPruned: number;
+    };
+}
+//# sourceMappingURL=BootstrapProtocol.d.ts.map

package/packages/core/dist/bootstrap/BootstrapProtocol.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BootstrapProtocol.d.ts","sourceRoot":"","sources":["../../src/bootstrap/BootstrapProtocol.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AACjE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAChE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAIhE,qBAAa,iBAAiB;IAE1B,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,YAAY;IACpB,OAAO,CAAC,SAAS;IACjB,OAAO,CAAC,UAAU;gBAHV,KAAK,EAAE,cAAc,EACrB,YAAY,EAAE,gBAAgB,EAC9B,SAAS,EAAE,mBAAmB,EAC9B,UAAU,EAAE,iBAAiB;IAGvC;;OAEG;IACH,eAAe,IAAI,OAAO;IAI1B;;;;;;OAMG;IACG,SAAS,CACb,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,MAAe,GACvB,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAezB;;;;OAIG;IACG,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IA6BvE;;OAEG;IACH,cAAc,IAAI;QAAE,gBAAgB,EAAE,MAAM,CAAC;QAAC,eAAe,EAAE,MAAM,CAAA;KAAE;CAMxE"}

package/packages/core/dist/bootstrap/BootstrapProtocol.js

@@ -0,0 +1,82 @@
+const BOOTSTRAP_NODE_THRESHOLD = 10;
+export class BootstrapProtocol {
+    graph;
+    constructor_;
+    mutations;
+    hypotheses;
+    constructor(graph, constructor_, mutations, hypotheses) {
+        this.graph = graph;
+        this.constructor_ = constructor_;
+        this.mutations = mutations;
+        this.hypotheses = hypotheses;
+    }
+    /**
+     * Check if the graph is in bootstrap mode (< 10 nodes).
+     */
+    shouldBootstrap() {
+        return this.graph.nodeCount() < BOOTSTRAP_NODE_THRESHOLD;
+    }
+    /**
+     * Run the bootstrap protocol for a task:
+     * 1. Use GraphConstructor to generate a proposal from LLM
+     * 2. Store as StagedMutation
+     * 3. Register proposed nodes as hypotheses
+     * Returns mutation ID, or null if proposal generation failed.
+     */
+    async bootstrap(task, traceId, graphId = 'root') {
+        const mutationId = await this.constructor_.propose(task, traceId, graphId);
+        if (!mutationId)
+            return null;
+        // Register proposed nodes as hypotheses
+        const mutation = this.mutations.get(mutationId);
+        if (mutation) {
+            for (const node of mutation.proposed_nodes) {
+                this.hypotheses.register(node.id);
+            }
+        }
+        return mutationId;
+    }
+    /**
+     * Called when a trace outcome is received.
+     * If positive: commit the staged mutation to live graph.
+     * If negative: discard the mutation.
+     */
+    async resolveOutcome(traceId, positive) {
+        const pendingMutations = this.mutations.getByTrace(traceId);
+        for (const mutation of pendingMutations) {
+            if (positive) {
+                const committed = this.mutations.commit(mutation.id);
+                if (committed) {
+                    // Apply to live graph
+                    for (const node of committed.proposed_nodes) {
+                        this.graph.addNode(node);
+                    }
+                    for (const edge of committed.proposed_edges) {
+                        this.graph.addEdge(edge);
+                    }
+                    // Record positive outcome for hypotheses
+                    for (const node of committed.proposed_nodes) {
+                        this.hypotheses.recordOutcome(node.id, true);
+                    }
+                }
+            }
+            else {
+                this.mutations.discard(mutation.id);
+                // Record negative outcome for hypotheses
+                for (const node of mutation.proposed_nodes) {
+                    this.hypotheses.recordOutcome(node.id, false);
+                }
+            }
+        }
+    }
+    /**
+     * Run maintenance: prune expired hypotheses and mutations.
+     */
+    runMaintenance() {
+        return {
+            hypothesesPruned: this.hypotheses.pruneExpired(),
+            mutationsPruned: this.mutations.pruneExpired(),
+        };
+    }
+}
+//# sourceMappingURL=BootstrapProtocol.js.map

package/packages/core/dist/bootstrap/BootstrapProtocol.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BootstrapProtocol.js","sourceRoot":"","sources":["../../src/bootstrap/BootstrapProtocol.ts"],"names":[],"mappings":"AAKA,MAAM,wBAAwB,GAAG,EAAE,CAAC;AAEpC,MAAM,OAAO,iBAAiB;IAElB;IACA;IACA;IACA;IAJV,YACU,KAAqB,EACrB,YAA8B,EAC9B,SAA8B,EAC9B,UAA6B;QAH7B,UAAK,GAAL,KAAK,CAAgB;QACrB,iBAAY,GAAZ,YAAY,CAAkB;QAC9B,cAAS,GAAT,SAAS,CAAqB;QAC9B,eAAU,GAAV,UAAU,CAAmB;IACpC,CAAC;IAEJ;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,wBAAwB,CAAC;IAC3D,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,SAAS,CACb,IAAY,EACZ,OAAe,EACf,UAAkB,MAAM;QAExB,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QAC3E,IAAI,CAAC,UAAU;YAAE,OAAO,IAAI,CAAC;QAE7B,wCAAwC;QACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAChD,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,cAAc,EAAE,CAAC;gBAC3C,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,cAAc,CAAC,OAAe,EAAE,QAAiB;QACrD,MAAM,gBAAgB,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAE5D,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;YACxC,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACrD,IAAI,SAAS,EAAE,CAAC;oBACd,sBAAsB;oBACtB,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,cAAc,EAAE,CAAC;wBAC5C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAC3B,CAAC;oBACD,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,cAAc,EAAE,CAAC;wBAC5C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAC3B,CAAC;oBACD,yCAAyC;oBACzC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,cAAc,EAAE,CAAC;wBAC5C,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;oBAC/C,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACpC,yCAAyC;gBACzC,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,cAAc,EAAE,CAAC;oBAC3C,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBAChD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,OAAO;YACL,gBAAgB,EAAE,IAAI,CAAC,UAAU,CAAC,YAAY,EAAE;YAChD,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE;SAC/C,CAAC;IACJ,CAAC;CACF"}

package/packages/core/dist/bootstrap/GraphConstructor.d.ts

@@ -0,0 +1,44 @@
+import { type GraphNode } from '../graph/GraphNode.js';
+import { type GraphEdge } from '../graph/GraphEdge.js';
+import type { StagedMutationStore } from './StagedMutations.js';
+/**
+ * Minimal LLM interface -- injectable for testing.
+ */
+export interface ILLMClient {
+    complete(prompt: string): Promise<string>;
+}
+export interface BootstrapProposal {
+    context: string;
+    strategy: string;
+    steps: string[];
+    expected_outcome: string;
+}
+export declare class GraphConstructor {
+    private llm;
+    private mutations;
+    constructor(llm: ILLMClient, mutations: StagedMutationStore);
+    /**
+     * Parse LLM response into a BootstrapProposal.
+     */
+    parseResponse(response: string): BootstrapProposal | null;
+    /**
+     * Generate a graph proposal from a task.
+     * Returns the StagedMutation ID, or null if parsing failed.
+     */
+    propose(task: string, traceId: string, graphId?: string): Promise<string | null>;
+    /**
+     * Build graph nodes and edges from a bootstrap proposal.
+     * Creates:
+     * - 1 CONTEXT node
+     * - 1 STRATEGY node
+     * - N STEP nodes
+     * - 1 OUTCOME node
+     * Edges: CONTEXT -SUPPORTS-> STRATEGY, STRATEGY -LEADS_TO-> each STEP,
+     *        last STEP -PRODUCES-> OUTCOME
+     */
+    buildGraph(proposal: BootstrapProposal, graphId: string): {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    };
+}
+//# sourceMappingURL=GraphConstructor.d.ts.map

package/packages/core/dist/bootstrap/GraphConstructor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphConstructor.d.ts","sourceRoot":"","sources":["../../src/bootstrap/GraphConstructor.ts"],"names":[],"mappings":"AAAA,OAAO,EAIL,KAAK,SAAS,EACf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAwB,KAAK,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAC7E,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAEhE;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CAC3C;AAED,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAYD,qBAAa,gBAAgB;IAEzB,OAAO,CAAC,GAAG;IACX,OAAO,CAAC,SAAS;gBADT,GAAG,EAAE,UAAU,EACf,SAAS,EAAE,mBAAmB;IAGxC;;OAEG;IACH,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,iBAAiB,GAAG,IAAI;IA+BzD;;;OAGG;IACG,OAAO,CACX,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,MAAe,GACvB,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAkBzB;;;;;;;;;OASG;IACH,UAAU,CACR,QAAQ,EAAE,iBAAiB,EAC3B,OAAO,EAAE,MAAM,GACd;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE;CA4F9C"}

package/packages/core/dist/bootstrap/GraphConstructor.js

@@ -0,0 +1,160 @@
+import { createNode, NodeType, ContentType, } from '../graph/GraphNode.js';
+import { createEdge, EdgeType } from '../graph/GraphEdge.js';
+const BOOTSTRAP_PROMPT = `Analyze the following task and produce a structured knowledge graph proposal.
+
+Task: {task}
+
+Respond ONLY in this exact format (one item per line):
+CONTEXT: <brief description of the domain context>
+STRATEGY: <high-level strategy name>
+PLAN: <step 1> | <step 2> | <step 3>
+EXPECTED_OUTCOME: <what success looks like>`;
+export class GraphConstructor {
+    llm;
+    mutations;
+    constructor(llm, mutations) {
+        this.llm = llm;
+        this.mutations = mutations;
+    }
+    /**
+     * Parse LLM response into a BootstrapProposal.
+     */
+    parseResponse(response) {
+        const lines = response.trim().split('\n');
+        let context = '';
+        let strategy = '';
+        let steps = [];
+        let expected_outcome = '';
+        for (const line of lines) {
+            const trimmed = line.trim();
+            if (trimmed.startsWith('CONTEXT:')) {
+                context = trimmed.slice('CONTEXT:'.length).trim();
+            }
+            else if (trimmed.startsWith('STRATEGY:')) {
+                strategy = trimmed.slice('STRATEGY:'.length).trim();
+            }
+            else if (trimmed.startsWith('PLAN:')) {
+                const planStr = trimmed.slice('PLAN:'.length).trim();
+                steps = planStr
+                    .split('|')
+                    .map((s) => s.trim())
+                    .filter(Boolean);
+            }
+            else if (trimmed.startsWith('EXPECTED_OUTCOME:')) {
+                expected_outcome = trimmed.slice('EXPECTED_OUTCOME:'.length).trim();
+            }
+        }
+        if (!context || !strategy || steps.length === 0 || !expected_outcome) {
+            return null;
+        }
+        return { context, strategy, steps, expected_outcome };
+    }
+    /**
+     * Generate a graph proposal from a task.
+     * Returns the StagedMutation ID, or null if parsing failed.
+     */
+    async propose(task, traceId, graphId = 'root') {
+        const prompt = BOOTSTRAP_PROMPT.replace('{task}', task);
+        const response = await this.llm.complete(prompt);
+        const proposal = this.parseResponse(response);
+        if (!proposal)
+            return null;
+        const { nodes, edges } = this.buildGraph(proposal, graphId);
+        const mutation = this.mutations.stage({
+            id: crypto.randomUUID(),
+            trace_id: traceId,
+            proposed_nodes: nodes,
+            proposed_edges: edges,
+        });
+        return mutation.id;
+    }
+    /**
+     * Build graph nodes and edges from a bootstrap proposal.
+     * Creates:
+     * - 1 CONTEXT node
+     * - 1 STRATEGY node
+     * - N STEP nodes
+     * - 1 OUTCOME node
+     * Edges: CONTEXT -SUPPORTS-> STRATEGY, STRATEGY -LEADS_TO-> each STEP,
+     *        last STEP -PRODUCES-> OUTCOME
+     */
+    buildGraph(proposal, graphId) {
+        const nodes = [];
+        const edges = [];
+        // Context node
+        const contextNodeId = crypto.randomUUID();
+        const contentId = crypto.randomUUID();
+        const contextNode = createNode({
+            id: contextNodeId,
+            graph_id: graphId,
+            label: proposal.context,
+            type: NodeType.CONTEXT,
+            content: [
+                {
+                    id: contentId,
+                    node_id: contextNodeId,
+                    type: ContentType.TEXT,
+                    data: proposal.context,
+                    metadata: {},
+                },
+            ],
+        });
+        nodes.push(contextNode);
+        // Strategy node
+        const strategyNode = createNode({
+            id: crypto.randomUUID(),
+            graph_id: graphId,
+            label: proposal.strategy,
+            type: NodeType.STRATEGY,
+        });
+        nodes.push(strategyNode);
+        // CONTEXT -SUPPORTS-> STRATEGY
+        edges.push(createEdge({
+            id: crypto.randomUUID(),
+            graph_id: graphId,
+            from_node: contextNode.id,
+            to_node: strategyNode.id,
+            type: EdgeType.SUPPORTS,
+        }));
+        // Step nodes
+        const stepNodes = [];
+        for (const stepText of proposal.steps) {
+            const stepNode = createNode({
+                id: crypto.randomUUID(),
+                graph_id: graphId,
+                label: stepText,
+                type: NodeType.STEP,
+            });
+            stepNodes.push(stepNode);
+            nodes.push(stepNode);
+            // STRATEGY -LEADS_TO-> STEP
+            edges.push(createEdge({
+                id: crypto.randomUUID(),
+                graph_id: graphId,
+                from_node: strategyNode.id,
+                to_node: stepNode.id,
+                type: EdgeType.LEADS_TO,
+            }));
+        }
+        // Outcome node
+        const outcomeNode = createNode({
+            id: crypto.randomUUID(),
+            graph_id: graphId,
+            label: proposal.expected_outcome,
+            type: NodeType.OUTCOME,
+        });
+        nodes.push(outcomeNode);
+        // Last step -PRODUCES-> OUTCOME
+        if (stepNodes.length > 0) {
+            edges.push(createEdge({
+                id: crypto.randomUUID(),
+                graph_id: graphId,
+                from_node: stepNodes[stepNodes.length - 1].id,
+                to_node: outcomeNode.id,
+                type: EdgeType.PRODUCES,
+            }));
+        }
+        return { nodes, edges };
+    }
+}
+//# sourceMappingURL=GraphConstructor.js.map

package/packages/core/dist/bootstrap/GraphConstructor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphConstructor.js","sourceRoot":"","sources":["../../src/bootstrap/GraphConstructor.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,UAAU,EACV,QAAQ,EACR,WAAW,GAEZ,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAkB,MAAM,uBAAuB,CAAC;AAiB7E,MAAM,gBAAgB,GAAG;;;;;;;;4CAQmB,CAAC;AAE7C,MAAM,OAAO,gBAAgB;IAEjB;IACA;IAFV,YACU,GAAe,EACf,SAA8B;QAD9B,QAAG,GAAH,GAAG,CAAY;QACf,cAAS,GAAT,SAAS,CAAqB;IACrC,CAAC;IAEJ;;OAEG;IACH,aAAa,CAAC,QAAgB;QAC5B,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,IAAI,QAAQ,GAAG,EAAE,CAAC;QAClB,IAAI,KAAK,GAAa,EAAE,CAAC;QACzB,IAAI,gBAAgB,GAAG,EAAE,CAAC;QAE1B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;gBACnC,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;YACpD,CAAC;iBAAM,IAAI,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC3C,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;YACtD,CAAC;iBAAM,IAAI,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;gBACvC,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;gBACrD,KAAK,GAAG,OAAO;qBACZ,KAAK,CAAC,GAAG,CAAC;qBACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;qBACpB,MAAM,CAAC,OAAO,CAAC,CAAC;YACrB,CAAC;iBAAM,IAAI,OAAO,CAAC,UAAU,CAAC,mBAAmB,CAAC,EAAE,CAAC;gBACnD,gBAAgB,GAAG,OAAO,CAAC,KAAK,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;YACtE,CAAC;QACH,CAAC;QAED,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACrE,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC;IACxD,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,OAAO,CACX,IAAY,EACZ,OAAe,EACf,UAAkB,MAAM;QAExB,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAC9C,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;QAE3B,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAE5D,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;YACpC,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;YACvB,QAAQ,EAAE,OAAO;YACjB,cAAc,EAAE,KAAK;YACrB,cAAc,EAAE,KAAK;SACtB,CAAC,CAAC;QAEH,OAAO,QAAQ,CAAC,EAAE,CAAC;IACrB,CAAC;IAED;;;;;;;;;OASG;IACH,UAAU,CACR,QAA2B,EAC3B,OAAe;QAEf,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAgB,EAAE,CAAC;QAE9B,eAAe;QACf,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;QACtC,MAAM,WAAW,GAAG,UAAU,CAAC;YAC7B,EAAE,EAAE,aAAa;YACjB,QAAQ,EAAE,OAAO;YACjB,KAAK,EAAE,QAAQ,CAAC,OAAO;YACvB,IAAI,EAAE,QAAQ,CAAC,OAAO;YACtB,OAAO,EAAE;gBACP;oBACE,EAAE,EAAE,SAAS;oBACb,OAAO,EAAE,aAAa;oBACtB,IAAI,EAAE,WAAW,CAAC,IAAI;oBACtB,IAAI,EAAE,QAAQ,CAAC,OAAO;oBACtB,QAAQ,EAAE,EAAE;iBACb;aACF;SACF,CAAC,CAAC;QACH,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAExB,gBAAgB;QAChB,MAAM,YAAY,GAAG,UAAU,CAAC;YAC9B,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;YACvB,QAAQ,EAAE,OAAO;YACjB,KAAK,EAAE,QAAQ,CAAC,QAAQ;YACxB,IAAI,EAAE,QAAQ,CAAC,QAAQ;SACxB,CAAC,CAAC;QACH,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAEzB,+BAA+B;QAC/B,KAAK,CAAC,IAAI,CACR,UAAU,CAAC;YACT,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;YACvB,QAAQ,EAAE,OAAO;YACjB,SAAS,EAAE,WAAW,CAAC,EAAE;YACzB,OAAO,EAAE,YAAY,CAAC,EAAE;YACxB,IAAI,EAAE,QAAQ,CAAC,QAAQ;SACxB,CAAC,CACH,CAAC;QAEF,aAAa;QACb,MAAM,SAAS,GAAgB,EAAE,CAAC;QAClC,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YACtC,MAAM,QAAQ,GAAG,UAAU,CAAC;gBAC1B,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;gBACvB,QAAQ,EAAE,OAAO;gBACjB,KAAK,EAAE,QAAQ;gBACf,IAAI,EAAE,QAAQ,CAAC,IAAI;aACpB,CAAC,CAAC;YACH,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAErB,4BAA4B;YAC5B,KAAK,CAAC,IAAI,CACR,UAAU,CAAC;gBACT,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;gBACvB,QAAQ,EAAE,OAAO;gBACjB,SAAS,EAAE,YAAY,CAAC,EAAE;gBAC1B,OAAO,EAAE,QAAQ,CAAC,EAAE;gBACpB,IAAI,EAAE,QAAQ,CAAC,QAAQ;aACxB,CAAC,CACH,CAAC;QACJ,CAAC;QAED,eAAe;QACf,MAAM,WAAW,GAAG,UAAU,CAAC;YAC7B,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;YACvB,QAAQ,EAAE,OAAO;YACjB,KAAK,EAAE,QAAQ,CAAC,gBAAgB;YAChC,IAAI,EAAE,QAAQ,CAAC,OAAO;SACvB,CAAC,CAAC;QACH,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAExB,gCAAgC;QAChC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CACR,UAAU,CAAC;gBACT,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;gBACvB,QAAQ,EAAE,OAAO;gBACjB,SAAS,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE;gBAC7C,OAAO,EAAE,WAAW,CAAC,EAAE;gBACvB,IAAI,EAAE,QAAQ,CAAC,QAAQ;aACxB,CAAC,CACH,CAAC;QACJ,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC1B,CAAC;CACF"}

package/packages/core/dist/bootstrap/HypothesisManager.d.ts

@@ -0,0 +1,50 @@
+import type { KnowledgeGraph } from '../graph/KnowledgeGraph.js';
+export interface HypothesisRecord {
+    node_id: string;
+    created_at: number;
+    expires_at: number;
+    promoted: boolean;
+    demoted: boolean;
+    outcome_count: number;
+    positive_outcomes: number;
+    negative_outcomes: number;
+}
+export declare class HypothesisManager {
+    private graph;
+    private hypotheses;
+    constructor(graph: KnowledgeGraph);
+    /**
+     * Register a new hypothesis node.
+     */
+    register(nodeId: string): HypothesisRecord;
+    /**
+     * Record an outcome for a hypothesis.
+     */
+    recordOutcome(nodeId: string, positive: boolean): void;
+    /**
+     * Promote: hypothesis becomes a real node (change type from HYPOTHESIS to its intended type).
+     */
+    promote(nodeId: string): void;
+    /**
+     * Demote: remove the hypothesis node and its edges from the graph.
+     */
+    demote(nodeId: string): void;
+    /**
+     * Prune expired hypotheses that haven't been promoted.
+     * Returns number of hypotheses pruned.
+     */
+    pruneExpired(): number;
+    /**
+     * Get a hypothesis record.
+     */
+    get(nodeId: string): HypothesisRecord | null;
+    /**
+     * Check if a node is a hypothesis.
+     */
+    isHypothesis(nodeId: string): boolean;
+    /**
+     * Get all active hypotheses.
+     */
+    getActive(): HypothesisRecord[];
+}
+//# sourceMappingURL=HypothesisManager.d.ts.map

package/packages/core/dist/bootstrap/HypothesisManager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"HypothesisManager.d.ts","sourceRoot":"","sources":["../../src/bootstrap/HypothesisManager.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAEjE,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,OAAO,CAAC;IAClB,OAAO,EAAE,OAAO,CAAC;IACjB,aAAa,EAAE,MAAM,CAAC;IACtB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAOD,qBAAa,iBAAiB;IAGhB,OAAO,CAAC,KAAK;IAFzB,OAAO,CAAC,UAAU,CAA4C;gBAE1C,KAAK,EAAE,cAAc;IAEzC;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB;IAgB1C;;OAEG;IACH,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,GAAG,IAAI;IAkBtD;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAQ7B;;OAEG;IACH,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAO5B;;;OAGG;IACH,YAAY,IAAI,MAAM;IAYtB;;OAEG;IACH,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,GAAG,IAAI;IAI5C;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAKrC;;OAEG;IACH,SAAS,IAAI,gBAAgB,EAAE;CAKhC"}

package/packages/core/dist/bootstrap/HypothesisManager.js

@@ -0,0 +1,108 @@
+const HYPOTHESIS_TTL_MS = 14 * 24 * 60 * 60 * 1000; // 14 days
+const PROMOTION_THRESHOLD = 0.7; // positive_rate >= 70% to promote
+const DEMOTION_THRESHOLD = 0.3; // positive_rate < 30% to demote
+const MIN_OUTCOMES_TO_JUDGE = 3;
+export class HypothesisManager {
+    graph;
+    hypotheses = new Map();
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Register a new hypothesis node.
+     */
+    register(nodeId) {
+        const now = Date.now();
+        const record = {
+            node_id: nodeId,
+            created_at: now,
+            expires_at: now + HYPOTHESIS_TTL_MS,
+            promoted: false,
+            demoted: false,
+            outcome_count: 0,
+            positive_outcomes: 0,
+            negative_outcomes: 0,
+        };
+        this.hypotheses.set(nodeId, record);
+        return record;
+    }
+    /**
+     * Record an outcome for a hypothesis.
+     */
+    recordOutcome(nodeId, positive) {
+        const h = this.hypotheses.get(nodeId);
+        if (!h || h.promoted || h.demoted)
+            return;
+        h.outcome_count++;
+        if (positive)
+            h.positive_outcomes++;
+        else
+            h.negative_outcomes++;
+        // Auto-promote/demote if enough outcomes
+        if (h.outcome_count >= MIN_OUTCOMES_TO_JUDGE) {
+            const rate = h.positive_outcomes / h.outcome_count;
+            if (rate >= PROMOTION_THRESHOLD) {
+                this.promote(nodeId);
+            }
+            else if (rate <= DEMOTION_THRESHOLD) {
+                this.demote(nodeId);
+            }
+        }
+    }
+    /**
+     * Promote: hypothesis becomes a real node (change type from HYPOTHESIS to its intended type).
+     */
+    promote(nodeId) {
+        const h = this.hypotheses.get(nodeId);
+        if (!h || h.promoted || h.demoted)
+            return;
+        h.promoted = true;
+        // The node's type was already set correctly during bootstrap.
+        // "Promoting" means it's no longer subject to hypothesis TTL pruning.
+    }
+    /**
+     * Demote: remove the hypothesis node and its edges from the graph.
+     */
+    demote(nodeId) {
+        const h = this.hypotheses.get(nodeId);
+        if (!h || h.promoted || h.demoted)
+            return;
+        h.demoted = true;
+        this.graph.deleteNode(nodeId);
+    }
+    /**
+     * Prune expired hypotheses that haven't been promoted.
+     * Returns number of hypotheses pruned.
+     */
+    pruneExpired() {
+        const now = Date.now();
+        let pruned = 0;
+        for (const [_nodeId, h] of this.hypotheses) {
+            if (!h.promoted && !h.demoted && now > h.expires_at) {
+                this.demote(h.node_id);
+                pruned++;
+            }
+        }
+        return pruned;
+    }
+    /**
+     * Get a hypothesis record.
+     */
+    get(nodeId) {
+        return this.hypotheses.get(nodeId) ?? null;
+    }
+    /**
+     * Check if a node is a hypothesis.
+     */
+    isHypothesis(nodeId) {
+        const h = this.hypotheses.get(nodeId);
+        return h !== undefined && !h.promoted && !h.demoted;
+    }
+    /**
+     * Get all active hypotheses.
+     */
+    getActive() {
+        return [...this.hypotheses.values()].filter((h) => !h.promoted && !h.demoted);
+    }
+}
+//# sourceMappingURL=HypothesisManager.js.map

package/packages/core/dist/bootstrap/HypothesisManager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HypothesisManager.js","sourceRoot":"","sources":["../../src/bootstrap/HypothesisManager.ts"],"names":[],"mappings":"AAaA,MAAM,iBAAiB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,UAAU;AAC9D,MAAM,mBAAmB,GAAG,GAAG,CAAC,CAAC,kCAAkC;AACnE,MAAM,kBAAkB,GAAG,GAAG,CAAC,CAAC,gCAAgC;AAChE,MAAM,qBAAqB,GAAG,CAAC,CAAC;AAEhC,MAAM,OAAO,iBAAiB;IAGR;IAFZ,UAAU,GAAkC,IAAI,GAAG,EAAE,CAAC;IAE9D,YAAoB,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;IAAG,CAAC;IAE7C;;OAEG;IACH,QAAQ,CAAC,MAAc;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,MAAM,GAAqB;YAC/B,OAAO,EAAE,MAAM;YACf,UAAU,EAAE,GAAG;YACf,UAAU,EAAE,GAAG,GAAG,iBAAiB;YACnC,QAAQ,EAAE,KAAK;YACf,OAAO,EAAE,KAAK;YACd,aAAa,EAAE,CAAC;YAChB,iBAAiB,EAAE,CAAC;YACpB,iBAAiB,EAAE,CAAC;SACrB,CAAC;QACF,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACpC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,MAAc,EAAE,QAAiB;QAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,OAAO;YAAE,OAAO;QAC1C,CAAC,CAAC,aAAa,EAAE,CAAC;QAClB,IAAI,QAAQ;YAAE,CAAC,CAAC,iBAAiB,EAAE,CAAC;;YAC/B,CAAC,CAAC,iBAAiB,EAAE,CAAC;QAE3B,yCAAyC;QACzC,IAAI,CAAC,CAAC,aAAa,IAAI,qBAAqB,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,aAAa,CAAC;YACnD,IAAI,IAAI,IAAI,mBAAmB,EAAE,CAAC;gBAChC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;iBAAM,IAAI,IAAI,IAAI,kBAAkB,EAAE,CAAC;gBACtC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAc;QACpB,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,OAAO;YAAE,OAAO;QAC1C,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;QAClB,8DAA8D;QAC9D,sEAAsE;IACxE,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,MAAc;QACnB,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,OAAO;YAAE,OAAO;QAC1C,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACH,YAAY;QACV,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3C,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,OAAO,IAAI,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;gBACpD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBACvB,MAAM,EAAE,CAAC;YACX,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,MAAc;QAChB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAAc;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,OAAO,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;IACtD,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CACzC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,OAAO,CACjC,CAAC;IACJ,CAAC;CACF"}

package/packages/core/dist/bootstrap/StagedMutations.d.ts

@@ -0,0 +1,50 @@
+import type { GraphNode } from '../graph/GraphNode.js';
+import type { GraphEdge } from '../graph/GraphEdge.js';
+export interface StagedMutation {
+    id: string;
+    trace_id: string;
+    proposed_nodes: GraphNode[];
+    proposed_edges: GraphEdge[];
+    created_at: number;
+    expires_at: number;
+    committed: boolean;
+    discarded: boolean;
+}
+export declare class StagedMutationStore {
+    private mutations;
+    /**
+     * Stage a new mutation (not committed to live graph).
+     */
+    stage(params: {
+        id: string;
+        trace_id: string;
+        proposed_nodes: GraphNode[];
+        proposed_edges: GraphEdge[];
+    }): StagedMutation;
+    /**
+     * Commit a mutation -- caller must apply nodes/edges to the live graph.
+     */
+    commit(id: string): StagedMutation | null;
+    /**
+     * Discard a mutation.
+     */
+    discard(id: string): void;
+    /**
+     * Get pending (uncommitted, not expired) mutations for a trace.
+     */
+    getByTrace(traceId: string): StagedMutation[];
+    /**
+     * Get a specific mutation.
+     */
+    get(id: string): StagedMutation | null;
+    /**
+     * Prune all expired mutations.
+     */
+    pruneExpired(): number;
+    /**
+     * Get all pending mutations.
+     */
+    getAllPending(): StagedMutation[];
+    get size(): number;
+}
+//# sourceMappingURL=StagedMutations.d.ts.map

package/packages/core/dist/bootstrap/StagedMutations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"StagedMutations.d.ts","sourceRoot":"","sources":["../../src/bootstrap/StagedMutations.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAEvD,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,cAAc,EAAE,SAAS,EAAE,CAAC;IAC5B,cAAc,EAAE,SAAS,EAAE,CAAC;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;CACpB;AAID,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,SAAS,CAA0C;IAE3D;;OAEG;IACH,KAAK,CAAC,MAAM,EAAE;QACZ,EAAE,EAAE,MAAM,CAAC;QACX,QAAQ,EAAE,MAAM,CAAC;QACjB,cAAc,EAAE,SAAS,EAAE,CAAC;QAC5B,cAAc,EAAE,SAAS,EAAE,CAAC;KAC7B,GAAG,cAAc;IAalB;;OAEG;IACH,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,cAAc,GAAG,IAAI;IAWzC;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAKzB;;OAEG;IACH,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,cAAc,EAAE;IAU7C;;OAEG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,cAAc,GAAG,IAAI;IAItC;;OAEG;IACH,YAAY,IAAI,MAAM;IAYtB;;OAEG;IACH,aAAa,IAAI,cAAc,EAAE;IAMjC,IAAI,IAAI,IAAI,MAAM,CAEjB;CACF"}

package/packages/core/dist/bootstrap/StagedMutations.js

@@ -0,0 +1,80 @@
+const TTL_MS = 14 * 24 * 60 * 60 * 1000; // 14 days
+export class StagedMutationStore {
+    mutations = new Map();
+    /**
+     * Stage a new mutation (not committed to live graph).
+     */
+    stage(params) {
+        const now = Date.now();
+        const mutation = {
+            ...params,
+            created_at: now,
+            expires_at: now + TTL_MS,
+            committed: false,
+            discarded: false,
+        };
+        this.mutations.set(mutation.id, mutation);
+        return mutation;
+    }
+    /**
+     * Commit a mutation -- caller must apply nodes/edges to the live graph.
+     */
+    commit(id) {
+        const m = this.mutations.get(id);
+        if (!m || m.committed || m.discarded)
+            return null;
+        if (Date.now() > m.expires_at) {
+            m.discarded = true;
+            return null;
+        }
+        m.committed = true;
+        return m;
+    }
+    /**
+     * Discard a mutation.
+     */
+    discard(id) {
+        const m = this.mutations.get(id);
+        if (m)
+            m.discarded = true;
+    }
+    /**
+     * Get pending (uncommitted, not expired) mutations for a trace.
+     */
+    getByTrace(traceId) {
+        return [...this.mutations.values()].filter((m) => m.trace_id === traceId &&
+            !m.committed &&
+            !m.discarded &&
+            Date.now() <= m.expires_at);
+    }
+    /**
+     * Get a specific mutation.
+     */
+    get(id) {
+        return this.mutations.get(id) ?? null;
+    }
+    /**
+     * Prune all expired mutations.
+     */
+    pruneExpired() {
+        const now = Date.now();
+        let count = 0;
+        for (const [_id, m] of this.mutations) {
+            if (!m.committed && !m.discarded && now > m.expires_at) {
+                m.discarded = true;
+                count++;
+            }
+        }
+        return count;
+    }
+    /**
+     * Get all pending mutations.
+     */
+    getAllPending() {
+        return [...this.mutations.values()].filter((m) => !m.committed && !m.discarded && Date.now() <= m.expires_at);
+    }
+    get size() {
+        return this.mutations.size;
+    }
+}
+//# sourceMappingURL=StagedMutations.js.map

package/packages/core/dist/bootstrap/StagedMutations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"StagedMutations.js","sourceRoot":"","sources":["../../src/bootstrap/StagedMutations.ts"],"names":[],"mappings":"AAcA,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,UAAU;AAEnD,MAAM,OAAO,mBAAmB;IACtB,SAAS,GAAgC,IAAI,GAAG,EAAE,CAAC;IAE3D;;OAEG;IACH,KAAK,CAAC,MAKL;QACC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAmB;YAC/B,GAAG,MAAM;YACT,UAAU,EAAE,GAAG;YACf,UAAU,EAAE,GAAG,GAAG,MAAM;YACxB,SAAS,EAAE,KAAK;YAChB,SAAS,EAAE,KAAK;SACjB,CAAC;QACF,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC1C,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,EAAU;QACf,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC;QAClD,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;YAC9B,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC;YACnB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC;QACnB,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC;YAAE,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,OAAe;QACxB,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CACxC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,QAAQ,KAAK,OAAO;YACtB,CAAC,CAAC,CAAC,SAAS;YACZ,CAAC,CAAC,CAAC,SAAS;YACZ,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,UAAU,CAC7B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,EAAU;QACZ,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,YAAY;QACV,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACtC,IAAI,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,SAAS,IAAI,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;gBACvD,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC;gBACnB,KAAK,EAAE,CAAC;YACV,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,aAAa;QACX,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CACxC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,UAAU,CAClE,CAAC;IACJ,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC7B,CAAC;CACF"}