Baconian Cipher
Learn the 24-entry Baconian alphabet from the binary system itself, then decode five-symbol groups without needing another reference.
What is the Baconian Cipher?
The Baconian cipher represents each plaintext letter with five positions that can each be in one of two states. We normally call those states A and B. That makes the system behave like five-bit binary: A acts like 0 and B acts like 1.
In a puzzle, those two states might appear as A/B, 0/1, two fonts, two shapes, two colors, or any other pair of distinguishable symbol classes. The surface appearance can change; the five binary choices underneath are what matter.
The Daily Cipher now uses a 24-entry Baconian alphabet for Science Olympiad-style practice: I and J share one code, and U and V share one code. That means there are 24 alphabet entries numbered 0 through 23. Exact tournament rules and supplied resource sheets still take precedence.
You do not need to know binary first. The next section shows exactly why AAAAA, AAAAB, AAABA, and the rest appear in that order.
What you need to know
- Each plaintext letter uses exactly five A/B positions.
- Treat A as binary 0 and B as binary 1.
- From left to right, the five positions have place values 16, 8, 4, 2, 1.
- The 24-entry alphabet combines I/J and U/V, so five-bit values 24 through 31 are not assigned new letters.
Binary before Baconian
Binary counting works like decimal counting, except each place can only be 0 or 1. The rightmost place changes every count. When it goes from 1 back to 0, it carries one into the place to its left.
| Position | 1st | 2nd | 3rd | 4th | 5th |
|---|---|---|---|---|---|
| Binary weight | 16 | 8 | 4 | 2 | 1 |
| Baconian state | A=0 / B=1 | A=0 / B=1 | A=0 / B=1 | A=0 / B=1 | A=0 / B=1 |
So decimal 2 is binary 00010. Replace 0 with A and 1 with B and you get AAABA, which is C because C is entry 2.
Beginner glossary
| Term | Meaning |
|---|---|
| Biliteral | Using two distinguishable forms or symbol classes. |
| Bit | One binary position that can be 0 or 1; in Baconian it becomes A or B. |
| Carry | When a 1 rolls back to 0 and advances the binary position to its left. |
| A/B pattern | A five-position sequence such as AAABA. |
| Shared entry | One Baconian pattern representing either I/J or either U/V. |
| Group boundary | The division after every five symbols. Losing it shifts every later decode. |
Baconian cipher table and 24-letter alphabet
This is the table used by The Daily Cipher's Baconian engine and practice generator.
| Letter(s) | A/B pattern | Binary | Value |
|---|---|---|---|
| A | AAAAA | 00000 | 0 |
| B | AAAAB | 00001 | 1 |
| C | AAABA | 00010 | 2 |
| D | AAABB | 00011 | 3 |
| E | AABAA | 00100 | 4 |
| F | AABAB | 00101 | 5 |
| G | AABBA | 00110 | 6 |
| H | AABBB | 00111 | 7 |
| I/J | ABAAA | 01000 | 8 |
| K | ABAAB | 01001 | 9 |
| L | ABABA | 01010 | 10 |
| M | ABABB | 01011 | 11 |
| N | ABBAA | 01100 | 12 |
| O | ABBAB | 01101 | 13 |
| P | ABBBA | 01110 | 14 |
| Q | ABBBB | 01111 | 15 |
| R | BAAAA | 10000 | 16 |
| S | BAAAB | 10001 | 17 |
| T | BAABA | 10010 | 18 |
| U/V | BAABB | 10011 | 19 |
| W | BABAA | 10100 | 20 |
| X | BABAB | 10101 | 21 |
| Y | BABBA | 10110 | 22 |
| Z | BABBB | 10111 | 23 |
ABAAA. U and V both use BAABB. When decoding, language context tells you which letter was intended.How the table is generated
Start at value 0 and count upward in five-bit binary. Convert every 0 to A and every 1 to B. Because the alphabet has 24 entries, the used values stop at 23: 10111 = BABBB = Z. The binary states 24–31 still exist mathematically, but they do not create extra Baconian letters in this convention.
How encryption works
Normalize shared letters
For lookup purposes, treat J like I and V like U. You still keep the intended plaintext spelling as the answer.
Find the 24-entry index
Example: K comes after the shared I/J entry, so K is value 9, not value 10.
Convert the value to five-bit binary
9 = 01001.
Convert 0→A and 1→B
01001 becomes ABAAB, so K = ABAAB.
Apply any disguised symbol classes
If the problem uses ● for A and ○ for B, ABAAB becomes ●○●●○.
How to decode a Baconian cipher
Identify the two classes
Decide which visual state means A and which means B.
Normalize to A/B
Convert fonts, shapes, digits, or other paired symbols into one A/B stream.
Split into groups of five
One missing or extra symbol shifts every group after it.
Look up each group
ABAAA → I/J and BAABB → U/V. Other valid groups map to one letter.
Resolve shared letters from context
If the decoded pattern is U/V I/J U/V I/J D, normal English context can reveal VIVID.
How to approach Baconian in Codebusters practice
- Write I/J and U/V together on your reference so you never accidentally use a 26-letter offset.
- Identify the two symbol classes before decoding; if the result is nonsense, check whether A and B were reversed.
- Mark boundaries every five symbols before doing table lookups.
- When a shared code appears, leave it as I/J or U/V until the surrounding word makes the choice clear.
What the problem gives you vs. what you produce
| Part | What to expect |
|---|---|
| You may be given | A/B directly, or two fonts/symbols/glyph classes hiding A/B. |
| You must find | The intended plaintext by grouping in fives and decoding with the 24-entry table. |
| Fastest first move | Label the two states A/B and draw separators every five positions. |
| Shared-letter rule | ABAAA = I/J and BAABB = U/V; context resolves the final spelling. |
How to attack an unknown presentation
- Look for exactly two recurring visual states. The puzzle can hide them in typography or symbols, but the underlying system is still binary.
- If you are unsure which state is A, try both assignments. Only one should produce sensible language.
- If spacing is missing, preserve groups of five from the intended start point.
- Remember that I/J and U/V are genuine ambiguities in the 24-entry table; do not treat them as evidence that your decode failed.
Worked example with both shared entries
BAABB ABAAA BAABB ABAAA AAABBVIVIDBefore moving on, make sure you can answer these without another site:
- Why do I and J produce the same code?
- Why is K value 9 instead of 10?
- What happens mechanically when binary 00111 advances to 01000?
- Why can a solver still recover VIVID even though U/V and I/J share codes?
Common mistakes
Using a 26-letter A–Z table. That shifts K and later letters because J does not receive its own entry.
Giving V a separate pattern instead of sharing U/V at BAABB.
Reversing which symbol class means A and which means B.
Losing one symbol and shifting every later five-symbol boundary.
Competition speed strategies
Think binary instead of memorizing 24 arbitrary strings: A=0, B=1, weights 16-8-4-2-1.
Memorize the two merged anchors: I/J = ABAAA and U/V = BAABB.
Mark a separator after every five symbols before decoding a long stream.
What to remember under time pressure
Baconian decoder and binary visualizer
The Baconian visualizer now includes a five-panel mechanical-style binary counter. Press +1 / advance and watch the rightmost bit flip. Whenever a 1 rolls over to 0, the carry moves left—exactly the behavior that produces the sequence AAAAA, AAAAB, AAABA, AAABB, and so on.