Back to directory

M-flow

A bio-inspired cognitive memory engine that scores retrieval by the strongest chain of reasoning connecting a query to an answer, instead of ranking by vector similarity or a static knowledge graph.

M-flow

M-flow is a Graph RAG system where the graph itself acts as the scoring engine rather than a supporting structure: a query first casts a wide net through vector search to find entry points, and the graph then propagates evidence along typed, semantically weighted edges, scoring each knowledge unit by the strongest chain of reasoning that connects it back to the query.

It distinguishes similarity, proximity in representation space, from relevance, whether the system can trace a coherent chain of evidence from query to answer, and stores knowledge in a four-layer cone graph of episode, facet, facet-point and entity, so a query lands on whichever layer matches its granularity. An accompanying OpenClaw skill lets the engine be used from that agent directly.

More in Agent memory

See all 450
  • A long technical guide to AI agent memory: why stateless LLMs need it, the different memory architectures from vector stores to knowledge graphs, and how Cognee implements one as an open-source memory layer.

  • A local, file-based long-term memory layer for a personal AI that never summarizes conversations, keeping every line with a timestamp and searching by time first and words second, rather than retrieving only similar-seeming chunks.

  • NEOTH

    deepwiki.com

    A local-first personal AI daemon in Rust with five memory tiers, consent-gated tools, a WASM plugin sandbox, multi-provider model routing and signed audit logs, aimed at people who want both a daily assistant and a serious coding helper.