From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id 0AF5ABC32 for ; Thu, 17 Mar 2005 18:32:16 +0100 (CET) Received: from qrnik.knm.org.pl (paf87.warszawa.sdi.tpnet.pl [217.96.225.87]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id j2HHWCgi014641 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 17 Mar 2005 18:32:15 +0100 Received: from qrczak by qrnik.knm.org.pl with local (Exim 3.36 #1) id 1DByqs-0003qn-00 for caml-list@yquem.inria.fr; Thu, 17 Mar 2005 18:32:06 +0100 To: caml-list@yquem.inria.fr Subject: Re: [Caml-list] Maximum non-constant constructors X-Face: OW>RV&gN+&b-aiNY|U)f=S%w+/rK!);f>/W9IXg})]&F>ht.1Up8@04+_!gOp(_/l_-+E^. 2\vI)1=D,%HWiq)r(M/V~dr^5T^KF/[w5YZ4<0Sus3+O>l3uA/&W_21m?.s,Po8{pb0@ References: <42388E28.6050808@confluent.org> <42389A3B.5060107@inria.fr> <20050316233228.GA5689@furbychan.cocan.org> <16953.31187.263581.694769@gargle.gargle.HOWL> <20050317140034.GA7049@localhost> From: "Marcin 'Qrczak' Kowalczyk" Date: Thu, 17 Mar 2005 18:32:06 +0100 In-Reply-To: <20050317140034.GA7049@localhost> (Eric Cooper's message of "Thu, 17 Mar 2005 09:00:34 -0500") Message-ID: <873buub2ll.fsf@qrnik.zagroda> User-Agent: Gnus/5.1006 (Gnus v5.10.6) Emacs/21.3 (gnu/linux) MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Sender: "Marcin 'Qrczak' Kowalczyk" X-Miltered: at nez-perce with ID 4239BF1C.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; caml-list:01 constructors:01 hash:01 btype:01 hash:01 writes:01 typing:01 probability:01 probability:01 variant:02 root:03 beware:04 identifier:04 edu:07 zero:07 X-Spam-Checker-Version: SpamAssassin 3.0.2 (2004-11-16) on yquem.inria.fr X-Spam-Status: No, score=0.1 required=5.0 tests=FORGED_RCVD_HELO autolearn=disabled version=3.0.2 X-Spam-Level: Eric Cooper writes: > (If you examine the hash_variant function in typing/btype.ml, it's > clear that any base-223 representation of a multiple of 2^31 in > which the "digits" are legal identifier characters will hash to > zero, and will therefore be an "invisible prefix".) Beware of the birthday paradox: the probability of finding two values with the same hash is much larger than the probability of finding a single value with the given hash (a square root of the previous one). -- __("< Marcin Kowalczyk \__/ qrczak@knm.org.pl ^^ http://qrnik.knm.org.pl/~qrczak/