Embeddings capablities play a vital role in evaluating interconnection networks. Wirelength is an important measure of an embedding. As far as the most versatile architecture hypercube is concerned, only approximate estimates of the wirelength of various embeddings are available. This paper presents an optimal embedding of hypercube into a new architecture called k-cube necklace which minimizes wirelength. In addition this paper gives exact formula of minimum wirelength of hypercube into k-cube necklace and thereby we solve completely the wirelength problem of hypercube into k-cube necklace.