Fastest sorting network $D(17)$
The smallest depth, or number of parallel steps, of a sorting network on $17$ inputs.
Value: $10$
lower bound
Literature
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 |
| 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 10$, sorting-network-depth-17-upper-10
|
| 2009-03 |
$\le 11$
|
S.W. Al-Haj Baddar, K.E. Batcher, An 11-step sorting network for 18 elements, Parallel Processing Letters 19 (2009) 97-103.
[via T. Ehlers, M. Müller, Faster sorting networks for 17, 19 and 20 inputs, Technical report 1406, Kiel University, 2014, arXiv:1410.2736.]
|
Checked construction
via $\le 10$, sorting-network-depth-17-upper-10
|
| 2013-10-23 |
$\ge 9$
|
D. Bundala, J. Závodný, Optimal sorting networks, LATA 2014, LNCS 8370 (2014) 236-247, arXiv:1310.6271.
[via T. Ehlers, M. Müller, Faster sorting networks for 17, 19 and 20 inputs, Technical report 1406, Kiel University, 2014, arXiv:1410.2736.]
|
Literature
|
| 2014-10-08 |
$\le 10$
|
T. Ehlers, M. Müller, Faster sorting networks for 17, 19 and 20 inputs, Technical report 1406, Kiel University, 2014, arXiv:1410.2736.
|
Checked construction
Certificate sorting-network-depth-17-upper-10,
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).]
|
| 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
|
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.