Why is Jump Consistent Hash NOT suitable for general distributed caching systems like Memcached/Redis?

1. A Because it relies on expensive floating-point math that makes it significantly slower than ring-based lookups in high-traffic environments.
2. B Because it requires a massive amount of RAM to store its internal probability jump tables, making it unsuitable for commodity cache nodes.
3. C Because it is a patented algorithm that requires a restrictive and expensive commercial licensing fee for use in production environments.
4. D Because it strictly requires numeric indices (0...N-1); removing a random node (e.g., Node 4) would require reshuffling everything beyond it.