Fastest sorting network $D(2)$

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

The smallest depth, or number of parallel steps, of 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.

Date Bound Discovery Best evidence
undated $\ge 1$ Trivial or easy according to the secondary source. Lean proof
Certificate sorting-network-depth-2-lower-1, submitted by daniel-munro, 2026-11-11
undated $\le 1$ Trivial or easy according to the secondary source. Checked construction
Certificate sorting-network-depth-2-upper-1, submitted by daniel-munro, 2026-11-11
[construction from B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, https://bertdobbelaere.github.io/sorting_networks.html (page updated 2026-10-10, retrieved 2026-11-11).]