TIS-100 Bench / Puzzles / Sequence Gap Interpolator
TIS-100 Bench: Sequence Gap Interpolator
NEXUS.17.135.0 Hard Sequence algorithms Arithmetic construction Built-in puzzle ·
Find the missing value in an unordered sequence of otherwise consecutive integers. A summary of the sequence can replace sorting it.
In TIS-100 puzzle, with 45 minutes to find a working program and keep improving it, without seeing the community leaderboard . 13 of 16 models solved it. Together they found 2 new Pareto-frontier points beyond the community leaderboard.
13 / 16 models solved it
293 best LLM cycles (105 community)
2 new frontier points
Records
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…
Select a point with the mouse or keyboard to inspect its scores and program.
Sequence Gap Interpolator: cycles against instructions for the community frontier and each model’s frontier points 95 243 625 1,607 4,133 18 26 39 56 82 Cycles (log scale) Instructions GPT-6.1 Sol: 659 cycles, 3 nodes, 32 instructions GPT-6.1 Sol: 581 cycles, 3 nodes, 37 instructions GPT-6.1 Sol: 549 cycles, 4 nodes, 35 instructions GPT-6.1 Sol: 471 cycles, 4 nodes, 40 instructions GPT-6.1 Sol: 444 cycles, 4 nodes, 47 instructions GPT-6.1 Sol: 658 cycles, 3 nodes, 34 instructions GPT-6.1 Sol: 580 cycles, 3 nodes, 39 instructions GPT-6.1 Sol: 293 cycles, 5 nodes, 45 instructions GPT-6.1 Sol: 306 cycles, 5 nodes, 34 instructions Opus 5.5: 316 cycles, 5 nodes, 37 instructions Opus 5.5: 319 cycles, 5 nodes, 35 instructions Opus 5.5: 496 cycles, 3 nodes, 28 instructions Opus 5.5: 330 cycles, 5 nodes, 33 instructions Opus 5.5: 491 cycles, 4 nodes, 30 instructions Opus 5.5: 490 cycles, 4 nodes, 31 instructions Opus 5.5: 336 cycles, 5 nodes, 32 instructions Opus 5.5: 342 cycles, 5 nodes, 31 instructions Opus 5.5: 475 cycles, 4 nodes, 32 instructions Fable 5.1: 340 cycles, 5 nodes, 33 instructions Fable 5.1: 356 cycles, 5 nodes, 32 instructions GPT-6 Astra: 515 cycles, 5 nodes, 46 instructions GPT-6 Astra: 714 cycles, 4 nodes, 38 instructions GPT-6 Astra: 539 cycles, 5 nodes, 45 instructions GPT-6 Astra: 748 cycles, 3 nodes, 40 instructions GPT-6 Astra: 726 cycles, 3 nodes, 43 instructions GPT-6 Astra: 620 cycles, 4 nodes, 41 instructions GPT-6 Astra: 415 cycles, 5 nodes, 47 instructions GPT-6 Astra: 411 cycles, 5 nodes, 48 instructions GPT-6 Astra: 3,757 cycles, 3 nodes, 31 instructions GPT-6 Astra: 3,740 cycles, 3 nodes, 32 instructions GPT-6 Astra: 400 cycles, 6 nodes, 49 instructions GPT-6 Astra: 394 cycles, 6 nodes, 50 instructions Muse Wonder 1.0: 456 cycles, 5 nodes, 61 instructions Muse Wonder 1.0: 451 cycles, 5 nodes, 64 instructions Muse Wonder 1.0: 458 cycles, 5 nodes, 60 instructions Gemini 4 Argon: 921 cycles, 4 nodes, 44 instructions Gemini 4 Argon: 553 cycles, 5 nodes, 46 instructions Gemini 4 Argon: 708 cycles, 4 nodes, 45 instructions Gemini 4 Argon: 496 cycles, 6 nodes, 50 instructions DeepSeek V4.1 Flash: 517 cycles, 6 nodes, 68 instructions gpt-6-luna: 525 cycles, 6 nodes, 64 instructions Kimi K3.1 Pro: 537 cycles, 7 nodes, 75 instructions Kimi K3.1 Pro: 814 cycles, 6 nodes, 72 instructions Haiku 5.5: 546 cycles, 6 nodes, 62 instructions Gemini 3.8 Flash: 596 cycles, 6 nodes, 64 instructions Gemini 3.8 Flash: 605 cycles, 6 nodes, 60 instructions Gemini 3.8 Flash: 596 cycles, 7 nodes, 60 instructions Gemini 3.8 Flash: 583 cycles, 7 nodes, 67 instructions Gemini 3.8 Flash: 592 cycles, 6 nodes, 67 instructions Gemini 3.8 Flash: 623 cycles, 5 nodes, 66 instructions Gemini 3.8 Flash: 610 cycles, 5 nodes, 73 instructions GLM-5.3: 878 cycles, 5 nodes, 58 instructions GLM-5.3: 628 cycles, 6 nodes, 63 instructions Sonnet 5.5: 747 cycles, 5 nodes, 35 instructions GPT-6.1 Sol: 318 cycles, 5 nodes, 33 instructions (new frontier point) GPT-6.1 Sol: 296 cycles, 5 nodes, 39 instructions (new frontier point) Community leaderboard Nodes are not shown; lower is better on both axes.
Search over time
Loading puzzle trajectories…
Puzzle MetricBest cycles Fewest nodes Fewest instructions In-game record proximity Program runs
Compare models
Top four overall All models Clear
Inspect time 0:00
Best in-game score so far, before independent testing. Each score can come from a different program, and lines stop when the episode ends.
Every model
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 .
GPT-6.1 Sol Fewest cycles 293 cycles · 5 nodes · 45 instructions NEXUS.17.135.0.293-5-45.txt on GitHub
Node 0 S:MOV RIGHT ACC
MOV RIGHT NIL
L:SAV
SUB RIGHT
JGZ U
ADD RIGHT
JMP L
U:MOV RIGHT ACC
JNZ L
SWP
MOV ACC DOWNNode 1 MOV UP ACC
MOV ACC LEFT
MOV ACC LEFT
MOV ACC DOWNNode 3 S:MOV 0 RIGHT
L:MOV UP ACC
JEZ E
NEG
ADD RIGHT
MOV ACC RIGHT
JMP L
E:MOV RIGHT DOWNNode 4 S:MOV UP ACC
MOV ACC RIGHT
ADD 1
MOV ACC RIGHT
ADD 1
L:MOV ACC RIGHT
ADD 1
MOV ACC RIGHT
ADD RIGHT
JGZ LNode 5 MOV UP ACC
ADD LEFT
ADD LEFT
L:ADD LEFT
JGZ A
ADD LEFT
JGZ B
MOV 1 LEFT
JMP L
A:MOV LEFT NIL
B:MOV -999 LEFT
MOV ACC DOWNOpus 5.5 Fewest nodes Fewest instructions 496 cycles · 3 nodes · 28 instructions NEXUS.17.135.0.496-3-28.txt on GitHub
Node 1 MOV UP ACC
MOV ACC DOWN
MOV ACC DOWNNode 3 MOV 999 ACC
JMP L
K: SWP
MOV UP DOWN
L: SAV
SUB UP
JLZ K
MOV UP ACC
MOV ACC DOWN
JNZ L
MOV -999 DOWN
SWP
G: MOV ACC DOWN
ADD 1
JRO DOWNNode 5 L: SUB UP
JLZ L
SUB 999
ADD UP
L2: MOV -2 UP
ADD UP
JLZ L2
MOV -99 UP
MOV ACC DOWN
MOV 0 ACC← Dynamic Pattern Detector All puzzles Decimal To Octal Converter →
TIS-100 Bench report →
