Andzhig, I guess this approach is confusing due to small sample size.
If you take any random 4 numbers, you will find the dependencies between them for sure. The same could be done for 10, 30, or even 100 random numbers. So, our brain thinks that we found the dependencies between several numbers, but it could be wrong just because of the small sample size.
it works like this.
all permutations ripmd160 in hex format 40 length
from
0000000000000000000000000000000000000000
to
FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
for example, puzzle 64 is somewhere there
0000000000000000000000000000000000000000
...
3ee4133d991f52fdf6a25c9834e0745ac74248a
0...
3ee4133d991f52fdf6a25c9834e0745ac74248a
1...
3ee4133d991f52fdf6a25c9834e0745ac74248a
2...
3ee4133d991f52fdf6a25c9834e0745ac74248a
3...
3ee4133d991f52fdf6a25c9834e0745ac74248a4...
3ee4133d991f52fdf6a25c9834e0745ac74248a
5...
3ee4133d991f52fdf6a25c9834e0745ac74248a
6...
etc
...
3ee4133d991f52fdf6a25c9834e0745ac74248a
f...
FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
in other words into space
0000000000000000000000000000000000000000
...
FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
there is only 1 such key 3ee4133d991f52fdf6a25c9834e0745ac74248a4 but it is obtained by numbers from space (dec 9223372036854775808-18446744073709551616) and the rest where then are located which end with 0 1 2 3 ... D E F