{"uid":"cap_wUAMg1WYCHY30RA8hgsBs","slug":"simhash-fingerprint-near-duplicate-detection-2c202448","name":"SimHash Fingerprint & Near-Duplicate Detection","description":"Compute a 64-bit SimHash fingerprint for content, or compare two texts and return the Hamming distance and a 0-1 similarity score for near-duplicate detection.","url":"https://api.24klabs.ai/api/simhash-dedup","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"a":{"type":"string"},"b":{"type":"string"}}},"responseSchema":{"type":"json","example":{"distance":3,"similarity":0.95}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.002","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.002/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_YxYuT2ck5oDWYjuSGkjgq","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.002","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes a 64-bit SimHash fingerprint for text content, or compares two texts returning Hamming distance and a 0–1 similarity score for near-duplicate detection.","exampleAgentPrompt":"Compute a SimHash fingerprint for this article text, then compare it with yesterday's version and give me the Hamming distance and similarity score so I can tell if they're near-duplicates: [text A] vs [text B].","exampleUseCases":[{"title":"News article deduplication pipeline","prompt":"I have two scraped news articles and I want to know if they're near-duplicates — can you run a SimHash comparison on them and give me the Hamming distance and similarity score?"},{"title":"Blog post plagiarism check","prompt":"Compare these two blog posts using SimHash and tell me how similar they are on a 0-to-1 scale and the Hamming distance between their fingerprints."},{"title":"Content fingerprinting for a crawl cache","prompt":"Generate a 64-bit SimHash fingerprint for this webpage text so I can store it and later detect if the page has changed significantly."}],"resultDescription":"For a single text input: a 64-bit SimHash fingerprint (integer or hex string). For a two-text comparison: the Hamming distance (integer, 0–64) between the two fingerprints and a normalized 0–1 similarity score where values near 1 indicate near-duplicates.","failureModes":["Empty or missing text input returns a 400 validation error","Extremely short texts (1–2 words) may produce unreliable similarity scores","Non-textual binary content causes parsing errors","Rate limiting or payment failure results in 402/429 responses","Very large text inputs may be truncated or rejected with a payload-size error"],"whenToPreferThis":"Choose this endpoint when you need fast, deterministic near-duplicate detection for text without requiring semantic understanding — ideal for deduplication of crawled web pages, news feeds, user-generated content, or document archives. Prefer it over cosine similarity or embedding-based approaches when speed and exact fingerprint reproducibility matter more than semantic nuance, and when you want a single cheap hash you can store and compare later.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-16T01:01:32.573Z","isFirstParty":false}