From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-0.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD, FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4 X-Received: by 2002:a5e:de06:: with SMTP id e6-v6mr7307399iok.8.1531748041062; Mon, 16 Jul 2018 06:34:01 -0700 (PDT) X-Received: by 2002:aca:de07:: with SMTP id v7-v6mr3837965oig.5.1531748040748; Mon, 16 Jul 2018 06:34:00 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!feeder4.usenet.farm!feed.usenet.farm!weretis.net!feeder6.news.weretis.net!feeder.usenetexpress.com!feeder-in1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!d7-v6no5268594itj.0!news-out.google.com!n194-v6ni167itg.0!nntp.google.com!g2-v6no5257855itf.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Mon, 16 Jul 2018 06:34:00 -0700 (PDT) In-Reply-To: <5a66cd8a-e11d-4a59-bce1-8cc693b4160a@googlegroups.com> Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=76.113.16.86; posting-account=lJ3JNwoAAAAQfH3VV9vttJLkThaxtTfC NNTP-Posting-Host: 76.113.16.86 References: <5a66cd8a-e11d-4a59-bce1-8cc693b4160a@googlegroups.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: Re: Simple hash or pseudo-random function From: Shark8 Injection-Date: Mon, 16 Jul 2018 13:34:01 +0000 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Xref: reader02.eternal-september.org comp.lang.ada:53843 Date: 2018-07-16T06:34:00-07:00 List-Id: On Monday, July 16, 2018 at 2:20:28 AM UTC-6, gautier...@hotmail.com wrote: > Hello, > Does someone have a function that would take an integer (range 0 .. 2**63= ), not uniformily distributed (it's a code with some meaning) and return a = number that is pseudo-random, uniformily distributed (could be a floating-p= oint number or an integer in a range of minimum length 365) ? > The difficulty for me is to find a very simple function. There are many t= hat are for hashing strings, but they could be too time-consuming: it's for= a number-crunching program where this function will be called billions of = times, so I'm looking for something really simple (and fast :-) ). > TIA There was somebody a few years back who was an older Mathematician who post= ed a RNG function to this board some years ago. That might be useful for yo= u. (I want to say his method was KISS#### or something like that.)