Superpermutation Almanac

n = 5

W-0004

A superpermutation on 5 symbols, found by Daniel A. Ashlock and Jenett Tillotson. It was the first record for n = 5, and is still the record.

Length
153
Repeated occurrences
0
Announced
1993
Begins 012340123041230142301243012034120314203124031204312013420132401320413201432010234102314023104231024310213402130421302413…

Windows

149windows of 5 consecutive letters
=120distinct permutations, all 5! of them
+0repeated occurrences of a permutation
+29windows that are not permutations

How it was found

The recursive-construction word on 5 symbols.

Checking

ProgramSourceResultTime
permcheckc46d3654all 120 permutations appearunder 1 s
literal_checkf4687121agrees on coverageunder 1 s
SHA-2564c8f0e474f7d91297fc9fa94140219f371f2c9d2689d495062ea206b98b5e4e6 Compilerg++ (Debian 14.2.0-19) 14.2.0

Download

Download Detour (.detour) 124 bytes, or 153 bytes decoded

Download text (.txt) 153 bytes

Decode to text

# check it yourself
detour decode W-0004.detour - | tr -d '\n' | shasum -a 256
tar xzf checkers-rs-source.tar.gz && cd checkers-rs && cargo build --release --locked
./target/release/classcheck 5 ../W-0004.detour 153
./target/release/bitmapcheck 5 ../W-0004.detour 153
./target/release/wordhash 5 ../W-0004.detour 153

Decoding needs detour; see the Detour format for how to build and install it. The checkers are in checkers-rs-source.tar.gz, which needs Rust 1.89 or later; each one decodes the file itself, so the word is never written out.

The file's header gives n = 5 and sync exponent 0. The file has 2 tokens: 1 START, 1 literal of 1 byte in all, and 0 deviations. Deviations by weight, from 1 to 5: 0 · 0 · 0 · 0 · 0.