➜

This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author jdemeyer
Recipients eric.smith, jdemeyer, mark.dickinson, rhettinger, sir-sigurd, tim.peters
Date 2018-09-22.09:12:44
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <1537607564.65.0.956365154283.issue34751@psf.upfronthosting.co.za>
In-reply-to
Content 
> I'm not aware of any research papers about picking multipliers in this context, but would love to see one.

The only real condition that I can think of is that the order should be large: we do not want MULTIPLIER**n = 1 (mod 2**N) for a small number n.

Other than that, we could pick the multiplier to guarantee no hash collisions on some chosen subset of inputs. A bit like your product(range(100), repeat=4) example but then for more inputs.

If you agree with this approach, I could try to find a good multiplier this way.
History
Date User Action Args
2018-09-22 09:12:44jdemeyersetrecipients: + jdemeyer, tim.peters, rhettinger, mark.dickinson, eric.smith, sir-sigurd
2018-09-22 09:12:44jdemeyersetmessageid: <1537607564.65.0.956365154283.issue34751@psf.upfronthosting.co.za>
2018-09-22 09:12:44jdemeyerlinkissue34751 messages
2018-09-22 09:12:44jdemeyercreate