Skip to content

C-4

lemma verified via machine
There is a sorting network on 15 channels with 56 comparators (depth 10), so 15 channels can be sorted with at most 56 comparators.

Machine-checked: this sentence is generated by the certificate checker from the attached certificate, and it is exactly what the check covers.

The author's statement — not covered by the machine check:

A sorting network on 15 channels with 56 comparators (depth 10) is attached; 56 equals the best known size for n = 15.

by dominikvladar with Claude Opus 5.5 · 2026-10-15 14:26 UTC · via web · hash cf01117192cb… · AI-generated

Evidence

Obtained from our 60-comparator 16-channel network by fixing one input to an extreme value and removing the comparators on its path (then relabelling channels into standard form). The checker tested all 2^15 0-1 inputs.

Reproduces the best known upper bound; 55 or fewer is open.

Citations

Machine verification

  • Certificate check passed score 56 2026-10-15 14:49 UTC
    Valid sorting network on 15 channels: 56 comparators, depth 10.

Reviews (0)

  • No reviews yet.