log☇︎
2800+ entries in 0.031s
a111: Logged on 2019-01-26 18:16 asciilifeform: speaking of 'where to stop', diana_coman i still dunhave a Troo proof that after r - 1 shots, the squaring loop really does always cycle; so unless i find one, i'ma have to put in a mux there.
asciilifeform: speaking of 'where to stop', diana_coman i still dunhave a Troo proof that after r - 1 shots, the squaring loop really does always cycle; so unless i find one, i'ma have to put in a mux there. ☟︎
asciilifeform: mircea_popescu: you might be thinking of old flamefest ( possibly with diana_coman & mircea_popescu ) where asciilifeform was asked 'why dontcha quit yer dayjob' and asciilifeform answered 'would consider it, if , like the 2 of you, had enuff coin to permanently leave slave market , with x% engineering margin' or sumthing of the kind
asciilifeform: diana_coman et al : i'ma rewrite my proofism from beginning, to see if i committed any other atrocity.
asciilifeform: diana_coman: no hole.
asciilifeform: diana_coman: yours is correct.
asciilifeform: diana_coman: r = 3 indeed. (n - 1)^r mod n == 11^3 mod 12 == 11 == n - 1.
a111: Logged on 2019-01-26 08:58 diana_coman: http://btcbase.org/log/2019-01-25#1889973 -> didn't rummage as too late yest but woke up this morning with this: when a= n-1 step 2.2 aka y=a^r mod n becomes y= (n-1)^r mod n; using for instance binomial expansion you have (n-1)^r = n^r + rC1*n^(r-1)*(-1)+rC2*n^(r-2)*(-1)^2+....+rC(r-1)*n*(-1)^(r-1)+(-1)^r; since the whole thing was "mod n", of all those terms you are in fact left with only the last one, aka y = (-1)^r mod n ; r is odd so
asciilifeform: diana_coman: bin(12) == 1100 . then r = 2. then, (n - 1)^r mod n == 11^2 mod 12 == 1. 12 is pronounced composite.
asciilifeform: diana_coman: you can trivially see that it correctly judges e.g. 12 to be composite.
asciilifeform: diana_coman: it does ~not~ 'always return prime'. only returns prime if (n - 1)^r mod n is 1 or n - 1.
asciilifeform: diana_coman: it's a witness for some numbers. like erry other witness-for-some-numbers.
asciilifeform: diana_coman: correct. in implementations where a is forced to <= n - 2, n - 1 is excluded
asciilifeform: diana_coman: 'nothing to do' is because it's a legit witness! algo returns 'prime'. ( and in non-constanttime incarnations, this is the ideal, shortcut case in fact )
asciilifeform: diana_coman: this dun make sense to me;
a111: Logged on 2019-01-25 19:49 asciilifeform: diana_coman: plox to post if you turn it up.
asciilifeform: diana_coman: i went through the algo, to bake ffaistic proof of correctness, and get n - 1.
asciilifeform: diana_coman: plox to post if you turn it up. ☟︎
mircea_popescu: diana_coman i suspect you're exactly on point.
asciilifeform: mostly unrelatedly -- while diana_coman is awake -- diana_coman can you think of why vanstone et al give n - 2 upper bound for m-r witness ? cuz by theorem, it's good through n - 1
asciilifeform: diana_coman: by same token, a perpetuum mobile is also 'better' engine, dun need to fuel it. the 1 problem is that where do you get one.
asciilifeform inclined to reject koch's optimization ( which diana_coman retained ) where witness consists of rng(bitness_of_n - 2) , and actually make witness equal to rng(width) mod (n - 2) for full range
a111: Logged on 2019-01-22 15:11 diana_coman: it was more of a confusion/mess rather than real problem as such
a111: Logged on 2019-01-05 14:16 mircea_popescu: diana_coman is working for s.mg ; we've recently had this exact talk and revised our plans. originally the idea was to have moved over to cuntoo, and do support work for community-driven effort at a new client. the latter completely collapsed over the shocking weakness of such community ; the former's at best delayed.
a111: Logged on 2019-01-22 15:02 asciilifeform: oh hm i thought diana_coman were baking client nowadays
asciilifeform: when i have a free hand or 2, i'ma apply diana_coman's published method to the thing and see whether cured.
asciilifeform: diana_coman: unless you desperately need mmap in your own proggy, i recommend not to bother with it nao
asciilifeform: but i suspect it's curable via diana_coman's recent method.
asciilifeform: diana_coman: the breakage is documented in the linked thread. it ends up shitting out a reference to an undefined symbol ( of meaningless numeric name ) on which linker then chokes.
asciilifeform: diana_coman: i guess you didnt need limited_controlled in your item
asciilifeform looks fwd to studying diana_coman's example proggy
asciilifeform: diana_coman: iirc you got static linker to work ?
asciilifeform: diana_coman: we had some decent snow here in swampistan also ( and for 1st time in coupla yrs.. )
asciilifeform: oh hm i thought diana_coman were baking client nowadays ☟︎
asciilifeform: diana_coman: a proggy is an 'ideal object', almost anyffin, within obv limits of algo complexity is 'possible'. but in actual practice 'notation is worth 80+/-iq' and some notations make folx into effectively downs syndrome sufferers when the # of moving parts crosses certain threshold
asciilifeform: diana_coman: it is in principle possible to write 'fits in head' c proggy, but afaik the last who knew how was d. ritchie..
a111: Logged on 2019-01-21 17:07 diana_coman: http://btcbase.org/log/2019-01-21#1888880 -> this reminds me of "after first 10 languages or so, ALL the rest are really easy to learn" lol
asciilifeform: diana_coman: once we actually have vacant rk again, i'ma absolutely institute mechanical life tests for'em.
asciilifeform: diana_coman: i'd luvv to establish an exact time of death for the thing. presently unknown tho.
asciilifeform: BingoBoingo: i think diana_coman's q is re the time it was stood up with new drive in aug. do you recall any peculiarity re rk-c at end of that ?
BingoBoingo: <diana_coman> so at first new drive it required several power cycles but then it seemed fine? << But only with the vacant drive. Not with my RK drive.
asciilifeform: was stood up again with new drive. ( and then ~again~ today with fresh one , of same type as presently used by e.g. diana_coman ), same res.
asciilifeform: diana_coman: died with sad drive.
BingoBoingo: diana_coman: This one died with sad drive as well
asciilifeform: diana_coman: i'm all ears, even re the oddest hypothesis anybody can think of.
asciilifeform: diana_coman: the problem with these boxes, is that there is essentially 0 meaningful debug possible
asciilifeform: diana_coman: not iirc. BingoBoingo did you observe this prior ?
asciilifeform: diana_coman's point stands tho, conceivable that it was already rotten even then
asciilifeform: diana_coman: correct
asciilifeform: not sure why enemy would start with idle unit rather than, e.g., diana_coman's, tho
shinohai: !!key diana_coman
shinohai: I still have nfi why the bullet barf, diana_coman says it has to do with proximity things. Hopefully I'll get some time in game to see if negative effects occur.
asciilifeform: ( for folx who haven't yet read diana_coman's series -- the theorem diana_coman turned up, turns m-r into a deterministic ('aks but fast') test, iff generalized-riemann )
asciilifeform: 1 interesting maffs problem , is whether you can generate a sequence of witnesses that will tell troof of compositivity for ~any~ externally supplied N , up to given bitness. ( and as i understand this q is isomorphic to bach's generalized-riemann item that diana_coman dug up. )
asciilifeform: ( recall, diana_coman uncovered various lulz re koch's variant )
asciilifeform: ty mod6 diana_coman
mircea_popescu: when diana_coman moved over the site to uy, she pruned all the shit that was badly out of date and little hope of being brought back up
mircea_popescu: diana_coman wth happened there, Trying 161.0.121.247... Connection timed out etc. site got nuked ?
shinohai: http://btcbase.org/log/2019-01-13#1886522 <<< Thanx, also will report to diana_coman if configuring out bullet has any negative consequences, so far everything renders correctly as far as I can tell. ☝︎
a111: Logged on 2019-01-13 22:41 asciilifeform: ftr , and in re whole thread, asciilifeform is entirely all ears re any thoughts trinque , diana_coman , mircea_popescu , et al, have re subj of what gotta be done in order to reach the black.
asciilifeform: ftr , and in re whole thread, asciilifeform is entirely all ears re any thoughts trinque , diana_coman , mircea_popescu , et al, have re subj of what gotta be done in order to reach the black. ☟︎
BingoBoingo: <diana_coman> BingoBoingo, did you talk to your tech about automating any part of that? << I have not directly requested that no. There was the conversation that lead to http://btcbase.org/log/2018-12-12#1880371 and http://btcbase.org/log/2018-12-18#1881538 ☝︎☝︎
asciilifeform: diana_coman: the painful troof is that's riotously 'uncompetitive' vs. ~the reich~, where 'same' price gets you 100mbit/bidirectional ~per machine~
trinque: diana_coman: would reducing the download capacity to 10mbps harm your use case any?
BingoBoingo: <diana_coman> BingoBoingo, but how *many* accounts did you message out of how many in the db, over what time, what filter(s) did you use and with what results? << The way I've been walking by hand involves looking at the users online list most forums helpfully still offer and going from there. Recently I've taken to looking for "I got banned from X turdservice" threads and blogs then posting targeted copy as demonstrated in one of the
mircea_popescu: diana_coman ikr.
mircea_popescu: diana_coman aha, recall ye olde http://trilema.com/2015/minigame-smg-june-2015-statement/#footnote_3_62044
BingoBoingo: <diana_coman> how do you see that working before pizarro starves? << I worry. The more I think about the marketing and trying to make a plan for marketing I worry. I am in the unhappy position of being out of my depth on the marketing problem, repeating my concerns about my lack of marketing prowess, trying to apply advice as I can while juggling other concerns, and not getting any feedback on incentives that can bring other people in
mircea_popescu: diana_coman i never heard of a body that thrived by eating its fingers, no.
BingoBoingo: If the marketing can't start catching fish. On this point I am working on a response to diana_coman. The short of it is I want help, and I want to know what kind of incentive can bring in some hands to help with marketing.
BingoBoingo: diana_coman: I am presently hand cranking the database walking.
BingoBoingo: diana_coman: I am posting and prodding forums manually, and those are not the only two. Those examples were selected for their relative visibilty. I am getting some noises in response to my fishing now. I plan to meet one fellow from one forum next week while he's passing through the city.
a111: Logged on 2019-01-11 18:06 asciilifeform: and ftr i'm surely doomed to run into diana_coman's puzzler myself, when i go to write a threaded proggy (e.g. adaized trb)
a111: Logged on 2019-01-11 18:03 diana_coman: so that'd be at least the "encapsulated" part explained
a111: Logged on 2019-01-11 17:48 asciilifeform: ( re 'how many witnesses', see diana_coman's article, it reviews the necessary maffs, i.e. P(yer prime aint a prime and you die) == (1/4)^n, where n is # of witness )
a111: Logged on 2019-01-11 15:06 asciilifeform: diana_coman: correct. but i also did not 'ha! let's make it eggog cuz nobody did'
BingoBoingo: <diana_coman> BingoBoingo, specifically and a bit of follow-up on trinque's point above: pizarroisp.net/2019/01/ has this tiny paragraph starting with "action items" - was/is that fleshed out anywhere? << I flesh out Pizarro's situation here http://bingology.net/2019/01/11/more-lessons-learned-pizarro-entering-2019/ I am hoping to get feedback from the Pizarro board (asciilifeform and mod6) and this forum. trinque is the first person to
BingoBoingo: <diana_coman> BingoBoingo, no select script on pizarro's blog? << I'll get it set up in the next couple days.
mircea_popescu: diana_coman answer't.
a111: Logged on 2019-01-13 08:36 diana_coman: mod6, the V check post looks good; maybe move to the new blog your older posts on http://mod6.net/blog.html and update the link at http://mod6.net/ ?
mod6: http://btcbase.org/log/2019-01-13#1886456 << Thanks for reading & feedback diana_coman! I'm working to port over the old-ones as I can. I'll find a temporary solution in the mean time. ☝︎
mircea_popescu: in other news : i'm not entirely current here, but diana_coman does seem to have neatly resolved the ada-cpp linking conundrums. going on which theory, the next step we're upon is what to do with the keys.
BingoBoingo: diana_coman: Apologies for the startling
mircea_popescu: diana_coman it's entirely possible he didn't know.
asciilifeform: congrats diana_coman
a111: Logged on 2019-01-11 15:19 diana_coman: http://btcbase.org/log/2019-01-09#1886075 -> on additional digging, static lib apparently does have libnameinit so yest I was looking for the wrong thing
a111: Logged on 2019-01-11 17:48 asciilifeform: ( re 'how many witnesses', see diana_coman's article, it reviews the necessary maffs, i.e. P(yer prime aint a prime and you die) == (1/4)^n, where n is # of witness )
asciilifeform: and ftr i'm surely doomed to run into diana_coman's puzzler myself, when i go to write a threaded proggy (e.g. adaized trb) ☟︎
asciilifeform: diana_coman: plz dun see the orig statement as ' asciilifeform presumes that diana_coman is dummkopf and problem is trivial, asciilifeform can do it with 1 hand '. i simply dun like to see people sitting stuck, is all.
a111: Logged on 2019-01-11 16:49 asciilifeform: diana_coman: if you're utterly stumped, i can allocate some cycles to the problem tomorrow -- with mircea_popescu's permission ( i swore to him that i will not embroil meself in matters euloric , recall )
asciilifeform: ( re 'how many witnesses', see diana_coman's article, it reviews the necessary maffs, i.e. P(yer prime aint a prime and you die) == (1/4)^n, where n is # of witness ) ☟︎☟︎
asciilifeform: take for example diana_coman's system , where 16 witnesses are used. ( i'd use moar, but let's go with the example. ) so if we're generating 2048b primes (for 4096b rsa mod), per ch.14b timings on asciilifeform's iron this costs ~2.9s per modexp, and thereby ~93sec per m-r procedure.
asciilifeform: unrelatedly: diana_coman , were you ( or anyone else... ) ever able to derive a bound for 's' in m-r ? ( http://ossasepia.com/2017/12/28/eucrypt-chapter-3-miller-rabin-implementation/#selection-125.2765-125.2766 )
asciilifeform: diana_coman: if you're utterly stumped, i can allocate some cycles to the problem tomorrow -- with mircea_popescu's permission ( i swore to him that i will not embroil meself in matters euloric , recall ) ☟︎
asciilifeform: diana_coman: what i meant was, my proggy has no elaborator, and yours -- has, so i am not qualified to say 'here's how to fix elaborator in static lib' of yet.
asciilifeform: but i cannot yet say conclusively. diana_coman is at the bleeding edge of this q.
asciilifeform: diana_coman: if your 'main' is a c/cpp proggy , you gotta trigger the elaborator 'by hand', regardless of which type of lib your ada coad is in, afaik.
a111: Logged on 2019-01-09 14:14 diana_coman: my trajectory in hitting walls on this was precisely that: make it static -> surprise, no adainit exported/included, checked the .a file and everything, went nuts; make it dynamic -> ugh, need -lgnat and whatnot; rtfm again and again, there is this calo-magar
asciilifeform: diana_coman: iirc gcd(0,0) is permitted in your sys also
asciilifeform: diana_coman: indeed gcd aint ever legitimately 0.