PeterL: mircea_popescu: but encrypting the r to one key and the r xor m to a second key, so you end up with two rsa-key-length segments
asciilifeform: ( i will also note, the problem with allowing packet fragging is that frag reassembly is a Something-To-Allcomers operation . )
mircea_popescu: PeterL what is the scheme contemplated here, that you take a say 8 byte message, generate an 8 byte r, then create a 16 byte padded message by appending the r and the r xor m and then rsa that ?
PeterL: which would mean using keys of half the size, right?
asciilifeform: ergo if you want to use the xor padding algo, you are stuck with payloads of half the size.
PeterL: please, help me see the flaw?
PeterL: and my scheme splits messages into r and m xor r, so I need 1024 bytes to pass the smallest message, which is already larger than the UDP "unfragmentation limit" of 512 bytes, so why stop there and not just let the message get longer by adding in some more chunks?
mircea_popescu: (the precediny line was 146 characters, which is less trhan 146 bytes, especially if you do a lzw or something like sane people first)
mircea_popescu: PeterL and as asciilifeform aptly points out, this happens to be convenient, because it's right around the size of the nonfragmenting udp packet.
deedbot: http://qntra.net/2017/08/bitcoin-network-mining-diffficulty-up-7-32-to-another-all-time-high-in-first-adjustment-after-roger-ver-ified-fork/ << Qntra - Bitcoin Network Mining Diffficulty Up ~7.32% To Another All Time High In First Adjustment After Roger Ver-ified Fork
mircea_popescu: and so thereby a 4096 bit key can handle chunks of up to 512 bytes of message.
mircea_popescu: right, solving will only find the lowest anyway.
mircea_popescu: you mean, the modulus, p * q ?
PeterL: so each character must have a value less than the n it is using, right?
PeterL: because the decryption is also a calculation mod n
mircea_popescu: that the result is smaller than n is of no consequence to you is it.
PeterL: alright, so my scheme pads everything to the length of the key, but as I understand it still has to be smaller than the key n?
mircea_popescu: but in any case, the point is -- rsa is not better for shorter messages. for really short messages it can be really shitty. which is why my 256 minimum bits in the padding scheme.
mircea_popescu: PeterL yes, there is that. larger e provides some protection agaisnt this issue.
mircea_popescu: that's what i meant earlier with the e-root. if say your key is 1024 bits, and your exponent is 3, and your "encrypted" message is, numerically, 1404928, i can readily extract the cube root and find the original as 112.
mircea_popescu: now, intuitively, would you imagine this worked at all if the string was so short it never fully wrapped ?
PeterL: alright, so the decryption relied on having an identical physical object?
mircea_popescu: basically they had this early elliptic curve crypto, implemented as an arbitrary cone on which they wrapped a string. because the string is fixed length see, whereas the section of cone is not.
mircea_popescu: i mean actual strategoi of the ancient greece.
mircea_popescu: well cesar was a roman, wasn't he ? the "technologically advanced" dorks that took the sail tech of the people who sailed from sweden to south africa and made some square sailed tubs that sunk in the mediterranean half the time.
PeterL: not really, the ceasar cipher or something?
mircea_popescu: PeterL can you tell me anything about what the greeks used for encryption ?
PeterL: c^d mod n = m, therefore m must be smaller than n?
mircea_popescu: PeterL let's get back to cogency here. how did you come to the "512 rsa packet limit" ?
mircea_popescu: PeterL how did you come uop with the 512 value ?
mircea_popescu: im guessing i'll be taking ads in the local newspaper, "looking for lawyers willing to sue the government, apply within".
mircea_popescu: b) they want to... "know your customers". bitch, it's none of your fucking business ? uh no, because ley so and so say so.
PeterL: well, udp packet is alot bigger than the 512bytes that fit in a rsa packet, why waste all the space?
mircea_popescu: in other lulz, /me went to open bank account today. you can not BELIEVE how fucking pussy whipped these people are. a) bank's only wire intermediary is bank of america. why ? uh... that's what the other banks do too. but... why ? umm... is it because you schmucks are a us colony, in the sense you don't get medicare and they still get all your shit anyway ? uhhhh
mircea_popescu: because udp packets if nothing else ; besides "longer" is not the same as endless.
erlehmann: mircea_popescu it feels like work. i had that experience a few minutes ago, when i explained to a rando on the train the concept of non-existence dependencies.
mircea_popescu: PeterL the cutting into chunks should happen prior at some client level. it's ok if your think accepts no messagtes lonmger than x. irc doesn't either.
PeterL: so for longer messages, they will get cut into chunks. It it better to check the first chunk until you find the right key and then use it to dercypt the whole message, or do you want to decrypt the whole message with every key (to hide the fact you found a match)?
mircea_popescu: don't even have to, but consider the context. yes "it's what rsa is", that's what i'm checking, that he knows.
asciilifeform: ( while otherwise quality hash. my current favourite for this is keccak's hash )
asciilifeform: requirement for H is more or less the opposite of mircea_popescu's hash exercise -- it gotta compute in fixed time.
asciilifeform: ( importantly, the fact of said discard must not be discernible through timing side channel )
asciilifeform: you have a substring S in every packet, that gotta equal H(rest of the packet) or whole thing discarded.
PeterL: I am still learning here, the last time I came and said "how do I know if I have used the right key to decrypt it?" nobody suggested a checksum, now I will try to figure out how that would fit into the program
asciilifeform: where there is a ready-made 'shoot yourself in the head' button, conveniently under everywhere you might ever put your elbow
asciilifeform: PeterL: one of the most comical failure modes, ubiquitous in usg crypto, is the null cipher
PeterL: who am I to stop people from sabotaging themselves?
asciilifeform: that's the more typical solution aha
PeterL: It checks to see if it is using the right key by comparing the decrypted text agains a pre-known challeng-string (cs)
a111: Logged on 2017-08-09 14:12 PeterL: using the wrong key will result in a random byte string, so with a cs of 1 byte, you have 1/256 chance of looking like it was the right key
mircea_popescu: but yes, for unrelated reasons fixed size is the right choice for gossipd.
asciilifeform: aite, i'm walking the l0gz still
a111: Logged on 2017-08-09 14:11 PeterL: if you have a 0 byte cs, then every message looks good
asciilifeform: http://btcbase.org/log/2017-08-09#1695792 << variably-sized packets are the mistake here.
PeterL: so not more than rather than not less than 256
mircea_popescu: and rnd(256, l) is not equivalent because who the fuck knows what rnd does when a > b.
PeterL: mircea_popescu: if l is less than 256, then l' = 256?
PeterL: I will have a look at making a reversing function for the mpfhf
PeterL: I will check in later once I am back at my computer with my key to verify this conversation has been with the real PeterL
mircea_popescu: c (in that order), where R and S are produced by mpfhf(m') with R len set to c (bitness same as bitness of len(Pm). Pm will be the padded message sent to RSA. The recipient will have to undo mpfhf with known R and S to obtain m.
mircea_popescu: anyway, let it be said that there's nothing wrong with oaep as far as we know, but for the sake of argument a mpfhf based padding scheme would conceivably work like this : 1. given message m, of length l, generate r = random bits, of length l' up to l but not less than 256 bits. 2. compose m' = r + m + c (in that order), where c is l - l` (and its bitness is always same as the bitness of len(m')-256). 3. compose Pm = R + S +
mircea_popescu: i mean the bitsize ; it's not just that though, partially known secrets, low exponents etc all conspire to empwer the latice reduction.
PeterL: in " n / e^2 bits of entropy ", what are n and e, the key modulus and exponent?
PeterL: mircea_popescu linking to a pdf, what is the world coming to!?
mircea_popescu: and since we're apparently doing rsa likbez : if r used in padding above contributes less than n / e^2 bits of entropy to the final, padded message, coppersmith has a few words to tell you.
mircea_popescu: (and, of course, for short messages ie shorter than n i can just compute the e-root).
mircea_popescu: and upstream, to make clear what "semantic security" means : rsa is deterministic, if i wish to see if your "encrypted" string really was message m, all i have to do is encrypt m myself. if the results match i have cryptographic confirmation.
mircea_popescu: because hash and hash' are used to stretch/reduce the bitlength of their parameters, something like mpfhf (which permits arbitrary sized outputs/inputs) could work well ; but is also slow.
mircea_popescu: basically it takes a random string, jumbles it with the original message, and spits out two halves. the hope with it is that it provides all-or-nothing security, in the sense that to recover any bit of the message you need to correctly process the entire pair of jumbled strings.
mircea_popescu: and THAT you then encrypt to key X and send ove.r
mircea_popescu: now, alf's scheme is probably valid padding, though it is very expensive. it works like so : to encrypt a message m to key X, you : a) generate two one-time keys, A and B. you encrypt some bits of m to A and some to B, randomly chosen. you pile together : the bits of m encrypted with A, the bits of m encrypted with B, the schedule of which is which, and the keys A and B into one large m'
mircea_popescu: it's not useful in the field.
mircea_popescu: now : textbook rsa (the sort of thing you seem to be discussing, above) has no semantic security and on top of that is malleable.
mod6: meanwwhile, I'll add a preface to the HOWTO doc on the minimum requirements. thanks to diana_coman for gathering them up once upon a time.
PeterL: no, recipient goes through his list of keys A and B until he finds the one that decrypts it
mod6: These problems should be resolved once sane environment is achieved.
mircea_popescu: PeterL and then you add key A and B to the message at the end so recipient can un-pad ?
PeterL: this is the padding algorithm described by alf: take random bits r and message x, encrypt r to key A and encrypt (r XOR x) to key B
mircea_popescu: PeterL the other problem this discussion reveals, of course, is that you aren't using any padding ?
mircea_popescu: PeterL the broader point here being that you can't warn the user about things he can't control. you gotta provide for it yourself.
mircea_popescu: PeterL the logical approach would be to include a checksum neh ?
PeterL: if you have an encrypted text c, then c ^ d mod n will give an integer, without previously knowing m, how will you check for congruence?
mircea_popescu: this is the basis of rsa : m ^ e ^ d = m mod n
mircea_popescu: yes, but would that integer then also be m ?
PeterL: not that using the wrong key will give you the plaintext message, but that if it uses the wrong key and happens to match the cs for that key, it will pass the pile of garbage on to all the peers
PeterL: using the wrong key will result in a random byte string, so with a cs of 1 byte, you have 1/256 chance of looking like it was the right key
PeterL: if you have a 0 byte cs, then every message looks good
a111: Logged on 2017-08-08 23:33 mircea_popescu: PeterL +# IMPORTANT NOTE: if the cs is too small, messages have a chance to get decrypted by the wrong key << what is the logic behind this ?
PeterL: http://btcbase.org/log/2017-08-08#1695504 << so the program goes through the keys and checks the decryption against each challenge-string
mircea_popescu: you gotta have the params set correctly
PeterL: so yes, using the fermat test would be bad
PeterL: I tested the fermat test, and with 100 numbers of 1024 bits deemed prime by the fermat test, 50 were found to be composite by miller-rabin
mircea_popescu: well so if you thought that you could have asked before rather than after eh.
mircea_popescu: they also end up on archive.is, because the bot archives links and the odds of a whole day going by without a single log reference are small.
edivad: I've done it yesterday for a friend that asked me a dvd with the logs inside, to read them when on holiday with no internet access
edivad: is allowed/polite to scrape all the btcbase.org/log website?
edivad: thanks BingoBoingo for the help
mircea_popescu: read the help would you.
jhvh1: BingoBoingo: The operation succeeded.
BingoBoingo: !~later tell trinque maybe look into the edivad deedbot registration thing? Guy is having a hard time
mircea_popescu: and in other civilised behaviours : always remember to hold pinky elevated! http://68.media.tumblr.com/e0686d449baf8a8d73a2199a83f7780c/tumblr_o1f357D0Zh1sr105eo1_1280.jpg
edivad: when i'll login again in IRC, what command should i use to authenticate?
edivad: tried now to install the common bitcoin core dependencies with apt
edivad: let me copy the entire error log
edivad: gcc is already the newest version (4:5.3.1-1ubuntu1).
mircea_popescu: and in random other lulz : it's funny how the libertards worshipping at the watergate shrine usually omit to mention that by then washington post had been a libel tabloid for years. somehow dillard stokes' name never comes up. somehow they don't seem to notice it always was simply us sturmer.
BingoBoingo: edivad: You authenticate by decrypting something.
BingoBoingo: edivad: Just remember that hunger can be the most devious thief of all as evidenced by kakobrekla's 500 BTC car. Every situation is different, but many of them rhyme.
edivad: now that i've registered my pgp key, should i be able to authenticate signing something?
edivad: well, I have a spare brazilian passport in the drawer, so when I've read the universal plan, I instantly got some very powerful energy for a future exit plan
BingoBoingo: And it's a rather portable skill
edivad: but then after a month i realized that I was needing a better plan
edivad: since it was the first work experience, I was even able to enjoy it
BingoBoingo: For the latest wave of Vandals!
mircea_popescu: what are they to build in italy ?
edivad: mircea_popescu: because the universal plan for wealth makes some great guidelines, but then since every situation is different, I'm trying to understand if there is a better approach for who hasn't already a job and is studying
edivad: or there is a better way to get credit, without harming finance of my family (so not asking to them to put collaterals for my loans)
mircea_popescu: how is another man going to answer that question for you ?
edivad: but my question is: as a student without a regular jub, should I need to a aim at a minimum wage job, to possibly apply for credit and then fly away to a second/third word country, get a decent house, marry and reproduce?
BingoBoingo: edivad: Ah, so at this point reading into TMSR history will be very beneficial for girding yourself against long cons and other social engineering attempts against your wealth and your self.
edivad: I know bitcoin since a couple of years and learned the hard way how to protect my funds and stay away from scams. Now I finally got into the sweet spot where I realized how many orders of magnitude my savings are safer in bitcoins
edivad: thanks, basically i was reading the universal plan for wealth
edivad: may I take advantage of my troubleshooting sign up into the channel to ask about tmsr?
mircea_popescu: ah so okay. that makes more sense then.
edivad: now just installed patch on the right vps
edivad: guys, i'm gonna having asap my usual generous amount of morning coffee, since i was typing in the wrong VPS
mircea_popescu: this is bizarre. try the actual line from the .sh that fails ? (prolly the first one to string match "patch") ?
edivad: patch is already the newest version (2.7.5-1).
mircea_popescu: well, it's technically part of core linux, but apparently they ship systems without.
edivad: was an assumption in the tutorial?
trinque: no, you're missing the utility patch.
edivad: tried also yestereday to troubleshoot with mod6, (there was another issue related to the locale of my OS, then fixed with him), but now i'm stuck at 0x0B
mircea_popescu: mod6 did a u160 test item end up stranded in there ?
mircea_popescu: did you do 0x09, gathered vpatches ?
edivad: yes, following these instructions since the beginning: http://thebitcoin.foundation/trb-howto.html
edivad: fwiv it seems that V download seals and patches but then the bitcoin source code is not included, and i should gather it on my own?
jhvh1: BingoBoingo: The operation succeeded.
BingoBoingo: "In Urfeld it turns out that over night the garden was trampled by deer." << Who could have predicted free food would just walk by and make a mess of your labor food.
BingoBoingo: "The chickens on the lower floor bother me a little, though their usefulness makes sense to me in every way." << What redditard would accept this compromise!
BingoBoingo: The thread runs for a while
BingoBoingo: lol "M. Poopscoop provides a solid foundation to comedy gold. With the current pace of events, in particular coinbase and the DPR trail he doesn't get as much laughs as he used to. I don't have the impression that is going to change anytime soon with the comedy features at an ATH." << The studious ignoring highlighted
a111: Logged on 2017-08-08 21:28 asciilifeform: in other noose, mod6 , phf , et al : http://btcbase.org/log/2017-07-10#1681208 nao 1.5s . ( this with karasbuba-squaring used in exp, and comba-squaring used as base case in the former. )
mircea_popescu: the obvious question being, "how come the ugly one ends up a fiat politician ?" ; and the obvious answer being that sane girls find better shit to do.
mircea_popescu: in other mild lulz, it seems the albania-serbia-macedonia pressure is slowly mounting. with any luck, 3rd kosovo war.
mircea_popescu: in other lulz, ro still has sex at concerts ( http://www.stiridecluj.ro/divertisment/sex-la-untold-cluj-doi-tineri-s-au-incins-prea-tare-video ) to everyone's shock and awe.
asciilifeform: No one else did. Not theymos, not knighmb, not pirate, not silbert, not Jihan Wu. Not satoshi or asciilifeform.
asciilifeform: gotta make sure to scoop from the right bathtub tho. wouldn't want to drink benjies from benjie tub
mircea_popescu: such a lulzy fucking scene considering the usistani history in both involuntary self-crit humor and bathtub alcohol it's practically an un-unrollable loop of funny.
mircea_popescu: because you know, nobody serious drinks vodka without ice, and bathwater really makes the best samagon.
mircea_popescu: to drive this point home, they have her fish out a coupla cubes put them in a glass before pouring vodka
mircea_popescu: in other "people themselves" : charlize theron's character in atomic blue (this borderline sleeve superheroine-spy of a retro-hallucinated 90s, as in the real 90s the us agents got fucking raped in eeurope/berlin) is SO FUCKING HOT she takes baths in iced water.
asciilifeform: but also didjaknow, 'but what they can do is, after a hardfork happens, they could buy all the coins that the MP and the rest of whales dump into the market to try to kill the fork, and not only that, but they could pump it even higher by simply printing more money and pumping the price of "gavincoin" above legacy chain. what then'
asciilifeform: they oughta sell tickets, to watch this
asciilifeform: 'could you please explain (in detail) how they plan to scale bitcoin' ahahahaha
mircea_popescu: asciilifeform yes, but that takes you know, like actual tools. whereas nude reason of a kid posessed of high school maths would have allowed the correct limit be picked.
asciilifeform: ( every single inline pragma in ffa is there because without it, stat. signif. uptick in run time on all of my iron )
mircea_popescu: why the fuck should it be "called often", when obviously all the functions that are called ONCE are inlined by default!
mircea_popescu: because, you see, the "phd level" wikitards are entirely bereft of a clue to the degree of not understanding inflexions AT ALL.
mircea_popescu: elsewhere in the rotting pile, "If a function is inlined 10 times, there will be 10 copies of the function inserted into the code. Hence inlining is best for small functions that are called often."
BingoBoingo: My favortie part is "MP preventing Segwit" when instead the power rangers were compelled to Segwit a certain way leaving Bitcoin alone.
mircea_popescu: o there's tons, yeah. mn words/day outpour.
asciilifeform: 'They are diversified in eth already.' << didjaknow !
mircea_popescu: aha. well technically, i found them because got bored today and dug into older reports in moar detail.
asciilifeform: intel found these ?
asciilifeform: ( thing still runs in constant time: N always walks the range of 1 to last digit of the width of our ffa )
asciilifeform: N isn't a secret nor does it vary with payload, it is the digit iterator,
asciilifeform: now wouldja believe i spent 3 wks trying to eliminate the if N mod 2 = 0 ... condition in Square_Comba
mircea_popescu: it's one thing to say "carpentry is not very efificent, they need hammers", but the case here seems to be more of a "carpentry does not exist, they require gas planks, which can't exist"
mircea_popescu: if not even this works, what is "proving" supposed to mean when they talk of it ?
a111: Logged on 2017-08-08 23:24 mircea_popescu: http://btcbase.org/log/2017-08-08#1695413 << the quality of this summer of forks fails to impress.
asciilifeform: rather than 1.
asciilifeform: however this would lengthen the program, and introduce 7 new algos to prove correctness of
asciilifeform: it thereby follows that i could unroll comba into explicit cases from 1 to 8 words
asciilifeform: http://btcbase.org/log/2017-08-08#1695463 << i realized that this might not be true : the (empirically found, but seems to hold on all of my iron) threshhold for karatsuba +ev is > 8 words :
mircea_popescu: and in typical medium success stories, https://medium.com/@andreaarmstead16/how-i-become-a-bona-fide-member-of-the-great-illuminati-1ee9eed25ea3
a111: Logged on 2017-08-08 21:42 asciilifeform: for only 25% shave off the run time, it would not be worth it:
mircea_popescu: http://btcbase.org/log/2017-08-08#1695470 << it is actually worth it, the code is not that lengthy.
mircea_popescu: PeterL +# IMPORTANT NOTE: if the cs is too small, messages have a chance to get decrypted by the wrong key << what is the logic behind this ?
mircea_popescu: PeterL +MAXMESSAGE = << how did you derive the magic number ?
mircea_popescu: ime, but the only guarantee the design provides is that it will die out EVENTUALLY. for all you know it can survive years through sheer chance. so weak keys are a very serious potential problem for gossipd.
a111: Logged on 2017-08-08 19:19 PeterL: ok, so if I switch the primality algorithm, what do you think of the rest of it?
mircea_popescu: http://btcbase.org/log/2017-08-08#1695453 << you have to. we'd be the first people to move to a cheaper test algo if this was feasible, in tmsr-pgp etc. but as he correctly points out, most of the keys you make are weak. an important point to consider here is weakness propagation : one weak key can potentially expose other key exchanges, resulting in a chain of (unknowingly) lost secrecy. the design will have it ablate over t
a111: Logged on 2017-08-08 17:26 BingoBoingo: And the Powah Rangahs have turned hard against Silberts 2 MB fork https://archive.is/4hevE
mircea_popescu: http://btcbase.org/log/2017-08-08#1695413 << the quality of this summer of forks fails to impress.
BingoBoingo: Today's Trilema re-read http://trilema.com/2015/these-fools-have-been-handed-a-technology-so-clever-so-disruptive-and-revolutionary-that-the-rulers-of-the-world-would-have-to-fully-unmask-themselves-as-ruthless-tyrants-in-order-to-suppress-it/
asciilifeform: currently i suspect that this thing is at the theoretical limit of performance you can get without doing something nonportable.
asciilifeform: however, the difference becomes more serious when operating with smaller words
asciilifeform: for only 25% shave off the run time, it would not be worth it:
asciilifeform: given as the special square thing costs 143 lines
a111: Logged on 2017-07-10 19:15 asciilifeform: in other noose, ACHTUNG PANZERS, http://btcbase.org/log/2017-06-29#1676331 nao 1.99s.
asciilifeform: in other noose, mod6 , phf , et al : http://btcbase.org/log/2017-07-10#1681208 nao 1.5s . ( this with karasbuba-squaring used in exp, and comba-squaring used as base case in the former. )
asciilifeform: ( dun mean it is useless - but it is in the class of homework imho )
asciilifeform: i.e. PeterL put in a great deal of sweat, it shows; but the result does not make my work any easier, unfortunately
asciilifeform: still same thing as of the last one
asciilifeform: for the thick : a large portion of keys generated by the linked code, will phuctor immediately.
asciilifeform: it will kill the user.
asciilifeform: i understand what is meant by 'prototype', but an rsatron (ignoring for a moment the constant-time thing) that uses fermat's primality test as the sole probe, is analogous to a grenade with a half second fuse
a111: Logged on 2017-07-08 00:17 asciilifeform: sina: the reason why i am not particularly hot&bothered, is that your prototype does not contain any of the parts that comprise 99+% of the necessary work of an adult gossipd
asciilifeform: i'ma save log space, and invite PeterL to read what i observed re the last d00d's gossipd prototype.
asciilifeform: PeterL: are you aware of the limitations of this test ?
PeterL: like I said, prototype, if it works then can be ported to using ada (at least that is my idea)
asciilifeform: PeterL: i have to rain on the parade, but i dun see what you win from writing own rsa in this one. py arithmetic is not constanttime
PeterL: not really vital to anything involved, that could just as well use any other hashing function
BingoBoingo: And the Powah Rangahs have turned hard against Silberts 2 MB fork https://archive.is/4hevE
phf: is that from the same guy?
asciilifeform: '(setq shell-file-name "C:/MinGW/msys/1.0/bin/bash")' << every time i see these, i think 'why, poor bastard, why'
phf: can't find it in logs, but i'll link you other version when i get to non work computer
phf: asciilifeform: no i haven't tried printing it, i saw this version, but i believe it's derivative. there's prior work with much nicer "diffs against dpANS" approach.
jhvh1: asciilifeform: The operation succeeded.
asciilifeform: !~later tell phf i noticed recently that http://cvberry.com/tech_writings/notes/common_lisp_standard_draft.html exists. some years ago i tried to do same thing, but the sheer bulk of the pdf choked every printing co., incl. 'lulu'. ever tried ?
asciilifeform: meanwhile, in the world of btc-themed spam and infectors, http://wotpaste.cascadianhacker.com/pastes/rcjjT/?raw=true
shinohai: Morning there mod6
mircea_popescu: and in other jay z, http://trilema.com/2015/facebook-sends-traffic11eleven/#comment-122558
a111: Logged on 2017-08-08 06:25 BingoBoingo: In the cancerous faggotry file https://archive.is/on51R
mircea_popescu: http://btcbase.org/log/2017-08-08#1695378 << dude imagines he's doing the batshit insane camp any favours by publishing more batshit insane ? srsly, "moon prison" ?
mircea_popescu: motherfucker the "business report" style of 2017 is unreadable. wtf is with all the bullets and summaries interspersed and omfg.
ben_vulpes: leading to such hilarious horrors as "fuck it in the pizza"
ben_vulpes: oh and in other tangential discoveries, both google and ms refuse to translate pizdet
ben_vulpes: well hey, put a few knickers in some degree of knot, so he's got my vote in the midterms