80800+ entries in 0.033s
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*11111111111111111111111111111111 16)
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*11111111111111111111111111111111 32)
mircea_popescu: candi_lustt: (mpfhf:mpfhf #*11111111111111111111111111111111 64)
mircea_popescu: you prolly still have a bug in there though, just no longer on this case.
mircea_popescu: (technically "expand" is always re s, as per definition, but sure.)
mircea_popescu: ben_vulpes mind making the alterations and let's see ? ima edit the spec later too
mircea_popescu: if 1, half-screw S in R. 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 equal to the bit in S found at the position equal to the remainder of the division of our position in M by the size of S
mircea_popescu: you mean to tell me the idempotent value for mpfhf is actually ff ?
mircea_popescu: Our work has ended, in 4 steps and using 1 bits for the state machine. The message was #*1111 and the resulting hash is #*1111
mircea_popescu: skipping ahead, Our work has ended, in 141 steps and using 96 bits for the state machine. The message was #*1001101101000010000011010111101001110001111010111110011100000110000111100111110011100001 and the resulting hash is #*0010011100
mircea_popescu: screwed element is now #*1000101000 << also seems right
mircea_popescu: element is now #*1010000000 << ok, seems to make sense up to there.
mircea_popescu: ben_vulpes ok, so was that a half-screwing of s in r and s was 1 bit long so it did nothing ?
mircea_popescu: R bitcount is 10 in this case ; S bitcount starts at 1.
mircea_popescu: screwing #*0000000000 at position 0 with count 0 << the problem. it is not possible for a bit count to be 0.
mircea_popescu: screwed element is now #*0000000000 << this is not possible, you screwed nothing
mircea_popescu: paste your story. and plox use wotpaste i dun have that paste.ca thing in hosts
mircea_popescu: it always adds 1. sometimes it also substracts 1. rthat is all.
mircea_popescu: That bit in R is flipped and we rewind. << the definition of the op makes cycles impossibru as such
mircea_popescu: this is where a step by step printout would be useful.
mircea_popescu: im sure it does that, but, simplifies checking. do a few printouts of something shorter and saner, say 16 bit items.
mircea_popescu: sina can you make it print out some detailed workout like the original prototype did ?
mircea_popescu: cool. seeing how ben_vulpes ' lisp implementation ain't working yet, you have a shot at becoming the first cannonical mpfhf
mircea_popescu: "works in the sense that it does something, not in the sense it does what it should"
☟︎ mircea_popescu: the prototype was originally more of a "omfg show me what the fuck do you mean with this spec ?!?!?!" sort of easement.
mircea_popescu: shinohai similarily to how farts have larger volume than turds do.
mircea_popescu: "there is no difference between these two" "i think you might've been raped"
mircea_popescu: "o btw, did they MAKE a ton of money, or did they just IMAGINE they MIGHT AS WELL HAD on the basis of stuff they read on a website ?"
mircea_popescu saw bitstamp "volume" took it for price had to do a dbl take lel