11
Checking if a hash is collision free on a limited domain (lexp.lt)
submitted 2 years ago by to c/cpp@programming.dev
3 comments fedilink hide all child comments
 

I had some fun trying to check if a hash (more like a transformation really) was collision free, so I wrote a quick piece code and then iterated on it so that it was usable.

I might add a quick bench and graphs and try to push it even further just for fun, to explore std::future a bit more (though the shared bit set might be a problem unless you put a shared condition variable on it to allow concurrent read but block concurrent writes?)

you are viewing a single comment's thread
view the rest of the comments
[–] [S] 2 points 2 years ago (1 child)

Thanks!

It would have been a lot easier to generate a fresh UUID for every record, but that means storing it. And we would have a unique sequential id alongside a unique UUID, two different keys for the exact same data. It is doable, afterall it's just an additional 128bits for every record, but for the sake of it I wanted to not store an additional ID and be able to compute the UUID on the fly from the base sequential ID.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •