🔍 2D Winnowing Document Fingerprints: k-Gram Hash Selection and the Guaranteed Detection Length for Copied Code Blocks
Two token strips with winnowing fingerprints, shared hashes joined by lines, a detection-probability curve against copied length, a renamed-variable switch and six independent numerical checks (the t = w + k - 1 guarantee, 2/(w+1) density, brute-force definition).
⚙ Under the hood
Two token strips with winnowing fingerprints, shared hashes joined by lines, a detection-probability curve against copied length, a renamed-variable switch and six independent numerical checks (the t = w + k - 1 guarantee, 2/(w+1) density, brute-force definition).
WinnowingDocument Fingerprintingk-gram HashingPlagiarism DetectionRolling HashString AlgorithmsSource Code SimilarityAlgorithms
2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install