Persistent Memory State Management With Decay Tracking

via “persistent-memory state management with decay tracking”

Send voice notes to Telegram → get organized knowledge base, tasks in Todoist, and daily reports. Persistent memory with Ebbinghaus decay, vault health scoring, knowledge graph. Runs on Claude Code + OpenClaw. 5/mo.

Unique: Integrates decay tracking directly into the persistence layer, making review history a first-class concern rather than an afterthought. Enables time-series analysis of knowledge evolution.

vs others: More reliable than in-memory state because it survives crashes; more transparent than cloud-only storage because users own their data locally.

via “biological decay-based memory forgetting”

Most RAG setups fail because they treat memory like a static filing cabinet. When every transient bug fix or abandoned rule is stored forever, the context window eventually chokes on noise, spiking token costs and degrading the agent's reasoning.This implementation experiments with a biological

Unique: Uses biological forgetting curves (Ebbinghaus decay model) to probabilistically fade memories over time based on recency and frequency, rather than fixed TTL or LRU eviction. Decay is parameterized and continuous, not discrete, allowing smooth degradation of memory confidence.

vs others: More cognitively plausible than simple vector DB retrieval + fixed context windows; enables natural forgetting without explicit memory management, but trades determinism and recall accuracy (52%) for more human-like behavior.

via “memory expiration and lifecycle management”

Core library for membank — handles storage, embeddings, deduplication, and semantic search.

Unique: Treats memory expiration as a configurable policy rather than manual cleanup, enabling automatic lifecycle management without application intervention. Supports archival as a first-class operation, preserving expired memories for compliance.

vs others: More automated than manual memory cleanup because policies run automatically, whereas typical applications require explicit deletion logic scattered throughout the codebase.

via “memory lifecycle management with temporal tracking”

Domain-driven memory engine with graph storage, embeddings, and semantic search

Unique: Integrates temporal tracking as a domain concern rather than a storage concern, allowing domain aggregates to define custom decay functions and lifecycle policies that are independent of the storage backend

vs others: More flexible than TTL-based expiration (Redis, DynamoDB) because it supports custom decay functions and lifecycle hooks; simpler than time-series databases (InfluxDB, TimescaleDB) for memory-specific workloads