Teaching National Security Policy with AI (steveblank.com)
31 points by enescakir 6h ago 17 comments
CompactLog – Solving CT Scalability with LSM-Trees (github.com)
27 points by Eikon 9h ago 9 comments
Scientific Papers: Innovation or Imitation? (johndcook.com)
60 points by tapanjk 16h ago 24 comments
Adaptive Hashing
56 varjag 8 5/8/2025, 10:16:05 PM quotenil.com ↗
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.
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.
Also, this technique eliminates a number of worst-case scenarios and inefficiencies, which is a boon for any hash table user.
I would think it make some sense to change these constants as the collision chain grows, thereby improving the hash quality of keys and avoiding collisions as the table gets larger and larger