Nagareyama (Fable 3) is out! Check it out here: https://t.co/P8aPCrt496

After being asked many times if the code is available, I'm pleased to announce that SlicStan is finally open source! 🎉 If you are interested in seeing some #ProbabilisticProgramming transformations for @mcmc_stan then head to https://t.co/XWoo5g7TV9 Written in 100% #fsharp 😊

In computer science, consistent hashing is a special kind of hashing such that when a hash table is resized, only keys need to be remapped on average where is the number of keys and is the number of slots. In contrast, in most traditional hash tables, a change in the number of array slots causes nearly all keys to be remapped because the mapping between the keys and the slots is defined by a modular operation. Consistent hashing is a particular case of rendezvous hashing, which has a conceptually simpler algorithm, and was first described in 1996. Consistent hashing first appeared in 1997, and uses a different algorithm.