log☇︎
22800+ entries in 0.006s
asciilifeform: thing is small enuff such that if you have any cache at all, it's likely to fit in it
asciilifeform: ( unsurprising, but worth noting )
asciilifeform: thus far i've found that ffa speed is almost exact function of cpu clock (for given bitness of cpu)
asciilifeform: pretty decent, even tho broken inlining on sad gnat
asciilifeform: ty mod6
asciilifeform: it's sorta like a 'run mile' time 'wearing gasmask'. but dunhurt, wainot, paste
asciilifeform as of ch11 all benchmarks posted are on standard tmsr gnat.
asciilifeform: but sure, paste. it'll be 2-3x-fold dog-slow vs proper inlinetronic tho.
asciilifeform: waitasec how come yer not using standard tmsr gnat ?
asciilifeform: mod6: if you already took the time to benchmark, then plox to post, ty
asciilifeform: http://www.loper-os.org/?p=2857&cpage=1#comment-19766 << meanwhile in other lulz.
asciilifeform: ( tldr : miller-rabin still king.. )
asciilifeform: elsewhere, on same subj, http://probableprime.org/images/primality-times.png << handy.
asciilifeform: https://arxiv.org/abs/1009.3956 << lol, they're a bourbaki apparently.
asciilifeform: ( via http://michaelnielsen.org/polymath1/index.php?title=Finding_primes , a www about http://btcbase.org/log/2017-11-07#1733382 , but somewhat poor snr... ) ☝︎
asciilifeform: meanwhile, in misc. lulz, http://michaelnielsen.org/polymath1/index.php?title=An_efficient_algorithm_exists_if_Cramer%27s_conjecture_holds
asciilifeform: aanyways, teatime, bbl.
asciilifeform: ( i.e. sequence where only ADD, SUB, MUL, SHR/SHL, MOV, all the way from head to toe , a,b,c in, a^b mod c comes out )
asciilifeform: the other thing, if one is writing a proggy where only 1 ffawidth is used, it is possible to unroll all of the loops, derecursivize karatsuba, etc. and get straight line of instructions
asciilifeform: ( and it is fortunately much easier to find mistake in 5k loc , with ~one~ execution path, than in 150kloc with 900000 paths... )
asciilifeform: diana_coman: sadly i do not know how to 'guarantee perfection'. all i know how to do is to bake maximally 'fits in head' and bank that the folx here will find mistake if it turns out that i made one. ☟︎
asciilifeform: ( http://btcbase.org/log/2018-12-18#1881560 << see also. technically applies to ~errything after ch6. ) ☝︎
asciilifeform: ( where yer tryin' to save coad space )
asciilifeform: btw it is possible to dispense with FZ_LoMul , and simply discard upper chunk of ordinary karatsuba product. this costs ~10% cpuwise, and may be justified for some proggies.
asciilifeform: ( hence the somewhat pedantic treatment of the subj, 2 separate proofolade articles. was going for 'measure 7777 times, cut 1ce' there. )
asciilifeform: you may find it interesting that asciilifeform's 1st shot at barrett managed to have a subtly fatal mistake in the proof, and correspondingly a proggy that failed on <0.1% of input space.
asciilifeform: this is the place where slow an' careful is the Right Thing.
asciilifeform: ( the key work for diana_coman et al, from ffaology pov, is to eat the proofs )
asciilifeform: no particular hurry
asciilifeform: diana_coman -- will be interesting to see benchmarks from your irons, if you get the chance.
asciilifeform: ( i.e. thing is siliconizable, in principle. )
asciilifeform: the other thing we get, is of course http://btcbase.org/log/2017-10-08#1722435 . ☝︎
asciilifeform: ( http://btcbase.org/log/2018-10-12#1860844 << see also oldthread where the same effect ) ☝︎
asciilifeform: for some particular applications (e.g. gossipd) it (and asmism etc) justified.
asciilifeform: and incidentally it wins for same reason -- branch predictors suck
asciilifeform: ( not in any patch yet, but pasted last summer )
asciilifeform: btw there's a 'seekrit' 30% linear speed boost if one uses unrolled combas.
asciilifeform: diana_coman: lulzy, neh. we do 4 MUL instrs for each word x word , and we do each ADD & SUB ~twice~ ( http://www.loper-os.org/?p=1913#selection-3319.14-3343.1 ) ( plus buncha ands, ors, shifts ) , and ~still~ win...
asciilifeform: lollers BingoBoingo
asciilifeform: http://btcbase.org/log/2016-11-26#1573536 << ditto. and, come to think of it, ~all of'em. ☝︎
asciilifeform: despite 'ban'
asciilifeform: meanwhile, in ancient l0gz, http://btcbase.org/log/2016-11-26#1573520 << still, interestingly, live. ☝︎
asciilifeform: ( if not for irc line char # cap, could even make it do 2048bit widths, rsa etc. will still fire faster than ping lag on typical day..)
asciilifeform: nuffin to write home about; but there, current.
asciilifeform: !A V[FFA Ver: ]#
asciilifeform: !A V_[FFACalc Ver: ]#
asciilifeform: !!up pehbot
asciilifeform: meanwhile, pehbot updated
asciilifeform: my reasoning is 'must pick a number, distinguish item from the endless moron march of firefox etc'
asciilifeform: not as such
asciilifeform: you nao sent 255, congrats
asciilifeform: good, yer erryone register is 8bit long
asciilifeform: e.g. you gotta keep'em from linking up with neighbouring pile o'jerries, they'll encircle you and yer done
asciilifeform: lol
asciilifeform: let's say scout reported a 1k-man garrison in the point of origin. and nobody knows precisely how many hauptmann fuckface will be sending.
asciilifeform: let's hear mircea_popescu's logical end of the stick tho. mircea_popescu finds himself partizan commander again, in the field. has 300 men. how he decides how many to send to ambush nazi convoy ?
asciilifeform: i'll be surprised if i haven't nailed the last comment typo by the time done adding chapter-sized knobs, tbh
asciilifeform: lol
asciilifeform: http://btcbase.org/log/2014-04-29#650478 << see also. ☝︎
asciilifeform: http://btcbase.org/log/2018-12-28#1883605 << it is impossible to defend against this criticism, as formulated, so i won't try ☝︎
asciilifeform: there's at least 1 still in'ere.
asciilifeform: thing's about 50-60% comment by mass.
asciilifeform: imho the haskellism where 'program carries proof' is generally a sad thing and results in soup
asciilifeform: ( and it still needed conventional docs, illustrations, etc )
asciilifeform: mircea_popescu: if someone knows how to make ffa moar 'docs is the program'-y, oughta write in and tell asciilifeform , cuz i came as close to it as i knew how.
asciilifeform: mircea_popescu: upper bounds can be known in advance . ( in ffadom, at least. ) in larger meta-heuristics, naturally cannot be ~known~, but can be estimated.
asciilifeform: mircea_popescu: if i v-versioned the ~docs~, we'd be at 50-ish, nao, i suppose
asciilifeform: ( where it dun make sense to make anymoar changes without simply baking new item out of the dismembered corpse of old )
asciilifeform: to which one can converge.
asciilifeform: the declaration i want to make with 'kelvins' is that there is such a thing as a correct program.
asciilifeform: which can carry some qty of change ( i hold to the practice of keeping'em reasonably compact )
asciilifeform: a patch in the context is a vpatch.
asciilifeform: correct.
asciilifeform: mircea_popescu: how does bridge constructor decide 'it should hold 50 tanks time margin of 3' and not 55 and not 45.
asciilifeform: fwiw i gave orig vtron, 'v.py' , 100. it's on 97 (phf's revision) and when i get around to massaging it, i suppose will be 96, and i dunsee why to touch it again after that..
asciilifeform: gut.
asciilifeform: ya but why quarter past, and not 33min.
asciilifeform: incidentally i expected mircea_popescu to say '255 is laughably generous'
asciilifeform: whether it's 'attack is at quarter past dawn' or 'this needs <=255 patches or fuck it'
asciilifeform: at some pt you gotta make a cut where you dun have exact logical support for precisely what cut.
asciilifeform: just like shoemakin' and any other art.
asciilifeform: it also has gut component.
asciilifeform: i.e. 'if this thing needs >255 vpatches after today, then asciilifeform is a tard and somebody else ought to do the whole fucking job over'
asciilifeform: with guts. ☟︎☟︎
asciilifeform: it requires knowing what yer doing.
asciilifeform loox at scrolling wwwbox log, waves to the academitards
asciilifeform: re 'end to software' : http://www.loper-os.org/?p=2892#selection-985.1-1041.25 .
asciilifeform: ( which reminds me, i still have a bolix post queued on conveyor )
asciilifeform: bolix is a sort of rommel's afrika front to this.
asciilifeform: ( anyone have an 'i7' handy ? )
asciilifeform: btw i expect that on moar recent irons, with gigantic caches, diff will be even moar palpable
asciilifeform: lol
asciilifeform: ( i.e. that branch predictor nukes ~all~ win from skipping zeros )
asciilifeform: possibly mircea_popescu is simply less thick than asciilifeform and expected the find
asciilifeform: the copy on my www ( and later cleaned further by diana_coman ) is from gpg 1.4.10 ( itself from signed tar that mircea_popescu dug in in '14 )
asciilifeform: aha
asciilifeform: ( which i suspect is largely cribbed, but i dun specifically know from where )
asciilifeform: gpg itself is substantially moar crippled than koch's mpi lib
asciilifeform: he hardcoded a short buffer, iirc, lol
asciilifeform: test was re koch's arithm engine (which does take arbitrary exps etc, and a patched ver is used in e.g. phuctor)