A related question is: "What is the smallest fixed set of guesses which always solve Wordle, narrowing down possible hidden words to just one?". So far the answer is 8: MODEL LEVIN TAPPA GRABS DURGY FLYTE CHAWK SPOOR [1].
Bringing this down to 5 would mean that one could always win at Wordle with the same set of 5 guesses. Seems unlikely that such a solution exists, but interesting question nonetheless.