Snub-cube optimality conjecture for spherical codes

Let $\mathcal{C}$ be the set of $24$ vertices of a snub cube, regarded as unit vectors in $\mathbb{R}^3$. Snub-cube optimality conjecture. Three-point bounds prove that $\mathcal{C}$ is an optimal spherical code in three dimensions. The analogous statement is known for the spherical code with $9$ points in $\mathbb{R}^3$, but the $24$-point case remains conjectural in the source.