tmsr - Search: i

53500+ entries in 0.349s

spyked: same value I see in "propuneri de masuri pentru imbunatatirea [...]". historical.

mircea_popescu: there's a petulent dork going about on twitter about he "wrote about bitcoin before it was cool". i suspect the whole "cypherpunk" group of kanzure s secretly hold the same belief, that they're relevant through their failure.

mircea_popescu: i guess the argument could be made, but what's it pay ?

a111: Logged on 2017-10-03 13:34 mircea_popescu: even exists in early anglo stuff, christ resurrector, christ almighty etc. though the vein exhausted itself readily and apparently without leaving much trace. i guess in the same way "everyone" knows of bedwetter's 1984 but nobody read point counterpoint, notwithstanding that huxley is the important kid in that class, not fucking blair.

spyked: http://www.220.ro/umor-romanesc/Horatiu-Malaele-2-Vaci/nUSRHOCJEP/ <-- ro. only, unfortunately; also buried under piles of shitads, but I salvaged the videofile. ☟︎

spyked: http://btcbase.org/log/2017-10-01#1719047 <-- lol! this reminds me of a horatiu malaele piece (Romanian actor/comedian), "doua vaci". wait, it was on the interwebz (I should translate it anyway at some point) ☝︎

spyked: (read through the old newspapers at some point. I think it was through Trilema piece?)

a111: Logged on 2017-09-30 19:14 mircea_popescu: sorry asciilifeform . all i have are my own notes, which are as all hand notes useless without hte backing of the library of origin (in this case, the universitary library of cluj). teh interwebs dun seem to have a "here's the list of trotsky letters".

mircea_popescu: as it happens i was JUST reading http://trilema.com/2017/the-practical-costs-of-hallucinated-freedom/#selection-549.0-549.226 which is eerily apropos.

spyked: http://btcbase.org/log/2017-09-29#1718287 <-- would buy, esp. if custom pcb cannot be avoided (and I suspect this is the case). ☝︎

mircea_popescu: oh i see

mircea_popescu: http://btcbase.org/log/2017-10-08#1722501 << pretty weird, middle east tensions apparently resolved through tribute ? i can make no sense of it whatsoever. ☝︎

asciilifeform: i have deeply nfi

asciilifeform: http://btcbase.org/log/2017-10-08#1722470 << is why i suggested it to begin with, zaps items with factors up to 16bit or so quickly ☝︎

a111: Logged on 2017-07-03 14:46 phf: i think ascii already made that point, that if you're profiling lisp with the vm startup, then you should also profile c machine from boot time. at the very least the vm should be warmed up by loading all the dependencies into the core, doing save-lisp on it, and then making sure that your foo.lisp has an up to date fasl. inside lisp though to achieve the optimizations you run variants of your function inside (time ...) until you bring it within the ra

a111: Logged on 2017-10-07 16:42 shinohai: I get 0m1.236s using sbcl (i5)

asciilifeform: http://btcbase.org/log/2017-10-07#1722367 << i gotta ask if this figure included sbcl load time !? ☝︎

asciilifeform: tldr : initial py snippet i had lying around was braindamaged.

