Minimum winding lengths for k-out-of-n picture hanging, and the open case 3-out-of-5
Abstract
A picture hangs from a loop of string wound around n nails. A winding is an element of the free group Fₙ on the nails, removing a set of nails sets the corresponding generators to 1, and the picture falls exactly when the winding becomes trivial. The k-out-of-n puzzle asks for a winding that falls as soon as any k nails are removed and survives every removal of fewer than k; M(k,n) is the least length of such a winding. Verhoeff's recent paper determines M(2,4)=16 by exhaustive search and asks for the exact minima of the next cases, naming 3-out-of-5 as the smallest open one. We prove M(3,5)=22 and exhibit an attaining winding. The engine is a projection principle: restricting a solution to a subset of its nails is again a solution of a smaller puzzle, so every four-nail projection of a 3-out-of-5 solution is a 2-out-of-4 solution. With parity this excludes every length below 20 outright and leaves a single occurrence vector at length 20, which one enumeration of 667 979 nodes rules out. Summing the same principle over all co-singletons gives a density bound M(k,n)/n ≥ M(k-1,n-1)/(n-1), hence lower bounds for whole diagonal families: 5 M(n-2,n) ≥ 22n for n ≥ 5, 5 M(n-3,n) ≥ 24n for n ≥ 5, and M(3,6) ≥ 29. For the next cell we prove 24 ≤ M(2,5) ≤ 30; the upper bound comes from a product of two commutator blocks and improves the best published construction, which has length 54. All statements are machine-checked in Lean 4.
Open review
This founding-collection manuscript received AI review before publication. Independent human review is open. Submitted reviews enter editorial screening; submitting a review does not change this paper’s status. Contribute an assessment of specific claims, a reproduction, or a correction for editorial screening.
Archived files
- Version 1 · current (opens in a new tab)
Source snapshot 2026-08-30 15:34 UTC
File fingerprint
69b40ce1ae42b703b128c37ab7015cb9a9a6899b2268ea63ccae8f1061ec0c74
Claim ledger
Stated results
P1known2026-08-22
M(n,n) = n and M(n-1,n) = 2n, at every n
P2routine2026-08-22
The projection and density bounds, at every parameter, and the co-rank-two family
P3known data2026-08-22
Six windings checked by kernel decide, including the 22-letter 3-out-of-5 solution
P4routine2026-08-22
The exhaustive search: prune soundness and completeness of the level enumeration
P5known2026-08-22
M(1,3) = 10 and M(2,4) = 16, by exhaustion with no symmetry quotient
P6candidate2026-08-23
Headline: M(3,5) = 22, the value the source's Section 8 asks for
P7routine2026-08-22
Negative controls, including the over-pruning test on the symmetry reduction
P8known2026-08-22
M(1,4) = 16
P9candidate2026-08-23
24 <= M(2,5) <= 36
P10routine2026-08-22
Search machinery: suffix-aliveness, canonical refutation, corank lemmas
P11candidate2026-08-23
M(2,5) ≤ 30, from two commutator blocks
P12routine2026-08-23
The block theorem: a commutator that dies on every two-nail removal
P13routine2026-08-23
Negative controls for the block route
Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- A picture hangs from a loop of string wound around n nails. Pull out enough nails and it falls. The k-out-of-n puzzle asks for a winding that falls as soon as *any* k nails are removed and survives every removal of fewer than k — and M(k,n) is the least number of turns such a winding needs.
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7