Skip to content
Lizely

Cryptogram

Decode an original 49-letter monoalphabetic substitution fixture with atomic one-to-one mappings, accessible controls, and a fully audited inverse key.

Privacy: your files never leave your device. All processing happens locally in your browser.

How to use

  1. 1.Select a cipher letter in the encrypted phrase or mapping grid, then assign a plaintext guess with the on-screen alphabet or your keyboard.
  2. 2.Use repeated symbols, word shapes, and the decoded preview while keeping every plaintext letter assigned to at most one cipher letter.
  3. 3.Map all 20 used cipher letters, correct any conflict with Clear mapping, then choose Check mapping or press Enter for exactly 1,000 points.

About Cryptogram

Cryptogram Puzzle presents one deterministic monoalphabetic substitution challenge built from original Lizely text. The encrypted sentence is SGUOE UKGVL VITF TCTKN HQZZTKF TQKFL Q EQKTYXS LTEGFR SGGA. Select a ciphertext letter, assign the plaintext letter you believe it represents, and watch every occurrence update in the decoded preview. Complete all 20 mappings used by the phrase, then choose Check mapping. An exact decode awards 1,000 points.

The phrase behind the puzzle was written for this game: LOGIC GROWS WHEN EVERY PATTERN EARNS A CAREFUL SECOND LOOK. It is not a quotation, proverb, lyric, book excerpt, or attributed saying. That provenance matters because the fixture can be disclosed, tested, and reused without implying an outside author or depending on a copyrighted puzzle collection. The sentence contains 49 letter positions plus nine spaces, for 58 characters in total.

This game's substitution contract is explicit. Start with plaintext alphabet ABCDEFGHIJKLMNOPQRSTUVWXYZ. At the same positions, the fixed ciphertext key is QWERTYUIOPASDFGHJKLZXCVBNM. Plaintext A becomes cipher Q, B becomes W, C becomes E, and the same positional rule continues through plaintext Z becoming cipher M. Every key character is an uppercase A-through-Z letter, and all 26 key characters are unique, so the relationship is a complete bijection.

Players work in the inverse direction. If the ciphertext displays E, the task is to determine which plaintext letter produced E. A mapping applies to every E in the sentence, not just one tile. Because the key is one-to-one, two different ciphertext letters cannot both map to the same plaintext letter. The state transition checks that constraint before making any change. A conflicting choice leaves the complete mapping object untouched and displays a clear explanation.

An independent oracle derives the ciphertext without calling the production encoder. It walks through the original plaintext one character at a time, looks up each letter's index in the ordinary alphabet, takes the character at that index from the disclosed key, and preserves spaces. The resulting string exactly matches the published ciphertext. A second pass inverts all 26 key positions and verifies every one of the 49 encoded letter positions against its original plaintext character.

Only 20 distinct plaintext letters occur in this sentence, so exactly 20 distinct ciphertext letters appear. The interface lists those used cipher letters in sorted order and does not demand six irrelevant mappings that never occur in the puzzle. The independent frequency table also supplies a reproducible solving clue: cipher T occurs seven times, more than any other encrypted letter in this fixture. Frequency is a hint, not a guarantee about what T means.

Repeated word shapes offer additional clues. The first and last words begin with the same two cipher letters, and repeated ciphertext symbols must decode consistently. One-letter word Q can represent only the same plaintext letter everywhere Q appears. The preview uses underscores for unmapped letters while preserving word spaces, so patterns become visible without revealing the answer. Selecting any occurrence in the ciphertext selects its shared mapping card.

Pointer interaction is complete. Tap a ciphertext occurrence or one of the 20 mapping cards, then choose a plaintext letter from the on-screen A-through-Z keyboard. The plaintext buttons remain available even when a letter is already used because attempting that choice produces an explicit atomic conflict message; it never silently steals the letter from another cipher mapping. Clear mapping removes only the currently selected cipher letter's guess.

