On 07/11/2012 04:36 PM, Justin Stringfellow wrote:
>> Since there is a finite number of bit patterns per block, have you tried to
>> just calculate the SHA-256 or SHA-512 for every possible bit pattern to see
>> if there is ever a collision? If you found an algorithm that produced no
>> collisions for any possible block bit pattern, wouldn't that be the win?
> Perhaps I've missed something, but if there was *never* a collision, you'd
> have stumbled across a rather impressive lossless compression algorithm. I'm
> pretty sure there's some Big Mathematical Rules (Shannon?) that mean this
> cannot be.
Do you realize how big your lookup dictionary would have to be?
zfs-discuss mailing list