Kuzu Memory banner
bobmatnyc bobmatnyc

Kuzu Memory

AI community

Description

Lightweight, embedded graph-based memory system for AI applications. Fast (<3ms recall), offline-first, with MCP server support for Claude and other AI tools.

Installation

This entry records only its repository, not the path inside it, so there is no exact command to give. Open the source below and copy the folder into ~/.claude/skills/, or the file into ~/.claude/agents/.

README

KuzuMemory

[![Python 3.11+](https://img.shields.io/badge/python-3.11+-blue.svg)](https://www.python.org/downloads/) [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT) [![Tests](https://github.com/kuzu-memory/kuzu-memory/workflows/Tests/badge.svg)](https://github.com/kuzu-memory/kuzu-memory/actions)

**Lightweight, embedded graph-based memory system for AI applications**

KuzuMemory provides fast, offline memory capabilities for chatbots and AI systems without requiring LLM calls. It uses pattern matching and local graph storage to remember and recall contextual information.

✨ Key Features

  • 🧠 Cognitive Memory Model - Based on human memory psychology (SEMANTIC, PROCEDURAL, EPISODIC, etc.)
  • πŸš€ No LLM Dependencies - Operates using pattern matching and local NER only
  • ⚑ Fast Performance - <3ms memory recall, <8ms memory generation (verified with Kuzu)
  • πŸ’Ύ Embedded Database - Single-file Kuzu graph database
  • πŸ”„ Git-Friendly - Database files <10MB, perfect for version control
  • πŸ”Œ Simple API - Just two methods: attach_memories() and generate_memories()
  • 🌐 Cross-Platform - Standardized cognitive types shared with TypeScript implementation
  • πŸ“± Offline First - Works completely without internet connection
  • πŸ”§ MCP Ready - Native Claude Desktop integration with async learning support
  • πŸ€– Hook System - Automatic Claude Code integration using hooks (UserPromptSubmit, Stop)
  • πŸ‘€ User-Level Memory - Cross-project ~/.kuzu-memory/user.db automatically aggregates your best patterns and rules across all projects
  • ⚑ HNSW Vector Search β€” KΓΉzu-native approximate nearest-neighbour index (O(log N)) replaces brute-force NumPy cosine scan; embeddings stored at ingestion time
  • πŸ”€ TF-IDF Keyword Boost β€” multiplicative scoring: final_score = semantic_score Γ— (1 + weight Γ— normalized_tfidf), configurable via KUZU_MEMORY_TFIDF_BOOST_WEIGHT
  • **πŸ•ΈοΈ Graph Enr