making search fast means touching fewer bytes and doing less work per byte
tpuf v3 compresses columns with composable schemes: 1M zeros becomes {val: 0, len: 1_000_000}, and predicates run directly on compressed data
1 comparison vs 1M → faster filters