log☇︎
13100+ entries in 0.126s
asciilifeform: yer harem aint a uniform hat pick from the set tho
mircea_popescu: i do not dispute that the exercise is not worth doing, unless one has a girl nose fetish. nevertheless, worth doing is a different consideration from true. ☟︎
mircea_popescu: there, again there is not a mathematical proof to permit you to say -- if i say "the largest contiguous set of consecutive liars before number n will contain k such liars where k = n divided by alf's gf's nosehair count" there's no formulaic approach you can fall back on. you'll have to take the girl by the nose, count, and break out the abacuses.
mircea_popescu: the bound presumes a flat spectrum rng and properties of large sets of random numbers that ~have not been proven~, though they are experimentally VERY reliable.
asciilifeform: correct, the bound presumes a flat-spectrum rng.
mircea_popescu: this is not what i'd call "crackpottery". for all you know there IS a manner to construct "~always lied about by random witnesses" prime candidates.
mircea_popescu: asciilifeform, as to your earlier question : not such a large degree of crackpottery needed. consider that if i affirm today that a) given a list of however many ~randomly chosen~ witnesses from (1,n) b) the number k = x^2 + q x + p is going to be falsely identified as a prime number while n = q ^ 2 + p ^ 3, there is c) nothing you can practically do to give me the lie other than ~actually construct such numbers and check~.
asciilifeform: ( or, to be pedantic, 3 from a 4th )
asciilifeform: from a 5th
asciilifeform: to the point that i'm at a loss to construct a crackpot hypothesis for the negative ( what would the loch ness monster here look like ? erry composite n, we know has 3+ / 4 of integers as proper witnesses. so where wouldja hide'em so that working rng doesn't find 1 in 32 shots before asteroid hits machine ? )
asciilifeform: all we have is the http://btcbase.org/log/2019-03-28#1905286 ( from elementary proof ) + the observation that nobody ( or at least not asciilifeform ) has ever found a composite that doesn't properly light up m-r 'composite!' indicator for 3+ / 4 rng stabs. ☝︎
mircea_popescu: asciilifeform, i don't disagree a is the correct way ; but i am pointing out we do not actually have math to point to here. for all we, properly speaking, know, http://btcbase.org/log/2017-07-18#1686299 eminently applies. ☝︎
mircea_popescu: in any case, it seems to me that the a witnesses MUST be generated as rng(0, 2^4096) rather than rng (2^4095, 2^4096).
mircea_popescu: asciilifeform, possibly a is actually significantly weaker than b. i dunno, intuitively i'd readily agree with you, but the fact is ~we don't know~.
a111: Logged on 2016-09-11 22:50 asciilifeform: it is foolish to design for 'what if my rng silently fails'. it is a 'jesus bolt' failure
asciilifeform: when we 1st had m-r thread, i also considered a hybrid algo, where you take e.g. 32 rng witnesses, and 32 that are kept in bottle and known only to you , for 64-shot test that is slightly moar immune to rng failure. but then thought 'rng is jesus bolt, if fails, yer candidate is also fucked' so couldn't think of why to do such a thing.
asciilifeform: whereas if you actually lift 32+ rng witnesses from a working rng (as in asciilifeform's demo, or diana_coman's proggy, and elsewhere where not koch.. ) actually converges (for so long as you actually have working rng)
asciilifeform: mircea_popescu: possibly i'm thick, but what does b win ? seems like any hardcoded list, if becomes known to enemy, opens you up to theoretical 'bake a n for which the witnesses are liars' item
mircea_popescu: type a has the disadvantage that possibly we end up with worse witnesses, and type b has the disadvantage that possibly lists of n to which our known list of candidate witnesses is blind to may be also constructed in advance.
mircea_popescu: the ~only question that actually needs an answer is whether a) a selection of n random numbers b bits long made every time a candidate prime is checked for compositeness or b) a pre-given list of prime numbers b bits long among which n are randomly picked each time a candidate prime is checked for compositeness is a better approach towards checking a candidate prime for compositeness.
diana_coman: I had it in my stash from writing eucrypt time so it rang a bell instantly
mircea_popescu: "Digg Inc., a social-media pioneer once valued at more than $160 million, is selling for the deeply discounted price of about $500,000, three people familiar with the matter said." << back in 2012.
mircea_popescu: afaik it's internally organized much like the "car battery" : a buncha half-liter cells inside a lined tank
asciilifeform: rright but generally you would not want a bottle of 800atm on a boat that might have to live with depth charges nearby etc
mircea_popescu: the engines won't go very far on it (in no small part because it';s almost never taken to ~water density, ie, 800 or so atmospheres) ; but there's still a lot of air that can be fit in some not-so-huge tanks.
asciilifeform: there was a sovok train engine with no boiler . for last-mile into factory with combustibles. filled with steam, off-site, went for ~40min after.
mircea_popescu: nothing wrong with keeping a spare sat or radio connection. or both i guess
mircea_popescu: trinque, as it happens i was gonna do a buncha small payments, but deedb ot not answering to !!withdraw ?
asciilifeform: a healthy biped can put out 100+ watt , sustained, on bike
asciilifeform: so conceivably you dun need a gigantic hamster wheel, could rewire ordinary bike thing
mircea_popescu: im totally gonna look into this. what's the big deal, a generator and some welding.
mircea_popescu is contemplating having a generating cage made.
trinque: hey folks, just a heads-up that castle trinque is running on batteries atm due to a blown transformer. wallet will be around while batteries last, after which we'll be awaiting the mains.
asciilifeform: incidentally, and for thread-completeness, gotta add, for certain patterns of failed m-r sequence , you end up with output that gets you a factor. this item is actually on the phuctor conveyor, when i get a free hand to crank it again
asciilifeform: it's what i distinctly recall from that piece, will revisit when i dredge up a copy
mircea_popescu: but i don't have all that great a "whu"
mircea_popescu: yeah ; more properly : there is a class of numbers that are both carmichael numbers and strong liars.
mircea_popescu: moreover, it's likely that a set of 100% consecutive liars of arbitrary length can be found.
mircea_popescu: asciilifeform, the problem with that 3/4 figure is that it's ~an average~ (obtained by a very trivial calculation). there's no known way to evaluate the statistical divergence over a finite set.
mircea_popescu: another piece of the puzzle is that while small numbers are ~perfect~ witnesses for up to a certain value, they become terrible witnesses thereupon, which is why small witnesses are useless in crypto
mircea_popescu: but even taking a small selection among these to produce a sieve, and then churning a bunch of composites through it, might produce some lulz.
mircea_popescu: the http://btcbase.org/log/2019-03-27#1905222 item is relevant, because if you were to enumerate the pairs you'd be looking at 20mn!/2!(20mn-2)!, which is truly a staggering nuymber, of possible liars of a size up to 10^40 ☝︎
asciilifeform: what'd be interesting is to find algo that bakes a large composite n , and shits forth arbitrary # of 'plausible-looking' large but false witnesses
asciilifeform: iirc i saw this item at some pt, and fella really did bake a p that 'passes m-r' for buncha ~small~ bases
mircea_popescu: (bases of a)
mircea_popescu: dood actually lists a 400 digit number to which ~300 items are strong liars
mircea_popescu: finding the nontrivial square roots of 1 modulo n is a hard problem ; but constructing some is not. anyway, not right now in the best form to go through archives but will see to this.
asciilifeform: mircea_popescu: the operative diff is, 3/4 is lower bound. i.e. there aint a composite where 3/4 of the integers aint proper witness.
mircea_popescu: in fact m-r is a sorta upgraded fermat
mircea_popescu: there is ~some~ overlap between carmichael and m-r (eg 1729 is a pretty reliable flase witness).
asciilifeform: then can say 'enemy who fed you a magic p, and then 32 selected witnesses, can lead you off cliff'
mircea_popescu: ima have to dig this up, pretty sure i read up on this (very limited) mewthod of constructing m-r false witnesses for a two-primes product.
asciilifeform: q is whether there is a better algo
mircea_popescu: yes ; but by analogy i expect it's possible you have some m-r liars up to the large (4096 bit is a large number) numbers we're dealing wqith
asciilifeform: i.e. if you run somehow 1 per sec, will eat a coupla dozen moon-size asteroids prior to getting misfire..
mircea_popescu: whole tower of shit's derealizing at a shocking rate.
Mocky: I may end up having a follow up vpatch for mpwp as well
asciilifeform: i also built at various points on a heathen i7 (2.8G) and there runs ~2x faster across the board, ftr
diana_coman: on that d1 intel from http://ossasepia.com/2019/02/28/zcx-vs-sjlj-data-set/#selection-113.0-113.85 the tests of eucrypt that generate a key pair take at times ~20 min, just to give an idea ☟︎
asciilifeform: 'A relatively short test run obtained 40 random primes of 2048 bits each in 13274 seconds in total (3.7 hours) meaning on average 331.85 seconds per prime (~6 minutes).'
asciilifeform: tbh i cannot however think of when or where i would say 'ugh, 10min is too long for baking a 4096b key'..
asciilifeform: the carryaway is that ( with operating fg ) it'll take <2min to bake a 4096bit key .
mircea_popescu: i dun see the problem, so it takers a minute. current gpg takes as much, and ssh which doesn't is sucja cryptojoke as to not be worth the mention.
asciilifeform: if the q returned a null, not problem, lol
asciilifeform: in other noose ! http://p.bvulpes.com/pastes/6rnvA/?raw=true << prelim. smoke test of ch18 example 2048b prime gen. http://p.bvulpes.com/pastes/USsFD/?raw=true << sample output with timing. all the primes pass on e.g. wolfram's , if anyone has a favourite 3rdparty litmus, plox to try also when ch18 posted.
mircea_popescu: a ok.
grangerstranger: im a magical being
mircea_popescu: grangerstranger, what do you do for a living and why are you here would be decent starting points.
mircea_popescu: it was a fleeting momentary thought! such as occurs in my box occasionally! i'm not proposing marriage over here!!1
mircea_popescu: "My friends: We really need to start talking nicer to eachother 4 minutes later: “You really are a stupid ass bitch”"
mircea_popescu: easy enough to check, on the other side. but yes, chick's a cut above the usual dickowsy.
mircea_popescu: diana_coman, there's a pronstarlet the naming reminds me of.
diana_coman: re grangerstranger it's really that those never talking actually are ghosts even if poked? what a surprise
mircea_popescu: diana_coman, word. it's more a thing for something like mp-wp, which is a sort of enduser app so to speak, than something like eucrypt that's basically a library, or in any case a building block intended for use in forging.
diana_coman: a fork not a for, lol
diana_coman: mircea_popescu: fwiw everything I published v-versioned has the tests included as a subdir with its own .gpr file and all that; I'm not sure a fork of the V-tree is really needed for this (i.e. deleting a whole dir is easier than maintaining a for as far as I see it atm).
BingoBoingo: The extremes were more extreme back on the plains of old country, but here the baseline level of air movement is quite a bit higher.
BingoBoingo: <mircea_popescu> (i kinda suspect BingoBoingo would do a lot better with a partner on the grounds, tbh) << I suspect similar ☟︎
mircea_popescu: same goes for whoever else has a good testing suite for whatever they're maintaining : publishing a "devel" branch, including testing and whatever else tooling in that vein is certainly a legitimate use of forking the v tree.
billymg: a freshly pressed copy of the divergent patch found here http://btcbase.org/patches?patchset=mp-wp&search= has been running on my blog since sunday though
mircea_popescu: and for the rotaku club : https://ro.wikisource.org/wiki/A_zecea_muz%C4%83 (one of caragiale's best satires, utterly destructuring "modern" world.)
Mocky: I had a dream 3 nights ago that I walked down a row of 4 houses and banged on each door as I went past yelling "send our your oldest girl" and the doors all opened and 4 female lions came running out as if to chase and attack me. But I stared them down and told them they are with me now. Apparently they were talking lions because they all said "ok" and then followed me as I walked off.
Mocky: "go to qatar" "start a church" ... crazy shit I tell you
mircea_popescu: the place is quite ripe for it, on one hand lots and lots and lots of useless and idle youth, on the other hand large paper fortunes desperate for some protection. can very well get paid to "protect the household" while selling tickets to rape the wife, it's 100% a opera buffa sorta sittuation.
mircea_popescu: item crumpled over absent grassroots. not that it's hard to remedy : get a church registered, organize donation campaigns, get some real estate and run events off it, there you go.
mircea_popescu: the context was, some farmers were disputing usg's territorial claim, and it'd have been a decent opportunity for some keks. free beer, collegiate sluts, get a party going, let the landsknecht deal wirth it
mircea_popescu: (i kinda suspect BingoBoingo would do a lot better with a partner on the grounds, tbh)
mircea_popescu: well, mid term is mid term, what, three, five, ten years. none of the items described there are longer commitments anyway, you can totally get a church going in the mid term -- if it goes anywhere i'm sure there'll be who wants to take over if / when you feel like leaving.
Mocky: I did. And now I'm going to find a way out that doesn't involve poverty.
mircea_popescu: well, im not sure i follow what;s going on, but didn't you execute a 1. i must pay dubaloos so and so a month to landlord therefore -> 2. i must take job in empire and thus logically -> 3. gotta live there ?
Mocky: I am serious about finding a way out of mordor. I'm interested in both tech & non tech hole filling: giving the matter due consideration so as to avoid http://btcbase.org/log/2018-06-21#1828117 ☝︎
mircea_popescu: ie, there's a lot both tech and non tech holes to fill.
mircea_popescu: rly as a church and all that line).
mircea_popescu: other than that, a) if you'd rather mostly deal with c legacy codebase you could also work with diana_coman on an eulora client ; b) if you'd rather do evanghelism work the original job in the http://btcbase.org/log/2019-03-19#1903518 line is still open -- you could work to advertise your castle in heathenworld (leverages pizarro directly ; and if you're serious about not leaving the ushithole you can incorporate it regula ☝︎
a111: Logged on 2019-03-26 21:31 asciilifeform: i'll add that even a tcp skin wouldn't be entirely useless ( right nao the only way to write a wwwistic proggy in ada is to use adacorpse's 'gnatsockets' crock of shit )
Mocky: ada sounds good. I'm not sure if db wrapper is a good starting point though, maybe work up to it
mircea_popescu: Mocky, pressing something's a good idea, for sure, even if it's just some patches on mp-wp chain say.
asciilifeform: !A @aa@.7:[a].1-",_; @bb@.5:[b]!.1-",_; .3:[c]!.1-",_
asciilifeform: !A @aa@.7:[a].1-",_; @bb@[b].5:!.1-",_; .3:[c]!.1-",_
asciilifeform: !A @aa@[a]; LC @bb@[b]@aa!; RC @aa!