tmsr - Search: 2

5300+ entries in 0.36s

sina: Imagine two independent processes. Process #1 is going through the list of peers and generating encrypted payload for unique peer key since last seen. When the payload is generated it places in outbox. Process #2 is running every N interval (1s example sure) to accept connections and deliver payloads from outbox. If for some reason Process #1 doesn't complete operation in time, it simply appears as if no

asciilifeform: there is NO reason why enemy should be able to read and alter at will traffic b/w 2 nodes.

sina: asciilifeform: if I'm not pestering let me throw a couple of questions. in my impl there are two secret operations, 1. key generation 2. challenge decryption. for #1, it runs in a different process on a random basis and marks a portion of the keys generated as bogus (per linked spec). that seems like it should sufficiently obfuscate against timing? for #2 is it possible to do some bogus ops in a similar

asciilifeform: erlehmann: 1) i have nfi what it does on corner cases 2) i have nfi how consistent is it across unixen, and how it misbehaves with, e.g., crapolade turdicode characters in the inputs

BingoBoingo: Or as an alternative there's a number of new manufacter 2-cycle scooters which do not require registration due to various "moped" exemptions. Needs to be under 50cc displacement which means riding machine with 1/4 of a lawnmower engine or twice a string trimmer engine.

ben_vulpes: http://btcbase.org/log/2017-06-25#1674280 << don't forget that you can put a holy 2-stroke in the secret apu slot of the slavecycle at the ghetto craft table and walk away with the prized freedombike! ☝︎

sina: or should it be a three-phase thing where 1. each peer advertises their name/host/port to the other 2. each receives the others pubkey 3. adds it to the peer info

BingoBoingo: Or play around on one of those 50cc 2-cycle scooters to orient self to 2 wheeled sense of balance

shinohai: https://blog.gdax.com/eth-usd-trading-update-2-216a3b946ef6

erlehmann: safe, sane, consensual (choose max. 2)

erlehmann: asciilifeform kind of mod key: 1. press compose key. 2. press at least two other keys in succession 3. get glyph that makes sense

js-of-mp: http://btcbase.org/log/2017-06-22#1673528 << this is a fine statement of the nonsense. "once market is saturated technologically, 1. invent alternative nonsense criteria 2. let nonsense criteria run sensible criteria out of market". this is how cars work, for instance : the best car ever made were the german items mod 2000s. there is not, nor can t ☝︎

js-of-mp: http://btcbase.org/log/2017-06-22#1673459 << eh, nothing beats the flaming bag srsly now. 1. you buy a sturdy paper bag. 2. you take a good shit on it. 3. you put it in front of door. 4.you ring the doorbell 5. you set it on fire. ☝︎

a111: Logged on 2017-06-22 18:28 asciilifeform: 2) does it know about mice, and take input from the mouse ?

asciilifeform: 1) 'set price to penny' 2) margin calls 3) profit 4) sfyl, tards

deedbot: L1: 0, L2: 2 by 2 connections.

asciilifeform: erlehmann: there is an american-'patented' style of rent-seeking scam that is now being 'enjoyed' in europe, incl., as i understand, in your berlin. which goes like this : 1) import a horde of raping, pillaging orcs from some fuckhole 2) prohibit 'discrimination' against'em. now the only permitted means of excluding them from being your neighbours is... price. 3) landlords rake in the dough, because now you gotta pay not only for ove

mod6: <+asciilifeform> if answer to either 1, 2, or both, is 'yes' -- asciilifeform won't use. << wait... i thought you were big on a workstation that you could use... but this doesn't include a mouse?

erlehmann: i3: 1. tiling, so probably not until you order it to draw title bars. 2. focus can follow mouse and windows can float, but keyboard-only use is sensible.

asciilifeform: if answer to either 1, 2, or both, is 'yes' -- asciilifeform won't use.

asciilifeform: 2) does it know about mice, and take input from the mouse ? ☟︎

ben_vulpes: eh, C-x 2/3 works as expected

mod6: K=(8+1)/2 == 4, J =(8-4) == 4

asciilifeform: 2 cuts into 1 and 1; 1 is the basecase

asciilifeform: 3 cuts into (3 + 1) / 2 == 2 and 3 - 2 = 1

asciilifeform: (7 + 1) / 2 == 4

mod6: A'First denotes the lower bound of the first index range; its type is the corresponding index type." << http://www.ada-auth.org/standards/12rm/html/RM-3-6-2.html#I1941

mod6: K : constant Positive := (L + 1) / 2; << Now, K gets assigned to 4. (7 + 1) / 2 = 4

a111: Logged on 2017-06-21 17:08 asciilifeform: also gotta understand what the F in 'ffa' means. it means that N**2 takes exactly same time as N**N

