We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.

User:Raiseafloppafan7741/Draft III

From Esolang
Jump to navigation Jump to search
This is still a work in progress. It may be changed in the future.

脳死 [noushi; brain death] is a brainfuck variant by user:raiseafloppafan7741 in 2026 for code golfing. It uses Latin, Greek, Cyrillic, kana, Hangul, Hanzi/kanji, cuneiform, and emojis for compressing as much brainfuck commands into as few bytes as possible.

Instructions

Below are all of the mappings from 脳死 to brainfuck, separated by writing script.

Latin

Decimal Character brainfuck sequence
36 $ .,
43 + It's what you expect.
44 , It's what you expect.
45 - It's what you expect.
46 . It's what you expect.
60 < It's what you expect.
62 > It's what you expect.
65 A 48x +
68 D 48x -
91 [ It's what you expect. However if it is left unbalanced like this (,[.,) it is implicitly closed.
93 ] It's what you expect.
97 a >[-<+>]
99 c [-]
115 s >[-<->]

Greek

Letter brainfuck sequence
Α Add two adjacent 64-bit unsigned integers starting from the first one
Β Print a 64-bit unsigned integer
ϸ Read two adjacent 64-bit integers and place the pointer at the first one

Cyrillic

Kana

Hangul

Hanzi/kanji

Since Hanzi/kanji are encoded with 3-4 bytes but are very abundant, they are reserved for packing many operations into a single instruction. Think of them like SIMD.

Character brainfuck sequence
Read unlimited 64-bit unsigned integers and add them

Cuneiform

Since cuneiform characters take 4 byte to encode in UTF-8, they are reserved for long instruction sequences.

Emojis

Since emojis usually take 4 bytes if not longer due to modifiers, they are reserved for absolutely insane instruction fusions where losing 8-15 bytes is worth it to perform what would normally take tens of commands.

Codepoint(s) Emoji brainfuck sequence
U+2757 64-bit unsigned Fibonacci

Misc

Codepoint Character brainfuck sequence
U+21E6 Move left 8 cells
U+21F6 64-bit copy to adjacent right
U+230A 64-bit [
U+230B 64-bit ]

Examples

Cat program

,[$

A+B problem

This can only perform 1-digit addition. However, it mogs the 31-byte single-digit adder at A+B Problem/brainfuck with 9 bytes.

,D>,D<aA.

This one can perform 64-bit unsigned addition. This one absolutely mogs the brainfuck competition at 6 bytes.

ϸΑΒ

This one can add unlimited 64-bit unsigned integers. This one ABSOLUTELY MOGS THE HELL OUT OF THE COMPETITION at 5 bytes.

内Β

Fibonacci sequence

64-bit integers, 15 bytes. Absolutely mogs brainfuck.

+⌊⇶❗Β⇦

See also