Studies on improving existing solutions

[jdreo]

See if one can improve on an existing hash function.

Hash function structure from: https://nullprogram.com/blog/2018/07/31/

uint32_tprospector32(uint32_t x){
  x ^= x >> 15;
  x *= 0x2c1b3c6dU;
  x ^= x >> 12;
  x *= 0x297a2d39U;
  x ^= x >> 15;
  return x;
}

Existing results: skeeto/hash-prospector#19 (comment)

Best so far: [16 21f0aaad 15 735a2d97 15], with x² = 0.10704308166917044

Studies:

1. Optimizing the parameters of a hash function made of 5 operations.
2. Optimizing the operators as well.
3. Finding the Pareto front around by optimizing the parameter.
4. Finding the Pareto front around by optimizing the operators as well (not feasible as of 6b4b5c6).