VecGrep
Allows using Google Gemini embeddings for code search via the gemini-embedding-exp-03-07 model.
Allows using OpenAI embeddings for code search, providing higher-quality semantic search via the text-embedding-3-small model.
Click on "Deploy Server".
Wait a few minutes for the server to deploy. Once ready, it will show a "Started" state.
In the chat, type
@followed by the MCP server name and your instructions, e.g., "@VecGrepSearch for how authentication is handled in my project"
That's it! The server will respond to your query, and you can continue using it as needed.
Here is a step-by-step guide with screenshots.
VecGrep
Cursor-style semantic code search as an MCP plugin for Claude Code.
Instead of grepping 50 files and sending 30,000 tokens to Claude, VecGrep returns the top 8 semantically relevant code chunks (~1,600 tokens). That's a ~95% token reduction for codebase queries.
Benchmarks
Measured on the VecGrep codebase itself (5 source files, ~26k tokens raw).
Token usage per query
Mode | Avg tokens returned | vs raw read | Savings |
Raw file read (baseline) | 26,009 | — | — |
| ~3,007 | 11.6% | 88% |
| ~3,324 | 12.8% | 87% |
| ~47 | 0.2% | >99% |
search_graph returns structured node metadata only (name, kind, file, line range) — no source code — so it's ultra-cheap for structural questions ("where is X defined?", "what calls Y?").
Query latency (median, 5 runs)
Mode | Latency |
| ~3ms |
| ~76ms |
| ~83ms |
search_graph is ~30× faster than vector search — pure in-memory graph traversal, no embedding model call.
Result correctness (structural queries)
For name-based structural queries, pure vector search can rank documentation (CHANGELOG, README) above source code. The graph index fixes this:
Query |
|
|
"VectorStore search method" | [WRONG] CHANGELOG.md | [OK] store.py |
"GraphStore build" | [WRONG] CHANGELOG.md | [OK] server.py |
"embedding provider factory" | [OK] embedder.py | [OK] embedder.py |
"AST chunking tree-sitter" | [OK] chunker.py | [OK] chunker.py |
The graph score (graph_score: 1.00) overrides a misleading vector match whenever the query directly names a known symbol.
Rule of thumb: use
search_codefor semantic/behaviour queries,search_graphfor structural/navigation queries,hybrid_searchwhen you need both.
Related MCP server: mcplens
How it works
Chunk — Parses source files with tree-sitter to extract semantic units (functions, classes, methods)
Embed — Encodes each chunk using the configured embedding provider:
Local (default) —
all-MiniLM-L6-v2-code-search-512via fastembed ONNX (~100ms startup, no API key) or PyTorch, with auto device detection (Apple Silicon, CUDA, CPU)Cloud (BYOK) — OpenAI, Voyage AI, or Google Gemini via your own API key (higher-quality embeddings, optional)
Store — Saves embeddings + metadata in LanceDB under
~/.vecgrep/<project_hash>/; vector dimensions adapt automatically to the chosen providerSearch — ANN index (IVF-PQ) for fast approximate search on large codebases
Incremental re-indexing via mtime/size checks skips unchanged files.
Architecture
Installation
Requires Python 3.12 and uv.
Note: Python 3.12 is required —
tree-sitter-languagesdoes not yet have wheels for Python 3.13+.
pip install vecgrep # standard pip
uv tool install --python 3.12 vecgrep # uv tool (recommended)Claude Code integration
Run once — works for every project:
claude mcp add --scope user vecgrep -- vecgrepThis installs VecGrep as a persistent binary and registers it in your user config (~/.claude.json) so it's available globally across all projects. Starts instantly — no download delay on Claude Code launch.
Usage with Claude
You don't trigger VecGrep manually - Claude decides when to call the tools based on what you ask.
What you say to Claude | Tool invoked |
"Index my project at /Users/me/myapp" |
|
"How does authentication work in this codebase?" |
|
"Find where database connections are set up" |
|
"How many files are indexed?" |
|
"Build a knowledge graph of my project" |
|
"What calls the VectorStore.search method?" |
|
"Find code structurally related to authentication" |
|
Typical first-time flow:
You: "Search for how payments are handled in /Users/me/myapp"
Claude: [calls index_codebase automatically since no index exists]
Claude: [calls search_code with your query]
Claude: "Here's how payments work — in src/payments.py:42..."After the first index, subsequent searches skip unchanged files automatically — no re-indexing needed unless your code changes.
Tools
index_codebase(path, force=False, watch=False, provider=None)
Index a project directory. Skips unchanged files on subsequent calls.
index_codebase("/path/to/myproject")
# → "Indexed 142 file(s), 1847 chunk(s) added (0 file(s) skipped, unchanged)"
# Use OpenAI embeddings instead of local
index_codebase("/path/to/myproject", provider="openai")Provider lock: once a project is indexed with a provider, re-indexing with a different provider requires force=True (this rebuilds the vector table with the new embedding dimensions).
Note: watch=True is only supported with the local provider — live sync with cloud providers would incur unbounded API costs.
search_code(query, path, top_k=8)
Semantic search. Auto-indexes if no index exists.
search_code("how does user authentication work", "/path/to/myproject")Returns formatted snippets with file paths, line numbers, and similarity scores:
[1] src/auth.py:45-72 (score: 0.87)
def authenticate_user(token: str) -> User:
...
[2] src/middleware.py:12-28 (score: 0.81)
...get_index_status(path)
Check index statistics, including the embedding provider used.
Index status for: /path/to/myproject
Files indexed: 142
Total chunks: 1847
Last indexed: 2026-02-22T07:20:31+00:00
Index size: 28.4 MB
Provider: local
Model: isuruwijesiri/all-MiniLM-L6-v2-code-search-512
Dimensions: 384index_graph(path, force=False)
Build a structural knowledge graph from the codebase using tree-sitter AST extraction. No LLM required — extracts files, functions, classes, and methods as nodes; contains, calls, imports, and inherits as directed edges. Independent of the vector index.
index_graph("/path/to/myproject")
# → "Graph built: 496 nodes, 1251 edges, 35 files processed."search_graph(query, path, limit=20)
Keyword search over node labels (function names, class names, file names). Returns structural nodes with source location and connectivity degree. Ultra-cheap: ~47 tokens average, ~3ms latency.
search_graph("VectorStore", "/path/to/myproject")
# → [1] CLASS VectorStore (score: 1.00, degree: 39)
# src/vecgrep/store.py:49-352graph_neighbors(node_id, path, depth=1)
Return the structural neighbourhood of any node — callers, callees, imports, contained methods, and inheritance edges. Use search_graph first to find the node ID.
graph_neighbors("VectorStore", "/path/to/myproject", depth=1)
# → Callers (18): _get_store, migrate_project, test fixtures...
# Contains (18): search, add_chunks, replace_file_chunks...hybrid_search(query, path, top_k=8, alpha=0.6, min_score=0.0)
Vector similarity search re-ranked by graph proximity. Final score = alpha * vector_score + (1 - alpha) * graph_score. Fixes cases where documentation ranks above source code on pure embedding similarity.
hybrid_search("VectorStore search method", "/path/to/myproject", alpha=0.6)
# → [1] src/vecgrep/store.py:292-320 (blended: 0.70, vec: 0.49, graph: 1.00)Requires both index_codebase and index_graph to have been run. Degrades gracefully to pure vector search if the graph index is absent.
Configuration
VecGrep can be tuned via environment variables:
Local provider
Variable | Default | Description |
|
| Local backend: |
|
| HuggingFace model ID (local provider only) |
Backend comparison:
Backend | Startup | PyTorch required | Custom HF models |
| ~100ms | No | ONNX-exported models only |
| ~2–3s | Yes | Any HuggingFace model |
Cloud providers (BYOK — Bring Your Own Key)
VecGrep supports three cloud embedding providers. Each requires an API key environment variable and the corresponding optional dependency.
Provider | Env var | Model | Dims | Install extra |
|
|
| 1536 |
|
|
|
| 1024 |
|
|
|
| 3072 |
|
Install cloud extras:
# Single provider
uv tool install --python 3.12 'vecgrep[openai]'
pip install 'vecgrep[openai]'
# All cloud providers at once
pip install 'vecgrep[cloud]'Use a cloud provider:
# Set your API key
export VECGREP_OPENAI_KEY=sk-...
# Index with OpenAI embeddings
index_codebase("/path/to/myproject", provider="openai")
# Or tell Claude to use it:
# "Index my project at /path/to/myproject using openai embeddings"Switch providers (requires force re-index to rebuild the vector table):
index_codebase("/path/to/myproject", provider="voyage", force=True)Local backend examples:
# Use a different model with the torch backend
VECGREP_BACKEND=torch VECGREP_MODEL=sentence-transformers/all-MiniLM-L6-v2 vecgrep
# Use a custom ONNX model
VECGREP_MODEL=my-org/my-onnx-model vecgrepSupported languages
Python, JavaScript/TypeScript, Rust, Go, Java, C/C++, Ruby, Swift, Kotlin, C#
All other text files fall back to sliding-window line chunks.
Index location
~/.vecgrep/<sha256-of-project-path>/index.db
Each project gets its own isolated index. Delete the directory to wipe the index.
Acknowledgements
The embedding model used by VecGrep is all-MiniLM-L6-v2-code-search-512, a model fine-tuned specifically for semantic code search by @isuruwijesiri.
@misc{all_MiniLM_L6_v2_code_search_512,
author = {isuruwijesiri},
title = {all-MiniLM-L6-v2-code-search-512},
year = {2026},
publisher = {Hugging Face},
url = {https://huggingface.co/isuruwijesiri/all-MiniLM-L6-v2-code-search-512}
}Community
? Questions | |
+ Ideas | |
> Show & Tell | |
! Bugs |
Available Tools
8 toolsget_index_statusA
Get the status of the vector index for a codebase.
Args:
path: Absolute path to the codebase root directory.
Returns:
Index statistics: file count, chunk count, last indexed time, disk usage.
Inputs: path (required). Returns: result
graph_neighborsA
Return structural neighbors of a graph node.
Shows which functions call this node, which it calls, what it imports,
what it contains, and what it inherits from — up to *depth* hops away.
Use search_graph first to find the exact node ID.
Args:
node_id: Node ID or label substring (e.g. "vectorstore_search" or "search").
path: Absolute path to the codebase root directory.
depth: Number of hops to traverse (1 = direct edges only, default 1).
Returns:
Categorised list of neighboring nodes with their source locations.
Inputs: path (required), node_id (required), depth. Returns: result
hybrid_searchA
Semantic vector search re-ranked by knowledge graph proximity.
Combines vector similarity (cosine) with structural graph proximity
(BFS distance from query-matched graph nodes). The final score is:
score = alpha * vector_score + (1 - alpha) * graph_score
Both vector and graph scores are normalised to [0, 1] before blending.
Requires both index_codebase and index_graph to have been run.
Args:
query: Natural language description of what you're looking for.
path: Absolute path to the codebase root directory.
top_k: Number of results to return (default 8, max 20).
alpha: Weight of vector score vs graph score (0.0 = graph only,
1.0 = vector only, default 0.6).
min_score: Minimum blended score threshold (default 0.0).
Returns:
Formatted list of code chunks ranked by blended score.
Inputs: path (required), query (required), alpha, top_k, +1 more. Returns: result
index_codebaseA
Index a codebase directory for semantic search.
Walks the directory, extracts semantic code chunks using AST analysis,
embeds them locally with sentence-transformers, and stores in a vector index.
Subsequent calls skip unchanged files (incremental updates).
Args:
path: Absolute path to the codebase root directory.
force: If True, re-index all files even if unchanged.
watch: If True, start a background watcher for live sync on file changes.
Not supported with cloud providers (openai, voyage, gemini).
provider: Embedding provider to use. One of: 'local' (default), 'openai',
'voyage', 'gemini'. Cloud providers require the corresponding
env var (VECGREP_OPENAI_KEY, VECGREP_VOYAGE_KEY, VECGREP_GEMINI_KEY)
and optional dependency (pip install 'vecgrep[openai]' etc.).
Once set, switching providers requires force=True to rebuild the index.
Returns:
Summary: files indexed, chunks added, files skipped.
Inputs: path (required), force, watch, provider. Returns: result
index_graphA
Build (or rebuild) a knowledge graph for a codebase.
Walks the directory using the same skip rules as index_codebase, extracts
structural nodes (files, functions, classes) and edges (contains, calls,
imports, inherits) using tree-sitter, and persists the graph to disk.
This is independent of the vector index — you can run index_graph before
or after index_codebase.
Args:
path: Absolute path to the codebase root directory.
force: If True, rebuild the graph even if one already exists.
Returns:
Summary: node count, edge count, files processed.
Inputs: path (required), force. Returns: result
search_codeA
Semantically search an indexed codebase for code relevant to a query.
Embeds the query and performs cosine similarity search against indexed
code chunks, returning the most semantically relevant snippets with
file paths and line numbers.
If the codebase is not yet indexed, it will be indexed automatically first.
Args:
query: Natural language description of what you're looking for.
E.g. "how does authentication work", "database connection setup"
path: Absolute path to the codebase root directory.
top_k: Number of results to return (default 8, max 20).
min_score: Minimum cosine similarity score to include a result (default 0.35).
Results below this threshold are filtered out as noise. Set to 0.0
to disable filtering.
Returns:
Formatted list of matching code chunks with file:line references and
similarity scores.
Inputs: path (required), query (required), top_k, min_score. Returns: result
search_graphA
Search the knowledge graph for nodes matching a query.
Performs keyword matching over node labels (function names, class names,
file names) and returns the most relevant structural nodes with their
source locations and relationship degree.
The codebase graph must be built first with index_graph.
Args:
query: Keywords to search for (e.g. "VectorStore", "auth login").
path: Absolute path to the codebase root directory.
limit: Maximum number of results to return (default 20).
Returns:
Matching nodes with kind, source location, and connectivity degree.
Inputs: path (required), query (required), limit. Returns: result
stop_watchingC
Stop watching a codebase for file changes.
Inputs: path (required). Returns: result
Tool Schema Changelog
Recent tool additions, removals, and schema changes observed during successful MCP inspections.
TDQS
Scored across 8 tools
Most tools have clear, distinct purposes: indexing vs searching, vector vs graph vs hybrid. The main ambiguity is between search_code and hybrid_search, since hybrid_search with alpha=1.0 is effectively the same as vector semantic search.
Several tools follow a verb_noun pattern (index_graph, index_codebase, search_graph, search_code), but graph_neighbors and hybrid_search deviate by using noun/adjective phrases, and stop_watching uses a gerund instead of a plain verb. The mixed style is readable but not fully consistent.
8 tools is well-scoped for a code search and indexing server. Each tool covers a distinct capability without unnecessary duplication or bloat.
Core lifecycle coverage is solid: indexing, searching, graph traversal, hybrid search, status, and watching. Minor gaps exist, such as no explicit delete/remove index tool and no graph-specific status endpoint, but agents can work around these using force reindexing.
Maintenance
Related MCP Connectors
An MCP server that gives your AI access to the source code and docs of all public github repos
Capability registry for the agentic economy. Semantic search over verified MCP server listings.
Search your AI chat history (ChatGPT, Claude, Codex) from any MCP client. Remote, private, read-only
Related MCP Servers
- AlicenseNot gradedqualityDmaintenanceAn MCP server for semantic code search & navigation that helps AI agents work efficiently without burning through costly tokens. Instead of reading entire files, agents can search conceptually and jump directly to the specific functions, classes, and code chunks they need.120MIT
- AlicenseNot gradedqualityBmaintenanceA local MCP server that provides AI coding assistants with semantic search capabilities over codebases. It indexes code using local embeddings and exposes tools for efficient code retrieval, saving tokens and improving response quality.31 npm4MIT
- AlicenseAqualityDmaintenanceLocal-first MCP server for semantic + keyword hybrid code search. Zero external services, no API keys required.2MIT
- AlicenseAqualityBmaintenanceMCP server for semantic code search with AST-aware chunking, hybrid vectors, and query syntax.121Apache 2.0