16:53 <sam113101> guys explain something to me

16:53 <sam113101> why is num.prime? much faster than Prime.prime?(num)

16:54 <sam113101> I think I already asked this but I don't remember

17:06 <konsolebox> The latter sensibly has more internal calls in it. But other than that it's gotta be the implementation. Prime (https://github.com/ruby/prime) is not written in C.

18:48 <sam113101> konsolebox: They're both from that lib and they're both written in ruby. num.prime? comes from the lib injecting into Integer, it's not a default ruby function. But indeed they have a different implementation, and I'm starting to understand why one is faster than the other. I still wonder, why even have the slower one at all? Why not just make them both the same.

18:54 <weaksauce> sam113101 havenwood has some thoughts on that

18:57 <weaksauce> anyway it boils down to the prime library is a toy implementation

18:57 <weaksauce> not sure why the first one is faster

18:58 <konsolebox> It also needs context. Faster in the call itself alone or multiple calls?

19:18 <sam113101> first one is faster because it does a Miller Rabin test with a limited set of bases, whereas the other one basically does a simple division test with numbers that are not divisible by 2 and 3

19:18 <sam113101> and from what I understand it's also checking numbers greater than the square root

19:27 <weaksauce> sam113101 where is num.prime? coming for

19:27 <weaksauce> from*

19:27 <weaksauce> it's not in integer or numeric from what i can tell

19:28 <sam113101> weaksauce: it gets injected in class Integer when you require 'prime': https://github.com/ruby/prime/blob/master/lib/prime.rb#L35

19:29 <weaksauce> ok that's even weirder then

22:32 <[0x1eef]> Is the Ruby discord more active than here ?

22:38 <weaksauce> yeah

22:38 <weaksauce> quite a bit more

22:39 <[0x1eef]> Makes sense. This might be the quietest channel I'm in. Besides #TempleOS XD

23:06 <gr33n7007h> it appeared to slowly decline after the freenode/libera transition