Measured performance data from production use on a 5000-node codebase graph. m1nd does not replace search. It focuses search.
m1nd reduces context token consumption by focusing agent attention on relevant code before it reads files. Instead of grepping everything and dumping results into context, agents query the graph first.
All queries complete in under 100ms. The graph lives in memory -- no disk I/O on the hot path.
The entire graph lives in memory for instant access. Rust's zero-cost abstractions keep the footprint minimal even for large codebases.
| Graph Size | Nodes | Edges | RAM | Load Time |
|---|---|---|---|---|
| Small project | 500 | 1,200 | ~8 MB | <200ms |
| Medium project | 2,000 | 5,000 | ~25 MB | <800ms |
| Large project | 5,000 | 12,000 | ~50 MB | <2s |
| Monorepo | 15,000 | 40,000 | ~150 MB | <5s |
| Enterprise | 50,000 | 120,000 | ~500 MB | <15s |
The savings come from precision, not replacement. Here is the mechanism.