{"report":"{\"v\":1,\"package\":\"@verygoodplugins/mcp-automem\",\"version\":\"0.19.3\",\"ranAt\":\"2026-11-16T11:49:26.605Z\",\"install\":{\"ok\":true,\"integrity\":\"sha512-VKWjbEeZSqXTWIPTvT7j/Xox2fSsdj5NqH40bCFU8XathcFvqSieMyAyviasSEWZnivitW74SaVaEP/GZwoODQ==\",\"deps\":127,\"scripts\":[],\"bins\":[\"mcp-automem\"],\"license\":\"MIT\",\"engines\":\"node ^20.19.0 || ^22.13.0 || >=24\",\"repository\":\"git+https://github.com/verygoodplugins/mcp-automem.git\",\"bin\":\"mcp-automem\"},\"start\":{\"ok\":true,\"ms\":246,\"serverName\":\"mcp-automem\",\"serverVersion\":\"0.19.3\",\"protocol\":\"2025-06-18\",\"stderr\":\"[AutoMem] Network error, retrying after 500ms (attempt 1/3)...\\n[AutoMem] Network error, retrying after 1000ms (attempt 2/3)...\\n[AutoMem] Network error, retrying after 2000ms (attempt 3/3)...\\nAutoMem API error (GET http://127.0.0.1:8001/health): [TypeError: fetch failed] {\\n  [cause]: Error: connect ECONNREFUSED 127.0.0.1:8001\\n      at TCPConnectWrap.afterConnect [as oncomplete] (node:net:2083:16) {\\n    errno: -111,\\n    code: 'ECONNREFUSED',\\n    syscall: 'connect',\\n    address: '127.0.0.1',\\n    port: 8001\\n  }\\n}\\n\"},\"tools\":[{\"name\":\"store_memory\",\"description\":\"Store memory in one of two modes — single-memory (set top-level `content`) or batch (set `memories: [...]` for up to 500).\\n\\n**Mode 1 — Single (default):** pass top-level `content` plus any optional fields (tags, importance, metadata, type, confidence, embedding, t_valid, t_invalid, etc.).\\n\\n**Mode 1b — Supersede/correct:** pass top-level `content` plus `supersedes_memory_id`. The server stores the replacement, marks the old memory invalid with `t_invalid=now`, merges supersede metadata, and associates old → new with `INVALIDATED_BY` (default) or `EVOLVED_INTO`.\\n\\n**Mode 2 — Batch:** pass `memories: [{ content, tags?, importance?, metadata?, timestamp?, type?, confidence? }, ...]` to store up to 500 memories in one request. Faster for bulk ingestion (imports, benchmark seeding). Batch mode does NOT accept `embedding`, `t_valid`, or `t_invalid` per-item — use single mode for those.\\n\\n**Content size guidelines (per item):**\\n- Target: 150-300 characters (one meaningful paragraph)\\n- Maximum: 500 characters (auto-summarized if exceeded)\\n- Hard limit: 2000 characters (rejected)\\n- Format: \\\"Brief title. Context and details. Impact/outcome.\\\"\\n\\n**When to use:**\\n- After making a decision: store the reasoning and outcome\\n- When discovering a pattern: store the pattern and where it applies\\n- After fixing a bug: store the root cause and solution\\n- When learning user preferences: store what they prefer and why\\n- For bulk ingestion (imports, seeding): use batch mode\\n\\n**Examples:**\\n- store_memory({ content: \\\"Chose PostgreSQL over MongoDB for user service. Need ACID for transactions.\\\", tags: [\\\"architecture\\\", \\\"database\\\"], importance: 0.9 })\\n- store_memory({ content: \\\"User prefers early returns over nested conditionals.\\\", tags: [\\\"code-style\\\"], importance: 0.7 })\\n- store_memory({ content: \\\"User now prefers SQLite for small local tools.\\\", supersedes_memory_id: \\\"8f3a2c1e-5b7d-4e9a-a1c3-2d4f6b8e0a91\\\", supersede_reason: \\\"Correction from user\\\" })\",\"params\":[\"content\",\"memories\",\"tags\",\"importance\",\"embedding\",\"metadata\",\"timestamp\",\"type\",\"confidence\",\"t_valid\",\"t_invalid\",\"updated_at\",\"last_accessed\",\"supersedes_memory_id\",\"supersede_relation\",\"supersede_reason\"]},{\"name\":\"recall_memory\",\"description\":\"Recall memories from AutoMem in one of three modes. The mode is selected by which params you pass.\\n\\n**Mode 1 — ID fetch:** pass `memory_id` to retrieve a single memory by ID. All other params are ignored. Routes to GET /memory/{id} and updates last_accessed.\\n\\n**Mode 2 — Tag enumeration:** pass `tags` + `exhaustive: true` for paginated exact-match listing (NOT ranked retrieval). Use this for cleanup/audit workflows where ranked retrieval silently undercounts large tag sets. Pair with `limit` (≤200) and `offset`. Returns `has_more`/`limit`/`offset` page metadata; next page at `next_offset`. Tag matching is exact, case-insensitive, any-of mode — `tag_match: \\\"prefix\\\"` and `tag_mode: \\\"all\\\"` are rejected in this mode.\\n\\n**Mode 3 — Ranked retrieval (default):** hybrid search across vector, keyword, tags, recency, and optional graph expansion. The primary tool for finding relevant context. By default, ranked recall requests current active memories only; set `current_only: false` for audits.\\n\\n**When to use ranked (mode 3):**\\n- At conversation start: recall context about the current project/topic\\n- Before making decisions: check for past decisions on similar topics\\n- When debugging: search for similar past errors and their solutions\\n- For complex questions: use `expand_entities` for multi-hop reasoning\\n\\n**When to use enumeration (mode 2):** when you need to know *how many* memories carry a tag, or to walk all of them for cleanup/migration. Ranked recall ignores low-importance hits — enumeration does not.\\n\\n**Examples:**\\n- recall_memory({ query: \\\"database architecture decisions\\\", tags: [\\\"my-project\\\"], limit: 5 })\\n- recall_memory({ memory_id: \\\"8f3a2c1e-5b7d-4e9a-a1c3-2d4f6b8e0a91\\\" })  // Mode 1\\n- recall_memory({ tags: [\\\"benchmark-test\\\"], exhaustive: true, limit: 50 })  // Mode 2 (add offset for later pages)\\n- recall_memory({ query: \\\"auth\\\", exclude_tags: [\\\"deprecated\\\"] })  // Mode 3 with exclusion\\n- recall_memory({ query: \\\"What is Sarah's sister's job?\\\", expand_entities: true })  // Mode 3 multi-hop\",\"params\":[\"memory_id\",\"exhaustive\",\"exclude_tags\",\"query\",\"queries\",\"embedding\",\"limit\",\"time_query\",\"start\",\"end\",\"tags\",\"tag_mode\",\"tag_match\",\"expand_entities\",\"expand_relations\",\"expand_respect_tags\",\"auto_decompose\",\"expansion_limit\",\"relation_limit\",\"expand_min_importance\",\"expand_min_strength\",\"current_only\",\"state_debug\",\"state_mode\",\"recency_bias\",\"scope_fallback\",\"min_score\",\"adaptive_floor\",\"context\",\"language\",\"active_path\",\"context_tags\",\"context_types\",\"priority_ids\",\"per_query_limit\",\"sort\",\"format\",\"offset\"]},{\"name\":\"associate_memories\",\"description\":\"Create typed relationships between memories. This builds a knowledge graph that improves recall by surfacing related context. Supports single-pair mode or batch mode with associations[] (max 500).\\n\\n**When to use:**\\n- After storing a new memory: link it to related existing memories\\n- When a bug fix relates to an original feature implementation\\n- When a new decision updates or invalidates a previous one\\n- To connect patterns with their concrete examples\\n\\n**Authorable relationship types:**\\n- RELATES_TO: General relationship (default)\\n- LEADS_TO: Causal relationship (A caused B)\\n- OCCURRED_BEFORE: Temporal ordering\\n- PREFERS_OVER: Chosen alternative\\n- EXEMPLIFIES: Concrete example of a pattern\\n- CONTRADICTS: Conflicts with another memory\\n- REINFORCES: Strengthens another memory's validity\\n- INVALIDATED_BY: Superseded by another memory\\n- EVOLVED_INTO: Updated version of a concept\\n- DERIVED_FROM: Implementation of a decision/pattern\\n- PART_OF: Component of a larger effort\\n\\n**Read-only/internal relations:**\\n- System/internal relations such as SIMILAR_TO, PRECEDED_BY, EXPLAINS, SHARES_THEME, PARALLEL_CONTEXT, and DISCOVERED may appear in recall results, but they are not valid inputs for associate_memories.\\n\\n**Examples:**\\n- associate_memories({ memory1_id: \\\"8f3a2c1e-5b7d-4e9a-a1c3-2d4f6b8e0a91\\\", memory2_id: \\\"3c9e7b2a-1f4d-4a8e-9b6c-5d2e8f1a7c34\\\", type: \\\"RELATES_TO\\\", strength: 0.9 })  // bug fix → feature\\n- associate_memories({ memory1_id: \\\"3c9e7b2a-1f4d-4a8e-9b6c-5d2e8f1a7c34\\\", memory2_id: \\\"8f3a2c1e-5b7d-4e9a-a1c3-2d4f6b8e0a91\\\", type: \\\"EVOLVED_INTO\\\", strength: 0.8 })  // old decision → new\\n- associate_memories({ associations: [{ memory1_id: \\\"8f3a2c1e-5b7d-4e9a-a1c3-2d4f6b8e0a91\\\", memory2_id: \\\"3c9e7b2a-1f4d-4a8e-9b6c-5d2e8f1a7c34\\\", type: \\\"RELATES_TO\\\", strength: 0.8 }] })\",\"params\":[\"memory1_id\",\"memory2_id\",\"type\",\"strength\",\"context\",\"reason\",\"pattern_type\",\"confidence\",\"resolution\",\"observations\",\"timestamp\",\"transformation\",\"role\",\"associations\"]},{\"name\":\"update_memory\",\"description\":\"Update an existing memory's content, tags, importance, or metadata. Use this to correct or enhance memories rather than storing duplicates.\\n\\n**When to use:**\\n- To correct inaccurate information in a memory\\n- To add tags that were forgotten\\n- To adjust importance based on new understanding\\n- To add metadata after the fact\\n\\n**Examples:**\\n- update_memory({ memory_id: \\\"8f3a2c1e-5b7d-4e9a-a1c3-2d4f6b8e0a91\\\", importance: 0.95 })  // Increase importance\\n- update_memory({ memory_id: \\\"8f3a2c1e-5b7d-4e9a-a1c3-2d4f6b8e0a91\\\", tags: [\\\"project-x\\\", \\\"critical\\\", \\\"auth\\\"] })  // Add tags\\n- update_memory({ memory_id: \\\"8f3a2c1e-5b7d-4e9a-a1c3-2d4f6b8e0a91\\\", content: \\\"Updated: PostgreSQL chosen for ACID + team expertise\\\" })\",\"params\":[\"memory_id\",\"content\",\"tags\",\"importance\",\"metadata\",\"timestamp\",\"t_valid\",\"t_invalid\",\"updated_at\",\"last_accessed\",\"type\",\"confidence\"]},{\"name\":\"delete_memory\",\"description\":\"Delete a memory by ID (`memory_id`) or bulk-delete by tag (`tags`). Use sparingly — consider `update_memory` instead.\\n\\n**Mode 1 — Single (default):** pass `memory_id` to delete one memory and its embedding. Idempotent: re-running on the same ID is a no-op.\\n\\n**Mode 2 — Bulk-by-tag:** pass `tags: [...]` to delete ALL memories tagged with ANY of these tags. Tag matching is exact (case-insensitive), any-of mode. There is NO dry-run. This can delete thousands of memories in one call. NOT idempotent in practice — re-running may catch new memories that were tagged the same way after the first call. Verify with `recall_memory({ tags, exhaustive: true })` first if uncertain.\\n\\n**When to use:**\\n- Memory contains incorrect information that can't be corrected (Mode 1)\\n- Memory is a duplicate (Mode 1)\\n- Cleanup of benchmark/test data scoped by tag (Mode 2)\\n- Removing all memories under a deprecated tag namespace (Mode 2)\\n\\n**Examples:**\\n- delete_memory({ memory_id: \\\"8f3a2c1e-5b7d-4e9a-a1c3-2d4f6b8e0a91\\\" })  // Mode 1\\n- delete_memory({ tags: [\\\"benchmark-test\\\"] })  // Mode 2, bulk by tag\",\"params\":[\"memory_id\",\"tags\"]},{\"name\":\"check_database_health\",\"description\":\"Check the health status of the AutoMem service and its connected databases (FalkorDB graph + Qdrant vectors).\\n\\n**When to use:**\\n- Before a session to verify the memory service is available\\n- When memory operations are failing unexpectedly\\n- To check storage statistics\\n\\n**Example:**\\n- check_database_health({})\",\"params\":[]}],\"toolsHash\":\"ad580341cd112e15a7ddccfa0d62f798c0d37778399e44d2f4393c86a352601b\",\"wrote\":[],\"callsAt\":\"2026-11-16T11:49:34.018Z\",\"calls\":[{\"tool\":\"check_database_health\",\"ok\":true,\"ms\":3516,\"bytes\":75}],\"host\":{\"commit\":\"eaaffffaf52255d1b77dc4aacffdfaf353f0c12c\",\"run\":\"https://github.com/itsHaddad/bragproof/actions/runs/43857070216\"},\"network\":{\"names\":[\"registry.npmjs.org\"],\"conns\":[],\"callNames\":[],\"callConns\":[]}}","token":"eyJhbGciOiJSUzI1NiIsImtpZCI6IjM4ODI2YjE3LTZhMzAtNWY5Yi1iMTY5LThiZWI4MjAyZjcyMyIsInR5cCI6IkpXVCIsIng1dCI6InlrTmFZNHFNX3RhNGsyVGdaT0NFWUxrY1lsQSJ9.eyJhY3RvciI6Iml0c0hhZGRhZCIsImFjdG9yX2lkIjoiMTE0NzMyNjEiLCJhdWQiOiJicmFncHJvb2YtcmVwb3J0OmU5YzA3YzNkMzhkZDBmZjc1YWIxODlkOTU5NmM1YzlmNTNlNWVlMmFhNzBhM2FhNTQ1ODk1OTgwNDA5NTRjNTUiLCJiYXNlX3JlZiI6IiIsImNoZWNrX3J1bl9pZCI6IjEzMzI2Mzk5NTMyNCIsImV2ZW50X25hbWUiOiJzY2hlZHVsZSIsImV4cCI6MTc5NDgzMDA4MywiaGVhZF9yZWYiOiIiLCJpYXQiOjE3OTQ4Mjk3ODMsImlzcyI6Imh0dHBzOi8vdG9rZW4uYWN0aW9ucy5naXRodWJ1c2VyY29udGVudC5jb20iLCJqb2Jfd29ya2Zsb3dfcmVmIjoiaXRzSGFkZGFkL2JyYWdwcm9vZi8uZ2l0aHViL3dvcmtmbG93cy9yZXBvcnQueW1sQHJlZnMvaGVhZHMvbWFpbiIsImpvYl93b3JrZmxvd19zaGEiOiJlYWFmZmZmYWY1MjI1NWQxYjc3ZGM0YWFjZmZkZmFmMzUzZjBjMTJjIiwianRpIjoiZWE1ZmIzMTUtNzIzMi00MDUzLThlNmQtYTRkOTk3ZWJlNDNjIiwibmJmIjoxNzk0ODI5NDgzLCJyZWYiOiJyZWZzL2hlYWRzL21haW4iLCJyZWZfcHJvdGVjdGVkIjoiZmFsc2UiLCJyZWZfdHlwZSI6ImJyYW5jaCIsInJlcG9zaXRvcnkiOiJpdHNIYWRkYWQvYnJhZ3Byb29mIiwicmVwb3NpdG9yeV9pZCI6IjE0NTQ2MjExODMiLCJyZXBvc2l0b3J5X293bmVyIjoiaXRzSGFkZGFkIiwicmVwb3NpdG9yeV9vd25lcl9pZCI6IjExNDczMjYxIiwicmVwb3NpdG9yeV92aXNpYmlsaXR5IjoicHVibGljIiwicnVuX2F0dGVtcHQiOiIxIiwicnVuX2lkIjoiNDM4NTcwNzAyMTYiLCJydW5fbnVtYmVyIjoiMjQiLCJydW5uZXJfZW52aXJvbm1lbnQiOiJnaXRodWItaG9zdGVkIiwic2hhIjoiZWFhZmZmZmFmNTIyNTVkMWI3N2RjNGFhY2ZmZGZhZjM1M2YwYzEyYyIsInN1YiI6InJlcG86aXRzSGFkZGFkQDExNDczMjYxL2JyYWdwcm9vZkAxNDU0NjIxMTgzOnJlZjpyZWZzL2hlYWRzL21haW4iLCJ3b3JrZmxvdyI6InJlcG9ydCIsIndvcmtmbG93X3JlZiI6Iml0c0hhZGRhZC9icmFncHJvb2YvLmdpdGh1Yi93b3JrZmxvd3MvcmVwb3J0LnltbEByZWZzL2hlYWRzL21haW4iLCJ3b3JrZmxvd19zaGEiOiJlYWFmZmZmYWY1MjI1NWQxYjc3ZGM0YWFjZmZkZmFmMzUzZjBjMTJjIn0.ETOPgE_uoJKbS8TFdlkPeSX-69PJtW_JMIDT7_5t7DJz-Af_pgjR03C41EzvmNm28vhdF6oY5-fMs0l9K74Iv6VYRCiZsGbAmRIjnIEzRXw101vtspsei7VJ8trWX9f9sf7yKIbxvoIE9MjC5T4nWVJ8m7hHfilnuWZeqpAZJc_k3XP7jOcLQxuJ9PMcrUaPlkgSS4TKEE9H-c83xxz9GxUnT1VCAEk9FiyaNYtntW9YPbrLYVZZeDiaYRrG86BkpJidKFa1lJYtoZS5ZVrelsDuYkTgvkMoaTqJlTD0bFWoyYibkEHJsC-RsjiLSC2WNr7BOll9gNAQNVtPRXUW0Q"}