qdrant-hybrid-search-combining — independently scanned and version-tracked by SaferSkills.
SaferSkills independently audited qdrant-hybrid-search-combining (Agent Skill) and scored it 100/100 (green). The audit ran 55 deterministic rules across Security, Supply Chain, Maintenance, Transparency, and Community; it found 0 high-severity and 0 lower-severity findings. The full rule-by-rule trace and per-finding evidence are below. Free, methodology-open.
Findings & checks · 0 flagged
Every scanned point with the score it earned and what moved between them.
First recorded scan — no prior version to compare against.
The primary manifest — the file an agent reads to learn what this artifact does.
The outer query fuses ranked candidate lists from all parallel prefetches into one ranked list of results. Fusion methods differ in whether they use rank, score or directly vector representations of candidates (their similarity to the outer query) and whether final score incorporates payload metadata. All methods support flat (one fusion step) and nested (multi-stage) prefetch structures.
Use when: searches produce scores on different scales, like BM25 and cosine on dense embeddings.
k to control rank sensitivity in RRF fusion.Use when: recency, popularity or other payload values should affect the merged ranking alongside candidate scores or you need a custom fusion.
[With formula query](https://skills.qdrant.tech/md/documentation/search/search-relevance/?s=score-boosting), access score of each prefetch and, if desired, payload field values.
If you want to implement custom fusion on score of each prefetch:
When using FormulaQuery over multiple prefetches (e.g. per-representation weighting):
$score[i] indexes prefetches in declaration order. Reordering the prefetch= list silently shifts which weight applies to which retriever.defaults for every $score[i] so the formula still evaluates for candidates that surfaced from only a subset of prefetches.FormulaQuery only when explicit per-representation weighting or payload-driven boosts are required, and normalize each $score[i] (decay or min-max on a sampled distribution) before combining linearly.Use when: you want to use similarity between query and candidates' vector representations as the prefetches combiner and simultaneously ranker. More resource heavy than score/rank based fusions, but might be necessary due to use case requirements or need in a high top-K precision of results (when parallel prefetches have overall a good recall of retrieved candidates).
You can use any type of vector as an outer query over the prefetches, to perform the fusion on the server-side in one QueryAPI request: sparse, dense, multivector. For that, same type of vector representations for documents need to be stored as named vectors per point.
Instead of using client-side fusion through cross-encoders, a popular option is Late interaction models-based fusion, through reranking on multivectors (e.g. ColBERT for text, ColPali and ColQwen for images).
~30 seconds. Free. No account. Every finding cites a rule and a line of evidence.