Home▸Algorithms & AI▸3D Winnowing Document Fingerprints: k-Gram Hash Selection and the Guaranteed Detection Length for Copied Code Blocks

🔍 3D Winnowing Document Fingerprints: k-Gram Hash Selection and the Guaranteed Detection Length for Copied Code Blocks

A Blender-built pair of token shelves shows the winnowing algorithm on two programs: k-gram hashes, the minimum of every window selected as a gem-topped fingerprint pillar, and gold beams joining the fingerprints both programs share, with the exact guarantee for copies of length w + k - 1.

Algorithms & AI3DAdvanced60 FPS📱 Mobile-adapted🟠 Blender⇄ 2D version
3D Winnowing Document Fingerprints: k-Gram Hash Selection and the Guaranteed Detection Length for Copied Code Blocks ↗ Open standalone
⚙ Under the hood

A Blender-built pair of token shelves shows the winnowing algorithm on two programs: k-gram hashes, the minimum of every window selected as a gem-topped fingerprint pillar, and gold beams joining the fingerprints both programs share, with the exact guarantee for copies of length w + k - 1.

WinnowingDocument Fingerprintingk-gram HashingPlagiarism DetectionRolling HashString AlgorithmsSource Code SimilarityAlgorithms

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)