Superpermutation Almanac

Back to n = 12

W-0097

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

Length
522,736,444
Repeated permutations
177,386
Received
Nov 9, 202619:23:59 UTC
Begins 0123456789AB0123456789A0B123456789A01B23456789A012B3456789A0123B456789A01234B56789A012345B6789A0123456B789A01234567B89A0…

Windows

522,736,433windows of 12 consecutive letters
=479,001,600distinct permutations
+177,386repeated permutations
+43,557,447windows 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,430
4476
5620
61,021
751
836
931
1012
115
120

How it was found

From the submitter

Same closed trails as Jakub Halfar's 522,736,969 word (Jay Pantone's construction on Halfar's n = 12 selection E); only the order and cuts were changed, by running Halfar's published search tools (trailsearch, kick.sh, segins_ils) for many hours starting from his published plan, with Claude (Opus 5.5) in Claude Code.

Download

Learn about the Detour file format

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