log☇︎
31800+ entries in 0.241s
candi_lustt: ben_vulpes: log: http://p.bvulpes.com/pastes/ZRxCE/?raw=true
candi_lustt: ben_vulpes: #*0010011100
ben_vulpes: candi_lustt: (mpfhf:mpfhf #*1001101101000010000011010111101001110001111010111110011100000110000111100111110011100001 10)
deedbot: candi_lustt voiced for 30 minutes.
ben_vulpes: !!up candi_lustt
ben_vulpes: hey sina mircea_popescu logs for comparison
sina: mircea_popescu: per the spec, " During each step, the function considers whether the position-th bit in M is 0 or 1, and executes a defined set of operations in either case. Once the operations have been executed, the position is incremented by one."
sina: mircea_popescu: pls help me understand rewind? doesn't it guarantee loops if I end up in a step which has a rewind? because I will go back one and then rewind?
sina: mircea_popescu: can you point if I'm missing something obvious? From my understanding of the spec, the number of "steps" is = the length of M, but in your examples (understanding they're of a nonworking prototype) have a lot more steps than len(M)
sina: mircea_popescu: lollll I had it doing that but removed those lines
sina: candi_lustt: (mpfhf:mpfhf #*1001101101000010000011010111101001110001111010111110011100000110000111100111110011100001 64)
deedbot: candi_lustt voiced for 30 minutes.
sina: !!up candi_lustt
sina: candi_lustt: (mpfhf:mpfhf #*1001101101000010000011010111101001110001111010111110011100000110000111100111110011100001 64)
sina: mircea_popescu: can I ask you to verify behaviour of half screw when the length of S or R is not even?
mircea_popescu: cool. seeing how ben_vulpes ' lisp implementation ain't working yet, you have a shot at becoming the first cannonical mpfhf
sina: mircea_popescu: hey mate
pete_dushenski: eg. https://www.welivesecurity.com/wp-content/uploads/2017/06/britney_instagram_square.png
mod6: ' was getting complaints, so tried your commented out line of: M : Maps.PMap(Length => 0, Offset => 1); instead. 2) gnatmake doesn't like that procedure horse_test is in a file called 'test.adb', wants it to be in 'horse_test.adb'
asciilifeform: mircea_popescu: it's an illustration of typical 'free agent' tho -- i.e. imbecile interested in 'free coke' rather than any coherent action with >1hr horizon. i.e. beast of the field.
asciilifeform: mircea_popescu: router is porous even to quite elementary approach - e.g. stuffing 'optional' fields in outgoing packets full of exfiltrolade; or into timing gaps, etc
mod6: speaking of ada stuff. i did get horsecocks to compile just fine with the changes that were discussed previously with diana_coman ☟︎
asciilifeform: (e.g. the put_line 'image thing, say )
asciilifeform: ben_vulpes: depending on what you consider 'bug'
asciilifeform: ben_vulpes: whtachatalkingabout, i posted reams of buggy codes
jhvh1: ben_vulpes: The operation succeeded.
ben_vulpes: !~later tell sina mircea_popescu wants mpfhf commentary on his blog
asciilifeform: ben_vulpes: what's that mean
a111: Logged on 2017-06-09 09:17 ben_vulpes: turns out one can't `decf' a loop-macro established `place'
asciilifeform: http://btcbase.org/log/2017-06-09#1667638 << i contemplated whether to show ben_vulpes ~all~ of the mistakes in his proggy, or to let him find for himself, decided on the latter ( it's a healthy thing ) ☝︎
a111: Logged on 2017-06-09 09:05 mircea_popescu: and i suspect alf is either making a c one or trying to talk himself into it
a111: Logged on 2017-06-09 08:49 sina: mircea_popescu: let me rephrase then. was wondering if eventlet db_pool http://eventlet.net/doc/modules/db_pool.html had been considered
a111: Logged on 2017-06-09 12:50 sina: from my reading of http://trilema.com/2017/towards-a-better-hash-function/ it seems like the "screw" and "half screw" operations, "screwing S in R" means, R will be changed, and "screwing R in S" means S will be changed. the footnote (ii) examples support this interpretation. but in the prototype implementation http://trilema.com/mp_fabulous_hashonator.php ...it seems like the "step 1" half screw S in R
sina: !~later tell mircea_popescu http://btcbase.org/log/2017-06-09#1667677 ☝︎
jhvh1: sina: Error: The "Later" plugin is loaded, but there is no command named "mircea_popescu" in it. Try "list Later" to see the commands in the "Later" plugin.
a111: Logged on 2017-06-09 12:50 sina: from my reading of http://trilema.com/2017/towards-a-better-hash-function/ it seems like the "screw" and "half screw" operations, "screwing S in R" means, R will be changed, and "screwing R in S" means S will be changed. the footnote (ii) examples support this interpretation. but in the prototype implementation http://trilema.com/mp_fabulous_hashonator.php ...it seems like the "step 1" half screw S in R
sina: !~later mircea_popescu http://btcbase.org/log/2017-06-09#1667677 ☝︎
jhvh1: sina: Error: I haven't seen mircea_popescu, I'll let you do the telling.
a111: Logged on 2017-06-09 12:50 sina: from my reading of http://trilema.com/2017/towards-a-better-hash-function/ it seems like the "screw" and "half screw" operations, "screwing S in R" means, R will be changed, and "screwing R in S" means S will be changed. the footnote (ii) examples support this interpretation. but in the prototype implementation http://trilema.com/mp_fabulous_hashonator.php ...it seems like the "step 1" half screw S in R
sina: !~tell mircea_popescu http://btcbase.org/log/2017-06-09#1667677 ☝︎
sina: from my reading of http://trilema.com/2017/towards-a-better-hash-function/ it seems like the "screw" and "half screw" operations, "screwing S in R" means, R will be changed, and "screwing R in S" means S will be changed. the footnote (ii) examples support this interpretation. but in the prototype implementation http://trilema.com/mp_fabulous_hashonator.php ...it seems like the "step 1" half screw S in R ☟︎☟︎☟︎
shinohai: Morning sina .... I likely cannot be of help in that regard yet. I'm still student of the logz there and mucking around with ben_vulpes lisp.
sina: hey ben_vulpes you still around?
ben_vulpes: !!down candi_lustt
candi_lustt: ben_vulpes: 64 steps, 1 bits for the state machine. hash: #*1111111111111111111111111111111111111111111111111111111111111111
ben_vulpes: candi_lustt: (mpfhf:mpfhf #*1111111111111111111111111111111111111111111111111111111111111111 64)
candi_lustt: ben_vulpes: 381 steps, 382 bits for the state machine. hash: #*1000000001000000001111011011111001010000111110100010100100100011
ben_vulpes: candi_lustt: (mpfhf:mpfhf #*0000000000000000000000000000000000000000000000000000000000000000000000000000000 64)
deedbot: candi_lustt voiced for 30 minutes.
ben_vulpes: !!up candi_lustt and now for something behaving completely differently
BingoBoingo: Trying to ride that clickbait lightning https://www.reddit.com/r/conspiracy/comments/6g7d4u/did_german_meddling_lead_to_british_parliament/ and https://voat.co/v/conspiracy/1921480
a111: Logged on 2017-06-09 06:51 ben_vulpes: at least the low dough lolz emporium isn't out of stock entirely
ben_vulpes: mircea_popescu: naively, i passed a function called from within the scope a reference to the thing
ben_vulpes: perhaps mircea_popescu can enlighten me as to why exactly it works this way
mircea_popescu: on the positive side, candi_lustt is more than happy to let you try out your code on her teats.
sina: ben_vulpes: it's not, you're right :P
sina: hi ben_vulpes
mircea_popescu: anyway, it's this algorithmic (as opposed to algebraic) hash function. ben_vulpes released his lisp impl.
sina: mircea_popescu: I work on the biggest python turd of all, OpenStack :P
sina: https://github.com/eventlet/eventlet/blob/master/eventlet/db_pool.py
sina: db_pool is about 500 lines, and I guess there is some lower level stuff behind that
sina: mircea_popescu: let me rephrase then. was wondering if eventlet db_pool http://eventlet.net/doc/modules/db_pool.html had been considered ☟︎
a111: Logged on 2017-06-09 04:38 mircea_popescu: wotopen at any rate
sina: hi mircea_popescu
candi_lustt: mircea_popescu: #*00000000000000000000000000001001
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*1111111111111111111111111111111111111111111111111111111111111101 32)
candi_lustt: mircea_popescu: #*00000000000000000000000000000011
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*1111111111111111111111111111111111111111111111111111111111111110 32)
candi_lustt: mircea_popescu: #*11111111111111111111111111110110
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*1111111111111111111111111111111011111111111111111111111111111111 32)
candi_lustt: mircea_popescu: #*11111111011101110111011101001000
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*1111111111111111111111111101111111111111111111111111111111111111 32)
candi_lustt: mircea_popescu: #*1100000000000000000000000000000
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*1111111111111111111111111111111111111111111111111111111111111111 31)
candi_lustt: mircea_popescu: #*000000000000000000000000000000011
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*1111111111111111111111111111111111111111111111111111111111111111 33)
candi_lustt: mircea_popescu: #*00000000000000000000000000000000
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*1111111111111111111111111111111111111111111111111111111111111111 32)
candi_lustt: mircea_popescu: #*01000010000100100011111111110001
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*101010101010101010101010101010101010101010101010101010101010101010101010101010101010101 32)
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*101010101010101010101010101010101010101010101010101010101010101010101010101010101010101 32)
ben_vulpes: asciilifeform, mircea_popescu: ^^ sad output
candi_lustt: ben_vulpes: #*1111111111111111111111111111111111111111111111111111111111111111
ben_vulpes: candi_lustt: (mpfhf:mpfhf #*1111111111111111111111111111111111111111111111111111111111111111 64)
deedbot: candi_lustt voiced for 30 minutes.
ben_vulpes: !!up candi_lustt
BingoBoingo: <mircea_popescu> wotopen at any rate << For most codechimps this is the most closed of all
mod6: ben_vulpes: cool!
asciilifeform: ben_vulpes: bit-not is not destructive
asciilifeform: ben_vulpes: post yours, then reconciliate?
ben_vulpes: asciilifeform: while the individual operations work, it does not yield what mircea_popescu's implementation yields
ben_vulpes: i suspect that i hadn't yet verified output against the runs that mircea_popescu posted
asciilifeform: ben_vulpes: post?
a111: Logged on 2015-03-06 03:29 mircea_popescu: if you are one of the people buying belgian rubber concessions on the stock exchanges, you make money. if you're in africa, you make quick with the hands and feet.
a111: Logged on 2017-06-08 16:43 mircea_popescu: much like you know, all sorts of "rng experts" not merely do not wish, but specifically wish NOT TO examine FG. andf so on.
asciilifeform: incidentally, http://btcbase.org/log/2017-06-08#1667388 >> recall harrison, inventor of temperature-compensated chronometer, per http://btcbase.org/log/2016-03-10#1429335 ; in other contexts mircea_popescu does not even seem to find this kind of thing objectionable, e.g. http://btcbase.org/log/2015-03-06#1044115 ☝︎☝︎☝︎
asciilifeform: ben_vulpes ?
mircea_popescu: i published one, iirc ben_vulpes also did, etc
asciilifeform: link to 1 other than mircea_popescu's php ?
mircea_popescu: asciilifeform i intend to open that for implementation, let people (in wot only) bid, like candi_lustt worked oput.