An agent writes memories as ordinary files with typed attributes; a native kernel layer validates and indexes them over a mature filesystem; any program reads them back and queries them by attribute. Pick a milestone to see which parts exist at that point.
Green boxes are implemented and tested in an isolated Linux VM (one kernel series; ext4, btrfs and XFS): the frozen M1 experiment, the M2 layer (phases 2a–2e) and the POSIX authorization of QUERY (M3 phase 3b), as recorded in the roadmap. White boxes are proposals from ADR-0005, ADR-0007 and the M3 specification; nothing is measured yet (M4) and nothing has been released.
Input
→
Processing · moobfs layer
→
Output
Implemented and tested in a VM Proposed, not implemented
Select a box to read what it does and which reference it follows.
The path of one memory, as implemented today
Left: writing a memory. Right: finding and reading it back. Both meet in the in-memory index of the layer, which is fed by the real extended attributes stored in the lower filesystem; each query result is authorized with the caller's credentials before it is returned. Source citations for every step: architecture overview.
How to read the plan
The middle column is where MoobFS exists. Input and output are contracts with the outside world; the project's contribution is what happens inside the kernel between them.
Nothing mature is rebuilt. Blocks, journaling, reflink and snapshots come from the lower filesystem; git keeps versioning content. The layer is only the memory-specific part (ADR-0007).
M4 closes the loop without kernel code. Semantic retrieval and context assembly stay in the agent application, as decided in ADR-0005.
Free software already covers several steps: dm-log-writes and xfstests for crash testing, virtme-ng for instrumented kernels, Haiku's bfs_shell as a behavioral oracle for queries. See the ecosystem survey.