A per-key lookup over an adaptive map (the node behind AMap.tryFind and AMap.find). Registers nothing; the key's current value is re-read at the next read after a write, and the version advances only when the value at that key actually changed (read-time equality gate). Writes to unrelated keys cost this node and its consumers nothing — and the write itself costs nothing either (no sink registration, no delivery).