log☇︎
152500+ entries in 0.095s
asciilifeform: you do it again, and corrected version gets in the tagset.
mircea_popescu: and if it gets cut, the logparser sure as fuck has no way to fix it now.
asciilifeform: no real need to parse the urls or define how they are to be eaten.
asciilifeform: you do though, just put this url in a `foo line .
mircea_popescu: because if i don't have the liberty to overload an url i can find no incentive to ever tickmark.
asciilifeform: why not the simplest variant : `foo adds this line to the tagset.
mircea_popescu: experience convinces me that anchor-first is correct way and the url-first html spec a kludge./
mircea_popescu: how's that ?
asciilifeform: i also favour postfixation for this
asciilifeform: gotta be an exceptional thing
mircea_popescu: asciilifeform how logotrons use this raw info is left to operator tbh.
mircea_popescu: reason i prefer the `tag:url format to the `tag url format is that space is too syntactically meaningful.
asciilifeform: the url is now head of the list of what comes out when you click 'overcompetent' in logview
mircea_popescu: it never has to be done again whether done by ":" or by " " lol
asciilifeform: it never has to be done again
mircea_popescu: who's gonna enforce the onceness.
asciilifeform: ( ideally you would do it to first pop of something )
mircea_popescu: how is this cleanner ? same thing, but instead of : you used space.
asciilifeform: why not tag the urls the clean way
asciilifeform: pray tell mr babbage...
mircea_popescu: logotron can parse them into sense, at a further cost.
mircea_popescu: i imagine the sane way to represent "outlyers are interesting. i find an `overcompetent:http://trilema.com/2013/whore-strat/ teenager appealing just as i find an `oversubmissive:http://trilema.com/2017/little-miss-pretty/#selection-247.0-251.710 `overinnocent lawyer appealing." in html is via the usual anchor mechanism, as "outlyers are interesting. i find an <a href=http://trilema.com/2013/whore-strat/>overcompetent</a> teen
asciilifeform: but i'd rather see a cleaner method where it happens via the usual phf backarrow ☟︎
mircea_popescu: if anyone wants to, can.
asciilifeform: well items that already happened, gotta be tagged
mircea_popescu: gets point of reference baked in into tags ; gives me an incentive to even tagmark in the first place.
asciilifeform: what's that do
mircea_popescu: asciilifeform the more complex construction, `tag:url
mircea_popescu: evolvospec, for the record, is not a spec, exactly in the manner a bad girl may be great fun to be with but notrly a wife.
mircea_popescu: if the argument's good enough, at any rate.
mircea_popescu: asciilifeform maybe we can push a year 0 on the misfortunate kind hearts trying to follow this evolvospec.
mircea_popescu: somehow he manages to need much much less hammer to hammer in a point, for which i confess to admiring the man.
asciilifeform: and would need a 'year 0' where old logs before time T dun get parsed by tagfinder
a111: Logged on 2017-10-08 23:19 asciilifeform: now, good noose is that it in fact worx...
mircea_popescu: http://btcbase.org/log/2017-10-08#1723104 << ahahah! i really enjoy these apeloyee-alf discussions, for the record. ☝︎
asciilifeform: iirc we found that every other char's been clobbered to death already
a111: Logged on 2017-10-08 22:13 asciilifeform: they still got'em in mircea_popescustan?!
mircea_popescu: http://btcbase.org/log/2017-10-08#1723088 << the stan-advantage is that you can get anything if you want to. ☝︎
a111: Logged on 2017-10-08 21:49 shinohai: "Hey MP, this is Thor .... what's shakin?"
mircea_popescu: however, as a chat anchoring convention i could actually get myself to do it, as that's 99% of what i wish i could do and currently can't, frustrates me once a week with some regularity.
mircea_popescu: i confess i tried to introduce `tickmarks into my process as such, but it ends up ~looking~ fucking retarded. i'm not even know if it just looks that way but isn't, or actually is. huge inertia against it though. ☟︎
a111: Logged on 2017-10-02 19:52 mircea_popescu: so what is the idea here, if i wish to review the state of this, other than asking you, i could also what ? !#s ffa ?
mircea_popescu: how about this format re `tagging:http://btcbase.org/log/2017-10-02#1719766 ? ☝︎
mircea_popescu: outlyers are interesting. i find an `overcompetent:http://trilema.com/2013/whore-strat/ teenager appealing just as i find an `oversubmissive:http://trilema.com/2017/little-miss-pretty/#selection-247.0-251.710 `overinnocent lawyer appealing.
asciilifeform bbl, will continue the misadventure later
asciilifeform: because what sucks moar than 'ugly' ? how about 'ugly AND wrong answers'
asciilifeform makes a http://wotpaste.cascadianhacker.com/pastes/bnsZv/?raw=true and then notices that it not only is always off by smallint, but there is no way to fix, because the carries from the ( not used for anything else ) bottom halves of the muls, now are lost .
asciilifeform: grr, top, halves
asciilifeform: ( notice, we only use the bottom halves of XHi*YLo and XLo*YHi )
asciilifeform: though i suspect that this top-only multer oughta recurse...
asciilifeform: ( conceivably on a box with smaller cache, there could be speedup. )
asciilifeform: bad is that apeloyee was not only right re 'no more than 10%' but in fact there is NO observed speedup:
asciilifeform: now, good noose is that it in fact worx... ☟︎
asciilifeform: or hm, there's gotta be a mistake in my test, bbl
asciilifeform: there is a missing term
a111: Logged on 2017-10-08 18:17 apeloyee: compute the higher part of product X*Y as XHi*YHi+ShiftRight(XLo*YHi+XHi*YLo, K), where K is size of XLo and YLo
asciilifeform: http://btcbase.org/log/2017-10-08#1722777 << this btw does NOT work ☝︎
asciilifeform: and large multron is made of a quantity of half-sized ones, they - half-sized again, and so on.
a111: Logged on 2017-10-08 20:57 mircea_popescu: i expect you just get one mult for the largest size and reuse it indefinitely, nfi what he's on about with the 2n luts for every sum
asciilifeform: http://btcbase.org/log/2017-10-08#1723072 << mul is not add, can't do this, the wider register costs you nonlinearly moar time ☝︎
a111: Logged on 2017-10-08 20:43 apeloyee: not if it needs 8x more temp space << and karatsuba totally doesn't.
asciilifeform: http://btcbase.org/log/2017-10-08#1723064 << gcd does not need a karatsuba, the karatsubatron can be doing something else while gcd happens ☝︎
a111: Logged on 2017-10-08 20:12 apeloyee: why not lak waht's already public: the list of small primes. that' not a compromise.
asciilifeform: http://btcbase.org/log/2017-10-08#1723058 << which op is it that only leaks 1 of its 2 operands ? ☝︎☟︎
shinohai: "Hey MP, this is Thor .... what's shakin?" ☟︎
mircea_popescu: sooo... just had a lightning so close, made the landline phone ring.
hanbot: at least the walls'll say muie long after the mouths've stopped
mircea_popescu: they adhere to anything. ☟︎
mircea_popescu: from what i hear they've a new model now.
hanbot has doubts adhering to that list of 'rules' is even possible for most speakers
mircea_popescu: sadly, nobody had the foresight to fuck them with a spiked pole then.
a111: Logged on 2017-08-01 17:22 asciilifeform: http://btcbase.org/log/2017-08-01#1691747 << this almost suffices to qualify as crane operator!111
mircea_popescu: http://www.beatmort.ro/aberatii/internalnote.php << in ancient lulz, rather related to http://btcbase.org/log/2017-08-01#1691973 ; this was genuinely a major piece of ro internet culture late 90s, when ustards started to "invest"/move in. ☝︎
apeloyee: yes, that would fit no fpga one can buy
mircea_popescu: i expect you just get one mult for the largest size and reuse it indefinitely, nfi what he's on about with the 2n luts for every sum ☟︎
apeloyee: can reuse that
apeloyee: you trade temp space for performance.
apeloyee: not if it needs 8x more temp space << and karatsuba totally doesn't. ☟︎
apeloyee: as usual, if primitives don't leak- this won't leak anything but the small primes. this is obvious. or are we doing associativity proof in peano arithmetic or other hair-shirt arcana (c)
asciilifeform: we only have gigantic integers, and single bits. that's it.
asciilifeform: not to mention that we do not have such a thing as a small integer.
asciilifeform: because go and prove that it is ALL you leaked.
apeloyee: why not lak waht's already public: the list of small primes. that' not a compromise. ☟︎
asciilifeform: who wants to fuck camels, can go use openssl.
asciilifeform: no camel's nose in the tent.
asciilifeform: ( i.e. every time you write down a '+' that's a minimum of 2N LUTs used up, that cannot be used for anything else, where N is the operand width )
apeloyee: oh noes, the enemy will learn that the first primes are 2,3,5,7,11,..!!!
asciilifeform: understand that in fpga 'secret shift' is NOT a function that can be 'called', but a physical object that gets instantiated, using thousands of cells, every time you use it.
apeloyee: what, the small primes are a secret?
asciilifeform: we're still doing constant times.
apeloyee: pack p1, p2, ... pn so it doesn't take much more space, than the product thereof.
asciilifeform: but you're welcome to try.
asciilifeform: ( and probably not even on pc, where it will get thrown out of cache )
asciilifeform: not if it needs 8x more temp space
a111: Logged on 2017-10-07 21:48 apeloyee: http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-prime-fit-in-your-primorial and find what number of primorial is congruent to it using chinese remainder theorem
apeloyee: I think http://btcbase.org/log/2017-10-07#1722402 will win over quadratic gcd. ☝︎
asciilifeform: and incidentally i was not joking when said 32kb, it is fully my intention to eventually put whole thing on fpga where there will be certainly not even half MB of working space.
apeloyee: but you said you was wrong in estimating performance every time!! :P
asciilifeform: barrett needs large scratch buffer for the mults; gcd can happen in-place.
asciilifeform: (i.e. you still win if you take 500x the cpu cycles, so long as you don't get cache-evicted)