7 ms·
Or use a new password every day like worle. So you have a community effort to guess it
by jpeter 5y ago
Or use a new password every day like worle. So you have a community effort to guess it
- faeyanpiraat 5y agoIs any of the information (yellow/green for characters) presented getting you closer to the real answer in any meaningful way though?
- SamBam 5y agoNo, that's the joke of the site.
- core-utility 5y agoInherently with a (proper) hashing algorithm, the value and placement of characters in the hash means next-to-nothing in terms of the actual original text. For example: password = 5e884898da28047151d0e56f8dc6292773603d0d6aabbdd62a11ef721d1542d8 passwurd = 1966e583daff0fce5630d5de44f303f0e77f77940f02c7d648defadc31059c7b Notice they're very different results, even though the original text only has 1 character difference.
- therein 5y agoThe Avalanche effect for anyone interested in reading more. https://en.wikipedia.org/wiki/Avalanche_effect https://en.wikipedia.org/wiki/Avalanche_effect
- _rr43 5y agoSort off, if you already have a lookup table of possible solutions.
- FabHK 5y ago... which you won't, because the space is too large (around 90 bits of entropy if I'm not mistaken, bit less, so 10^27-ish possible solutions).
- jerf 5y agoAccording to the best current knowledge of humanity, it provides no information whatsoever. However, proving that is difficult. It is possible that there exists an algorithm that could narrow in on the answer from hashes. Such an algorithm could run quickly, but it could also potentially take quite significant computation. We don't know what the true, optimal answer to this question is.
- mlyle 5y ago> According to the best current knowledge of humanity, it provides no information whatsoever. ??? My first guess has two green letters, or 8 bits of the hash are known. This excludes 255/256 of possible passwords-- so if there's a dictionary, it's way cut down. I also know for the other 30 digits a value that they are not-- this is about .1 bits apiece, for 3 more bits. And I get a few more bits from knowing the population count for each digit. One guess has reduced the search space by a factor of 10000+. If I say, know the word is in /usr/share/dict/words, the number of possibilities has dwindled from 230,000 to something around 20. Now, in this case, with a 14 character randomized password-- the amount of benefit is limited. The search space is still significantly shrunk by each guess, but in a way that is difficult to iterate.
- residualmind 5y agoAre you sure thats how evenly distributed hash algorithms work? change one letter of your string, or just make it longer or shorter - none of your green fields will stay.
- thewakalix 5y agoNothing about this algorithm relies on similar words producing similar hashes. If the word “foobar” has a 0 in the first digit of its hash, and you see a green 1 in the first digit in Passwordle, then you know that the answer can’t be foobar.
- mlyle 5y ago> Are you sure thats how evenly distributed hash algorithms work? change one letter of your string, or just make it longer or shorter - none of your green fields will stay. True. But still, I know the vast majority of words in my dictionary don't match those two green fields after hashing, and can be eliminated from further consideration as the password.
- cestith 5y agoIt reduces the search space to find the hash, but not the search space of what hashes to that value.
- oceliker 5y agoThat sounds like Bitcoin with extra steps Jokes aside, that would actually be fun if the password is actually reasonably guess-able, I would definitely give it a try if that existed