I completed filming for another #Funciton video (5b), but the result seemed, let's say, unappealing enough that I'm considering writing a whole new library to establish some functionality to allow it to run much more efficiently. Specifically, I've been thinking about the fact that both lists and lazy sequences require evaluating from the start, which means you can't index into them any faster than O(n). I always just assumed that you can't do any better because lists use a variable-length encoding, and I assumed that they needed that to accommodate arbitrary-size integers. But now I'm thinking about a new strategy where only one number, the number of bits per element, needs a variable-length encoding, and then everything else can be directly indexed via multiplication and bit shifting. I think I'm going to call that “arrays”. I'm excited about the idea but I'm intimidated by the need to find yet more function names for common operations like count, insert, etc.