Keyboard interaction mirrors every essential action. Left and Right move through adjacent mapping cards. Up and Down move by four positions to match the compact mobile grid. Type any letter A through Z to assign it to the selected cipher symbol. Backspace or Delete clears the selected mapping, and Enter checks the puzzle. Repeated keydown events are ignored, preventing a held letter or Enter key from causing rapid unintended assignments or submissions.

Checking distinguishes incomplete work from completed attempts. If any of the 20 used cipher letters remains unmapped, Check mapping reports an incomplete puzzle and adds no mistake. A complete one-to-one mapping that does not decode the original sentence is a full wrong attempt. The first distinct wrong mapping records one mistake but remains editable, so you can clear or replace guesses and continue solving.

The game serializes each fully populated mapping in stable sorted cipher order. Rechecking the exact same wrong mapping does not add another mistake. Only a different complete wrong signature counts as the second error and deadlocks the run. This prevents an accidental double-click from consuming both opportunities while enforcing a genuine two-distinct-error limit. One-to-one conflict attempts do not count as checks or mistakes.

Completion and deadlock freeze mapping selection, letter assignment, clearing, cursor movement, and checks. Restart is the deliberate way to return to a blank mapping with the first used cipher letter selected, zero mistakes, and zero score. The correct full inverse mapping always awards exactly 1,000 points. There is no timing bonus, frequency bonus, partial credit, hint penalty, or random modifier.

The interface uses only existing site CSS token classes for surfaces, borders, foreground, muted text, accent, and danger feedback. It contains no hardcoded color value or downloaded visual asset. Mapping cards use large native buttons; the ciphertext wraps by whole words; the 20 cards use four columns on narrow screens; and the 26 plaintext controls use seven compact columns. The layout stays within a 390-pixel viewport without page-level horizontal overflow.

The shared game shell provides score, locally stored best score, Restart, and the double-Escape boss key. Press Escape twice within the shell timing window to cover the puzzle with the spreadsheet-style screen, then twice again to return. Everything runs in the browser. No phrase state, mapping guess, result, or interaction history is uploaded, and the game requires no account, package dependency, remote API, device permission, or paid service.

This fixed cryptogram is recreational language and pattern practice, not a standardized language, memory, intelligence, educational, or psychological assessment. The disclosed plaintext and key make the answer auditable and repeatable. A 1,000-point result means only that this one product-authored substitution was inverted correctly under the stated one-to-one rules.

Methodology & sources

Define an original uppercase plaintext and a product-authored 26-character permutation aligned positionally with A through Z. Independently encode every plaintext character from those two disclosed strings, preserve spaces, require the exact 58-character ciphertext, verify 26 unique key letters, count 49 encoded positions and 20 used symbols, derive a separate inverse dictionary, and check every decoded position. Expose only the 20 used cipher mappings to play. Normalize assignments to uppercase, reject an already-used plaintext letter before cloning state, and preserve mapping identity on conflict. Treat partial checks as incomplete, serialize full mappings in sorted cipher order, ignore a repeated wrong signature, leave the first distinct wrong mapping editable, deadlock on the second distinct one, award exactly 1,000 for the full oracle mapping, and freeze all gameplay input at either terminal state.

Frequently asked questions

Is the encrypted sentence a quotation?
No. Both the plaintext sentence and the fixed substitution are original Lizely puzzle content, fully disclosed for deterministic verification.
Why can two cipher letters not share one plaintext guess?
The disclosed substitution key is a bijection. Each ciphertext letter has one inverse plaintext letter, and every plaintext letter can belong to at most one cipher mapping.
Does checking an incomplete mapping count as a mistake?
No. All 20 used cipher letters must be mapped before a check can count as a completed attempt.
Can an unchanged wrong mapping consume both strikes?
No. Rechecking the same ordered mapping signature keeps the mistake count unchanged. Deadlock requires a second distinct complete wrong mapping.

Related tools

Mini Games guides

View all