@lucern/contracts 1.0.0 → 1.0.1

package/dist/tool-contracts.graph.js

@@ -0,0 +1,378 @@
+// src/types/reasoning-method.ts
+var REASONING_METHODS = [
+  "deductive",
+  "inductive",
+  "abductive",
+  "analogical",
+  "causal",
+  "correlational",
+  "testimonial",
+  "statistical",
+  "implicit",
+  "pattern_match"
+];
+
+// src/tool-contracts.graph.ts
+var QUERY_LINEAGE = {
+  name: "query_lineage",
+  description: "Trace a belief's full ancestry \u2014 every fork, score, and confidence modulation. Like `git log --graph`. Returns the complete evolution chain showing how understanding developed over time. Lineage is permanent and can never be erased (Invariant #3).",
+  parameters: {
+    nodeId: { type: "string", description: "Starting node to trace from" },
+    depth: {
+      type: "number",
+      description: "How many generations to traverse (default: 5)"
+    }
+  },
+  required: ["nodeId"],
+  response: {
+    description: "Canonical lineage result",
+    fields: {
+      beliefId: "string \u2014 canonical belief ID",
+      lineage: "array \u2014 ancestry entries with beliefId, nodeId, formulation, forkReason, and createdAt"
+    }
+  },
+  ownerModule: "graph-search",
+  ontologyPrimitive: "belief",
+  tier: "workhorse"
+};
+var GET_CONFIDENCE_HISTORY = {
+  name: "get_confidence_history",
+  description: "Get the full confidence history for a belief. Each entry records the confidence level, trigger, rationale, and actor. Like `git log` for a single metric \u2014 append-only, never overwritten.",
+  parameters: {
+    nodeId: { type: "string", description: "The belief to get history for" }
+  },
+  required: ["nodeId"],
+  response: {
+    description: "Confidence history entries",
+    fields: {
+      beliefId: "string \u2014 canonical belief ID",
+      entries: "array \u2014 { confidence, trigger, rationale, timestamp, userId }",
+      nextCursor: "string | null"
+    }
+  },
+  ownerModule: "graph-primitives",
+  ontologyPrimitive: "belief",
+  tier: "workhorse"
+};
+var GET_AUDIT_TRAIL = {
+  name: "get_audit_trail",
+  description: "Get the full audit trail for a node \u2014 every mutation, who made it, when, and why. Like `git blame` for knowledge. All state transitions are explicit, attributable, and permanently queryable. No silent changes are possible (Invariant #14).",
+  parameters: {
+    nodeId: { type: "string", description: "The node to audit" },
+    limit: {
+      type: "number",
+      description: "Maximum entries to return (default: 50)"
+    }
+  },
+  required: ["nodeId"],
+  response: {
+    description: "Audit trail entries",
+    fields: {
+      entries: "array \u2014 { action, actor, timestamp, before, after, rationale }"
+    }
+  },
+  ownerModule: "graph-primitives",
+  ontologyPrimitive: "graph",
+  tier: "workhorse"
+};
+var TRAVERSE_GRAPH = {
+  name: "traverse_graph",
+  description: "Walk the reasoning graph from a starting node. Like `git log --graph` \u2014 traverses connected lineage across nodes and edges. Traversal follows epistemic layers: L4 (judgments) \u2192 L3 (beliefs, questions) \u2192 L2 (evidence) \u2192 L1 (sources). Never skips layers. Use direction 'up' to trace what a piece of evidence supports, 'down' to trace what supports a judgment.",
+  parameters: {
+    startNode: { type: "string", description: "Node to start traversal from" },
+    direction: {
+      type: "string",
+      description: "Traversal direction",
+      enum: ["up", "down", "both"]
+    },
+    maxDepth: {
+      type: "number",
+      description: "Maximum traversal depth (default: 3)"
+    }
+  },
+  required: ["startNode"],
+  response: {
+    description: "Subgraph of traversed nodes and edges",
+    fields: {
+      nodes: "array \u2014 traversed nodes",
+      edges: "array \u2014 traversed edges",
+      depth: "number"
+    }
+  },
+  ownerModule: "graph-search",
+  ontologyPrimitive: "graph",
+  tier: "workhorse"
+};
+var GET_GRAPH_NEIGHBORHOOD = {
+  name: "get_graph_neighborhood",
+  description: "Retrieve the local neighborhood around one or more graph nodes. Like `git log --graph --boundary` for a focused reasoning window. Returns the canonical neighborhood payload shared by HTTP and SDK graph surfaces.",
+  parameters: {
+    globalId: {
+      type: "string",
+      description: "Single root node global identifier."
+    },
+    globalIds: {
+      type: "array",
+      description: "Optional list of root node global identifiers."
+    },
+    maxDepth: {
+      type: "number",
+      description: "Maximum traversal depth (default: 2)."
+    }
+  },
+  required: [],
+  response: {
+    description: "Canonical graph neighborhood payload",
+    fields: {
+      nodes: "array \u2014 graph nodes in the returned neighborhood",
+      edges: "array \u2014 graph edges in the returned neighborhood",
+      depth: "number \u2014 deepest traversed node depth"
+    }
+  },
+  ownerModule: "graph-search",
+  ontologyPrimitive: "graph",
+  tier: "workhorse"
+};
+var TRACE_ENTITY_IMPACT = {
+  name: "trace_entity_impact",
+  description: "Returns code-grounded beliefs, contracts, migration states, and failed attempts anchored to a specific file or function path. Like `git log -- <path>` \u2014 filters the knowledge graph to nodes anchored to a file path via metadata.codeAnchors. Results are separated by coding belief type: decisions, contracts, migrations, patterns, deprecations, and failures.",
+  parameters: {
+    nodeId: {
+      type: "string",
+      description: "Entity node ID to trace impact from"
+    }
+  },
+  required: ["nodeId"],
+  response: {
+    description: "Entity impact trace: direct beliefs, evidence, and indirect belief reach",
+    fields: {
+      entityNodeId: "string \u2014 the traced entity",
+      entityType: "string \u2014 nodeType of the entity",
+      directBeliefConnections: "array \u2014 beliefs directly connected via bridge edges",
+      evidenceConnections: "array \u2014 evidence referencing this entity",
+      indirectBeliefConnections: "array \u2014 beliefs reached through evidence",
+      totalBeliefReach: "number \u2014 total unique beliefs impacted"
+    }
+  },
+  ownerModule: "graph-search",
+  ontologyPrimitive: "graph",
+  tier: "workhorse"
+};
+var SEARCH_BELIEFS = {
+  name: "search_beliefs",
+  description: "Search for beliefs in the reasoning graph. Like `git grep` \u2014 finds relevant beliefs across the full history and active state. Supports semantic search, filtering by status (unscored, scored, archived), confidence thresholds, and topic scope. Returns beliefs with their current confidence, lineage depth, and contradiction count.",
+  parameters: {
+    query: { type: "string", description: "Semantic search query" },
+    status: {
+      type: "string",
+      description: "Filter by belief status",
+      enum: ["unscored", "scored", "archived"]
+    },
+    minConfidence: {
+      type: "number",
+      description: "Minimum confidence threshold (0-1)"
+    },
+    topicId: { type: "string", description: "Filter by topic" },
+    limit: { type: "number", description: "Maximum results (default: 10)" }
+  },
+  required: ["query"],
+  response: {
+    description: "Matching beliefs with metadata",
+    fields: {
+      results: "array \u2014 { nodeId, canonicalText, confidence, status, contradictionCount }"
+    }
+  },
+  ownerModule: "graph-search",
+  ontologyPrimitive: "belief",
+  tier: "workhorse"
+};
+var FIND_CONTRADICTIONS = {
+  name: "find_contradictions",
+  description: "Find contradictions in the reasoning graph \u2014 beliefs that are in tension with each other. Like a merge conflict in `git` \u2014 surfaces incompatible states that require explicit resolution. Contradictions are first-class objects that may remain permanently unresolved. They can block judgments, trigger forks, or collapse confidence. Filter by project, status (unresolved, resolved, accepted), and severity.",
+  parameters: {
+    topicId: { type: "string", description: "Filter by topic" },
+    nodeId: {
+      type: "string",
+      description: "Find contradictions involving a specific belief"
+    },
+    status: {
+      type: "string",
+      description: "Filter by status",
+      enum: ["unresolved", "resolved", "accepted"]
+    }
+  },
+  required: [],
+  response: {
+    description: "Contradiction objects",
+    fields: {
+      contradictions: "array \u2014 { beliefA, beliefB, description, severity, status, defeatType }"
+    }
+  },
+  ownerModule: "graph-search",
+  ontologyPrimitive: "belief",
+  tier: "showcase"
+};
+var BISECT_CONFIDENCE = {
+  name: "bisect_confidence",
+  description: "Find when a belief's confidence diverged from reality. Like `git bisect` \u2014 binary search through the credence history to find the inflection point. Given a belief that is now known to be wrong (or right), traces back through confidence modulations to identify which evidence or event caused the divergence.",
+  parameters: {
+    nodeId: { type: "string", description: "The belief to bisect" },
+    expectedDirection: {
+      type: "string",
+      description: "Was confidence too high or too low?",
+      enum: ["overconfident", "underconfident"]
+    },
+    timeRange: {
+      type: "object",
+      description: "Optional time range to search within: { start: number, end: number }"
+    }
+  },
+  required: ["nodeId", "expectedDirection"],
+  response: {
+    description: "The inflection point in confidence history",
+    fields: {
+      beliefId: "string \u2014 canonical belief ID",
+      expectedDirection: "string \u2014 overconfident | underconfident",
+      inflectionEntry: "object \u2014 the confidence modulation where divergence began",
+      triggerEvent: "string | null \u2014 what caused the divergence",
+      confidenceBefore: "number | null",
+      confidenceAfter: "number | null",
+      totalEntries: "number",
+      inflectionIndex: "number | null"
+    }
+  },
+  ownerModule: "graph-search",
+  ontologyPrimitive: "belief",
+  tier: "showcase"
+};
+var CREATE_EDGE = {
+  name: "create_edge",
+  description: "Commit a typed relationship between two nodes in the reasoning graph. Like `git commit` \u2014 an atomic write that declares a dependency between nodes. Accepts any public epistemic edge type between public graph node refs so agents can author the full spine.",
+  parameters: {
+    from: {
+      type: "object",
+      description: "Source graph ref, e.g. { kind: 'epistemic_node', nodeId: '...', nodeType: 'topic' }"
+    },
+    to: {
+      type: "object",
+      description: "Target graph ref, e.g. { kind: 'epistemic_node', nodeId: '...', nodeType: 'belief' }"
+    },
+    edgeType: {
+      type: "string",
+      description: "Relationship type from the public epistemic edge enum."
+    },
+    globalId: {
+      type: "string",
+      description: "Optional idempotent edge global ID."
+    },
+    weight: {
+      type: "number",
+      description: "Edge weight: -1.0 to +1.0 for informs edges, 0-1 for structural"
+    },
+    reasoning: { type: "string", description: "Why this relationship exists" },
+    reasoningMethod: {
+      type: "string",
+      description: "How this was determined",
+      enum: [...REASONING_METHODS]
+    },
+    metadata: {
+      type: "object",
+      description: "Optional edge metadata."
+    }
+  },
+  required: ["from", "to", "edgeType"],
+  response: {
+    description: "The created edge",
+    fields: {
+      globalId: "string \u2014 edge identifier",
+      edgeType: "string",
+      fromLayer: "string",
+      toLayer: "string"
+    }
+  },
+  ownerModule: "graph-primitives",
+  ontologyPrimitive: "edge",
+  tier: "showcase"
+};
+var UPDATE_EDGE = {
+  name: "update_edge",
+  description: "Amend metadata on an existing graph edge. Like `git commit --amend` \u2014 changes the edge annotation without recreating the relationship.",
+  parameters: {
+    edgeId: { type: "string", description: "Edge ID or global ID to update" },
+    weight: { type: "number", description: "Updated edge weight" },
+    confidence: { type: "number", description: "Updated confidence" },
+    context: { type: "string", description: "Updated human-readable context" },
+    derivationType: { type: "string", description: "Updated derivation type" },
+    metadata: { type: "object", description: "Updated metadata" }
+  },
+  required: ["edgeId"],
+  response: {
+    description: "Edge update result",
+    fields: { success: "boolean" }
+  },
+  ownerModule: "graph-primitives",
+  ontologyPrimitive: "edge",
+  tier: "workhorse"
+};
+var REMOVE_EDGE = {
+  name: "remove_edge",
+  description: "Remove one graph edge by ID. Like `git rm` \u2014 deletes a single explicit relationship from the spine.",
+  parameters: {
+    edgeId: { type: "string", description: "Edge ID or global ID to remove" }
+  },
+  required: ["edgeId"],
+  response: {
+    description: "Edge removal result",
+    fields: { success: "boolean" }
+  },
+  ownerModule: "graph-primitives",
+  ontologyPrimitive: "edge",
+  tier: "workhorse"
+};
+var REMOVE_EDGES_BETWEEN = {
+  name: "remove_edges_between",
+  description: "Remove graph edges between two nodes. Like `git rm <pathspec>` \u2014 deletes relationships matching a source, target, and optional type.",
+  parameters: {
+    fromNodeId: { type: "string", description: "Source node ID or global ID" },
+    toNodeId: { type: "string", description: "Target node ID or global ID" },
+    edgeType: { type: "string", description: "Optional edge type filter" }
+  },
+  required: ["fromNodeId", "toNodeId"],
+  response: {
+    description: "Matched edge removal result",
+    fields: { deleted: "number" }
+  },
+  ownerModule: "graph-primitives",
+  ontologyPrimitive: "edge",
+  tier: "workhorse"
+};
+var BATCH_CREATE_EDGES = {
+  name: "batch_create_edges",
+  description: "Commit multiple typed graph edges. Like `git commit` with many staged paths \u2014 writes a batch of explicit relationships atomically per edge.",
+  parameters: {
+    edges: {
+      type: "array",
+      description: "Edges to create, each with from, to, edgeType, and optional weight/confidence/context."
+    },
+    skipLayerValidation: {
+      type: "boolean",
+      description: "Skip kernel layer validation for trusted materialization flows."
+    }
+  },
+  required: ["edges"],
+  response: {
+    description: "Batch edge creation result",
+    fields: {
+      created: "number",
+      results: "array",
+      errors: "array"
+    }
+  },
+  ownerModule: "graph-primitives",
+  ontologyPrimitive: "edge",
+  tier: "workhorse"
+};
+
+export { BATCH_CREATE_EDGES, BISECT_CONFIDENCE, CREATE_EDGE, FIND_CONTRADICTIONS, GET_AUDIT_TRAIL, GET_CONFIDENCE_HISTORY, GET_GRAPH_NEIGHBORHOOD, QUERY_LINEAGE, REMOVE_EDGE, REMOVE_EDGES_BETWEEN, SEARCH_BELIEFS, TRACE_ENTITY_IMPACT, TRAVERSE_GRAPH, UPDATE_EDGE };
+//# sourceMappingURL=tool-contracts.graph.js.map
+//# sourceMappingURL=tool-contracts.graph.js.map

