Daily Inspiration
Design excellence, every day.
Jury-selected work from the A' Design Award, presented fresh each morning.
Design your own random string format. Place code characters in the URL, get a fresh result every time.
LLL-DDDA pattern template is a string where each character is either a code that the tool replaces with a random value, or a literal that passes through unchanged. Four code characters cover every common need: L draws from the 26 uppercase English letters, l from the 26 lowercase letters, D from the 10 digits, and H from the 16 hexadecimal characters (0-9 plus a-f). Hyphens, underscores, and dots survive as separators. Everything else is excluded to keep patterns clean and URLs safe.
The total number of possible outputs is the product of each position's options. A single L gives 26 possibilities. Three in a row (LLL) give 26 × 26 × 26 = 17,576. Add -DDD and the total becomes 17,576 × 1,000 = 17,576,000 distinct strings. Each additional code character multiplies the space: one more L expands it by 26x, one more D by 10x. A 12-character all-letter pattern has 2612 ≈ 95 trillion possibilities. At one generation per second, exhausting every combination would take over three million years.
The entropy display in the statistics panel shows these combinatorics compressed into a single number: bits of randomness. Each bit doubles the possibility space. A 6-character numeric PIN (DDDDDD) has ~19.9 bits. A 12-character mixed pattern (LLLlllDDDDDD) has ~59.8 bits. For reference, a strong password typically requires at least 60 bits of entropy.
Patterns produce structured randomness. Serial numbers (LLL-DDDDDD), confirmation codes (LLDDLLDD), temporary access tokens (HHHHHHHH), test data for forms, placeholder license plates (LL-DDDD), version identifiers (D.D.D), mock MAC addresses (HH.HH.HH.HH.HH.HH). The template describes the shape. The browser fills each position independently from the Web Cryptography API. The result is copy-ready and structurally guaranteed to match your specification.
Pattern generation turns combinatorics from abstract multiplication into visible exploration. Have students visit /pattern/LD (one letter, one digit: 260 combinations) and generate ten results. Ask them to predict how many generations before a duplicate appears. Then try /pattern/LLD (6,760 combinations). The birthday problem becomes tangible: with 260 options, a duplicate typically appears within ~20 generations. With 6,760 options, it takes ~100+. Students experience the multiplicative growth directly.
Every character in every generated string originates from your browser's Web Cryptography API. The server delivers this page and is finished. Your generated strings, your history, and your generation count stay in your browser. The server stores nothing. Sharing the URL shares the pattern template, never any generated output. Each recipient's browser generates entirely independent results from their own device's entropy.
The template is the URL path itself:
Pick a preset or type your own template using L, l, D, H and separators (- _ .).
Send this link. They get the same template, their own random output.
Daily Inspiration
Jury-selected work from the A' Design Award, presented fresh each morning.
