One can actually show that dv($\kappa$) = $2^{<\kappa}$ outright. Suppose $D$ is aany dense subset of $2^{\kappa}$ (orone may take $2^{<\kappa}$$D \subseteq B(\kappa)$, asif preferred). I'll argue that $D$ must have size at least $2^{<\kappa}$, which is sufficient for the claim. If $r \in B(\kappa)$ is a bounded subset ofFor any sequence $\kappa$$r \in 2^{<\kappa}$, then (viewing $r$ as a characteristic function) let $\alpha_r$ be the least ordinal s.t. $\forall \beta \geq \alpha_r$, $r(\beta)=0$denote its length. WeOne may think of $r$ as identifying an interval in $L(\kappa)$, namely the set of all points beginning with the sequenceinterval $r \upharpoonright \alpha_r$$I_r = \{x \in 2^{\kappa} \, : \, x \upharpoonright \alpha_r = r\}$. Since $D$ is dense in $2^{\kappa}$, there must be $x \in D$ that hits this interval$I_r$, i.e. some $x \upharpoonright \alpha_r = r \upharpoonright \alpha_r$$x$ beginning with the sequence $r$. This shows that if we let $D'$ be the collection of all initial segments of elements of $D$, then $D' = 2^{<\kappa}$. But $|D'| \leq \kappa \cdot |D| = |D|$ which gives $2^{<\kappa} \leq |D|$.