Of course, you could do something similar with this visual algorithm, but I guess the idea is you are using more of the human visual system so it's harder.
> As an example let’s compare two hexes:
> fc94b0c1e5b0987c5843997697ee9fb7
> and
> fc94b0c1e5b0937c5843997697ee9fb7
> are they the same? Let’s use the random art to find out.
Sometimes hashes are visually similar and people aren't always able to compare so finding a different way to represent them could help ensure accurate comparison.
What would be interesting though is if you simply chunk the hash into smaller pieces would it be easier to compare?
> fc94 b0c1 e5b0 987c 5843 9976 97ee 9fb7
> fc94 b0c1 e5b0 937c 5843 9976 97ee 9fb7
I'm sure it depends a lot on the size. If it's a longer string the grid becomes easier, but for shorter strings the chunks would probably suffice.
The example given is especially difficult with any sort of dyslexia, which is where an more visual comparison would really shine
fc94b0c1e5b0987c5843997697ee9fb7
5e81
fc94b0c1e5b0937c5843997697ee9fb7
d1da
You can see the difference v. clearly now. (hash used is md2 reduced to first and last 2 digits).