Date: Mon, 6 Mar 2000 14:35:55 +0000 From: Anatoly Vorobey <mellon@pobox.com> To: Dag-Erling Smorgrav <des@flood.ping.uio.no> Cc: chat@freebsd.org Subject: Re: M$ one-ups UNIX??? Message-ID: <20000306143555.A7305@happy.checkpoint.com> In-Reply-To: <xzp3dq4a1hg.fsf@flood.ping.uio.no>; from des@flood.ping.uio.no on Mon, Mar 06, 2000 at 10:31:39AM %2B0100 References: <XFMail.000302142901.doconnor@gsoft.com.au> <xzp3dq4a1hg.fsf@flood.ping.uio.no>
next in thread | previous in thread | raw e-mail | index | archive | help
On Mon, Mar 06, 2000 at 10:31:39AM +0100, Dag-Erling Smorgrav wrote: > The very best would be to use a set of checksum algorithms which > guaranteed that no two blocks of equal size could have identical > checksums and yet be different, but I have a hunch that says it can be > proved that there is no such beast. Is only possible if the total size of all the checksums is greater or equal to the size of the block, which kind of renders it useless. -- Anatoly Vorobey, mellon@pobox.com http://pobox.com/~mellon/ "Angels can fly because they take themselves lightly" - G.K.Chesterton To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-chat" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20000306143555.A7305>