io.github.raskolnikovdd/adaptive-memory-graph

MCPcommunity
v1.1.1io.github.raskolnikovddUnknownUpdated 3mo agoGitHub

Persistent memory for Claude via weighted, interconnected knowledge nodes.

An MCP server plugin that gives Claude persistent, intelligent memory across sessions. It stores knowledge as weighted, interconnected nodes in a graph that evolves through conversation — nodes that get used gain weight, unused ones decay and eventually archive. Works with Claude Code and Claude Desktop. Weighted memory nodes — Important memories stay prominent; stale ones fade Cross-domain…

Automatically indexed from public sources. Not yet verified by the developer on Forge.Claim this listing →
3mo agoLast update
Package
Authorio.github.raskolnikovdd
LicenseUnknown
Version1.1.1
Sourcemcp-registry
GitHubraskolnikovdd/adaptive-memory-graph.git
Trust Status
B
60/100Good
✓Listed in Forge index+10/10
—Publisher identity verified+0/25
→ Publisher: run `forge publish` from the package repo to claim ownership
—Ed25519 publish signature+0/10
→ Included automatically when the publisher runs `forge publish`
—Domain verification+0/5
→ Publisher: host /.well-known/forge.json on the package homepage with { "publisher": "<github-login>" }
✓CVE scan · clean+30/30
✓Static analysis · clean+20/20
—npm provenance (Sigstore)+0/5
→ Publish from GitHub Actions with the --provenance flag
Paste into Claude Code, Cursor, or any AI assistant to fix all gaps
StatusCommunity-indexed
PublisherUnverified
SignatureUnsigned
Domain—
Provenance—
DependenciesNot audited
Tool surface—
Security scan✓ Cleanv1.1.1 · 19d ago
EvalsNone
IndexedJun 13, 2026

Verification confirms publisher identity (repo ownership), not code safety. The security scan covers known CVEs and suspicious install scripts — it cannot prove the absence of malicious code.

About

An MCP server plugin that gives Claude persistent, intelligent memory across sessions. It stores knowledge as weighted, interconnected nodes in a graph that evolves through conversation — nodes that get used gain weight, unused ones decay and eventually archive. Works with Claude Code and Claude Desktop. Weighted memory nodes — Important memories stay prominent; stale ones fade Cross-domain connections — Link related knowledge across topics Time-based decay — Graph self-prunes so only relevant…

Keywords
mcp