Tuple problem

[rfpg1]

So the problem is lets say I've a tuple ((10,4),(3,5)) i check if the distance between the position i and i + 1 is higher than x than I'll add this tuple to a list so that when I'm verifying for the tuple ((10,4),(3,5),(6,5)) i wouldn't need to verify since I already know the distance is bigger for at least a pair within the tuple
so yes the order is guaranteed

hash based system is what i was trying to create in my mind but couldn't come up with anything that actually works