Techniqueadvanced
Rabin fingerprint
Also called Rabin fingerprinting, GF(2) polynomial fingerprint.
Fingerprint a bit string as its residue modulo a randomly chosen irreducible polynomial over GF(2).
Fingerprint a bit string as its residue modulo a randomly chosen irreducible polynomial over GF(2).
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag TPQWFQ Edit this page History Report an error