No cloud.
Files never leave your PC.
Just ask.
Any file. Under a second.
No cloud.
Files never leave your PC.
Just ask. Any file. Under a second.
Don’t have an AI? Use it yourself.
Already have one? Connect it.
We started from zero. Benchmarked every modern search algorithm we could find, then rewrote the fastest ones from scratch: 50,000 lines, compiled to a native binary. No interpreter, no framework, no network: nothing stands between your question and the answer but the machine itself. That’s what milliseconds cost to build.
You’re meeting the Henderson team at 9 tomorrow.
Three years of proposals, contracts, invoices, and exported email threads across four folders. No file is named “Henderson”. The word lives inside them: PDFs, plain text, code.
Opening folders, file by file, until 11 p.m.
Type the name once. The match is inside the files: PDFs, Office docs, exports.
One call · the round trip
It doesn’t just find the file. It hands back what moves with it.
Interlinked maps every file on the machine and how they connect. Your agent makes one MCP call and gets the ranked files and their relationships back: which files change together, what ships with what, plus any notes left on them.
The full loop
search: meridianScattered across the machine (some never even named for the deal), assembled and explained in one ask.
The expensive part isn’t the fix:
it’s finding what to fix.
Your AI assistant burns 71 tool calls searching for a single file. Interlinked gives it the answer in one call. Zero waste.
Two ways an AI fails on your files.
Interlinked kills both.
Without it, your agent either burns minutes grinding through tool calls, or invents a wrong answer and hands it back with confidence. You pay tokens either way. Interlinked gives the agent the real file in one call, every time.
And the cost isn’t only time and tokens. Every wasted call packs the context with search noise, so by the time the agent finally has the file it has less room and less attention left for the thing you actually asked. Cut the hunt and you don’t just pay less: the answer gets better.
See it for real · same query, same machine
We started from zero. Benchmarked every modern search algorithm we could find, then rewrote the fastest ones from scratch: 50,000 lines, compiled to a native binary. No interpreter, no framework, no network: nothing stands between your question and the answer but the machine itself. That’s what milliseconds cost to build.
One background process. Every tool reads the same index. No per-tool setup.
claude mcp add interlinked -- interlinked-mcp+ 7 more, auto-registered by the installer
One engine. Four ways in.
Desktop, CLI, MCP, or the raw pipe: the same index answers them all. And every operator composes freely in a single query.
Median find-by-name latency · same index behind all four
“The big videos I saved this month, biggest first.”
Nothing to memorize: your agent writes the operators from the sentence. Answered in milliseconds.
The engine your AI searches with
- ripgrep is the engine inside VS Code, the same one agents like Claude Code run.
- It re-reads your whole disk on every search.
- We replaced the scan with an index that’s already warm.
Same query, identical results.
2.35M files · methodology · 465 timed queries, 0 errors · the full table · 170+ measured write-ups in the research library



