bcrypt has a maximum password length of 72 bytes.
https://en.wikipedia.org/wiki/Bcrypt#Maximum_password_length
bcrypt has a maximum password length of 72 bytes.
https://en.wikipedia.org/wiki/Bcrypt#Maximum_password_length
I’m sure a lot of forks will pop up right around this time. I’ll be less skeptical of them once I see actual commits made to the codebase instead of things like just changing the readme
I hate to be that guy, but it doesn’t seem like there’s anything to this fork. At least a few links in the README don’t work, and the domain for the “email” is actively for sale. The owner of the repository doesn’t seem to have any real previous projects on their GitHub account.
I can understand that it’s a new fork, but in my mind you’d want to at least make sure the Readme is… passable before you spread the word and make a Patreon for the project.
EDIT: The Patreon link has been removed since I made this comment. I’m still incredibly skeptical of the project though
Yes, their posts were about Arch Linux.
The second link you gave is probably malware!
Vanced died after they got a cease and desist from YouTube. You might want to recommend https://revanced.app/ instead, which patches the YouTube APK directly on your phone instead of distributing an APK with modified bytecode (which is the given “reason” YouTube killed Vanced)
ReVanced also has patches to remove ads/crack features for other apps as well, which is an added bonus. They’re also open-source
Assuming the claim plugin used on the server is GriefPrevention (the most common one), land claims by default get removed after a certain amount of time unless you have enough claim blocks (usually gained passively via active play on the server, and you need a lot of playtime going off the default config)
I don’t know the specifics behind why the limit is 72 bytes, but that might be slightly tricky. My understanding of bcrypt is that it generates 2^salt different possible hashes for the same password, and when you want to test an input you have to hash the password 2^salt times to see if any match. So computation times would get very big if you’re combining hashes