I’m Chris — a software developer based in London, currently CTO at Searchable. This is my personal blog, where I typically write about programming, search systems and technology.
Hornet held the retriever, model and corpus fixed and swapped the harness from one tool call per turn to one Python program per turn. Recall went up 65%, tokens down 51%. Strip the new vocabulary and the win isn't Python - it's that retrieval was finally allowed to fan out.
Dot product, cosine, Euclidean, Manhattan and Hamming - what each one actually measures, why most of them collapse into the same ranking once your vectors are normalised, and the handful of mistakes that bite in practice.
A small, self-contained experiment on why single-vector retrieval breaks on compound, high-intent queries - and how late interaction keeps two facets intact where a dense embedding averages them away.
A series on how consumer search habits are shifting toward AI answers, and what that shift means for the businesses, publishers, and engineers who depend on being found.
Ben Trent and Thomas Veasey shipped another DiskBBQ optimisation today: quantising queries against coarser parent centroids instead of per-document ones. 5x off the quantisation stack with no meaningful recall loss. The insight underneath is that the query path and the document path don’t have to be treated symmetrically.