Author mark.dickinson
Recipients Arfrever, Giovanni.Bajo, PaulMcMillan, Vlado.Boza, alex, arigo, benjamin.peterson, camara, christian.heimes, dmalcolm, haypo, koniiiik, lemburg, mark.dickinson, serhiy.storchaka
Date 2012-11-07.13:03:05
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <1352293385.93.0.89690090046.issue14621@psf.upfronthosting.co.za>
In-reply-to
Content
[Armin]
> You can build a sequence of (long) integers that have all exactly the
> same hash, but doing that is not as easy as "2**k".

Sure it is.  The hash for integers is (by design) repeated modulo a number of the form 2**n - 1:  we use 2**61 - 1 on 64-bit systems and 2**31 - 1 on 32-bit.  So in {2**k for k in range(n)} you get at most 61 distinct hash values.
History
Date User Action Args
2012-11-07 13:03:05mark.dickinsonsetrecipients: + mark.dickinson, lemburg, arigo, haypo, christian.heimes, benjamin.peterson, Arfrever, alex, dmalcolm, Giovanni.Bajo, PaulMcMillan, serhiy.storchaka, Vlado.Boza, koniiiik, camara
2012-11-07 13:03:05mark.dickinsonsetmessageid: <1352293385.93.0.89690090046.issue14621@psf.upfronthosting.co.za>
2012-11-07 13:03:05mark.dickinsonlinkissue14621 messages
2012-11-07 13:03:05mark.dickinsoncreate