log☇︎
2800+ entries in 0.157s
mats: page says 2. i’m not even logged in
mod6: Apache/2.4.29
mircea_popescu: jurov mysql 5.560 / apache 2.4.16 know to work.
mircea_popescu: but the smallest possible factor being 2, two consecutive numbers are always coprime.
Mocky: from my pov, stacking down to *any* 2 stacks is the bulk of the value. but in my mining the stacks are going to converge to q q-1 eventually. and in fact large piles of q q-1 are sitting around waiting to eat incoming small stacks
asciilifeform: would still like a proof that 'in the end always 1 or 2 piles'
Mocky: asciilifeform, ave1's above is not in fact example of immiscible quantities: ave1's final state can be stacked down to q, q-1 by my algo in 2 moves
a111: Logged on 2018-08-25 17:40 Mocky: size of piles are computed by solving the two equations for x and y 1) floor(A)*x + ceil(A)*y = sum(mass) 2) x + y = sum(qty)
mircea_popescu: also, it is imo a great mistake to limit the modelling in terms of 2 pile starter conditions. this is very rarely the case.
a111: Logged on 2018-08-25 17:47 mircea_popescu: the addressable quanta here is the single unit, of a specified quality. these are presented in groups (of the same q), and you're asked to reform the "minimal groups", ie, 2 qualities. whether any individual strand belongs in final-group-A or final-groub-B is however ambiguous until you've made the last move (recursive pov, the last move is tha first move, recursion flows backwardsd, like dream states).
a111: Logged on 2018-08-25 17:40 Mocky: size of piles are computed by solving the two equations for x and y 1) floor(A)*x + ceil(A)*y = sum(mass) 2) x + y = sum(qty)
a111: Logged on 2018-08-24 18:19 mircea_popescu: specifically, how do i pick among alternatives 1. "all stacks with odd index, left, all stacks with even index, right" and 2. "all stacks under 75 or over 125 left, all stacks within 75 to 125, right" ?
mircea_popescu: the addressable quanta here is the single unit, of a specified quality. these are presented in groups (of the same q), and you're asked to reform the "minimal groups", ie, 2 qualities. whether any individual strand belongs in final-group-A or final-groub-B is however ambiguous until you've made the last move (recursive pov, the last move is tha first move, recursion flows backwardsd, like dream states). ☟︎
Mocky: I'm not clear on how you can backtrack piles directly though, as if they were from isolated branches, when possibly final 2 piles from mixed descent and not from isolated mixing
Mocky: size of piles are computed by solving the two equations for x and y 1) floor(A)*x + ceil(A)*y = sum(mass) 2) x + y = sum(qty) ☟︎☟︎
a111: Logged on 2018-08-24 17:49 asciilifeform: all you gotta do is to take { floor(sum(mass) / sum(qty)) - 1 , floor(sum(mass) / sum(qty)) } as the initial guess for the split of qualities of the final 2 piles
a111: Logged on 2018-08-24 17:49 asciilifeform: all you gotta do is to take { floor(sum(mass) / sum(qty)) - 1 , floor(sum(mass) / sum(qty)) } as the initial guess for the split of qualities of the final 2 piles
Mocky: http://btcbase.org/log/2018-08-24#1844275 >> why would you need initial guess for final 2 piles when you can compute them directly from given input? ☝︎
lobbes: still need to test the hell out of it, so I'm aiming for maybe a week (which, still gives me 2 months for auctionbot ETL. eh. will see)
asciilifeform: the 'cheat' is that for ~any~ pile in the tree, you know that it had to result from one of 2 possible merges.
mircea_popescu: specifically, how do i pick among alternatives 1. "all stacks with odd index, left, all stacks with even index, right" and 2. "all stacks under 75 or over 125 left, all stacks within 75 to 125, right" ? ☟︎
mircea_popescu: 2. you split the starting set into two sub sets by the criteria ? and without splitting stacks ?
a111: Logged on 2018-08-24 04:04 mircea_popescu: the ~other~ good approach is 1. calculate average quality as a real ; 2. calculate the integer piles of consecutive qualities this reduces to (you'll never get an irrational value through 1, which in itself is a very itneresting lemma) ; 3. try all pile pairs in some (random ?) order for producing either of the two expected qualities.
asciilifeform: then attempt to permute the list into two sublists which satisfy the recurrence. if the recursion comes up empty, you slide the guess tuple forward by 1. (there is no need to do this more than once, avg of the final 2 piles cannot exceed that of the entire thing)
asciilifeform: all you gotta do is to take { floor(sum(mass) / sum(qty)) - 1 , floor(sum(mass) / sum(qty)) } as the initial guess for the split of qualities of the final 2 piles ☟︎☟︎
asciilifeform: observe that the final 2 piles always satisfy the form n1*q1 + n2*q2 = S , where S is the sum of the masses (n_x * q_x for all x)
asciilifeform: currently i suspect that any 2 miscible-q piles can be merged in either 1 or 2 steps. but too tired to attempt proof just nao
mircea_popescu: the ~other~ good approach is 1. calculate average quality as a real ; 2. calculate the integer piles of consecutive qualities this reduces to (you'll never get an irrational value through 1, which in itself is a very itneresting lemma) ; 3. try all pile pairs in some (random ?) order for producing either of the two expected qualities. ☟︎
mircea_popescu: so far, the correct approach seems to be : 1. select the outlier piles (highest q, lowest q). 2. mix the smaller of the two with such a fraction of the larger of the two as can be done. 3. repeat. if 2 fails, move inwardly on the pair list.
a111: Logged on 2018-08-24 02:02 Mocky: but looky, maybe not 20 steps exactly, but more than 2, *no question*
Mocky: http://btcbase.org/log/2018-08-24#1844187 this was meant to read 2*P ☝︎
asciilifeform: ( any qa-qb miscible pair of piles, can be merged in either 1 ( corresponding to the inner matrices having white line on diagonal ) moves, or 2 ( corresponding to those which do not ) .
asciilifeform: i'ma leave the proof for conjecture #2 here :
Mocky: but looky, maybe not 20 steps exactly, but more than 2, *no question* ☟︎
a111: Logged on 2018-08-23 21:29 Mocky: for example this pile of 4 requires 2 moves: 1x1q 100x1000q 100x1001q 1x2001q, while if you do it without the last pile: the remaining 3 require 20 steps
asciilifeform: now my next conjecture, is that shortest full reduction never will require more than 2*P steps, P is number of q-miscible piles.
asciilifeform: as i see it, this makes for new algo : 1) make list of immiscible piles, henceforth do not iterate with these 2) iterate through possible mixes, solving eqn for Na (for known Nb, entirety of pile B) and k exists . until you end with solely immiscible Q pairs. then stop.
mircea_popescu: !!pay mod6 1.2
mod6: mircea_popescu: yeah, go ahead and !!pay 1.2 BTC back to me, and I'll meet ya on eulora to pay you 100mn ECU. Thanks!
a111: Logged on 2018-08-24 00:21 mod6: Unless you want to also do us the favor of taking the additional 100mn ECU, and just !!pay'ing 1.2 BTC back to Pizarro. Totally up to you. We appreciate very much your efforts on this. I think we'll find a way eventually.
asciilifeform: 'ooops your aunt had stroke and now in nursing home, you owe yer 2 houses'
asciilifeform: so if we say F(q1,q2) = 1 if miscible, 0 if not, then e.g. F(2,3)=0, F(2,5)=1, F(3,5)=1, F(4,5)=0, F(4,7)=1 ...
mod6: Unless you want to also do us the favor of taking the additional 100mn ECU, and just !!pay'ing 1.2 BTC back to Pizarro. Totally up to you. We appreciate very much your efforts on this. I think we'll find a way eventually. ☟︎
Mocky: well, i was given a somewhat different problem statement 2 months ago. more of a software requirement than problem statement actually: http://logs.minigame.biz/2018-06-10.log.html#t18:59:23
Mocky: for example this pile of 4 requires 2 moves: 1x1q 100x1000q 100x1001q 1x2001q, while if you do it without the last pile: the remaining 3 require 20 steps ☟︎
mats: https://marc.info/?l=openbsd-tech&m=153504937925732&w=2
lobbes: psa: looks like my box that houses the archive-o-matic went offline on Friday. It back up and eating through backlog; www should update sometime in the next ~ 2 hours >> http://lobbesblog.com/queryarchive/view_domains.php ☟︎
BingoBoingo: Well, fuel oil and the right fertilizer, and if you search Mcveigh in wikipedo it goes to a disambiguation page listing 2 seperate timothy mcveighs born in the 1960s
asciilifeform: there were at least 2 sov mechanics who climbed into migs and took off.
mircea_popescu: asciilifeform that may be, but what of 11 In furtherance of this conspiracy and to effect the objects thereof, the following overt acts, among others, were committed: 1. On or about February 8, 2017, at approximately 12:10 a.m., defendant JACOB BURRELL CAMPOS entered the United States from Mexico in possession of $9, 500 in U.S. currency. 2. On or about February 8, 2017, at approximately 10:29 p.m., defendant JACOB BURRELL CA
Mocky: in '99 I and 2 others wrote a web framework in java for use in our company's products, no such published thing was extant. shortly after someone else published identical item named 'struts', not stolen merely obvious solution. I then watched the published 'struts' turn into ever bigger piles of shit year over year and suffered job interviewers probing my knowledge of 'struts' and i think that quite colored my
mircea_popescu: anyway, the problems were 1. to determine the brachistochrone, and 2. to find a curve such that if any line drawn from a fixed point O cut it in P and Q then OP^n + OQ^n would be constant.
mircea_popescu: Mocky used to be called "script kiddies", the sort that "1. found this snippet online ; 2. tried it ; 3. decided it works"
asciilifeform: ( usa is pretty far along this zimbabweization continuum, and definitely sliding as we speak, but it is still possible to get parts there in day or 2 , reliably. for nao... )
asciilifeform: BingoBoingo: the correct thing to do, from pov of the 'kulaks', would be to 1) have nuke waste from ru flown in , and spread generously on nao-'government' land 2) for btc
asciilifeform: in 'su 2.0', deceptively easy to physically leave
mircea_popescu: but the process of "1. my broken usgism is superior for all cases i can think of" + "2. would you please change the thing you use so my broken usginsm also works" is fucking annoying on the face. fucking pick one, what's this clintonian dialectic.
asciilifeform: i was about to add 'next will be usg.clone pseudo-FUCKGOATS' but remembered , they already released several , all of course with whitening and voltage booster pissing oscillation into power rail , and afaik all 2 (3? 4?) of'em even less popular than FG ( because why to buy whitened turdrng, intel ships for free on-die )
asciilifeform: ( ffa in particular , only needs a stack, and 2 uarts, 1 for commands, 1 for FUCKGOATS ... )
asciilifeform: and we lose 2 byte of stack space.
asciilifeform: err, there is also 1 ( new mod found for old factor ) and 2 ( new factor with no prior mods )
asciilifeform: currently returns -2 if offered divisor is liquishit (<=1 , or >= mod ) , -6 if not prime , -3 if none of these but not in fact factor .
mircea_popescu: as long as they believe that, they'll vote pantsuit, happily participating in the famous https://www.oglaf.com/hotbuttons/2/ competition (which they lose, seeing how my http://trilema.com/2016/give-computers-the-vote-theyre-cheaper-than-women-even/ overwhelms any biospawn they could come up with ; or more generally given that the sword cuts a portion of the way for them and the whole of the way for us.
a111: Logged on 2018-08-14 18:54 deedbot: http://qntra.net/2018/08/joe-stacking-takes-off-with-2-incidents-in-recent-days/ << Qntra - Joe Stacking Takes Off With 2 Incidents In Recent Days
a111: Logged on 2018-08-14 17:34 phf: i mean to do reliable logging you need to track the whois "on server", and spawn 2 bots per server, which then all negotiate a single consensus message to promote to canonical "this is what was said"
asciilifeform: but intel's soundcard is unremarkable iirc and worx even in 2.4 kernel
deedbot: http://qntra.net/2018/08/joe-stacking-takes-off-with-2-incidents-in-recent-days/ << Qntra - Joe Stacking Takes Off With 2 Incidents In Recent Days ☟︎
asciilifeform: would prolly also need logic to force the 2 to connect via different fleanode boxen etc
phf: i mean to do reliable logging you need to track the whois "on server", and spawn 2 bots per server, which then all negotiate a single consensus message to promote to canonical "this is what was said" ☟︎
asciilifeform: unless i'm thick, after subtracting those 2 fields, can diff.
asciilifeform: i expect there'll be spots where a thing is 1 or 2 places out of order ( fleanode does not reliably preserve same-millisecond ordering iirc ) but aside from that oughta be diffable afaik
a111: 2 results for "http://ave1.org/2018/gnat-zero-foot-print-take-3-regrind/", http://btcbase.org/log-search?q=http%3A%2F%2Fave1.org%2F2018%2Fgnat-zero-foot-print-take-3-regrind%2F
asciilifeform: would be handy if the 2 logtrons could at least output raw data that one could diff in cmdline
asciilifeform: and nobody fucking cares that 'there are 2 moduli divisible by 1547665'. aint prime.
a111: Logged on 2017-02-07 18:49 asciilifeform: hanbot: conceivably, a sabotaged generator that yields 2**32 possible keys, will result in ~0 natural collisions, and remain invisible to phuctor unless i first find it via some other means.
mircea_popescu: ah ok. anyway, if you get spinners, don't get 1tb bs. get 2 or 4 or even 8
BingoBoingo: 1 TB U$S 99, 2 TB U$S 129
lobbesbot: trinque: Sent 2 minutes ago: <asciilifeform> lemme know if this needs additional knobs (jsonism ?) to work with deedbot
deedbot: mod6 rated spyked 2 << TMSR~ Regular
deedbot: mod6 rated ave1 2 << musltronic gnat & TMSR~ things
mod6: !!rate spyked 2 TMSR~ Regular
mod6: !!rate ave1 2 musltronic gnat & TMSR~ things
mod6: !!rate 2 ave1 musltronic gnat & TMSR~ things
deedbot: mod6 rated mats 2 << Pizarro Client, TMSR~ things
mod6: !!rate mats 2 Pizarro Client, TMSR~ things
mod6: (for "Samsung 860 EVO 1TB 2.5 Inch SATA III Internal SSD (MZ-76E1T0B/AM)" x 5) ^
a111: Logged on 2018-03-08 00:20 mircea_popescu: sooo... big deal, 1 sent girl to buy a bagful of phone numbers. they cost, no joke, $2.5 here. EXCEPT, of course, they want your "cedula", you know, "por activacion".
a111: Logged on 2018-08-09 23:56 spykedbot: SSH banner of 202.58.97.178: SSH-2.0-ROSSSH
spykedbot: SSH banner of 202.58.97.178: SSH-2.0-ROSSSH ☟︎
spykedbot: SSH banner of 190.3.49.221: SSH-2.0-dropbear_2013.62
spykedbot: SSH banner of 188.255.132.97: SSH-2.0-dropbear_2014.63
spykedbot: SSH banner of 186.47.170.45: SSH-2.0-dropbear_2013.62
mircea_popescu: !S ssh 181.105.2.222
spykedbot: SSH banner of 180.101.125.226: SSH-2.0-OpenSSH_6.6.1
spykedbot: SSH banner of 143.255.155.51: SSH-2.0-dropbear_2013.62
spykedbot: SSH banner of 143.255.154.65: SSH-2.0-dropbear_2013.62
spykedbot: SSH banner of 143.255.154.52: SSH-2.0-dropbear_2013.62
spykedbot: SSH banner of 14.187.228.175: SSH-2.0-dropbear_2013.62
spykedbot: SSH banner of 115.84.92.92: SSH-2.0-dropbear_2013.62
spykedbot: SSH banner of 114.67.143.10: SSH-2.0-OpenSSH_6.6.1p1 Ubuntu-2ubuntu2.8