2300+ entries in 0.146s
mod6: I can confirm that approximately ".
2" was said to be held in BingoBoingo's custody outside of the deedbot wallet. And I can confirm that I have notes that state that you paid mats .3, and to reduce the amount by .5 total.
a111: Logged on 2018-11-11 00:05 asciilifeform: mircea_popescu: re 'bigendian box' -- i invested in one of them 'asic emulator' mega-fpga thingies, it so happens to come with
2 ppc cores on board, can double as bigendism test system.
Mocky: before leaving for qatar I sold your
2 coins and then my own coin.
Mocky: yes, those
2 turned to cash in person
Mocky: in fairness, absorbed
2 coins choked on third
BingoBoingo: Uruguay may not be rich enought to eat a whole coin, but seems to reliably deliver 500 USD to any given bench within 1-
2 hours of arranging delivery
Mocky: right. yeah was close to two months if not
2.
Mocky: I sold my coin for bank-transferolade and I thought I had mitigated the risk but
2 months later transfers got reversed
a111: Logged on 2017-03-01 19:34 asciilifeform: there is no way to practically compute this value without having a copy of the blockchain. and it also ends up being luby-transformable into any one of the 3 old tx if you have the other
2. a kind of perpetual redundancy in the storage .
deedbot: mircea_popescu paid mocky 0.
2 a111: Logged on 2018-11-09 21:32 mircea_popescu: !!pay mocky 0.
2 mod6: Which I've done a lot of before, but it's pretty unsteady. It gets tired having to look for new work every 6mos to 1 year.... although, I do try to switch mines every
2-3 years.
a111: Logged on 2018-11-15 15:37 mod6: Well, I take that back, not "all" the difference, but it certainly helped. Now, I've got to be in the fascist-tower daily, with a
2+ hour commute every day. It sucks.
mod6: Well, I take that back, not "all" the difference, but it certainly helped. Now, I've got to be in the fascist-tower daily, with a
2+ hour commute every day. It sucks.
☟︎ a111: Logged on 2018-11-11 13:33 mircea_popescu: the "sad" news, from this perspective (though it is boldly and fundamentally the exact opposite of sad) is that no, there isn't any "return to the grand old days" on the table. ~emphatically~ not. bitcoin ain't going back to spending a summer at
2 dollars a coin ; and consequentlly you're not going back to being the mod6 of 2013 on ten hours a week and lukewarm committment.
a111: Logged on 2018-11-13 14:21 asciilifeform: when i started ffa, i did not plan to bake any asm speedups at all. but there's
2 reasons to do it, eventually : one is that on e.g. x86/x64, getting the upper half of a word-sized multiplication, without asm, takes ~four~ MULs plus a buncha additions :
http://www.loper-os.org/pub/ffa/hypertext/ch11/w_mul__adb.htm#95_14 ave1: In C there are
2 ways: (a) in the asm instruction, (b) in the register variable definition
phf: asciilifeform: you can also calm the fuck down, and post your version of gnupg, version 0.3.
2, unsigned is fine, and we can figure out what the issue is. i'll look at the diff and see if 0.3.
2 can be added to v.py as another file
deedbot: bvt paid BingoBoingo invoice
2 ben_vulpes: BingoBoingo:
2 q's: how much pizarro btc were you holding in your deedbot account as of september 7, and how much elsewhere?
a111: Logged on 2018-11-11 13:48 mircea_popescu: and in the same vein : if i lose my fucking carkeys, my "prospective plan for carkey finding" doesn't read ANYTHING like "day 1 : look for carkeys ; day
2 : look for carkeys ; day 3 : look for carkeys ; day 4...".
a111: Logged on 2018-11-11 13:33 mircea_popescu: the "sad" news, from this perspective (though it is boldly and fundamentally the exact opposite of sad) is that no, there isn't any "return to the grand old days" on the table. ~emphatically~ not. bitcoin ain't going back to spending a summer at
2 dollars a coin ; and consequentlly you're not going back to being the mod6 of 2013 on ten hours a week and lukewarm committment.
mircea_popescu: my plan looks like day 1 : look everywhere (no, that ~everywhere~ isn't a manner of speech) while taking breaks to ejaculate profanity and try and think wtf i did ; day
2 : hang all the servants maids etc in the dungeon and gets the hose again until i am satisfied by the account of each one as to how they've not lost my keys for me ; day 3 : get new keys, install webcams, gps trackers and etc."
mircea_popescu: and in the same vein : if i lose my fucking carkeys, my "prospective plan for carkey finding" doesn't read ANYTHING like "day 1 : look for carkeys ; day
2 : look for carkeys ; day 3 : look for carkeys ; day 4...".
☟︎ mircea_popescu: the "sad" news, from this perspective (though it is boldly and fundamentally the exact opposite of sad) is that no, there isn't any "return to the grand old days" on the table. ~emphatically~ not. bitcoin ain't going back to spending a summer at
2 dollars a coin ; and consequentlly you're not going back to being the mod6 of 2013 on ten hours a week and lukewarm committment.
☟︎☟︎ mircea_popescu: mod6 the two prongs of the problem seem to be, principally that you have a lot less time available for this than ~most everyone else, by a factor of
2 or more ; and secondarily that elementary tasks that should take an hour or thereabouts take you multiples, by a factor of 3 or 5 or who knows.
mod6: for #
2: We keep the notes so we know what's going on with all the customer accounts, our ledgers, and general information about on-goings of the business. This is necessary so we don't have to log-spelunk everything. Logs don't work all the time, like right now, the logging for #pizarro is down.
BingoBoingo: <mircea_popescu> what's anyone's experience btw ? cca how long does it take to ~keep current~ with logs on a weekly basis ? << I do anywhere from
2 to nearly 4 hours a day on logs when rabbitholing is factored in
mircea_popescu: at ; 8.
2 hours preparing and publishing some data to give base to future rescue op.
mircea_popescu: so to summarize : 1. one hour (!?) wrangling with auctionbot on the 4th (the result still wrong) ;
2.
2 hours handling three conflated processes (why do you keep notes as an intermediate step ?) on the 5th ; 3. 1 hour reading logs on the 6th ; 4. half hour reading logs on the 7th ; 5. 1.3 h mostly brainstorming on the 8th ? ; 6. half hour doing... i don't know what on the 9th ; 7. 4 (four ?!) hours doing i still don't know wh
mircea_popescu: because whatever is there extra is padding. so instead of returning 6 correct records and discarding
2 records' worth of padding, you return 8 records, and let the application asking for records figure out that "6" means it needn't process 7 and 8
diana_coman: that sounds like the "we can haz dinastyyy
2"
deedbot: asciilifeform updated rating of bvt from 1 to
2 << adatronics
diana_coman: fwiw those past few days I had to get back to some C/CPP code and there was this funny moment where I read some code adding
2 vars of different types and my mind went instantly eeeek
a111: Logged on 2018-09-19 16:22 mircea_popescu: think of the whole opposability angle, will you. 1. alf : "your summaries suck"
2. bimbo "master, is this true ?" now i'm stuck. i'm not going to do a 3.b. "yes, because i like him" and i can't do a 3.a. "yes, because ~SOMETHING~" as the something's an undefined symbol.
Mocky: well power of
2 values i see
BingoBoingo: mircea_popescu: It was on the defaults.
2 GB rockchip and while not a trilema sized blog, bigger than most on mp-wp
mircea_popescu: 20 bux worth of paypal and 5 grand worth of web
2.0 debug
mircea_popescu: ideally also has compatibility layer, which allows it to import gpg
2.0 and 1.4 style keys (and converts them to republican format), verify gpg
2.0 and 1.4 sigs and decrypt gpg
2.0 and 1.4 messages (but not encrypt to them).
a111: Logged on 2018-10-30 19:50 mircea_popescu: asciilifeform ok, how about this : let K being the key n bits long (say 512), and let f(x) =
2 * K[0] * x ^ n + 3 * K[1] * x ^ n-1 + 5 * K[
2] * x ^ n-
2 + 7 * K[3] * x ^ n-3 + 11 * K[4] * x ^ n-4 +...+ 3643 * K[n-
2] * x ^
2 + 3659 * K[n-1] * x + 3659. f(x) will produce a pile of bits, this pile is cut in half and xored together, the result is cut in half again. one such half is returned as the prng output ; the other such half
mircea_popescu: "<mircea_popescu> as much as you have now, could have been had then! for, literally, 1-
2 man-days, at teh most. you dispute this ?" "<asciilifeform> mircea_popescu: nope. couldn't" "<mircea_popescu> sooo! what portion of this do you dispute ?" "<asciilifeform> that 'could have then' "
mircea_popescu: as much as you have now, could have been had then! for, literally, 1-
2 man-days, at teh most. you dispute this ?
mircea_popescu: im not attached to serpent in any way other than in the following sense you're well fucking advised to pay attention to : 1. s.mg is a corporation, meaning ith's here to make money.
2. s.mg is also trying, but as a fucking distant second, to be a "good" corporation, however that is politically defined. it doesn't give a fuck about this, not in any deep sense, if the money's good it'll go against policy, and CHANGE policy as i
mod6: Speaking of hockey... played in another game. Wasn't nearly as out-of-shape as last time. No goals though, but
2 assists, 7 SOG, 1 Hit.
mircea_popescu: asciilifeform ok, how about this : let K being the key n bits long (say 512), and let f(x) =
2 * K[0] * x ^ n + 3 * K[1] * x ^ n-1 + 5 * K[
2] * x ^ n-
2 + 7 * K[3] * x ^ n-3 + 11 * K[4] * x ^ n-4 +...+ 3643 * K[n-
2] * x ^
2 + 3659 * K[n-1] * x + 3659. f(x) will produce a pile of bits, this pile is cut in half and xored together, the result is cut in half again. one such half is returned as the prng output ; the other such half
☟︎ diana_coman: mircea_popescu, we agree on the result but not on the formula, lol; your formula says e(
2)=p(
2) xor k(1)*p(1) xor k(
2)*p(
2) xor k(3)*p(3) xor k(4)*p(4) right?