No? Why would it?
In the negative case, it would say the idea doesn't pan out.
In the positive case, it would mean that you can use just S instead of S and K when doing combinator reduction, but doesn't change that this kind of reduction is not super efficient practically speaking.
I was thinking in specifically the positive, would compression or encoding potentially allow for more compact representation of programs. Like Kolmogorovs