bigint(2).pow(159).add(1).rand(bigint(2).pow(160)).nextPrime()

<BigInt 1324747699464051594045963950518480204962289461419>

trying (in vain) to follow along

from my bigint lib!

which uses libgmp behind the scenes

perfect numbers better. If 2^n-1is prime, then (2^n-1).2^(n-1) is perfect.

just got prime number generation for DSS working!

had to translate some crappy pseudocode with gotos to get to this point

still better than most specs

lemongrass Really cool! I just confirmed that experimentally!

and put it on the readme

great! I'll be able to try that soon. node.js is building in the other window.

reading "JavaScript: The Good Parts" by Douglas Crockford at the moment.

is substack can show whether that formula finds all the perfect numbers

suspects that is one of those open problems

substack is only a bit right.

node.js built under Cygwin now (can't be bothered to use the Linux machine downstairs) but can't install bigint because there's no libffi.

lemongrass Check out npm! You can just `npm install bigint` (you'll need libgmp installed separately though)

that's what he tried. Unfortunately bigint uses node-ffi which requires libffi to already be installed so npm bombs out.

Cygwin has no libffi. It's interesting that node-ffi exists actually, given that people are bound to use it to interface with blocking libs

which would make Mr. Dahl rather upset

ah makes sense