Fastest sorting network $D(24)$
The smallest depth, or number of parallel steps, of a sorting network on $24$ inputs.
Lower bound:
$10$
Literature
Upper bound:
$12$
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 |
|---|---|---|---|
| 1968-04-30 | $\le 15$ | K.E. Batcher, Sorting networks and their applications, AFIPS Spring Joint Computer Conference 32 (1968) 307-314. |
Checked construction
via $\le 12$, sorting-network-depth-24-upper-12 |
| 2015-01-27 | $\ge 10$ | T. Ehlers, M. Müller, New bounds on optimal sorting networks, CiE 2015, LNCS 9136 (2015) 167-176, arXiv:1501.06946. | Literature |
| 2016-09 | $\le 12$ |
T. Ehlers, Merging almost sorted sequences yields a 24-sorter, Information Processing Letters 118 (2017) 17-20.
[via C. Wang, Depth-13 sorting networks for 28 channels, arXiv:2511.04107.] |
Checked construction
Certificate sorting-network-depth-24-upper-12, 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).] |
Other certificates
Certificates that aren't the best evidence for any bound above: other certificates are stronger evidence for the same bounds, or they prove only bounds weaker than any recorded.
- $\ge 5$: sorting-network-depth-24-lower-5, submitted by daniel-munro, 2026-11-11 Weaker than recorded