Skip to main content
Glama
mcp-hyperspace-memory

mcp-hyperspace-memory

Official
by YARlabs

memory_link

Creates an explicit directed, labeled, weighted relationship edge between two stored memories or concepts to build knowledge-graph links and dependency mappings.

Instructions

Create an explicit directed, labeled, weighted relationship edge between two memories or concepts in the native KAG vector-graph.

Tool call template

Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.

{
  "id": 1,
  "jsonrpc": "2.0",
  "method": "tools/call",
  "params": {
    "arguments": {
      "source_id": "<source_id>",
      "target_id": "<target_id>"
    },
    "name": "memory_link"
  }
}

Input Schema

NameRequiredDescriptionDefault
weightNoEdge weight (default 1.0)
relationNoSemantic relation label (e.g. OWNS, DEPENDS_ON, CAUSES)OWNS
source_idYesSource memory numeric ID
target_idYesTarget memory numeric ID

Schema Changelog

Changes observed during successful MCP inspections.

  1. First observedv4.2.0

TDQS

C2.9/5.0
Behavior2/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

No annotations are supplied, so the description carries the full behavioral burden. It states that an edge is created but omits whether the operation errors on an existing edge, whether it is idempotent, what permissions or prior state it requires, and what is returned; the existence of memory_unlink hints at reversibility but the description never says so.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness4/5

Is the description appropriately sized, front-loaded, and free of redundancy?

A single dense sentence with the verb and resource front-loaded and no filler. It is efficient, though the density (four stacked adjectives) slightly obscures which words map to which parameters.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness3/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

This is a simple four-parameter graph-mutation tool with full schema coverage and no output schema, so the description need not explain parameters or return values. However, with zero annotation coverage, it should still address duplicate handling and whether target memories must pre-exist; that gap keeps it at minimum-viable completeness.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters3/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema description coverage is 100%, so the schema already documents all four parameters and the baseline is 3. The description does add the notion of directionality ('directed', between source and target memories), which clarifies semantics the schema leaves implicit, but adds nothing on valid relation labels or weight ranges.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose4/5

Does the description clearly state what the tool does and how it differs from similar tools?

The description gives a specific verb ('Create') and a precisely characterized resource ('explicit directed, labeled, weighted relationship edge between two memories or concepts'). The word 'explicit' implicitly contrasts with automatically inferred edges, but no sibling such as memory_induce_edges or memory_link_batch is named.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines2/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

There is no guidance on when to create a link manually versus letting memory_induce_edges infer one, or when to use memory_link_batch instead. Prerequisites are also unstated: nothing says whether both memory IDs must already exist or what to do when a duplicate edge is attempted.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.