275800+ entries in 0.095s
mircea_popescu: and i want the record of accidental "dropped on my toe" events recorder permanently.
mircea_popescu: i would like the difference between "dropped plate on my toe" and "fell on naked woman holding her heels while naked" to be obvious to the naked eye
mircea_popescu: that's pretty much the only thing. "we print money, and you can pretend you just fell on her while your pants were off"
mircea_popescu: in short : it makes the cost of nsa covert ops in foss go from O(log(t)) all the way up to P,N
mircea_popescu: was it an honest mistake ? was it a nsa sponsored shitjob ? etc.
mircea_popescu: the difference is huge, because when a bug like the numerous bugs in openssl/bash/etc pops up in the open
mircea_popescu: as opposed to the current X Y only so-called open source thing going on atm.
mircea_popescu: X submitted this, Y merged it, K L M N K and Q read and approve.
mircea_popescu: asciilifeform: considering [blabla] you probably did not need to do the live-fire test. << stom motherfucking corrupting the youth!
mircea_popescu: ben_vulpes: i believe this excises all upnp mentions. my build hops on the network and downloads blocks. <<< yay wd.
mircea_popescu: kakobrekla but how is a single machine going to catch up when it falls behind ? never ? << the idea is to stop these persnickety machienes from validating the blockchain at all.
mircea_popescu: ben_vulpes i have no idea, it could be done that way too
mircea_popescu: if you're not willing to sign the present signs you;'d better fork.
mircea_popescu: anyway. p and q are primes. p-1 and p-1 being necessarily even, will probably have some factors. these factors could just as well be 65537
mircea_popescu: stop trying to confuse me just because i have nfi of anything!
mircea_popescu: "pick 32 onbit 64bit random numbers, test for cd" is a much better approach
mircea_popescu: (and for that matter, it IS quite fucking possible for the current, fixed e implementation to spit out badly coded stuff every once in a blue moon, when the p q happen to be a multiple of 65537)
mircea_popescu: the idea is just for (q-1)(p-1) and e to be relatively prime
mircea_popescu: eh fuck it, usgavin promised us 100% increases each year for the next 200 years
mircea_popescu: afaik it's only used because easy to compute, two 1's merged into a word
mircea_popescu: you telling me the rsa e must be a fermat prime ? why ?
mircea_popescu: asciilifeform 65537 is not a mersenne prime either. what did i step into ?
mircea_popescu: yeah google, always put wikipedia the fucking first line, because i'm sure that's what the "algorithm" says.
mircea_popescu: jurov oh yeah, i wasn't commenting on your implementation, i was just bitching at the stars.
mircea_popescu: asciilifeform incidentally, know of any rng process to compute fixed count onbits random numbers ?
mircea_popescu: i wasn't talking about the cardano! i was talking about the new pgp
mircea_popescu: also doing away with the 65537 static and instead using any 64bit integer with exactly 32 on bits would be better.
mircea_popescu: so no, it won't imperil them, it will just make the peril obvious
mircea_popescu: i feel so bad forcing inconvenient change upon random people.
mircea_popescu: so that means those toolchains will have to change or die ?
mircea_popescu: anyway, thgis is more an aesthetic consideratyion. ditching symmetric cyphers is the more substantial thing, and since a reimplementation happenes, might as well add aesthetics.
mircea_popescu: shit son. if only i knew about this, we could have made diff design changes on bitcoin core.
mircea_popescu: and again, armored. nothing but letters and digits in there. not even +/ etc.
mircea_popescu: proggy gets 65kb file, cuts 16k off its end recursively, spits out 1kb of text signed by 4 people
mircea_popescu: asciilifeform obviously, since fixed length, it can go back to the end of the file.
mircea_popescu: much simpler machines to work it if it knows a straight offset