Foil diagrams maximize trefoil descendants among minimal prime diagrams

Let $n$ be odd with $n\geq 3$. A minimal prime free knot diagram is a minimal free knot diagram representing a prime knot, and a trefoil descendant is a resultant trefoil obtained by assigning its crossings. Foil trefoil-maximality conjecture. Among all minimal prime free knot diagrams with $n$ and $n+1$ crossings, the foil knot with $n$ crossings has the most trefoil descendants. The preceding results establish asymptotic behavior for foil resultants, but the source gives no proof or resolution of this extremal claim.