fairly sure hezbollah has more than 2800 members

bonus points if you’re using a statically typed language but the library uses extensive metaprogramming seemingly for the sole purpose of hiding what types you actually need

I think the problems there are exacerbated a lot by over-eager type coercion and other crappy design decisions inherited from almost 30 years ago

to be even more pedantic, if we follow the relevant official RFCs for http (formerly 2616, but now 7230-7235 which have relevant changes), a 403 can substitute for a 401, but a 401 has specific requirements:

The server generating a 401 response MUST send a WWW-Authenticate header field (Section 4.1) containing at least one challenge applicable to the target resource.

(the old 2616 said 403 must not respond with a request for authentication but the new versions don’t seem to mention that)

but sometimes “👍🏽”.reverse() == “🏽👍”

the thing where it actually helps is if you’re “one word speed reading” (eg. http://onewordreader.com/). Then it’s easier to rapidly focus your eyes on each word, without having to follow a rigid timer. But if you’re reading normally it probably doesn’t help

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.

Actually I think he has already had an adequate amount of recognition:

• “In 1999, Red Hat and VA Linux, both leading developers of Linux-based software, presented Torvalds with stock options in gratitude for his creation.[29] That year both companies went public and Torvalds’s share value briefly shot up to about US$20 million”

• his autobiography is in several hundred library collections worldwide

Awards he’s received:

• 2 honorary doctorates

• 2 celestial objects named after him

• Lovelace Medal

• IEEE Computer Pioneer Award

• EFF Pioneer Award

• Vollum Award

• Hall of Fellows of the Computer History Museum

• C&C prize

• Millenium Technology Prize

• Internet Hall of Fame

• IEEE Masaru Ibuka Consumer Electronics Award

• Great Immigrants Award

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.

I think this specific chain of replies is talking about that actually… though it is a pretty big tangent from the original post

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

you memorize the password required to decrypt whatever container your RSA key is in. Hopefully.

and some people will try to just hold a key down until it reaches the length limit… which is an even worse way to generate a password of that length

this assumes a dictionary is used. Otherwise the entropy would be 117 bits or more. The only problem is some people may fail to use actually uniformly random words drawn from a large enough set of words (okay, and you should also use a password manager for the most part)

realistically, the linux foundation gets all its funding from corporations who have interests in servers, android and embedded. So all the funding goes to those things and not to the linux desktop.

more accurately, average person has a higher tolerance for bullshit than for spending many hours learning something new or spending potentially years applying for citizenship in another country

Removed by mod

other techbros have praised him, citing the exact list of symptoms google gives for “high-functioning psychopath”

(disclaimer: google may give bad medical advice)

C++ is std::__cxx11::list<std::__shared_ptr<table, (__gnu_cxx::_Lock_policy)0>, std::allocator<std::__shared_ptr<table, (__gnu_cxx::_Lock_policy)0> > >::erase(std::_List_const_iterator<std::__shared_ptr<table, (__gnu_cxx::_Lock_policy)0> >) /usr/include/c++/12/bits/list.tcc:158