60500+ entries in 0.438s
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.
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: 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.
phf: i threw in
a handful of type declarations (which eliminated generic-+ calls), but that as expected shaved less than half
a second
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.
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:
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.
☝︎ 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: 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.
a111: Logged on 2017-07-04 14:12 asciilifeform: one hint -- look at 'screw' as
a modular congruence
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: 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.
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: 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: "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: hmm, never mind his later rants on the subject contain
a lot more vitriol
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: sbcl is the original "modern"11! lisp. it gives "style warnings" on my code, but completely ignores type errors in ben_vulpes's code (compiling same code in cmucl gives
a lot of warnings about the types being all kinds of confused)
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: and the other issue with adjustable arrays is that you're doing
a lot of expands (and that's what mp's fhf does), you're generating n^2 garbage
phf: ben_vulpes: i'm pretty sure your type annotations are doing nothing useful. cursory look i think only fixnum stuff is taking effect, but that's such
a small overhead
phf: i wrote
a hilariously bad common lisp version of fhf
mircea_popescu: ah im sorry, to match as in
a set. conjunto fambly should suit you.
hanbot: any spanish speakers here have
a decent translation for "match"? to place in
a set, not pairing, not equaling, not anything else online dictionaries'd like to synonymize me with.
ben_vulpes: BingoBoingo: was otherwise occupied; twas
a teep just the teep
mircea_popescu: at any rate, there's
a floor under human abstraction. voltages stabilize after
a time. etc.
mircea_popescu: there's no such thing as
a human-accessible time interval that's not human accessible.
mircea_popescu: notice that no one goes to the hospital with
a "i came here so you make me healthy" contract.
mircea_popescu: asciilifeform not even doublespend, they were not allocated. therer's such
a thing as nonbinding allcoators.
mircea_popescu: there's
a space between closure (as an abstract) and settlement (as
a practical).
mircea_popescu: "oh but this wasn't really
a trade" "it was an accepted tender!" "mmkay"
mircea_popescu: i don't even specifically remember, was years ago. but im sure there was
a good reason.
a111: Logged on 2017-07-04 03:09 asciilifeform: in other unsurprises, 'Corrupt data that accidentally flowed out of
a NASDAQ systems test caused the share prices...'
mircea_popescu: part of the problem and the font of all the "russianb spies" lulz is that
a) thjere's nothing else and b) the fucktards can't believe nobody cares.
phf: as the fervor increasing there's
a general loss of steam. how many misfires can these people afford?
phf: fwiw there's definitely
a sentiment change. it's becoming fashionable to roll eyes at sjws at festivals and be secretly OK with trump.
BingoBoingo: asciilifeform: The state legislatures that make those rules mostly lean GOP over pantsuit, and rulemaking is
a concern after 2020 census.
BingoBoingo: <asciilifeform> eventually provocation will work, trump will 'clintonize', i.e. connect himself with something 'uncontroversially' impeachable. << There's
a deadline for provocation to work. 2018 mid term elections
phf: it's
a multi-series show that's being played back to back
ben_vulpes:
a merry occupation day to ye, ameritards
mircea_popescu: obviously the presidency is
a racist/rapist institution no longer adequate fopr the needs of ourdemocracy!
mircea_popescu: that day, there was
a bird doing the ~exact thing outside, we thought nothing of.
mircea_popescu: at another time, mp lived in
a place where july/dec diff was maybe 2 degrees
mircea_popescu: never saw
a way to make them work for you know, 10 to 20lb sizes.
ben_vulpes: well, figured the drawers would slide into and out of
a refrigerated cabinet
ben_vulpes: odds that i'll ever buy
a fancy brand new stove are pretty low anyways
mircea_popescu: speaking of which, this was to be my next step, once ben_vulpes done profiling : impl
a reverser, see the impact of bitwise altered S on end result.
mircea_popescu: asciilifeform that's also the precursory to proof of its strenght : to reverse
a 64kb msg hash you need to intuit 1mb of data.
mircea_popescu: no. if you have message M, and compute
a fhf on it, and give out the M, you used fhf as
a hash. if you give out both H and S, you used fhf as
a "bit convertor" or w/e, the original M can be extracted, with sweat.
mircea_popescu: if you have the end S of
a hashing, you can reconstruct M from H.
mircea_popescu: so bnasically, fhf as just
a m is
a hash, as s+m it's
a "padding" function
a111: Logged on 2016-12-24 01:10 asciilifeform: say i want to encipher (dun matter with what)
a string, 'To: mircea_popescu Subj: thermonuke launch codes ...'
a111: Logged on 2016-12-24 01:02 asciilifeform: incidentally, since (to borrow the lament of turing's school headmaster) 'the room already stinks of mathematics', i'll share
a tidbit that i promised folx some half year ago and promptly forgot:
mircea_popescu:
a lot of interesting questions for the thinking man in our age.