Remodel OpenCL #3
Description
HL[mempos] --> deterministic random number in [0, 2**256-1]
Check Hamming Dist;
Store if cool.
The idea here is that we don't need to store even the addresses, if computing their hashes is faster than that. We would never need 2**20 buffers.
And maybe because of that we could retrieve the active hard locations with a small buffer (say, 2000 possible positions, given 1250 expected locations found).
This idea comes from creating hardware chips for Kanervating.