Looking on the internet deeply has found these results:

if the bit was zero is the most popular phrase on the web.

if the bit were zero 12 results on the web	if the bit was zero 14 results on the web More popular!
Some examples and use cases from the internet:	Some examples and use cases from the internet:
... because we timed out. You could use the loope/loopz instruction if the bit were zero rather than one. The loopne/loopnz instruction does not affect any flags. ... because we timed out. You could use the loope/loopz instruction if the bit were zero rather than one. The loopne/loopnz instruction does not affect any flags.	1 if the bit was 1. MAX([,< expression>]...) Returns the maximum value from a list of numeric expressions. In other words, if the bit was zero and it's still 0, the bit will be zero. If it was 1 and it's still 1, the bit will be zero. Otherwise, the bit will be one. This is how we�... establishment, then after single sided re Returns zero if the bit was zero, returns Jul 18, 2013 ... We would reveal H(z) if the bit was one, or z if the bit was zero. But an attacker could take our signature of zero (z) and calculate H(z), thus�... establishment, it is toggled to one, and vice versa. Jul 2, 2009 ... ... i.e., if the bit was zero before single sided re

if the bit were zero

12 results on the web

if the bit was zero

14 results on the web

More popular!

... because we timed out. You could use the loope/loopz instruction if the bit were zero rather than one. The loopne/loopnz instruction does not affect any flags.
... because we timed out. You could use the loope/loopz instruction if the bit were zero rather than one. The loopne/loopnz instruction does not affect any flags.

1 if the bit was 1. MAX([,< expression>]...) Returns the maximum value from a list of numeric expressions.
In other words, if the bit was zero and it's still 0, the bit will be zero. If it was 1 and it's still 1, the bit will be zero. Otherwise, the bit will be one. This is how we�...
establishment, then after single sided re
Returns zero if the bit was zero, returns
Jul 18, 2013 ... We would reveal H(z) if the bit was one, or z if the bit was zero. But an attacker could take our signature of zero (z) and calculate H(z), thus�...
establishment, it is toggled to one, and vice versa.
Jul 2, 2009 ... ... i.e., if the bit was zero before single sided re