3 ms·
I considered this, but I'd just be so unsatisfied if I finished scrolling through all 2^128 rows and realized I'd seen some duplicates!
by eieio 2y ago
I considered this, but I'd just be so unsatisfied if I finished scrolling through all 2^128 rows and realized I'd seen some duplicates!
- thaumasiotes 2y agoI liked the approach movpasd suggested: https://news.ycombinator.com/item?id=42346076 https://news.ycombinator.com/item?id=42346076 With a linear algebra library, you can guarantee that you've found the next, or the previous, match in sequence. I don't know what the state of the art is for fast linear algebra in javascript, though. (The matrix approach also has the advantage that, when your full-text search problem has 2^115 solutions, you can compute the one you want, the next one after some index, without having to compute them all.)
- eieio 2y agoI need to learn more linear to be able to appreciate this! Gonna do some reading. very fun to have received so many pointers here, hopefully I'll be able to do a follow up blog once I've finally let people find all the good UUIDs