1,142 karma · joined April 8, 2010
[shameless plug]: https://github.com/cobbal/swsh
Description:
A shell-scripting library for Swift, inspired by scsh.
swsh makes writing shell scripts more fun by exchanging bash (or similar) for a better thought-out language like Swift. In the process, a small amount of conciseness is traded for better quoting, error handling, and access to libraries.
The new type of counting also allows you to take a different step and say, "take a collection of things and add a new thing at the end" (a limit ordinal). It's how you get from the set of finite numbers to ω. There's nothing that's "one before" ω, but all the finite numbers are before it.
Repeat these steps as much as you want (making sure none of your sets are circularly defined), and you're counting with ordinals.
The call stack provides very cache-friendly and gc-friendly memory. It's still a very useful construct in functional languages.
let <variable> = <expression 0> in <expression 1>
will bind the value of expression 0 to variable in expression 1.For a 768 bit number the primes would be 384 bits each, gaps between numbers of the form "27a^2 ..." would be 10^58 apart, and weak primes would be at worst one out of 10^56.
Still extremely unlikely, but not by as much as I thought.
There could or course be a larger class of such easy primes, but it seems like it's extremely unlikely a prime of this particular form would ever be generated by chance.