0 chars · 0 letters
A known cipher→plain mapping. The solver never violates it.
Warming up the engine…
Top candidates
How it works
Pattern dictionary
Word patterns in the ciphertext are matched against a dictionary to seed high-quality starting keys.
Simulated annealing
Dozens of restarts explore key space, scored by a quantized quadgram plus word-bigram model.
Name gazetteer
A final rerank pass favors full celebrity names, then presents the best candidates.
The solver runs entirely in your browser via WebAssembly compiled from Rust. Your input is never normalized: curly quotes, em dashes, digits, casing, and whitespace pass through byte-for-byte.