Resolving a replacement chain of unknown depth in one pass of a DATA step: why an in-memory hash is the only structure that fits this shape of problem, what the step guarantees, and what it does when the extract is not clean. A self-contained Base SAS check ships with the note — one fixture, eleven assertions.