2025-05-27 01:12:47 <cleobuline  > forthBot:  1 756839 << 1 - PRIME? .
2025-05-27 01:47:01 <cleobuline  > forthBot:  ." Calcul terminé  1 756839 << 1 - est premier "
2025-05-27 01:49:53 <nmz         > wow that's a slow prime checking function
2025-05-27 01:50:03 <nmz         > what's the implementation
2025-05-27 01:50:53 <nmz         > cleobuline: it should be instant
2025-05-27 01:51:16 <nmz         > unless you deal with bignums then it should take a bit
2025-05-27 01:51:55 <nmz         > mmm
2025-05-27 01:51:56 <cleobuline  > for small numbers  lik 1 127 << 1 - it should be instant
2025-05-27 01:52:04 <nmz         > I know! I'll rewrite it in forth
2025-05-27 01:52:19 <nmz         > what forth you using, I'll check
2025-05-27 01:52:25 <nmz         > ; luaa -e 'print(math.IsPrimeB(136279841))'
2025-05-27 01:52:27 <nmz         > Loading init.lua
2025-05-27 01:52:29 <nmz         > true
2025-05-27 01:52:31 <nmz         > [nmz@Satellite] [19:51:35] [0.46 0.32 0.27] [0|6]
2025-05-27 01:52:51 <cleobuline  > nmz:  try 1 756839 << 1 -
2025-05-27 01:53:14 <nmz         > what's <<?
2025-05-27 01:53:24 <cleobuline  > shift left
2025-05-27 01:53:35 <cleobuline  > pow 2
2025-05-27 01:53:40 <nmz         > just gimme the number
2025-05-27 01:54:44 <cleobuline  > more than 600 000 numbers nmz
2025-05-27 01:54:50 <nmz         > you mean this 756839? because its just shifting by 1 there no?
2025-05-27 01:55:16 <cleobuline  > no shift 756839  time
2025-05-27 01:55:30 <cleobuline  > 2^ 756839
2025-05-27 01:55:59 <nmz         > ah, doesn't fit a double
2025-05-27 01:56:08 <cleobuline  > it may take one hour tio check if prime
2025-05-27 01:59:22 <cleobuline  > nmz:  https://pastebin.com/LG4rKZLN
2025-05-27 01:59:37 <cleobuline  > -1
2025-05-27 02:00:07 <nmz         > 227833 digits
2025-05-27 02:00:14 <nmz         > sheesh
2025-05-27 02:00:21 <cleobuline  > you can try
2025-05-27 02:00:27 <nmz         > nah
2025-05-27 02:01:13 <cleobuline  > nmz:  i am sure forthBot will do this job , but not sure of the time for
2025-05-27 02:02:12 <cleobuline  > it was calculate on a cray 2
2025-05-27 02:03:20 <cleobuline  > i take it here https://fr.wikipedia.org/wiki/Nombre_de_Mersenne_premier
2025-05-27 02:04:02 <cleobuline  > number 32
2025-05-27 02:04:42 <nmz         > time gawk -M -f ./math2.awk -e 'BEGIN {print isprime(2^227833)} '
2025-05-27 02:04:44 <nmz         > 0
2025-05-27 02:04:46 <nmz         > Executed in    4.43 millis    fish           external
2025-05-27 02:05:10 <cleobuline  > 2^ 756839 -1 nmz
2025-05-27 02:05:18 <nmz         > minus 1?
2025-05-27 02:05:22 <cleobuline  > yes
2025-05-27 02:05:27 <nmz         > why the minus 1?
2025-05-27 02:05:46 <cleobuline  > because  minus 1 is prime :)
2025-05-27 02:06:13 <cleobuline  > 2^227833  is divisible by 2 ....
2025-05-27 02:06:35 <cleobuline  > 2^227833  - 1 is prime
2025-05-27 02:06:52 <nmz         > oh, you mean -1==true
2025-05-27 02:07:18 <cleobuline  > ( 2^227833 )  - 1 the number  is prime
2025-05-27 02:07:25 <nmz         > or (2^756839-1) or (2^756839)-1
2025-05-27 02:08:09 <cleobuline  > (2 ^756 839 ) -1
2025-05-27 02:08:38 <cleobuline  > try it
2025-05-27 02:09:25 <nmz         > this is gonna take a while
2025-05-27 02:09:30 <cleobuline  > time gawk -M -f ./math2.awk -e 'BEGIN {print isprime((2^227833)-1)} '
2025-05-27 02:09:41 <cleobuline  > wait
2025-05-27 02:10:52 <cleobuline  > if it beat my forthBot
2025-05-27 02:10:52 <nmz         > if it runs for more than 10 minutes I'm killing it
2025-05-27 02:11:24 <cleobuline  > it may take an hour
2025-05-27 02:11:51 <nmz         > yeah I'm stopping it
2025-05-27 02:11:55 <cleobuline  > lol
2025-05-27 02:11:57 <nmz         > its a waste of electricity
2025-05-27 02:12:30 <cleobuline  > running or not a computer use the same no ?
2025-05-27 02:12:39 <nmz         > no?
2025-05-27 02:12:52 <nmz         > the more CPU usage the more elec usage
2025-05-27 02:12:59 <cleobuline  > ha
2025-05-27 02:13:12 <nmz         > GPUs also hog, its why they want a bigger power supply
2025-05-27 02:13:45 <cleobuline  > labynet@ubuntu:~/new-hash$ uptime
2025-05-27 02:13:45 <cleobuline  >  02:13:24 up 27 days,  3:38,  1 user,  load average: 2.07, 2.08, 2.08
2025-05-27 02:14:06 <cleobuline  > not too much
2025-05-27 02:15:48 <cleobuline  > next i will try ( 2 ^859433) -1
2025-05-27 02:15:53 <nmz         > date; time gawk -M -f ./math2.awk -e 'BEGIN {print isprime( (2^75683) - 1)}'
2025-05-27 02:15:55 <nmz         > 0
2025-05-27 02:15:57 <nmz         > Executed in   30.58 secs    fish           external
2025-05-27 02:16:45 <nmz         > you try that one
2025-05-27 02:17:23 <nmz         > one less digit, but at least it finished
2025-05-27 02:18:29 <cleobuline  > 0 , mean it is not prime
2025-05-27 02:19:07 <nmz         > No clue
2025-05-27 02:19:18 <nmz         > I wrote it so long ago
2025-05-27 02:19:37 <nmz         > ya 0 means not prime
2025-05-27 02:48:31 <cleobuline  > 02:43 (cleobuline) forth:  MILLI  1 75683 << 1 - PRIME? .  MILLI SWAP - .
2025-05-27 02:48:31 <cleobuline  > 02:45 (forth) 0
2025-05-27 02:49:07 <cleobuline  > 2 minutes
2025-05-27 03:01:15 <xentrac     > ya 0 means ya never incremented ya counter, yo
2025-05-27 03:21:10 <nmz         > awk is fast
2025-05-27 03:21:22 <nmz         > well, more like gmp is fast
2025-05-27 03:25:32 <nmz         > oh nice
2025-05-27 03:25:35 <nmz         > now its faster
2025-05-27 03:25:56 <nmz         > here's a prime number that's good enough 16^16
2025-05-27 03:27:53 <nmz         > cleobuline: is prime? flooring and sqrt the limit?
2025-05-27 03:30:46 <nmz         > how's your stepping?
2025-05-27 03:44:28 <xentrac     > that doesn't sound very prime
2025-05-27 03:46:20 <nmz         > xentrac: its a new stepping dance move called priming
2025-05-27 03:46:29 <nmz         > yoyoyoyo
2025-05-27 03:48:09 <nmz         > J has the best algo for checking if prime, I remember throwing any number at it and the damn thing always returned in less than 30 seconds
2025-05-27 03:50:54 <xentrac     > any number?
2025-05-27 03:51:19 <xentrac     > do you mean numbers with a thousand digits or more like numbers with a billion digits?
2025-05-27 04:00:00 <nmz         > try it
2025-05-27 06:17:30 <deadmarshal_> J is big on mathematics and it's math algos are generally good
2025-05-27 06:26:22 <thrig       > odds are it gets evens right
2025-05-27 06:29:07 <forthBot    > 1
2025-05-27 06:29:07 <forthBot    > Calcul terminé  1 756839 << 1 - est premier
2025-05-27 08:29:07 <forthBot    > Environment for cleobuline inactive, freeing...
2025-05-27 16:05:37 <cleobuline  > forthBot:  MILLI 1 859433  <<  1 -  PRIME? . MILLI SWAP - .  ."  1 859433  <<  1 -  est premier "
2025-05-27 16:06:31 <cleobuline  > may be the result at night ...
2025-05-27 17:39:58 <anthk_      > deadmarshal_: k/klang it's fun too
2025-05-27 17:40:18 <anthk_      > there was some guide for k in the same play of the joy language
2025-05-27 17:40:32 <anthk_      > but when I built k, tons of stuff was closed source, I didn't like it
2025-05-27 17:40:46 <anthk_      > I prefer klong/kling.py even if it's slower
2025-05-27 17:42:39 <xentrac     > there's also kona
2025-05-27 17:58:18 <anthk_      > how fast is it?
2025-05-27 18:01:31 <xentrac     > dunno
2025-05-27 18:10:53 <anthk_      > btw, on lisp, from t3x, s9fes it's good enough
2025-05-27 18:10:59 <anthk_      > and its forth too, but it's an odd blend of f79, some f83 features and a bit of ANS
2025-05-27 18:38:42 <xentrac     > hm?
2025-05-27 19:03:35 <cleobuline  > forthBot:  QUIT
2025-05-27 19:03:54 <cleobuline  > forthBot: QUIT
2025-05-27 19:04:07 <cleobuline  > it is sleeping
2025-05-27 19:12:43 <xentrac     > it is an ex-forthBot
2025-05-27 19:43:57 <deadmarshal_> anthk_: I saw K but haven't used it at all. I also tried APL but like J better. J's concept of rank is very awesome. Especially I like it that ranks in J is explicit, but in APL it's more loose which I don't like
2025-05-27 20:01:03 <anthk_      > k should work very similar to j
2025-05-27 20:24:40 <deadmarshal_> +
2025-05-27 21:36:52 <xentrac     > deadmarshal_: of operator rank?
2025-05-27 21:37:20 <xentrac     > the rank of an array is not very loose at all in J, K, or APL; it's just ρρA
2025-05-27 23:26:13 <anthk_      > https://git.sr.ht/~hocwp/10biForthOS wait
2025-05-27 23:26:31 <anthk_      > deadmarshal_: I tried k with some 'intro to math' article, it was fine
2025-05-27 23:26:42 <anthk_      > altough it woudn't map to klang 1:1, I'm afraid so
2025-05-27 23:26:49 <anthk_      > s,klang,klong
2025-05-27 23:29:11 <anthk_      > ah, damn
2025-05-27 23:29:14 <anthk_      > not k, j
2025-05-27 23:35:40 <anthk_      > then there was Joy but that was like Sussman trying to redesign Forth by reading SICP first
2025-05-27 23:38:56 <anthk_      > you might need a good chunk of Discrete Math
2025-05-27 23:48:22 <nmz         > I just checked and it doesn't support bignum, maybe I need to set something up, oh well