asciilifeform: also gotta understand what the F in 'ffa' means. it means that N**2 takes exactly same time as N**N ☟︎

asciilifeform: ( not to mention ~worthless for mircea_popescu's prize-problem of 'pure rsa link b/w 2 machines' )

jhvh1: BingoBoingo: pajama boy :: An insufferable Man-Child. About as threatening as Michael Cera and so nerdy he could guest-host on an unwatched MSNBC show. The purpose of Pajama Boy is not to get people to buy health insurance, but to get a rise out of more powerful personas. [ex:] Pajama Boy is an insufferable Man-Child probably reading The Bell Jar and looking forward to a hearty Christmas meal of stuffed tofurkey. If (2 more messages)

a111: Logged on 2017-06-18 23:30 asciilifeform: and realized, while doing this, that in fact you don't need 2k+2 bits for the karatsuba intermediates, you can do instead of (x0+x1)*(y0+y1) , (x0-x1)*(y0-y1), and then you don't need to propagate carries, but only take absolutevalue and xor the borrows to see if gotta invert the resulting term

mircea_popescu: you could afford a boat in $2 btc, yes.

erlehmann: looks shopped https://upload.wikimedia.org/wikipedia/commons/2/2e/Preet_Bharara_2012_Shankbone.jpg

a111: Logged on 2017-06-20 20:27 phf: https://pbs.twimg.com/profile_images/1458238253/hanno.jpg and https://upload.wikimedia.org/wikipedia/commons/2/2e/Preet_Bharara_2012_Shankbone.jpg

asciilifeform: relatedly, i've been seeing lines pop into existence on my client end in 2-3ln bursts

a111: Logged on 2017-06-20 18:23 BingoBoingo: ABOVE THAT: "Dating is part of the WMAF Hapa problem. Our #2 mod is called incelman. Hapa issues started gaining traction after Elliot Rodger blamed being half asian for being incel. The perceived unattractiveness of Asian males is a primary factor behind the huge WMAF imbalance. And a major point of r/Hapas is that the very sons of WMAF are hit by that anti-AM bias. So look we're not a bunch of angry incels just hating on women. We're m

phf: https://pbs.twimg.com/profile_images/1458238253/hanno.jpg and https://upload.wikimedia.org/wikipedia/commons/2/2e/Preet_Bharara_2012_Shankbone.jpg ☟︎

asciilifeform: ben_vulpes: i've personally worked with at least 2 d00dz who were drummed out of american school

BingoBoingo: ABOVE THAT: "Dating is part of the WMAF Hapa problem. Our #2 mod is called incelman. Hapa issues started gaining traction after Elliot Rodger blamed being half asian for being incel. The perceived unattractiveness of Asian males is a primary factor behind the huge WMAF imbalance. And a major point of r/Hapas is that the very sons of WMAF are hit by that anti-AM bias. So look we're not a bunch of angry incels just hating on women. We're m ☟︎

mircea_popescu: cluj is a city on the hill, going to colege there implies (or did at the time) 2 miles / day walked uphill... ah what times.

shinohai: Repeat of the DAO in 3...2..1 .......

asciilifeform: happen first, but A is guarded by B, and C ensures that B cannot happen." This is a temporal logic proof, over a certain code path. It's complex, fragile in the face of code evolution, and totally unacceptable in professional code development. We want flat, simple invariants, maintained by following best practices. Without regard for the correctness of the student's code, we grade such cases a 2 out of 10. They ought to know better,

asciilifeform: and realized, while doing this, that in fact you don't need 2k+2 bits for the karatsuba intermediates, you can do instead of (x0+x1)*(y0+y1) , (x0-x1)*(y0-y1), and then you don't need to propagate carries, but only take absolutevalue and xor the borrows to see if gotta invert the resulting term ☟︎☟︎

mircea_popescu: from birth to about 2 or 3, something like that.

deedbot: pete_dushenski rated phf 2 << deliberate burner.

deedbot: pete_dushenski updated rating of BingoBoingo from 2 to 3 << sober yarn-spinner and green thumb.

deedbot: pete_dushenski rated Framedragger 2 << literate beyond his years but still a green shoot.

jhvh1: BingoBoingo: Ortho GroundClear Vegetation Killer Concentrate-Ortho: <http://www.ortho.com/smg/goprod/ortho-groundclear-vegetation-killer-concentrate/prod70096>; Ortho GroundClear 1 Gal. Concentrate Vegetation Killer-0430510 ...: <http://www.homedepot.com/p/Ortho-GroundClear-1-Gal-Concentrate-Vegetation-Killer-0430510/100001652>; Ortho GroundClear 2 gal. Concentrate Vegetation Killer-0430610 ...: (1 more message)

asciilifeform: the petrol-engined things, aside from vibration ( can't use my hands for day+ after ) and acrid smoke , also made of shit, i've thrown out 2 (after attempting various orc repairs, cleaned carb etc) in frustration

BingoBoingo: Spz you want to plant tomatoes? Now you need 2-cycle concrete saw and rotary hammer before you can even till!

asciilifeform: basic idea is that k's algo transforms a N-bit O(N^2) mult, into instead ~three~ (N/2)-bit mults

mircea_popescu: but yes alf is correct i did base 10 for convenience because most people don't have base 2 mult table loaded in head so dunno what 110 * 101 is

mod6: just was overthinking it .. thought maybe the '2' was a base reference or something

mircea_popescu: mod6 because (a + b) * (c + d) = a (c + d) + b (c +d) = ac + ad + bc + bd. now, in our case, we were doing 11 * 11 and so a = 10 AND c = 10, while b = 1 AND d = 1, and so if you replace you yahve 10 * 10 + 10 * 1 + 1 * 10 + 1 * 1. because 10 * 1 = 1 * 10 you can just write it down as 2 * 10 * 1.

asciilifeform: ( we did not recurse, in this example, explicitly, but if you had -- you would have k := ceil((bitness of x and y)/2) naturally in each level of recursion

asciilifeform: p2*(2**32) + (p1-p2-p0)*(2**16) + p0 ==

mod6: <+mircea_popescu> trivially, 11 * 11 = 121, and also (10 + 1) * (10 + 1) = 10 * 10 + 2 * 10 * 1 + 1 * 1 = 121. << what I can't figure out is where the part: + 2 comes from.

asciilifeform: mod6: mircea_popescu's explanation is correct: K is ceil(bitness/2)

mircea_popescu: that 10 is 1 * 10 ^ 1 ie first part * 2 ^ k.

mircea_popescu: trivially, 11 * 11 = 121, and also (10 + 1) * (10 + 1) = 10 * 10 + 2 * 10 * 1 + 1 * 1 = 121.

mircea_popescu: mod6 you take a number of say 22 bits, and cut it in two 11 bit numbers. this 11 is the k. then you have first part * 2 ^ K (=11) + second part to get the original back

shinohai: Epic logs I missed over past ~2 days .... especially phf's lecture this a.m.

mod6: is this like taking the low-order bits of X0*Y0 << 2*(WORD_SIZE), and (((X0+X1)*(Y0+Y1) - X0*Y0 - X1*Y1) << WORD_SIZE ?

mod6: ok. so there looks to be a section on this in AoCP Vol 2. section 4.3.3. [ Section A ]

asciilifeform: because none of the naive approaches 1) work 2) give any symptom of not working, until you're dead

asciilifeform: addition of 2 B-bit integers needs B+1 bits

asciilifeform: i'll review karatsuba here, ftr. suppose you have 2 L-bit numbers, X and Y, to multiply. you can multiply X*Y the usual way, is O(N^2). but instead anatoly alexeevich k. shows us that you can cut X into X0,X1, ceil(x/2) and floor(x/2) bits, respectively, and same to Y, -> Y0,Y1, and then you only gotta do THREE multiplications, X0*Y0, X1*Y1, (X0+X1)*(Y0+Y1)

asciilifeform: lol , 1st 2 hits -- subj!

scriba: ssh banner of 217.70.190.113 as seen on 2016-06-13: SSH-2.0-OpenSSH_4.3p2 Debian-9

scriba: ssh banner of 89.203.135.138 as seen on 2016-06-13: SSH-2.0-OpenSSH_4.3p2 Debian-9

a111: Logged on 2016-05-03 12:15 mircea_popescu: anyway, if anyone with a box with python > 3.2 on it is willing to give http://cado-nfs.gforge.inria.fr/ a whirl (specifically in regards to the modulus in http://btcbase.org/log/2016-05-03#1461712 ) plox lemme know whether it even worx.

asciilifeform: well, on classical x11 i have, e.g., machine that runs, say, 20 gui proggies, and each one 1) is on an entirely different machine, somewhere else, some of them not even on same continent 2) behaves EXACTLY as if it were running locally, window reshapes, etc 3) none have any shared state with the others, each sees local disk only of own local machine etc ☟︎

