Smallest sorting network $S(2)$

Sorting network on 2 inputs with 1 comparator in 1 step, drawn as 2 horizontal wires joined by vertical comparators

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

Value: $1$ 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.