Superpermutation Almanac

Back to n = 13

W-0088

A superpermutation on 13 symbols, found by Jay Pantone. It beat the previous record W-0084 by 22 letters and was the record between Nov 8 and Nov 9, 2026. The next record W-0089 beat it by 63 letters.

Length
6,747,801,776
Repeated permutations
1,797,379
Received
Nov 8, 202623:48:43 UTC
Begins 0123456789ABC0123456789AB0C123456789AB01C23456789AB012C3456789AB0123C456789AB01234C56789AB012345C6789AB0123456C789AB0123…

Windows

6,747,801,764windows of 13 consecutive letters
=6,227,020,800distinct permutations
+1,797,379repeated permutations
+518,983,585windows 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
311,695,158
43,918
51,502
61,231
7339
81,356
9452
10661
1197
12142
1315

How it was found

From the submitter

This word starts from Jakub Halfar's 6,747,801,798-letter word. In fourteen of his blocks I traded rows so that each block frees four trails, and moved those trails to one common insertion point. There the four-trail pieces overlap each other, so the savings from the separate blocks add up. In all, the word is Halfar's with 44 local replacements, 22 letters shorter.

Download

Learn about the Detour file format

Download Detour (.detour) 222.7 kB, or 6.7 GB decoded