Analysis updated 2026-05-18
Cut token usage when Claude Code or Codex explores a large, unfamiliar codebase.
Search a codebase by describing what a function does instead of grepping for exact text.
Jump straight to a function's full source instead of reading entire files to find it.
Set up a local, offline code search index that needs no external API key.
| masihmoloodian/sema | 0c33/agentic-ai | adennng/stock_strategy_lab | |
|---|---|---|---|
| Stars | 14 | 14 | 14 |
| Language | Python | Python | Python |
| Setup difficulty | moderate | hard | hard |
| Complexity | 3/5 | 4/5 | 4/5 |
| Audience | developer | developer | researcher |
Figures from each repo's GitHub metadata at analysis time.
Requires running a local indexing step and connecting an MCP server to Claude Code or Codex.
Sema is a tool that helps AI coding assistants like Claude Code and OpenAI Codex work faster and cheaper on large codebases. Normally, when one of these assistants starts a new session, it has no memory of the project, so it explores by running commands like find and reading whole files one at a time just to understand what exists. That process burns a large number of tokens before the assistant can even start helping with the actual task. Sema fixes this by building a local search index of the entire codebase ahead of time. It scans every function, class, method, and interface, breaks them into chunks, and stores each one alongside a numerical representation of its meaning, created locally on the user's own machine without needing an API key. This index is then exposed to Claude Code or Codex through something called an MCP server, which lets the assistant search for relevant code by describing what it needs in plain language, then pull the full body of just the matching function, instead of reading entire files. The README backs this up with side by side comparisons on real open source projects. In one example, answering a question about how a login feature works took six tool calls and about 6,475 tokens without sema, versus three tool calls and 837 tokens with it, roughly an eight times reduction. A second example on a Python project shows a similar drop, again because the assistant can jump straight to the relevant function instead of reading a large file in full to find it. The project works with Claude Code on the command line and in VS Code, and with OpenAI Codex in the same two forms. It is explicitly labeled as experimental, meaning its APIs and the format of its index may still change between versions. It stores the index locally in a hidden folder that is meant to be excluded from version control. This tool is aimed at developers who already use AI coding assistants on medium to large codebases and want to cut down the setup cost of every new session. The full README is longer than what was shown.
A local code search index and MCP server that helps AI coding assistants like Claude Code and Codex find relevant code without reading whole files.
Mainly Python. The stack also includes Python, Tree-sitter, SBERT.
The README mentions a License section but does not state the specific terms in the visible text.
Setup difficulty is rated moderate, with roughly 30min to a first successful run.
Mainly developer.
This repo across BitVibe Labs
Verify against the repo before relying on details.