Why does Cursor use a Merkle tree to keep the index synchronized instead of just re-scanning changed files?
A Merkle tree lets the client and server each maintain a hash of their view of the project's file state, structured so that comparing two trees quickly identifies exactly which subset of files differ, without transmitting or hashing every file's full content on every check. This makes periodic sync cheap even on large codebases — the comparison cost scales with what actually changed, not with total project size.
Answered in
How Cursor Indexes Your Entire Codebase Without Ever Storing Your CodeCursor's semantic search runs on embeddings, not source. The server never persists a line, and a Merkle tree keeps the index in sync as you type.
Read the full analysisOther questions this article answers
- How can Cursor answer questions about an entire codebase without storing the code?
- If embeddings are stored instead of source code, can the original code be reconstructed from them?
- What happens when the server needs the actual source code, not just its embedding?
- Why encrypt code locally before sending it, if the connection to the server is already secure?
More how ai actually works questions
- How many new researchers can receive the next OpenAI grant?
- When do applications open?
- Does the classifier make a final decision about an image?
- Can any developer call the classifier?
- How can Cursor answer questions about an entire codebase without storing the code?
- If embeddings are stored instead of source code, can the original code be reconstructed from them?
- What happens when the server needs the actual source code, not just its embedding?
- Why encrypt code locally before sending it, if the connection to the server is already secure?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the How AI Actually Works beat.