Choose the exact operation contract or failure result for each structure. Use the runnable traces to separate a stored item from a candidate, a legal placement from a merely empty slot, a complete diff from a partial peel, and a unitig from an arbitrary route.
Lessons
- Double-array tries: static incident-code transitions with BASE and CHECK
- Hopscotch hashing: keep each shipment near its home bucket
- Invertible Bloom tables: peel differences between replica ID sets
- De Bruijn graphs: compact non-branching k-mer routes into unitigs