log☇︎
62600+ entries in 0.025s
mircea_popescu: dude this shit is intricate.
mircea_popescu: lmao!
mircea_popescu: asciilifeform https://upload.wikimedia.org/wikipedia/commons/c/c8/ErikNaggum_LUGM98_DKL.jpg << berkley back when it could afford actual plates. a short 30 years ago, at that!
mircea_popescu: i suspect chinese has a helluva lot of these.
mircea_popescu: well... he was "provocative". fine example of consensus-building word in world of http://btcbase.org/log/2017-10-08#1722690 because it's "bad" to one group and "good" to the oither so it all works out. ☝︎
mircea_popescu: in other lulz, wikipedia : "Erik Naggum (June 13, 1965 – June 17, 2009) was a Norwegian computer programmer recognized for his work in the fields of SGML, Emacs and Lisp. Since the early 1990s he was also a provocative participant on various Usenet discussion groups.[1]" << accidental hit of the consensus process, because "provocative" seemed both sufficiently insulting to the idiots and actually flattering to the fanbois.
mircea_popescu: and if it gets cut, the logparser sure as fuck has no way to fix it now.
mircea_popescu: because if i don't have the liberty to overload an url i can find no incentive to ever tickmark.
mircea_popescu: experience convinces me that anchor-first is correct way and the url-first html spec a kludge./
mircea_popescu: this sgml corp deliberation ended up inconclusive.
mircea_popescu: how's that ?
mircea_popescu: or else you know, in other `sluts:http://78.media.tumblr.com/8292708d5f10c32dd03e840cbf38b52f/tumblr_msoh7wWpev1snc48co1_400.gif
mircea_popescu: asciilifeform not specifically. could be.
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.
mircea_popescu: it never has to be done again whether done by ":" or by " " lol
mircea_popescu: who's gonna enforce the onceness.
mircea_popescu: how is this cleanner ? same thing, but instead of : you used space.
mircea_popescu: or what is "the clean way" here
mircea_popescu: in chat ?
mircea_popescu: "further cost" aye.
mircea_popescu: looks for next space.
mircea_popescu: yes.
mircea_popescu: logotron can parse them into sense, at a further cost.
mircea_popescu: ager appealing just as i find an <a href=http://trilema.com/2017/little-miss-pretty/#selection-247.0-251.710>oversubmissive</a> overinnocent lawyer appealing."
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
mircea_popescu: if anyone wants to, can.
mircea_popescu: wait what ?
mircea_popescu: gets point of reference baked in into tags ; gives me an incentive to even tagmark in the first place.
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.
mircea_popescu: http://btcbase.org/log/2017-10-08#1723104 << ahahah! i really enjoy these apeloyee-alf discussions, for the record. ☝︎
mircea_popescu: http://btcbase.org/log/2017-10-08#1723088 << the stan-advantage is that you can get anything if you want to. ☝︎
mircea_popescu: http://btcbase.org/log/2017-10-08#1723086 << pretty epic, wall mounted plasma went blank for 10 seconds, castle of frankenstein styles over here. ☝︎
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. ☟︎
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.
mircea_popescu: sooo... just had a lightning so close, made the landline phone ring.
mircea_popescu: they adhere to anything. ☟︎
mircea_popescu: from what i hear they've a new model now.
mircea_popescu: pai nu ?
mircea_popescu: samovar seemed harmless.
mircea_popescu: sadly, nobody had the foresight to fuck them with a spiked pole then.
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. ☝︎
mircea_popescu: and in continuing funz, http://78.media.tumblr.com/8292708d5f10c32dd03e840cbf38b52f/tumblr_msoh7wWpev1snc48co1_400.gif
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 ☟︎
mircea_popescu: ahaha
mircea_popescu: then 2 seems the null hypothesis ?
mircea_popescu: aha. and even after it was invented and before it was published.
mircea_popescu: i know no proof of r-m convergence in terms of factorization.
mircea_popescu: well, so defined it must gcd as primality test.
mircea_popescu: asciilifeform convergence on it is much narrower than mn tries or w/e a week provides.
mircea_popescu: apeloyee the p/np thing is kinda the label used here for all these, zfc, gnfs, etc.
mircea_popescu: if your expectation is that the fifth attempt did not resolve the problem in a manner such as the fifth million would, there's deeper problems.
mircea_popescu: asciilifeform but the test that takes longer and costs more does not consist of manic re-measuring of the same one length, repeated millions of times.
mircea_popescu: "not a root of 1st degree polynomial with smaller parameters than it"
mircea_popescu: this incidentally is a fine statement of what a prime even fucking is.
mircea_popescu: but function, not hash table
mircea_popescu: no, i get it. you want a prime index function.
mircea_popescu: ^ now #1.
mircea_popescu: !#s simona halep
mircea_popescu: oh and in other news
mircea_popescu: asciilifeform yes but this is just the artistic side in you.
mircea_popescu: as per the ancient "doctor, random things in the house are talking to me, am i losing it ?" "have you started answering ?" "not yet" "then not yet"
mircea_popescu: well, the running maybe not, but ~believing~ that it achieved something, surely.
mircea_popescu: jurov shall look into it.
mircea_popescu: and in other bucharest tax office, https://i2.wp.com/www.cronicipebune.ro/wp-content/uploads/IMG_1539.jpg
mircea_popescu: probably should.
mircea_popescu: ^
mircea_popescu: asciilifeform should prolly be user knob tbh.
mircea_popescu: "10 rounds, start from 1".
mircea_popescu: well that's what i'm saying.
mircea_popescu: apeloyee wasn't it exactly r-m restricted to first 10 primes or such ?
mircea_popescu: (and ftr -- aleph (carmichael numbers) = aleph(N) iirc.)
mircea_popescu: but maple did do it.
mircea_popescu: which i assume we won't be doing ?
mircea_popescu: because (((idiots))) start from 1.
mircea_popescu: this is specifically "all prime bases up to 300".
mircea_popescu: 2887148238050771212671429597130393991977609459279722700926516024197432303799152733116328983144639225941977803110929349655578418949441740933805615113979999421542416933972905423711002751042080134966731755152859226962916775325475044445856101949404200039904432116776619949629539250452698719329070373564032273701278453899126120309244841494728976885406024976768122077071687938121709811322297802059565867 for permanent record.
mircea_popescu: asciilifeform https://mathcrypto.wordpress.com/2014/11/29/large-carmichael-numbers-that-are-strong-pseudoprimes-to-several-bases/ ☟︎
mircea_popescu: famously, maple misidentified the guy's number. not because of rng, eiher.
mircea_popescu: depends how you run RM, doesn't it.
mircea_popescu: but we don't have to start low. and we don't really want to, either.
mircea_popescu: asciilifeform https://www.researchgate.net/publication/220161766_Constructing_Carmichael_Numbers_which_are_Strong_Pseudoprimes_to_Several_Bases (guy named arnault gave example of number for which all tests up to ~300 were misleading) ☟︎☟︎
mircea_popescu: Z/nZ < n factor.
mircea_popescu: incidentally, since we're on m-r : do we actually pick 4096 bit bases to avoid the arnault number problem ? to leverage the ffa flatness, as in http://btcbase.org/log/2017-10-07#1722376 ? ☝︎
mircea_popescu: hm
mircea_popescu: it naturally makes assumptions about the item you're testing.
mircea_popescu: but its a probabilistic algo.
mircea_popescu: how ?
mircea_popescu: the true problem here is that there's not going to be a fixtime r-m
mircea_popescu: ugh
mircea_popescu: apeloyee no, because as he well points out, the time it takes is not unrelated to the key.
mircea_popescu: so this is more a r-m problem altogether. as that's not linear.
mircea_popescu: right.
mircea_popescu: hm