fix: correct exponential backoff by replacing XOR with bit shift

[m-iskw335]

Description

• Fixes a logical error in the exponential backoff calculation for file uploads by replacing the bitwise XOR operator with a bit shift.

Problem:

• The retry logic currently uses the bitwise XOR operator (^), which is a logical error for exponential backoff in Go. This causes the retry delay to drop to 0 seconds on the third attempt.

With delayMultiplier = 2:

Attempt 0: 2 ^ 0 = 2
Attempt 1: 2 ^ 1 = 3
Attempt 2: 2 ^ 2 = 0

Solution

Replaced delayMultiplier^attempt with 1 << attempt to ensure proper exponential backoff (1s, 2s, 4s...).

[google-cla]

Thanks for your pull request! It looks like this may be your first contribution to a Google open source project. Before we can look at your pull request, you'll need to sign a Contributor License Agreement (CLA).

View this failed invocation of the CLA check for more information.

For the most up to date status, view the checks section at the bottom of the pull request.

[m-iskw335]

@Sivasankaran25
Just checking in to see if there’s anything else needed on my end to move this forward. Happy to help if there are any adjustments required!

[Sivasankaran25]

@Sivasankaran25 Just checking in to see if there’s anything else needed on my end to move this forward. Happy to help if there are any adjustments required!

Thank you for bringing this to our attention. We truly appreciate you flagging this PR, we will file a internally.