Show Idle (>14 d.) Chans
← 2018-08-23 | 2018-08-25 → ↓
00:00 Mocky maybe i'm dense, what do you mean reduce a pile at least in half?
00:01 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.
00:01 mircea_popescu Mocky he means the x% is never < 50% and rarelyt <80%
00: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.
↖
00:06 Mocky ok, I see it
00:06 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
00:06 * asciilifeform bbl
~ 2 hours 17 minutes ~
02:24 mircea_popescu anyway, i expect the "hard" case would revolve around powers of two, so i'm guessing checkermark pairings probably deliver the hardest case (for current pairwise mixing). say in 8 bit : 85 items q170, 146 items q 73, 219 items q109 and so on.
~ 27 minutes ~
02:51 mircea_popescu http://btcbase.org/log/2018-05-22#1816827 << dug up! it's http://trilema.com/2014/on-the-superiority-of-monarchy-or-adnotations-to-why-the-worst-get-on-top/#selection-153.0-153.557
02:51 a111 Logged on 2018-05-22 21:47 mircea_popescu: so far that's even the reason empire crossed the threshold into oblivion ( i'm too lazy to dig up ye olde trilema where i say "state may exist for as long as it so closely mimmicks my will i can't discern it's there, and not one second past that" ) and now must be destroyed. had it had the sense (rather, the capacity) to maintain both forms, i'd nwever have even noticed it, and it could have continued to exist therefore.
~ 7 hours 21 minutes ~
10:13 mod6 mornin'
10:22 mircea_popescu heya.
10:29 * mod6 tired.
10:29 mod6 need coffee
~ 2 hours 3 minutes ~
12:33 asciilifeform mircea_popescu: i solved yer puzzler, will post sln later today
~ 38 minutes ~
13:12 mod6 !!invoice BingoBoingo 0.01341464 One month rental of rockchip: Through September 2018
13:12 deedbot Get your OTP: http://p.bvulpes.com/pastes/TGAsi/?raw=true
13:20 mod6 !!v DC1B15C060167472D1E14D037637116C56F6EC6D92BD265DD8C64281D7F45030
13:20 deedbot Invoiced BingoBoingo 0.01341464 << One month rental of rockchip: Through September 2018
13:30 mircea_popescu "Solution (.Sln) File - msdn.microsoft.com The new home for Visual Studio documentation is Visual Studio 2017 Documentation on docs.microsoft.com. The latest version of this topic can be found at Solution (.Sln) File. A solution is a structure for organizing projects in Visual Studio. The solution maintains the state information for projects ..."
13:30 mircea_popescu way to go alf !!1 >D
13:31 mircea_popescu (holy shit think about it, state information ~for projects~)
13:35 asciilifeform mircea_popescu: it's standard microshit turd, 'what files luser has open and to what pos' etc
13:35 asciilifeform massive binarygarbagepile
13:36 mircea_popescu anyway. what did you mean, special linear group ?
13:37 * mircea_popescu never met a lie-ician before!
13:38 asciilifeform wait an' see, i suspect mircea_popescu will like the answ
13:38 mircea_popescu alrighty!
13:43 asciilifeform know what, i can post the answer, and somebody else can turn into proggy if he feels like
13:43 asciilifeform cuz it is not complicated
13:45 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)
13:47 asciilifeform in turn both of the piles that went into n1 (and likewise n2) satisfy same recurrence, n1_a * q1_a + n1_b + q1_b = n1*q1 ; n2_a * q2_a + n2_b + q2_b = n2*q2 .
13:47 asciilifeform err, n2_a * q2_a + n2_b * q2_b = n2*q2
13:48 asciilifeform mircea_popescu : do i need to go on, or has it clicked ?
13: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
↖ ↖
13:50 asciilifeform in the case of Mocky's example, this will be initially 172,173
13:51 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)
13:51 asciilifeform one of the two attempts will turn up a valid decomposition.
13:51 asciilifeform if you want optimal decomposition, you keep all valid ones and pick the shortest.
13:51 asciilifeform bang.
13:53 deedbot http://qntra.net/2018/08/usg-lich-mccain-surrenders-in-war-on-cancer-will-spend-rest-of-days-as-cancer-pow/ << Qntra - USG Lich McCain Surrenders In War On Cancer Will Spend Rest of Days As Cancer POW
13:53 BingoBoingo ^ Phylactry has been found!
13:55 mircea_popescu asciilifeform this is what http://btcbase.org/log/2018-08-24#1844244 proposes. but no, not "random", recursive instead.
13:55 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.
13:55 asciilifeform mircea_popescu: aha , no randomness in my pill, it converges deterministically
13:55 asciilifeform and never goes in circles
13:56 mircea_popescu BingoBoingo good god, are they now gonna do a bunchga herp derp about how important the moron is and how irreplaceable the scrapping ?
13:56 BingoBoingo mircea_popescu: The latest round appears to already have started
13:56 mircea_popescu spurious fucktards.
13:57 BingoBoingo But all comments are being attributed to "the family" suggesting he is already very close to Potato if not already there
13:57 asciilifeform evaluating proposed split of set is very easy, you check that the sum(n_...) and weighed avg of the component Qs are in spec.
13:57 mircea_popescu collective personage best personage, nobody has authority top say "this wasn't said".
13:58 mircea_popescu asciilifeform let's put this in proper algo form.
13:58 asciilifeform i'ma write it up in cl if nobody else wants to.
13:58 mircea_popescu so 1. calculate q so that n q + m (q+1) = S (the sum of the count-quality products for the entire starting set)
13:59 mircea_popescu 2. you split the starting set into two sub sets by the criteria ? and without splitting stacks ?
14:03 asciilifeform stacks get split via the recurrence given in the start
14:03 asciilifeform it describes all valid could-have-merged's
14:05 mircea_popescu mmm
14:08 mircea_popescu how do you choose between 7+5 and 6+6 ?
14:12 asciilifeform you recurse
14:18 mircea_popescu suppose i have stacks of 10k each with qualities from 50 to 150. average q is 100. now, how do i split these 100 stacks into two subsets ?
14: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" ?
↖
14:28 asciilifeform 1s
14:29 * mircea_popescu shall proceed to coffee with diana_coman in a few, but thereafter will be back, so no worries.
14:32 asciilifeform there's a strong chance this won't make sense until shown as lisp proggy.
14:33 mircea_popescu considering how much lisp i read... possibly not even then!
14:33 mod6 :D
14:33 asciilifeform but the way it goes, is to recurse along all valid paths, and mark the traversals that result in initial-state piles being successfully 'eaten'
14:34 mod6 same
14:35 mircea_popescu seems to me the complexity of this will be massive.
14:35 asciilifeform nah
14:35 asciilifeform O(bitness of finalmass)
14:36 mircea_popescu no fucking wai.
14:37 mod6 asciilifeform: Good to go for us to buy another round of SSDs? (apparently this time we can only get 3 at a time)
14:37 asciilifeform the 'cheat' is that for ~any~ pile in the tree, you know that it had to result from one of 2 possible merges.
14:37 asciilifeform mod6: why only 3 ?!
14:38 mod6 shitazon limits, i've seen it before myself.
14:38 asciilifeform bah
14:38 asciilifeform 3 then
14:38 mod6 we do what we can. i was pretty impressed with the speed at which they arrived.
14:38 mircea_popescu mod6 conceivably (besides ip registration thing, which how's it going ?) might also get vendor status ? open a little shop of actual stuff in uruguay ?
14:39 mircea_popescu a shop of used computer parts is a great complement for a dc op.
↖ ↖
14:39 asciilifeform that would rock
14:39 mod6 Was kinda thinking that myself mircea_popescu... at least, in concept.
14:39 mod6 I haven't even considered IP registration.. was there a inititive to get a block of our own from ICANN?
14:39 mircea_popescu yeah. you can sell all your shit that's out of amortization at half price, become huge. well, "huge", south america huge.
14:40 mircea_popescu mod6 yeah, back in like... february ?
14:40 mod6 oh, I'll have to talk to ben_vulpes and read the logs on that. thanks for the nudge.
14:40 mircea_popescu anyhways bbl
14:40 mod6 c-ya
14:41 mod6 !Qcalc 900/6200
14:41 lobbesbot mod6: 0.145161290323
14:42 mod6 !!pay BingoBoingo 0.14516129
14:42 deedbot Get your OTP: http://p.bvulpes.com/pastes/rXCF2/?raw=true
14:48 mod6 !!v 945B7F7A6D4F4AEC6760362343EAB65C65D3A49F973D59E066287DEF2841727E
14:48 deedbot mod6 paid BingoBoingo 0.14516129
14:50 mod6 BingoBoingo: whatever you don't spend, just hang on to it, and we'll tally it up at EOM for the books.
~ 1 hours 50 minutes ~
16:40 ben_vulpes iirc lacnic wants to see the existing block more heavily used than it is right now before allocating more, BingoBoingo was there something else incorporation that LACNIC wanted to see?
16:40 ben_vulpes incorporation-related*
16:41 asciilifeform ben_vulpes: if it's just a matter of having all the ips answer when pinged -- we can have that cured without much sweat
16:42 asciilifeform BingoBoingo: feel free to route all unrouted ips to dulap
16:42 BingoBoingo asciilifeform: Aite
16:45 ben_vulpes if it's that simple, that'd be spiffy indeed
16:54 mod6 It sounds like, "Be legally established within the region and use the resources in LACNIC's coverage area."
16:54 mod6 So we might need to incorporate first. *might*
16:54 trinque "hurr they are for xen tenements"
16:55 trinque mod6: seems like a valuable thing to have, local corp
16:55 trinque I dunno the tax laws down there, but might be beneficial in regards to deducting expenses?
16:55 trinque I hear only the states audit people too, so all the more reason :P
16:57 mod6 Well, it's ~$4500 to buy a pre-built corp. Then alf & myself would have to fly down and sign the articles of organization.
16:57 mod6 We think that we would probably have a higher base tax liability -- right BingoBoingo ?
16:57 mod6 $4500 is quite a bit for where we currently stand financially.
16:58 trinque doesn't fit with my experience of running businesses, typically the thing doesn't post any substantial income in the startup phase
16:58 mod6 *shrug*
16:58 trinque (it could be that already tax is not a significant slice of your costs, dunno how it works, but would read)
17:06 BingoBoingo <mod6> So we might need to incorporate first. *might* << Or I can apply as a unipersonal
17:06 BingoBoingo Or try
17:07 BingoBoingo <trinque> doesn't fit with my experience of running businesses, typically the thing doesn't post any substantial income in the startup phase << THe big tax incurred would be VAT
17:09 mod6 Is the 'unipersonal' like a sole-propritorship ?
17:10 mod6 *proprietorship
17:14 trinque a quick google suggests the rate for distribution of profit is lower than the rate for regular income, which is what I'd have expected, so conceivably BingoBoingo could be compensated in part through his stake in the local corp as profit
17:14 trinque dunno what the "home office" rules are there either, but maybe some rent gets thrown in too
17:26 BingoBoingo mod6: It is
17:26 BingoBoingo trinque: THe substantial VAT here makes things complicated
17:27 trinque yeah, seems like they're income-tax light and sales-tax heavy, eh?
17:27 trinque (which seems pretty damned sane to me, actually)
17:28 trinque er VAT, sales-tax wouldn't be properly descriptive
17:29 BingoBoingo Right. For a comsumer VAT and sales tax look the same, but... ther is a substantial difference
~ 20 minutes ~
17:50 asciilifeform BingoBoingo: exactly how many vacant ip do we have ?
18:00 BingoBoingo asciilifeform: I'll do a count
18:09 BingoBoingo asciilifeform: I don't have the complete list of assigned ip's, but from .204 through .246 should be unallocated
~ 1 hours 21 minutes ~
19:30 mircea_popescu trinque> mod6: seems like a valuable thing to have, local corp << a recurrent observation.
~ 1 hours 3 minutes ~
20:33 mod6 !!sent-invoices
20:34 deedbot http://p.bvulpes.com/pastes/flJlD/?raw=true
20:34 mod6 !!ledger
20:34 deedbot http://p.bvulpes.com/pastes/izkmH/?raw=true
~ 39 minutes ~
21:13 mircea_popescu meanwhile in honeymooning, https://78.media.tumblr.com/3a7d616eb368b098d7ba9aaeeb2e1138/tumblr_n2pvju7kYb1troezeo1_400.gif
~ 22 minutes ~
21:36 mod6 nice
~ 1 hours 4 minutes ~
22:40 mod6 anyone else having trouble getting to : http://therealbitcoin.org/ml/btc-dev ?
22:41 * mod6 is getting 504
22:46 asciilifeform aha times out
22:47 mod6 jurov: halp ^
22:48 mod6 !~later tell jurov We're getting 504 & timeouts from the ML
22:53 mod6 !Q later tell jurov We're getting 504 & timeouts from the ML
22:53 lobbesbot mod6: The operation succeeded.
23:02 lobbes times out here as well
23:02 mircea_popescu o hey lobbes ; how's life been treatin ya ?
23:03 mod6 thx lobbes seems something with amazon perhaps
23:09 lobbes mircea_popescu: ohey. good!
23:09 lobbes in fact, was going to announce: I'm getting closer to finishing what will be a genesis for a 'logbot-command-router' in python that does the talking and listening with postgres (an older but relevant thread for context: http://btcbase.org/log/2016-08-29#1531123)
↖
23:09 a111 Logged on 2016-08-29 13:54 trinque: right. in this case I challenge anyone to find a need for a second patch on those modules themselves, rather than creating a genesis vpatch for their own module which talks to the db in postgres.
23:09 mircea_popescu neat.
23:09 lobbes I've tried to design it to be 'modular' so that the operator can easily add their own custom commands, and to be 'vpatch friendly' in that folx can release 'whateverbot' as a vpatch that just extends it (in fact, this is my plan for the auctionbot)
23:09 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)
23:12 mircea_popescu so it relies on logbot and interfaces with it via postgres db ?
23:12 lobbes exactly
23:13 lobbes just listens to the notification channel in postgres
23:13 lobbes and then does the command handling
23:13 * lobbes will bake blawg post once complete
23:14 mircea_popescu aite.
← 2018-08-23 | 2018-08-25 → ↑

Random(trilema) | Download hourly DB snapshot | Get Source Code

Theme: Light | Dark | System Default