I do wonder if jumping back by twice as much is optimal.

It is. This is called exponential search, which maintains the O(log(n)) time complexity of binary search.

(Where n is the position of the commit you are searching for.)