mcp-hyperspace-memory
OfficialServer Configuration
Describes the environment variables required to run the server.
| Name | Required | Description | Default |
|---|---|---|---|
| CDE_API_KEY | No | Cloud API key for `v5_Embedding_801` (used when local DB has a custom password). | |
| YAR_API_KEY | No | Cloud API key for `v5_Embedding_801` (used when local DB has a custom password). | |
| HYPERSPACE_HOST | No | HyperspaceDB host. Set to `localhost:50051` to run with a self-hosted instance. | the.yar.ink |
| MEMORY_COLLECTION | No | Collection name to store memories in. | agent_memory |
| HYPERSPACE_API_KEY | Yes | Database API key (`sk_...` for SaaS or your local DB password). Required to authenticate to HyperspaceDB. | |
| HYPERSPACE_ENCRYPTION_KEY | No | Client-side Zero-Knowledge encryption key (activates orthogonal/Lorentz projection + AES-256-GCM payload encryption). |
Instructions
Guidance the server publishes about itself, which clients place ahead of the tool catalog so the model reads it before choosing anything.
This server publishes no instructions, or was last inspected before Glama recorded them.
Capabilities
Features and capabilities supported by this server
Protocol revision2025-11-25
| Capability | Details |
|---|---|
| tools | {} |
Tools
Functions exposed to the LLM to take actions
| Name | Description |
|---|---|
| memory_rememberA | Store a new memory, event, fact, or procedure for the agent in collection 'agent_cognitive_memories_129'. Automatically vectorizes text and stores with session_id, tags, memory_type (semantic, episodic, procedural), and importance (1-10). Returns a JSON object with memory_id, status, and metadata summary. |
| memory_recallA | Retrieve the most relevant memories for a query from collection 'agent_cognitive_memories_129' using semantic similarity. Filter by session_id, memory_type ('semantic'|'episodic'|'procedural'), or min_importance (1-10). Returns a JSON object with query, filters, and ranked memories with cognitive scores. |
| memory_forgetC | Delete a specific memory by numeric memory_id from collection 'agent_cognitive_memories_129'. Returns a JSON object with success status and confirmation message. |
| memory_updateA | Update an existing memory by deleting memory_id and storing new_text with refreshed embeddings and metadata. Returns a JSON object with old_memory_id, new_memory_id, and status. |
| memory_list_sessionsB | Discover unique session_ids and active conversation threads present in collection 'agent_cognitive_memories_129'. Uses multi-probe vector queries to ensure comprehensive session discovery. Returns a JSON object with session_count and list of sessions with memory counts and recent sample previews. |
| memory_explore_hierarchyB | Explore conceptual hierarchy in memory using Lorentz Cone Subsumption. 'up' navigates to parent/hypernym concepts; 'down' returns the subsumption tree of descendant concepts. Returns a JSON structure of the hierarchy. |
| memory_consolidateA | Consolidate a cluster of related episodic memories into a single abstract semantic concept using the Fréchet Mean on the hyperboloid. Optionally stores the synthesized summary_text back into memory (persist: true) and cleans up source memories (archive_sources: true). Returns a JSON report with consolidated_id, mean vector, and source IDs. |
| memory_verify_claimA | Verify whether a logical claim (conclusion) is geometrically consistent with a premise in 129D MRL hybrid space (Lorentz + Cosine). Returns a JSON object with status ('VERIFIED'|'REJECTED'), trust_score (0.0-1.0), geodesic distances, and geometric explanation to prevent hallucinations. |
| memory_statsA | Get operational statistics and health diagnostics for the memory collection 'agent_cognitive_memories_129'. Returns a JSON object with total vector count, dimension, metric, cascade settings, and host information. |
| hyperspace_query_plannerB | Enterprise Query Planner & Intent Disambiguator. Evaluates raw user queries before issuing memory retrieval. Detects ambiguous intent, returns multiple-choice questions for the user, or splits compound questions into parallel sub-queries. |
| memory_query_plannerD | Alias for hyperspace_query_planner. |
| memory_linkC | Create an explicit directed, labeled, weighted relationship edge between two memories or concepts in the native KAG vector-graph. |
| memory_unlinkC | Delete an explicit directed relationship edge with zero-lag invalidation. |
| memory_induce_edgesB | Declaratively induce explicit graph edges across memory entries from existing metadata attributes (path_hierarchy, foreign_key, exact_match). |
| memory_link_batchB | Bulk-insert explicit directed edges between memories/entities in the CSR KAG graph atomically. |
| memory_verify_generationC | Tribunal Router: Mathematically verify whether an LLM response stays within the geometric entailment cones and geodesic boundaries of retrieved memory IDs. |
Prompts
Interactive templates invoked by user choice
| Name | Description |
|---|---|
No prompts | |
Resources
Contextual data attached and managed by the client
| Name | Description |
|---|---|
No resources | |
TDQS
Scored across 16 tools
Core memory CRUD tools are clearly distinct, but memory_query_planner is an exact alias of hyperspace_query_planner, creating direct confusion. Several advanced operations also overlap in concept (memory_link/memory_link_batch/memory_induce_edges, and memory_verify_claim/memory_verify_generation), though their descriptions help differentiate them.
Most tools follow a predictable memory_verb_noun snake_case pattern, such as memory_remember, memory_recall, and memory_forget. The main deviations are hyperspace_query_planner and its duplicate alias memory_query_planner, which break the memory_ prefix convention.
At 16 tools, the surface is slightly above the ideal 3-15 range but still reasonable for a feature-rich memory system with graph, hierarchy, consolidation, and verification capabilities. The only clear redundancy is the duplicated query planner alias.
The server covers the core memory lifecycle well: create, recall, update, delete, list sessions, stats, hierarchy exploration, consolidation, graph linking, and verification. Minor gaps remain around bulk memory operations and explicit session lifecycle management, but no major dead ends are obvious.