log☇︎
10400+ entries in 0.005s
mircea_popescu: either man up or get the fuck lost (to baluba island)
mircea_popescu: write fucking blogs, what "platforming". the sort of cuck that expects "president trump" to make him exist is just an alt-flavour transgender dork.
mircea_popescu: http://btcbase.org/log/2019-02-13#1895813 << eh, what a fucking stupid idea. nobody wants anything with "social media", let the socialist tards & my bots have it. ☝︎
mircea_popescu: sure.
mircea_popescu: aha.
mircea_popescu: http://btcbase.org/log/2019-02-13#1895808 << i deliberately wrote it like that because i expect it can not be optimized away. how would this go ? ☝︎
mircea_popescu: http://btcbase.org/log/2019-02-13#1895803 << well ok but mixing like that's not going to get us anywhere. ☝︎
mircea_popescu: well now i have to step out ; diana_coman do some more experiments, get some more data, we gotta figure out wtf this is.
mircea_popescu: meanwhile in unrelated lulz, http://trilema.com/2014/website-thou-art-lol/#selection-423.92-423.100 (believe it or not, "affirmed" is a term of art in the context, that's how cuntmagic works, by "affirmation".)
mircea_popescu: did i ever link the obvious http://trilema.com/2018/post-malone/#selection-79.0-205.38 answer to the obvious if commonplace http://btcbase.org/log/2019-01-03#1884205 idiocy ? i think not, and it'd be a waste. ☝︎
mircea_popescu: anyway, she'll be back momentarily and we'll dig into it smore.
mircea_popescu: http://trilema.com/2011/barbati-si-copile/ << found it ; was ro which is why it had "disappeared"
mircea_popescu: asciilifeform note that a set of up to 200s converged, and then a 1 1/4 s item diverged.
mircea_popescu: asciilifeform incidentally and unrelatedly, since i'm fixing this other article : do you happen to recall the trilema piece where "middle age crisis" ie, dood getting rid of older wife hooking up with younger girl is explained in terms of "well, she won't be as fucking annoying" ?
mircea_popescu: then they suddenly diverged by order of magnitude.
mircea_popescu: right. point being, she did 1 to 5 loop sets of that, and the values converged.
mircea_popescu: so then what the fuck.
mircea_popescu: alright. and if there's 22 for loops, this means the correct count of "how many times serpent is run" is 50 ^ 22 then ?
mircea_popescu: http://p.bvulpes.com/pastes/YaMpS/?raw=true << code snippet.
mircea_popescu: do me a favour first and let's nail the numbers down. so, for 1 to 100 if mod 2 results in the loop being run 50 times ? or 49 ?
mircea_popescu: asciilifeform basically, we found i can't math ; that aside, we found that in one context serpent takes ~3us, and in another ~0.3us.
mircea_popescu: yes.
mircea_popescu: a ok.
mircea_popescu: we are currently entering the loop twice, and we enter a total of 22 loops. therefore the number of times serpent is run is 2 ^ 22.
mircea_popescu: ok, but indulge me :
mircea_popescu: is this faux convergence then ?
mircea_popescu: for 1, 2, 3, 4, 5 loops respectively as reported in http://btcbase.org/log/2019-02-13#1895666 ☝︎
mircea_popescu: except the other set converged, look : 3.37786e-06 2.8855032e-06 2.812888584e-06 2.8384e-06 2.81584e-06
mircea_popescu: this is degree of magnitude off, somehow. wanna walk through the math with me ?
mircea_popescu: on the basis of the previous timings you reported, we estimated it ~2.8 microseconds
mircea_popescu: diana_coman the problem is this : on the basis of this last run, we're estimating serpent to take 0.3 microseconds.
mircea_popescu: there's something amiss here.
mircea_popescu: !Qcalc 1.259 / (2**22)
mircea_popescu: diana_coman i think it's plenty long. why not long ?
mircea_popescu: diana_coman how the fuck many loops are there ? 22 ?
mircea_popescu: !Qcalc 1.259 / (2**21)
mircea_popescu: !Qcalc 1.259 / (2**23)
mircea_popescu: diana_coman imo perfect. now do lj
mircea_popescu: asciilifeform i think her work above provides us with some useful data : it turns out it is reasonable to expect timings converge for measured intervals of at least 1/3 of a second, on the basis of the above.
mircea_popescu: turns out a serpent takes about 2.8 microseconds.
mircea_popescu: diana_coman try whole 23 loops, same 1 to 10 mod 4 plox ?
mircea_popescu: diana_coman seems it stabilizes after 3 loops or so, if you look, it's within a few % with .007s and pretty much there at 0.35s
mircea_popescu: !Qcalc (2**23)
mircea_popescu: !Qcalc (3**23)
mircea_popescu: !Qcalc (2**21)
mircea_popescu: !Qcalc (50**5)
mircea_popescu: mkay.
mircea_popescu: !Qcalc 879.95 / (50**5)
mircea_popescu: !Qcalc 17.74 / (50**4)
mircea_popescu: !Qcalc 0.351611073 / (50**3)
mircea_popescu: !Qcalc 0.007213758 / (50**2)
mircea_popescu: !Qcalc 0.000168893 / 50
mircea_popescu: this is remarkably fast!
mircea_popescu is very sorry about wasting a day. coulda done 30 seconds of figuring numbers BEFORE just as well.
mircea_popescu: yeah
mircea_popescu: diana_coman idea was to go twice per loop, rather than 1nce. 2 will go in too many times still
mircea_popescu: i might be the weakest person in the world for basic arithmetics.
mircea_popescu: diana_coman a through j ; for 1 to 10 mod 4 plox.
mircea_popescu: nuts.
mircea_popescu: !Qcalc 3 ** 10
mircea_popescu: !Qcalc 2 ** 21
mircea_popescu: !Qcalc 4 ** 21
mircea_popescu: diana_coman you'll have to abort it, reduce the loops significantly. sorry bout that.
mircea_popescu: !Qcalc 49 ** 21
mircea_popescu: !Qcalc 49 ^ 21
mircea_popescu: diana_coman darn, i utterly miscalculated it. does
mircea_popescu: somehow the whole http://btcbase.org/log-search?q=from%3Amircea+%22opposable%22 slash http://btcbase.org/log-search?q=from%3Amircea+%22opposability%22 item just not native to most heads.
mircea_popescu: i dunno, somehow it ain't easy to compute
mircea_popescu: for some reason i never named him in there.
mircea_popescu: ah ty!
mircea_popescu: might've been http://btcbase.org/log/2015-02-02#1002258 dork, but i can't fucking find no trace of it. ☝︎
mircea_popescu: BingoBoingo do you happen to recall a trilema article about some moronic "pick up artist" and his tedious adventure getting some 17yo i think it was to sorta-take it, after half a day of pigeoning ?
mircea_popescu looks forward lol
mircea_popescu: kinda hard to quantify
mircea_popescu: in ro the expression'd be rather negative, "i got nothing". cuz "o pula" works also as universal negation, "do you have any money ?" "i got dick"
mircea_popescu: hehe.
mircea_popescu: hey, good for you.
mircea_popescu: certainly seems to be emerging in that light.
mircea_popescu: i'm still waiting for diana_coman to return. ☟︎
mircea_popescu: http://btcbase.org/log/2019-02-12#1895584 << pretty sure. ☝︎
mircea_popescu: possibru. not clear at all what's going on in there.
mircea_popescu: http://bvt-trace.net/2019/02/gnat-zero-cost-exceptions-and-asynchronous-task-aborting/#selection-263.0-263.78 << rather agreed.
mircea_popescu: but seems he ALSO found a race condition in the handlers ? ☟︎
mircea_popescu: it doesn't seem so.
mircea_popescu: if there's a mechanism in computing that's supposed to be push not pull, that's exceptions. can't fucking have a pull mechanism for exception handling, and i see 0 gaisn from moving the honest braindamage of "if ZCX_By_Default then return;" into an elaborately & contrivedly hidden same exact thing.
mircea_popescu: re polling and in particular http://bvt-trace.net/2019/02/gnat-zero-cost-exceptions-and-asynchronous-task-aborting/#selection-197.0-197.47 : i fucking loathe the idea.
mircea_popescu: cool.
mircea_popescu: BingoBoingo if select thing worked you could just put that link in the !!billing
mircea_popescu: shorter experiments not statistically better still, irrespective of that nonsnese.
mircea_popescu: i agree!
mircea_popescu: asciilifeform sure.
mircea_popescu: i c@
mircea_popescu: there is that.
mircea_popescu: i do not believe larger experiment gets drowned. on the contrary, larger experiment ~drowns the churn~.
mircea_popescu: asciilifeform you propose the init=clock end=clock method no good ?
mircea_popescu: stops probabilistically eventually -- which seems a bad idea until you realise you get counts, can compare those.
mircea_popescu: basically idea is, a markov chain of callings. ☟︎
mircea_popescu: might need some fiddling to get the numbers right, this one might only grow still. but anyways.
mircea_popescu: asciilifeform something like : when called, procedure a increments global flag x and if global flag x is even calls b ; when called, b increments global flag y, and if global flag y is even calls a else calls c ; c increments both x and y.
mircea_popescu: BingoBoingo is the case i am actually postpaying rather than prepaying here and so early feb i actually paid for jan ?