Create a quine that cannot be golfed. Your score is your byte count, where higher is better. If someone finds a shorter version, their score is your original byte count, and you lose points
original submission, 34 bytes // score is 34
golfed, 31 bytes // score is 34, original submission is scored 31
golfed again by someone else, 18 bytes // score is 31, first golfed submission is scored 18
Here "golfing" is defined as creating a shorter version of someone else's source file exclusively by removing characters or rearranging existing characters (without affecting its quine-ness). This seems like a good way to define it because otherwise googling the shortest quine in a given language would be the only reasonable starting point.
Standard loopholes apply, unless you have a creative use of one then go for it. Use this site's definition of a valid quine, if you can actually find one that's agreed on.