A stable identity used to key this constraint's penalty memory on a solution. Response constraints use their (problem-unique) response name; deterministic constraints carry no penalty memory (their violation is exact), so their key is a formal identity only.