I still like snowflakes for this: https://levien.com/snowflake-explain.html is a half-finished blog post explaining the motivation and algorithm I came up with. I never did careful user testing, but suspect that the answer would be that some people can reliably distinguish the patterns, others won't be able to. In any case, there are a lot of variations on this "visual hash" idea, including the original fractal one,…
Representing SHA-256 Hashes as Avatars
31–40 of 75 posts
Re: Representing SHA-256 Hashes as Avatars
#32The problem with hash avatars in general is that people want to use them for identity verification -- and humans are wired to do so automatically -- but technologically, they cannot provide this. The space of possible avatars (2^256, in this case) is far, far larger than the number of distinct objects that humans can distinguish between. Which means that there will invariably be "collisions:" two avatars that are not…
I assumed there would be existing implementations of something similar but have not found one that fits criteria other than some that use very small word lists. Diceware has 7776 words and pushing that to 8192 should be feasible and is a bit easier to work with.
Re: Representing SHA-256 Hashes as Avatars
#33Earlier quoted context omitted.
> The space of possible avatars (2^256, in this case) is far, far larger than the number of distinct objects that humans can distinguish between. That sounds intriguing to me. Are you aware of any research into this?
To be honest, I have no idea how many distinct objects humans can distinguish between, but I am 99% confident that it is fewer than 2^128, much less 2^256. I suppose it's a somewhat nuanced question, though. For example, if I were shown every avatar in sequence, I'm quite sure I would always notice the "diff" between two consecutive avatars. But the bar that I have in mind is much, much higher: given a sequence of av…
Your example of the fact that we can't reliably recognize every face on this planet is very interesting. Let's imagine we know n faces which I can reliably distinguish from one another, but now there is a (n+1)th face which I mix up with one of the previous ones. Now lets assume this face would instead have a very unique characteristic, unlike all previous faces - lets imagine for example, the nose on this face is upside down. Surely I'd be able to differentiate it from the previous n faces, hence the issue of identifying it might've been the limited variability/characteristics in the various previous instantiations of a face.
So there are a number of characteristics in a face, which have a certain degree of variability, which enable us to distinguish from a number of them. I've been pondering on how many of those characteristics could be combined in an object, and how high the variability could be; to create uniquely identifiable patterns. It probably depends a lot on the meaning we attribute to the pattern, different associations we have to it.
I apologize - quite the tangent, I guess. I've just been pondering a lot on this for a project I've been working on for some time.
Re: Representing SHA-256 Hashes as Avatars
#34It hashes the user's email http://en.gravatar.com/site/implement/hash/ and creates an "identicon" from the hash http://scott.sherrillmix.com/blog/blogger/wp_identicon/ or loads a user-defined image.
Re: Representing SHA-256 Hashes as Avatars
#35Earlier quoted context omitted.
> The space of possible avatars (2^256, in this case) is far, far larger than the number of distinct objects that humans can distinguish between. That sounds intriguing to me. Are you aware of any research into this?
It's a simple order of magnitude calculation. 2^256 is greater than one billion to the eighth power, times 100,000. There are probably several possible ways you could estimate how many different objects a person could distinguish between, but I think it's unlikely you'd come up with even a single billion.
One billion is really really tiny though, let's just play a game :
- Unless you're colorblind, you can easily tell ten hues apart. Let's pick two colors, one with a saturated hue, and the other with a pastel one. That's 100 possibilities.
- I'm pretty sure you can easily recognize pictures of a hundred people you've met at some point in your life. Let's pick two of them, that's 10 thousand combinations.
- can you recognize ten different road signs? Ten country shapes ? Ten animals ? Ten fictional character? Ten books cover? Ten celebrities? Just pick three categories, and you've got a thousand combinations.
Now I'm pretty sure you can tell your grandma sitting under a vivid pink UK shape next to your 9th grade math teacher staring at Bruce Willis holding a giant light blue stop sign apart from any other imaginable combinations.
An untrained[1] human brain probably cannot distinguish between 2^256 items, but it's still able to do it for massive numbers.
[1]: but maybe it's possible with training: for instance, chess professionals might be able to do it.
Re: Representing SHA-256 Hashes as Avatars
#36Why not convert a hash to a correct horse battery staple? https://xkcd.com/936/
Re: Representing SHA-256 Hashes as Avatars
#37Re: Representing SHA-256 Hashes as Avatars
#38As a warning, this would not be good for colorblind people (such as myself). The "Hello, Hacker News!" Hash's middle ring has half it's ring that looks identical to me, and unless I looked carefully, that entire ring looked the same to me.
What would you suggest as a solution ? I considered swapping Hue for Lightness in order to increase contrast changes. Would you be interested in testing out some variants ?
Re: Representing SHA-256 Hashes as Avatars
#39Earlier quoted context omitted.
> The space of possible avatars (2^256, in this case) is far, far larger than the number of distinct objects that humans can distinguish between. That sounds intriguing to me. Are you aware of any research into this?
To be honest, I have no idea how many distinct objects humans can distinguish between, but I am 99% confident that it is fewer than 2^128, much less 2^256. I suppose it's a somewhat nuanced question, though. For example, if I were shown every avatar in sequence, I'm quite sure I would always notice the "diff" between two consecutive avatars. But the bar that I have in mind is much, much higher: given a sequence of av…
Re: Representing SHA-256 Hashes as Avatars
#40https://exascale.info/assets/pdf/students/MSc_Thesis_-_Micha...