80000+ entries in 0.046s
mod6: or is
that what is needed for mailman stuff etc?
mod6: why do we need
that anyway?
mod6: oh, you don't mean which are on stormy, but which
to use for wp-mp
mod6: afaik it's just running
trb
mod6: on
there? I don't even
think he has either setup on
there.
jurov: mod6:
thanks, and what apache/mysql versions are used?
mircea_popescu: the question of HOW
to store sparsely is a re-implementation of
the original question asked, in haskell.
mircea_popescu: im not even
the biggest, iirc danielpbarron got 100s of millions of whatever from his remarkable claim
mircea_popescu: 4d.
think, just looking
through my storage right now, i have a dozen or so SIX FIGURE stacks.
mod6: Lemme dig up
the one script
that I have from ben_vulpes,
the rest of
the notes I
think BingoBoingo has.
mod6: Oh you're gonna do wp-mp on
there
too?
jurov: I'll install/configure apache on
the pizarro-colocated foundation box. Want
to prepare for mp-wp, anyone has handy
their notes pls?
a111: Logged on 2018-07-22 16:55 mircea_popescu: (something very similar was
the original impetuus for mp asking ben_vulpes for candi [where is she btw ?] only
to
then discover after a whole day of basic-training-with-admirals
that in fact
the memory footprint for what i had in mind was ~infinite)
mod6: i have bunch of
tarballs and
things on
there now
that one can just easily download or whatnot.
jurov: mod6 let me know when it's set up
to serve static files, i'll at least copy
the archive
there
mod6: i just gotta get
the
time available
to do it. with any luck
the current configuration will hold up for another month or so
to allow me
to get freed up a bit.
mod6: yeah, i want
to move
the website
to one of
the foundation boxes as well.
jurov: no idea, will wait and see. ml should be eventually moved
to
the foundation box
mod6: now i've got one location where it's responding fine, and another
that i'm getting 504.
mod6: yeah, seems
to be ok. let's keep an eye on it.
mod6: lemme
try a 3rd & forth
mod6: just
tried it 2x, each from a different spot. worked good for me.
lobbesbot: jurov: Sent 17 hours and 27 minutes ago: <mod6> We're getting 504 &
timeouts from
the ML
mircea_popescu: but
the smallest possible factor being 2,
two consecutive numbers are always coprime.
mircea_popescu: asciilifeform
that's
the criteria,
that 173 and 174 share no factors. if
they do --
then x * factor +y and x +y * factor both work.
mircea_popescu: ask honest questions, and
the value of
the answers will never cease
to amaze.
mircea_popescu: Mocky right,
this is a recurrent problem with extremely meta-stable attractors, i don't expect in
the end it makes ANY difference
that in an isolated state it produced weird double-evens.
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
mircea_popescu: so in short, i don't see a practical reason
to say ave1 's 7846x173q 1592x177q is not a legitimate final state, even if it doesn't match what we've been saying final state should be.
mircea_popescu: then again, from
the crafter pov, debalanced stacks not preferable, because of considerations of interplay between item q and bp q in
the final product, it'll be more work
to calc proper bp q for
two stacks apart
than for
two stacks consecutive
Mocky: the fewer server roundtrips would be preferable, assuming
they can be had
mircea_popescu: but it also is at variance with what was de-facto specified,
though not seriously ever reviewed.
Mocky: mircea_popescu, does ave1's example of stacking down
to 7846x173q 1592x177q, actually violate any criteria, despite
that it 'could' be stacked further, it could not be stacked down into fewer slots
ave1: It does not matter if
the
two piles are mixed in
the end (the loss will always be
the same). But I'll have
to start playing
to get
to why you'll want
to
this specific end state.
Mocky: 3 piles must contain odd,odd or even, even pair
therefore stackable
ave1: Aha, I refactored
the code
to end as soon as possible,
turning
that back I get
the same answer
too.
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
mircea_popescu: fucktards. NOT ONLY do
they do it wrong, but
they ACTUALLY attempt
to pass
their failure for "how it is" and "move on".
mircea_popescu: "oh, it's so difficult
to make computer games -- you spend millions and months
to generate content, and
then
the players consume it in minutes"
mircea_popescu: (it's zug-zwang, but honestly
the onomatopoetic value justifies
the grammar breach)
mircea_popescu: (or rather : for something
to be a move, quality-diversity in
the universe decreases)
mircea_popescu: how
the heck can you get a cycle ? "quality" here approximates enthalpy, it only moves one way
ave1: Yes,
the whole
thing is not guaranteed
to finish (I used different sorting algorithms and even got cycles)
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-25 18:06 asciilifeform:
there exist qa,qb
that are only miscible in quantities
that are not available on a given game board
mircea_popescu: (and, for
the esthlos of
the present and
they of
the future,
the "lie-tician" was a reference
to lie groups, which is a sort of we-wanna-galois-too but with more symmetry, less comprehensibility and possibly much powerful-er overall. i half-expected he's going
to start
throwing manifolds at me or who knows what nonsense,
take me out of commission for
the remainder of
the season.)
mircea_popescu: anyway, let it be pointed out how lulzy and innerving
the recurse-dream relation is. "can't make
the first move
till you made
the last move" etc.
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.
mircea_popescu: but you have a point, in
that investigating
the "large enough" condition might shed some lights.
mircea_popescu: q of diff parities are ; but in ~practice~ it is ~almost always~
the case
that a "large enough" starter set is presented
to
that q, q-1 occur.
mircea_popescu: asciilifeform what do you mean ?
that's exactly how it goes, atomically. all mixed piles will be of size sum sizes and quality w-a qualities.
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-25 17:41 mircea_popescu: Mocky alf's mysterious disappearance promises he saw
the problem with his idea :p
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: i
think
that it can work, i don't see how it would work better
than A* if heuristic was found, but I don't see how worse either
Mocky: other
than not needing
the guess
the final state, I'm still
trying
to find a problem with it
mircea_popescu: Mocky alf's mysterious disappearance promises he saw
the problem with his idea :p
☟︎ 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