Variant of Subset-sum has an $O(1)$ algorithm if $Goldbach$ is true
If there is a finite number of exceptions to the Goldbach conjecture then it is still solvable in linear time.
Note that there is a non-zero probability that the Goldbach conjecture is false. Heuristically, the probability for an infinite number of exceptions is zero.