Artyom Bologov

Hello again John, I went ahead and parsed the byte-based format (i.e. list of 8-lists of bools) and injected it into my algo. I got this 418 bit monstrocity: 000100010001000100010111111001110000000000101011111100101110111101011111110111000001000000001011110011111000000000010101011111110111001100000110000101101111001011110111110110000101100111000001100001011011111011110000101101100000100001000110100001110011010011000000001011100000000100010101011111010010110000010000011001011111111011100111111000001010011111000001100000110000100011010000111000000101011110111011010...

> Although it sorts in descending order. Compare with: This is peculiar—my implementation sorts it all right. I’ve altered the program to invert the bit check and shortened it to...

> Perhaps you were confused by bit 0 being true = \x0\x1. x0 > and bit 1 being false = \x0\x1. x1, > which is opposite of the boolean convention...

Here’s a shot at that. I still can’t get GHC &c to work, so it’s untested. But should be easier to iterate on than Lisp code, I assume? -- Sort...

Cool, thank you! How many bits does this translation take? I think it gained some due to my inexperience with Haskell…

It was 317 bits. I went over it this morning, and managed to optimize it further to 300 bits.Oh, that’s extremely good, I didn’t expect it to be that optimizable!...

One thing that I don't necessarily get is the difference between `:document` and `:document-fragment`. Is it safe to make both into `plump:root` (basically a phony toplevel element that all the...

@rotatef?

CC @bakketun