Fastest sorting network $D(25)$
The smallest depth, or number of parallel steps, of a sorting network on $25$ inputs.
Lower bound:
$10$
Literature
Upper bound:
$13$
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.
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-25-lower-5, submitted by daniel-munro, 2026-11-11 Weaker than recorded