Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Optimize the Math.random implementation #1171

Closed
wants to merge 3 commits into from

Conversation

woshiccm
Copy link

@facebook-github-bot
Copy link
Contributor

Hi @woshiccm!

Thank you for your pull request and welcome to our community.

Action Required

In order to merge any pull request (code, docs, etc.), we require contributors to sign our Contributor License Agreement, and we don't seem to have one on file for you.

Process

In order for us to review and merge your suggested changes, please sign at https://code.facebook.com/cla. If you are contributing on behalf of someone else (eg your employer), the individual CLA may not be sufficient and your employer may need to sign the corporate CLA.

Once the CLA is signed, our tooling will perform checks and validations. Afterwards, the pull request will be tagged with CLA signed. The tagging process may take up to 1 hour after signing. Please give it that time before contacting us about it.

If you have received this in error or have any questions, please contact us at [email protected]. Thanks!

@woshiccm
Copy link
Author

@tmikov @psaha-rbi pls help to review, thanks

if (!storage->randomEngineInited) {
struct timeval tv;
gettimeofday(&tv, NULL);
storage->randomState_ = static_cast<uint64_t>((tv.tv_sec * SECONDS_TO_SUBTLE) + tv.tv_usec);

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think this is problematic because

  • clock resolution maybe more coarse grained than microseconds. e.g. on Linux it is usually 10us.
  • Even if there is perfect microsecond granularity, you'll start getting collisions if thousands of uuids are generated every second across many devices since many of them will get the same read of microsecond. In general, even though the "microseconds since epoch" is a large value it has very strong temporal locality in the sense that at any point in time all values will be tightly clustered.
  • I also feel not so warm about rolling a custom RNG where there are so many available in the standard library specially, without running any of the standard randomness test suites on it.

I'd recommend using std::random_device()() to generate multiple 32-bit numbers and concatenating those to form a 64 bit seed or better yet, use a std::seed_seq() with enough members to initialize a Mersenne twister to get a very long period.

Copy link
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

OK, thanks, will try it

Copy link
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I have changed the implement

@neildhar
Copy link
Contributor

neildhar commented Feb 5, 2024

Closing since we merged 34f0b2b instead.

@neildhar neildhar closed this Feb 5, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

The Math.random implementation in Hermes is collision prone for the App use case
4 participants