Home > Backend Development > Golang > tnfy.link - What&#s about ID?

tnfy.link - What&#s about ID?

Patricia Arquette
Release: 2025-01-14 10:48:43
Original
447 people have browsed it

tnfy.link - What

Hello everyone!

This is the second installment in my tnfy.link series – a deep dive into yet another URL shortener! This post focuses on the intricacies of short link generation. While seemingly simple, selecting the optimal method presents unique challenges.

Essentially, generating a short link involves creating a concise, unique identifier for each long URL. This ID must satisfy several criteria:

  • Uniqueness: Avoids conflicts.
  • Brevity: Practical for usage.
  • Ease of Typing: Minimizes errors.
  • Unpredictability: Prevents guessing.

After thorough investigation, I've identified four primary methods for short link creation. Let's examine them in detail.


1. The Random Bytes Approach

The most straightforward method utilizes random byte generation and subsequent encoding. However, it's crucial to differentiate between pseudo-random and cryptographically secure random number generation.

Pseudo-Random Numbers

Go's math/rand package offers a pseudo-random number generator (PRNG). Using the same seed (initial value) consistently produces the same number sequence. While adequate for many applications, it's unsuitable for secure or unpredictable link generation.

Cryptographically Secure Random Numbers

For enhanced security, the crypto/rand package is preferable. It leverages system noise to generate truly random and unpredictable values – think electromagnetic noise. This guarantees high entropy, but virtual machines relying on their host for random data might experience slower generation under heavy load.

Encoding Random Bytes

Raw random bytes aren't URL-friendly; encoding is necessary. Common encoding techniques include:

  1. Integer: Converts bytes to an integer. Easy to type but potentially results in longer IDs.
  2. HEX: Hexadecimal encoding (0-9, A-F). Case-insensitive and typo-tolerant.
  3. Base64: Employs A-Z, a-z, 0-9, , /, and =. However, it's case-sensitive and error-prone.
  4. Base58: Similar to Base64, but omits confusing characters (e.g., I, l, O, 0). This improves user-friendliness. Bitcoin, Ripple, and Flickr utilize Base58.

For user-friendly short links, Base58 offers an optimal balance of compactness and error resistance.

Key Points:

  • Random bytes are inherently unique and unpredictable.
  • Encodings like Base58 enhance usability.
  • Cryptographically secure randomness ensures reliability.

2. The Hashing Approach

Hashing generates a fixed-length value from input (e.g., the long URL). While guaranteeing consistency (identical input always yields the same output), it lacks randomness. Consequently, shortening the same URL repeatedly produces identical IDs, failing the unpredictability requirement.

Adding a random salt before hashing introduces variability, but using raw random bytes becomes simpler and more efficient.


3. The UUID Approach

Universally Unique Identifiers (UUIDs) are widely used for unique value generation. Their default format is too long for short links, but re-encoding (e.g., in Base58) reduces size.

NanoID, an alternative, generates shorter strings (21 characters by default) using a customizable alphabet, optimizing for readability and error resistance.

Why Avoid UUIDs?

UUIDs fundamentally rely on random bytes, offering no significant advantage over directly generating random values.


4. The Sequential Approach

Random value generation can occasionally lead to duplicates, particularly under high load or with shorter IDs. While tnfy.link isn't designed for high-load scenarios, potential issues warrant consideration.

A sequential counter inherently guarantees uniqueness. Redis, using the INCR command, enables distributed counter implementation. However, sequential IDs are predictable. Combining a sequence with random bytes resolves this, ensuring both uniqueness and unpredictability.

For instance:

  • Random Value Incrementing Sequence: If two instances generate the same random value, the sequence ensures uniqueness.

Note: A sequential component might reveal the total number of links generated, potentially undesirable in some contexts.


Conclusion

This post explored various short link generation methods:

  • Random bytes: Simple and effective, particularly with secure encodings like Base58.
  • Hashing: Reliable but lacks randomness for this application.
  • UUID/NanoID: Good alternatives but add unnecessary complexity compared to raw random bytes.
  • Sequence: Resolves collisions but increases ID length.

For most applications, Base58-encoded random bytes are sufficient. For high-load collision handling, combining random bytes with a sequential component is robust. While not yet implemented in tnfy.link's backend, it's planned as a future optional feature.

Thank you for reading! Your feedback on link generation is welcome in the comments!


Related Post

For more on my projects, see my article on SMS Gateway for Android.

The above is the detailed content of tnfy.link - What&#s about ID?. For more information, please follow other related articles on the PHP Chinese website!

source:php.cn
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Latest Articles by Author
Popular Tutorials
More>
Latest Downloads
More>
Web Effects
Website Source Code
Website Materials
Front End Template