I was wondering if I could do better than `&&` for sorted arrays by doing binary search and came up with some really interesting results. I only did a quick spin of this, an LLM generated most of the code after I gave it the algorithm and I don't plan on using it in production (I'm going to normalize my schema instead) but I wanted to share this in case it's useful to anyone.
