Exact numpy search over 100k embeddings takes 3.5 ms on 2 vCPUs. Measured latency, memory and HNSW recall to show when an index actually pays off.
Do you need a vector database? Brute-force search benchmarked from 10k to 1M vectors
Related
How to answer Claude Code or Codex from your phone
You start an agent on the computer at home and leave. An hour later your phone shows that it stopped...
I hid 6 secret glitches in my agent's video game. They make it easier. Can it find them?
Flash plays a rhythm-runner level from raw pixels. So I hid speedrun-style skips in it: a pad fling over a spike pit, a ghost ship, spike surfing. Nothing on screen gives them away...
Copy the expected, but build what you need.
For the last year I've been working on an app called Glimpse. It's a dictation app and a meeting app,...