Smallest sorting network $S(1)$

The smallest number of comparators in a sorting network on $1$ inputs.

Value: $0$ lower bound Lean proof upper bound Checked construction

History

Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.

Date Bound Discovery Best evidence
undated $\ge 0$ Trivial or easy according to the secondary source. Lean proof
Certificate sorting-network-size-1-lower-0, submitted by daniel-munro, 2026-11-11
undated $\le 0$ Trivial or easy according to the secondary source. Checked construction
Certificate sorting-network-size-1-upper-0, submitted by daniel-munro, 2026-11-11