2 ms·
The binary construction of the forms on the step-by-step page [1] is very intriguing, almost reminds me of the kind of bit-shifting you see in hashing algorithm
by jazzyjackson 5y ago
The binary construction of the forms on the step-by-step page [1] is very intriguing, almost reminds me of the kind of bit-shifting you see in hashing algorithms. Sometimes I think there must be a better way to represent random numbers like git hashes and public keys, just because they're hard to remember or distinguish. Maybe representing 60 bits of entropy as one of these hierarchies rich with star-and-body associations would make it easier to remember what a particular hash refers to.
http://www.princeton.edu/~ezb/geomancy/geostep.html http://www.princeton.edu/~ezb/geomancy/geostep.html
- duskwuff 5y agoIn a sense, it's a complex manual expansion step -- 16 bits of entropy are used to generate 15 figures, for a total of 60 bits of output. I'm curious what structures this imposes on the results. The description mentions an obvious one -- the Judge figure will always contain an even number of points. There are probably some other less obvious ones, especially in terms of combinations of figures which can never appear together.