W-0092

A superpermutation on 13 symbols, found by William Echols. It beat the previous record W-0089 by 85 letters and was the record on Nov 9, 2026. The next record W-0094 beat it by 433 letters.

Length: 6,747,801,628
Repeated permutations: 1,797,463
Received: Nov 9, 202608:11:36 UTC

Begins

0123456789ABC0123456789AB0C123456789AB01C23456789AB012C3456789AB0123C456789AB01234C56789AB012345C6789AB0123456C789AB0123…

Windows

	6,747,801,616	windows of 13 consecutive letters
=	6,227,020,800	distinct permutations
+	1,797,463	repeated permutations
+	518,983,353	windows 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.

Weight	Detours
1	0
2	0
3	11,695,530
4	4,076
5	1,515
6	1,241
7	359
8	1,329
9	450
10	645
11	102
12	119
13	4

How it was found

From the submitter

Jakub Halfar's plan for his 6,747,801,798 word, improved by three runs of his unchanged polish.sh (relocate --dpa, loopscan --greedy, segins --or3; 797 → 720 → … → 628). His selection and closed trails are unchanged. Made with Claude Opus 5.5 in Claude Code.

Download

Learn about the Detour file format

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