I would like to use a PRG in order to achieve the commitment properties (i.e. Hiding and Binding), however, if we look at a general PRG we cannot state that it has the Binding property.
First I show that it could be shown that it has the Hiding property: given the PRG result on a random seed $s$, i.e. given $g=PRG(s)$, the receiver cannot tell the pre-image of $g$ with more than negligible probability since if there exist a receiver that can produce the pre-image than we can construct a distinguisher to the PRG with the same probability of success.
On the other hand, if we look at the binding property, we cannot state the above, since there exist PRGs that output the same result when operating on seed $s$ and when operating on seed $s+1$ for every even $s$. This can be easily proven. (And thus, the sender surely can commit on even $s$ and later open $s+1$).
My question: Does there exist a variant of a PRG that is proven to provide the commitment properties?