178100+ entries in 0.106s
phf: doing full
type annotation with (mp #*1010101001010011110000101000000000001101011100000001 (expt 2 14)) drops
the
time from 11s
to 7s
mircea_popescu: like what,
the discarded mattresses people locate half a mile out of
town or so
to fuck randos on ?
sina: best
twitter quote I saw
today: "US is free as in mattress"
BingoBoingo: Happy Phorking day
to all you motherphorkers!
mircea_popescu: in other usistani ideas : register "techrite" as a brand.
then people can say "he's got
the
techrite" about your users.
a111: Logged on 2017-07-04 14:09 phf: fhf implementation
http://paste.lisp.org/display/350018, this one just races against ben_vulpes's, i'll see if i can beat go version once i get
to building go environment..
mod6: Good
to hear
that
the lost units came back.
mircea_popescu: these requirements can never be satisfied, because
the branch in question EXPANDS s, and
therefore it will never be
the case
that
the position modulo R of S will be equal
to
the position modulo R of S+1.
mircea_popescu: the requirements for cycle : a M/S/R
that
takes
the 1, flips it
to 0, so
then
the rewind flips it back
to 1 again and so it could cycle.
BingoBoingo: mircea_popescu: Haven't fed it
through pantsuit.txt parser yet, will after sleeping
phf: asciilifeform:
there's different kinds of optimizations. you can nail down
the
types and get a complete
type signature of your code. i don't
think
there's any shame in it
mircea_popescu: BingoBoingo
they still wanking with bitpython v 3.0 or w/e it is ?
mircea_popescu: e screw part of
that branch. so we need a M/S/R
that
takes
the 1, flips it
to 0, so
then
the rewind flips it back
to 1 again and so it couldf cycle.
mircea_popescu: asciilifeform no. no. it's
there. asciilifeform : "This operation consists of
taking
the bit count of either S or R, iterating over
that value, at each step multiplying
the iterator with
the current position in M" << screw will always be m-position divisible. |If
the bit in R found at
the position equal
to
the remainder of
the division of our position in M by
the size of R is 0" << bit deciding rewind is ALWAYS
touched by
th
phf: i
threw in a handful of
type declarations (which eliminated generic-+ calls), but
that as expected shaved less
than half a second
BingoBoingo: "OMG HARD DATES LISTED!!!" Ought
to make
the Shillbert fail more sweet
than
the GaVERToominium failures so far
mircea_popescu: asciilifeform god damned. check
this out : 1. only way
to cycle is
through
the rewind branch. 2. rewind branch only rewinds one, so
to cycle must be run
through every
time. 3.
the branch with a rewind always does a S in R screw, and a R flip. for cycle
to happen
therefore a) message bit must be 0 and b) S and R must be in such a state
that screw and bitflip produce same bit in R.
a111: Logged on 2017-07-04 14:09 phf: fhf implementation
http://paste.lisp.org/display/350018, this one just races against ben_vulpes's, i'll see if i can beat go version once i get
to building go environment..
mircea_popescu: kinda why we're even doing all
the prof work on it, see
that crumble
to dust bit first.
mircea_popescu: this is a point in practice, but not relevant re
the finite-ness.
mircea_popescu: haven't yet managed
to pin down what
teh absolute requirement list for a cycle is
though.
mircea_popescu: asciilifeform
there are other ways.
they work better on
the exact
type of hash fhf isn't.
mircea_popescu:
http://btcbase.org/log/2017-07-04#1679092 << my current
thinking is,
the only way
to resolve
this within a lifetime is
to see if a mpfhf cycle could be constructed. if it can, solved, if it provably can't
then it is
time&space finite, even as a statistical ceiling argument.
☝︎ phf: irishmen came up with
that
term, it's all about potatoes with
those people
a111: Logged on 2017-07-04 14:52 phf: but i use it
to refer
to intentionally or unintentionally naive code. like
the kind of stuff you would write in BASIC.
a111: Logged on 2017-07-04 14:46 asciilifeform: ( and currently suspect
that you can construct one where it doesn't )
mircea_popescu: ie,
there is no such
thing possible as "a christian english-as-single-language speaker".
mircea_popescu: yet in english it's how
they do it, and
THIS is what
they mean when
they say
the language it speaks will
tell you a lot of a people.
mircea_popescu: anyway, it is logical
to have
the error permanent "what it is", and
the self-reference
tensed "i was". rather
than pretend
the error has no further substance
than its past occurence, whereas
the id is eternal and so
therefore is.
mircea_popescu: which is why qntra style says "logical comma always". as opposed
to oxfordian.
mircea_popescu: this is a very fine example, incidentally. it's in my mind right
there with
the oxford comma ("i had eggs, salmon and biscuits" interpreted as
the speaker
telling salmon and biscuits as an item
that he had eggs) as anglo-antilogic in my head.
mircea_popescu: phf what it was
that i consistently ; not what it is
that i consistently was :D
mircea_popescu: yes
this is a choice i've made repeatedly and
threaten
to keep making. it also happens
to be fundamental
to republican vs you know, imperial outlook.
mircea_popescu: in
the sense
that if you discuss it at all, all you may say is "mp is so fucking great, he put personal freedom above corporate continuance."
mircea_popescu: on
the contrary, in
this context it is my merit and you're welcome
to praise.
mircea_popescu: jurov nasdaq solution
to bitbet problem is
to
take kako out and shoot him.
that i'm a civilised fellow is not something you can oppose
to me.
mircea_popescu: if every
time a broker advanced cash
to a customer you
took out nasdaq and shot it, it'd live microseconds each iteration.
mircea_popescu: but
the discussion here isn't "naive perception of item x as compared
to naive perception of item y".
that'll be biased by
the direct interaction.
the discussion is "industrial item x vs y".
mircea_popescu: well depends what you mean and what you're
talking about. some people call
their
http "transactions", and
the "road ahead is clear" as
they say
to next propose mpex css ain't good enough
to be nasdaq.
jurov: dividends are not
transactions?
a111: Logged on 2017-07-04 03:43 asciilifeform: mircea_popescu: mpex afaik never reverted
trades either
mircea_popescu: in fact specified as opposed
to farted code has
this property,
that you write
two programs per spec like
that. hence "agile" ie "code is
the spec" ie "please shoot me" modernity.
a111: Logged on 2017-07-04 14:15 phf: part of spec as far as i understand it,
that
the (fhf mp ...) part is a canonical, but not
the only implementation. so yeah you could write optimal version of mp's fhf, but it's not going
to speak
the same dictionary, and you won't be necessarily able
to apply same optimizations
to other (fhf ...). (or i guess you can, but require more cleverness
than just etc.)
mircea_popescu: nevertheless,
the reason it has
those bojums flows from
the atomic ops, not gift from god.
mircea_popescu: i am surrounded by looseleaf
to
the degree girl walked in said "you remind me a lot of mr happy" "whassat ?" "pet hamster i had when i was 5"
mircea_popescu: asciilifeform mp-fhf
terminates, and in finite mem. of course, other fhfs might not.
mircea_popescu: phf whereas is not where's, etymologically or otherwise. i dunno if you know
that.
mircea_popescu: "just
tell me how large it ends up and stop wasting my
time! WHAT
THE FUCK IT CAN'T BE KNOWN IN ADVANCE!"
mircea_popescu: "enlarge datastruct one bit at a
time ? because your mother fed you artichokes whole or why!"
mircea_popescu: truth be
told fhf was designed by a coder hater, and it shows. exactly
typical ops a sane person would never even contemplate.
a111: Logged on 2017-07-04 13:52 phf: (funny
thing re sbit vs bit, sbit generates immediate assembly, where's bit, in sbcl, calls out
to a function named SB-KERNEL:HAIRY-DATA-VECTOR-REF. nuff said)
phf: but i use it
to refer
to intentionally or unintentionally naive code. like
the kind of stuff you would write in BASIC.
☟︎ phf: hmm, never mind his later rants on
the subject contain a lot more vitriol
phf: i wouldn't use it in my own code, but
there are occasional cases where it "makes sense", particularly when you're writing potato code
phf: i wouldn't call it bitter, at least he didn't
think of if* proponents as complete retards.
phf: that's
true, and is closer
to wording..
phf: man, dusseldorf airport soundtrack is like
the best of
the 90s
that nobody listens
to anymore, but used
to back in
the day. like
they are playing bryan adams's "i do it for you" which i remember serenading
to some girl. makes me heart
tingle it does.
phf: oh,
that's actually good point re rewind,
that's in
the spec "except in
the case our position is already 0."
phf: i mean,
there's a bunch of macros
that share state
through referencing same symbols. if i were
to post
this
to #lisp
they would lynch me
phf: part of spec as far as i understand it,
that
the (fhf mp ...) part is a canonical, but not
the only implementation. so yeah you could write optimal version of mp's fhf, but it's not going
to speak
the same dictionary, and you won't be necessarily able
to apply same optimizations
to other (fhf ...). (or i guess you can, but require more cleverness
than just etc.)
☟︎ phf: right, but
that would "break"
the spec
to code correspondence
phf: yeah,
this version is straight spec implementation (in fact if you search for (fhf mp ...)
that part should directly correspond
to spec wording). only optimization i did was
to keep
the S reallocations down