asciilifeform: ( mainly, i suspect, by recognizing masses of 0 in karatsuba and returning 0 when they get mul'd )

asciilifeform: http://wotpaste.cascadianhacker.com/pastes/saynG/?raw=true << all1s. 0.028s. tho i do suspect it shortcuts internally.

asciilifeform: phf, mod6 : funnily enough i went and tried the 'fair fight' max(4096b) a^b mod c in python, http://wotpaste.cascadianhacker.com/pastes/GHATB/?raw=true , but it... bombs

asciilifeform: i proposed primorial strictly as an initial winnowing to replace the idiot trial divisions koch et al used.

asciilifeform: http://btcbase.org/log/2017-10-07#1722411 << 1 ) ffa is closed form. i.e. it CAN be written as a number of nand gates, with a 'funnel' at the top, to which you present a,b,c, e.g. 4096bit, numbers, and at the bottom in a little cup you get a^b mod c , and with NO UPWARDS FEEDBACK FLOW of information , i.e. answer comes after same interval of time always, and with strictly downwards signals. ☝︎☟︎☟︎

a111: Logged on 2017-10-07 21:28 apeloyee: http://btcbase.org/log/2017-10-05#1721485 << i thought bernstein's "how to find smooth parts of integers" suggests a remainder tree, not gcd?

asciilifeform: http://btcbase.org/log/2017-10-07#1722400 << bernstein's gcd method is neither here nor there, i certainly don't need anything of the kind in ffa, and quite likely it fundamentally does not ffaize ☝︎

asciilifeform: http://btcbase.org/log/2017-10-07#1722397 << i don't see anything that only wants ~lower~ half... whatcha talking about ☝︎

a111: Logged on 2017-10-07 21:09 apeloyee: asciilifeform: turns out a simple, ffa-suitable O(N^2) algorithm exists for GCD. This is adapted from GMP docs with one extra operation in the loop: http://p.bvulpes.com/pastes/oupUJ/?raw=true . Note: the code as posted is likely wrong, but I'm sure the idea can be made to work.

asciilifeform: http://btcbase.org/log/2017-10-07#1722394 << this looks very , very painful to prove correctness of. i'ma come back to it. ☝︎

BingoBoingo: Trilema re-read of the day http://trilema.com/2014/how-i-was-wrong-cuckolding-or-a-story-about-sigmas/

a111: Logged on 2017-10-07 19:28 asciilifeform: http://btcbase.org/log/2017-10-07#1722358 << point was exactly to compare like items. i.e. heathendom does NOT get to 'win' by 'oh hey the hamming weight of exponent is only 2, not 4096, so we only do 4 modexps and not 8192'

a111: Logged on 2017-10-07 19:30 asciilifeform: i also suspect that they are in fact slower for maxhammingweight case of exponentiation and modulus, vs ffa.

apeloyee: http://btcbase.org/log/2017-10-05#1721485 << i thought bernstein's "how to find smooth parts of integers" suggests a remainder tree, not gcd? ☝︎☟︎☟︎

apeloyee: asciilifeform: turns out a simple, ffa-suitable O(N^2) algorithm exists for GCD. This is adapted from GMP docs with one extra operation in the loop: http://p.bvulpes.com/pastes/oupUJ/?raw=true . Note: the code as posted is likely wrong, but I'm sure the idea can be made to work. ☟︎

apeloyee: !~later tell trinque I put the key at http://p.bvulpes.com/pastes/oRT3V/?raw=true

asciilifeform: i also suspect that they are in fact slower for maxhammingweight case of exponentiation and modulus, vs ffa. ☟︎

asciilifeform: http://btcbase.org/log/2017-10-07#1722358 << point was exactly to compare like items. i.e. heathendom does NOT get to 'win' by 'oh hey the hamming weight of exponent is only 2, not 4096, so we only do 4 modexps and not 8192' ☝︎☟︎☟︎☟︎

a111: Logged on 2017-10-07 16:49 mircea_popescu: my guess is that it's as close to closed form solutions as possible, hence all the barrett fucking etc, but then again i'm a weak programmer and a very dubious mathematician.

mircea_popescu: my guess is that it's as close to closed form solutions as possible, hence all the barrett fucking etc, but then again i'm a weak programmer and a very dubious mathematician. ☟︎

phf: i'm trying to figure it out from first principles :) (i haven't had time to look at the recent, i.e. past month, versions yet)

phf: i suspect that ffa's take on expmod is to iterate over every bigit of the exponent, which will have to perform base operations no matter what the numeric size is, but that's a guess.

shinohai: I get 0m1.236s using sbcl (i5) ☟︎

phf: well, it's conveniently two strategies: closed form solutions and constant iterators. if you don't have a closed form solution, you have to iterate, which you simply do at the upper bound constraint by a data type size. i don't see how theoretically it can be anything else

phf: i guess the point of this exercise is to show that iteration sizes further leak timing information

mod6: (fwiw, that machine I just ran it on has Python 2.7.9)

mod6: ahh, right. i recal.

mod6: (other than the ffa-fact, which i use sometimes to try new, whole, ffa parts out)

mod6: mainly, I read through them. because, there's still a lot for me to grok here. and it's easy to fool oneself into groking if you treat it like a blackbox instead of actually reading the code.

asciilifeform: it is tempting, because currently i suspect that ~nobody is actually running my pastes

asciilifeform: currently i generate them with a pyturd

asciilifeform: i've been holding off on releasing the p-interpreter because there are several quite broad changed in the way that it worx, in the pipeline, and i'd rather folx not get used to the old form.

mod6: i'd like to also maybe make some unit tests around your procedures/functions.

mod6: i think ima make a quick one for myself just so i can see what youre sayin on stuff like that.

asciilifeform: mod6: i've been using (unreleased) 'p' as the tester.

asciilifeform: ... could even live with this, if i had a hard proof that it's never moar than 3.

asciilifeform: '...I think a formal apology should be handed out, and the teacher involved should be reprimanded,” he added. '

diana_coman: http://btcbase.org/log/2017-10-07#1722059 <- yes, I got that as part of my previous log combing on this ☝︎

asciilifeform: phantom limb, i tellya.

mod6: yeah, i read the thread a few times.

asciilifeform: mod6: i'm currently not convinced that lehmer's gcd is ffaizable.

