{
  "id": 24027,
  "title": "My Favorite Constant in Retrieval Is 60. Nobody Tunes It. That's the Point.",
  "url": "https://urgent.news/2026/08/02/my-favorite-constant-in-retrieval-is-60-nobody-tunes-it-thats-the",
  "topic": "world",
  "section": "World",
  "published": "2026-08-02T03:00:00.000Z",
  "source": {
    "name": "Dev.to",
    "slug": "dev-to",
    "url": "https://dev.to/fagundesv/my-favorite-constant-in-retrieval-is-60-nobody-tunes-it-thats-the-point-4857"
  },
  "original_language": "en",
  "account": "In the world of retrieval, one constant reigns supreme: 60. This single parameter in reciprocal rank fusion, a technique that merges two ranked lists, remains unchanged regardless of the dataset. The answer, as stated in the original paper, is simply 60. There's no need for fine-tuning or learning per dataset. It works universally.\n\nThe algorithm for reciprocal rank fusion is straightforward: for each ranking, which is a list of document IDs in descending order of relevance, compute the score as the sum of 1/(k + rank) for each document. The constant k is set to 60. The function returns a sorted list of tuples, where each tuple contains a document ID and its corresponding score.\n\nIn a practical example, consider two retrievers – BM25 and dense. The BM25 retriever matched cases \"CB-1041\", \"CB-1250\", and \"CB-1102\", while the dense retriever matched \"CB-1203\", \"CB-1041\", and \"CB-1288\". When these two lists are fed into the reciprocal rank fusion function, the resulting ranked list reveals that \"CB-1041\" topped the list, a joint favorite of both retrievers. Other documents also ranked well, indicating that the algorithm effectively combined the strengths of both retrieval methods.\n\nThe magic of 60 lies in its ability to balance the ranks. At k=60, the difference between rank 1 and rank 3 is significant, but the gap between rank 40 and rank 50 is negligible. This balance embodies the trust one should have in any retriever. It's a constant that encodes an epistemic understanding of the retrieval process, not a dataset-specific value. This constant has been a robust result in information retrieval research for over twenty years, a testament to the wisdom of knowing when not to turn the knobs. Vinicius Fagundes, a principal data engineer and MBA lecturer, emphasizes this point in his work building fraud and risk analytics pipelines for e-commerce.",
  "summary": "Reciprocal rank fusion is a method that merges two ranked lists into one, with exactly one parameter, k. According to Dev.to, the value of k is set to 60, as specified in the original paper, and this value works essentially everywhere without needing to be tuned per dataset.\n\nDev.to explains that the algorithm calculates a score for each document based on its rank in the input lists, using the formula 1/(k + rank), and then returns a sorted list of documents by their scores. The example provided by Dev.to demonstrates how the algorithm can combine the results of two different retrievers, BM25 and vector-search, to produce a single ranked list.\n\nDev.to attributes the success of the k=60 value to its ability to encode an epistemic, rather than a dataset-specific, trust in the retriever, where the difference between high ranks matters but the difference between low ranks is considered noise.",
  "key_points": [
    "60 is constant in reciprocal rank fusion algorithm",
    "Constant k=60 used across datasets in retrieval",
    "60 balances ranks, encodes retrieval wisdom"
  ],
  "editors_take": null,
  "illustration": "https://urgent.news/ill/24027.png",
  "coverage": {
    "outlets": 1,
    "also_reported_by": []
  },
  "ai_generated": true,
  "disclaimer": "Summaries, key points and the editor’s take are written by software from other outlets’ reporting and may contain errors — always check the linked original."
}