Priyanshu Roy

Thanks Mateo! Completely agree that retrieval overhead is where most latency and token burn happen on larger projects. Testing incremental re-indexing on large codebases is high on my list. Spelunk tracks mtimes and file hashes in SQLite, so rescans only re-parse modified files instead of running full passes. Combining AST indexing with RAG or embeddings is a great idea. AST gives exact symbol resolution while RAG handles semantic search. I'm focusing on Amar right now, but I've noted this down for when I get back to Spelunk features. If you have thoughts on how that hybrid setup should work, feel free to open a GitHub issue.

Thanks Kartik. Stale index invalidation was the exact issue that broke my earlier manual workarounds. Spelunk handles disk changes by checking mtimes and diffing the AST on call time, while the agent keeps its own active session edits in working memory. Together, those cover most stale read scenarios. Good point to bring up.