Is P = NP when solutions length is polynomially bounded by instance length?
You ask


  Doesn't polynomially bounding the length of possible solutions to a given instance mean that there are only polynomially many possible solution candidates?


In fact, the number of binary strings of length $n^c$ is $2^{n^c}$, which is exponential in $n$.