It didn’t have to be this way

Yup, I know exactly what this video is going to be about, definitely not a click bait title, lol.

The topic is interesting, the video apparently not so much (if it needs that title to do well). So I think AI is acceptable here, given that no one else bothered to provide a summary so people don’t need to waste time watching it.

Are you sure about that? DHL GLS (the shipping company Valve uses in the EU) has an app to move your delivery time or reroute the package, but it wouldn’t allow me to delay my SC package because “the sender” blocked it. So it sounds like a Valve problem to me here in EU.

A roguelike written in my lisp, where the magic system is a lisp.

This is so much better and more eye catching description (first line of readme)

The headline is misleading if you are familiar with bloom filters.

TL;DR: the interesting thing here isn’t decreased false positive rate (multibit bloom filters are common), but the idea to put the relevant bits together. Basically you use a hash to pick a chunk of bits (32 bits in this case), then use more hashes to pick the bits within this chunk.

It is a tradeoff between accuracy (completely independent hashes would be less likely to have collisions leading to false positives) and performance (all relevant bits for the object you’re looking up will be together and the lookup will trigger at most one cache miss / memory access).

Maybe if ReactOS on RISCV becomes a reality

Do you mean RedoxOS by chance? AFAIK ReactOS is a clean room implementation of Windows/NT