About

Brainfuck operates on a tape of 30000 byte cells with only 8 commands: + - > < [ ] . ,. Encoding text naively produces extremely long output. A character like z (ASCII 122) would need 122 consecutive + operations. This tool applies loop-based multiplication and inter-character delta encoding to reduce output length by a factor of 5× to 10×. It computes the optimal loop base b such that b × k approximates each target ASCII value, then emits the minimal residual adjustment. Consecutive characters reuse the current cell value, encoding only the difference δ = c_i − c_i−1. The generator handles all printable ASCII (codes 32 - 126) and common control characters like newline (ASCII 10). Note: this tool approximates optimal Brainfuck. Truly minimal Brainfuck generation is NP-hard in the general case.

Formulas

The generator uses two encoding strategies per character and selects the shorter result.

Strategy 1 - Absolute Encoding: For a target ASCII value c, find the integer factor pair (a, b) where a × b ≈ c and a + b is minimized. The residual is:

r = c − (a × b)

Output: a repetitions of +, then the loop [> b repetitions of + <-]>, then |r| repetitions of + or -, then .

Strategy 2 - Delta Encoding: For consecutive characters c_i−1 and c_i, compute:

δ = c_i − c_i−1

If |δ| is small enough that |δ| + 1 (for the .) is shorter than the absolute encoding, emit |δ| repetitions of + or - followed by ..

Compression ratio:

R = L_bfL_text

Where L_bf is the length of the generated Brainfuck code and L_text is the length of the input text. Typical ratios range from 8 to 20 characters of Brainfuck per input character.

Reference Data

Character	ASCII Code	Naive Length	Optimized Length (approx.)	Brainfuck Pattern
A	65	67	~18	++++++++++[>++++++<-]>+++++.
Z	90	92	~18	++++++++++[>+++++++++<-]>.
a	97	99	~20	++++++++++[>++++++++++<-]>---.
z	122	124	~22	++++++++++[>++++++++++++<-]>++.
0	48	50	~16	+++++++[>+++++++<-]>-.
9	57	59	~18	++++++[>++++++++++<-]>---.
(space)	32	34	~14	++++++++[>++++<-]>.
!	33	35	~14	++++++++[>++++<-]>+.
\n (newline)	10	12	~10	++++++++++.
~	126	128	~22	++++++++++[>+++++++++++++<-]>-.
H	72	74	~18	+++++++++[>++++++++<-]>.
e	101	103	~20	++++++++++[>++++++++++<-]>+.
l	108	110	~20	+++++++++[>++++++++++++<-]>.
o	111	113	~20	++++++++++[>+++++++++++<-]>+.
W	87	89	~18	+++++++++[>++++++++++<-]>---.

Frequently Asked Questions

The algorithm exploits delta encoding between consecutive characters. Text with characters close in ASCII value (e.g., "abcd") produces shorter Brainfuck because each delta δ is small (1 - 3). Text with wildly varying characters (e.g., "aZaZ") forces frequent absolute encodings with loop constructs, increasing output length.

No. Standard Brainfuck cells are 8-bit (values 0 - 255). This generator targets printable ASCII (codes 10, 32 - 126). Characters outside this range are silently skipped. Unicode would require multi-byte encoding schemes not supported by standard Brainfuck interpreters.

No. Finding the globally optimal Brainfuck program is computationally intractable for non-trivial inputs. This generator uses a greedy heuristic: for each character, it compares absolute loop encoding against delta encoding and picks the shorter one. More advanced techniques (dynamic programming across multiple cells, copy loops) could yield shorter programs but at significantly higher computational cost.

The pattern +++[>++++<-]> sets cell 0 to 3, then loops: each iteration adds 4 to cell 1 and decrements cell 0. After 3 iterations, cell 1 holds 3 × 4 = 12. The generator finds the factor pair (a, b) that minimizes a + b + |r| where r = c − a × b.

The generator produces an empty Brainfuck program (zero instructions). This is valid Brainfuck that produces no output when executed.

Yes. The tool includes a built-in interpreter that executes the generated Brainfuck code and displays the output. You can confirm the output matches your original input text. The interpreter uses a tape of 30000 cells initialized to zero, with 8-bit wrapping arithmetic.