asciilifeform: 'bro do you lift!11' 'hey i lifted myself off the bed today!'
asciilifeform: this is true. but my original point was that it is impossible to verify the correctness of a list of primes other than by same procedure as generates one.
asciilifeform: in asciilifeform's ( and probably everyone else's... ) experience, the most lethal bugs are ones which produce ~correct~ answer, ~all of the time
asciilifeform: mod6: the three snippets are a pretty good, imho, intro course to 'you can have a useful, statically-compiled lang without promiscuous pointers'
asciilifeform: i.e. 'this dun happen to folx with a working immune system'
asciilifeform: reads, interestingly, very much like the gut tuberculosis thing
asciilifeform: imho life is too short to use 'eyeball diff'.
asciilifeform: not that lists of primes ain't handy -- but that the effort needed to verify one is >= to what is needed to generate same. ergo why not generate.
asciilifeform: or for that matter the one 2yrs ago re the hypothetical tabs-an'-spaces vpatches and 'what determines effort needed to read'
asciilifeform: see also the thread with mod6 re the q of 'what is a readable proggy'
asciilifeform: lobbes: it isn't that this doesn't work, but that the effort needed to verify that you didn't somehow miss one , is substantial☟︎
asciilifeform: asciilifeform in fact has ~several~ dishes , from old renters of the grounds, but can't be arsed
asciilifeform: or i suppose it would, if you have the guts from old tv sat dish
asciilifeform: shinohai: rtlsdr won't work, it dun go to 12GHz
asciilifeform: mod6: amusingly, if you ~did~ have a big enough and old enough universe to contain primorial(2**4096), you could factor, e.g., mircea_popescu's key, in polynomial time, with plain old gcd
asciilifeform: they exist so that the input:output lengths invariants of subtraction and of kara recurse per se, 1:2, are met
asciilifeform: they're temp copies of the multiplicands
asciilifeform: mod6: look at x0, x1, y0, y1 in original kara-mul, and xl/xh in kara-square
asciilifeform: array slices retain the indexing of the underlying array. this is The Right Thing ( see prev thread on subj where i explained to mircea_popescu ) but makes iterating over them slightly trickier in certain cases.
asciilifeform: it can be used as a procedure argument anywhere you could use an array.
asciilifeform: mod6: an array slice ( concept which also exists in common lisp ) can be thought of as a sane man's pointer. i.e. it maps into the original, and writes go through; but it is guaranteed not to spill, out of the original or out of its own more constrained bound
asciilifeform: and incidentally mod6 , is it obvious why this only works if L is restricted to powers of 2 ?
