The Resource λ-calculus is a variation of the λ-calculus where arguments can be superposed and must be linearly used. Hence it is a model for linear and non-deterministic and programming languages, and the target language of Ehrhard-Taylor expansion of λ-terms. In a strictly typed restriction of the Resource λ-calculus, we study the notion of path persistence, and we define a Geometry of Interaction that characterises it. The construction is also invariant under reduction and able to count addends in normal forms.