We tried vectors, ASTs, and brute-force context stuffing for code retrieval; LLM semantic graphs worked best
We tried vectors, ASTs, and brute-force context stuffing for code retrieval. Graphs with LLM-generated semantics worked best. Here's what we learned.
ByteBell open-sourced a code indexing system that stores per-file LLM-generated purpose, summary, business context, entities, classes, functions, keywords, and imports in a Neo4j graph, then uses full-text search instead of vector similarity, with SHA-256 diffing to reindex only changed files and keep LLM calls proportional to churn.
Why it matters: ByteBell open-sourced its code index after testing vectors, ASTs and raw context stuffing, and landed on LLM-written semantics in a Neo4j graph queried by full-text search.