Theoremcore
Collision bound for random-base polynomial hashing
Also called Karp-Rabin collision bound.
For distinct strings of length n and a uniformly random base modulo a prime p, the hashes collide with probability at most n/p.
For distinct strings of length n and a uniformly random base modulo a prime p, the hashes collide with probability at most n/p.
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 DBSX7N Edit this page History Report an error