package/dist/tool-contracts.graph.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/types/reasoning-method.ts","../src/tool-contracts.graph.ts"],"names":[],"mappings":";AACO,IAAM,iBAAA,GAAoB;AAAA,EAC/B,WAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,YAAA;AAAA,EACA,QAAA;AAAA,EACA,eAAA;AAAA,EACA,aAAA;AAAA,EACA,aAAA;AAAA,EACA,UAAA;AAAA,EACA;AACF,CAAA;;;ACTO,IAAM,aAAA,GAAiC;AAAA,EAC5C,IAAA,EAAM,eAAA;AAAA,EACN,WAAA,EACE,8PAAA;AAAA,EAIF,UAAA,EAAY;AAAA,IACV,MAAA,EAAQ,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,6BAAA,EAA8B;AAAA,IACrE,KAAA,EAAO;AAAA,MACL,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa;AAAA;AACf,GACF;AAAA,EACA,QAAA,EAAU,CAAC,QAAQ,CAAA;AAAA,EACnB,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,0BAAA;AAAA,IACb,MAAA,EAAQ;AAAA,MACN,QAAA,EAAU,mCAAA;AAAA,MACV,OAAA,EAAS;AAAA;AACX,GACF;AAAA,EACA,WAAA,EAAa,cAAA;AAAA,EACb,iBAAA,EAAmB,QAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAEO,IAAM,sBAAA,GAA0C;AAAA,EACrD,IAAA,EAAM,wBAAA;AAAA,EACN,WAAA,EACE,iMAAA;AAAA,EAGF,UAAA,EAAY;AAAA,IACV,MAAA,EAAQ,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,+BAAA;AAAgC,GACzE;AAAA,EACA,QAAA,EAAU,CAAC,QAAQ,CAAA;AAAA,EACnB,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,4BAAA;AAAA,IACb,MAAA,EAAQ;AAAA,MACN,QAAA,EAAU,mCAAA;AAAA,MACV,OAAA,EAAS,oEAAA;AAAA,MACT,UAAA,EAAY;AAAA;AACd,GACF;AAAA,EACA,WAAA,EAAa,kBAAA;AAAA,EACb,iBAAA,EAAmB,QAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAEO,IAAM,eAAA,GAAmC;AAAA,EAC9C,IAAA,EAAM,iBAAA;AAAA,EACN,WAAA,EACE,qPAAA;AAAA,EAIF,UAAA,EAAY;AAAA,IACV,MAAA,EAAQ,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,mBAAA,EAAoB;AAAA,IAC3D,KAAA,EAAO;AAAA,MACL,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa;AAAA;AACf,GACF;AAAA,EACA,QAAA,EAAU,CAAC,QAAQ,CAAA;AAAA,EACnB,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,qBAAA;AAAA,IACb,MAAA,EAAQ;AAAA,MACN,OAAA,EAAS;AAAA;AACX,GACF;AAAA,EACA,WAAA,EAAa,kBAAA;AAAA,EACb,iBAAA,EAAmB,OAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAMO,IAAM,cAAA,GAAkC;AAAA,EAC7C,IAAA,EAAM,gBAAA;AAAA,EACN,WAAA,EACE,2XAAA;AAAA,EAKF,UAAA,EAAY;AAAA,IACV,SAAA,EAAW,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,8BAAA,EAA+B;AAAA,IACzE,SAAA,EAAW;AAAA,MACT,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa,qBAAA;AAAA,MACb,IAAA,EAAM,CAAC,IAAA,EAAM,MAAA,EAAQ,MAAM;AAAA,KAC7B;AAAA,IACA,QAAA,EAAU;AAAA,MACR,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa;AAAA;AACf,GACF;AAAA,EACA,QAAA,EAAU,CAAC,WAAW,CAAA;AAAA,EACtB,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,uCAAA;AAAA,IACb,MAAA,EAAQ;AAAA,MACN,KAAA,EAAO,8BAAA;AAAA,MACP,KAAA,EAAO,8BAAA;AAAA,MACP,KAAA,EAAO;AAAA;AACT,GACF;AAAA,EACA,WAAA,EAAa,cAAA;AAAA,EACb,iBAAA,EAAmB,OAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAEO,IAAM,sBAAA,GAA0C;AAAA,EACrD,IAAA,EAAM,wBAAA;AAAA,EACN,WAAA,EACE,qNAAA;AAAA,EAGF,UAAA,EAAY;AAAA,IACV,QAAA,EAAU;AAAA,MACR,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa;AAAA,KACf;AAAA,IACA,SAAA,EAAW;AAAA,MACT,IAAA,EAAM,OAAA;AAAA,MACN,WAAA,EAAa;AAAA,KACf;AAAA,IACA,QAAA,EAAU;AAAA,MACR,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa;AAAA;AACf,GACF;AAAA,EACA,UAAU,EAAC;AAAA,EACX,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,sCAAA;AAAA,IACb,MAAA,EAAQ;AAAA,MACN,KAAA,EAAO,uDAAA;AAAA,MACP,KAAA,EAAO,uDAAA;AAAA,MACP,KAAA,EAAO;AAAA;AACT,GACF;AAAA,EACA,WAAA,EAAa,cAAA;AAAA,EACb,iBAAA,EAAmB,OAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAEO,IAAM,mBAAA,GAAuC;AAAA,EAClD,IAAA,EAAM,qBAAA;AAAA,EACN,WAAA,EACE,2WAAA;AAAA,EAKF,UAAA,EAAY;AAAA,IACV,MAAA,EAAQ;AAAA,MACN,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa;AAAA;AACf,GACF;AAAA,EACA,QAAA,EAAU,CAAC,QAAQ,CAAA;AAAA,EACnB,QAAA,EAAU;AAAA,IACR,WAAA,EACE,0EAAA;AAAA,IACF,MAAA,EAAQ;AAAA,MACN,YAAA,EAAc,iCAAA;AAAA,MACd,UAAA,EAAY,sCAAA;AAAA,MACZ,uBAAA,EACE,0DAAA;AAAA,MACF,mBAAA,EAAqB,+CAAA;AAAA,MACrB,yBAAA,EAA2B,+CAAA;AAAA,MAC3B,gBAAA,EAAkB;AAAA;AACpB,GACF;AAAA,EACA,WAAA,EAAa,cAAA;AAAA,EACb,iBAAA,EAAmB,OAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAEO,IAAM,cAAA,GAAkC;AAAA,EAC7C,IAAA,EAAM,gBAAA;AAAA,EACN,WAAA,EACE,+UAAA;AAAA,EAKF,UAAA,EAAY;AAAA,IACV,KAAA,EAAO,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,uBAAA,EAAwB;AAAA,IAC9D,MAAA,EAAQ;AAAA,MACN,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa,yBAAA;AAAA,MACb,IAAA,EAAM,CAAC,UAAA,EAAY,QAAA,EAAU,UAAU;AAAA,KACzC;AAAA,IACA,aAAA,EAAe;AAAA,MACb,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa;AAAA,KACf;AAAA,IACA,OAAA,EAAS,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,iBAAA,EAAkB;AAAA,IAC1D,KAAA,EAAO,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,+BAAA;AAAgC,GACxE;AAAA,EACA,QAAA,EAAU,CAAC,OAAO,CAAA;AAAA,EAClB,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,gCAAA;AAAA,IACb,MAAA,EAAQ;AAAA,MACN,OAAA,EACE;AAAA;AACJ,GACF;AAAA,EACA,WAAA,EAAa,cAAA;AAAA,EACb,iBAAA,EAAmB,QAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAEO,IAAM,mBAAA,GAAuC;AAAA,EAClD,IAAA,EAAM,qBAAA;AAAA,EACN,WAAA,EACE,+ZAAA;AAAA,EAKF,UAAA,EAAY;AAAA,IACV,OAAA,EAAS,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,iBAAA,EAAkB;AAAA,IAC1D,MAAA,EAAQ;AAAA,MACN,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa;AAAA,KACf;AAAA,IACA,MAAA,EAAQ;AAAA,MACN,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa,kBAAA;AAAA,MACb,IAAA,EAAM,CAAC,YAAA,EAAc,UAAA,EAAY,UAAU;AAAA;AAC7C,GACF;AAAA,EACA,UAAU,EAAC;AAAA,EACX,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,uBAAA;AAAA,IACb,MAAA,EAAQ;AAAA,MACN,cAAA,EACE;AAAA;AACJ,GACF;AAAA,EACA,WAAA,EAAa,cAAA;AAAA,EACb,iBAAA,EAAmB,QAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAMO,IAAM,iBAAA,GAAqC;AAAA,EAChD,IAAA,EAAM,mBAAA;AAAA,EACN,WAAA,EACE,yTAAA;AAAA,EAIF,UAAA,EAAY;AAAA,IACV,MAAA,EAAQ,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,sBAAA,EAAuB;AAAA,IAC9D,iBAAA,EAAmB;AAAA,MACjB,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa,qCAAA;AAAA,MACb,IAAA,EAAM,CAAC,eAAA,EAAiB,gBAAgB;AAAA,KAC1C;AAAA,IACA,SAAA,EAAW;AAAA,MACT,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EACE;AAAA;AACJ,GACF;AAAA,EACA,QAAA,EAAU,CAAC,QAAA,EAAU,mBAAmB,CAAA;AAAA,EACxC,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,4CAAA;AAAA,IACb,MAAA,EAAQ;AAAA,MACN,QAAA,EAAU,mCAAA;AAAA,MACV,iBAAA,EAAmB,8CAAA;AAAA,MACnB,eAAA,EACE,gEAAA;AAAA,MACF,YAAA,EAAc,iDAAA;AAAA,MACd,gBAAA,EAAkB,eAAA;AAAA,MAClB,eAAA,EAAiB,eAAA;AAAA,MACjB,YAAA,EAAc,QAAA;AAAA,MACd,eAAA,EAAiB;AAAA;AACnB,GACF;AAAA,EACA,WAAA,EAAa,cAAA;AAAA,EACb,iBAAA,EAAmB,QAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAMO,IAAM,WAAA,GAA+B;AAAA,EAC1C,IAAA,EAAM,aAAA;AAAA,EACN,WAAA,EACE,qQAAA;AAAA,EAGF,UAAA,EAAY;AAAA,IACV,IAAA,EAAM;AAAA,MACJ,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EACE;AAAA,KACJ;AAAA,IACA,EAAA,EAAI;AAAA,MACF,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EACE;AAAA,KACJ;AAAA,IACA,QAAA,EAAU;AAAA,MACR,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EACE;AAAA,KACJ;AAAA,IACA,QAAA,EAAU;AAAA,MACR,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa;AAAA,KACf;AAAA,IACA,MAAA,EAAQ;AAAA,MACN,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EACE;AAAA,KACJ;AAAA,IACA,SAAA,EAAW,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,8BAAA,EAA+B;AAAA,IACzE,eAAA,EAAiB;AAAA,MACf,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa,yBAAA;AAAA,MACb,IAAA,EAAM,CAAC,GAAG,iBAAiB;AAAA,KAC7B;AAAA,IACA,QAAA,EAAU;AAAA,MACR,IAAA,EAAM,QAAA;AAAA,MACN,WAAA,EAAa;AAAA;AACf,GACF;AAAA,EACA,QAAA,EAAU,CAAC,MAAA,EAAQ,IAAA,EAAM,UAAU,CAAA;AAAA,EACnC,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,kBAAA;AAAA,IACb,MAAA,EAAQ;AAAA,MACN,QAAA,EAAU,+BAAA;AAAA,MACV,QAAA,EAAU,QAAA;AAAA,MACV,SAAA,EAAW,QAAA;AAAA,MACX,OAAA,EAAS;AAAA;AACX,GACF;AAAA,EACA,WAAA,EAAa,kBAAA;AAAA,EACb,iBAAA,EAAmB,MAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAEO,IAAM,WAAA,GAA+B;AAAA,EAC1C,IAAA,EAAM,aAAA;AAAA,EACN,WAAA,EACE,6IAAA;AAAA,EAEF,UAAA,EAAY;AAAA,IACV,MAAA,EAAQ,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,gCAAA,EAAiC;AAAA,IACxE,MAAA,EAAQ,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,qBAAA,EAAsB;AAAA,IAC7D,UAAA,EAAY,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,oBAAA,EAAqB;AAAA,IAChE,OAAA,EAAS,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,gCAAA,EAAiC;AAAA,IACzE,cAAA,EAAgB,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,yBAAA,EAA0B;AAAA,IACzE,QAAA,EAAU,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,kBAAA;AAAmB,GAC9D;AAAA,EACA,QAAA,EAAU,CAAC,QAAQ,CAAA;AAAA,EACnB,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,oBAAA;AAAA,IACb,MAAA,EAAQ,EAAE,OAAA,EAAS,SAAA;AAAU,GAC/B;AAAA,EACA,WAAA,EAAa,kBAAA;AAAA,EACb,iBAAA,EAAmB,MAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAEO,IAAM,WAAA,GAA+B;AAAA,EAC1C,IAAA,EAAM,aAAA;AAAA,EACN,WAAA,EACE,0GAAA;AAAA,EAEF,UAAA,EAAY;AAAA,IACV,MAAA,EAAQ,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,gCAAA;AAAiC,GAC1E;AAAA,EACA,QAAA,EAAU,CAAC,QAAQ,CAAA;AAAA,EACnB,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,qBAAA;AAAA,IACb,MAAA,EAAQ,EAAE,OAAA,EAAS,SAAA;AAAU,GAC/B;AAAA,EACA,WAAA,EAAa,kBAAA;AAAA,EACb,iBAAA,EAAmB,MAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAEO,IAAM,oBAAA,GAAwC;AAAA,EACnD,IAAA,EAAM,sBAAA;AAAA,EACN,WAAA,EACE,2IAAA;AAAA,EAEF,UAAA,EAAY;AAAA,IACV,UAAA,EAAY,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,6BAAA,EAA8B;AAAA,IACzE,QAAA,EAAU,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,6BAAA,EAA8B;AAAA,IACvE,QAAA,EAAU,EAAE,IAAA,EAAM,QAAA,EAAU,aAAa,2BAAA;AAA4B,GACvE;AAAA,EACA,QAAA,EAAU,CAAC,YAAA,EAAc,UAAU,CAAA;AAAA,EACnC,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,6BAAA;AAAA,IACb,MAAA,EAAQ,EAAE,OAAA,EAAS,QAAA;AAAS,GAC9B;AAAA,EACA,WAAA,EAAa,kBAAA;AAAA,EACb,iBAAA,EAAmB,MAAA;AAAA,EACnB,IAAA,EAAM;AACR;AAEO,IAAM,kBAAA,GAAsC;AAAA,EACjD,IAAA,EAAM,oBAAA;AAAA,EACN,WAAA,EACE,kJAAA;AAAA,EAEF,UAAA,EAAY;AAAA,IACV,KAAA,EAAO;AAAA,MACL,IAAA,EAAM,OAAA;AAAA,MACN,WAAA,EACE;AAAA,KACJ;AAAA,IACA,mBAAA,EAAqB;AAAA,MACnB,IAAA,EAAM,SAAA;AAAA,MACN,WAAA,EAAa;AAAA;AACf,GACF;AAAA,EACA,QAAA,EAAU,CAAC,OAAO,CAAA;AAAA,EAClB,QAAA,EAAU;AAAA,IACR,WAAA,EAAa,4BAAA;AAAA,IACb,MAAA,EAAQ;AAAA,MACN,OAAA,EAAS,QAAA;AAAA,MACT,OAAA,EAAS,OAAA;AAAA,MACT,MAAA,EAAQ;AAAA;AACV,GACF;AAAA,EACA,WAAA,EAAa,kBAAA;AAAA,EACb,iBAAA,EAAmB,MAAA;AAAA,EACnB,IAAA,EAAM;AACR","file":"tool-contracts.graph.js","sourcesContent":["/** Reasoning methods supported by the kernel edge schema. */\nexport const REASONING_METHODS = [\n  \"deductive\",\n  \"inductive\",\n  \"abductive\",\n  \"analogical\",\n  \"causal\",\n  \"correlational\",\n  \"testimonial\",\n  \"statistical\",\n  \"implicit\",\n  \"pattern_match\",\n] as const;\n\nexport type ReasoningMethod = (typeof REASONING_METHODS)[number];\n","import type { McpToolContract } from \"./tool-contracts.types\";\nimport { REASONING_METHODS } from \"./api-enums.contract\";\n\nexport const QUERY_LINEAGE: McpToolContract = {\n  name: \"query_lineage\",\n  description:\n    \"Trace a belief's full ancestry — every fork, score, and confidence modulation. \" +\n    \"Like `git log --graph`. \" +\n    \"Returns the complete evolution chain showing how understanding developed over time. \" +\n    \"Lineage is permanent and can never be erased (Invariant #3).\",\n  parameters: {\n    nodeId: { type: \"string\", description: \"Starting node to trace from\" },\n    depth: {\n      type: \"number\",\n      description: \"How many generations to traverse (default: 5)\",\n    },\n  },\n  required: [\"nodeId\"],\n  response: {\n    description: \"Canonical lineage result\",\n    fields: {\n      beliefId: \"string — canonical belief ID\",\n      lineage: \"array — ancestry entries with beliefId, nodeId, formulation, forkReason, and createdAt\",\n    },\n  },\n  ownerModule: \"graph-search\",\n  ontologyPrimitive: \"belief\",\n  tier: \"workhorse\",\n};\n\nexport const GET_CONFIDENCE_HISTORY: McpToolContract = {\n  name: \"get_confidence_history\",\n  description:\n    \"Get the full confidence history for a belief. \" +\n    \"Each entry records the confidence level, trigger, rationale, and actor. \" +\n    \"Like `git log` for a single metric — append-only, never overwritten.\",\n  parameters: {\n    nodeId: { type: \"string\", description: \"The belief to get history for\" },\n  },\n  required: [\"nodeId\"],\n  response: {\n    description: \"Confidence history entries\",\n    fields: {\n      beliefId: \"string — canonical belief ID\",\n      entries: \"array — { confidence, trigger, rationale, timestamp, userId }\",\n      nextCursor: \"string | null\",\n    },\n  },\n  ownerModule: \"graph-primitives\",\n  ontologyPrimitive: \"belief\",\n  tier: \"workhorse\",\n};\n\nexport const GET_AUDIT_TRAIL: McpToolContract = {\n  name: \"get_audit_trail\",\n  description:\n    \"Get the full audit trail for a node — every mutation, who made it, when, and why. \" +\n    \"Like `git blame` for knowledge. \" +\n    \"All state transitions are explicit, attributable, and permanently queryable. \" +\n    \"No silent changes are possible (Invariant #14).\",\n  parameters: {\n    nodeId: { type: \"string\", description: \"The node to audit\" },\n    limit: {\n      type: \"number\",\n      description: \"Maximum entries to return (default: 50)\",\n    },\n  },\n  required: [\"nodeId\"],\n  response: {\n    description: \"Audit trail entries\",\n    fields: {\n      entries: \"array — { action, actor, timestamp, before, after, rationale }\",\n    },\n  },\n  ownerModule: \"graph-primitives\",\n  ontologyPrimitive: \"graph\",\n  tier: \"workhorse\",\n};\n\n// =============================================================================\n// GRAPH QUERY TOOLS\n// =============================================================================\n\nexport const TRAVERSE_GRAPH: McpToolContract = {\n  name: \"traverse_graph\",\n  description:\n    \"Walk the reasoning graph from a starting node. \" +\n    \"Like `git log --graph` — traverses connected lineage across nodes and edges. \" +\n    \"Traversal follows epistemic layers: L4 (judgments) → L3 (beliefs, questions) → L2 (evidence) → L1 (sources). \" +\n    \"Never skips layers. \" +\n    \"Use direction 'up' to trace what a piece of evidence supports, 'down' to trace what supports a judgment.\",\n  parameters: {\n    startNode: { type: \"string\", description: \"Node to start traversal from\" },\n    direction: {\n      type: \"string\",\n      description: \"Traversal direction\",\n      enum: [\"up\", \"down\", \"both\"],\n    },\n    maxDepth: {\n      type: \"number\",\n      description: \"Maximum traversal depth (default: 3)\",\n    },\n  },\n  required: [\"startNode\"],\n  response: {\n    description: \"Subgraph of traversed nodes and edges\",\n    fields: {\n      nodes: \"array — traversed nodes\",\n      edges: \"array — traversed edges\",\n      depth: \"number\",\n    },\n  },\n  ownerModule: \"graph-search\",\n  ontologyPrimitive: \"graph\",\n  tier: \"workhorse\",\n};\n\nexport const GET_GRAPH_NEIGHBORHOOD: McpToolContract = {\n  name: \"get_graph_neighborhood\",\n  description:\n    \"Retrieve the local neighborhood around one or more graph nodes. \" +\n    \"Like `git log --graph --boundary` for a focused reasoning window. \" +\n    \"Returns the canonical neighborhood payload shared by HTTP and SDK graph surfaces.\",\n  parameters: {\n    globalId: {\n      type: \"string\",\n      description: \"Single root node global identifier.\",\n    },\n    globalIds: {\n      type: \"array\",\n      description: \"Optional list of root node global identifiers.\",\n    },\n    maxDepth: {\n      type: \"number\",\n      description: \"Maximum traversal depth (default: 2).\",\n    },\n  },\n  required: [],\n  response: {\n    description: \"Canonical graph neighborhood payload\",\n    fields: {\n      nodes: \"array — graph nodes in the returned neighborhood\",\n      edges: \"array — graph edges in the returned neighborhood\",\n      depth: \"number — deepest traversed node depth\",\n    },\n  },\n  ownerModule: \"graph-search\",\n  ontologyPrimitive: \"graph\",\n  tier: \"workhorse\",\n};\n\nexport const TRACE_ENTITY_IMPACT: McpToolContract = {\n  name: \"trace_entity_impact\",\n  description:\n    \"Returns code-grounded beliefs, contracts, migration states, and failed attempts \" +\n    \"anchored to a specific file or function path. \" +\n    \"Like `git log -- <path>` — filters the knowledge graph to nodes anchored to a file path \" +\n    \"via metadata.codeAnchors. Results are separated by coding belief type: decisions, contracts, \" +\n    \"migrations, patterns, deprecations, and failures.\",\n  parameters: {\n    nodeId: {\n      type: \"string\",\n      description: \"Entity node ID to trace impact from\",\n    },\n  },\n  required: [\"nodeId\"],\n  response: {\n    description:\n      \"Entity impact trace: direct beliefs, evidence, and indirect belief reach\",\n    fields: {\n      entityNodeId: \"string — the traced entity\",\n      entityType: \"string — nodeType of the entity\",\n      directBeliefConnections:\n        \"array — beliefs directly connected via bridge edges\",\n      evidenceConnections: \"array — evidence referencing this entity\",\n      indirectBeliefConnections: \"array — beliefs reached through evidence\",\n      totalBeliefReach: \"number — total unique beliefs impacted\",\n    },\n  },\n  ownerModule: \"graph-search\",\n  ontologyPrimitive: \"graph\",\n  tier: \"workhorse\",\n};\n\nexport const SEARCH_BELIEFS: McpToolContract = {\n  name: \"search_beliefs\",\n  description:\n    \"Search for beliefs in the reasoning graph. \" +\n    \"Like `git grep` — finds relevant beliefs across the full history and active state. \" +\n    \"Supports semantic search, filtering by status (unscored, scored, archived), \" +\n    \"confidence thresholds, and topic scope. \" +\n    \"Returns beliefs with their current confidence, lineage depth, and contradiction count.\",\n  parameters: {\n    query: { type: \"string\", description: \"Semantic search query\" },\n    status: {\n      type: \"string\",\n      description: \"Filter by belief status\",\n      enum: [\"unscored\", \"scored\", \"archived\"],\n    },\n    minConfidence: {\n      type: \"number\",\n      description: \"Minimum confidence threshold (0-1)\",\n    },\n    topicId: { type: \"string\", description: \"Filter by topic\" },\n    limit: { type: \"number\", description: \"Maximum results (default: 10)\" },\n  },\n  required: [\"query\"],\n  response: {\n    description: \"Matching beliefs with metadata\",\n    fields: {\n      results:\n        \"array — { nodeId, canonicalText, confidence, status, contradictionCount }\",\n    },\n  },\n  ownerModule: \"graph-search\",\n  ontologyPrimitive: \"belief\",\n  tier: \"workhorse\",\n};\n\nexport const FIND_CONTRADICTIONS: McpToolContract = {\n  name: \"find_contradictions\",\n  description:\n    \"Find contradictions in the reasoning graph — beliefs that are in tension with each other. \" +\n    \"Like a merge conflict in `git` — surfaces incompatible states that require explicit resolution. \" +\n    \"Contradictions are first-class objects that may remain permanently unresolved. \" +\n    \"They can block judgments, trigger forks, or collapse confidence. \" +\n    \"Filter by project, status (unresolved, resolved, accepted), and severity.\",\n  parameters: {\n    topicId: { type: \"string\", description: \"Filter by topic\" },\n    nodeId: {\n      type: \"string\",\n      description: \"Find contradictions involving a specific belief\",\n    },\n    status: {\n      type: \"string\",\n      description: \"Filter by status\",\n      enum: [\"unresolved\", \"resolved\", \"accepted\"],\n    },\n  },\n  required: [],\n  response: {\n    description: \"Contradiction objects\",\n    fields: {\n      contradictions:\n        \"array — { beliefA, beliefB, description, severity, status, defeatType }\",\n    },\n  },\n  ownerModule: \"graph-search\",\n  ontologyPrimitive: \"belief\",\n  tier: \"showcase\",\n};\n\n// =============================================================================\n// EDGE TOOLS\n// =============================================================================\n\nexport const BISECT_CONFIDENCE: McpToolContract = {\n  name: \"bisect_confidence\",\n  description:\n    \"Find when a belief's confidence diverged from reality. \" +\n    \"Like `git bisect` — binary search through the credence history to find the inflection point. \" +\n    \"Given a belief that is now known to be wrong (or right), traces back through \" +\n    \"confidence modulations to identify which evidence or event caused the divergence.\",\n  parameters: {\n    nodeId: { type: \"string\", description: \"The belief to bisect\" },\n    expectedDirection: {\n      type: \"string\",\n      description: \"Was confidence too high or too low?\",\n      enum: [\"overconfident\", \"underconfident\"],\n    },\n    timeRange: {\n      type: \"object\",\n      description:\n        \"Optional time range to search within: { start: number, end: number }\",\n    },\n  },\n  required: [\"nodeId\", \"expectedDirection\"],\n  response: {\n    description: \"The inflection point in confidence history\",\n    fields: {\n      beliefId: \"string — canonical belief ID\",\n      expectedDirection: \"string — overconfident | underconfident\",\n      inflectionEntry:\n        \"object — the confidence modulation where divergence began\",\n      triggerEvent: \"string | null — what caused the divergence\",\n      confidenceBefore: \"number | null\",\n      confidenceAfter: \"number | null\",\n      totalEntries: \"number\",\n      inflectionIndex: \"number | null\",\n    },\n  },\n  ownerModule: \"graph-search\",\n  ontologyPrimitive: \"belief\",\n  tier: \"showcase\",\n};\n\n// =============================================================================\n// GRAPH INTELLIGENCE TOOLS\n// =============================================================================\n\nexport const CREATE_EDGE: McpToolContract = {\n  name: \"create_edge\",\n  description:\n    \"Commit a typed relationship between two nodes in the reasoning graph. \" +\n    \"Like `git commit` — an atomic write that declares a dependency between nodes. \" +\n    \"Accepts any public epistemic edge type between public graph node refs so agents can author the full spine.\",\n  parameters: {\n    from: {\n      type: \"object\",\n      description:\n        \"Source graph ref, e.g. { kind: 'epistemic_node', nodeId: '...', nodeType: 'topic' }\",\n    },\n    to: {\n      type: \"object\",\n      description:\n        \"Target graph ref, e.g. { kind: 'epistemic_node', nodeId: '...', nodeType: 'belief' }\",\n    },\n    edgeType: {\n      type: \"string\",\n      description:\n        \"Relationship type from the public epistemic edge enum.\",\n    },\n    globalId: {\n      type: \"string\",\n      description: \"Optional idempotent edge global ID.\",\n    },\n    weight: {\n      type: \"number\",\n      description:\n        \"Edge weight: -1.0 to +1.0 for informs edges, 0-1 for structural\",\n    },\n    reasoning: { type: \"string\", description: \"Why this relationship exists\" },\n    reasoningMethod: {\n      type: \"string\",\n      description: \"How this was determined\",\n      enum: [...REASONING_METHODS],\n    },\n    metadata: {\n      type: \"object\",\n      description: \"Optional edge metadata.\",\n    },\n  },\n  required: [\"from\", \"to\", \"edgeType\"],\n  response: {\n    description: \"The created edge\",\n    fields: {\n      globalId: \"string — edge identifier\",\n      edgeType: \"string\",\n      fromLayer: \"string\",\n      toLayer: \"string\",\n    },\n  },\n  ownerModule: \"graph-primitives\",\n  ontologyPrimitive: \"edge\",\n  tier: \"showcase\",\n};\n\nexport const UPDATE_EDGE: McpToolContract = {\n  name: \"update_edge\",\n  description:\n    \"Amend metadata on an existing graph edge. \" +\n    \"Like `git commit --amend` — changes the edge annotation without recreating the relationship.\",\n  parameters: {\n    edgeId: { type: \"string\", description: \"Edge ID or global ID to update\" },\n    weight: { type: \"number\", description: \"Updated edge weight\" },\n    confidence: { type: \"number\", description: \"Updated confidence\" },\n    context: { type: \"string\", description: \"Updated human-readable context\" },\n    derivationType: { type: \"string\", description: \"Updated derivation type\" },\n    metadata: { type: \"object\", description: \"Updated metadata\" },\n  },\n  required: [\"edgeId\"],\n  response: {\n    description: \"Edge update result\",\n    fields: { success: \"boolean\" },\n  },\n  ownerModule: \"graph-primitives\",\n  ontologyPrimitive: \"edge\",\n  tier: \"workhorse\",\n};\n\nexport const REMOVE_EDGE: McpToolContract = {\n  name: \"remove_edge\",\n  description:\n    \"Remove one graph edge by ID. \" +\n    \"Like `git rm` — deletes a single explicit relationship from the spine.\",\n  parameters: {\n    edgeId: { type: \"string\", description: \"Edge ID or global ID to remove\" },\n  },\n  required: [\"edgeId\"],\n  response: {\n    description: \"Edge removal result\",\n    fields: { success: \"boolean\" },\n  },\n  ownerModule: \"graph-primitives\",\n  ontologyPrimitive: \"edge\",\n  tier: \"workhorse\",\n};\n\nexport const REMOVE_EDGES_BETWEEN: McpToolContract = {\n  name: \"remove_edges_between\",\n  description:\n    \"Remove graph edges between two nodes. \" +\n    \"Like `git rm <pathspec>` — deletes relationships matching a source, target, and optional type.\",\n  parameters: {\n    fromNodeId: { type: \"string\", description: \"Source node ID or global ID\" },\n    toNodeId: { type: \"string\", description: \"Target node ID or global ID\" },\n    edgeType: { type: \"string\", description: \"Optional edge type filter\" },\n  },\n  required: [\"fromNodeId\", \"toNodeId\"],\n  response: {\n    description: \"Matched edge removal result\",\n    fields: { deleted: \"number\" },\n  },\n  ownerModule: \"graph-primitives\",\n  ontologyPrimitive: \"edge\",\n  tier: \"workhorse\",\n};\n\nexport const BATCH_CREATE_EDGES: McpToolContract = {\n  name: \"batch_create_edges\",\n  description:\n    \"Commit multiple typed graph edges. \" +\n    \"Like `git commit` with many staged paths — writes a batch of explicit relationships atomically per edge.\",\n  parameters: {\n    edges: {\n      type: \"array\",\n      description:\n        \"Edges to create, each with from, to, edgeType, and optional weight/confidence/context.\",\n    },\n    skipLayerValidation: {\n      type: \"boolean\",\n      description: \"Skip kernel layer validation for trusted materialization flows.\",\n    },\n  },\n  required: [\"edges\"],\n  response: {\n    description: \"Batch edge creation result\",\n    fields: {\n      created: \"number\",\n      results: \"array\",\n      errors: \"array\",\n    },\n  },\n  ownerModule: \"graph-primitives\",\n  ontologyPrimitive: \"edge\",\n  tier: \"workhorse\",\n};\n\n// =============================================================================\n// EPISTEMIC NODE TOOLS\n// =============================================================================\n"]}

