How it works
Updated August 12, 2026 · min read
What Is QuickXorHash and How Does OneDrive Use It?
A plain-language explanation of OneDrive’s content fingerprint and its role in no-download exact matching.
A cloud duplicate scanner needs strong content evidence without transferring every file. OneDrive’s hashes metadata can provide quickXorHash, allowing the comparison to happen from a compact value returned with the file item.
Store the algorithm name and normalized value, group files by byte size, and compare only values produced by the same algorithm. Missing, malformed, or unsupported hashes must remain unresolved rather than being replaced by a weaker name-based rule.
A practical checklist
- 1Read the hashes facet from authorized OneDrive file metadata.
- 2Normalize the algorithm label and encoded value consistently.
- 3Group equal byte sizes before comparing hashes.
- 4Require the same size, algorithm, and fingerprint for an exact candidate.
- 5Review item paths and permissions before planning cleanup.
Understand the situation
A cloud duplicate scanner needs strong content evidence without transferring every file. OneDrive’s hashes metadata can provide quickXorHash, allowing the comparison to happen from a compact value returned with the file item.
Keep detection evidence separate from retention judgment. Technical signals can establish that bytes match, while path, permissions, history, and ownership determine whether one file item is operationally redundant.
Use a controlled workflow
Store the algorithm name and normalized value, group files by byte size, and compare only values produced by the same algorithm. Missing, malformed, or unsupported hashes must remain unresolved rather than being replaced by a weaker name-based rule.
A robust pipeline handles pagination, missing values, throttling, and changes during the scan. Incomplete data should lower confidence or remain unresolved instead of being converted into a clean-looking but unsafe result.
- Normalize the algorithm label and encoded value consistently.
- Group equal byte sizes before comparing hashes.
- Require the same size, algorithm, and fingerprint for an exact candidate.
Make the final decision
Use a size-and-quickXorHash match to establish an exact candidate group, then use item context to choose keepers. Do not use the fingerprint to infer visual similarity, maliciousness, ownership, or whether a shared copy is expendable.
ClearCopies has a deliberately narrow promise: scan supported cloud metadata, confirm exact candidates by byte size plus a matching provider fingerprint, let the user review, and export the plan without downloading original content.
Limits and risks to check
- — Hash availability varies by file and account context.
- — Values from different algorithms are not comparable.
- — A hash proves content relationship, not operational redundancy.
- — Implementation bugs in encoding or normalization can split or merge groups incorrectly.
Official references
Frequently asked questions
Is quickXorHash the same as MD5 or SHA-256?
No. It is a distinct algorithm; compare only values identified as the same algorithm.
Can I reverse a quickXorHash to recover file content?
It is a compact fingerprint, not an encoded copy of the file body.
Why does ClearCopies also compare byte size?
Size provides efficient candidate grouping and an additional explicit condition in its exact-match policy.
Scan first. Decide with evidence.
ClearCopies reads supported cloud-drive metadata and groups exact copies by byte size plus a provider-supplied content fingerprint. Original file bodies are not downloaded for the scan. You review the result and export a plan before any separate write step.