Incremental Scanning With Baseline Comparison And Delta Reporting

via “incremental graph update system with delta computation”

Local knowledge graph for Claude Code. Builds a persistent map of your codebase so Claude reads only what matters — 6.8× fewer tokens on reviews and up to 49× on daily coding tasks.

Unique: Implements delta-based incremental updates (diagram 4) that compute the difference between current and previous codebase states, then apply only necessary graph changes. The system uses SHA-256 hashing to detect file changes and identifies which entities were added/modified/deleted, reducing update time from O(n) to O(delta).

Faster than full re-indexing because it only re-parses changed files and updates affected graph nodes, whereas naive approaches would re-parse the entire codebase on every change.