package/dist/tool-contracts.intelligence-evidence.d.ts

@@ -0,0 +1,15 @@
+import { McpToolContract } from './tool-contracts.types.js';
+
+declare const DETECT_CONFIRMATION_BIAS: McpToolContract;
+declare const GET_GRAPH_STRUCTURE_ANALYSIS: McpToolContract;
+declare const LIST_GRAPH_INTELLIGENCE_QUERIES: McpToolContract;
+declare const RUN_GRAPH_INTELLIGENCE_QUERY: McpToolContract;
+declare const GET_FALSIFICATION_QUESTIONS: McpToolContract;
+declare const SEARCH_EVIDENCE: McpToolContract;
+declare const CREATE_EVIDENCE: McpToolContract;
+declare const GET_EVIDENCE: McpToolContract;
+declare const LIST_EVIDENCE: McpToolContract;
+declare const LINK_EVIDENCE: McpToolContract;
+declare const LINK_EVIDENCE_TO_BELIEF: McpToolContract;
+
+export { CREATE_EVIDENCE, DETECT_CONFIRMATION_BIAS, GET_EVIDENCE, GET_FALSIFICATION_QUESTIONS, GET_GRAPH_STRUCTURE_ANALYSIS, LINK_EVIDENCE, LINK_EVIDENCE_TO_BELIEF, LIST_EVIDENCE, LIST_GRAPH_INTELLIGENCE_QUERIES, RUN_GRAPH_INTELLIGENCE_QUERY, SEARCH_EVIDENCE };