• Persistent trees in https://github.com/Chouffe/clj-trie have 32 nodes - this is the source of “lazy” sequences not being truly lazy
  • Clojure 1.0 used to “chunk” one element at a time; Clojure 1.1 started chunking in chunks of 32
  • Lazy evaluation is great for very large sequences - we will grab the first 32 elements
  • We can do things like apply a function to every element in a million-long collection without actually performing the function call on anything apart from the first 32 elements (until we need to)
  • Realising means actually getting the (chunked) elements in the array

References