The Gasher

A hasher, fuzzer, genetic algorithm. Can generate formulas to hash some inputs to a perfect minimal lookup table. © qfox.nl, by Peter van der Zee, July 2016. See [n https://github.com/qfox/gasher n]https://github.com/qfox/gasher[/n] for code/readme and [n http://qfox.nl/weblog/376 n]http://qfox.nl/weblog/376[/n] for blog post.

this spinner indicates how busy the current browser thread is

values to hash
(The above resulted in...) len=

values
weights; current: best:
prefixes
weights; current: best:
infixes
weights; current: best:

all weights can be zero only some weights can be zero no weight can be zero

unbound 32bit signed 32bit unsigned

all clamps random clamp (code >>> 0) % B (code | 0) % B code & B
(Math.abs(code) | 0) % B (code >> rng(B)) & B
custom clamp: before code: after code:

Particles: Buckets: Append:

above: last of batch, always replaced
below: best so far. equals are replaced until better than some score and appended otherwise