• 4 Posts
  • 40 Comments
Joined 1 year ago
cake
Cake day: July 16th, 2023

help-circle









  • many words should run into the same issue, since LLMs generally use less tokens per word than there are letters in the word. So they don’t have direct access to the letters composing the word, and have to go off indirect associations between “strawberry” and the letter “R”

    duckassist seems to get most right but it claimed “ouroboros” contains 3 o’s and “phrasebook” contains one c.



  • The same comment touches on several topics, replying to 2 different people. These two statements being in the same comment is not evidence of them being about the same thing, and if the author expected readers to get that from it, it is absolutely the author’s fault if their words got misinterpreted.

    And in the next paragraph:

    We importantly chose not to call anyone out by name in the there because our expectations aren’t about one person. All of us need to be aware of what is and isn’t okay and a lot of people were involved in the problematic threads, even if Tim, as self-identified here, was one big part

    Again referring to multiple people.






  • is-number is a one-line function. (though it’s debatable if a function that complex should be compressed to one line)

    You may have heard of a similar if more extreme “microdependency” called is-even. When you use an NPM package, you also need all the dependencies of that package, and the dependencies of those dependencies recursively. Each package has some overhead, eventually leading to this moment in time.




  • the direct chain I can see is

    “can you string words to form a valid RSA key”

    “I would hope so, [xkcd about password strength]”

    “words are the least secure way to generate random bytes”

    “Good luck remembering random bytes. That infographic is about memorable passwords.”

    “You memorize your RSA keys?”

    so between comments 2 and 3 and 4 I’d say it soundly went past the handcrafted RSA key stuff.



  • sus@programming.devtolinuxmemes@lemmy.world-----BEGIN PRIVATE KEY-----
    link
    fedilink
    arrow-up
    2
    arrow-down
    1
    ·
    edit-2
    4 months ago

    if you know there are exactly two additional characters

    this is pretty much irrelevant, as the amount of passwords with n+1 random characters is going to be exponentially higher than ones with n random characters. Any decent password cracker is going to try the 30x smaller set before doing the bigger set

    and you know they are at the end of the string

    that knowledge is worth like 2 bits at most, unless the characters are in the middle of a word which is probably even harder to remember

    if you know there are exactly two additional characters and you know they are at the end of the string, the first number is really slightly bigger (like 11 times)

    even if you assume the random characters are chosen from a large set, say 256 characters, you’d still get the 4-word one as over 50 times more. Far more likely is that it’s a regular human following one of those “you must have x numbers and y special characters” rules which would reduce it to something like 1234567890!?<^>@$%&±() which is going to be less than 30 characters

    and even if they end up roughly equal in quessing difficulty, it is still far easier to remember the 4 random words