227000+ entries in 0.148s
mircea_popescu: i'm not fucking learning an aminoacid matrix
to be able
to use diff i
tell you
that,
☟︎ mircea_popescu: i mean in
the "wtf did
the differ do" human evaluation
ben_vulpes: i was hit with
the ugly stick at birth, you can't scare me
ben_vulpes: kinda (gasp) itching
to get my fingers into some cpp
tho
ben_vulpes: study needleman-wunsch is in my
todo list
adlai: mircea_popescu:
thank you for
the sauce
though, i was about
to puzzle out
the exact meaning of "M%S-th" behaviorally
mircea_popescu: holy shit at some point will have
to sit down and read something!
adlai has
translated php precisely once in his life, and ain't nobody good
time
to incf!
mircea_popescu: "Because
the R bit is 0, we flip it and decrease our position by 1 (but not below 0)"
mircea_popescu: asciilifeform position increases by one each step, at
the end of it.
mircea_popescu: calling it "state machine" is kind-of improper as i suppose
the result also holds state. a cleaner separation may be advisable, but w/e.
mircea_popescu: yes but since S is 1 bit long no
transform
takes place (1/2 is 0)
mircea_popescu: asciilifeform does
that make any sense / is it useful ?
adlai: pete_dushenski: shana
tova akhi!
pete_dushenski: ferraris older
than ~20yo needed regular engine-out maintenance. every year,
two at
the most.
adlai: now
that's a hearoglyph i haven't seen in a long
time!
pete_dushenski: sorta
to be expected with performance machines of
this calibre
pete_dushenski wonders if baltic servers knows how many dreams phuctor is making come
true
pete_dushenski: straight from lithuania! (is Framedragger familiar with
this brand?)
☟︎ pete_dushenski didn't realise how much eur had weakened relative
to usd until bb pointed it out. 1.05 yo!
pete_dushenski: the worst part of medium is
that
the images don't archive.
this wouldn't be an issue for most republican blogs seeing as
they're entirely
text, but it's actually quite
the bug for fiat writers,
taleb included
mircea_popescu: this is just a mash-up
together of elements
to show how
the concept works. better assemblage is probably possible.
adlai should probably start putting it
to use at
the saltbox, for home-makework
adlai: one of
the best retorts
to rubes asking "why use lisp" is
that macsyma still runs
adlai: please elaborate, what do you mean by "writing a human proggy"? what i meant by "not a full solution" is
that
there's supposedly a
tool out
there which does 'half'
the job, and obviously some human must write a proggy
that does
the other
mircea_popescu: i'm half
tempted
to just write it in php, and have it write out words instead of drawings.
mircea_popescu: asciilifeform yeah but fuck me, what am i going
to do, php against imagemagick ? c++ and qt ? fuck.
mircea_popescu: anyway,
the general idea above being : you
take all
the sane parts of working hash functions, and ditch
the insanities. so - no magic numbers, inside boxes, as boxes count, etc. use modulo-arithmetic and iterators, and one long cipher box.
mircea_popescu: "give program, input and desired slide speed" "here's how it went .
tick
tick
tock"
mircea_popescu: yeah how fucking hard can
this be, just
take
the ast and paint me some squares holy hell.
mircea_popescu: anyone know of a code-to-gif compiler ? i have nfi how one's supposed
to do cryptography without it.
mircea_popescu: i wish i had a way
to program
things in a visual manner, so i could obtain a GIF! animated! of what
the algorithm is supposed
to do.
mircea_popescu: im not sure
the above notation is all
that clear, but if any questions i'll gladly answer
mircea_popescu: last bit can in principle affect
the whole damned ring.
mircea_popescu: nah,
that's what my
thing above : because of
the state machine, you can't actually
tell bit impact.
mircea_popescu: still, it is ~only way
to get hash
that doesn't do
the
things we don't like.
mircea_popescu: ah i musta missed
that. but yeah, can craft item
that
takes a long
time
to hash
a111: Logged on 2017-01-03 23:16 asciilifeform:
to go back
to hashes, and if you for some reason eschew 'when hiring fortune-teller, hire
the cheapest',
mircea_popescu: it has
the advantage
that it needs an unspecified pile of memory (on average, half
the message + half
the message) for
the state machine, and an unspecified number of operations (on average, 2x as many as message length).
mircea_popescu: . for each bit of M
that is read : if 0 state machine gets a null bit added at
the end ; if 1 state machine gets
the M%S-th, 2M%S-th, ... nM%S-th bits flipped, for n=bitcount of S ; if 0 and
the M-th % R-th bit = 1
then it is flipped, else it goes back
to processing M-1th ; if 1 and
the M-th % R-th bit = M-th % S-th bit
then it is flipped, else it goes back
to processing M-1th.
that sort of
thing.
mircea_popescu: asciilifeform btw it occurs
to me
that your proposed padding scheme, while not useful as a rsa padding scheme, nevertheless may be rescued into a very serviceable hash function, which has
the notable property
that a) acordion and b) user settable output size. something like
this : let R be a ring buffer of as many bits as
the user specified
the output should be, let M be
the message. let
there be a one bit state machine S = 0
mircea_popescu: BingoBoingo neah,
the imaginary ethereum exchange rate went EVEN HIGHER
THAN BTC!!111