The SQLite comparison is the right framing. The embedded graph DB space has been missing something you can just drop into a process without ops overhead — Neo4j is great until you're building a CLI or serverless function and don't want to provision a server for it. The 27ms cold start is compelling for serverless. Curious how the traversal performance scales with graph size — is the lag on 1-hop/2-hop paths a fundamental architecture constraint or something you expect to close with query planner work?