()
return random_url_id(8)
Get a short random identifier

    The identifier is chosen from a 64 bit key space, which is suitably
    large for no likely collisions in 1000 concurrent keys but kept
    small to minimize key length. 1000 is an arbitrary number chosen as
    an upper bound of the number of attachments associated with any
    given object. We may need to change this if we ever expect an object
    to have significantly more than 1000 attachments. The probability of
    a collision with a 64 bit ID is:

    k = 1000
    N = 2 ** 64
    (k ** 2) / (2 * N) = 2.7e-14

    which is somewhere near the probability of a meteor landing on
    your house. For most objects the number of blobs present at any
    moment in time will be far lower, and therefore the probability
    of a collision will be much lower as well.

    http://preshing.com/20110504/hash-collision-probabilities/
Get a short random identifier
Get a short random identifier
def get_short_identifier():
    """Get a short random identifier

    The identifier is chosen from a 64 bit key space, which is suitably
    large for no likely collisions in 1000 concurrent keys but kept
    small to minimize key length. 1000 is an arbitrary number chosen as
    an upper bound of the number of attachments associated with any
    given object. We may need to change this if we ever expect an object
    to have significantly more than 1000 attachments. The probability of
    a collision with a 64 bit ID is:

    k = 1000
    N = 2 ** 64
    (k ** 2) / (2 * N) = 2.7e-14

    which is somewhere near the probability of a meteor landing on
    your house. For most objects the number of blobs present at any
    moment in time will be far lower, and therefore the probability
    of a collision will be much lower as well.

    http://preshing.com/20110504/hash-collision-probabilities/
    """
    return random_url_id(8)
def get_short_identifier ( ) : return random_url_id ( 8 )