TIS-100 Bench: Decimal To Octal Converter

NEXUS.18.427.7 Medium Arithmetic construction Memory & interpreters Built-in puzzle · TIS-100 Bench report →

Convert a decimal value to its octal notation. Repeated base-8 decomposition must be reassembled into the output representation.

In TIS-100 Bench, 16 LLMs each had one attempt at this TIS-100 puzzle, with 30 minutes to find a working program and keep improving it, without seeing the community leaderboard. 16 of 16 models solved it. Together they found 7 new Pareto-frontier points beyond the community leaderboard.

16 / 16models solved it
171best LLM cycles (136 community)
7new frontier points

Records

ScoreCommunity bestBest LLMModel
Cycles136171Opus 5.5 · +26%
Nodes44DeepSeek V4.1 Flash Ties record
Instructions1213DeepSeek V4.1 Flash · +8%

Community records from the community leaderboard when we froze it. A record counts only after fresh-game replay and 100,000 passing random tests.

Pareto frontier

Pareto explorer

Lower is better ↙
Loading interactive Pareto explorer…
Community leaderboardModel frontier pointNew frontier point
Select a point with the mouse or keyboard to inspect its scores and program.

Search over time

Loading puzzle trajectories…

Every model

ModelSolvedBest cyclesBest nodesBest instructionsNew frontier points
01GPT-6 AstraYes1804134
02Fable 5.1Yes1954133
03GPT-6.1 SolYes2534142
04Muse Wonder 1.0Yes2674131
05Sonnet 5.5Yes3254131
06Opus 5.5Yes171413—
07Gemini 4 ArgonYes173413—
08Muse Spark 1.3Yes231413—
09Kimi K3.1 ProYes272413—
10GLM-5.3Yes303413—
11Gemini 3.8 FlashYes304413—
12DeepSeek V4.1 FlashYes320413—
13Grok 4.7Yes354413—
14MiMo-V2.6-ProYes362413—
15Haiku 5.5Yes489414—
16GPT-6 LunaYes582417—

Best scores can come from different programs. New frontier points are not matched or beaten on all three scores by any community program.

Best model programs

These programs are in TIS-100 save format and released under the MIT License. All of this puzzle’s model programs are on GitHub and Hugging Face.

Opus 5.5 Fewest cycles

171 cycles · 10 nodes · 70 instructionsNEXUS.18.427.7.171-10-70.txt on GitHub

Opus 5.5 program running on NEXUS.18.427.7 in TIS-100
Node 0
MOV RIGHT ACC
SUB 15
JGZ P
ADD 8
JGZ G
SUB 2
G: SUB 60
P: MOV ACC DOWN
Node 1
MOV UP LEFT
MOV UP RIGHT
Node 2
MOV LEFT ACC
SUB 15
JGZ P
ADD 8
JGZ G
SUB 2
G: SUB 60
P: MOV ACC DOWN
Node 4
MOV UP ACC
JLZ P
SUB 16
JGZ P
ADD 8
JGZ G
SUB 2
G: SUB 40
P: MOV ACC RIGHT
Node 5
MOV LEFT ACC
JLZ P
SUB 16
JGZ P
ADD 8
JGZ G
SUB 2
G: SUB 20
P: MOV ACC DOWN
Node 6
MOV UP ACC
JLZ P
SUB 16
JGZ P
ADD 8
JGZ G
SUB 2
G: SUB 40
P: MOV ACC RIGHT
Node 7
MOV LEFT ACC
JLZ P
SUB 16
JGZ P
ADD 8
JGZ G
SUB 2
G: SUB 20
P: MOV ACC DOWN
Node 8
MOV UP ACC
JLZ P
SUB 8
JGZ P
SUB 2
P: ADD 69
MOV ACC RIGHT
Node 9
MOV LEFT DOWN
MOV RIGHT DOWN
Node 10
MOV UP ACC
JLZ P
SUB 8
JGZ P
SUB 2
P: ADD 69
MOV ACC LEFT

Muse Wonder 1.0 Fewest nodes

304 cycles · 4 nodes · 33 instructionsNEXUS.18.427.7.304-4-33.txt on GitHub

Muse Wonder 1.0 program running on NEXUS.18.427.7 in TIS-100
Node 1
MOV UP, ACC
SUB 16
JLZ F
ADD 12
JMP O
F: ADD 8
JLZ O
ADD 2
O: MOV ACC, DOWN
Node 5
MOV UP, ACC
SUB 28
JLZ F
ADD 12
JMP O
F: ADD 8
JLZ O
ADD 2
O: MOV ACC, DOWN
Node 8
MOV UP, ACC
SUB 28
JLZ F
ADD 12
JMP O
F: ADD 8
JLZ O
ADD 2
O: MOV ACC, RIGHT
Node 9
MOV LEFT, ACC
SUB 20
JLZ F
ADD 2
F: ADD 68
MOV ACC, DOWN

GPT-6 Astra Fewest instructions

884 cycles · 4 nodes · 13 instructionsNEXUS.18.427.7.884-4-13.txt on GitHub

GPT-6 Astra program running on NEXUS.18.427.7 in TIS-100
Node 1
MOV 64 ACC
SUB UP
L: SUB 8
MOV 10 DOWN
JGZ L
SUB 100
MOV ACC DOWN
Node 5
MOV -20 ACC
L: SUB UP
JLZ L
MOV ACC DOWN
Node 8
MOV UP RIGHT
Node 9
MOV LEFT DOWN