The article introduces WikiMoth, a memory retrieval tool built on the principle that retrieval should be code rather than a black-box model. It processes folders of markdown notes with wikilinks to provide deterministic results without using vector databases or GPU resources.

  • Achieves 1.00 recall@8 on direct lookup while supporting multi-hop traversal across authored links.
  • Requires zero LLM calls during retrieval, ensuring the same query always produces the same note-chain.
  • Provides an auditable trail of which notes produced the answer, stored in plain markdown.
  • Includes an MCP server for agent integration and deterministic auto-capture without conflicts or duplicates.

The authors argue that this approach offers dependable production memory by guaranteeing reproducibility and auditability, contrasting it with non-deterministic alternatives like claude-mem or Karpathy's LLM Wiki.