Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!raubtier-asyl.eternal-september.org!.POSTED!not-for-mail
From: Bonita Montero <Bonita.Montero@gmail.com>
Newsgroups: comp.lang.c
Subject: Re: Good hash for pointers
Date: Mon, 3 Jun 2024 17:54:30 +0200
Organization: A noiseless patient Spider
Lines: 22
Message-ID: <v3kovm$3v2ie$1@raubtier-asyl.eternal-september.org>
References: <v2n88p$1nlcc$1@dont-email.me>
 <v2qm8m$2el55$1@raubtier-asyl.eternal-september.org>
 <v2qnue$2evlu$1@dont-email.me> <v2r9br$2hva2$1@dont-email.me>
 <86fru6gsqr.fsf@linuxsc.com>
 <v2sudq$2trh1$1@raubtier-asyl.eternal-september.org>
 <8634q5hjsp.fsf@linuxsc.com>
 <v2vmhr$3ffjk$1@raubtier-asyl.eternal-september.org>
 <86le3wfsmd.fsf@linuxsc.com>
 <v2voe7$3fr50$1@raubtier-asyl.eternal-september.org>
 <86ed9ofq14.fsf@linuxsc.com>
 <v2vs40$3gflh$1@raubtier-asyl.eternal-september.org>
 <86sexypvff.fsf@linuxsc.com> <20240602104506.000072e4@yahoo.com>
 <v3kk9p$3u8qu$1@raubtier-asyl.eternal-september.org>
 <20240603174604.000014d4@yahoo.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Mon, 03 Jun 2024 17:54:30 +0200 (CEST)
Injection-Info: raubtier-asyl.eternal-september.org; posting-host="a53cd7e0133154ada14bd40bdefffe9e";
	logging-data="4164174"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/oWIP0MgP4kyd9dnu1H9WhutOjddb4xxs="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:vphSAiJJmA0io6YWQ+QsdDa9pEs=
In-Reply-To: <20240603174604.000014d4@yahoo.com>
Content-Language: de-DE
Bytes: 2412

Am 03.06.2024 um 16:46 schrieb Michael S:
> On Mon, 3 Jun 2024 16:34:37 +0200
> Bonita Montero <Bonita.Montero@gmail.com> wrote:
> 
>> Am 02.06.2024 um 09:45 schrieb Michael S:
>>
>>> So, what were your conclusions?
>>> Ignoring the speed of computation, would something like
>>> cryptographic hash scaled to bucket size be a best hash for this
>>> type of application? Or some sort of less thorough grinding of the
>>> bits is better?
>>
>> There's no need for a crypto-hash here.
>>
> 
> Do you think I don't know?
> Crypto hash is just an example of near-ideal pseudo-random uniformity.
> 

As I've shown for pointers you get a perfect equal distribution with
multiplying by an appropriate prime.