jbosh

The pun in the title is just world class.

I love it. So much in computers is trade offs and this was a fun read exploring it.

It would be interesting to see some economics of what 8,000% increase in encoding time takes to make that money back in terms of storage or bandwidth. I also wonder how brotli/lzma would compare here. Are there some obscene modes on those that had similar results?

The author made a good point here about running trackers and ad ops (think Google analytics or ad words). I'd guess if you don't run those, it'd just be supply chain attacks that could exfiltrate secrets.

This seems like one of those scenarios where you make different trade offs depending on your threat model. The author's threat model sounds similar to a news site where they track and advertise so they're forced to run semi-trusted js.

Have you tried csharpier? It's got some wrinkles but kept things pretty consistent.

How much does http/3 help for server to server traffic? Seems like larger websites can use a CDN or load balancer to do termination and then use http 1.1 to the back end. Is that good enough with large pipes and a high number of connections?

Would a project similar to wine/proton help to cover that gap?

The funny thing with wine is that as the market grows for Linux, more and more bugs will be fixed. I could see a tipping point where even the elusive Adobe Creative Cloud runs on Linux.

I had exactly this! I kept having flare ups and couldn't figure out the pattern until we tore up a bathroom and discovered mold. Suddenly I realized my lungs hurt everytime I had people come stay over. They'd use the spare shower, it'd excite the mold and then I'd need an inhaler. Cheap hotels also put my lungs into a tizzy. Definitely worth checking cause mold is everywhere.

So you're telling me if United goes out and gets a bunch of paper bags to attach to the wings it will reduce drag by 30%? Are there industrial materials that can do this on a 747 and sustain hundreds of hours of flight? I have so many questions. Exciting to see.

I'm just imagining Husker McGumbo, the great golden potato of 1923 who road a wagon train from the Yukon to be the first potatoes in the new world.

XSalsa and XChaCha do something extremely similar. In order to extend the nonce space by 128 bits you basically run a round of ChaCha against 128 bits of your nonce. Those 128 bits represent 96 bits of nonce and 32 bits of counter. Because you know you'll never encode more than 1 full block of data, the counter won't overlap. 256 bits of internal state become the key for the next round of ChaCha plus the remaining 64 bits of nonce and you get to use the full counter space because nonce just became the key.

The paper is also extremely approachable.

https://cr.yp.to/snuffle/xsalsa-20110204.pdf

I wonder if processes like this extend cryptographically in most symmetric ciphers. To add more nonce, encrypt your nonce, output becomes key for next round, add more nonce, repeat. Like all things crypto though, your search space could absolutely collapse if the cipher doesn't have the right properties.

But have you thought about the shareholders?

I love the prospect of going to the least popular items on this list. The volunteers sound super passionate and not having to fight lines is wonderful.

Hard part there is getting the wear and tear from oils in your hand to look identical.

Although maybe most people don't pay attention to that.

Sweet mama speed. Although from what I understand it is more legacy speed cause you're losing all your time to fetching the memory anyway. But when processors were slower it was a meaningful amount.

The fact that msvc generates the unaligned loads for every avx instruction but gcc didn't gave me so many headaches. Most people worked on PC or Xbox and I was on the Playstation team. "oh boy, another one of these..."

C++, it was an in house engine to make everything fit in memory on PS3. Removing fragmentation gave ~10% of usable memory back.

So scary. I was working on a garbage collection bug for a AAA video game one time for months. It'd crash once a day on a tester machine and we'd add more and more prints to try and narrow it down.

Finally got enough information and realized that the padding of a specific object was wrong (GC expected 16 bytes, object was 12 bytes). This caused dozens of other corruption bugs to disappear that we didn't even think were GC related.

Downloading random exes from the internet is real scary. Jamming this into another tool feels like a better way to go.

This is exceedingly cool use of cartridges. Just as a thought experiment I've often wondered if some of the cartridge based consoles could be expanded considerably. Along the lines of this project, would it be possible to throw an arm chip in a cart and send these as h.264? I'm not at a computer but would love to see how differently some modern codecs compress.

What about when those 6 bytes are randomly generated?

RFC 4122 does allow the MAC address in a version-1 (or 2) UUID to be replaced by a random 48-bit node ID, either because the node does not have a MAC address, or because it is not desirable to expose it.

Imagine the rennessaince in shorthand if this became a thing. It feels like the best of both worlds (writing and typing).

This paper came out and changed the game a few years ago. It's called scratch theory and the front edge of the stone scratches tracks for the back edge to run along.

There was a sweeping summit this summer to discuss brooms and how to make them scratch the ice less because it caused players to have extremely high stats for tournaments.

Brad Gushue video showing the effect: https://www.youtube.com/watch?v=haEuz42YCdM These brooms have been made illegal in tournament play.

Some Scotties players describing the effect: https://www.youtube.com/watch?v=147vRw0kmAY

The scratch theory paper: https://www.thesalmons.org/lynn/curling/A5.pdf