deedbot: http://phuctor.nosuchlabs.com/gpgkey/28BBDCC61450814CF3F22DEFA6FD7B74BCF4C1D4A007F3AAB3D611350E614CD0 << Recent Phuctorings. - Phuctored: 1069...5599 divides RSA Moduli belonging to '198.2.36.167 (ssh-rsa key from 198.2.36.167 (13-14 June 2016 extraction) for Phuctor import. Ask asciilifeform or framedragger on Freenode, or email fd at mkj dot lt) <ssh...lt>; ' (rrcs-198-2-36-167.west.biz.rr.com. US CA)

deedbot: http://phuctor.nosuchlabs.com/gpgkey/28BBDCC61450814CF3F22DEFA6FD7B74BCF4C1D4A007F3AAB3D611350E614CD0 << Recent Phuctorings. - Phuctored: 1059...1187 divides RSA Moduli belonging to '198.2.36.167 (ssh-rsa key from 198.2.36.167 (13-14 June 2016 extraction) for Phuctor import. Ask asciilifeform or framedragger on Freenode, or email fd at mkj dot lt) <ssh...lt>; ' (rrcs-198-2-36-167.west.biz.rr.com. US CA)

Framedragger: asciilifeform: unless #2 you meant jurov's pgp packet parser but probably not? (http://siphnos.mkj.lt/datadrop/crap-from-scans-to-be-sorted/pgp.py)

