spyked: mircea_popescu, last line? also, no, haven't spoken to him. my idea was to just post this on blog and then ask him if he's willing to translate (refer log and so on). could also do it the other way around, not sure.
mircea_popescu: in your paste, last line, "These would be, dear local investors, a few specific"
mircea_popescu: and your idea is not good. first you talk to him in principle, then you do the script, then etc. cinema has a flow!
spyked: but will drop teleschpenker a line and ask him if he's interested. (also, his rates, if any. from my pov the text is public and so on, I'm not exactly in the translation profession)
mircea_popescu: bwahahaha "The agency regarded as the worlds leader in breaking into adversaries computer networks failed to protect its own." what, is this from "the fake news site regarded (by itself) as the most influential item in the world, above even trilema, and staffed with people from the premiere (according to themselves) institution in the world" ?
asciilifeform: linked item looks rather familiar -- ancient usenet meme
mircea_popescu: next they're going to win the world series, these people.
a111: Logged on 2017-10-01 04:06 mircea_popescu: "If pet food companies used the same business model as startups: Jim creates a dog food factory and gives away dog food for free. 450 million dogs line up for free dog food. Purina Dog Chow understands that non-paying dog food consumers are currency, and buys Jims factory for $42 per dog." << in other historical elaineo lulz.
mircea_popescu: T.A.O. operators must constantly renew their arsenal to stay abreast of changing software and hardware, examining every Windows update and new iPhone for vulnerabilities. The nature of the business is to move with the technology, a former T.A.O. hacker said.
mircea_popescu: if only ants could speak they'd be no less entertaining.
spyked: http://btcbase.org/log/2017-11-13#1736972 <-- I did follow in read-only mode. (and unfortunately suspecting that I will continue to do so until upcoming vacation, when I can start doing ~actual productive work) the principle being, I either read daily, or logs pile up and I fall continuously out of sync. (almost happened last weekend!)☝︎
a111: Logged on 2017-11-13 00:10 mircea_popescu: apparently this magic wand works so why noit shake it s`more :D
asciilifeform: ( was a somewhat different animal before pc comp . split b/w actual signal-gathering , bug-plantin', supplying idjit hagelin crypto boxen to ~every major country, etc )
a111: Logged on 2017-11-13 00:14 hanbot: spyked i lolled; also "use the remaining to produce milk for four cows." might be better stated as "use the remaining to produce four cows' worth of milk." or similar
asciilifeform: iirc nsa was first publicly proclaimed by usg when marvin&mitchell escaped.
asciilifeform: 'The NSA immediately began searching for other sexual deviants in its ranks, eventually purging 26 employees suspected of being security risks because of their alleged "perversions."' prettygreat.
mircea_popescu: jsm. could come with a handy "pronounciation guide", which the sort of tard outfits listing "evanghelist" and "at large" on their "Careers" page always include in their god-awful "phonetic" pigdin i mean peeg-deen
mircea_popescu: asciilifeform honestly, i believe there's 0 expectation on the part of us army that anyone under that flag will ever fight again. "you wanna shoot, join the police wtf! army is for "assisting local combatants"
a111: Logged on 2017-01-27 23:36 asciilifeform: (i was once, and i shit thee not, 'research chemist'. not because knew any chemistry, but because there was -- i shit thee not -- no box to 'tick' in the form, for 'programmer')
BingoBoingo: asciilifeform: What more is there to say, Spent good chunk of the day learning from the weapon of mass destruction in my passenger seat.
BingoBoingo: In other mine chaff: "What the fuck… that is the most messed up thing I ever read. I am not European just because I have white skin, you sicko. I do not relate to the experiences of white people, why would I identify with them? You probably have an inferiority complex and feel the need to pretend you’re white because you hate yourself."
BingoBoingo: "Instead of fetching your slippers they’ll shit on them without remorse, as if keenly aware that ruining your property would be insulting to you. Instead of sleeping next to you, ready, and waiting in guard position, they will find a comfy spot squarely on your forehead, burrow down and screech to high heaven if you motion to remove them. Rinse and repeat they will, despite many deserved beatings. Brats."
mats: "And we are pushing robots to the limit in terms of the speed that they can operate at, and asking our suppliers to make robots go way faster, and they are shocked because nobody has ever asked them that question. It's like if you can see the robot move, it's too slow. We should be caring about air friction like things moving so fast. You should need a strobe light to see it. And that's incredibly critical to CapEx☟︎
a111: Logged on 2017-11-13 04:46 mats: "And we are pushing robots to the limit in terms of the speed that they can operate at, and asking our suppliers to make robots go way faster, and they are shocked because nobody has ever asked them that question. It's like if you can see the robot move, it's too slow. We should be caring about air friction like things moving so fast. You should need a strobe light to see it. And that's incredibly critical to CapEx
asciilifeform: the 'tecan evo' i worked with ( small industrial gantry bot ) could make fully 100x faster motions than vendor recommended . BUT -- 1) the default winblowz turdware ( that afaik every installation other than mine, used , lock stock etc ) would result eventually in smashed equipment, dead bearings, and possibly injured meat and ..
asciilifeform: just because thing can 'move faster than you can see' dun mean that it stops on a dime, or that it won't oscillate ( ever see rifle barrel on high speed camera? ) , ring like a bell, destroy whatever illusion of accuracy.
asciilifeform: this is an entire field, i cannot begin to sum it up here. but even in 19th c machinists understood 'fast cut xor accurate cut'
asciilifeform: as for 'critical to capex', vey rarely is robot the chokepoint in the line.
asciilifeform: if actually care about capex -- speed up, or better yet, eliminate -- the ~meat~ in your line.
mircea_popescu: in other news : it was established in teh minigame torture rooms that in point of fact 4096 bit keys contain only 4090 bits of entropy at the very most (minus whatever koch-gpg manages to shave off in other ways).
mircea_popescu: the reason is that (in a translation of what koch-gpg does into sanity) you take 2045 bits of rng for each possible prime, stick 11 in front and 1 in the tail and THAT is your 2048 bit prime candidate.
mircea_popescu: the reason you stick the 1 in the tail is to ensure odd numbers -- large even numbers are never prime. this much is a math-forced reduction.
mircea_popescu: the reason you stick the first 1 in the front is, evidently, to not end up with sub-4096 Ns☟︎
mircea_popescu: the reason you stick the 2nd 1 in front is, not evidently, also to not end up with sub-4096 Ns : if you had the exceptional case of your primes being each 2^2047 + 1 your N would then be 2^4094+2^2048+1, which is shorter than 4096 bits.
mircea_popescu: this is evidently a "loss" of entropy, in the sense that what is advertised (4096) differs from what is actually delivered (no more than 4090). i am of a good mind to start calling them 4090 bit keys tbh.☟︎
diana_coman: p and q are different so there won't be exactly this limit case there, but obv same 4095 bits n instead of 4096 for other low-enough odd numbers that might be primes
mircea_popescu: anyway, back to rsa discussion : there's about 6.5e612 primes in the interval 2^2045-1, 0 (by teh prime number theorem). every key needs a pair of these, and no number can EVER be repeated (if it is -- phuctor breaks both keys).
mircea_popescu: the chances of such repeating happening naturally'd be ~the inverse of ∏(1 - 2i/6.5e612), 1<i<n where n is the number of keys ever made. fortunately this evaluates to "never" on all extant iron.
mircea_popescu: this is not "true for very many keys like a billion trillion keys". this is true all the way up, by the time one's made 10^609 keys we're starting to get into five-nines assurance of unicity.☟︎
mod6: <+mircea_popescu> in other news : it was established in teh minigame torture rooms that in point of fact 4096 bit keys contain only 4090 bits of entropy at the very most (minus whatever koch-gpg manages to shave off in other ways). << uugh. every time we peel a layer back...
a111: Logged on 2017-11-13 11:43 mircea_popescu: this is evidently a "loss" of entropy, in the sense that what is advertised (4096) differs from what is actually delivered (no more than 4090). i am of a good mind to start calling them 4090 bit keys tbh.
a111: Logged on 2017-11-13 12:44 mircea_popescu: this is not "true for very many keys like a billion trillion keys". this is true all the way up, by the time one's made 10^609 keys we're starting to get into five-nines assurance of unicity.
asciilifeform: 'Tesla’s CEO seems to be fully unaware of why industrial robots have limits, affecting actuators, speed and precision when handling heavy parts reliably and minimal downtime. Air friction is certainly no constraint, but moments, acceleration and deceleration. '
a111: Logged on 2017-11-13 05:11 asciilifeform: so it is quite in keeping with this, for it to , say, pioneer 'robot works in vacuum, and moves without hindrance of air resistance, ReallyFast!' etc
asciilifeform: re the rsa key entropy, it is possible to trivially regain the lost bottom bits' worth of entropy -- you save the discarded bits and use them later as triggers for 'take nextprime(p) instead of p' and 'take nextprime(q) instead of q' . there may be other possible algos
a111: Logged on 2017-11-07 16:36 asciilifeform: let's model the ideal prime-shitter. it would be an item that takes integer N , of whatever bitness, and produce the Nth prime ( or eggog if the Nth prime is bigger than the register bitness permitted. )
asciilifeform: actually yer not missing anything, above algo is an absurdity
asciilifeform: it will do exactly same thing as traditional one, but take 1000x as long.
mod6: when you say 'lost bottom bits' worth of entropy -- you save the discarded bits and use them later', are you talking about the highest order 2 digits, and the lowest 1, saving their original lower-order half and using that?
a111: Logged on 2017-11-13 17:47 ben_vulpes: and in ancients, dusted off mpfhf benchmarker, finished the bit-banging of inputs, fired off a run late last week that is *still hashing*
a111: Logged on 2017-07-06 00:26 asciilifeform: S grows by 1 or 0 bits per cycle.
a111: Logged on 2017-08-15 22:51 asciilifeform: but instead flipping a single bit that gets xored with the result every time you read from the would-have-been-flipped reg.
asciilifeform: though asciilifeform will admit to still being at a loss re what the appeal is , after these...
asciilifeform: but if you want to make a fast mphftron, for experimentation, the recipe is 1) compute upper bound of the scratch space length and preallocate. NEVER realloc 2) NEVER flip-all-the-bits, flip a 'did-we-flip' bit instead, and the latter always get xor'd with whatever bit you read from the flippablespace.
ben_vulpes: asciilifeform: absolutely, have a benchmarking in place, will be implementing those two changes and recording improvements
phf: http://btcbase.org/log/2017-11-13#1737247 << it looks like a properly structured scheme evaluator, but it's ~explicitly~ lacking a native cons, which might be a very good exercise for whoever™ adding a static allocation space, adding mark-and-sweep, then all those To_Unbounded_String look like they can be simply search/replaced☝︎☟︎
a111: Logged on 2017-11-13 18:13 asciilifeform: use Ada.Strings.Unbounded; << mno ben_vulpes this is ~specifically~ a Do Not Want
phf: somewhat relatedly one handy thing i saw on CADR is named cons regions, i.e. explicit memory regions where you can cons and every allocation function having a *-in-region equivalent, like (cons-in-region x y region). i'm not sure if that's there, but you presumably can do some kind (with-cons-region (region ...) body) thing. naturally those regions can be saved (preserved referential integrity) or cleared, etc.
phf: the array instead of pointers approach gives you free save (in fact you can run it against a mmaped region and have a ghetto core file)
phf: asciilifeform: i'm using "memory management" meaning of cons, not like lisp 101 take on it. they don't have cons meaning that there's no managed heap, there's no gc on that heap, and you can't allocate things into the heap and let it be managed by heap machinery. so they have "cons", but their ~actual~ cons is ada's "new ..."
asciilifeform: to put it in libctronic terms, the resulting linux binary will call setbrk() ~exactly once~ in its life
phf: right, so that scheme.adb would benefit from a way to cons onto an arbitrary sized array, and then later someone can bolt a gc on top of that. can even implement it as an explicit function call rather than a threshold thing
asciilifeform: imho it dun particularly make sense to have gc in this application
diana_coman: I can't seem to find in the logs any discussion re duplex construction/duplexing the sponge i.e. keccak's authors own proposal of using keccak for authenticated encryption; did anyone look into this?☟︎
diana_coman: yes; but it's unclear if a simple bitfield xor is best option
asciilifeform: for so long as you're actually using otp (i.e. 1 byte of key used for exactly 1 byte of payload) it's the only logical option
diana_coman: I meant the choice of specific, concrete way to expand the original bitfield i.e. "reuse the otp"
asciilifeform: how atrociously slow does the 'never reuse' variant look ?
asciilifeform: if you use actual one-time -- you then dun have to reinvent symmetric ciphering
diana_coman: heh, true that; I think first trouble there is that "never-reuse" choice means "no-knob" for client who pays however for the traffic; the whole point was precisely to let player choose their own level of compromise between cost and security (otps are generated on the server for good reason)
asciilifeform: the boojum is that neither i nor anybody else knows of any rational way to quantify the compromise.☟︎
asciilifeform: ( we dun have a scientific approach to symmetric ciphering. )
diana_coman: yees, but conceivably there might be one in the future; if no knob then no point as it were, entirely
a111: Logged on 2017-10-06 23:13 mircea_popescu: basically the scheme is, you rsa a random bitfield, then you expand that into as much otp as you want by doing recursively Fi = hash(bitfield + Fi-1). there's a limit on i, obviously, which can be set to 1.
diana_coman: at a first pass this duplex thing based on keccak seems to be a similar attempt really, hence my question if anyone looked at it more closely (I'm still trying to fully grasp it, not there yet)
asciilifeform: as i understand, ordinary keccak suffices for this scheme
asciilifeform: ^ pheeature idea : why not have ticker autofire when the number moves >10% from last tick☟︎
asciilifeform: meanwhile, in very vintage lulz, https://archive.is/I5JC0 >> 'Secretary of State Baker said Washington would not object to military intervention in Romania by Soviets or the Warsaw Pact.'
asciilifeform: 'The Chinese miners were instructed to continue mining the coin, even at great financial loss, to support a pretension of value and use, minimally sustaining its life. When the price troughed, those who were in the know about the plan accumulated it in large quantities' etc.