I legitimately thought the parent comment was satire

Reminds me of a message I got on LinkedIn on Memorial Day weekend.

"Memorial Day is an opportunity to slow down and think about the service of those who gave their lives for America and for our freedom.

We offer you freedom from the hassle of hiring your own internal engineering team by providing you with vetted, experience software engineers in the same time zone as your company."

We had this for a long time

In theory, yes, but until these medications become generic, it will continue to cause huge losses for insurance companies. The cost of these medicines alone is worth more than premiums

Well, don't you think you're getting a ton of value because they're selling each of their dollars for 0.2 dollars?

You just don’t pay. Hospitals eat the cost.

I assume it'd get sold to a collection agency for something like $500, which would then try to get you to pay as much as possible, possibly settling for as low as $2000).

So the hospital is still getting paid something, and the billee has the option to take a bigger credit hit or to negotiate down

Wow. I was wondering why SMS autofill wasn’t working on my Arc browser.

Made some 12v-2x6 custom cables for fun and 99% sure the melting problems are from the microfit female connectors themselves. A lot of resistance going through the neck

Do you have any tips on knowing how the value is a result of CRC32 and/or the polynomial/initial value used?

In this example, the "encrypted data" is xored with the key 4 bytes at a time. The first 4 bytes in the data are the same as the key. For the next 4 and you get the constant I posted above. Plug into Google, find where it is often found, decide rest of table, see it matches.

I've learned programmers either invent their own hashes, random number generators, and crypto, in which case I usually break them, or they reuse existing algos, in which any code constants are searchable.

Plus I've written and reversed enough of all that I recognized the loop as a CRC polynomial remainder loop.

All Crc-n algos are trivially crackable/reversible/collideable. They're a remainder on division of polynomials (learn the math on how they work), so use the polynomial equivalent of extended euclidean algo and you get one answer. Now all sufficient multiples of that mod class give all possible answers, one at a time.

That should give you plenty to chase through

Is it possible to learn this power?

No. It is not possible. I am a Highlander

Looking in the binary for the polynomial and knowing what the common ones are from experience is an easy way.

Normally, the polynomial is going to be found right next to a loop that is ingesting bytes incrementally.

The polynomial is not present in the binary. The table was obfuscated so this approach will not work here (and it's pretty common to do this specifically to stop such a simply look at the bytes in a binary).

You do know that USA stands for United States of America, right?

I feel the exact same way.