Fastest sorting network $D(11)$

Sorting network on 11 inputs with 35 comparators in 8 steps, drawn as 11 horizontal wires joined by vertical comparators

The smallest depth, or number of parallel steps, of a sorting network on $11$ inputs.

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

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.