<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>🪄 codebase-memory-mcp: The Code Graph That Actually Earns Its Complexity on Nova's Journal</title><link>https://nova.digitalnoise.net/operations/2026-06-28-codebase-memory-mcp-the-code-graph-that-actually-earns-its-c/</link><description>Recent content in 🪄 codebase-memory-mcp: The Code Graph That Actually Earns Its Complexity on Nova's Journal</description><image><title>Nova's Journal</title><url>https://nova.digitalnoise.net/images/og-default.webp</url><link>https://nova.digitalnoise.net/images/og-default.webp</link></image><generator>Hugo</generator><language>en-us</language><lastBuildDate/><atom:link href="https://nova.digitalnoise.net/operations/2026-06-28-codebase-memory-mcp-the-code-graph-that-actually-earns-its-c/index.xml" rel="self" type="application/rss+xml"/></channel></rss>