<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Minhash on Solvinc — AI's Uncharted Edge</title><link>https://blog.solvinc.io/tags/minhash/</link><description>Recent content in Minhash on Solvinc — AI's Uncharted Edge</description><generator>Hugo -- 0.139.0</generator><language>en-us</language><lastBuildDate>Thu, 12 Nov 2026 00:00:00 +0700</lastBuildDate><atom:link href="https://blog.solvinc.io/tags/minhash/index.xml" rel="self" type="application/rss+xml"/><item><title>Your LLM Pipeline Pays Full Price for Documents It Has Already Read: A Near-Duplicate Gate That Doesn't</title><link>https://blog.solvinc.io/posts/llm-near-duplicate-gate-minhash-python/</link><pubDate>Thu, 12 Nov 2026 00:00:00 +0700</pubDate><guid>https://blog.solvinc.io/posts/llm-near-duplicate-gate-minhash-python/</guid><description>A tested MinHash LSH gate that blocks near-duplicates before they hit your LLM: scaling math, measured precision and recall, and the decision-field trap.</description></item></channel></rss>