The best known lower bound for the minimal length of superpermutations was originally posted anonymously to 4chan.

The story is told at Mystery Math Whiz and Novelist Advance Permutation Problem, and a publication with a cleaned-up version of the proof is at A lower bound on the length of the shortest superpattern, with "Anonymous 4chan Poster" as the first author. The original 4chan source is archived here.

The best known lower bound for the minimal length of superpermutations was originally posted anonymously to 4chan.

The story is told at Mystery Math Whiz and Novelist Advance Permutation Problem, and a publication with a cleaned-up version of the proof is at A lower bound on the length of the shortest superpattern, with "Anonymous 4chan Poster" as the first author. The original 4chan source is archived here.

The best known lower bound for the minimal length of superpermutations was announced by an anonymous user of a wiki mainly devoted to anime.

The story is told at Mystery Math Whiz and Novelist Advance Permutation Problem, and the publication is at A lower bound on the length of the shortest superpattern, with "Anonymous 4chan Poster" as the first author.

The best known lower bound for the minimal length of superpermutations was originally posted anonymously to 4chan.

The story is told at Mystery Math Whiz and Novelist Advance Permutation Problem, and a publication with a cleaned-up version of the proof is at A lower bound on the length of the shortest superpattern, with "Anonymous 4chan Poster" as the first author. The original 4chan source is archived here.