4300+ entries in 0.289s
a111: Logged on 2017-11-20 12:33 spyked:
http://btcbase.org/log/2017-11-18#1740268 <-- coincidentally, I've been working on a very similar thing this week-end. managed to get rid of gcc 5.4 through a variation on
https://wiki.gentoo.org/wiki/Upgrading_GCC ; compressed steps: 1. install heathen stage3;
2. right after minimal setup (timezone, locale etc.), install gcc 4.9.4, and switch to it as default using gcc-config; 3. mask gcc >=5 in portage; 4. rebuild @system (and/or
a111: Logged on 2017-11-20 12:33 spyked:
http://btcbase.org/log/2017-11-18#1740268 <-- coincidentally, I've been working on a very similar thing this week-end. managed to get rid of gcc 5.4 through a variation on
https://wiki.gentoo.org/wiki/Upgrading_GCC ; compressed steps: 1. install heathen stage3;
2. right after minimal setup (timezone, locale etc.), install gcc 4.9.4, and switch to it as default using gcc-config; 3. mask gcc >=5 in portage; 4. rebuild @system (and/or
a111: Logged on 2017-11-20 03:41 shinohai: Take a handful, write entire Romanian dictionary by hand in
2 nights.
BingoBoingo: r woman posted a screenshot for $
2.80 after doing a two-hour pickup and delivery in Austin, Texas."
shinohai: Take a handful, write entire Romanian dictionary by hand in
2 nights.
☟︎ mircea_popescu: whole idea now is "can safely replace explanation from 1 with item from
2". if we break this re 1 wtf do we do, you write AI to discern between dex-powered and mp-powered explanations of words ?
mircea_popescu: "ПАТЕНТ, -а, м. 1. Документ, свидетельствующий о праве изобретателя на его изобретение, о его приоритете. Получить п. на изобретение.
2. Свидетельство на право занятия торговлей, промыслом. || прил. патентный, -ая, -ое. Патентное прав
a111: Logged on 2017-11-19 14:51 BingoBoingo: <mircea_popescu> (apparently okcupid went full app-shit sometime in the interval also ?) << The website has increasingly little to hook, and is increasingly poorly populated. Last week Uruguay had 4 girls, now has
2. Extrapolating from Uruguay's 4 million population this means ~35000 girls is all okc has left. Been in decline for a while, but now fallen sharply.
mircea_popescu: "12 este divizibil prin
2`12 is divisible by
2" holy shit. there are some useful expressions in the expression item, however a) very low snr, lots of useless crap and b) idiomatics not really a good fit for dictionary, much better fit in blog articles.
BingoBoingo: <mircea_popescu> (apparently okcupid went full app-shit sometime in the interval also ?) << The website has increasingly little to hook, and is increasingly poorly populated. Last week Uruguay had 4 girls, now has
2. Extrapolating from Uruguay's 4 million population this means ~35000 girls is all okc has left. Been in decline for a while, but now fallen sharply.
☟︎ pete_dushenski:
http://btcbase.org/log/2017-11-14#1737340 << tesla isn't going anywhere. has now released "semi-truck" and "roadster
2.0" with which to continue the endless dangle of consumer tech disruption, always 3 years into the future. elon is the master of no bread today but e-cake tmrw.
☝︎ BingoBoingo: Also lead time from application to LACNIC IP address assignment is ~
2 weeks
trinque: asciilifeform: beefiest xserve was a dual proc
2.3ghz, tapped out at 16gb ram
diana_coman: PeterL and anyone else following along on keccak:
2 more problems found so far in the ada code namely 1. in the pi permutation it's the *output* coordinates that are calculated as Y,
2*X+3*Y based on input at X,Y and not the other way around;
2. at iota the corresponding round constant is xored into a(0,0) only, not into all the lanes of the state (following permutations will propagate the round constant)
BingoBoingo to put "
2 week notice" @ BingoBoingo Store on tomorrow's do list
jhvh1: mircea_popescu: Bitstamp BTCUSD last: 7833.56, vol: 21452.45181747 | Bitfinex BTCUSD last: 7849.7, vol: 96288.38088123 | Kraken BTCUSD last: 7849.
2, vol: 8511.81098169 | Volume-weighted last average: 7846.92383257
a111: Logged on 2017-11-16 22:17 diana_coman:
http://btcbase.org/log/2017-11-16#1739830 <- PeterL you are right in that problem with your rho was more subtle: it *should* set all lanes but it didn't because of how new coordinates were calculated; basically you lose old x in the process and end up calculating newY as 5*oldY instead of
2*oldX+3*oldY
a111: Logged on 2017-11-16 22:17 diana_coman:
http://btcbase.org/log/2017-11-16#1739830 <- PeterL you are right in that problem with your rho was more subtle: it *should* set all lanes but it didn't because of how new coordinates were calculated; basically you lose old x in the process and end up calculating newY as 5*oldY instead of
2*oldX+3*oldY
diana_coman:
http://btcbase.org/log/2017-11-16#1739830 <- PeterL you are right in that problem with your rho was more subtle: it *should* set all lanes but it didn't because of how new coordinates were calculated; basically you lose old x in the process and end up calculating newY as 5*oldY instead of
2*oldX+3*oldY
☝︎☟︎☟︎ mircea_popescu: it may appear beneficial to instead produce larger sets, such as of 4096 bits. the UPPER BOUND of the gain from this process is known ; the lower bound of losses from it is not known, because yes if you allow 4096 bit p, q and test, an acceptable N can be composed of the product between 17 and
2^4092 - 177 or whatever it was.
mircea_popescu: yes, in about 6% of cases the N will come out as 111..., in which case you know that both p and q are actually 1111 1111 led, ie you'll have
2 bits of each. and in 0.001% of cases N will led by FF and have the next bit set, so you'll know both p and q have the first octet set. if you have an extension attack allowing you to parlay 8 leading bits into the prime exposure, you can thereby crack rsa in 0.001% of cases.
BingoBoingo: Calculated as
2*{[(monthly rack with 22% VAT)/(40 Salable RU)]*(12 Months)}/(52 weeks)
a111: Logged on 2017-11-14 11:33 apeloyee: diana_coman: if keeping the minimum of
2^2047 for primes, you can, for example, generate primes between
2^2047 and
2^2049, and start over if the modulus is unacceptable. not sure what minimum for p and q makes sense.
mircea_popescu: if you have a problem with confusing phase
2 and phase 3, this blogposting is exactly the pill required to resolve it.
mircea_popescu: in preference of 1. a paste,forumdiscussion tuple ;
2. a github/medium/slockit/livejournal/slideshare/oglaf drawing etc ; 3. any other thing.
mircea_popescu: phase
2, when you write code. this is the excited state, "fuck this shit ima bang something out". it's like prototyping, not even clear whether something comes of it after all. many excited discussions here fail to progress past 1, "oh, I SEE what you meant!" is often their death knell.
mircea_popescu:
http://btcbase.org/log/2017-11-15#1738804 << mno, you can't get both margins. either you put your whole cost structure into the bottom line, in which case you charge that ; or else you put your recurrents into the bottom line, charge *
2 and amortize your fixed costs out of the 2nd part of that *
2.
☝︎ wer: i logged on here
2 or 3 days ago
BingoBoingo: In further developments, little miss trainwreck has just had a tire swapped on her motor carriage for the 7th time in
2 weeks
mircea_popescu: he's now at describing the mindbogglingly ugly hacks of how to get 32 bit fixnums out of 36 bit words with 6 bits of tag and
2 of code and so on, "oh actually the lowe order quarter can be repurposed"
mircea_popescu: asciilifeform how is a 1GB ram chip store the
2^30 bits ?
mircea_popescu: nevertheless, the correct solution to this "quickly, prime this many bits long" is a n, k tuple which contains n as the bitsize and k as the "oddness". if you want the n - 396 k = 5 prime you get
2^396- 1229
mircea_popescu: if you want an n bit prime calculate
2^n and substract the correct small integer.
mircea_popescu: asciilifeform there's much faster ways, such as the
2^x - y method.
mircea_popescu: ideally, it's a "hey, check out how your stupidity #1 contradicts your stupidity #
2, what do you have to say for your stupidity that isn't throwing a hissy fit ?"
a111: Logged on 2017-11-14 11:33 apeloyee: diana_coman: if keeping the minimum of
2^2047 for primes, you can, for example, generate primes between
2^2047 and
2^2049, and start over if the modulus is unacceptable. not sure what minimum for p and q makes sense.
mircea_popescu: of course, the odds of getting a FF FF q and a FF FF p are 1/
2^32
a111: Logged on 2017-11-14 11:05 apeloyee: if M is say, 1.999999 *
2^2047, then ~20 first bits of p and q are known
a111: Logged on 2017-11-14 11:02 apeloyee: if the modulus is M, then p,q>M/
2^2048 (because p,q<
2^2048)
diana_coman: asciilifeform, I meant in the final pair; i.e. you get p=3 and q=
2^4095+1 sort of thing; ofc throw both in a pair if product not right size; but if not enforcing any size condition at all on p and q then you can end up with any small prime too
a111: Logged on 2017-11-14 11:09 apeloyee:
http://btcbase.org/log/2017-11-08#1734517 << not quite. for encryption, if I get your modulus, and you actually want to read my messages, I can generate a public exponent between M/
2 and (say) 3M/4, and attach it to the message in plaintext.
apeloyee: diana_coman: if keeping the minimum of
2^2047 for primes, you can, for example, generate primes between
2^2047 and
2^2049, and start over if the modulus is unacceptable. not sure what minimum for p and q makes sense.
☟︎☟︎ apeloyee: grrr. "M is say, 1.999999 *
2^2047" <<
2^4065, of course
apeloyee: if M is say, 1.999999 *
2^2047, then ~20 first bits of p and q are known
☟︎ apeloyee: if the modulus is M, then p,q>M/
2^2048 (because p,q<
2^2048)
☟︎ diana_coman:
http://btcbase.org/log/2017-11-14#1737414 <- confirmed; I do NOT use any nextprime or other "rng"-parts from gpg; current rsatron prototype simply grabs nbits from fg, flips the
2 top bits and 1 bottom bit as per previous discussion and then checks if result is prime; if prime then keep, otherwise discard and try again; no "add
2 until prime" or other such thing
☝︎ mircea_popescu: asciilifeform no, because see, if you don't use nextprime you lack the "nop bridge" so to speak. rolling number 6 does not take you to 7. to get 7 you need a natural 7, and this is equiprobable to rolling a natural
2^74207281-1 on the space of (0,
2^74207281-1).
jhvh1: BingoBoingo: Bitstamp BTCUSD last: 6539.77, vol: 28531.98250185 | Bitfinex BTCUSD last: 6455.9, vol: 117240.23947972 | Kraken BTCUSD last: 6558.
2, vol: 8497.52824841 | Volume-weighted last average: 6477.04655989
mod6: yeah, /me re-read and Mr. P. said they discard the higest
2 digits
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?
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 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.
jhvh1: OPTIONS sip:nm SIP/
2.0
spyked: ah! mircea_popescu (and possibly other folks interested in ro-en translations)! almost forgot:
http://p.bvulpes.com/pastes/86l91/?raw=true <-- to drill. need to make 1-
2 passes through it before sending to silviu gherman d00d. (been also watching his stuff, guy has grown on me!)
a111: Logged on 2017-11-12 20:11 pete_dushenski: awww bch back down to 0.
2 after hitting 0.35 last night. but who has any left ? hmm...
pete_dushenski: awww bch back down to 0.
2 after hitting 0.35 last night. but who has any left ? hmm...
☟︎ jhvh1: mircea_popescu: spyked was last seen in #trilema 4 weeks, 6 days,
2 hours, 1 minute, and 53 seconds ago: <spyked> yeh, this was re. scabs
mircea_popescu: holy hell how do they manage to find all these
2 and 3 letter nicks that aren't reg'd/enforced ?!