2 ms·
Fun fact! A previous use of the term "adaptive hash" was as a descriptor for things like Bcrypt, which have the exact opposite goal (to consistently be as slow
by tptacek 2y ago
Fun fact! A previous use of the term "adaptive hash" was as a descriptor for things like Bcrypt, which have the exact opposite goal (to consistently be as slow as possible regardless of advances in hardware).
- 90s_dev 2y ago"tptacek's law: given enough time, diametrically opposed algorithms will have the same name"
- tptacek 2y agoYes! See: quicksort.
- deleted 2y ago[deleted]
- tialaramex 2y agoHuh? What's the other "quicksort" ? Tony's famous Quicksort I'm aware of, and while you should not use this algorithm this century† in its pure form it's still in the core of good sorts, you just need other ingredients too. So what's the diametrically opposed algorithms with the same name ? † Don't tell C++ programmers, some of their standard libraries only stopped shipping quicksort as the default algorithm during the Biden administration.
- Nevermark 2y agoSo we just flip a sign in Bcrypt! Or flip a decision Boolean? Or a sort order? Regardless it will be easy. Apply the inverse operation of the “introduce more slowness” operation. Unfortunately, I have seen some software in my day, and I don’t think it will work. Just really perverse stuff.