Erdős Problem 96: linearly many unit distances in convex position

The declaration asserts an asymptotic bound for natural numbers $n$: after casting the supremum of the unit-distance-pair counts over all convexly independent $n$-point sets in the Euclidean plane to $\mathbb{R}$, the function $n\mapsto\maxConvexUnitDistances(n)$ is $O$ of the function $n\mapsto n$ along the filter of sufficiently large natural numbers. Thus there are a constant $C\ge 0$ and a threshold $N$ such that for every natural $n\ge N$, $\maxConvexUnitDistances(n)\le Cn$ (with the supremum defined from the preceding count set, including its natural-number empty-set convention); no bound is required at the finitely many $n<N$, and in particular no separate assertion is made at $n=0$. The theorem body is sorry, so this is an asserted target rather than an established result.