76700+ entries in 0.056s
mircea_popescu: asciilifeform there is that, yes. but we're doiong this for instrumentation in teh lab not for any other purpose. it's a tracer for entropy, like the shit they make you swallow to see your stomach.
mircea_popescu: as in, balance it according to a calculation, rather than according t oa feeling.
mircea_popescu: which allows you to correctly balance your tester irl.
mircea_popescu: in a sense. it has multiple utilities, it allows you to try and guess (numerically) whether for instance better entropy or more passes are useful for rabin miller
mircea_popescu: then we feed it into entropy-dependent processes (say the rabin miller test, as discussed yest) and see what comes out.
mircea_popescu: M' is now a "known low entropy bitfield". we know it to have degraded by 100/1Mb or w/e the case may be
mircea_popescu: produces a bit-addressable array of 1048576 bits from FG
mircea_popescu: let M = FG[1Mb] ; let P = rnd(0, 1Mb) ; let M[P..P+100] = 1.
mircea_popescu: ben_vulpes here's a high pay grade question for you : of the two models of "controlled de-entropy" i spawned in a week, specifically a) count of randomly placed flipped bits, as in the discussion with you re that and b) string of randomly initiated, n bit long SET bits, as discussed in
http://btcbase.org/log/2017-07-10#1681268 which does the bitcoin foundation regard as a better candidate for standardization as "the republic'
☝︎ mircea_popescu: karpeles and carl force "trials", parallel lulz constructions.
mircea_popescu: "As recently as earlier today, the Fake News empire turned idiot son Donald Junior's gullibility with respect to a phishing scheme1 into their latest headline of the day which they will use to sell loyal consumers of their fiction product on the "certain end" of the 8 year Trumpreich in spite of all the actual evidence running to the contrary of their narrative supported instead by a complete lack of evidence."
mircea_popescu: it should not take the average artist a year of labour to produce the optorsatron out of cheap lasers and stuff ~free in any collegiate lab, once he's stolen the unrolling and idea from log.
mircea_popescu: asciilifeform incidentally, unrelatedly and idly : an optorsatron might also be built if unrolled.
mircea_popescu: aka "you can not fix a computer by simply rebooting it without any idea what's going on" moonism
mircea_popescu: which suggests the very important point : bitewise equality over the result space is not sufficient proof of program equivalence.
mircea_popescu: just as should be. first spec code then optimized code
mircea_popescu: moreover, if you do fixed as described, you CAN so unroll, if you do or if you don't.
mircea_popescu: but unrolled loops you can bake in your alfmachine we were discussing last week
mircea_popescu: ~same as the relation between pointer and its content, "better hope programmer didn't fuck up ; and also it usually blows up if he did so there's that"
mircea_popescu: what particular can i prove re the relation between an array slice and the index fixer variable ?
mircea_popescu: i am sitting here wondering if this is "getting rid" as in, rid or rid as in, hid.
mircea_popescu: wouldn't it be actually proper to copy the slice into its own array and to maintain a pairing of slices and new arrays ; rather trhan do index magics on the mult code ?
mircea_popescu: wouldn't it actually be proper to copy the slice into its own array ?
mircea_popescu: i realyl don't like this "and now we magic-variable the numbers". it's one step up from magic constant
mircea_popescu: got all this iron, let's do dumbass bayesianisms on it, instead of you know, what people correctly did up to the 90s or so.
mircea_popescu: it's generally a pity people don't use numerical methods more.
mircea_popescu: there is no gold standard to which you could compare the gold standard ?
mircea_popescu: asciilifeform by my lights, exact answer re prime distribution prerequisite to trivial factorization of rsa.
mircea_popescu: i would very much like an exact bound, rather than an exact solution
mircea_popescu: they have the p k, 1 < 4 ** (2 - sqrt(k))* k**2 , which is useful, but i also want the p k, m
mircea_popescu: asciilifeform i had actually read this text, though pretty sure not in this paper. but i recall the 100,10 bounds etc
mircea_popescu: could also be derived mathematically, but so far've not managed to.
mircea_popescu: which incidentally brings us to a very workable and very useful tmsr definition of entropy quality : take a FG string. flip a number of consecutive bits to 1. the result is your entropy quality, such as 100/1mb if you flipped 100 bits.
☟︎ mircea_popescu: ie, is the relative impact cuadratic or subquadratic ?
mircea_popescu: asciilifeform that's another thing i would like : a graph of the relation of the m-r failure rate to the a) entropy quality and b) margin.
mircea_popescu: it is entirely acceptable for proper keygen to take up to a few hours. 200 seconds is actually exceedingly fast.
mircea_popescu: (yes this yields keys slightly longer than 4kb. good.)
mircea_popescu: ^ very specific what a key is. not "interchangeable p and q"