Superpermutation Almanac

n = 8

W-0022

A superpermutation on 8 symbols, found by rumstd. It beat the previous record, W-0015, by 14 letters, and was the record for n = 8 on Sep 28, 2026, when W-0023 was 2 letters shorter.

Length
46,190
Repeated occurrences
40
Announced
Sep 28, 2026
Begins 012345670123456071234560172345601273456012374560123475601234576012345067123450617234506127345061237450612347506123457061…

Windows

46,183windows of 8 consecutive letters
=40,320distinct permutations, all 8! of them
+40repeated occurrences of a permutation
+5,823windows that are not permutations

How it was found

rumstd's first n = 8 word, the first file in his repository; no public source says how it was found.

Checking

ProgramSourceResultTime
permcheckc46d3654all 40,320 permutations appearunder 1 s
literal_checkf4687121agrees on coverageunder 1 s
SHA-25643ab9ff44451fcea8002f1963324c9a15f0fda90786dcea83ea83aee0460ff29 Compilerg++ (Debian 14.2.0-19) 14.2.0

Download

Download Detour (.detour) 224 bytes, or 46.2 kB decoded

Download text (.txt) 46.2 kB

Decode to text

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

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 = 8 and sync exponent 0. The file has 677 tokens: 1 START, 1 literal of 1 byte in all, and 675 deviations. Deviations by weight, from 1 to 8: 40 · 160 · 455 · 3 · 16 · 1 · 0 · 0.