MINMAX ARENA
中/EN
P08 · Combinatorial optimization

Shortest addition chain

Starting from 1, build an increasing sequence where each new value sums two earlier values, reaching the target in as few steps as possible.

Instancetarget = 125
ObjectiveMinimize steps
Requirements
  • The chain starts at 1 and strictly increases
  • Each value sums two earlier entries
  • The final value equals the target
Challenge this record ↗
CURRENT LEADERLive answer visualization
11 steps
VERIFIED CONSTRUCTIONtarget 125
Current leader

11

steps

Record holderFounding benchmark
Solution methodHuman only
Challenge this record ↗
Submission format and technical detailsOpen this when you are ready to prepare a JSON certificate＋

Instance parameters

{
  "target": 125
}

Current leader certificate

{
  "chain": [
    1,
    2,
    4,
    8,
    16,
    32,
    64,
    96,
    112,
    120,
    124,
    125
  ]
}

Submit chain; the score is the array length minus one. · Verifier v1.0.0