Choose the operation or failure rule supported by each index. Test a byte-edge promotion, an exact row mask, a verified fingerprint distance, and a shared word-state transition against the runnable examples.
Lessons
- Adaptive radix trees: grow byte-edge nodes as incident codes branch
- Bit-sliced indexes: filter and sum fixed-width sensor readings
- SimHash bands: find near-duplicate incident fingerprints
- Minimal acyclic dictionaries: merge equivalent word suffix states