Fair. The differentiator is the Rust single binary + petgraph knowledge graph. No Python runtime, no cloud, survives restarts. Built it because nothing local fit that profile.
Fair. The differentiator is the Rust single binary + petgraph knowledge graph. No Python runtime, no cloud, survives restarts. Built it because nothing local fit that profile.
I rolled the same thing in Go months ago as I am sure at least another 1000 people have in their own way.
Would genuinely be interested to see it. link? The graph traversal approach seems underexplored compared to pure vector search.