mod6: while i was at it, looked at crc hanbook's lehmer gcd.

asciilifeform: i'ma suppose mircea_popescu's scenery is fatally boring, must be

asciilifeform: http://btcbase.org/log/2017-10-07#1722233 << what's yer altitude, mircea_popescu ? because i can't picture why else ☝︎

asciilifeform: i left it as unhandled exception, mircea_popescu laughed, we had thread

mod6: her haggard old bag of a mom didn't approve? or did i dream this up?

asciilifeform: i dun live anywhere near georgetown; and walk in semideserted sticks, in rags.

mod6: alf's suits must look pretty good though. i mean, he's out there walkin' through georgetown and rando frauleins are flashin their twat at him.

mircea_popescu: used to. i suppose this place being ~a village doesn't help.

mod6: mircea_popescu: ah, that's about where i'm at I suppose. i have it in my mind that you do the ba walk nearly daily...

mircea_popescu: mod6 anyway, i'm not a young man anymore. i maybe do 10km a week these days, if that.

a111: Logged on 2016-01-07 01:58 asciilifeform: relative of mine once took - very worn - pair of american shit-shoes to an old ru emigre shoemaker, asked 'what he could do.' the wizened master replied: 'i can throw these out for you'

mod6: i've worn out one pair, they took 'em back for $100 and re-soled them.

mircea_popescu: asciilifeform consider : i've yet to throw out a pair of shoes because ~broken~.

mod6: i spend $400 on mine. so yah, not cheap... but shit, what a difference.

mircea_popescu: i'd call these medium.

asciilifeform: i dun have any nice shoes tho. strictly chinesium.

mod6: the pairs i have are this cork that molds to my feet. which feel pretty good day to day. but i walk like 10% of what you do.

mod6: ah, i bet the gel is nice.

mircea_popescu: http://www.anatomicgel.com.br/br/marca.html/ <<< i suppose it could be theoretically called handmade, pushing a point.

mod6: can wear suits everyday, and walk the mile or two that I need to every day and still be ~fine~.

mircea_popescu: so i bought this five bitcent pair of "finest brazillian shoes".

asciilifeform regularly runs into this species, 'i'm into btc!!' '...node?' 'wat's a node'

mod6: i heard dimon's daughter is into btc, we should see if she wants to do tits4btc

mircea_popescu: lol i c

a111: Logged on 2015-08-19 23:55 mircea_popescu: what, "i'm a boy from tenesee here to die for some fat bitch's right to marry her dog" ?

mircea_popescu: i wish to fucking know, at what point has buying bitcoin been a bad strategy ?

mod6: but i see what you mean. sorry for the interleaving Mr. P.

mod6: i.e. trying to equate your implementation to crc barrett.

mod6: asciilifeform: ahh. thanks for saving me the time -- i was doing some mental gymnastics on that.

mircea_popescu: or don't i understand "how the world works"

mircea_popescu: momentarily back to http://btcbase.org/log/2017-10-06#1721672 discussion, i must say i'm reasonably impressed that ~none of the "public discourse" in jew/faux media includes the "nobody can understand WHY"/"such INCOMPREHENSIBLE" mandatory verbiage of five years ago. ☝︎

asciilifeform: mod6: you will notice that the barrett in 'crc handbook' is more complicated : it shrinks the x and then compensates later. this relies on normalization , and constanttimeized incarnation of it would have to work as apeloyee described ( i'ma try it much later, once i see what can be had re speed strictly from having asymmetric karatsuba instead of the current mega-waste ) ☟︎

asciilifeform: ftr i have nfi if that thing worx

a111: Logged on 2017-09-16 02:57 PeterL: by the way, I stuffed the keccak ada stuff (and, speaking of OAEP, here is one of those too) into https://github.com/PeterMLambert/keccak since I don't have my own server up yet

mircea_popescu: i recall his working on it ?

mircea_popescu: asciilifeform as it happens i actually want to rescue the (classic) keccak implementation from the obvious nist-driven oblivion.

mircea_popescu: anyway, if anyone can cough up a manner to evaluate, any particular scheme, or even a comparison of a pair, i'm of course all ears.

mircea_popescu: basically the scheme is, you rsa a random bitfield, then you expand that into as much otp as you want by doing recursively Fi = hash(bitfield + Fi-1). there's a limit on i, obviously, which can be set to 1. ☟︎☟︎

mircea_popescu: "In case you did, i hope this will be a lesson to you. Stop trading obscure tokens/coins!" << if THIS is "the lesson", then one wonders wtf is supposed to be the "ethereum value proposition" ?

mircea_popescu: asciilifeform in fact, whole reason i'm even willing to do w/o email is that there exists this alternative thaty's so much better.