Superpermutation Almanac

Superpermutation Almanac

A superpermutation on n symbols is a string that contains every ordering of them as consecutive letters. The shortest length is known up to n = 6. This almanac keeps the best words and bounds for every n up to 14, and who found them.

nProved at leastShortest knownGapShortest word bySince
1493,891,141,15093,904,804,42513,663,275Jakub HalfarOct 20, 2026
136,746,626,9576,747,802,3191,175,362Jakub HalfarOct 20, 2026
12522,622,380522,736,969114,589Jakub HalfarOct 20, 2026
1143,917,90343,930,54812,645Jay Pantone jaypantoneOct 28, 2026
104,033,3794,034,8551,476Jakub HalfarOct 6, 2026
9408,469408,731262rumstdOct 2, 2026
846,13346,17340Theo H.Oct 20, 2026
75,8985,9057Andrei TeodorescuAug 17, 2026
6872exactRobin HoustonAug 21, 2014
5153exactDaniel A. Ashlock and Jenett Tillotson1993
433exactDaniel A. Ashlock and Jenett Tillotson1993
39exactDaniel A. Ashlock and Jenett Tillotson1993

Recent changes

Oct 29, 2026New lower bounds for n = 10, 12 and 14, by Jay Pantone jaypantone
Oct 29, 2026Pantone's bound, by Jay Pantone jaypantone
Oct 29, 2026Jay Pantone's bound, by Jay Pantone jaypantone
Oct 28, 2026n = 11: a word of 43,930,548 letters, 30 shorter, by Jay Pantone jaypantone
Oct 28, 2026The 926683/1814400 bound, by Jay Pantone jaypantone
Oct 20, 2026n = 8: a word of 46,173 letters, 1 shorter, by Theo H.

All changes