deedbot: http://phuctor.nosuchlabs.com/gpgkey/89B9986669FC0DDDC234C7D8D296527FC8336AD24BDCEABF0945DCA3E0F4425F << Recent Phuctorings. - Phuctored: 1120...8343 divides RSA Moduli belonging to '177.234.2.129 (ssh-rsa key from 177.234.2.129 (13-14 June 2016 extraction) for Phuctor import. Ask asciilifeform or framedragger on Freenode, or email fd at mkj dot lt) <ssh...lt>; ' (Unknown MX CHH)

mircea_popescu: more like 2.5 or so if you weigh the carcass fresh, as opposed to filleted.

jhvh1: asciilifeform: 40 * 7 * 650 * 4184 / ( 34.2 * 10**6 ) = 22.265730994152047

asciilifeform: !~calc 40 * 7 * 650 * 4184 / ( 34.2 * 10**6 )

lobbes: http://btcbase.org/log/2017-06-14#1670306 << amusingly, this is great for pharma-coin though; 1) sell the "ourdemocracy you-are-worth-it-and-can-do-anything" message, 2) create populace of people that end up 'depressed' and feeling 'unfulfilled' because they are fulfilling their natural role as non-human, but told otherwise, 3) extract $>sustenance in form of 'anti-depression' drugz ☝︎

mircea_popescu: aaand in other news, who wants to wire 2.5k for me ? ☟︎

jhvh1: asciilifeform: Bitfinex BTCUSD ticker | Best bid: 2314.3, Best ask: 2316.2, Bid-ask spread: 1.90000, Last trade: 2316.0, 24 hour volume: 53787.68533689, 24 hour low: 2103.1, 24 hour high: 2654.4, 24 hour vwap: None

asciilifeform: betcha pantsuit-congress can't wait to put various things to vote, what with the +1 ( 2? 3? ) advantage.

mircea_popescu: dude... #1, that's primo reason to hang him, and #2, who the fuck loved him ?

mircea_popescu: it's an important exercise, for the "land of the free home of the brave" soviet union citizen 2.0, to review the 1950s movies, and implicitly what things looked like.

mircea_popescu: but maybe it's because http://trilema.com/2013/attention-cunt/#selection-29.0-26.2 only holds in the oregon woods, not in the afghani hillside ?

deedbot: L1: 0, L2: 2 by 2 connections.

asciilifeform: plenty to go from , from welding also -- a crane operator can support 2-3 fucktoys

erlehmann: 1. person rarely sees black girls code 2. person decides this to be an injustice 3. person founds charity with intention to align world with personal sense of justice

mircea_popescu: was this the thing that kept pretending anyoen gives a shit abotu whatever bitcoin v 1650.2 ?

BingoBoingo: <phillipsjk> I found the concept of V interesting. I worry it may have hidden fragility though. I may port it to BSD when I have time. << Already works on any OS with a runtime for a language V is implemented in. Can run on OS/2 Warp

mircea_popescu: 0 by 2 eh ?

deedbot: L1: 0, L2: 0 by 2 connections.

jhvh1: BingoBoingo: Bitstamp BTCUSD last: 2700.35, vol: 17108.73242076 | BTC-E BTCUSD last: 2663.11, vol: 6150.18051 | Bitfinex BTCUSD last: 2694.2, vol: 24703.98366288 | BTCChina BTCUSD last: 2827.998971, vol: 10709.68020000 | Kraken BTCUSD last: 2704.2, vol: 7649.42853527 | Volume-weighted last average: 2715.66268137

mircea_popescu: ah i saw lel. how long has it been for you, 2 years now ?

scriba: ssh banner of 94.156.19.254 as seen on 2016-06-13: SSH-2.0-OpenSSH_4.7p1 Debian-8ubuntu1

asciilifeform: ( each analogue board has 2 independent subunits, see schematic )