Originally Posted by

**LawCounsels**
>>can it be further reduced to 2*8,000,000-1 bits? do you have problem with understanding meaning of the "minimum" word?

The minimum unit of bits saved each time is 2 bits ( not 1 bit ) !

YES it can further reduced to 2*800,000 -2 bits , & continuously do so , BUT each time the chance of successful attaining the minimum 2-bits unit savings gets less & less ( UNTIL its no longer worthwhile continue , when chance of success goes below 50% chance )

ITS A CONTINUOUSLY LESSER CHANCE WITH SMALLER & SMALLER ITERATION'S INPUT BITSLENGTH, & CHANCE CONTINUOUS INCREASES WITH LARGER & LARGER ITERATION'S INPUT BITSLENGTH ( nearer & nearer to 'GUARANTEED' )

SO YOU CAN SEE THERE IS NO ABSOLUTE BITSLENGTH WHERE ITS 'ABSOLUTE GUARANTEED' , ONLY CONTINUOUS HIGHER & HIGHER CHANCE OF SUCCESS ( continuous approaching nearest to 'GUARANTEED' )

ON THE OTHER HAND , ITERATION'S INPUT BITSLENGTH MUST BE VERY MINIMUM OF say 1,000,000 bits ( I am withholding the real actual number ! for usual trade secret reason ) ... & yes it cannot work if iteration's input becomes 1,000,000 -1 bits

[ long before you even get to iteration's input bitslength 1,000,000 bits , it already long becomes not worthwhile continues at around eg 4,000,000 bitslength when success chance already goes below 50%