5000+ entries in 0.36s
mircea_popescu: asciilifeform hey, im not defending random strawman. point was, you have yet to spend
2 hours typing in paths. so no, picking that over latrine is at best figure of speech, and in general simply "discount cost of unlived experience to 0"
mircea_popescu: asciilifeform this is EXACTLY not the case. i am saying "7.62 is sufficient, because it will blow a hole through man, as result of interplay of actual universal constants" and you are saying "yes but 15.
2 would be bigger".
mircea_popescu: whereas
2 digit year is based on "we never heard of last century"
mircea_popescu: in exchange you get two things : you get 2x the size of message blocks (an advantage that is actually a disadvantage as now you're using 1kb udp packets which is i expect margionalkly worse than
2 512s) ; and you get a harder rsa (an advantage which is no sort of advantage, the 4096 rsa is already harder than the extant universe)
mod6: make sense. i personally kinda like the idea that a user can generate a key, that must be
2^n, that is all.
mod6: hmm. so let's say, for instance, that you figure out how to make the
2^n version the same as the 64 width classic version -- performance-wise.
mike_c: _22483.c:835:
2: error: expected â before ât
mircea_popescu: the ONE way to constant-mpfhf is to calculate ALL the tree of possibilities,
2^message length items EVERY TIME
mod6: i thought it was 1*
2*3*5*7*11*13 ... all the way up through whatever prime fits into < 4160 bits.
ben_vulpes: why is ln(16)/ln(
2) so tidily and precisely 4?
mod6: <+asciilifeform> and incidentally mod6 , is it obvious why this only works if L is restricted to powers of
2 ? << no, i think im missing the entire idea of why this is written this way.
mod6: just wondering if it could be a mechanical push, yet slightly more readable. maybe making
2^n version more grokable?
mod6: asciilifeform: so if you add back in the FZs that were removed in the
2^n version (re-adding in the 50% reduction of temp space that yields no opt.), do we get the ~runtime of the original?
mod6: this might be extra-strength dumb, but... in your new power of
2 version, do you need to inline the Mul & Square of karatsuba?
a111: Logged on 2017-08-14 17:57 asciilifeform: if instead of 'mult of 64' we had 'powers of
2', we could dispense with the odd split in karatsuba
mircea_popescu:
2 stage, a 1-200kg booster thing to get it in gross range and a
2-3kg thing to power the last 100 grame spiked ball to the actual satellite
PeterL: (I forgot to increment a variable, so the first number is just
2*(a big exponent of 3) )
mircea_popescu: and if your key isn't
2^n, further computers will wreak havoc on deployed code by requiring non-dividing Ns.
shinohai: Theonly
2 fixes proffered require AT LEAST one week to implement
mircea_popescu: hm... should i lower the pay-for-tits moar ? i mean
2 bitcents is nigh on a hundred bux by now wtf.
mircea_popescu: ben_vulpes and block depth. if you make segwit tx a to me at height 1 and i put it into a normal tx at block
2, i can spend it from block 3 as my bitcoin, the segwitnmess is gone out of it. to steal it from me, one has to rewind all the way to block 1 again. which is possible, but expensive as the chain builds.
☟︎ ben_vulpes: step 1: home orifice. step
2: being useful member of society
mircea_popescu: taking 20MeV source arbitrarily and
2 kev detector, you have roughly speaking 8 and a half halvings at your disposal. if your 1/e distance is 10 meters, that means 40 meters away your detector will still work.
mircea_popescu: basically, a high energy xray will lose
2/3 of its energy every dozen or so meters. whatever's left illuminates the gold (there's no crossing gold, too large barn), and then gets sent back, as gold-xray-pink
trinque:
2, entirely likely the power rangers changed the wallet format
mircea_popescu: (and in any case, this is also a major improvement over gpg, which realloy only uses
2^16, and worked ok in the field for many years)
mircea_popescu: are you trying to say that since there's only
2^32 possible values for the crc, it then follows that 1 in 4bn will match ?
mircea_popescu: for comparison, a 100 gram tennisball capable of giving a pretty girl a nasty bruise would be going sa 100 km/h and thereby hit for .1 * (100/3.6)^
2/
2 ~= 40 J over its 0.001 cubic metre space, ie about 40 times more than the jet's "acoustic attack". a 8-gram 9mm round perfectly capable of making a whole new hole hits for 0.008 * 300 ^
2 /
2 = 360 J over its 20 *
2*4.5*pi = 5.65 * 10^-7 volume, ie about 650`000 times the jet's
mircea_popescu: basically, you precompute conveniently chosen powers of
2, and then you get rid of most of the product larger than
a111: Logged on 2017-08-09 15:58 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 +
erlehmann:
2. yes, this might be a problem for some, but it never happens to me
erlehmann:
2. look on while almost all of them develop the exactiy same train of thoughts (including fixing make, which is impossible for this kind of program)
erlehmann: PeterL 1. write grammar
2. ??? 3. never correct invalid input, nuke it from orbit instead
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 +
☟︎ PeterL: in " n / e^
2 bits of entropy ", what are n and e, the key modulus and exponent?
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: or how shall i best put it, that's not equality but modulo congruence. whereby 7 = 5 mod
2 edivad: patch is already the newest version (
2.7.5-1).
jhvh1: BingoBoingo: Bitstamp BTCUSD last: 3439.98, vol: 15694.23335439 | Bitfinex BTCUSD last: 3446.
2, vol: 32199.12086972 | BTCChina BTCUSD last: 3426.838359, vol: 18275.05640000 | Kraken BTCUSD last: 3459.1, vol: 7345.70636087 | Volume-weighted last average: 3441.34795776
jhvh1: BingoBoingo: Current Blocks: 479724 | Current Difficulty: 8.60221984436E11 | Next Difficulty At Block: 479807 | Next Difficulty In: 83 blocks | Next Difficulty In About: 12 hours, 9 minutes, and
2 seconds | Next Difficulty Estimate: None | Estimated Percent Change: None
jhvh1: BingoBoingo: Bitstamp BTCUSD last: 3430.91, vol: 13609.22855685 | Bitfinex BTCUSD last: 3428.
2, vol: 27814.18636746 | BTCChina BTCUSD last: 3393.335487, vol: 15730.67920000 | Kraken BTCUSD last: 3433.003, vol: 7193.80566745 | Volume-weighted last average: 3420.78702129
mircea_popescu: asciilifeform well, they could hire the girl also, and for the 450k you can get a
2 bedroom and rent one. this'll work well as you'll never see each other again
phf: fwiw i never did experience that whole formulaic writing thing (though i know there were all kinds of other cases of "tattoos for the mind"), my russian/literature/foreign literature classes were brutal, i still have nightmares of cramming poetry last moment,
2-3 hours essay sessions that never seem to end, the three giant Yuri Lotman books
mircea_popescu: 1. phf is walking down the road ;
2. phf perceives something in river ; 3. phf goes to help ; 4.a. phf discovers it was scarecrow, unloads helping module ; 4.b. phf discovers it is muscovy and he's from lvov, unloads helping module ; 4.c phf discovers it's his brother AND CARRIES ON.
BingoBoingo: [1] Thesis, introduce points 1,
2, and 3 [
2] Elaborate Point 1 [3] Elaborate Point
2 [4] Elaborate Point 3 [5] Conclusion, i.e. repeat thesis and reiterate points 1,
2, and 3
mircea_popescu: ie, "for its purpose" it has easily > 10mn dpi. but for your purpose, i doubt it has a functional .
2 dpi.
phf: i put a
2-person tent in the middle of the room and it made the room suffocating, yes
jhvh1: BingoBoingo: Current Blocks: 479428 | Current Difficulty: 8.60221984436E11 | Next Difficulty At Block: 479807 | Next Difficulty In: 379 blocks | Next Difficulty In About:
2 days, 18 hours, 9 minutes, and 57 seconds | Next Difficulty Estimate: None | Estimated Percent Change: None
mircea_popescu: ask the author, or generally any "city planner" what are the wrong assumptions they hid in the nonsense ? they'll look at you like you're from mars. yet... 1. all people = all other people. there's exactly 0 concept of social hierarch.
2. all people == spherical cpus in a vacuum. really bitch, i'll keep track of your stupid grids, and CONNECT ? i'm not fucking connecting lol, wtf do i care where the bus is at.
mircea_popescu: anyway, let's see some details. main chain block 168000 is 000000000000099e61ea72015e79632f216fe6cb33d7899acb35b75c8303b763 mined 2012-
2-22 at 21:31 ; size 7.1kb
jhvh1: BingoBoingo: Current Blocks: 479309 | Current Difficulty: 8.60221984436E11 | Next Difficulty At Block: 479807 | Next Difficulty In: 498 blocks | Next Difficulty In About: 3 days,
2 hours, 22 minutes, and 13 seconds | Next Difficulty Estimate: None | Estimated Percent Change: None
a111: Logged on 2017-08-04 21:20 asciilifeform: but dun have time to spend
2 wks making a gentoo box...
BingoBoingo:
2.7 million in Chiraq proper, and 10 million in metro area. Skyscrapers empty, but ghettos full. Chicago has a full "star" mass transit topology, shrinks precieved size of city.