Boundary tax
Modern workloads scan dense columns, walk relationships, compare embeddings, derive facts, update indexes, and write state back. The usual answer is a relational database, graph database, vector database, queue/log, and application glue.
One substrate
FFS puts typed records, relationship tables, embedding indexes, provenance, MVCC, WAL, and recovery on one storage substrate instead of separate services with duplicated caches.
One commit
Graph updates, vector updates, typed facts, derived state, and provenance links should commit or fail together. That is why the project keeps one WAL and one transaction boundary.
Measured first
The repo keeps an eval harness for both faster and slower paths. The point is not one heroic number; it is a repeatable map of where the engine shape removes stack overhead.