In SRP, the server stores the client verifier $v$, defined as $v=g^x \operatorname{mod}N$. $x$ is an implementation-defined value derived from the user's password $p$ and salt $s$ (and often other values, such as the username $I$).
The RFC2945-defined method to derive $x$ is $x=H(s \|H(I\|\text{":"}\|p))$. $H$ is suggested as SHA-1 and often also implemented as SHA-256. That means that in the usual case, $x$ is a 160-bit or 256-bit value.
$x$ is effectively password-equivalent, so knowing it (and the associated $I$ and $s$) would allow an attacker to impersonate the user, for example in the case of a leaked $v$.
My question here is: assuming a dictionary attack on $g$ isn't the biggest threat1, does it weaken the security of the protocol that $x\ll N$? Mainly, does it make the discrete logarithm problem on $g^x$ easier to solve? This would be easy to mitigate by using a longer hash or extendable-output function for $x$.
1 i.e., $p$ has lots of entropy and $x$ is computed using a slow hash