Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 3675960
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 19, 20262026-05-19T03:02:30+00:00 2026-05-19T03:02:30+00:00

I wrote the following module which encodes a UUID to an arbitrary base: http://pypi.python.org/pypi/shortuuid/

  • 0

I wrote the following module which encodes a UUID to an arbitrary base:

http://pypi.python.org/pypi/shortuuid/

Now, this gets it down to 22 symbols with the default alphabet while preserving uniqueness, but I was wondering how many (/which) digits I could cut off while maximising the retained uniqueness.

Are all the digits of a UUID equally random/unique, or are some digits more random than others? For example, if the first few digits are a machine/application-specific identifier, then obviously they would be less random than the last few. I haven’t noticed anything like this in my experiments, but I want to be sure before I advise people on it.

Will truncating it to, say, 8 digits have 1/57^8 probability of a clash, or does is the probability not uniform on the digits?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-19T03:02:31+00:00Added an answer on May 19, 2026 at 3:02 am

    Because of the way UUID’s are constructed, it very much depends on the version. And yes, some will be more random than others.
    http://en.wikipedia.org/wiki/Uuid#Version_1_.28MAC_address.29

    One way to hack around this is by taking a hash (i.e. sha256 for example) of the UUID. Those hashes should be distributed in a uniform way.

    Do note that I haven’t done a really thorough analysis here. My answer should be in the ballpark but I give no guarantee that it’s completely correct.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Wrote the following in PowersHell as a quick iTunes demonstration: $iTunes = New-Object -ComObject
I wrote the following javascript to put in my startup folder to work around
I wrote the following Nant script on my Vista dev machine and was pleased
I just wrote the following C++ function to programmatically determine how much RAM a
Using an idea from Bob King idea I wrote the following method. It works
In C++Builder, I wrote the following code (in Button1Click handler), When I run in
I needed some simple string encryption, so I wrote the following code (with a
I wrote a managed C++ class that has the following function: void EndPointsMappingWrapper::GetLastError(char* strErrorMessage)
I've got the following bit of code (that another developer wrote) that I need
How can I write the following code quickly in emacs? \newcommand{\cA}{\mathcal A} \newcommand{\cB}{\mathcal B}

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.