Hi Alberto, I'm aware of BSGS algorithm and importance of k as 2^x to be optimized and efficient on math part but if the available RAM is somewhere between 2^x and we pick a non square k number, obviously it would hit the key in sequential search but I'm wondering if it miss the key in random search. I have a thread-ripper pro 96 cores, 192 threads, 512GB RAM but not possible to max it out. can go around 490GB, I'm pretty confused to pick a k number, would be a waste to use 256GB instead of 490GB. I appreciate your opinion in this matter. Does the higher speed mean more efficiency?