The conjecture is not true, as some examples show.
Let $D(p)$ denote your number. For primes $p \equiv 1 \textrm{ mod } 4$, we have $D(29)=8$, $D(37)=37$, $D(41)=121$ while $h(29)=h(37)=h(41)=1$.
For primes $p \equiv 3 \textrm{ mod } 4$, we have $D(23)=3$, $D(31)=9$, $D(43)=211$, $D(47)=695$ while $h(23)=h(31)=3$, $h(43)=1$, $h(47)=5$.
The following Pari/GP script calculates $D(p)$:
D(p)=kronecker(-2,p)*matdet(matrix((p-1)/2,(p-1)/2,j,k,cotan(Pi*j*k/p)))/(2^((p-3)/2)*p^((p-5)/4))
(This is a floating-point computation, but it is easy to be rigorous by replacing the entries of the matrix by algebraic numbers). It seems that $D(p)$ grows fast.