Superpermutation Almanac

Back to n = 12

W-0096

A superpermutation on 12 symbols, found by William Echols. It beat the previous record W-0093 by 9 letters and was the record on Nov 9, 2026. The next record W-0097 beat it by 48 letters.

Length
522,736,492
Repeated permutations
177,373
Received
Nov 9, 202619:21:40 UTC
Begins 0123456789AB0123456789A0B123456789A01B23456789A012B3456789A0123B456789A01234B56789A012345B6789A0123456B789A01234567B89A0…

Windows

522,736,481windows of 12 consecutive letters
=479,001,600distinct permutations
+177,373repeated permutations
+43,557,508windows that are not permutations

Detours by weight

A step is the move from one permutation in the superpermutation to the next permutation in it, and its weight is the number of letters added in that move. A detour starts at a step that differs from the next step of the recursive construction, and ends at the first permutation after that whose next step has weight 1. The weight of a detour is the number of letters added in it. After each detour, we consider the recursive construction to begin again from scratch at the permutation where the detour ends.

WeightDetours
10
20
31,065,477
4456
5653
61,030
731
826
928
1027
114
120

How it was found

From the submitter

Starting from my 522,736,503 word (W-0091, built on Jakub Halfar's plan for his 522,736,969), I ran Jakub Halfar's unchanged kick.sh (short hot trailsearch runs, each followed by polish.sh, with the loop step raised from 40 to 1,000 rounds) with Claude Opus 5.5 in Claude Code.

Download

Learn about the Detour file format

Download Detour (.detour) 42.1 kB, or 522.7 MB decoded